In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot.  Simulation results, whi

Addressed the problem of the research is marked: (Performing processors for the time between Impressionism and superrealism) the concept of time and how to submit artwork. The search came in four sections: general framework for research and identified the research problem and the need for him. With an indication of the importance of his presence. Then determine the research objectives of (detection processors performing to the concept of time in works of art in each of Impressionism and superrealism. And a comparison between them to reveal similarities and differences), followed by the establishment of boundaries Find three (objectivity, the temporal and spatial) were then determine the terms related to the title. Then provide the theore

Bootstrap is one of an important re-sampling technique which has given the attention of  researches recently. The presence of outliers in the original data set may cause serious problem to the classical bootstrap when the percentage of outliers are higher than the original one. Many methods are proposed to overcome this problem such  Dynamic Robust Bootstrap for LTS (DRBLTS) and Weighted Bootstrap with Probability (WBP). This paper try to show the accuracy of parameters estimation by comparison the results of both methods. The bias , MSE and RMSE are considered. The criterion of the accuracy is based on the RMSE value since the method that provide us RMSE value smaller than other is con

This study compared in vitro the microleakage of a new low shrink silorane-based posterior composite (Filtek™ P90) and two methacrylate-based composites: a packable posterior composite (Filtek™ P60) and a nanofill composite (Filtek™ Supreme XT) through dye penetration test. Thirty sound human upper premolars were used in this study. Standardized class V cavities were prepared at the buccal surface of each tooth. The teeth were then divided into three groups of ten teeth each: (Group 1: restored with Filtek™ P90, Group 2: restored with Filtek™ P60, and Group 3: restored with Filtek™ Supreme XT). Each composite system was used according to the manufacturer's instructions with their corresponding adhesive systems. The teeth were th

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over