In this paper, the concept of a hyper structure KU-algebra is introduced and some related properties are investigated. Also, some types of hyper KU-algebras are studied and the relationship between them is stated. Then a hyper KU-ideal of a hyper structure KU-algebra is studied and a few properties are obtained. Furthermore, the notion of a homomorphism is discussed.

In this study, we present a new steganography method depend on quantizing the perceptual color spaces bands. Four perceptual color spaces are used to test the new method which is HSL, HSV, Lab and Luv, where different algorithms to calculate the last two-color spaces are used. The results reveal the validity of this method as a steganoic method and analysis for the effects of quantization and stegano process on the quality of the cover image and the quality of the perceptual color spaces bands are presented.

    In this paper, we introduce the concept of s.p-semisimple module. Let S be a semiradical property, we say that a module M is s.p - semisimple if for every submodule N of M, there exists a direct summand K of M such that K ≤ N and N / K has S. we prove that a module M is s.p - semisimple module if and only if for every submodule A of M, there exists a direct summand B of M such that A = B + C and C has S. Also, we prove that for a module M is s.p - semisimple if and only if for every submodule A of M, there exists an idempotent e ∊ End(M) such that e(M) ≤ A and (1- e)(A) has S. 

In this paper we find the exact solution of Burger's equation after reducing it to Bernoulli equation. We compare this solution with that given by Kaya where he used Adomian decomposition method, the solution given by chakrone where he used the Variation iteration method (VIM)and the solution given by Eq(5)in the paper of M. Javidi. We notice that our solution is better than their solutions.

The huge evolving in the information technologies, especially in the few last decades, has produced an increase in the volume of data on the World Wide Web, which is still growing significantly. Retrieving the relevant information on the Internet or any data source with a query created by a few words has become a big challenge. To override this, query expansion (QE) has an important function in improving the information retrieval (IR), where the original query of user is recreated to a new query by appending new related terms with the same importance. One of the problems of query expansion is the choosing of suitable terms. This problem leads to another challenge of how to retrieve the important documents with high precision, high recall

Due to the popularity of radar, receivers often “hear” a great number of other transmitters in
addition to their own return merely in noise. The dealing with the problem of identifying and/or
separating a sum of tens of such pulse trains from a number of different sources are often received on
the one communication channel. It is then of interest to identify which pulses are from which source,
based on the assumption that the different sources have different characteristics. This search deals with a
graphical user interface (GUI) to generate the radar pulse in order to use the required radar signal in any
specified location.

            In this paper, new method have been investigated using evolving algorithms (EA's) to cryptanalysis one of the nonlinear stream cipher cryptosystems which depends on the Linear Feedback Shift Register (LFSR) unit by using cipher text-only attack. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) which are used for attacking one of the nonlinear cryptosystems called "shrinking generator" using different lengths of cipher text and different lengths of combined LFSRs. GA and ACO proved their good performance in finding the initial values of the combined LFSRs. This work can be considered as a warning for a stream cipher designer to avoid the weak points, which may be f

عند إطلالتنا على هذا البلد العربي لابد من التقصي ولو بعجاله عن اقتصاده وهو الاهم باعتبار ان الاقتصاد هو شريان الحياة لأي أمة فلا غنى ولا تهاون في نفس الوقت عن هذا الجانب المهم الذي يرتبط مدى تطوره بتطور البلد وهذا الاخير مرتبط بما متوفر لديه من موارد بشريه ومادية وان تفاوتت النسبة بينها فلا ضير في ذلك فالاهم هو وجود الموجه والمخطط بالاتجاه الصحيح نحو الاستغلال الامثل لهذه الموارد
(وان قلّتْ) وبالتالي

Given a binary matrix, finding the maximum set of columns such that the resulting submatrix has the Consecutive Ones Property (C1P) is called the Consecutive Ones Submatrix (C1S) problem. There are solution approaches for it, but there is also a room for improvement. Moreover, most of the studies of the problem use exact solution methods. We propose an evolutionary approach to solve the problem. We also suggest a related problem to C1S, which is the Consecutive Blocks Minimization (CBM). The algorithm is then performed on real-world and randomly generated matrices of the set covering type.