In this paper, we introduce weak and strong forms of ω-perfect mappings, namely the -ω-perfect, weakly -ω-perfect and strongly-ω-perfect mappings. Also, we investigate the fundamental properties of these mappings. Finally, we focused on studying the relationship between weakly -ω-perfect and strongly -ω-perfect mappings.

In this paper, we provide some types of - -spaces, namely, - ( )- (respectively, - ( )- , - ( )- and - ( )-) spaces for minimal structure spaces which are denoted by ( -spaces). Some properties and examples are given.
The relationships between a number of types of - -spaces and the other existing types of weaker and stronger forms of -spaces are investigated. Finally, new types of open (respectively, closed) functions of -spaces are introduced and some of their properties are studied.

Let R be a semiprime ring with center Z(R) and U be a nonzero ideal of R. An additive mappings are called right centralizer if ( ) ( ) and ( ) ( ) holds for all . In the present paper, we introduce the concepts of generalized strong commutativity centralizers preserving and generalized strong cocommutativity preserving centralizers and we prove that R contains a nonzero central ideal if any one of the following conditions holds: (i) ( ) ( ), (ii) [ ( ) ( )] , (iii) [ ( ) ( )] [ ], (iv) ( ) ( ) , (v) ( ) ( ) , (vi) [ ( ) ( )] , (vii) ( ) ( ) ( ), (viii) ( ) ( ) for all .

Researchers are increasingly using multimodal biometrics to strengthen the security of biometric applications. In this study, a strong multimodal human identification model was developed to address the growing problem of spoofing attacks in biometric security systems. Through the use of metaheuristic optimization methods, such as the Genetic Algorithm(GA), Ant Colony Optimization(ACO), and Particle Swarm Optimization (PSO) for feature selection, this unique model incorporates three biometric modalities: face, iris, and fingerprint. Image pre-processing, feature extraction, critical image feature selection, and multibiometric recognition are the four main steps in the workflow of the system. To determine its performance, the model wa

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi

     The focus of this article is to add a new class of rank one of  modified Quasi-Newton techniques to solve the problem of unconstrained optimization by updating the inverse Hessian matrix with an update of rank 1, where a diagonal matrix is the first component of the next inverse Hessian approximation, The inverse Hessian matrix is  generated by the method proposed which is symmetric and it satisfies the condition of modified quasi-Newton, so the global convergence is retained. In addition, it is positive definite that  guarantees the existence of the minimizer at every iteration of the objective function. We use  the program MATLAB to solve an algorithm function to introduce the feasibility of