Let v,w be in nite 0-1 sequences, and m̃ a positive integer. We say that w is m̃-embeddable in v, if there exists an increasing sequence (ni : i ≥ 0) of integers with n0 = 0, such that 1 ≤ ni − ni−1 ≤ m̃, w(i) = v(ni ) for all i ≥ 1. Let X and Y be coin-tossing sequences. We will show that there is an m̃ with the property that Y is m̃-embeddable into X with positive probability. This answers a quest...

An embedding of one metric space (X, d) into another (Y, ρ) is an injective map f : X → Y . The central genre of problems in the area of metric embedding is finding such maps in which the distances between points do not change “too much”. Metric Embedding plays an important role in a vast range of application areas such as computer vision, computational biology, machine learning, networking, st...

we present a steganalysis scheme for lsb matching steganography based on feature vectors extracted from integer wavelet transform (iwt). in integer wavelet decomposition of an image, the coefficients will be integer, so we can calculate co-occurrence matrix of them without rounding the coefficients. before calculation of co-occurrence matrices, we clip some of the most significant bitplanes of ...

we will examine a family of numerical semigroups embedding dimension three, such that S_u=< 8,8u+2,8u+9> where u >=1, is integer . Also, give some relationsbetween these and their Arf closure.

Predicting a transition point in behavioral data should take into account the complexity of the signal being influenced by contextual factors. In this paper, we propose to analyze changes in the embedding dimension as contextual information indicating a proceeding transitive point, called OPtimal Embedding tRANsition Detection (OPERAND). Three texts were processed and translated to time-series ...