In this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier. A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solvin

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

Image compression is a serious issue in computer storage and transmission,  that simply makes efficient use of redundancy embedded within an image itself; in addition, it may exploit human vision or perception limitations to reduce the imperceivable information Polynomial coding is a modern image compression technique based on modelling concept to remove the spatial redundancy embedded within the image effectively that composed of two parts, the  mathematical model and the residual. In this paper, two stages proposed technqies adopted, that starts by utilizing the lossy predictor model along with multiresolution base and thresholding techniques corresponding to first stage. Latter by incorporating the near lossless com

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

As a result of recent developments in highway research as well as the increased use of vehicles, there has been a significant interest paid to the most current, effective, and precise Intelligent Transportation System (ITS). In the field of computer vision or digital image processing, the identification of specific objects in an image plays a crucial role in the creation of a comprehensive image. There is a challenge associated with Vehicle License Plate Recognition (VLPR) because of the variation in viewpoints, multiple formats, and non-uniform lighting conditions at the time of acquisition of the image, shape, and color, in addition, the difficulties like poor image resolution, blurry image, poor lighting, and low contrast, these

In this paper, a simple fast lossless image compression method is introduced for compressing medical images, it is based on integrates multiresolution coding along with polynomial approximation of linear based to decompose image signal followed by efficient coding. The test results indicate that the suggested method can lead to promising performance due to flexibility in overcoming the limitations or restrictions of the model order length and extra overhead information required compared to traditional predictive coding techniques.

RA Ali, LK Abood, Int J Sci Res, 2017 - Cited by 2

Recently, detecting dynamic patterns for growing communities in social networks have attracted significant attention. The objective of dynamic community detection is to analyze and identify clusters in complex networks that change over time. Different optimization algorithms, including both single-objective and multi-objective approaches, have been employed to address the challenge of dynamic community detection. Although current evolutionary algorithms for identifying community structure can traverse extensive areas of partition space, they often become stuck in local minima. In addition, limited studies have addressed this issue by integrating local search strategies with evolutionary algorithms for community identification. This paper in