Nearest neighbor and instance-based learning techniques typically handle continuous and linear input values well, but often do not handle symbolic input attributes appropriately. The Value Difference Metric (VDM) was designed to find reasonable distance values between symbolic attribute values, but it largely ignores continuous attributes, using discretization to map continuous values into symb...

In the context of rough paths theory, we study the regularity of the Itô map with respect to the starting point, the coefficients and perturbation of the driving rough paths. In particular, we show that the Itô map is differentiable with a Hölder or Lipschitz continuous derivatives. With respect to the current literature on the subject, our proof rely on perturbation of linear Rough Differentia...

In this paper, we give a characterization of strongly Jordan zero-product preserving maps on normed algebras as a generalization of  Jordan zero-product preserving maps. In this direction, we give some illustrative examples to show that the notions of strongly zero-product preserving maps and strongly Jordan zero-product preserving maps are completely different. Also, we prove that the direct p...

In this paper, we introduce the notion of sesquilinear map on Β(H) . Based on this notion, we define the quadratic map, which is the generalization of positive linear map. With the help of this concept, we prove several well-known equality and inequality...  

Satellite remote sensing data has significant potential use in analysis of natural hazards such as landslides. Relying on the recent advances in satellite remote sensing and geographic information system (GIS) techniques, this paper aims to map landslide susceptibility over most of the globe using a GIS-based weighted linear combination method. First, six relevant landslide-controlling factors ...

a common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the weierstrass canonical form. the weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. the present ...

The paper is concerned with a generalization of concepts introduced in [13], i.e. introduced are matrices of linear transformations over a finitedimensional vector space. Introduced are linear transformations over a finitedimensional vector space depending on a given matrix of the transformation. Finally, I prove that the rank of linear transformations over a finite-dimensional vector space is ...

Introduction. Kakutani's fixed point theorem [3]1 states that in Euclidean «-space a closed point to (nonvoid) convex set map of a convex compact set into itself has a fixed point. Kakutani showed that this implied the minimax theorem for finite games. The object of this note is to point out that Kakutani's theorem may be extended to convex linear topological spaces, and implies the minimax the...