956 resultados para Keystream generators
Resumo:
In this paper, a Radial Basis Function neural network based AVR is proposed. A control strategy which generates local linear models from a global neural model on-line is used to derive controller feedback gains based on the Generalised Minimum Variance technique. Testing is carried out on a micromachine system which enables evaluation of practical implementation of the scheme. Constraints imposed by gathering training data, computational load, and memory requirements for the training algorithm are addressed.
Resumo:
This paper presents a new method for calculating the individual generators' shares in line flows, line losses and loads. The method is described and illustrated on active power flows, but it can be applied in the same way to reactive power flows.
Resumo:
This paper presents a predictive current control strategy for doubly-fed induction generators (DFIG). The method predicts the DFIG’s rotor current variations in the synchronous reference frame fixed to the stator flux within a fixed sampling period. This is then used to directly calculate the required rotor voltage to eliminate the current errors at the end of the following sampling period. Space vector modulation is used to generate the required switching pulses within the fixed sampling period. The impact of sampling delay on the accuracy of the sampled rotor current is analyzed and detailed compensation methods are proposed to improve the current control accuracy and system stability. Experimental results for a 1.5 kW DFIG system illustrate the effectiveness and robustness of the proposed control strategy during rotor current steps and rotating speed variation. Tests during negative sequence current injection further demonstrate the excellent dynamic performance of the proposed PCC method.
Resumo:
A series of ultra-lightweight digital true random number generators (TRNGs) are presented. These TRNGs are based on the observation that, when a circuit switches from a metastable state to a bi-stable state, the resulting state may be random. Four such circuits with low hardware cost are presented: one uses an XOR gate; one uses a lookup table; one uses a multiplexer and an inverter; and one uses four transistors. The three TRNGs based on the first three circuits are implemented on a field programmable gate array and successfully pass the DIEHARD RNG tests and the National Institute of Standard and Technology (NIST) RNG tests. To the best of the authors' knowledge, the proposed TRNG designs are the most lightweight among existing TRNGs.
Resumo:
The equiprobability bias is a tendency for individuals to think of probabilistic events as 'equiprobable' by nature, and to judge outcomes that occur with different probabilities as equally likely. The equiprobability bias has been repeatedly found to be related to formal education in statistics, and it is claimed to be based on a misunderstanding of the concept of randomness.
Resumo:
A new method is presented for transmission loss allocation based on the separation of transmission loss caused by load and the loss due to circulating currents between generators. The theoretical basis for and derivation of the loss formulae are presented using simple systems. The concept is then extended to a general power system using the Ybus model. Details of the application of the proposed method to a typical power system are presented along with results from the IEEE 30 bus test system. The results from both the small system and the standard IEEE test system demonstrate the validity of the proposed method.
Resumo:
Locomotion has been a major research issue in the last few years. Many models for the locomotion rhythms of quadrupeds, hexapods, bipeds and other animals have been proposed. This study has also been extended to the control of rhythmic movements of adaptive legged robots. In this paper, we consider a fractional version of a central pattern generator (CPG) model for locomotion in bipeds. A fractional derivative D α f(x), with α non-integer, is a generalization of the concept of an integer derivative, where α=1. The integer CPG model has been proposed by Golubitsky, Stewart, Buono and Collins, and studied later by Pinto and Golubitsky. It is a network of four coupled identical oscillators which has dihedral symmetry. We study parameter regions where periodic solutions, identified with legs’ rhythms in bipeds, occur, for 0<α≤1. We find that the amplitude and the period of the periodic solutions, identified with biped rhythms, increase as α varies from near 0 to values close to unity.
Resumo:
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines that no such elements exist. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d = [K : E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be O_L, the ring of algebraic integers of L, and A to be the associated order A(E[G];O_L) \subseteq E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K = E = \IQ.