Optimization procedures using a variety of input parameters have gotten a lot of attention, but using three non-edible seed oils of Jatropha (Jatropha curcas), Sesame (Sesamum indicum), and Sweet Almond (Prunusamygdalus dulcis) has a few advantages, including availability and non-food competitiveness. Optimizing a two-stage trans-esterification process using a sodium hydroxide-based catalyst at a fixed catalyst (1.0wt %) and temperature (60 ^oC) while varying molar ratio (1:3, 1:6, 1:12),  time (20–60 min), and mixing speed (500–1000 rpm), to produce optimal responses of yields were studied using response surface methodology (RSM). The optimization solution of molar ratio (1:3), time (40.9 min.),

Copper electrodeposition by electrorefining process in acidic sulfate media contains 40 g/l of cupric ions and 160 g/l of sulfuric acid was achieved to study the influence of the operating parameters on cathode purity, surface morphology, deposition rate, current efficiency and power consumption. These operating parameters and there ranges are: current density 200, 300 and 400 A/m², electrolyte temperature 35, 50 and 65 ^oC, electrodes spacing 15, 30 and 45 mm and electrolyte residence time 6, 4 and 2 h were utilized. XRF, SEM and EDX analyses were attained to clarify the properties of the produced cathode.

In this paper, Response Surface Method (RSM) is utilized to carry out an investigation of the impact of input parameters: electrode type (E.T.) [Gr, Cu and CuW], pulse duration of current (I_p), pulse duration on time (T_on), and pulse duration off time (T_off) on the surface finish in EDM operation. To approximate and concentrate the suggested second- order regression model is generally accepted for Surface Roughness Ra, a Central Composite Design (CCD) is utilized for evaluating the model constant coefficients of the input parameters on Surface Roughness (Ra). Examinations were performed on AISI D2 tool steel. The important coefficients are gotten by achieving successfully an Analysis of V

A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optim

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

Densely deployment of sensors is generally employed in wireless sensor networks (WSNs) to ensure energy-efficient covering of a target area. Many sensors scheduling techniques have been recently proposed for designing such energy-efficient WSNs. Sensors scheduling has been modeled, in the literature, as a generalization of minimum set covering problem (MSCP) problem. MSCP is a well-known NP-hard optimization problem used to model a large range of problems arising from scheduling, manufacturing, service planning, information retrieval, etc. In this paper, the MSCP is modeled to design an energy-efficient wireless sensor networks (WSNs) that can reliably cover a target area. Unlike other attempts in the literature, which consider only a si

     Solving problems via artificial intelligence techniques has widely prevailed in different aspects. Implementing artificial intelligence optimization algorithms for NP-hard problems is still challenging. In this manuscript, we work on implementing the Naked Mole-Rat Algorithm (NMRA) to solve the n-queens problems and overcome the challenge of applying NMRA to a discrete space set. An improvement of NMRA is applied using the aspect of local search in the Variable Neighborhood Search algorithm (VNS) with 2-opt and 3-opt. Introducing the Naked Mole Rat algorithm based on variable neighborhood search (NMRAVNS) to solve N-queens problems with different sizes. Finding the best solution or set of solutions within a plausible amount of t