Browse Dissertations and Theses - Computer Science by Title

• (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

PDF (3MB)
• (1980)

application/pdf

PDF (4MB)
• (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

PDF (2MB)
• (2017-12-13)
Most robots in industrial settings today rely on playback of precise pre-defined coordinates and do not adjust their motion using feedback from sensors. This thesis describes a system to implement real-time motion control ...

application/pdf

PDF (7MB)
• (2017-07-10)
Quantitative reasoning involves understanding the use of quantities and numeric relations in text, and reasoning with respect to them. It forms an essential part of everyday interaction. However, little work from the ...

application/pdf

PDF (734kB)
• (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

PDF (702kB)
• (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

PDF (6MB)
• (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

PDF (2MB)
• (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

PDF (284kB)
• (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

PDF (12MB)
• (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

PDF (722kB)
• (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

PDF (6MB)
• (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

PDF (3MB)
• (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

PDF (9MB)
• (1975)

application/pdf

PDF (4MB)
• (2018-06-29)
Sparse matrix operations dominate the cost of many scientific applications. In parallel, the performance and scalability of these operations is limited by irregular point-to-point communication. Multiple methods are ...

application/pdf

PDF (3MB)
• (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

PDF (5MB)
• (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

PDF (5MB)
• (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

PDF (3MB)
• (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

PDF (547kB)