The purpose of this paper is to define fuzzy subspaces for fuzzy space of orderings and we prove some results about this definition in which it leads to a lot of new results on fuzzy space of orderings. Also we define the sum and product over such spaces such that: If f = < a1,…,an > and g = < b1,…bm>, their sum and product are f + g = < a1…,an, b1, …, bm> and f × g =. for all a1,…,an,b1,…,bm ? G

     This paper deals with the numerical solution of the discrete classical optimal control problem (DCOCP) governing by linear hyperbolic boundary value problem (LHBVP). The method which is used here consists of: the GFEIM " the Galerkin finite element method in space variable with the implicit finite difference method in time variable" to find the solution of the discrete state equation (DSE) and the solution of its corresponding discrete adjoint equation, where a discrete classical control (DCC) is given.  The gradient projection method with either the Armijo method (GPARM) or with the optimal method (GPOSM) is used to solve the minimization problem which is obtained from the necessary conditi

This paper derives the EDITRK4 technique, which is an exponentially fitted diagonally implicit RK method for solving ODEs . This approach is intended to integrate exactly initial value problems (IVPs), their solutions consist of linear combinations of the group functions  and  for exponentially fitting  problems, with  being the problem’s major frequency utilized to improve the precision of the method. The modified  method EDITRK4 is a new three-stage fourth-order exponentially-fitted diagonally implicit approach for solving IVPs with functions that are exponential as solutions. Different forms of -order ODEs must be derived using the modified system, and when the same issue is reduced to a  framework of equations that can be sol

Vehicular ad hoc networks (VANETs) are considered an emerging technology in the industrial and educational fields. This technology is essential in the deployment of the intelligent transportation system, which is targeted to improve safety and efficiency of traffic. The implementation of VANETs can be effectively executed by transmitting data among vehicles with the use of multiple hops. However, the intrinsic characteristics of VANETs, such as its dynamic network topology and intermittent connectivity, limit data delivery. One particular challenge of this network is the possibility that the contributing node may only remain in the network for a limited time. Hence, to prevent data loss from that node, the information must reach the destina

Iris detection is considered as challenging image processing task. In this study efficient method was suggested to detect iris and recognition it. This method depending on seed filling algorithm and circular area detection, where the color image converted to gray image, and then the gray image is converted to binary image. The seed filling is applied of the binary image and the position of detected object binary region (ROI) is localized in term of it is center coordinates are radii (i.e., the inner and out radius). To find the localization efficiency of suggested method has been used the coefficient of variation (CV) for radius iris for evaluation. The test results indicated that is suggested method is good for the iris detection.

There are several methods that are used to solve the traditional transportation problems whose units of supply, demand quantities, and cost transportation are known exactly. These methods obtain basic solution, and develop it to the best solution through a series of consecutive calculations to obtain the optimal solution.
The steps are more complex with fuzzy variables, so this paper presents the disadvantages of solutions of the traditional ways with existence of variables in the fuzzy form.
This paper also presents a comparison between the results that emerged after using different conversion ranking formulas to convert from fuzzy form to crisp form on the same numerical example with a full fuzz

         In this paper, developed Jungck contractive mappings into fuzzy Jungck contractive and proved  fuzzy fixed point for some types of generalize fuzzy Jungck contractive mappings.

Face recognition is one of the most applications interesting in computer vision and pattern recognition fields. This is for many reasons; the most important of them are the availability and easy access by sensors. Face recognition system can be a sub-system of many applications. In this paper, an efficient face recognition algorithm is proposed based on the accuracy of Gabor filter for feature extraction and computing the Eigen faces. In this work, efficient compressed feature vector approach is proposed. This compression for feature vector gives a good recognition rate reaches to 100% and reduced the complexity of computing Eigen faces. Faces94 data base was used to test method.

In this paper, some necessary and sufficient conditions are obtained to ensure the oscillatory of all solutions of the first order impulsive neutral differential equations. Also, some results in the references have been improved and generalized. New lemmas are established to demonstrate the oscillation property. Special impulsive conditions associated with neutral differential equation are submitted. Some examples are given to illustrate the obtained results.

The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola