We consider the problem of constructing pseudorandom generators for read-once circuits. We give an explicit construction of a pseudorandom generator for the class of read-once constant depth circuits with unbounded fan-in AND, OR, NOT and generalized modulo m gates, where m is an arbitrary fixed constant. The seed length of our generator is poly-logarithmic in the number of variables and the er...

In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied.  The invariance of the {it logic entropy} of a system  under isomorphism is proved. At the end,  the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...

We introduce Naturalowl, an open-source multilingual natural language generator that produces descriptions of instances and classes, starting from a linguistically annotated ontology. The generator is heavily based on ideas from ilex and m-piro, but it is in many ways simpler and it provides full support for owl dl ontologies with rdf linguistic annotations. Naturalowl is written in Java, and i...

The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata. These sequences are composed of interleaved m-sequences produced by linear structures based on feedback shifts. This profitable characteristic can be used in the cryptanalysis of this generator. In this work we propose an...

Consider the pseudorandom number generator un ≡ un−1 (mod m), 0 ≤ un ≤ m− 1, n = 1, 2, . . . , where we are given the modulus m, the initial value u0 = θ and the exponent e. One case of particular interest is when the modulus m is of the form pl, where p, l are different primes of the same magnitude. It is known from work of the first and third authors that for moduli m = pl, if the period of t...

A known jamming state information (JSI) scheme for a coded frequency-hopped M-ary frequency-shift-keying (FH/MFSK) system under partial-band noise jamming, plus additive white Gaussian noise, utilizes the maximum a posteriori (MAP) rule based on the total energy received in the M-tone signaling bands. It is assumed that the knowledge of partial-band noise jamming fraction is available to the JS...

Given a finite Abelian group A and an integer t, 1 ≤ t ≤ A −1, a subset S of A is called a t-sum generator of A if every element of A can be written as the sum of exactly t distinct elements of S. In this paper we investigate the minimal integer M(t, A) such that every set S ⊆ A of size S > M(t, A) is a t-sum generator of A. The value of M(t, A) is completely determined for groups of even order.

In our project, we propose a novel architecture which generates the test patterns with reduced switching activities. LP-TPG (Test pattern Generator) structure consists of modified low power linear feedback shift register (LP-LFSR), m-bit counter; gray counter, NOR-gate structure and XOR-array. The m-bit counter is initialized with Zeros and which generates 2m test patterns in sequence. The m-bi...

This paper presents a tunable electromagnetic vibration-based micro-generator with closed loop frequency tuning. Frequency tuning is realized by applying an axial tensile force to the micro-generator. A closed-loop frequency tuning system has been developed to control the tuning process so that the generator always operates at the ambient vibration frequency to make the entire process automatic...

We present a new method to study the power generator of pseudorandom numbers modulo a Blum integer m. This includes as special cases the RSA generator and the Blum–Blum–Shub generator. We prove the uniform distribution of these, provided that the period t ≥ m3/4+δ with fixed δ > 0 and, under the same condition, the uniform distribution of a positive proportion of the leftmost and rightmost bits...