We consider constant depth circuits augmented with few modular, or more generally, arbitrary symmetric gates. We prove that circuits augmented with o(log n) symmetric gates must have size n n) to compute a certain (complicated) function in ACC. This function is also hard on the average for circuits of size n logn augmented with o(log n) symmetric gates, and as a consequence we can get a pseudor...

This work shows that the cryptanalysis of the shrinking generator requires fewer intercepted bits than that indicated by the linear complexity. Indeed, whereas the linear complexity of shrunken sequences is between A·2(S−2) and A·2(S−1), we claim that the initial states of both component registers are easily computed with less than A · S shrunken bits. Such a result is proven thanks to the defi...

In order to accurately calculate the generator loss, point out the distribution of generator loss and reveal the effect of harmonic magnetic field and other factors to generator loss. In this paper, a 6.5 MW doublyfed hydro-generator was taken as an example. Time–stepping finite element method was adopted for the numerical simulation of electromagnetic field in generator, and Matlab was used fo...

Abstract In this paper, we study the generalized order- Jacobsthal sequences modulo for and the generalized order-k Jacobsthal-Padovan sequence modulo for . Also, we define the generalized order-k Jacobsthal orbit of a k-generator group for and the generalized order-k Jacobsthal-Padovan orbit a k-generator group for . Furthermore, we obtain the lengths of the periods of the generalized order-3 ...

The switched reluctance motor is a singly excited, doubly salient machine which can be used in generation mode by selecting the proper firing angles of the phases. Due to its robustness, it has the potential and the ability to become one the generators to be used in harsh environment. This paper presents an energy conversion by a Switched Reluctance Generator (SRG) when bifilar converter ci...

We construct a pseudorandom generator which uses O(log m + log d + log 3=2 1==) bits and approximates the volume of any combinatorial rectangle in f1; : : : ; mg d to within error. O(log m + log d + log 2 1==) bits. For a subclass of rectangles with at most t log 1== nontriv-ial dimensions and each dimension being an interval, we also give a pseudorandom generator using O(log log d + log 1== lo...