Browse Dissertations and Theses - Computer Science by Title

  • Pae, Sung-il (2005)
    We study random number generation using a biased source motivated by previous works on this topic, mainly, von Neumman (1951), Elias (1972), Knuth and Yao (1976) and Peres (1992). We study the problem in two cases: first, ...

    application/pdf

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

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Wang, Qixin (2008)
    I also designed a hard real-time, fast, and lightweight acoustic event localization protocol, the Lightning Protocol, for wireless sensor networks. Basically, wireless sensors are deployed in a square grid pattern. Every ...

    application/pdf

    application/pdfPDF (2MB)Restricted to U of Illinois
  • Richards, Mark (2012-09-18)
    The extensive form game is a formalism used to model environments where agents make sequences of decisions, possibly in the face of uncertainty about the state of the world and the decisions made by other agents. Such ...

    application/pdf

    application/pdfPDF (702kB)
  • Chou, Seng-cho Timothy (1992)
    Belief revision semantics appear promising as a definition for the meaning of updates to logical knowledge bases. Numerous model-based belief revision semantics have been proposed in the literature in recent years. It is ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Shirazi, Afsaneh H. (2011-05-25)
    In multi-agent systems, the knowledge of agents about other agents’ knowledge often plays a pivotal role in their decisions. In many applications, this knowledge involves uncertainty. This uncertainty may be about the ...

    application/pdf

    application/pdfPDF (2MB)
  • Agarwal, Rishi (2011-05-25)
    As we move to large manycores, the hardware-based global checkpointing schemes that have been proposed for small shared-memory machines do not scale. Scalability barriers include global operations, work lost to global ...

    application/pdf

    application/pdfPDF (284kB)
  • Sadeghi, Mohammad Amin (2012-06-27)
    In this thesis I introduce visual phrases, complex visual composites like ``a person riding a horse''. Visual phrases often display significantly reduced visual complexity compared to their component objects, because the ...

    application/pdf

    application/pdfPDF (12MB)
  • Rawlani, Preeyaa (2011-05-25)
    The growing availability and popularity of opinion rich resources on the online web resources, such as review sites and personal blogs, has made it convenient to find out about the opinions and experiences of layman people. ...

    application/pdf

    application/pdfPDF (722kB)
  • Libeskind-Hadas, Ran (1993)
    Advances in VLSI (Very Large Scale Integration) allow increasingly larger and more complex systems to be fabricated on a single chip or wafer. As the number of elements in these systems increases, the problem of tolerating ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Honarmand, Nima (2015-01-21)
    Record and deterministic Replay (RnR) is a primitive with many proposed applications in computer systems, including debugging, security and fault tolerance. RnR is typically a two phase process: in the first phase (record) ...

    application/pdf

    application/pdfPDF (3MB)
  • Blostein, Dorothea (1987)
    A perspective view of a slanted textured surface shows systematic changes in the density, area and aspect-ratio of texture elements. These apparent changes in texture element properties can be analyzed to recover information ...

    application/pdf

    application/pdfPDF (9MB)Restricted to U of Illinois
  • Peterson, Larry James (1975)

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Sung, Shu-Hui Helen (1989)
    Prefetching items into cache can either increase or decrease memory access time, depending on how well the prefetching algorithm matches the memory reference pattern. A popular prefetching algorithm is one block lookahead ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Granston, Elana Denise (1992)
    Memory access time is a key factor limiting the performance of large-scale, shared-memory multiprocessors. In such systems, limited bandwidth in the interconnection between the processors and the memories, coupled with ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Miller, Philip B (2016-11-04)
    Developers of scalable libraries and applications for distributed-memory parallel systems face many challenges to attaining high performance. These challenges include communication latency, critical path delay, suboptimal ...

    application/pdf

    application/pdfPDF (3MB)
  • Bangalore Jagannath, Vilas Shekhar (2010-08-20)
    Bounded-exhaustive testing is an automated testing methodology that checks the code under test for all inputs within given bounds: first the user describes a set of test inputs and provides test oracles that can check test ...

    application/pdf

    application/pdfPDF (547kB)
  • Badame, Sandro (2012-05-22)
    The number of end-users who write spreadsheet programs is at least an order of magnitude larger than the number of trained programmers who write professional software. We studied a corpus of 3691 spreadsheets and we ...

    application/pdf

    application/pdfPDF (311kB)
  • Opdyke, William F. (1992)
    This thesis defines a set of program restructuring operations (refactorings) that support the design, evolution and reuse of object-oriented application frameworks.

    application/pdf

    application/pdfPDF (8MB)Restricted to U of Illinois
  • Kjolstad, Fredrik Berg (2011-08-25)
    Computing is everywhere and our society depends on it. Increased performance over the last decades has allowed us to solve ever more interesting problems. We long relied on frequency scaling and instruction-level parallelism ...

    application/pdf

    application/pdfPDF (620kB)