Extended utilization of adaptive algorithms, Evaluative Algorithms (EAs), to address these issues offers a way to handle massive multi-objective optimization, even if the algorithmic method for handling combinations of objectives (CO) has been accessible for quite some time. Combining the idea of superiority with the Hypervolume (HV) tag approach, the GSA algorithm utilizes various target effects to explain several algorithms depending on the Hypervolume (HV) spacing. The Multi-objective Gravitational Search Algorithm with Hypervolume (MOGSA/HV). Since rapid convergence could result from GSA foundation work, Hypervolume rewrites the multi-objective problem (MOP) as a sequence of Tchebycheff solutions, improving it. Since the one in charge has already decided to utilize this method (Tchebycheff) as a benchmark, solving all of the (MOGSA/HV) problems simultaneously is a formidable challenge. In leader group construction, non-dominant groups are significant in containing less dense areas, avoiding nearby regions, and producing a more diversified and compact Pareto Frontier. This outcome was produced using nine conventional nonlinear functions. It might seem that MOGSA/HV outperforms Multi-objective Evolving Algorithm under Density Indicator (MOEAD), Non-Sorting Genetic Algorithm Two (NSGAII), Multi-Particle Swarm Optimization under Distance Indicator (MPSOD), and Spacing Evolving Algorithm Two (SPEA2). The results we obtained showed the efficiency of the new algorithm compared to other algorithms, which was based on its convergence to the optimal solution based on the (HV). Every single end product was created using MATLAB
Data-driven models perform poorly on part-of-speech tagging problems with the square Hmong language, a low-resource corpus. This paper designs a weight evaluation function to reduce the influence of unknown words. It proposes an improved harmony search algorithm utilizing the roulette and local evaluation strategies for handling the square Hmong part-of-speech tagging problem. The experiment shows that the average accuracy of the proposed model is 6%, 8% more than HMM and BiLSTM-CRF models, respectively. Meanwhile, the average F1 of the proposed model is also 6%, 3% more than HMM and BiLSTM-CRF models, respectively.
We study clusters in warm dark matter (WDM) models of a thermally produced dark matter particle 0.5 keV in mass. We show that, despite clusters in WDM cosmologies having similar density profiles as their cold dark matter (CDM) counterparts, the internal properties, such as the amount of substructure, show marked differences. This result is surprising as clusters are at mass scales that are a thousand times greater than that at which structure formation is suppressed. WDM clusters gain significantly more mass via smooth accretion and contain fewer substructures than their CDM brethren. The higher smooth mass accretion results in subhaloes which are physically more extended and less dense. These fine-scale differences can be probed by strong
... Show MoreMany cases of gravitational bullets are reported in developed and non-developed countries. However, few papers highlighted these cases in the literature. In our study, we present two cases of gravitational bullets that have an unusual coincidence in the injury characteristics through their ages, and gender, the site of the inlet.
|
One of the most powerful tools for any stellar dynamics is the N-body simulation. In an N-body simulation the motion of N particles is followed under their mutual gravitational attraction. In this paper the gravitational N-body simulation is described to investigate Newtonian and non- Newtonian (modified Newtonian dynamics) interaction between the stars of spiral galaxies. It is shown that standard Newtonian interaction requires dark matter to produce the flat rotational curves of the systems under consideration, while modified Newtonian dynamics (MOND) theorem provides a flat rotational curve and gives a good agreement with the observed rotation cu |
<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T
... Show MoreAbstract
Although the rapid development in reverse engineering techniques, 3D laser scanners can be considered the modern technology used to digitize the 3D objects, but some troubles may be associate this process due to the environmental noises and limitation of the used scanners. So, in the present paper a data pre-processing algorithm has been proposed to obtain the necessary geometric features and mathematical representation of scanned object from its point cloud which obtained using 3D laser scanner (Matter and Form) through isolating the noised points. The proposed algorithm based on continuous calculations of chord angle between each adjacent pair of points in point cloud. A MATLAB program has been built t
... Show MoreTraffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho
... Show MoreThe map of permeability distribution in the reservoirs is considered one of the most essential steps of the geologic model building due to its governing the fluid flow through the reservoir which makes it the most influential parameter on the history matching than other parameters. For that, it is the most petrophysical properties that are tuned during the history matching. Unfortunately, the prediction of the relationship between static petrophysics (porosity) and dynamic petrophysics (permeability) from conventional wells logs has a sophisticated problem to solve by conventional statistical methods for heterogeneous formations. For that, this paper examines the ability and performance of the artificial intelligence method in perme
... Show MoreIn this article, the high accuracy and effectiveness of forecasting global gold prices are verified using a hybrid machine learning algorithm incorporating an Adaptive Neuro-Fuzzy Inference System (ANFIS) model with Particle Swarm Optimization (PSO) and Gray Wolf Optimizer (GWO). The hybrid approach had successes that enabled it to be a good strategy for practical use. The ARIMA-ANFIS hybrid methodology was used to forecast global gold prices. The ARIMA model is implemented on real data, and then its nonlinear residuals are predicted by ANFIS, ANFIS-PSO, and ANFIS-GWO. The results indicate that hybrid models improve the accuracy of single ARIMA and ANFIS models in forecasting. Finally, a comparison was made between the hybrid foreca
... Show More