Among the adaptive-grid methods, redistribution and embedding techniques have been the focus of more attention by researchers. Simultaneous or combined adaptive techniques have also been used. This paper describes a combination of adaptive-grid embedding and redistribution methods on semi-structured grids for two-dimensional invisid flows. Since the grid is semi-structured, it is possible to us...

In this paper, a faster method for embedding cryptographic information in the image ispresented by expressing the concept of latent prints (Steganography). Data is encrypted bytwo methods before embedding to increase reliability. Then they are embedded into the imageby a button, a method has been expressed to reduce potential noise impact on the wayinformation is encoded.

Time series forecasting by fuzzy inference systems based on optimal non-uniform attractor embedding in the multidimensional delay phase space is analyzed in this paper. A near-optimal set of time lags is identified by evolutionary algorithms after the optimal dimension of the reconstructed phase space is determined by the FNN (false nearest neighbors) algorithm. The fitness function is construc...

We show that the conjugacy problem in a wreath product A ≀B is uniformTC -Turing-reducible to the conjugacy problem in the factors A and B and the power problem in B. Moreover, if B is torsion free, the power problem for B can be replaced by the slightly weaker cyclic submonoid membership problem for B, which itself turns out to be uniform-TC-Turing-reducible to conjugacy problem in A ≀B if A i...

We show that the Ramsey number is linear for every uniform hypergraph with bounded degree. This is a hypergraph extension of the famous theorem for ordinary graphs which Chvátal et al. showed in 1983. While Cooley et al. showed it for the 2-color case recently and independently from the author, our theorem contains the multicolor case and our proof is simple and provides a stronger embedding le...

Abstract. We prove a compact embedding theorem in a class of spaces of piecewise H functions subordinated to a class of shape regular, but not necessarily quasi-uniform triangulations of a polygonal domain. This result generalizes the Rellich–Kondrachov theorem. It is used to prove generalizations to piecewise functions of nonstandard Poincaré–Friedrichs inequalities. It can be used to prove Ko...

Various languages have been proposed to describe synchronous hardware at an abstract, yet synthesisable level. We propose a uniform framework within which such languages can be developed, and combined together for simulation, synthesis, and verification. We do this by embedding the languages in Lava — a hardware description language (HDL), itself embedded in the functional programming language ...

Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of innnite lattices. In the one-dimensional case, there exist BCA with 11 states which are universal for computation. The Billiard ball model of Margolus is a reversible two-dimensional BCA which is able to simulate any two-register automaton and is thus universal. This simulation is achieved by embedding a logi...

Embedding is of great importance in the applications of parallel computing. Every parallel application has its intrinsic communication pattern. The communication pattern graph is mapped onto the topology of multiprocessor structures so that the corresponding application can be executed. To increase the reliability of parallel applications, fault-tolerant embedding is necessary. In this paper, w...

In this paper we propose an extension of the Scalar-CostaScheme (SCS), called Soft-SCS, which offers better or equal achievable rates than SCS for the AWGN channel. After recalling the principle of SCS we highlight its secure implementations regarding the Watermarked contents Only Attack, and we also describe the relations between the alphabet size and the secure embedding parameters. Since the...