In this paper, the construction of Hermite wavelets functions and their operational matrix of integration is presented. The Hermite wavelets method is applied to solve nth order Volterra integro diferential equations (VIDE) by expanding the unknown functions, as series in terms of Hermite wavelets with unknown coefficients. Finally, two examples are given

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

In this research was to use the method of classic dynamic programming (CDP) and the method of fuzzy dynamic programming (FDP) to controlling the inventory in N periods and only one substance ,in order to minimize the total cost and determining the required quantity in warehouse rusafa principal of the ministry of commerce . A comparison was made between the two techniques، We found that the value of fuzzy total cost is less than that the value of classic total cost

تعد المبارزة أحد الألعاب الرياضية التي يتأثر فيها الأداء بتطور القدرات الخاصة بالأداء ومنها تحمل (سرعة وقوة الأداء ),وأن أكثر الأساليب السابقة في تدريب تطوير تحمل(سرعة وقوة الأداء) بالمبارزة تكون على ارض صلبة مثل الخشب والألمنيوم آو الإسفلت وفي بعض القاعات يكون التارتان, وظل هذا الأسلوب لفترات طويلة في العراق ،حيث تستخدم تدريبات الإثقال التي تعمل على تنمية تحمل القوة . أما في الوقت الحاضر فقد ظهر اتجاه حديث في

Iraqi EFL college instructors, who supervise the teaching practice of EFL student teachers, commonly experience the inefficient teaching performance of prospective teachers. This inefficiency is usually due to their inability to make connections between the practical experience and the theoretical knowledge of TEFL. One of the reasons behind this inability may be the employment of traditional ways of training and instructing student teachers. Moreover, it is usually noticed that many Iraqi EFL student teachers have a negative attitude toward the teaching profession. They explicitly state that they would join the teaching force only if they fail to work in any other field.

NA Nasir, H Amir, Faculty of medicine - Iraq, 2017 - Cited by 13

Solid waste is a major issue in today's world. Which can be a contributing factor to pollution and the spread of vector-borne diseases. Because of its complicated nonlinear processes, this problem is difficult to model and optimize using traditional methods. In this study, a mathematical model was developed to optimize the cost of solid waste recycling and management. In the optimization phase, the salp swarm algorithm (SSA) is utilized to determine the level of discarded solid waste and reclaimed solid waste. An optimization technique SSA is a new method of finding the ideal solution for a mathematical relationship based on leaders and followers. It takes a lot of random solutions, as well as their outward or inward fluctuations, t

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