Browse Dissertations and Theses - Computer Science by Title

  • Do, Quang (2012-09-18)
    In this thesis, we study the importance of background knowledge in relation extraction systems. We not only demonstrate the benefits of leveraging background knowledge to improve the systems' performance but also propose ...

    application/pdf

    application/pdfPDF (614kB)
  • Sauppe, Jason James (2015-07-16)
    Observational data are prevalent in many fields of research, and it is desirable to use this data to explore potential causal relationships. Additional assumptions and methods for post-processing the data are needed to ...

    application/pdf

    application/pdfPDF (3MB)
  • Kloder, Stephen (2008)
    We use these barriers together with noncooperative zero-sum game theory to construct partial barriers. These are strategies for minimizing undetected intrusion when there is a limitation on available guard resources. We ...

    application/pdf

    application/pdfPDF (7MB)Restricted to U of Illinois
  • Cook, Diane Joyce (1990)
    This thesis addresses the problem of efficiently selecting base cases for problem-solving analogies. The base selection task is one of the most severe limitations in current analogical reasoning systems, because of the ...

    application/pdf

    application/pdfPDF (7MB)Restricted to U of Illinois
  • Pelikan, Martin (2002)
    The dissertation proposes the Bayesian optimization algorithm (BOA), which uses Bayesian networks to model the promising solutions found so far and sample new candidate solutions. BOA is theoretically and empirically shown ...

    application/pdf

    application/pdfPDF (13MB)Restricted to U of Illinois
  • Jayasena, v. Sanath Dhammika (2003)
    Next, the problem of covering an incompletely-specified negative function by a completely-specified negative function efficiently is investigated. This problem arises during the synthesis of MOS networks. A necessary step ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Michelotti, Matthew (2013-02-03)
    Gillespie's Stochastic Simulation Algorithm (SSA) is an exact procedure for simulating the evolution of a collection of discrete, interacting entities, such as coalescing aerosol particles or reacting chemical species. ...

    application/pdf

    application/pdfPDF (547kB)
  • Park, Young-Tack (1993)
    The scheduler is an key component of a blackboard system architecture. This thesis addressed the important problem of how to make the blackboard scheduler more knowledge intensive in a way that facilitates the acquisition, ...

    application/pdf

    application/pdfPDF (7MB)Restricted to U of Illinois
  • Lee, Daeshik (1991)
    An efficient method has been developed for the fast solution of the boundary problems of Poisson's equation on irregular as well as regular domains. The method, called the boundary method-based domain decomposition or BMDD, ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Dankel, Douglas Duane, II (1980)
    Consider the tasks of trying to find similarities between the causes of the crashes of several aircraft of a common type, the causes or early warning signs for various diseases, the characteristics of stocks with high ...

    application/pdf

    application/pdfPDF (10MB)Restricted to U of Illinois
  • David, Francis Manoj (2008)
    Fault injection experiments show that it is possible to recover from 87% or more manifested errors in operating system services such as the file system, timer, scheduler and network while maintaining low performance overheads.

    application/pdf

    application/pdfPDF (2MB)Restricted to U of Illinois
  • Mai, Haohui (2013-08-22)
    Modern computer systems play important roles in our society and everyday lives. Their performance, security and reliability are of critical importance. Real-world computer systems, however, occasionally suffer from performance ...

    application/pdf

    application/pdfPDF (2MB)
  • Liang, Jin (2007)
    MON is not just an example application designed according to OCMA. It is a simple, scalable and lightweight tool we have built for managing service applications running in a wide area environment. MON facilitates the ...

    application/pdf

    application/pdfPDF (3MB)Restricted to U of Illinois
  • Natarajan, Swaminathan (1990)
    Programs for hard real-time systems have stringent timing requirements. Real-time programs are usually designed for the worst-case situation, which makes them inefficient. We argue that real-time programs should be more ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Shi, Shaw-Ben (1990)
    This thesis addresses the issue of ensuring user programs to be executed reliably by making use of the idle resources provided by the workstation environment. In particular, we examine how to replicate user programs so ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Ceze, Luis H. (2007)
    The second contribution of this thesis is architecture support and programming model for a data-centric approach to thread synchronization. In Data-Centric Synchronization (DCS), the programmer uses local reasoning to ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • application/pdf

    application/pdfPDF (2MB)Restricted to U of Illinois
  • Strauss, Karin (2007)
    In this work, we propose to logically embed a ring in a point-to-point network topology. Snoop messages use the logical ring, while other messages can use any link in the network. The resulting design is simple and low ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Voss, William Eric (1998)
    To recompute from scratch, cache, or maintain a running-total is a database optimization question. The best answer depends in part upon usage patterns. For example, is total accessed frequently, or is the underlying table ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Okunbor, Daniel Irowa (1993)
    Hamiltonian systems possess dynamics (e.g., preservation of volume in phase space and symplectic structure) that call for special numerical integrators, namely canonical methods. Recent research in this aspect have shown ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois