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
In this paper, we present multiple bit error correction coding scheme based on extended Hamming product code combined with type II HARQ using shared resources for on chip interconnect. The shared resources reduce the hardware complexity of the encoder and decoder compared to the existing three stages iterative decoding method for on chip interconnects. The proposed method of decoding achieves 20% and 28% reduction in area and power consumption respectively, with only small increase in decoder delay compared to the existing three stage iterative decoding scheme for multiple bit error correction. The proposed code also achieves excellent improvement in residual flit error rate and up to 58% of total power consumption compared to the other err
... Show MorePeak ground acceleration (PGA) is one of the critical factors that affect the determination of earthquake intensity. PGA is generally utilized to describe ground motion in a particular zone and is able to efficiently predict the parameters of site ground motion for the design of engineering structures. Therefore, novel models are developed to forecast PGA in the case of the Iraqi database, which utilizes the particle swarm optimization (PSO) approach. A data set of 187 historical ground-motion recordings in Iraq’s tectonic regions was used to build the explicit proposed models. The proposed PGA models relate to different seismic parameters, including the magnitude of the earthquake (Mw), average shear-wave velocity (VS30), focal depth (FD
... Show MoreThe proposed design of neural network in this article is based on new accurate approach for training by unconstrained optimization, especially update quasi-Newton methods are perhaps the most popular general-purpose algorithms. A limited memory BFGS algorithm is presented for solving large-scale symmetric nonlinear equations, where a line search technique without derivative information is used. On each iteration, the updated approximations of Hessian matrix satisfy the quasi-Newton form, which traditionally served as the basis for quasi-Newton methods. On the basis of the quadratic model used in this article, we add a new update of quasi-Newton form. One innovative features of this form's is its ability to estimate the energy functio
... Show MoreIn this paper, we derive and prove the stability bounds of the momentum coefficient µ and the learning rate ? of the back propagation updating rule in Artificial Neural Networks .The theoretical upper bound of learning rate ? is derived and its practical approximation is obtained
This researchpaper includes the incorporation of Alliin at various energy levels and angles
With Metformin using Gaussian 09 and Gaussian view 06. Two computers were used in this work. Samples were generated to draw, integrate, simulate and measure the value of the potential energy surface by means of which the lowest energy value was (-1227.408au). The best correlation compound was achieved between Alliin and Metformin through the low energy values where the best place for metformin to b
... Show MoreThis paper investigates an effective computational method (ECM) based on the standard polynomials used to solve some nonlinear initial and boundary value problems appeared in engineering and applied sciences. Moreover, the effective computational methods in this paper were improved by suitable orthogonal base functions, especially the Chebyshev, Bernoulli, and Laguerre polynomials, to obtain novel approximate solutions for some nonlinear problems. These base functions enable the nonlinear problem to be effectively converted into a nonlinear algebraic system of equations, which are then solved using Mathematica®12. The improved effective computational methods (I-ECMs) have been implemented to solve three applications involving nonli
... Show MoreMarket share is a major indication of business success. Understanding the impact of numerous economic factors on market share is critical to a company’s success. In this study, we examine the market shares of two manufacturers in a duopoly economy and present an optimal pricing approach for increasing a company’s market share. We create two numerical models based on ordinary differential equations to investigate market success. The first model takes into account quantity demand and investment in R&D, whereas the second model investigates a more realistic relationship between quantity demand and pricing.
In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H
... Show MoreIn this study, a brand-new double transform known as the double INEM transform is introduced. Combined with the definition and essential features of the proposed double transform, new findings on partial derivatives, Heaviside function, are also presented. Additionally, we solve several symmetric applications to show how effective the provided transform is at resolving partial differential equation.