Many designs have been suggested for unipolar magnetic lenses based on changing the width of the inner bore and fixing the other geometrical parameters of the lens to improve the performance of unipolar magnetic lenses. The investigation of a study of each design included the calculation of its axial magnetic field the magnetization of the lens in addition to the magnetic flux density using the Finite Element Method (FEM) the Magnetic Electron Lenses Operation (MELOP) program version 1 at three different values of current density (6,4,2 A/mm²). As a result, the clearest values and behaviors were obtained at current density (2 A/mm²). it was found that the best magnetizing properties, the high

     A new Schiff base ligand was prepared via a condensation reaction. The synthesis involved combining N-(4-aminophenylsulfonyl) benzamide (also known as sulfabenzamide) with indoline-2,3-dione. To facilitate the reaction, three drops of glacial acetic acid were added. This process yielded the ligand N-(4-(2-oxoindoline-3-ylideneamino) phenylsulfonyl) benzamide, designated as (L). Mixed ligand complexes were prepared in a molar ratio (1:1:1) (M:1,10-phen, L) at concentrations of 10-4M by interacting L and 1,10-phenanthroline, with the following metal ions (Cr+3, Mn+2, Zn+2, Pd+2, Cd+2, Pt+4). These complexes exhibited different geometric shapes, including (octahedral for both Cr+3, Mn+2, Pt+4, tetrahedral for Zn+2 and Cd+2, an

Most Internet of Vehicles (IoV) applications are delay-sensitive and require resources for data storage and tasks processing, which is very difficult to afford by vehicles. Such tasks are often offloaded to more powerful entities, like cloud and fog servers. Fog computing is decentralized infrastructure located between data source and cloud, supplies several benefits that make it a non-frivolous extension of the cloud. The high volume data which is generated by vehicles’ sensors and also the limited computation capabilities of vehicles have imposed several challenges on VANETs systems. Therefore, VANETs is integrated with fog computing to form a paradigm namely Vehicular Fog Computing (VFC) which provide low-latency services to mo

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

This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed