In this work we define and study new concept of fibrewise topological spaces, namely fibrewise soft topological spaces, Also, we introduce the concepts of fibrewise closed soft topological spaces, fibrewise open soft topological spaces, fibrewise soft near compact spaces and fibrewise locally soft near compact spaces.
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 MoreIn 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.
A 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.
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.
Breast cancer was one of the most common reasons for death among the women in the world. Limited awareness of the seriousness of this disease, shortage number of specialists in hospitals and waiting the diagnostic for a long period time that might increase the probability of expansion the injury cases. Consequently, various machine learning techniques have been formulated to decrease the time taken of decision making for diagnoses the breast cancer and that might minimize the mortality rate. The proposed system consists of two phases. Firstly, data pre-processing (data cleaning, selection) of the data mining are used in the breast cancer dataset taken from the University of California, Irvine machine learning repository in this stage we
... Show MoreThis paper deals with the blow-up properties of positive solutions to a parabolic system of two heat equations, defined on a ball in associated with coupled Neumann boundary conditions of exponential type. The upper bounds of blow-up rate estimates are derived. Moreover, it is proved that the blow-up in this problem can only occur on the boundary.
In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an
... Show More