Diagnosis of Constant Faults in Read-Once Contact Networks over Finite Bases using Decision Trees
Name:
MontherBusbaitThesis-Final.pdf
Size:
536.8Kb
Format:
PDF
Description:
Thesis Approval Form
Type
ThesisAuthors
Busbait, Monther I.Advisors
Moshkov, Mikhail
Committee members
Solovyev, Victor
Vigneron, Antoine E.

Program
Computer ScienceDate
2014-05Embargo End Date
2015-05-04Permanent link to this record
http://hdl.handle.net/10754/316551
Metadata
Show full item recordAccess Restrictions
At the time of archiving, the student author of this thesis opted to temporarily restrict access to it. The full text of this thesis became available to the public after the expiration of the embargo on 2015-05-04.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.Citation
Busbait, M. I. (2014). Diagnosis of Constant Faults in Read-Once Contact Networks over Finite Bases using Decision Trees. KAUST Research Repository. https://doi.org/10.25781/KAUST-KI18Pae974a485f413a2113503eed53cd6c53
10.25781/KAUST-KI18P