نتایج جستجو برای: nearness spaces
تعداد نتایج: 130292 فیلتر نتایج به سال:
Where decisions are based on imprecise numeric data and linguistic variables, the development of automated decision aids presents particular difficulties. In such applications, linguistic variables often take their values from a pre-ordered set of vaguely defined linguistic terms. The mathematical structures that arise from the assumption that sets of linguistic terms are pair-wise tolerant are...
Lavrentiev regularization is a popular approach to the solution of linear discrete illposed problems with a Hermitian positive semidefinite matrix. This paper describes Lavrentiev-type regularization methods that can be applied to the solution of linear discrete ill-posed problems with a general Hermitian matrix. Fractional Lavrentiev-type methods as well as modifications suggested by the solut...
This paper presents a new real-time collision avoidance approach for mobile robots. The Nearness Diagram method (ND) performs a high level information extraction and interpr etation of the envir onment. Subsequently, this information is used to gener ate the motion commands. The proposed approach is well-suited to deal with unknown, unstructur edand dynamic envir onments,where problems of other...
We report from a usability study of Digital Television (DTV) with 30 subjects. It was found that content and interface elements should be evaluated in terms of concrete and conceptual nearness with respect to all parts of the DTV experience. Additionally, several features of the DTV application interface were salient in user evaluations: navigation and structure, level of engagement, interface ...
In this paper, we introduce a stationary M∞-fuzzy metric on the set C B(X), where M∞-fuzzy metric can be thought of as the degree of nearness between two fuzzy sets with respect to any positive real number and C B(X) is the class of fuzzy sets with nonempty bounded closed α-cut sets. Under the φ-contraction conditions, we give some common fixed point theorems for self-mappings in the space C B(X).
When using a third language to construct a bilingual dictionary, it is necessary to discriminate equivalencies from inappropriate words derived as a result of ambiguity in the third language. We propose a method to treat this by utilizing the structures of dictionaries to measure the nearness of the meanings of words. The resulting dictionary is a word-to-word bilingual dictionary of nouns and ...
While navigating their environments it is essential for autonomous mobile robots to actively avoid collisions with obstacles. Flying insects perform this behavioural task with ease relying mainly on information the visual system provides. Here we implement a bioinspired collision avoidance algorithm based on the extraction of nearness information from visual motion on the hexapod walking robot ...
Several generalized Wallman type spaces are considered as well as various lattices of subsets therein. In particular, regularity of these lattices and consequences are investigated. Also considered are necessary and sufficient conditions for these lattices to be Lindel6f as well as replete, prime complete, and fully replete.
We prove the existence of designs of small size in a number of contexts. In particular our techniques can be applied to prove the existence of ndesigns on S of size Od(n d log(n)d−1).
A separable Banach space X contains l1 isomorphically if and only if X has a bounded fundamental total wc∗0-stable biorthogonal system. The dual of a separable Banach space X fails the Schur property if and only if X has a bounded fundamental total wc∗0-biorthogonal system.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید