عباس فاضل مهدي وهب

we improved one of the most important methods used in the field of cryptography the asymmetric, which uses a pair of keys that called RSA (Rivest –Shamir– Adleman), by multiplying the number of (public, private) keys to some extend "k" in the cryptosystem process to protecting information against any broke attempts to known the data contents by transforming it into an unintelligible and secure format that allows information to be kept secret and as well as how to apply proposal modified on set of digital gray images using Matlab language, The proposed system offers a more robust encryption method than traditional encryption and data integrity during the decryption process

Linear programming: It is one of the best mathematical methods in scientific management that helps to make the best decisions and is part of the Operations Research and developed from mathematical programming. Linear programming helps solve problems such as transportation, logistics, agriculture, locations, services, investment, industries, Production lines and linear programming reduce the costs of each and maximize the profits, that is, the outputs must be consistent with the aspirations of the company and its objectives. This problem-solving is based on minimizing costs and maximizing earning limitation by constraints are available resources such as time, staff, raw materials, money, space, and quantities. In this paper, I introduced to study Triangular Fuzzy Number and Operation Research, where the found a new method of operations Addition and Multiplication of Triangular Fuzzy Number and their application on the numerical example and simplex method to find optimal solution for triangular fuzzy linear programming problem .the results were accurate and better than the classical method.

Data science has become important as the new way in the new business area, and the knowledge nowadays represents as a critical function in the whole of all sciences of different organizations, so these two factors (data science and knowledge) are becoming a higher priority of the most job wanted and social services in the world. So nowadays different enterprise jobs are related to knowledge extracting. In this paper will present how to study and analysis of data that related to social services which are criminal data. The study consists of different mining tools by using algorithms like classifications and clustering techniques. This paper presents different crimes with related information distributed as day, months, years and locations. Different crimes are classified into sets according to (day, month, and year) to get information when the crime happens (knowledge) in which type of crime with which time it occurred, and finally different clusters of the logged data using k-means algorithms. Different tools and software are used like WEKA, XLSTAT and statistical excel to apply data mining algorithms to the logged data.

The proposed method presents two efficient measures for face recognition. The approach is based on a proper weighting of (correlation coefficients) between corresponding face regions. The regions are a right eye, left eye, nose, and mouth as defined by Viola-Jones Algorithm. In addition, the measures have incorporated the holistic face region with a maximal weight. The recognition performance measure used is the distance between the reference image and the next confusing image in the database, where a better measure gives a bigger distance, hence better confidence in the recognition process. The proposed measures have been compared with structural similarity measure (SSIM), where superior performance has been obtained. Illumination adjustment of face images has been considered via differential thresholding that may enhance recognition. The recognition process assumed one face image as a reference image to be recognized in a database that includes the same reference person but with a different face pose (image).

With the critical issues for hard real time operating system (RTOS), many protocols had been developed to manage the task's locking process to the shared resources, especially on the multi-core and distributed platforms. with this orientation, this paper presents a new protocol called “Shift-Exchange Synchronization Protocol in Hard Real Time System (SESP)”, this protocol is proposed to be a locking protocol in hard real time operating system, that could work on multi-core and distributed systems, where this protocol developed three arguments; first: design a new priority instead of the original priority of tasks, called weight priority, where this priority has been deduced from many task's properties such as; the original priority, blocking times of task, the acquiring times of task to the shared resources, ...etc. Second, design a new queue called weight queue with mechanism called high weight fist serve (HWFS), this queue deigned to be compatible with weight priority. Third, design a new synchronization and scheduling mechanism to lock the shared resource called shift exchange mechanism. The first and second arguments are a pre-process for the task to be ready for the third argument. The proposed protocol addressed many problems (exist in ancient locking protocols) such as “resources nested”, and “dead lock”, add to that this protocol shows outperform comparing to some of previously developed protocols by experimental works.