• Login
    View Item 
    •   Home
    • Theses and Dissertations
    • MS Theses
    • View Item
    •   Home
    • Theses and Dissertations
    • MS Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

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

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    MontherBusbaitThesis-Final.pdf
    Size:
    536.8Kb
    Format:
    PDF
    Description:
    Thesis Approval Form
    Download
    Type
    Thesis
    Authors
    Busbait, Monther I.
    Advisors
    Moshkov, Mikhail cc
    Committee members
    Solovyev, Victor cc
    Vigneron, Antoine E. cc
    Program
    Computer Science
    KAUST Department
    Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
    Date
    2014-05
    Embargo End Date
    2015-05-04
    Permanent link to this record
    http://hdl.handle.net/10754/316551
    
    Metadata
    Show full item record
    Access 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-KI18P
    DOI
    10.25781/KAUST-KI18P
    ae974a485f413a2113503eed53cd6c53
    10.25781/KAUST-KI18P
    Scopus Count
    Collections
    MS Theses; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.