Diagnosis of Constant Faults in Read-Once Contact Networks over Finite Bases using Decision Trees

Handle URI:
http://hdl.handle.net/10754/316551
Title:
Diagnosis of Constant Faults in Read-Once Contact Networks over Finite Bases using Decision Trees
Authors:
Busbait, Monther I.
Abstract:
We study the depth of decision trees for diagnosis of constant faults in read-once contact networks over finite bases. This includes diagnosis of 0-1 faults, 0 faults and 1 faults. For any finite basis, we prove a linear upper bound on the minimum depth of decision tree for diagnosis of constant faults depending on the number of edges in a contact network over that basis. Also, we obtain asymptotic bounds on the depth of decision trees for diagnosis of each type of constant faults depending on the number of edges in contact networks in the worst case per basis. We study the set of indecomposable contact networks with up to 10 edges and obtain sharp coefficients for the linear upper bound for diagnosis of constant faults in contact networks over bases of these indecomposable contact networks. We use a set of algorithms, including one that we create, to obtain the sharp coefficients.
Advisors:
Moshkov, Mikhail ( 0000-0003-0085-9483 )
Committee Member:
Solovyev, Victor ( 0000-0001-8885-493X ) ; Vigneron, Antoine E. ( 0000-0003-3586-3431 )
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Program:
Computer Science
Issue Date:
May-2014
Type:
Thesis
Appears in Collections:
Theses; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.advisorMoshkov, Mikhailen
dc.contributor.authorBusbait, Monther I.en
dc.date.accessioned2014-05-07T06:35:16Zen
dc.date.available2014-05-07T06:35:16Zen
dc.date.issued2014-05en
dc.identifier.urihttp://hdl.handle.net/10754/316551en
dc.description.abstractWe study the depth of decision trees for diagnosis of constant faults in read-once contact networks over finite bases. This includes diagnosis of 0-1 faults, 0 faults and 1 faults. For any finite basis, we prove a linear upper bound on the minimum depth of decision tree for diagnosis of constant faults depending on the number of edges in a contact network over that basis. Also, we obtain asymptotic bounds on the depth of decision trees for diagnosis of each type of constant faults depending on the number of edges in contact networks in the worst case per basis. We study the set of indecomposable contact networks with up to 10 edges and obtain sharp coefficients for the linear upper bound for diagnosis of constant faults in contact networks over bases of these indecomposable contact networks. We use a set of algorithms, including one that we create, to obtain the sharp coefficients.en
dc.language.isoenen
dc.subjectread-once contact networksen
dc.subjectconstant faultsen
dc.subjectdecision treesen
dc.titleDiagnosis of Constant Faults in Read-Once Contact Networks over Finite Bases using Decision Treesen
dc.typeThesisen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
thesis.degree.grantorKing Abdullah University of Science and Technologyen_GB
dc.contributor.committeememberSolovyev, Victoren
dc.contributor.committeememberVigneron, Antoine E.en
thesis.degree.disciplineComputer Scienceen
thesis.degree.nameMaster of Scienceen
dc.person.id124045en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.