Nowad ays, with the development of internet communication that provides many facilities to the user leads in turn to growing unauthorized access. As a result, intrusion detection system (IDS) becomes necessary to provide a high level of security for huge amount of information transferred in the network to protect them from threats. One of the main challenges for IDS is the high dimensionality of the feature space and how the relevant features to distinguish the normal network traffic from attack network are selected. In this paper, multi-objective evolutionary algorithm with decomposition (MOEA/D) and MOEA/D with the injection of a proposed local search operator are adopted to solve the Multi-objective optimization (MOO) followed by Naï

The theory of Multi-Criteria Decision Making (MCDM) was introduced in the second half of the twentieth century and aids the decision maker to resolve problems when interacting criteria are involved and need to be evaluated.  In this paper, we apply MCDM on the problem of the best drug for rheumatoid arthritis disease. Then, we solve the MCDM problem via -Sugeno measure and the Choquet integral to provide realistic values in the process of selecting the most appropriate drug. The approach confirms the proper interpretation of multi-criteria decision making in the drug ranking for rheumatoid arthritis.

The main purpose of this paper is to introduce a some concepts in fibrewise totally topological space which are called fibrewise totally mapping, fiberwise totally closed mapping, fibrewise weakly totally closed mapping, fibrewise totlally perfect mapping fibrewise almost totally perfect mapping. Also the concepts as totally adherent point, filter, filter base, totally converges to a subset, totally directed toward a set, totally rigid, totally-H-set, totally Urysohn space, locally totally-QHC totally topological space are introduced and the main concept in this paper is fibrewise totally perfect mapping in totally top

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun

     In the contemporary world, the security of data and privacy policies are major concerns in cloud computing. Data stored on the cloud has been claimed to be unsafe and liable to be hacked. Users have found it difficult to trust their data in the cloud. Users want to know that their data is accessible from anywhere and that an unauthorized user will not be able to access it. Another area of concern is the authentication of users over the cloud. There are a number of security concerns with Cloud Computing which include Distributed Denial of Service, Data leakage, and many more, just to mention a few. In this paper, an Elliptic Curve Cryptography (ECC) algorithm is used for the encryption and decryption of the information stored on

     In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

The evolution in the field of Artificial Intelligent (AI) with its training algorithms make AI very important in different aspect of the life. The prediction problem of behavior of dynamical control system is one of the most important issue that the AI can be employed to solve it. In this paper, a Convolutional Multi-Spike Neural Network (CMSNN) is proposed as smart system to predict the response of nonlinear dynamical systems. The proposed structure mixed the advantages of Convolutional Neural Network (CNN) with Multi -Spike Neural Network (MSNN) to generate the smart structure. The CMSNN has the capability of training weights based on a proposed training algorithm. The simulation results demonstrated that the proposed

A chemical optical fiber sensor based on surface plasmon resonance (SPR) was developed and implemented using multimode plastic optical fiber. The sensor is used to detect and measure the refractive index and concentration of various chemical materials (Urea, Ammonia, Formaldehyde and Sulfuric acid) as well as to evaluate the performance parameters such as sensitivity, signal to noise ratio, resolution and figure of merit. It  was noticed that the value of the sensitivity of the optical fiber-based SPR sensor, with 60nm and 10 mm long, Aluminum(Al) and Gold (Au) metals film exposed sensing region, was 4.4 μm, while the SNR was 0.20, figure of merit was 20 and resolution 0.00045. In this work a multimode

The k-out-of-n:G (or k/n:G) system structure is a very popular of redundancy in
fault-tolerant systems, with wide applications in so many fields. This paper presents
two states of multi-state k/n:G systems. The first part, we present the definition that
introduced by Al-Neweihi et al [1], where the values are the same with respect
to all system states and we show that there exists an alternative equivalent definition
to Al-Neweihi's definition. In the second part of this paper we give more general
definition proposed by Huang et al [2], where it allows different values with
respect to different system states and we provide there exists an equivalent definition
to Huang's definition when the values are increasing.

Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio