A Z-linkless embedding of a graph is an embedding in 3-space such that each pair of disjoint circuits has zero linking number. In this paper we present polynomial-time algorithms to compute a Z-linkless embedding of a graph provided the graph has one and to test whether an embedding of a graph is Z-linkless or not.

Data embedding mechanism used for authentication applications should be secure in order to prevent an adversary from forging the embedded data at his/her will. Meanwhile, semi-fragileness is often preferred to allow for distinguishing content changes versus non-content changes. In this paper, we focus on jointly enhancing the robustness and security of the embedding mechanism, which can be used...

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 ...

In this paper, we propose a new embedding method for reversible data hiding. Unlike traditional methods using differenceexpansion or feature modifications, we propose an evenand odd-numberbased embedding method. This method is implemented in a prediction error image. The experimental results show that our embedding method can achieve satisfactory embedding capacity and image quality.

We study the topmost weight matrix of neural network language models. We show that this matrix constitutes a valid word embedding. When training language models, we recommend tying the input embedding and this output embedding. We analyze the resulting update rules and show that the tied embedding evolves in a more similar way to the output embedding than to the input embedding in the untied mo...

We classify and explicitly construct the embedding diagrams of Verma modules over the N =2 supersymmetric extension of the Virasoro algebra. The essential ingredient of the solution consists in drawing the distinction between two different types of submodules appearing in N = 2 Verma modules. The problem is simplified by associating to every N=2 Verma module a relaxed Verma module over the affi...

An explicit global and unique isometric embedding into hyperbolic 3-space, H, of an axisymmetric 2-surface with Gaussian curvature bounded below is given. In particular, this allows the embedding into H of surfaces of revolution having negative, but finite, Gaussian curvature at smooth fixed points of the U(1) isometry. As an example, we exhibit the global embedding of the Kerr-Newman event hor...

Circulant matrix embedding is one of the most popular and efficient methods for the exact generation of Gaussian stationary univariate series. Although the idea of circulant matrix embedding has also been used for the generation of Gaussian stationary random fields, there are many practical covariance structures of random fields where classical embedding methods break down. In this work, we pro...

Let ∆ be a thick dual polar space and F a convex subspace of diameter at least 2 of ∆. Every hyperplane G of the subgeometry F̃ of ∆ induced on F will give rise to a hyperplane H of ∆, the so-called extension of G. We show that F and G are in some sense uniquely determined by H. We also consider the following problem: if e is a full projective embedding of ∆ and if eF is the full embedding of F̃ ...