Digital image started to including in various fields like, physics science, computer science, engineering science, chemistry science, biology science and medication science, to get from it some important information. But any images acquired by optical or electronic means is likely to be degraded by the sensing environment. In this paper, we will study and derive Iterative Tikhonov-Miller filter and Wiener filter by using criterion function. Then use the filters to restore the degraded image and show the Iterative Tikhonov-Miller filter has better performance when increasing the number of iteration To a certain limit then, the performs will be decrease. The performance of Iterative Tikhonov-Miller filter has better performance for less de

Material Requirements Planning System (MRP) is considered as one of the planning and controlling of production and inventory systems which is used to prepare plan of the final production requirements and its parts of subcomponents raw materials and the time at which it was needed for the purpose of preparing orders of production and purchase.

The problem of the present work is represented in the general company of electrical industrialization adoption of traditional methods and personal experience of the process of the products and\or purchase quantity and inventory quantities and limiting the required time for acquiring the required quantities of the materials and parts used in the finish product of the

DBN Rashid, International Journal of Innovation, Creativity and Change, 2020

Clustering algorithms have recently gained attention in the related literature since
they can help current intrusion detection systems in several aspects. This paper
proposes genetic algorithm (GA) based clustering, serving to distinguish patterns
incoming from network traffic packets into normal and attack. Two GA based
clustering models for solving intrusion detection problem are introduced. The first
model coined as handles numeric features of the network packet, whereas
the second one coined as concerns all features of the network packet.
Moreover, a new mutation operator directed for binary and symbolic features is
proposed. The basic concept of proposed mutation operator depends on the most
frequent value

Rivest Cipher 4 (RC4) is an efficient stream cipher that is commonly used in internet protocols. However, there are several flaws in the key scheduling algorithm (KSA) of RC4. The contribution of this paper is to overcome some of these weaknesses by proposing a new version of KSA coined as modified KSA . In the initial state of the array is suggested to contain random values instead of the identity permutation. Moreover, the permutation of the array is modified to depend on the key value itself. The proposed performance is assessed in terms of cipher secrecy, randomness test and time under a set of experiments with variable key size and different plaintext size. The results show that the RC4 with improves the randomness and secrecy with