Various recent events in the Mediterranean sea have shown the enormous importance of maritime search-and-rescue missions. By reducing the time to find floating victims, the number of casualties can be reduced. A major improvement can be achieved by employing unmanned aerial systems for autonomous search missions. In this context, the need for efficient search trajectory planning methods arises....

As a step towards neural realization of various similarity based algorithms k-NN method has been extended to weighted nearest neighbor scheme. Experiments show that for some datasets significant improvements are obtained. As an alternative to the minimization procedures a best–first search weighted nearest neighbor scheme has been implemented. A feature selection method for k-NN, based on a var...

It is well known that the complex step method is a tool that calculates derivatives by imposing a complex step in a strict sense. We extended the method by employing the fractional calculus differential operator in this paper. The fractional calculus can be taken in the sense of the Caputo operator, Riemann-Liouville operator, and so forth. Furthermore, we derived several approximations for com...

We have learned that the numerical solution obtained from Euler's method, converges to the exact solution () of the initial value problem ′ = (,), (0) = 0 , as ℎ → 0. We now analyze the convergence of a general one-step method of the form +1 = + ℎΦ(, , ℎ), for some continuous function Φ(, , ℎ). We define the local truncation error of this one-step method by (ℎ) = (+1) − () ℎ − Φ(, (), ℎ). That ...

The Lax-Friedrichs (LxF) method [2, 3, 4] is a basic method for the solution of hyperbolic partial differential equations (PDEs). Its use is limited because its order is only one, but it is easy to program, applicable to general PDEs, and has good qualitative properties because it is monotone. The LxF method is often used to show the effects of dissipation, but it is not actually a dissipative ...

A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...

This paper proposes an efficient embedding method for scaling kernel k-means on cloud infrastructures. The embedding method allows for approximating the computation of the nearest centroid to each data instance and, accordingly, it eliminates the quadratic space and time complexities of the cluster assignment step in the kernel k-means algorithm. We show that the proposed embedding method is ef...

The kinetics and mechanism of the reaction between benzaldehyde 1, malononitrile 2 and dimedone 3 in a mixture of ethanol and water as solvents in the presence of fructose as a biodegradable catalyst has been studied by the spectroscopic method (UV-Vis spectrophotometry method). The influence of various parameters (temperature, solvent and concentration) was studied on the reaction by means of ...