This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...

It is shown (Proposition (3.9)) that the asymptotic information bound which is valid for the estimation of a parameter in the structure (mixture) model remains valid in the functional model (incidental nuisance parameters) if only perturbation symmetric estimators (Deenition (3.6)) are admitted. Perturbation symmetry is a property which is closely related to permutation symmetry (Theorem (3.4))...

We show how to onstru t pseudo-random permutations that satisfy a ertain y le restri tion, for example that the permutation be y li ( onsisting of one y le ontaining all the elements) or an involution (a self-inverse permutation) with no xed points. The onstru tion an be based on any (unrestri ted) pseudo-random permutation. The resulting permutations are de ned su in tly and their evaluation a...

Tensor train (TT) decomposition is a powerful representation for high-order tensors, which has been successfully applied to various machine learning tasks in recent years. However, since the tensor product is not commutative, permutation of data dimensions makes solutions and TT-ranks of TT decomposition inconsistent. To alleviate this problem, we propose a permutation symmetric network structu...

Various topologies for representing 3D protein structures have been advanced for purposes ranging from prediction of folding rates to ab initio structure prediction. Examples include relative contact order, Delaunay tessellations, and backbone torsion angle distributions. Here, we introduce a new topology based on a novel means for operationalizing 3D proximities with respect to the underlying ...

In Homogeneous permutations, Peter Cameron [Electronic Journal of Combinatorics 2002] classified the homogeneous permutations (homogeneous structures with 2 linear orders), and posed the problem of classifying the homogeneous ndimensional permutation structures (homogeneous structures with n linear orders) for all finite n. We prove here that the lattice of ∅-definable equivalence relations in ...

We study the bigraded vector space structure of Landau–Ginzburg orbifolds with permutation symmetries variables. calculate formula Poincaré polynomial for a certain loop orbifoldized by semidirect product diagonal symmetry group and cyclic check that generalization Berglund–Hübsch transpose gives mirror symmetric pairs these cases.

We consider the function m[k](q) that counts the number of cycle permutations of a finite field Fq of fixed length k such that their permutation polynomial has the smallest possible degree. We prove the upper–bound m[k](q) ≤ (k−1)!(q(q−1))/k for char(Fq) > e(k−3)/e and the lower–bound m[k](q) ≥ φ(k)(q(q−1))/k for q ≡ 1 (mod k). This is done by establishing a connection with the Fq–solutions of ...