This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

Background: MRSA (methicillin-resistant Staphylococcus aureus) is a global health problem. Many people are looking for new ways to combat MRSA, for example by using bacteriophages (phages). It has been extremely challenging to isolate a sufficient quantity of lytic anti-MRSA phages. Therefore, new techniques for separating, refining, and reworking anti-MRSA phages were sought in this study.

Methods: Of 437 S. aureus isolates, nine clinical MRSA isolates were obtained from three hospitals in Baghdad, Iraq and two ATCC MRSA strains were used to separate wild anti-MRS

This paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six  employees , and it was chosen queuing model is a single-service channel  M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and  it was composed of data collection times (arrival time , service time, departure time)

Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

Until recently, researchers have utilized and applied various techniques for intrusion detection system (IDS), including DNA encoding and clustering that are widely used for this purpose. In addition to the other two major techniques for detection are anomaly and misuse detection, where anomaly detection is done based on user behavior, while misuse detection is done based on known attacks signatures. However, both techniques have some drawbacks, such as a high false alarm rate. Therefore, hybrid IDS takes advantage of combining the strength of both techniques to overcome their limitations. In this paper, a hybrid IDS is proposed based on the DNA encoding and clustering method. The proposed DNA encoding is done based on the UNSW-NB15

This study is included the preparation of two tetradentate amide-thiol proligands of the general structure [H2Ln], [where; (n = (1–2)]. The ligands [H2L1] and [H2L2] have been prepared from the reaction of the cyclic thioester 2-oxo-1, 4-dithiacyclohexane (compound 1) and 3-chloro-2-oxo-1, 4 dithiacyclohexane (compound 2) with 2-aminomethanepyridine in (1:1) ratio respetively. The reaction was carried out in chloroform at room temperature and under N2 atmosphere. Structural formula of these two ligands have been reported.

Colorectal cancer (CRC) is the most common gastrointestinal malignancy and one of the top ten common cancers worldwide with approximately 2 million cases. There are multiple risk factors that could lead to CRC emergence; of which are genetic polymorphisms. Excision repair cross-complementing group 2 (ERCC2) gene encodes for ERCC2 enzyme which plays a crucial role in maintaining genomic integrity by removing DNA adducts. Several studies suggested that there could be a link between genetic polymorphisms of ERCC2 gene and the risk of CRC development. Hence the present study aims to validate the relationship between the following ERCC2 single nucleotide polymorphisms (rs13181, rs149943175, rs530662943, and rs1799790) and CRC susceptibility. A t

Solar energy has significant advantages compared to conventional sources such as coal and natural gas, including no emissions, no need for fuel, and the potential for installation in a wide range of locations with access to sunlight. In this investigation, heterocyclic derivatives were synthesized from several porphyrin derivatives (4,4',4",4"'-(porphyrin-5,10,15,20-tetrayl) tetra benzoic acid) compound (3), obtained by reaction Pyrrole with 4-formyl benzoic acid. Subsequently, porphyrin derivative-component amides 5a, 5b, and 5c were produced by reacting compound (3) with amine derivatives at a 1:4 molar ratio. These derivatives exhibited varying sensitivities for utilization in solar cells, with compound 5a displaying the highest power

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s