Browse Research and Tech Reports - Computer Science by Title

  • Kloder, Stephen (2008-05)
    In this work, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We give methods for complete barrier coverage in a two-dimensional ...

    application/pdf

    application/pdfPDF (4Mb)
  • Capitanu, Boris; Chan, Ellick M.; Gupta, Indranil (2005-04)
    The emergence of tiny computers, such as smart dust, Berkeley motes and Intel motes, makes it feasible to envision the conversion of a network of tiny computers into a regular computing device (i.e., a "PC" or personal ...

    application/pdf

    application/pdfPDF (162Kb)
  • Popescu, Andrei; Rosu, Grigore (2005-05)
    We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ib, which captures formally and abstractly the intuitions of adding support for behavioral equivalence and ...

    application/pdf

    application/pdfPDF (332Kb)
  • Jayachandran, Praveen; Ganti, Raghu K.; Gupta, Indranil; Abdelzaher, Tarek F. (2006-11)
    Sensor networks pose the challenge of distribution of content generated within the network to the origins of requests for this content in an efficient and timely manner. In this paper, we formulate this multiple-source ...

    application/pdf

    application/pdfPDF (308Kb)
  • Tao, Tao; Zhai, ChengXiang (2006-08)
    As exploratory queries become more and more popular, the study of how to select k items based on fuzzy matching and ranking of database tuples (i.e. top-k queries) has attracted much attention recently. However, taking the ...

    application/pdf

    application/pdfPDF (199Kb)
  • Tasharofi, Samira; Pradel, Michael; Lin, Yu; Johnson, Ralph E. (2013-05)
    Actor programs are concurrent programs where concurrent entities communicate asynchronously by exchanging messages. Testing actor programs is challenging because the order of message receives depends on the non-deterministic ...

    application/pdf

    application/pdfPDF (309Kb)
  • Sobeih, Ahmed A.; Viswanathan, Mahesh; Hou, Jennifer C. (2005-04)
    Network simulators perform well in evaluating the performance of network protocols, but lack the capability of verifying their correctness. In order to address this lacuna, we have extended the J- Sim network simulator ...

    application/pdf

    application/pdfPDF (185Kb)
  • Verma, Abhishek; Zea, Nicolas; Cho, Brian; Gupta, Indranil; Campbell, Roy H. (2010-01-19)
    The MapReduce model uses a barrier between the Map and Reduce stages. This provides simplicity in both programming and implementation. However, in many situations, this barrier hurts performance because it is overly ...

    application/pdf

    application/pdfPDF (256Kb)
  • Wei, Mingliang; Snir, Marc; Torrellas, Josep; Tremaine, R. Brett (2005-02)
    The Near Memory Processor (NMP) is a multithreaded vector processor integrated with the memory controller. The NMP works subordinately upon requests from the main processors. The NMP is complementary to the conventional ...

    application/pdf

    application/pdfPDF (108Kb)
  • Fesehaye, Debessay (2010-08-24)
    Any network communication system involves finding a path (routing) and controlling the rate (transport) of communication. Existing routing techniques lack an efficient routing metric which reflects the up-to-date status ...

    application/pdf

    application/pdfPDF (157Kb)
  • David, Francis M. (2009-01)
    Despite many decades of research, the management of errors in a live operating system remains a challenging problem. This thesis presents CuriOS, an operating system that incorporates several new error management techniques ...

    application/pdf

    application/pdfPDF (539Kb)
  • David, Francis M. (2009-01)
    Despite many decades of research, the management of errors in a live operating system remains a challenging problem. This thesis presents CuriOS, an operating system that incorporates several new error management techniques ...

    application/pdf

    application/pdfPDF (539Kb)
  • Liang, Jin (2007-08)
    Recent research in peer-to-peer and grid computing has made it possible to build Internet scale services such as content distribution, storage service, name service and publish/subscribe. By utilizing large number of service ...

    application/pdf

    application/pdfPDF (821Kb)
  • Ceze, Luis H. (2007-08)
    With ubiquitous multi-core architectures, a major challenge is how to effectively use these machines. Writing parallel programs is usually very complex and error- prone. Hence, improving the programmability of parallel ...

    application/pdf

    application/pdfPDF (1Mb)
  • Xin, Dong; Shao, Zheng; Han, Jiawei; Liu, Hongyan (2005-10)
    It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2)closed cube, where a group of cells which ...

    application/pdf

    application/pdfPDF (209Kb)
  • Xue, Yuan; Nguyen, Hoang; Nahrstedt, Klara (2006-10)
    In a wireless network, data transmission suffers from varied signal strengths and channel bit error rates. To ensure successful packet reception under different channel conditions, automatic bit rate control schemes are ...

    application/pdf

    application/pdfPDF (144Kb)
  • Strauss, Karin (2007-08)
    Design complexity and limited power budget are causing the number of cores on the same chip to grow very rapidly. The wide availability of Chip Multiprocessors (CMPs) is enabling the design of inexpensive, shared-memory ...

    application/pdf

    application/pdfPDF (620Kb)
  • Zhang, Honghai; Hou, Jennifer C. (2004-07)
    In this paper, we study how the achievable throughput scales in a wireless network with randomly located nodes as the number of nodes increases, under a communication model where (i) each node has a maximum transmission ...

    application/pdf

    application/pdfPDF (286Kb)
  • Vakilian, Mohsen; Phaosawasdi, Amarin; Ernst, Michael D.; Johnson, Ralph E. (2014-09-09)
    Type qualifier inference tools usually operate in batch mode and assume that the program must not be changed except to add the type qualifiers. In practice, programs must be changed to make them type-correct, and programmers ...

    application/pdf

    application/pdfPDF (490Kb)
  • Jayachandran, Praveen; Abdelzaher, Tarek F. (2007-05)
    Contrary to traditional belief, we show in this paper, that for distributed systems non-preemptive scheduling can perform better than preemptive scheduling in the worst case in terms of task schedulability, under certain ...

    application/pdf

    application/pdfPDF (254Kb)