Spraying pesticides is one of the most common procedures that is conducted to control pests. However, excessive use of these chemicals inversely affects the surrounding environments including the soil, plants, animals, and the operator itself. Therefore, researchers have been encouraged to...

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

An intrusion detection system (IDS) is key to having a comprehensive cybersecurity solution against any attack, and artificial intelligence techniques have been combined with all the features of the IoT to improve security. In response to this, in this research, an IDS technique driven by a modified random forest algorithm has been formulated to improve the system for IoT. To this end, the target is made as one-hot encoding, bootstrapping with less redundancy, adding a hybrid features selection method into the random forest algorithm, and modifying the ranking stage in the random forest algorithm. Furthermore, three datasets have been used in this research, IoTID20, UNSW-NB15, and IoT-23. The results are compared with the three datasets men

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

The present study investigates the effect of the de-sanding (recycling system) on the bearing capacity of the bored piles. Full-scale models were conducted on two groups of piles, the first group was implemented without using this system, and the second group was implemented using the recycling system. All piles were tested by static load test, considering the time factor for which the piles were implemented. The test results indicated a significant and clear difference in the bearing capacity of the piles when using this system. The use of the recycling system led to a significant increase in the bearing capacity of the piles by 50% or more. Thus it was possible to reduce the pile length by (15 % or more) thus, and implementation c

    An investigation was provided in this work for the host range of brown soft scale Coccus hesperidum Linnaeus in Baghdad Province.  Five plant species were found infected by this insect, three of these species, Citrusaurantium L. (Rutaceae); Nerium oleander L. (Apocynaceae); Ficuscarica L. (Moraceae) reported earlier, and the remaining two, Dahlia pinnata Cav. (Asteraceae) and Myrtuscommunis L. (Myrtaceae) are recordedhere for the first time as host plants for this pest.

The possibility of predicting the mass transfer controlled CaCO₃ scale removal   rate has been investigated.

Experiments were carried out using chelating agents as a cleaning solution at different time and Reynolds’s number. The results of CaCO₃ scale removal or (mass transfer rate) (as it is the controlling process) are compared with proposed model of prandtl’s and Taylor particularly based on the concept of analogy among momentum and mass transfer.

Correlation for the variation of Sherwood number ( or mass transfer rate ) with Reynolds’s number have been obtained .