The notion of interval value fuzzy k-ideal of KU-semigroup was studied as a generalization of afuzzy k-ideal of KU-semigroup. Some results of this idea under homomorphism are discussed. Also, we presented some properties about the image (pre-image) for interval~ valued fuzzy~k-ideals of a KU-semigroup. Finally, the~ product of~ interval valued fuzzyk-ideals is established.

     In this paper the design of hybrid retina matching algorithm that is used in identification systems is considered. Retina based recognition is apparent as the most secure method for identification of an identity utilized to differentiate persons.

     The characteristics of Speeded up Robust Feature (SURF) and Binary Robust Invariant Scalable Key-Points (BRISK) algorithm have been used in order to produce a fast matching algorithm than the classical ones, those characteristics are important for real-time applications which usually need quick processing of a growing quantity of data. The algorithm is divided into three stages: retinal image processing and segmentation, extracting the lo

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

In this paper, a differential operator is used to generate a subclass of analytic and univalent functions with positive coefficients. The studied class of the functions includes:  

which is defined in the open unit disk  satisfying the following condition

This leads to the study of properties such as coefficient bounds, Hadamard product, radius of close –to- convexity, inclusive properties, and (n, τ) –neighborhoods for functions belonging to our class.

In this research, electron coefficients such as total collision frequency (colt/N), total ionization frequency (viz/N), and Power (P/N) for different gases such as (Ar, He, N2 and O2 (in Earth’s ionosphere have been calculated by applying the Boltzmann equation utilizing BOLSIG +, and it has been discovered that there is a significant impact of reducing the electric field (E/N) on electronic coefficients under which (E/N) increases. In addition, influence of (E/N) on electronic coefficients was studied. Reducing the electric field was chosen in the restricted range (1-100) Td, and the electronic coefficients for gases in the limited range (50-2000) km of the Earth's ionosphere. A positive correlation has been explained between all the

This paper has the interest of finding the approximate solution (APPS) of a nonlinear variable coefficients hyperbolic boundary value problem (NOLVCHBVP).  The given boundary value problem is written in its discrete weak form (WEFM) and proved  have a unique solution, which is obtained via the mixed Galerkin finite element with implicit method that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS). In this part, the predictor and the corrector techniques (PT and CT, respectively) are proved at first convergence and then are used to transform  the obtained GNAS to a linear GLAS . Then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are stud

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

This paper presents an improved technique on Ant Colony Optimization (ACO) algorithm. The procedure is applied on Single Machine with Infinite Bus (SMIB) system with power system stabilizer (PSS) at three different loading regimes. The simulations are made by using MATLAB software. The results show that by using Improved Ant Colony Optimization (IACO) the system will give better performance with less number of iterations as it compared with a previous modification on ACO. In addition, the probability of selecting the arc depends on the best ant performance and the evaporation rate.