Browse Dissertations and Theses - Computer Science by Title

  • Lee, Yun Young (2011-01-14)
    The advent of computerized medical devices has resulted in better accuracy and increased safety for patients and clinicians, yet medical accidents are still not uncommon. With the computerized medical devices and their ...

    application/pdf

    application/pdfPDF (682kB)
  • Dhurjati, Dinakar (2006)
    This thesis describes the main ideas, insights, and the approach that SAFECode system uses to achieve the goal of providing safety guarantees to software written in unsafe languages. This thesis also evaluates the SAFECode ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Kirslis, Peter Andre Christopher (1986)
    The research described in this dissertation supports the thesis that a language-oriented editor for full programming languages, and other languages specifiable with context-free LR(1) grammars, can be based upon an incremental ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Yershova, Ganna (2008)
    In its original conception, the motion planning problem considered the search of a robot path from an initial to a goal configuration. The study of motion planning has advanced significantly in recent years, in large part ...

    application/pdf

    application/pdfPDF (2MB)Restricted to U of Illinois
  • Cong, Shengnan (2006)
    We implemented parallel algorithms for mining frequent itemsets, sequential patterns and closed-sequential patterns following our framework. A comprehensive performance study has been conducted in our experiments on both ...

    application/pdf

    application/pdfPDF (2MB)Restricted to U of Illinois
  • Cheng, Peng (2005)
    Since differential constraints which restrict admissible velocities and accelerations of robotic systems are ignored in path planning, solutions for kinodynamic and non-holonomic planning problems from classical methods ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Chen, Hsin-Chu (1988)
    A new domain decomposition method for the efficient and parallelizable numerical handling of plate bending and three dimensional elasticity problem is developed via the discovery of two special classes of matrices. The ...

    application/pdf

    application/pdfPDF (3MB)Restricted to U of Illinois
  • Cho, Brian (2013-02-03)
    In today's data-intensive cloud systems, there is a tension between resource limitations and strict requirements. In an effort to scale up in the cloud, many systems today have unfortunately forced users to relax their ...

    application/pdf

    application/pdfPDF (4MB)
  • Qian, Xuehai (2013-08-22)
    Multicore machines have become pervasive and, as a result, parallel programming has received renewed interest. Unfortunately, writing correct parallel programs is notoriously hard. Looking ahead, multicore designs should ...

    application/pdf

    application/pdfPDF (2MB)
  • Sen, Koushik (2006)
    Based on the above methods we have developed tools for testing both C and Java programs. We have used the tools to find bugs in several real-world software systems including SGLIB, a popular C data structure library used ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Sack, Paul (2012-02-06)
    Governments, universities, and companies expend vast resources building the top supercomputers. The processors and interconnect networks become faster, while the number of nodes grows exponentially. Problems of scale ...

    application/pdf

    application/pdfPDF (973kB)
  • Lu, Charng-Da (2005)
    As a technology projection, we have also developed an analytical model to investigate the performability of diskless checkpointing. Our model evaluation shows that the overhead of checkpoint/recovery is small on systems ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Gupta, Vijay Shivshanker (2001)
    For the video distribution problem, we first propose a solution approach to mitigate the flooding concerns that ISPs have with IP Multicast. Second, we show how a few (potentially competing) middlemen can be used for ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Meneses Rojas, Esteban (2013-08-22)
    An important set of challenges emerge as the High Performance Computing (HPC) community aims to reach extreme scale. Resilience and energy consumption are two of those challenges. Extreme-scale machines are expected to ...

    application/pdf

    application/pdfPDF (2MB)
  • Shaffer, Eric Gene (2005)
    Polygonal meshes are easily the most common surface representation currently employed in computer graphics, finding application in fields as diverse as the visual arts and scientific computation. Technological advances in ...

    application/pdf

    application/pdfPDF (3MB)Restricted to U of Illinois
  • Yin, Xiaoxin (2007)
    Because of the complexity of multi-relational data, efficiency and scalability are two major concerns in multi-relational data mining. In this thesis we propose scalable and accurate approaches for each data mining task ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Huang, Chengdu (2007)
    The self-diagnosing capability of our service comes from the scalable learning-based performance problem diagnosis techniques we propose. The increasing complexity of systems has motivated design of machine learning ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Chen, Terrence (2006)
    We believe our works have significant contributions and have brought new possibilities to computer vision, public security, surveillance, medical image analysis, and other related fields.

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Verma, Abhishek (2010-08-20)
    Data-intensive computing has emerged as a key player for processing large volumes of data exploiting massive parallelism. Data-intensive computing frameworks have shown that terabytes and petabytes of data can be routinely ...

    application/pdf

    application/pdfPDF (393kB)
  • Guo, Ruiqi (2014-09-16)
    Humans can understand scenes with abundant detail: they see layouts, surfaces, the shape of objects among other details. By contrast, many machine-based scene analysis algorithms use simple representation to parse scenes, ...

    application/pdf

    application/pdfPDF (28MB)