Analytical solutions forfuzzysystem using power series approach

The aim of the present paper is present a relatively new analytical method, called residual power series (RPS) method, for solving system of fuzzy initial value problems under strongly generalized differentiability. The technique methodology provides the solution in the form of a rapidly convergent series with easily computable components using symbolic computation software. Several computational experiments are given to show the good performance and potentiality of the proposed procedure. The results reveal that the present simulated method is very effective, straightforward and powerful methodology to solve such fuzzy equations

REPRODUCING KERNEL METHOD FOR SOLVING FUZZY INITIAL VALUE PROBLEMS

In this thesis, numerical solution of the fuzzy initial value problem will be investigated based on the reproducing kernel method. Problems of this type are either difficult to solve or impossible, in some cases, since they will produce a complicated optimized problem. To overcome this challenge, reproducing kernel method will be modified to solve this type of problems. Theoretical and numerical results will be presented to show the efficiency of the proposed method

Spectral and spatial methods for the classification of urban remote sensing data

Lors de ces travaux, nous nous sommes intéressés au problème de la classification supervisée d'images satellitaires de zones urbaines. Les données traitées sont des images optiques à très hautes résolutions spatiales: données panchromatiques à très haute résolution spatiale (IKONOS, QUICKBIRD, simulations PLEIADES) et des images hyperspectrales (DAIS, ROSIS). Deux stratégies ont été proposées. La première stratégie consiste en une phase d'extraction de caractéristiques spatiales et spectrales suivie d'une phase de classification. Ces caractéristiques sont extraites par filtrages morphologiques : ouvertures et fermetures géodésiques et filtrages surfaciques auto-complémentaires. La classification est réalisée avec les machines à vecteurs supports (SVM) non linéaires. Nous proposons la définition d'un noyau spatio-spectral utilisant de manière conjointe l'information spatiale et l'information spectrale extraites lors de la première phase. La seconde stratégie consiste en une phase de fusion de données pre- ou post-classification. Lors de la fusion postclassification, divers classifieurs sont appliqués, éventuellement sur plusieurs données issues d'une même scène (image panchromat ique, image multi-spectrale). Pour chaque pixel, l'appartenance à chaque classe est estimée à l'aide des classifieurs. Un schéma de fusion adaptatif permettant d'utiliser l'information sur la fiabilité locale de chaque classifieur, mais aussi l'information globale disponible a priori sur les performances de chaque algorithme pour les différentes classes, est proposé. Les différents résultats sont fusionnés à l'aide d'opérateurs flous. Les méthodes ont été validées sur des images réelles. Des améliorations significatives sont obtenues par rapport aux méthodes publiées dans la litterature

An attractive numerical algorithm for solving nonlinear Caputo-Fabrizio fractional Abel differential equation in a Hilbert space

Our aim in this paper is presenting an attractive numerical approach giving an accurate solution to the nonlinear fractional Abel differential equation based on a reproducing kernel algorithm with model endowed with a Caputo-Fabrizio fractional derivative. By means of such an approach, we utilize the Gram-Schmidt orthogonalization process to create an orthonormal set of bases that leads to an appropriate solution in the Hilbert space H-2[a, b]. We investigate and discuss stability and convergence of the proposed method. The n-term series solution converges uniformly to the analytic solution. We present several numerical examples of potential interests to illustrate the reliability, efficacy, and performance of the method under the influence of the Caputo-Fabrizio derivative. The gained results have shown superiority of the reproducing kernel algorithm and its infinite accuracy with a least time and efforts in solving the fractional Abel-type model. Therefore, in this direction, the proposed algorithm is an alternative and systematic tool for analyzing the behavior of many nonlinear temporal fractional differential equations emerging in the fields of engineering, physics, and sciences

Cellular Automata Applications in Shortest Path Problem

Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra's algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms' behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum's behavior, finding the minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From software to wetware. Springer, 201

New Challenges Arising in Engineering Problems with Fractional and Integer Order

Mathematical models have been frequently studied in recent decades, in order to obtain the deeper properties of real-world problems. In particular, if these problems, such as finance, soliton theory and health problems, as well as problems arising in applied science and so on, affect humans from all over the world, studying such problems is inevitable. In this sense, the first step in understanding such problems is the mathematical forms. This comes from modeling events observed in various fields of science, such as physics, chemistry, mechanics, electricity, biology, economy, mathematical applications, and control theory. Moreover, research done involving fractional ordinary or partial differential equations and other relevant topics relating to integer order have attracted the attention of experts from all over the world. Various methods have been presented and developed to solve such models numerically and analytically. Extracted results are generally in the form of numerical solutions, analytical solutions, approximate solutions and periodic properties. With the help of newly developed computational systems, experts have investigated and modeled such problems. Moreover, their graphical simulations have also been presented in the literature. Their graphical simulations, such as 2D, 3D and contour figures, have also been investigated to obtain more and deeper properties of the real world problem

Solutions to Uncertain Volterra Integral Equations by Fitted Reproducing Kernel Hilbert Space Method

We present an efficient modern strategy for solving some well-known classes of uncertain integral equations arising in engineering and physics fields. The solution methodology is based on generating an orthogonal basis upon the obtained kernel function in the Hilbert space 1 2 [ , ] in order to formulate the analytical solutions in a rapidly convergent series form in terms of their -cut representation. The approximation solution is expressed by -term summation of reproducing kernel functions and it is convergent to the analytical solution. Our investigations indicate that there is excellent agreement between the numerical results and the RKHS method, which is applied to some computational experiments to demonstrate the validity, performance, and superiority of the method. The present work shows the potential of the RKHS technique in solving such uncertain integral equations