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

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).

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

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

One of the most difficult issues in the history of communication technology is the transmission of secure images. On the internet, photos are used and shared by millions of individuals for both private and business reasons. Utilizing encryption methods to change the original image into an unintelligible or scrambled version is one way to achieve safe image transfer over the network. Cryptographic approaches based on chaotic logistic theory provide several new and promising options for developing secure Image encryption methods. The main aim of this paper is to build a secure system for encrypting gray and color images. The proposed system consists of two stages, the first stage is the encryption process, in which the keys are genera

         The issue of penalized regression model has received considerable critical attention to variable selection. It plays an essential role in dealing with high dimensional data. Arctangent denoted by the Atan penalty has been used in both estimation and variable selection as an efficient method recently. However, the Atan penalty is very sensitive to outliers in response to variables or heavy-tailed error distribution. While the least absolute deviation is a good method to get robustness in regression estimation. The specific objective of this research is to propose a robust Atan estimator from combining these two ideas at once. Simulation experiments and real data applications show that the p

The purpose of this research was to investigate the beneficial effects of phosphatidylcholine in reducing changes in both lipid and protein profiles in addition to atherogenic index in adult rats with fructose-induced metabolic syndrome. Thirty-six mature Wistar Albino female rats (Rattus norvegicus) (aged 12-15 weeks and weighing 200±10 g) were divided randomly into four groups (G1, G2, G3, and G4); then variable treatments were orally administered for 62 days as follows: G1 (Control group), received distilled water; G2, treated with phosphatidylcholine (PC) orally (1 g/kg BW); G3 (Fr), orally dosed with 40% fructose and 25% fructose mixed with drinking water; G4 (Fr+PC), were also intubated with 40% fr

Thermal and catalytic pyrolysis of waste plastics in an inert atmosphere has been regarded as a creative method, since pyrolysis can convert plastics waste into hydrocarbons that can be used either as fuels or as a source of chemicals.

Natural Iraqi kaolin clay was used to synthesis the NaX nano- zeolite by hydrothermal conditions with average particle size equal to 77.63nm.Thermal decomposition kinetics of high-density polyethylene (HDPE) in the absence and presence of catalysts nano NaX Zeolite was investigated. Thermal and catalytic degradation of HDPE was performed using a thermogravimetric analyzer in nitrogen atmosphere under non-isothermal conditions 4, 7 and 10 °C/min heating rates were employed in thermogravimetric anal