نتایج جستجو برای: relative vcech closure operator
تعداد نتایج: 530536 فیلتر نتایج به سال:
Considering the fact that fish biodiversity conservation and land uses planning, require reliable information about fish distribution and habitat use patterns In order to describe species habitat properties, habitat use and habitat selectivity indices are applied. Relative frequency and environmental variables, depth, width, slope of river, altitude, velocity, substrate, Overstream canopy closu...
In this paper we have characterized the epimorphisms in the full subcategory of Hausdorff fuzzy topological spaces (introduced by Srivastava et al.[10]) of the category FTS of fuzzy topological spaces and fuzzy continuous functions using the Salbanytype closure operator.
In this paper first order theories for nonmonotone inductive definitions are introduced, and a proof-theoretic analysis for such theories based on combined operator forms à la Richter with recursively inaccessible and Mahlo closure ordinals is given.
I describe a way of blurring an exponential field in a way which preserves the natural closure operator. The results of blurring the complex exponential field and of blurring Zilber’s exponential field are isomorphic.
This paper deals with closure properties of models of fuzzy attribute implications. Fuzzy attribute implications are particular IF-THEN rules which can be interpreted in data tables with fuzzy attributes and/or ranked data tables over domains with similarity relations. We show that models of any set of fuzzy attribute implications form a fuzzy closure system with hedge. Conversely, we show that...
If T is a bounded linear mapping (briefly, operator) in a Hilbert space 3C, the numerical range of T is the set WiT) = {(Tx, x): |[x|| = l}; thus WiT) is convex [8, p. 131], and its closure clfW^r)] is compact and convex. Roughly speaking, in this note we observe that cl[TF(T)] can be uniquely defined for an element T of an abstract C*-algebra, while WiT) cannot. The C*-algebra setting yields a...
Link-based data may be studied formally by means of unordered trees. On a dataset formed by such link-based data, a natural notion of support-based closure can be immediately defined. Abstracting information from subsets of such data requires, first, a formal notion of intersection; second, deeper understanding of the notion of closure; and, third, efficient algorithms for computing intersectio...
Concurrent games as event structures form a partial order model of concurrency where concurrent behaviour is captured by nondeterministic concurrent strategies—a class of maps of event structures. Extended with winning conditions, the model is also able to give semantics to logics of various kinds. An interesting subclass of this game model is the one considering deterministic strategies only, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید