Browse Dept. of 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-09)
    Many computing systems today are written in weakly typed languages such as C and C++. These languages are known to be ``unsafe'' as they do not prevent or detect common memory errors like array bounds violations, pointer ...

    application/pdf

    application/pdfPDF (745kB)
  • 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
  • Lee, Adam J.; Winslett, Marianne (2006-08)
    In trust negotiation and other distributed proving systems, networked entities cooperate to form proofs that are justified by collections of certified attributes. These attributes may be obtained through interactions with ...

    application/pdf

    application/pdfPDF (306kB)
  • 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-10)
    In its original formulation, the motion planning problem considers 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)
  • 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
  • Yershova, Ganna (2008-10)
    In its original formulation, the motion planning problem considers 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)
  • Cong, Shengnan (2006-02)
    Data mining is an emerging research area, whose goal is to discover potentially useful information embedded in databases. Due to the wide availability of huge amounts of data and the imminent need for turning such data ...

    application/pdf

    application/pdfPDF (3MB)
  • 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-08)
    Kinodynamic and nonholonomic planning problems have differential constraints which restrict admissible velocities and accelerations of robotic systems. Since these differential constraints are ignored in the path planning ...

    application/pdf

    application/pdfPDF (2MB)
  • 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
  • Sen, Koushik (2006-06)
    Testing using manually generated test cases is the primary technique used in industry to improve reliability of software---in fact, such ad hoc testing accounts for over half of the typical cost of software development. ...

    application/pdf

    application/pdfPDF (995kB)
  • 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-08)
    Parallel scientific applications deal with machine unreliability by periodic checkpointing, in which all processes coordinate to dump memory to stable storage simultaneously. However, in systems comprising tens of thousands ...

    application/pdf

    application/pdfPDF (1MB)
  • 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