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 method is compared with procedures that used different optimization algorithms such as Genetic Algorithm (GA), Differential Evolution (DE), and Invasive Weed Optimization (IWO). The Root Mean Square Error (RMSE) and computation time are used as comparison measures. The proposed method gives the best results among others, and it reaches the target location with an average RMSE of 10-12 with 2.5 seconds average computation time.
This paper demonstrates the design of an algorithm to represent the design stages of fixturing system that serve in increasing the flexibility and automation of fixturing system planning for uniform polyhedral part. This system requires building a manufacturing feature recognition algorithm to present or describe inputs such as (configuration of workpiece) and built database system to represents (production plan and fixturing system exiting) to this algorithm. Also knowledge – base system was building or developed to find the best fixturing analysis (workpiece setup, constraints of workpiece and arrangement the contact on this workpiece) to workpiece.
The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic
... Show MoreThe research aims to identify the level of functional engagement and hope-based thinking of kindergarten teachers, identify if there is a significant difference in functional engagement and hope-based thinking in terms of specialization and years of service for kindergarten teachers, identify if there is a significant correlation between functional engagement and hope-based thinking of kindergarten teachers. The current research is determined by kindergarten teachers in the Second Rusafa Baghdad Education Directorate for the academic year (2022-2023). In order to achieve the objectives of the research, the researcher prepared a functional engagement scale, which consists of (45) items in three areas: Perceptual and functional engagement
... Show MoreElectronic Health Record (EHR) systems are used as an efficient and effective method of exchanging patients’ health information with doctors and other key stakeholders in the health sector to obtain improved patient treatment decisions and diagnoses. As a result, questions regarding the security of sensitive user data are highlighted. To encourage people to move their sensitive health records to cloud networks, a secure authentication and access control mechanism that protects users’ data should be established. Furthermore, authentication and access control schemes are essential in the protection of health data, as numerous responsibilities exist to ensure security and privacy in a network. So, the main goal of our s
... Show More