Browse Dept. of Computer Science by Title

  • Pae, Sung-il (2005-05)
    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 (500Kb)
  • Liang, Jin; Nahrstedt, Klara (2005-05)
    Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satis- fying quality of service (QoS). Previous approaches to building ...

    application/pdf

    application/pdfPDF (186Kb)
  • Li, Chengkai; Chang, Kevin C-C.; Ilyas, Ihab F.; Song, Sumin (2004-07)
    This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database systems (RDBMS), by extending relational algebra ...

    application/pdf

    application/pdfPDF (543Kb)
  • application/pdf

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Chen, Chun-cheng; Seo, Eunsoo; Luo, Haiyun; Vaidya, Nitin H. (2006-06)
    The majority of existing wireless rate controls are based on the implicit assumption that frames are corrupted due to the random, arbitrary environmental and thermal noises. They generally reduce the channel rate on frame ...

    application/pdf

    application/pdfPDF (659Kb)
  • Rosu, Grigore; Stefanescu, Andrei; Ciobaca, Stefan; Moore, Brandon (2012-07)
    Abstract. This paper introduces *reachability logic*, a language-independent seven-rule proof system for deriving reachability properties of systems. The key ingredients of *reachability logic* are its sentences, which are ...

    application/pdf

    application/pdfPDF (358Kb)
  • Stefanescu, Andrei; Ciobaca, Stefan; Moore, Brandon; Serbanuta, Traian Florin; Rosu, Grigore (2013-11)
    This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (concurrent) languages, referred to as reachability logic. The proof system derives partial-correctness ...

    application/pdf

    application/pdfPDF (237Kb)
  • Hu, Chunyu; Hou, Jennifer C. (2005-03)
    A major problem with leveraging event-driven, packet-level simulation environments, such as ns2 [15], J-Sim [1], OpNet [3]), and QualNet [4]), in conducting wireless network simulation is the vast number of events generated, ...

    application/pdf

    application/pdfPDF (176Kb)
  • Yang, Zhenyu; Cui, Yi; Anwar, Zahid; Bocchino, Robert L., Jr.; Kiyanclar, Nadir; Nahrstedt, Klara; Campbell, Roy H.; Yurcik, William (2005-08)
    Tele-immersive system can improve the productivity and aid communication by allowing distributed parties to exchange information via a shared immersive experience. The TEEVE research project at the University of Illinois ...

    application/pdf

    application/pdfPDF (568Kb)
  • Wang, Qixin (2008-08)
    By converging the cyber world with the physical world, Cyber-Physical Systems (CPS) is expected to create a great impact on computer science and the society. This thesis proposes several real-time building blocks for CPS ...

    application/pdf

    application/pdfPDF (4Mb)
  • Iandola, Forrest; Saremi, Fatemeh; Abdelzaher, Tarek; Jayachandran, Praveen; Yener, Aylin (International Conference on Information Fusion, 2011-07)
    In networked data fusion systems, results must be produced by end-to-end deadlines. As such, latency is an important attribute contributing to quality-of-information (QoI) in these systems. A key question is how much work ...

    application/pdf

    application/pdfPDF (3Mb)
  • Bui, Bach Duy; Pellizzoni, Rodolfo; Caccamo, Marco (2010-12-15)
    We address the problem of scheduling concurrent periodic real-time transactions on Multi-Domain Ring Bus (MDRB). The problem is challenging because although the bus allows multiple non-overlapping transactions to be ...

    application/pdf

    application/pdfPDF (281Kb)
  • Choi, Jaesik (2012)
    An autonomous vehicle is a demanding application for our daily life. Such vehicle requires to detect other vehicles on the road. Given the sequences of images, the algorithms need to find other vehicles in realtime. There ...

    application/pdf

    application/pdfPDF (2Mb)
  • Korthikanti, Vijay Anand; Viswanathan, Mahesh; Kwon, YoungMin; Agha, Gul A. (2010)
    We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as exhibiting a behavior that is a sequence of ...

    application/pdf

    application/pdfPDF (404Kb)
  • 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)
  • Daniel, Brett; Jagannath, Vilas; Dig, Danny; Marinov, Darko (IEEE/ACM, 2009-08-23)
    Developers often change software in ways that cause tests to fail. When this occurs, developers must determine whether failures are caused by errors in the code under test or in the test code itself. In the latter case, ...

    application/pdf

    application/pdfPDF (385Kb)
  • Dig, Danny; Negara, Stas; Johnson, Ralph; Mohindra, Vibhu (2007-09)
    Although in theory the APIs of software libraries and frameworks should be stable, they change in practice. This forces clients of the library API to change as well, making software maintenance expensive. Changing a client ...

    application/pdf

    application/pdfPDF (377Kb)
  • 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)