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

The Wang-Ball polynomials operational matrices of the derivatives are used in this study to solve singular perturbed second-order differential equations (SPSODEs) with boundary conditions. Using the matrix of Wang-Ball polynomials, the main singular perturbation problem is converted into linear algebraic equation systems. The coefficients of the required approximate solution are obtained from the solution of this system. The residual correction approach was also used to improve an error, and the results were compared to other reported numerical methods. Several examples are used to illustrate both the reliability and usefulness of the Wang-Ball operational matrices. The Wang Ball approach has the ability to improve the outcomes by minimi

A QR code is a type of barcode that can hold more information than the familiar kind scanned at checkouts around the world. The “QR” stands for “Quick Response”, a reference to the speed at which the large amounts of information they contain can be decoded by scanners. They are being widely used for advertising campaigns, linking to company websites, contest sign-up pages and online menus. In this paper, we propose an efficient module to extract QR code from background and solve problem of rotation in case of inaccurate image taken from mobile camera.

The aim of this essay is to use a single-index model in developing and adjusting Fama-MacBeth.  Penalized smoothing spline regression technique (SIMPLS) foresaw this adjustment.  Two generalized cross-validation techniques, Generalized Cross Validation Grid (GGCV) and Generalized Cross Validation Fast (FGCV), anticipated the regular value of smoothing covered under this technique. Due to the two-steps nature of the Fama-MacBeth model, this estimation generated four estimates: SIMPLS(FGCV) - SIMPLS(FGCV), SIMPLS(FGCV) - SIM PLS(GGCV), SIMPLS(GGCV) - SIMPLS(FGCV), SIM PLS(GGCV) - SIM PLS(GGCV). Three-factor Fama-French model—market risk premium, size factor, value factor, and their implication for excess stock returns and portfolio return

Despite the principle of separation of powers brought by the French Revolution, which entrusted the task of drafting legislation and its amendment to the legislative authority and the task of settling disputes and settling them in the judiciary. However, since that date, the French judiciary has played a major role in the development of French civil law (In spite of all the economic and social developments that have taken place in French society throughout these years) since its promulgation until February of 2016, the date of the Legislative Decree No. 131 of the year 2016 A modification is the largest in the history of the French Civil Code (which was the judicial precedents in which a significant impact), was assisted by the French judic

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