In this paper, some new types of regularity axioms, namely pairwise quasi-regular, pairwise semi-regular, pairwise pseudo regular and pairwise regular are defined and studied in both ech fuzzy soft bi-closure spaces (  bicsp’s) and their induced fuzzy soft bitopological spaces. We also study the relationships between them. We show that in all these types of axioms, the hereditary property is satisfied under closed fs bi-csubsp of . Furthermore, we define some normality axioms, namely pairwise semi-normal, pairwise pseudo normal, pairwise normal and pairwise completely normal in both  bicsp’s and their induced fuzzy soft bitopological spaces, as well as their basic properties and the relationships between them are studied.

The best proximity point is a generalization of a fixed point that is beneficial when the contraction map is not a self-map. On other hand, best approximation theorems offer an approximate solution to the fixed point equation . It is used to solve the problem in order to come up with a good approximation. This paper's main purpose is to introduce new types of proximal contraction for nonself mappings in fuzzy normed space and then proved the best proximity point theorem for these mappings. At first, the definition of fuzzy normed space is given. Then the notions of the best proximity point and - proximal admissible in the context of fuzzy normed space are presented. The notion of α ̃–ψ ̃- proximal contractive mapping is introduced.

The aim of this work is to provide an efficient selection technique as a part of planning process to guide the decision makers to decide the preferences of one supplier over another for purchasing lab instruments in education domain. Fuzzy Analytical Hierarchy Process has used as a multi-criteria decision process, as an industrial engineering tool with certain emphasis on the qualitative aspects required to the decision makers. While the concept of degree of possibility for each criterion is used to reach its relative weights, a specific methodology created to reach the final objective decision of supplier selection. A questionnaire form was developed and distributed to five universities located in Baghdad province with a total

      In this article, a numerical study of compressible and weak compressible Newtonian flows is achieved for a time marching, Galerkin algorithm. A comparison between two numerical techniques for such flows, namely the artificial compressibility method (AC–method) and the fully artificial compressibility method (FAC–method) is performed. In the first artificial compressibility parameter (  is added to the continuity equation, while this parameter is added to both continuity and momentum equations in the second technique. This strategy is implemented to treat the governing equations of Newtonian flow in cylindrical coordinates (axisymmetric). Particularly, this study concerns with the effect of the artificial compressibility p

A coin has two sides. Steganography although conceals the existence of a message but is not completely secure. It is not meant to supersede cryptography but to supplement it. The main goal of this method is to minimize the number of LSBs that are changed when substituting them with the bits of characters in the secret message. This will lead to decrease the distortion (noise) that is occurred in the pixels of the stego-image and as a result increase the immunity of the stego-image against the visual attack. The experiment shows that the proposed method gives good enhancement to the steganoraphy technique and there is no difference between the cover-image and the stego-image that can be seen by the human vision system (HVS), so this method c

The extracting of personal sprite from the whole image faced many problems in separating the sprite edge from the unneeded parts, some image software try to automate this process, but usually they couldn't find the edge or have false result. In this paper, the authors have made an enhancement on the use of Canny edge detection to locate the sprite from the whole image by adding some enhancement steps by using MATLAB. Moreover, remove all the non-relevant information from the image by selecting only the sprite and place it in a transparent background. The results of comparing the Canny edge detection with the proposed method shows improvement in the edge detection.

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.

Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef