We analyze the error of a finite element domain embedding method for elliptic equations on a domain ω with curved boundary. The domain is embedded in a rectangular domain R on which uniform mesh and linear continuous elements are employed. The numerical scheme is based on an extension of the differential equation from ω to R by regularization with a small parameter (for Neumann and Robin proble...

We review 28 uniform partitions of 3-space in order to find out which of them have graphs (skeletons) embeddable isometrically (or with scale 2) into some cubic lattice Zn. We also consider some relatives of those 28 partitions, including Achimedean 4-polytopes of Conway-Guy, non-compact uniform partitions, Kelvin partitions and those with unique vertex figure (i.e. Delaunay star). Among last o...

in this article, by using chebyshev’s polynomials and chebyshev’s expansion, we obtain the best uniform polynomial approximation out of p2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

We study the computational complexity of the Word Problem (WP) in free solvable groups Sr,d, where r ≥ 2 is the rank and d ≥ 2 is the solvability class of the group. It is known that the Magnus embedding of Sr,d into matrices provides a polynomial time decision algorithm for WP in a fixed group Sr,d. Unfortunately, the degree of the polynomial grows together with d, so the uniform algorithm is ...

Information security has become a cause of concern because of the electronic eavesdropping. Capacity, robustness and invisibility are important parameters in information hiding and are quite difficult to achieve in a single algorithm. This paper proposes a novel steganography technique for digital color image which achieves the purported targets. The professed methodology employs a complete ran...

Goemans showed that any n points x1, . . . xn in d-dimensions satisfying l 2 2 triangle inequalities can be embedded into l1, with worst-case distortion at most √ d. We extend this to the case when the points are approximately low-dimensional, albeit with average distortion guarantees. More precisely, we give an l2-to-l1 embedding with average distortion at most the stable rank, sr (M), of the ...

Steganography is a concept of hiding or concealing data in a cover object while the sender and receiver are able to communicate within themselves. The security of data has been prime concern for the people from past and many research works are still going to find out convenient methods to safeguard the communication between people. Intruder can easily detect the information in the links as inte...

1. Dynamical embedding 1.1. Uniformly distributed sequence generators 1.2. Weak mixing relative to a partition 1.3. Construction of P-mixing transformations 1.4. Well distributed sequences 1.5. A theorem in Diophantine approximation 1.6. Disjointness in topological dynamics 1.7. Proof of Theorem 1.5.1 1.8. Quasiregular points and generic points 1.9. Normal sequences and collectives 1.10. Disjoi...

A novel quantization watermarking scheme is presented in this paper, which is established following the feature modulation watermarking model. In this scheme, a feature signal is achieved by computing the normalized correlation (NC) between the host signal and a random signal. Information modulation is carried out on the generated NC by selecting a codeword from the codebook related with the em...