A remarkable correlation between chaotic systems and cryptography has been established with sensitivity to initial states, unpredictability, and complex behaviors. In one development, stages of a chaotic stream cipher are applied to a discrete chaotic dynamic system for the generation of pseudorandom bits. Some of these generators are based on 1D chaotic map and others on 2D ones. In the current study, a pseudorandom bit generator (PRBG) based on a new 2D chaotic logistic map is proposed that runs side-by-side and commences from random independent initial states. The structure of the proposed model consists of the three components of a mouse input device, the proposed 2D chaotic system, and an initial permutation (IP) table. Statistical tests of the generated sequence of bits are investigated by applying five evaluations as well as the ACF and NIST. The results of five standard tests of randomness have been illustrated and overcome a value of 0.160 in frequency test. While the run test presents the pass value t0=4.769 and t1=2.929. Likewise, poker test and serial test the outcomes was passed with 3.520 for poker test, and 4.720 for serial test. Finally, autocorrelation test passed in all shift numbers from 1 to 10.
A submoduleA of amodule M is said to be strongly pure , if for each finite subset {ai} in A , (equivalently, for each a ?A) there exists ahomomorphism f : M ?A such that f(ai) = ai, ?i(f(a)=a).A module M is said to be strongly F–regular if each submodule of M is strongly pure .The main purpose of this paper is to develop the properties of strongly F–regular modules and study modules with the property that the intersection of any two strongly pure submodules is strongly pure .
The study presents the modification of the Broyden-Flecher-Goldfarb-Shanno (BFGS) update (H-Version) based on the determinant property of inverse of Hessian matrix (second derivative of the objective function), via updating of the vector s ( the difference between the next solution and the current solution), such that the determinant of the next inverse of Hessian matrix is equal to the determinant of the current inverse of Hessian matrix at every iteration. Moreover, the sequence of inverse of Hessian matrix generated by the method would never approach a near-singular matrix, such that the program would never break before the minimum value of the objective function is obtained. Moreover, the new modification of BFGS update (H-vers
... Show MoreFree Piston Engine Linear Generator (FPELG) is a modern engine and promising power generation engine. It has many advantages compared to conventional engines such as less friction, few numbers of parts, and high thermal efficiency. The cycle-to-cycle variation one of the big challenges of the FPELG because it is influence on the stability and output power of the engine. Therefore, in this study, the effect of ignition time on combustion characteristics is investigated. The single-cylinder FPELG with spark ignition (SI) combustion type by using compressed natural gas (CNG) fuel type was set to run. LabVIEW is used to run the engine and control of input parameters. All experimental data
In this paper, the system of the power plant has been investigated as a special type of industrial systems, which has a significant role in improving societies since the electrical energy has entered all kinds of industries, and it is considered as the artery of modern life.
The aim of this research is to construct a programming system, which could be used to identify the most important failure modes that are occur in a steam type of power plants. Also the effects and reasons of each failure mode could be analyzed through the usage of this programming system reaching to the basic events (main reasons) that causing each failure mode. The construction of this system for FMEA is dependi
... Show More
