Results 221 to 230 of about 426,064 (264)
Some of the next articles are maybe not open access.
Information Sciences, 1991
Abstract Let V denote a vector space over a field F and let A denote a fuzzy subspace of V over a fuzzy subfield K of F . Let X be a fuzzy subset of V such that X ⊆ A and let 〈 X 〉 denote the intersection of all fuzzy subspaces of V over K that contain X and are contained in A . We characterize the fuzzy subspace 〈 X 〉 of A
D. S. Malik, John N. Mordeson
openaire +1 more source
Abstract Let V denote a vector space over a field F and let A denote a fuzzy subspace of V over a fuzzy subfield K of F . Let X be a fuzzy subset of V such that X ⊆ A and let 〈 X 〉 denote the intersection of all fuzzy subspaces of V over K that contain X and are contained in A . We characterize the fuzzy subspace 〈 X 〉 of A
D. S. Malik, John N. Mordeson
openaire +1 more source
ON VALUATIONS OF VECTOR SPACES
JP Journal of Algebra, Number Theory and Applications, 2016Let \(R\) be an integral domain with quotient field \(K\) and assume that \(M\) is a unitary torsion-free \(R\)-module. Following the paper [\textit{J. Moghaderi} and \textit{R. Nekooei}, Int. Electron. J. Algebra 8, 18--29 (2010; Zbl 1257.13002)] the authors call \(M\) a valuation module if for each \(0\neq x\in K\), either \(xM\subseteq M\) or \(x ...
Irwan, Sri Efrinita +2 more
openaire +1 more source
2011 IEEE International Conference on Granular Computing, 2011
Rough set theory proposed by Pawlak, is a complementary generalization of classical set theory. The relations between rough sets and algebraic systems endowed with two binary operations such as rings, groups and semigroups have been already considered. Wu, Xie and Cao defined a pair of rough approximation operators based on a sub-space.
Mingfen Wu, Xiangyun Xie
openaire +1 more source
Rough set theory proposed by Pawlak, is a complementary generalization of classical set theory. The relations between rough sets and algebraic systems endowed with two binary operations such as rings, groups and semigroups have been already considered. Wu, Xie and Cao defined a pair of rough approximation operators based on a sub-space.
Mingfen Wu, Xiangyun Xie
openaire +1 more source
Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348), 1999
This paper focuses on a novel class of morphological filters called levelings and their extension to vector spaces. Unlike many filtering techniques reported in the literature, levelings suppress details while preserving perfectly the contours of the remaining objects.
Cristina Gomila, Fernand Meyer
openaire +1 more source
This paper focuses on a novel class of morphological filters called levelings and their extension to vector spaces. Unlike many filtering techniques reported in the literature, levelings suppress details while preserving perfectly the contours of the remaining objects.
Cristina Gomila, Fernand Meyer
openaire +1 more source
Applied Mathematics and Computation, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oskar Maria Baksalary, Götz Trenkler
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oskar Maria Baksalary, Götz Trenkler
openaire +2 more sources
2018 6th International Symposium on Computational and Business Intelligence (ISCBI), 2018
This research work is devoted to the general Optimaliy presented inside the best appropriate environment of the Infinite Dimensional Ordered Vector Spaces, with its natural projections in the Vectorial Optimization. It is also a short but original scientific Survey on the Efficiency by the Optimality and conversely, in the most general context of the ...
openaire +1 more source
This research work is devoted to the general Optimaliy presented inside the best appropriate environment of the Infinite Dimensional Ordered Vector Spaces, with its natural projections in the Vectorial Optimization. It is also a short but original scientific Survey on the Efficiency by the Optimality and conversely, in the most general context of the ...
openaire +1 more source
1978
In nearly all of the discussion to follow we shall deal with the set of real numbers. Occasionally, however, we shall deal with complex numbers as well. In order to avoid cumbersome repetition we shall denote the set we are dealing with by F and let the context elucidate whether we are speaking of real or complex numbers or both.
openaire +1 more source
In nearly all of the discussion to follow we shall deal with the set of real numbers. Occasionally, however, we shall deal with complex numbers as well. In order to avoid cumbersome repetition we shall denote the set we are dealing with by F and let the context elucidate whether we are speaking of real or complex numbers or both.
openaire +1 more source
1979
Throughout what follows a row vector a’ = (al,a2,…,an) is an ordered n-tuple of complex numbers ...
openaire +1 more source
Throughout what follows a row vector a’ = (al,a2,…,an) is an ordered n-tuple of complex numbers ...
openaire +1 more source
1978
Before embarking on our study of the elementary properties of vector spaces and their linear subspaces in the succeeding chapters, let us collect a list of examples of vector spaces. Of basic importance are the three examples ℝ k , P n (ℝ), and Fun(S) described in Section 3.1.
openaire +1 more source
Before embarking on our study of the elementary properties of vector spaces and their linear subspaces in the succeeding chapters, let us collect a list of examples of vector spaces. Of basic importance are the three examples ℝ k , P n (ℝ), and Fun(S) described in Section 3.1.
openaire +1 more source
From Vector Space Models to Vector Space Models of Semantics
2018This paper assesses the performance of frequency and concept based text representation in Mixed Script Information Retrieval and Classification tasks. In text analytics, representation serves as an unresolved research problem to progress further towards different applications.
Barathi Ganesh H. B. +2 more
openaire +1 more source