Filters








7,753 Hits in 3.7 sec

Qualitative model based fault diagnosis using a threshold level

Sobhi Baniardalani, Javad Askari, Jan Lunze
2010 International Journal of Control, Automation and Systems  
This paper deals with the effect of using a threshold level in qualitative model based fault diagnosis algorithm.  ...  By introducing the concept of α-consistency, a fault diagnosis algorithm is presented in this paper.  ...  Based on steps (18)-(22) and the Theorem, a diagnosis algorithm is presented in Fig. 5 By computing ( , ) k k Prob f V W in this algorithm, the faults that are not α-consistent with the observed  ... 
doi:10.1007/s12555-010-0323-4 fatcat:pkhk6ry5qrddzouikrhkskfvze

The broadcast comparison model for on-line fault diagnosis in multicomputer systems: theory and implementation

D.M. Blough, H.W. Brown
1999 IEEE transactions on computers  
AbstractÐThis paper describes a new comparison-based model for distributed fault diagnosis in multicomputer systems with a weak reliable broadcast capability.  ...  A characterization of diagnosable systems is given, which leads to a polynomial-time diagnosability algorithm. A polynomial-time diagnosis algorithm for t-diagnosable systems is also given.  ...  ACKNOWLEDGMENTS The authors would like to express their appreciation to Leon Alkalai and the Jet Propulsion Laboratory for the use of the COSMOS simulation environment, to David Cummings for his assistance  ... 
doi:10.1109/12.769431 fatcat:tiwfaeinizcexajruaw2qsjcx4

On the relationship between model-based debugging and program slicing

Franz Wotawa
2002 Artificial Intelligence  
During the last years it has been shown that modelbased diagnosis can be used for software debugging.  ...  for finding faults in physical systems.  ...  Acknowledgements I thank Dominik Wieland and Markus Stumptner for their comments on earlier drafts of this paper, and the referees for their extremely helpful comments and suggestions.  ... 
doi:10.1016/s0004-3702(01)00161-8 fatcat:tfaaeny365cjdj6z7f7zesltvi

Nonlinear statistics for bearing diagnosis

Diego Luis Guarin, Alvaro Angel Orozco, Edilson Delgado Trejos
2012 2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)  
This document presents the preliminary results of an ongoing study related to the use of nonlinear statistics for bearing diagnosis.  ...  In this study, we propose a methodology based on the K-nearest neighbor algorithm to test the ability of a group of nonlinear statistic to differentiate between vibration signals obtained from rotatory  ...  The algorithm for finding the complexity of a finite sequence consists in transforming the observed time series into a sequence of symbols from an alphabet through a encoding scheme.  ... 
doi:10.1109/isspa.2012.6310586 dblp:conf/isspa/GuarinOD12 fatcat:bnsyijambngmddfmr3cwn7wejy

A theory of diagnosis from first principles [chapter]

R. Reiter
1986 Lecture Notes in Computer Science  
The theory leads to an algorithm for computing all diagnoses, and to various results concerning principles of measurement for discriminating among competing diagnoses.  ...  Moreover, there are many such suitable logics, e.g. first-order, temporal, dynamic, etc.  ...  ACKNOWLEDGMENT I owe a special debt to Johan de Kleer for his encouragement, and for his ready responses to my many questions about diagnosis, especially during the initial phases of this research.  ... 
doi:10.1007/3-540-16780-3_87 fatcat:6u7b22be3zgxtnpwpgphd6uq6e

A theory of diagnosis from first principles

Raymond Reiter
1987 Artificial Intelligence  
The theory leads to an algorithm for computing all diagnoses, and to various results concerning principles of measurement for discriminating among competing diagnoses.  ...  Moreover, there are many such suitable logics, e.g. first-order, temporal, dynamic, etc.  ...  ACKNOWLEDGMENT I owe a special debt to Johan de Kleer for his encouragement, and for his ready responses to my many questions about diagnosis, especially during the initial phases of this research.  ... 
doi:10.1016/0004-3702(87)90062-2 fatcat:pldwigp7fvbhrkz5b2x4lmny24

Forthcoming papers

1998 Artificial Intelligence  
We introduce the notion of an MBR transform, and discuss its utility for learning algorithms. We also provide several perspectives on memory-based reasoning from a multi-disciplinary point of view.  ...  In this paper, we propose a probabilistic framework for memory-based reasoning (MBR).  ...  Ford, Why GSdel's theorem cannot refute computationalism Giidel's theorem is consistent with the computationalist hypothesis.  ... 
doi:10.1016/s0004-3702(98)90007-8 fatcat:kq2flquj35g4varimqe53txfym

Formally Verifying Dynamic Properties of Knowledge Based Systems [chapter]

Perry Groot, Annette ten Teije, Frank van Harmelen
1999 Lecture Notes in Computer Science  
In this paper we study dynamic properties of knowledge-based systems. We argue the importance of such dynamic properties for the construction and analysis of knowledge-based systems.  ...  We have used the KIV interactive theorem prover to obtain machine-assisted proofs for all the properties and theorems in this paper.  ...  Finally, for both case studies we have suggested a general approach that could be applied to other problem solving methods in order to obtain the same results for those methods.  ... 
doi:10.1007/3-540-48775-1_10 fatcat:qxjsiqiiljaidp5p26r2kanqca

Dynamics of Belief: Abduction, Horn Knowledge Base And Database Updates [article]

Radhakrishnan Delhibabu
2015 arXiv   pre-print
Such a generalization of belief dynamics, referred to as base dynamics, is presented in this paper, along with the concept of a generalized revision algorithm for knowledge bases (Horn or Horn logic with  ...  For, understand the basic concepts with abduction, we provide an abductive framework for knowledge base dynamics.  ...  update in a rational database; algorithm to carry out diagnosis; algorithm for abduction reasoning and so on.  ... 
arXiv:1501.06206v2 fatcat:ktavsd2e5nf57lkv4wxbxzk4rq

Theorem Proving Techniques for View Deletion in Databases

Chandrabose Aravindan, Peter Baumgartner
2000 Journal of symbolic computation  
In this paper, we show how techniques from rst-order theorem proving can be used for e cient deductive database updates.  ...  stemming from philosophical works on belief dynamics, and, unlike comparable approaches, it is of polynomial space complexity.  ...  Three reviewers gave very helpful suggestions for improvements.  ... 
doi:10.1006/jsco.1999.0358 fatcat:wn2esdidgvag7gjce3giswj3aa

Formal Characterization of Illegal Control Flow in Android System

Mariem Graa, Nora Cuppens-Boulahia, Frederic Cuppens, Ana Cavalli
2013 2013 International Conference on Signal-Image Technology & Internet-Based Systems  
We prove the completeness of these rules. Also, we provide a correct and complete algorithm based on these rules to solve the under-tainting problem.  ...  The dynamic taint analysis mechanism is used to protect sensitive data in the Android system. But this technique does not detect control flows which can cause an under-tainting problem.  ...  The proof consists of three steps: first prove that Dependency Algorithm is correct, then prove that Set Context T aint is correct, and finally prove that T aint Assigned V ariable is correct.  ... 
doi:10.1109/sitis.2013.56 dblp:conf/sitis/GraaCCC13 fatcat:pr2buvshpndjdawurb6odgsrei

Page 7075 of Mathematical Reviews Vol. , Issue 2003i [page]

2003 Mathematical Reviews  
Some applications to truth-maintenance systems, belief revision and model-based diagnosis are discussed.  ...  The equations were found by automatically generating and semantically filtering formulae, and by using OTTER to prove that they are indeed bases for Boolean algebra.  ... 

Diagnosis of three types of constant faults in read-once contact networks over finite bases

Monther Busbait, Mikhail Moshkov
2016 Theoretical Computer Science  
Abstract We study the depth of decision trees for diagnosis of three types of constant faults in read-once contact networks over finite bases containing only indecomposable networks.  ...  For bases containing networks with at most 10 edges, we find sharp coefficients for linear bounds.  ...  The authors are greatly indebted to reviewers for useful comments. [1] A. Alkhalid, I. Chikalov, S. Hussain, M. Moshkov, Extensions of dy-  ... 
doi:10.1016/j.tcs.2016.03.023 fatcat:rdf2m74swjfb3ke6bpjbxkl2b4

Comparative study of view update algorithms in rational choice theory

Radhakrishnan Delhibabu
2014 Applied intelligence (Boston)  
We show that knowledge base dynamics has interesting connection with kernel change via hitting set and abduction.  ...  The approach extends and integrates standard techniques for efficient query answering and integrity checking.  ...  search for a diagnosis.  ... 
doi:10.1007/s10489-014-0580-7 fatcat:sn36tauryzez3bqbnfnurmbxju

A near-domain-based fault diagnosis approach for wireless sensor networks

Hualin Wang, Zhile Wang, Min Lu, Luyang Zhou
2018 IET Wireless Sensor Systems  
This study presents a near-domain-based diagnosis algorithm for wireless sensor networks nodes.  ...  At the same time, a high robustness is maintained in this novel fault diagnosis algorithm.  ...  This means that the proposed algorithm is more suitable for the largescale, high density network. Theorem 2 shows that it is better to select a suitable value for β.  ... 
doi:10.1049/iet-wss.2018.5066 fatcat:wiet4kknbzfphgtx5i57buuciu
« Previous Showing results 1 — 15 out of 7,753 results