In this paper, the concept of soft closed groups is presented using the soft ideal pre-generalized open and soft pre-open, which are -ᶅ- - -closed sets " -closed", Which illustrating several characteristics of these groups. We also use some games and - Separation Axiom, such as (Ʈ0, Ӽ, ᶅ) that use many tables and charts to illustrate this. Also, we put some proposals to study the relationship between these games and give some examples.
In this paper a method to determine whether an image is forged (spliced) or not is presented. The proposed method is based on a classification model to determine the authenticity of a tested image. Image splicing causes many sharp edges (high frequencies) and discontinuities to appear in the spliced image. Capturing these high frequencies in the wavelet domain rather than in the spatial domain is investigated in this paper. Correlation between high-frequency sub-bands coefficients of Discrete Wavelet Transform (DWT) is also described using co-occurrence matrix. This matrix was an input feature vector to a classifier. The best accuracy of 92.79% and 94.56% on Casia v1.0 and Casia v2.0 datasets respectively was achieved. This pe
... Show MoreAbstract
Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al
... Show MoreThis paper is concerned with introducing and studying the M-space by using the mixed degree systems which are the core concept in this paper. The necessary and sufficient condition for the equivalence of two reflexive M-spaces is super imposed. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are introduced. From an M-space, a unique supratopological space is introduced. Furthermore, the m-continuous (m-open and m-closed) functions are defined and the fundamental theorem of the m-continuity is provided. Finally, the m-homeomorphism is defined and some of its properties are investigated.
In this paper, we introduced some fact in 2-Banach space. Also, we define asymptotically non-expansive mappings in the setting of 2-normed spaces analogous to asymptotically non-expansive mappings in usual normed spaces. And then prove the existence of fixed points for this type of mappings in 2-Banach spaces.
The article describes a certain computation method of -arcs to construct the number of distinct -arcs in for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons
... Show MoreA new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte
... Show MoreIn this paper, we introduce new conditions to prove that the existence and boundedness of the solution by convergent sequences and convergent series. The theorem of Krasnoselskii, Lebesgue’s dominated convergence theorem and fixed point theorem are used to get some sufficient conditions for the existence of solutions. Furthermore, we get sufficient conditions to guarantee the oscillatory property for all solutions in this class of equations. An illustrative example is included as an application to the main results.
This article is devoted to presenting results on invariant approximations over a non-star-shsped weakly compact subset of a complete modular space by introduced a new notion called S-star-shaped with center f: if be a mapping and , . Then the existence of common invariant best approximation is proved for Banach operator pair of mappings by combined the hypotheses with Opial’s condition or demi-closeness condition
The aim of this paper is to employ the fractional shifted Legendre polynomials (FSLPs) in the matrix form to approximate the fractional derivatives and find the numerical solutions of the one-dimensional space-fractional bioheat equation (SFBHE). The Caputo formula was utilized to approximate the fractional derivative. The proposed methodology applied for two examples showed its usefulness and efficiency. The numerical results showed that the utilized technique is very efficacious with high accuracy and good convergence.
Let Y be a"uniformly convex n-Banach space, M be a nonempty closed convex subset of Y, and S:M→M be adnonexpansive mapping. The purpose of this paper is to study some properties of uniform convex set that help us to develop iteration techniques for1approximationjof"fixed point of nonlinear mapping by using the Mann iteration processes in n-Banachlspace.