نتایج جستجو برای: crisp

تعداد نتایج: 3972  

2001
Hirotaka Suzuki Pascal Matsakis Jacky Desachy

The present work describes a new approach to integrating structural knowledge into the image classification process. First, a fuzzy classifier produces a fuzzy partition of the image. Then, the defuzzified (crisp) partition is tried to be improved. According to the membership degrees in the fuzzy partition, the system selects a set of pixels and associates a set of candidate classes with each o...

Journal: :Fuzzy Sets and Systems 2011
Jose S. Cánovas Jiri Kupka

Let X be a compact metric space and let f : X → X be continuous. It is well known that a given discrete dynamical system (X, f) induces a map Φ on the space F(X) of fuzzy sets. In this paper we study relations between sizes of topological entropies of a given crisp dynamical system (X, f) and its fuzzy counterpart (F(X),Φ). Among another things, we present a constructive proof of the fact that ...

Journal: :Computational Statistics & Data Analysis 2006
Peijun Guo Hideo Tanaka

Upper and lower regression models (dual possibilistic models) are proposed for data analysis with crisp inputs and interval or fuzzy outputs. Based on the given data, the dual possibilistic models can be derived from upper and lower directions, respectively, where the inclusion relationship between these two models holds. Thus, the inherent uncertainty existing in the given phenomenon can be ap...

1996
Andrzej Lozowski Tomasz J. Cholewo Jacek M. Zurada

A method of extracting intuitive knowledge from neural network classifiers is presented in the paper. An algorithm which obtains crisp rules in the form of logical implications which approximately describe the neural network mapping is introduced. The number of extracted rules can be selected using an uncertainty margin parameter as well as by changing the precision level of the soft quantizati...

Journal: :Int. J. General Systems 2004
Anas N. Al-Rabadi Martin Zwick

Modified Reconstructibility Analysis (MRA), a novel decomposition within the framework of set-theoretic (crisp possibilistic) reconstructibility analysis, is presented. It is shown that in some cases, while three-variable NPNclassified Boolean functions are not decomposable using Conventional Reconstructibility Analysis (CRA), they are decomposable using MRA. Also, it is shown that whenever a d...

2012
Stefan Borgwardt Felix Distel Rafael Peñaloza

Ontology consistency has been shown to be undecidable for a wide variety of fairly inexpressive fuzzy Description Logics (DLs). In particular, for any t-norm “starting with” the Lukasiewicz t-norm, consistency of crisp ontologies (w.r.t. witnessed models) is undecidable in any fuzzy DL with conjunction, existential restrictions, and (residual) negation. In this paper we show that for any t-norm...

1987
Alan D. Berenbaum David R. Ditzel Hubert R. McLellan

The AT&T CRISP Microprocessor is a high performance general purpose 32-bit processor. It is a single CMOS chip containing 172,163 transistors. The instruction-set architecture is a registerless 21⁄2 address memory-to-memory machine with a small number of instructions and addressing modes.1 The CRISP instruction-set is relatively independent of any particular implementation. High performance is ...

2008
G. B. Scharmer M. G. Löfdahl D. Kiselman P. Sütterlin M. van Noort A. Lagg

We discuss penumbral fine structure in a small part of a pore, observed with the CRISP imaging spectropolarimeter at the Swedish 1-m Solar Telescope (SST), close to its diffraction limit of 0. 16. Milne–Eddington inversions applied to these Stokes data reveal large variations of field strength and inclination angle over dark-cored penumbral intrusions and a dark-cored light bridge. The mid-oute...

2007
Jacobus Venter Alta de Waal Cornelius Willers

The use of all forms of computer and communication devices is changing human interaction and thinking. Electronic traces of actions and activities are continually being left behind most often unknowingly so. This situation creates opportunities for criminal investigators to make use of these traces and marks to uncover evidence. In this evidentiary discovery process several problems are experie...

2010
Mathias Bank Friedhelm Schwenker

User generated content from fora, weblogs and other social networks is a very fast growing data source in which different information extraction algorithms can provide a convenient data access. Hierarchical clustering algorithms are used to provide topics covered in this data on different levels of abstraction. During the last years, there has been some research using hierarchical fuzzy algorit...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید