In this work we will propose an acceleration procedure for the Mitchell–Demyanov–Malozemov (MDM) algorithm (a fast geometric algorithm for SVM construction) that may yield quite large training savings. While decomposition algorithms such as SVMLight or SMO are usually the SVM methods of choice, we shall show that there is a relationship between SMO and MDM that suggests that, at least in their ...

Although the v-Support Vector Machine, v-SVM, (SchSlkopf et al., 2000) has the advantage of using a single parameter v to control both the number of support vectors and the fraction of margin errors, there are two issues that prevent it from being used in many real world applications. First, unlike the C-SVM that allows asymmetric misclassification cost, v-SVM uses a symmetric misclassification...

In this paper we investigate stable vector bundles on the complex projective plane P by means of their minimal free resolution. The fundamental background for this study is the work of Bohnhorst and Spindler [BS92] and their idea to use admissible pairs to characterize the stability of rank-n vector bundles on P and to give a stratification of the relative moduli space in constructible subsets....

in this paper, we study fuzzy substructures in connection withhv-structures. the original idea comes from geometry, especially from thetwo dimensional euclidean vector space. using parameters, we obtain a largenumber of hyperstructures of the group-like or ring-like types. we connect,also, the mentioned hyperstructures with the theta-operations to obtain morestrict hyperstructures, as hv-groups...

We present an eecient algorithm for computing the minimal trellis for a group code over a nite Abelian group, given a generator matrix for the code. We also show how to compute a succinct representation of the minimal trellis for such a code, and present algorithms that use this information to eeciently compute local descriptions of the minimal trellis. This extends the work of Kschischang and ...

We calculate the induced Einstein action from supersymmetric models in general space-time. Supersymmetric models consist of two kinds of supermultiplets, called scalar supermultiplets and vector supermultiplets, respectively. We show that the vector multiplets generate a negative Newton constant, while the scalar multiplets a positive one. Then we find that the positivity of Newton constant dep...

MOTIVATION To produce a polygonal display of RNA secondary structure with minimal overlap and distortion of structural elements, with minimal search for positioning them, and with minimal user intervention. RESULTS A new algorithm for automatically drawing RNA secondary structure has been developed. The algorithm represents the direction and space for a structural element using vector and vec...

in 1997, fang proposed the concept of boundedness of $l$-fuzzy setsin $l$-topological vector spaces. since then, this concept has beenwidely accepted and adopted in the literature. in this paper,several characterizations of bounded $l$-fuzzy sets in$l$-topological vector spaces are obtained and some properties ofbounded $l$-fuzzy sets are investigated.

We start from a new theory (discussed earlier) in which the arena for physics is not spacetime, but its straightforward extension—the so called Clifford space (C-space), a manifold of points, lines, areas, etc..; physical quantities are Clifford algebra valued objects , called polyvectors. This provides a natural framework for description of super-symmetry, since spinors are just left or right ...

The study of vector optimization problems has recently been a rapidly growing area of research. See, for example, [1–5] and the references mentioned therein. In this paper we study a class of vector minimization problems on a complete metric space such that all its bounded closed subsets are compact. This class of problems is associated with a complete metric space of continuous vector function...