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

The study was performed to isolate and identify the Myxococcus fulvus from the one hundred samples of soils of farms. Special growth conditions had been used to support the growth of M.fulvus local isolates and suppressed the growth of other microorganisms like (Drying , High Temperature , High concentration of antibiotics and specific growth media ) M.fulvus isolates had been subjected to the morphological, cultural , biochemical examination for identification , as well as , study the inhibitory activites of cells and filtrates of localized isolates against some pathogenic fungi include (Trichophyton mentagrophytes , Microsporum gypseum , Aspergillus niger and Fusarium oxyporum ) by using three methods :- Cup assay , well diffusio

Background: Rehabilitation of the carious tooth to establish tooth structure integrity required cavity design that show a benign stress distribution. The aim of this study was to investigate the influence of the cavity position on the stress values in the reamining tooth structure restored with amalgam or resin composite. Materials and methods: Seven 2-D models of maxillary first premolar include class I cavity design was prepared, one sound tooth (A) 3 composite (B1, B2, and B3) and 3 amalgam (C1, C2, and C3). In design (BI and C1) the cavity position is in the mid distance between bacc-lingual cusp tip, design (B2 and C2) and (B3 and C3) shifted toward the buccal cusp and the lingual cusp for 0.5 mm respectively. One hundred N vertical

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

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a

Variable selection is an essential and necessary task in the statistical modeling field. Several studies have triedto develop and standardize the process of variable selection, but it isdifficultto do so. The first question a researcher needs to ask himself/herself what are the most significant variables that should be used to describe a given dataset’s response. In thispaper, a new method for variable selection using Gibbs sampler techniqueshas beendeveloped.First, the model is defined, and the posterior distributions for all the parameters are derived.The new variable selection methodis tested usingfour simulation datasets. The new approachiscompared with some existingtechniques: Ordinary Least Squared (OLS), Least Absolute Shrinkage

    This paper deals with finding the approximation solution of a nonlinear parabolic boundary value problem (NLPBVP) by using the Galekin finite element method (GFEM) in space and Crank Nicolson (CN) scheme in time, the problem then reduce to solve a Galerkin nonlinear algebraic system(GNLAS). The predictor and the corrector technique (PCT) is applied here to solve the GNLAS, by transforms it to a Galerkin linear algebraic system (GLAS). This GLAS is solved once using the Cholesky method (CHM) as it appear in the matlab package and once again using the Cholesky reduction order technique (CHROT) which we employ it here to save a massive time. The results, for CHROT are given by tables and figures and show

The leaves of globe artichoke, Cynara scolymus Family Asteraceae/ compositea have long – used in traditional medicine and now included in British and European Pharmacopeia, the British Harbal Pharmacopeia and complete German Commission E monographs.The plant originally comes from Mediterranean region and North Africa and cultivated around the world. The flowers are used worldwide for nutrition purposes and the leaves for medical purposes including hepatic affections. The plant wildly distributed in Iraq in the watery lines and boundary of the field.The plant contains many phytochemicals such as the bitter phenolic acids whose choleretic and hypocholestremic as these compounds are antioxidant. Other materials to h