New complexes of the [M(Ura)(Phen)(OH2)Cl2]Cl.2H2O type, where (Ura) uracil ; (Phen) 1,10-phenanthroline hydrate; M (Cr+3 , Fe+3 and La+3) were synthesized from mix ligand and characterized . These complexes have been characterized by the elemental micro analysis, spectral (FT-IR., UV-Vis, 1HNMR, 13CNMR and Mass) and magnetic susceptibility as well the molar conductive mensuration. Cr+3, Fe+3 and La+3- complexes of six–coordinated were proposed for the insulated for three metal(III) complexes for molecular formulas following into uracil property and 1,10-phenanthroline hydrate present . The proposed molecular structure for all metal (III) complexes is octahedral geometries .The biological activity was tested of metal(III) salts, ligands

Traffic 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

This paper constructs a new linear operator associated with a seven parameters Mittag-Leffler function using the convolution technique. In addition, it investigates some significant second-order differential subordination properties with considerable sandwich results concerning that operator.

In this paper, the process for finding an approximate solution of nonlinear three-dimensional (3D) Volterra type integral operator equation (N3D-VIOE) in R³ is introduced. The modelling of the majorant function (MF) with the modified Newton method (MNM) is employed to convert N3D-VIOE to the linear 3D Volterra type integral operator equation (L3D-VIOE). The method of trapezoidal rule (TR) and collocation points are utilized to determine the approximate solution of L3D-VIOE by dealing with the linear form of the algebraic system. The existence of the approximate solution and its uniqueness are proved, and illustrative examples are provided to show the accuracy and efficiency of the model.

Mathematical Subject Classificat

Silver-bismuth iodide (ABI) ternary semiconductors, such as AgBi2I7, AgBiI4, Ag2BiI5, and Ag3BiI6, have emerged as promising lead-free light absorbers for photovoltaic applications due to their favorable optoelectronic properties. Despite recent advances that have improved power conversion efficiencies from ∼1% to over 5%, ABI-based solar cells still show substantial open-circuit voltage (VOC) losses of up to ∼1 V, which significantly hinder the device performance. These losses have been experimentally attributed to the non-radiative recombination originating from intrinsic defects, however, theoretical understanding of these defect mechanisms remains limited. Here, using density functional theory calculations, we systematical

In this paper, the construction of Hermite wavelets functions and their operational matrix of integration is presented. The Hermite wavelets method is applied to solve nth order Volterra integro diferential equations (VIDE) by expanding the unknown functions, as series in terms of Hermite wavelets with unknown coefficients. Finally, two examples are given

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord