Network embedding methods have garnered increasing aŠention because of their e‚ectiveness in various information retrieval tasks. Œe goal is to learn low-dimensional representations of vertexes in an information network and simultaneously capture and preserve the network structure. Critical to the performance of a network embedding method is how the edges/vertexes of the network is sampled for ...

Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [5, 19] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...

it has been proved that sphericity testing for digraphs is an np-complete problem. here, we investigate sphericity of 3-connected single source digraphs. we provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $o(n)$ time.

In this paper we study block diagonal preconditioners for mixed systems derived from the Dirichlet problems for second order elliptic equations. The main purpose is to discuss how an embedding of the original computational domain into a simpler extended domain can be utilized in this case. We show that a family of uniform preconditioners for the corresponding problem on the extended, or ctitiou...

In this paper we study block diagonal preconditioners for mixed systems derived from the Dirichlet problems for second order elliptic equations The main purpose is to discuss how an embedding of the original computational domain into a simpler extended domain can be utilized in this case We show that a family of uniform preconditioners for the corresponding problem on the extended or ctitious d...

Content-adaptive embedding is widely believed to improve steganographic security over uniform random embedding. However, such security claims are often based on empirical results using steganalysis methods not designed to detect adaptive embedding. We propose a framework for content-adaptive embedding in the case of imperfect steganography. It formally defines heterogeneity within the cover as ...

This paper is devoted to embedding theorems for the space Kθ, where θ is an inner function in the unit disc D. As we will see soon, the question of embedding of Kθ into L2(μ) is virtually equivalent to the boundedness of two-weight Hilbert transform. This makes the embedding question quite difficult (the general bondedness criteria of Hunt-Muckenhoupt-Wheeden type for two weight Hilbert transfo...

Making use of the presentation of quasi-uniform spaces as generalised enriched categories, and employing in particular the calculus of modules, we define the Yoneda embedding, prove a (weak) Yoneda Lemma, and apply them to describe the Cauchy completion monad for quasi-uniform spaces.

introduction:in this study, ecg signals have been embedded into medical images to create a novel blind watermarking method. the embedding is done when the original image is compressed using the ezw algorithm. the extraction process is performed at the decompression time of the watermarked image. materials and methods: the multi-resolution watermarking with a secret key algorithm developed in th...