The duo module plays an important role in the module theory. Many researchers generalized this concept such as Ozcan AC, Hadi IMA and Ahmed MA. It is known that in a duo module, every submodule is fully invariant. This paper used the class of St-closed submodules to work out a module with the feature that all St-closed submodules are fully invariant. Such a module is called an Stc-duo module. This class of modules contains the duo module properly as well as the CL-duo module which was introduced by Ahmed MA. The behaviour of this new kind of module was considered and studied in detail,for instance, the hereditary property of the St-duo module was investigated, as the result; under certain conditions, every St-cl

يهدف هذا البحث إلى بيان أن الأديان في مقاصدها وأصولها وفروعها تلتقي على التسامح المؤدي إلى التعايش السلمي بين مجموعة مختلفة في الدين أو اللون أو القومية أو الفكر من خلال إعطاء حرية التعبير والفكر والتمذهب والعقيدة لكل إنسان وإن كان مخالفا معنا؛ حيث تفيذ نصوصها الأحقاد والكراهية، وتدعو إلى التأخي بين البشر محققة بذلك التعايش السلمي المنشود، بل وتحض الإنسان على حماية أخيه الإنسان وصيانة حياته وممتلكاته أيا ك

Human posture estimation is a crucial topic in the computer vision field and has become a hotspot for research in many human behaviors related work. Human pose estimation can be understood as the human key point recognition and connection problem. The paper presents an optimized symmetric spatial transformation network designed to connect with single-person pose estimation network to propose high-quality human target frames from inaccurate human bounding boxes, and introduces parametric pose non-maximal suppression to eliminate redundant pose estimation, and applies an elimination rule to eliminate similar pose to obtain unique human pose estimation results. The exploratory outcomes demonstrate the way that the proposed technique can pre

Cryptographic applications demand much more of a pseudo-random-sequence
generator than do most other applications. Cryptographic randomness does not mean just
statistical randomness, although that is part of it. For a sequence to be cryptographically
secure pseudo-random, it must be unpredictable.
The random sequences should satisfy the basic randomness postulates; one of them is
the run postulate (sequences of the same bit). These sequences should have about the same
number of ones and zeros, about half the runs should be of length one, one quarter of length
two, one eighth of length three, and so on.The distribution of run lengths for zeros and ones
should be the same. These properties can be measured determinis

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

To improve the efficiency of a processor in recent multiprocessor systems to deal with data, cache memories are used to access data instead of main memory which reduces the latency of delay time. In such systems, when installing different caches in different processors in shared memory architecture, the difficulties appear when there is a need to maintain consistency between the cache memories of different processors. So, cache coherency protocol is very important in such kinds of system. MSI, MESI, MOSI, MOESI, etc. are the famous protocols to solve cache coherency problem. We have proposed in this research integrating two states of MESI's cache coherence protocol which are Exclusive and Modified, which responds to a request from reading

            Human Interactive Proofs (HIPs) are automatic inverse Turing tests, which are intended to differentiate between people and malicious computer programs. The mission of making good HIP system is a challenging issue, since the resultant HIP must be secure against attacks and in the same time it must be practical for humans. Text-based HIPs is one of the most popular HIPs types. It exploits the capability of humans to recite text images more than Optical Character Recognition (OCR), but the current text-based HIPs are not well-matched with rapid development of computer vision techniques, since they are either vey simply passed or very hard to resolve, thus this motivate that