Search results for " Classification"
showing 10 items of 1043 documents
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
2008
We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet. To this purpose, we consider automata that recognize such submonoids and we study the product automata recognizing their intersection. By using automata methods we obtain a new proof of a result of Karhumaki on the cha- racterization of the intersection of two submonoids of rank two, in the case of prefix (or suffix) generators. In a more general setting, for an arbitrary number of generators, we prove that if H and K are two finitely generated submonoids generated by prefix sets such that the product automaton associated to H ∩ K has a given special property then �(H ∩ K) ≤ �(H)�(K…
On generalized a-Browder's theorem
2007
We characterize the bounded linear operators T satisfying generalized a-Browder's theorem, or generalized a-Weyl's theorem, by means of localized SVEP, as well as by means of the quasi-nilpotent part H0(�I T) asbelongs to certain sets of C. In the last part we give a general framework in which generalized a-Weyl's theorem follows for several classes of operators. 1. Preliminaries. Let L(X) denote the space of bounded linear oper- ators on an infinite-dimensional complex Banach space X. For T ∈ L(X), denote by α(T) the dimension of the kernel ker T, and by β(T) the codi- mension of the range T(X). The operator T ∈ L(X) is called upper semi- Fredholm if α(T) < ∞ and T(X) is closed, and lower …
Weakly compact multilinear mappings
1997
The notion of Arens regularity of a bilinear form on a Banach space E is extended to continuous m-linear forms, in such a way that the natural associated linear mappings, E→L (m−1E) and (m – l)-linear mappings E × … × E → E', are all weakly compact. Among other applications, polynomials whose first derivative is weakly compact are characterized.
Upper and lower approximations of general aggregation operators based on fuzzy rough sets
2015
Our paper deals with constructions of upper and lower general aggregation operators which act on fuzzy sets. These constructions are based on fuzzy rough sets and provide two approximations (upper and lower) of the pointwise extension and the t-extension of an ordinary aggregation operator. Considering two lattices of corresponding general aggregation operators we describe two approximate systems with respect to a lattice of fuzzy equivalence relations.
Topological classification of gradient-like diffeomorphisms on 3-manifolds
2004
Abstract We give a complete invariant, called global scheme , of topological conjugacy classes of gradient-like diffeomorphisms, on compact 3-manifolds. Conversely, we can realize any abstract global scheme by such a diffeomorphism.
The Action of the Symplectic Group Associated with a Quadratic Extension of Fields
1999
Abstract Given a quadratic extension L/K of fields and a regular alternating space (V, f) of finite dimension over L, we classify K-subspaces of V which do not split into the orthogonal sum of two proper K-subspaces. This allows one to determine the orbits of the group SpL(V, f) in the set of K-subspaces of V.
Ranking fuzzy interval numbers in the setting of random sets – further results
1999
Abstract We present some new properties of several fuzzy order relations, defined on the set of fuzzy numbers, from among those introduced in [S. Chanas, M. Delgado, J.L. Verdegay, M.A. Vila, Information Sciences 69 (1993) 201–217]. The main result is proving that four from among the relations considered in [S. Chanas, M. Delgado, J.L. Verdegay, M.A. Vila, Information Sciences 69 (1993) 201–217] are strongly transitive (s-transitive).
Common fixed points of mappings satisfying implicit contractive conditions
2012
In this article we obtain, in the setting of metric spaces or ordered metric spaces, coincidence point, and common fixed point theorems for self-mappings in a general class of contractions defined by an implicit relation. Our results unify, extend, generalize many related common fixed point theorems from the literature. Mathematics Subject Classification (2000): 47H10, 54H25.
Filtering of Spontaneous and Low Intensity Emotions in Educational Contexts
2015
Affect detection is a challenging problem, even more in educational contexts, where emotions are spontaneous and usually subtle. In this paper, we propose a two-stage detection approach based on an initial binary discretization followed by a specific emotion prediction stage. The binary classification method uses several distinct sources of information to detect and filter relevant time slots from an affective point of view. An accuracy close to 75% at detecting whether the learner has felt an educationally relevant emotion on 20 second time slots has been obtained. These slots can then be further analyzed by a second classifier, to determine the specific user emotion.
Uno studio sulla “dissenting opinion” con particolare riguardo all’esperienza del diritto inglese
2023
The essay explores the many means through which judicial dissent has traditionally made its way into the English legal system in order to be finally accepted as an ineliminable instrument that the minority has availed itself of to air its differing opinion, mostly in matters of general, public importance. So, the research is in the first place directed towards the identification of the different types of dissent and of the forms (even concurring) in which it may be shaped. Furthermore, the study involves the attempt to find out what reasons may underlie the expression of dissent and whether they may conceal some kind of idyiosincratic state of mind on the part of the dissenters. A view is a…