Calculating the Inverse Kinematic (IK) equations is a complex problem due to the nonlinearity of these equations. Choosing the end effector orientation affects the reach of the target location. The Forward Kinematics (FK) of Humanoid Robotic Legs (HRL) is determined by using DenavitHartenberg (DH) method. The HRL has two legs with five Degrees of Freedom (DoF) each. The paper proposes using a Particle Swarm Optimization (PSO) algorithm to optimize the best orientation angle of the end effector of HRL. The selected orientation angle is used to solve the IK equations to reach the target location with minimum error. The performance of the proposed method is measured by six scenarios with different simulated positions of the legs. The proposed

In our article, three iterative methods are performed to solve the nonlinear differential equations that represent the straight and radial fins affected by thermal conductivity. The iterative methods are the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM) to get the approximate solutions. For comparison purposes, the numerical solutions were further achieved by using the fourth Runge-Kutta (RK4) method, Euler method and previous analytical methods that available in the literature. Moreover, the convergence of the proposed methods was discussed and proved. In addition, the maximum error remainder values are also evaluated which indicates that the propo

Brachytherapy treatment is primarily used for the certain handling kinds of cancerous tumors. Using radionuclides for the study of tumors has been studied for a very long time, but the introduction of mathematical models or radiobiological models has made treatment planning easy. Using mathematical models helps to compute the survival probabilities of irradiated tissues and cancer cells. With the expansion of using HDR-High dose rate Brachytherapy and LDR-low dose rate Brachytherapy for the treatment of cancer, it requires fractionated does treatment plan to irradiate the tumor. In this paper, authors have discussed dose calculation algorithms that are used in Brachytherapy treatment planning. Precise and less time-consuming calculations

Algorithms using the second order of B -splines [B (x)] and the third order of B -splines [B,3(x)] are derived to solve 1' , 2nd and 3rd linear Fredholm integro-differential equations (F1DEs). These new procedures have all the useful properties of B -spline function and can be used comparatively greater computational ease and efficiency.The results of these algorithms are compared with the cubic spline function.Two numerical examples are given for conciliated the results of this method.

Texture synthesis using genetic algorithms is one way; proposed in the previous research, to synthesis texture in a fast and easy way. In genetic texture synthesis algorithms ,the chromosome consist of random blocks selected manually by the user .However ,this method of selection is highly dependent on the experience of user .Hence, wrong selection of blocks will greatly affect the synthesized texture result. In this paper a new method is suggested for selecting the blocks automatically without the participation of user .The results show that this method of selection eliminates some blending caused from the previous manual method of selection.

Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o

Within the framework of big data, energy issues are highly significant. Despite the significance of energy, theoretical studies focusing primarily on the issue of energy within big data analytics in relation to computational intelligent algorithms are scarce. The purpose of this study is to explore the theoretical aspects of energy issues in big data analytics in relation to computational intelligent algorithms since this is critical in exploring the emperica aspects of big data. In this chapter, we present a theoretical study of energy issues related to applications of computational intelligent algorithms in big data analytics. This work highlights that big data analytics using computational intelligent algorithms generates a very high amo

Recent growth in transport and wireless communication technologies has aided the evolution of Intelligent Transportation Systems (ITS). The ITS is based on different types of transportation modes like road, rail, ocean and aviation. Vehicular ad hoc network (VANET) is a technology that considers moving vehicles as nodes in a network to create a wireless communication network. VANET has emerged as a resourceful approach to enhance the road safety. Road safety has become a critical issue in recent years. Emergency incidents such as accidents, heavy traffic and road damages are the main causes of the inefficiency of the traffic flow. These occurrences do not only create the congestion on the road but also increase the fuel consumption and p

In this paper, game theory was used and applied to the transport sector in Iraq, as this sector includes two axes, the public transport axis and the second axis the private transport axis, as each of these axes includes several types of transport, namely (sea transport, air transport, land transport, transport by rail, port transport) and the travel and tourism sector, as public transport lacks this sector, as the competitive advantage matrix for the transport sector was formed and after applying the MinMax-MaxMin principle to the matrix in all its stages, it was found that there was an equilibrium point except for the last stage where the equilibrium point was not available Therefore, the use of the linear programming method was