We prove two kinds of Lyapunov type inequalities for pseudo-integrals. One discusses pseudo-integrals where pseudo-operations are given by a monotone and continuous function g. The other one focuses on the pseudo-integrals based on a semiring 0; 1 ½ Š; sup; ð Þ , where the pseudo-multiplication is generated. Some examples are given to illustrate the validity of these inequalities. As a generali...

Yu. I. Manin conjectured that the maximal abelian extensions of real quadratic number fields are generated by pseudo-lattices with multiplication. We prove this conjecture using theory measured foliations on modular curves.

from that of Gaussian. It may be noted that this characteristic of pseudo-error detectors was predicted by G ~ o d i n g (~) and may now be regarded as being confirmed.' Scrutiny of Figures 8, 9 and 10 indicates that the achieved stability of the multiplication factor is sufficient to estimate BER from the pseudo-error rate with an accuracy of about a factor of 10 in BER. In addition, the estim...

In this paper, persents the definitions of strongly prime ideal, strongly prime N-subgroup, Pseudo-valuation near ring and Pseudo-valuation N-group. Some of their properties have also been proven by theorems. Then it is shown that, if N be near ring with quotient near-field K and P be a strongly prime ideal of near ring N, then is a strongly prime ideal of ‎‎, for any multiplication subset S of...

The paper presents a method for sparse matrix multiplication on a DSP processor. Its high efficiency is a consequence of the proposed pseudo-random data memory access and parallelism of the multifunctional instructions of a DSP. Sparse matrix multiplication is implemented as linear expanded DSP code automatically generated by specially designed program. The method is applied to predictive vecto...

We present pseudo-potential coefficients for the first two rows of the periodic table. The pseudo potential is of a novel analytic form, that gives optimal efficiency in numerical calculations using plane waves as basis set. At most 7 coefficients are necessary to specify its analytic form. It is separable and has optimal decay properties in both real and Fourier space. Because of this property...

The author’s modification of Eilenberg theorem relates the so-called conjunctive varieties of regular languages with pseudovarieties of idempotent semirings. Recent results by Pastijn and his co-authors lead to the description of the lattice of all (pseudo)varieties of idempotent semirings with idempotent multiplication. We describe here the corresponding 78 varieties of languages.

Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pseudo-random bit generator. This new generator outputs n− c− 1 bits per exponentiation with a c-bit exponent. Using typical parameters, n = 1024 and c = 160, this yields roughly 860 pseudo-random bits per small exponent...

A topological description of various generalized function algebras over corresponding basic locally convex algebras is given. The framework consists of algebras of sequences with appropriate ultra(pseudo)metrics defined by sequences of exponential weights. Such an algebra with embedded Dirac’s delta distribution induces discrete topology on the basic space. This result is in analogy to Schwartz...

A topological description of various generalized function algebras over corresponding basic locally convex algebras is given. The framework consists of algebras of sequences with appropriate ultra(pseudo)metrics defined by sequences of exponential weights. Such an algebra with embedded Dirac’s delta distribution induces discrete topology on the basic space. This result is in analogy to Schwartz...