This Paper introduces a new local function ϕSζ∗ in a Grill topological space (Ẋ, ζ, τ) by using a semi open set, which is a superset of the local function ϕζ. Additionally, two equivalent operators, Ψs and ΓS that define topology τSζ, were devised based on ϕSζ∗, along with the presentation of various characteristics and properties ofϕ∗Sζ and the two equivalent operators, Ψs and ΓS. Additionally, newly created sets with weakly open properties (ϕSζ∗.open,ζ s.α-open, ζ s.pre.open, ζ s.semi.open) were established and their interrelations were proofed and diagrams that illustrate the relationship between them. For speed and accuracy of completing counterexamples, creating a computer program with original codes we

  There are many researches deals with constructing an efficient solutions for real problem having Multi - objective confronted with each others. In this paper we construct a decision for Multi – objectives based on building a mathematical model formulating a unique objective function by combining the confronted objectives functions. Also we are presented some theories concerning this problem. Areal application problem has been presented to show the efficiency of the performance of our model and the method. Finally we obtained some results by randomly generating some problems.

 To expedite the learning process, a group of algorithms known as parallel machine learning algorithmscan be executed simultaneously on several computers or processors. As data grows in both size andcomplexity, and as businesses seek efficient ways to mine that data for insights, algorithms like thesewill become increasingly crucial. Data parallelism, model parallelism, and hybrid techniques are justsome of the methods described in this article for speeding up machine learning algorithms. We alsocover the benefits and threats associated with parallel machine learning, such as data splitting,communication, and scalability. We compare how well various methods perform on a variety ofmachine learning tasks and datasets, and we talk abo

In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot.  Simulation results, whi

Document clustering is the process of organizing a particular electronic corpus of documents into subgroups of similar text features. Formerly, a number of conventional algorithms had been applied to perform document clustering. There are current endeavors to enhance clustering performance by employing evolutionary algorithms. Thus, such endeavors became an emerging topic gaining more attention in recent years. The aim of this paper is to present an up-to-date and self-contained review fully devoted to document clustering via evolutionary algorithms. It firstly provides a comprehensive inspection to the document clustering model revealing its various components with its related concepts. Then it shows and analyzes the principle research wor

Genetic algorithms (GA) are a helpful instrument for planning and controlling the activities of a project. It is based on the technique of survival of the fittest and natural selection. GA has been used in different sectors of construction and building however that is rarely documented. This research aimed to examine the utilisation of genetic algorithms in construction project management. For this purpose, the research focused on the benefits and challenges of genetic algorithms, and the extent to which genetic algorithms is utilised in construction project management. Results showed that GA provides an ability of generating near optimal solutions which can be adopted to reduce complexity in project management and resolve difficult problem

The world seen rapid developments in the field of information technology within all life fields, particularly the educational field. Usually, we find the traditional educational methods lack a sense of realism and interaction. Solving this problem is by utilizing virtual reality technology to make actual practice present in the classroom. As an interactive technology, it provides students with an accessible, reliable environment that was previously unavailable and offered an opportunity for learning by practicing instead of teacher-centered learning and within a vision that does not look at the past but looks to the future. Virtual reality technology will change the nature of the relationship between the teacher and the student. Thus, the c

The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic

This study emphasizes the infinite-boundary integro-differential equation. To examine the approximate solution of the problem, two modified optimization algorithms are proposed based on generalized Laguerre functions. In the first technique, the proposed method is applied to the original problem by approximating the solution using the truncated generalized Laguerre polynomial of the unknown function, optimizing coefficients through error minimization, and transforming the integro-differential equation into an algebraic equation. In contrast, the second approach incorporates a penalty term into the objective function to effectively enforce boundary and integral constraints. This technique reduces the original problem to a mathematical optimi

<span lang="EN-US">Diabetes is one of the deadliest diseases in the world that can lead to stroke, blindness, organ failure, and amputation of lower limbs. Researches state that diabetes can be controlled if it is detected at an early stage. Scientists are becoming more interested in classification algorithms in diagnosing diseases. In this study, we have analyzed the performance of five classification algorithms namely naïve Bayes, support vector machine, multi layer perceptron artificial neural network, decision tree, and random forest using diabetes dataset that contains the information of 2000 female patients. Various metrics were applied in evaluating the performance of the classifiers such as precision, area under the c