نتایج جستجو برای: compositional rule of inference crialgorithm

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

2003
Fei Xie James C. Browne Robert P. Kurshan

Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning to overcome the computational complexity of model checking. This paper presents Translation-Based Compositional Reasoning (TBCR), an approach to application of compositional reasoning in the context of model checking ...

2015
Ping-Teng CHANG Lung-Ting HUNG

This paper provides an improved decision making approach based on fuzzy numbers and the compositional rule of inference by Yao and Yao (2001). They claimed to have created a new method that combines statistical methods and fuzzy theory for medical diagnosis. Currently, numerous papers have cited that work. In this study, we show that if we follow their matrix multiplication operation approach, ...

2011
J. DAUNIS-I-ESTADELLA S. THIÓ-HENESTROSA G. MATEU-FIGUERAS

The biplot is a widely and powerful methodology used with multidimensional data sets to describe and display the relationships between observations and variables in an easy way. Compositional data consist of positive vectors each of which is constrained to have a constant sum; due to this property standard biplots can not be performed with compositional data, instead of a previous transformatio...

Journal: :amirkabir international journal of modeling, identification, simulation & control 2015
s. rahimi damirchi-darasi m.h. fazel zarandi m. izadi

one-third of the people with an age over twenty have some signs of degenerated discs. however, in most of the patients the mere presence of degenerative discs is not a problem leading to pain, neurological compression, or other symptoms. this paper presents an interval type-2 fuzzy hybrid rule-based system to diagnose the abnormal degenerated discs where pain variables are represented by interv...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم 1375

chapter two presents three m-admissible function algebras ab, bd, and sl, to construct the universal abelian, band, and semilattice compactifications, respectively. the main results are (11.3), (12.3), and (12.4). some inclusion relationships between these function algebras and the other well-known ones, presented in section 8, are made via the devico of compactifications. chpter three is about...

Journal: :Int. J. Intell. Syst. 2002
Didier Dubois Henri Prade Laurent Ughetto

This paper puts forward the idea that information encoded on a computer may have a negative or a positive emphasis. Negative information corresponds to the statement that some situations are impossible. It is often the case for pieces of background knowledge expressed in a logical format. Positive information corresponds to observed cases. It is often encountered in data-driven mathematical mod...

2012
Sayantan Mandal Balasubramaniam Jayaram

The Bandler–Kohout Subproduct (BKS) inference mechanism is one of the two established fuzzy relational inference (FRI) mechanisms, the other being Zadeh’s Compositional Rule of Inference (CRI). Both these FRIs are known to possess many desirable properties. It can be seen that many of these desirable properties are due to the rich underlying structure, viz., the residuated algebra, from which t...

2008
Dávid Vincze Szilveszter Kovács

Several Fuzzy Rule Interpolation (FRI) techniques have limitations from the direct application point of view, for example their applicability is limited to the one dimensional case, or they can be defined only based on the two closest surrounding rules of the actual observation. This is the reason why relatively few FRI methods can be found among the practical fuzzy rule based applications. Wit...

2005
Zsolt Csaba Johanyák Szilveszter Kovács

This paper reviews some important points of sparse rule-bases, the reason of their generation and after that three methods are presented, which allow the approximation of the missing rules with reasonable demand on computing. The delimitations and advantages of these methods are presented, too. Fuzzy systems based on a sparse rule-base do not have rules for all the possible combinations of obse...

2007
Zsolt Csaba Johanyák Szilveszter Kovács Sándor Kalmár

This paper reviews some important points of sparse rule-bases, the reason of their generation and after that three methods are presented, which allow the approximation of the missing rules with reasonable demand on computing. The delimitations and advantages of these methods are presented, too. Fuzzy systems based on a sparse rule-base do not have rules for all the possible combinations of obse...

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

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