Browse Research and Tech Reports - Computer Science by Title

  • He, Wenbo; Huang, Ying; Nahrstedt, Klara; Lee, Whay C. (2007-12)
    Reliable message propagation is an important means of communication in mobile ad hoc networks (MANETs), and serves as a fundamental component for various applications, such as mobile advertising, inter-vehicle safety message ...

    application/pdf

    application/pdfPDF (231Kb)
  • Yu, Hwan-Jo (2004-05)
    Data is everywhere, abundant, continuously increasing, and heterogeneous. For example, Web pages on the Internet are rapidly growing, data in commercial databases are continuously accumulating, as well as biological data ...

    application/pdf

    application/pdfPDF (3Mb)
  • Berkovsky, Shlomo; Eytani, Yaniv; Kuflik, Tsvi; Ricci, Francesco (2007-02)
    Collaborative Filtering (CF) is an attractive and reliable recommendation technique. CF is typically implemented using a centralized storage of user profiles and this is a severe privacy danger, since an attack to this ...

    application/pdf

    application/pdfPDF (106Kb)
  • Chen, Wei-Peng (2004-09)
    Distinct from wireless ad hoc networks, wireless sensor networks are data-centric, application-oriented, collaborative, and resource-constrained in nature. Especially, the limited resources on energy, bandwidth and computation ...

    application/pdf

    application/pdfPDF (2Mb)
  • Gupta, Abhishek; Preston, Kurt; Rodriguez, Alejandro (2010-10-27)
    The Android operating system runs atop the Linux kernel, yet lacks the ability to natively execute standard Linux desktop applications. Though efforts have been made to enable this functionality, all approaches to date ...

    application/pdf

    application/pdfPDF (339Kb)
  • Kostoulas, Dionysios; Psaltoulis, Dimitrios; Gupta, Indranil; Briman, Ken; Demers, Al (2005-02)
    Large-scale and dynamically changing distributed systems such as the Grid, peer-to-peer overlays, etc., need to collect several kinds of global statistics in a decentralized manner. In this paper, we tackle a specific ...

    application/pdf

    application/pdfPDF (2Mb)
  • Chadha, Rohit; Viswanathan, Mahesh (2007-06)
    We consider the problem of verifying the safety of well-structured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have ( possibly) infinitely many control states along with an auxiliary ...

    application/pdf

    application/pdfPDF (266Kb)
  • Prabhakar, Pavithra; Vladimerou, Vladimeros; Viswanathan, Mahesh; Dullerud, Geir E. (2008-01)
    The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid automata without resets. These automata are a special class of linear hybrid automata with only two variables, whose flows ...

    application/pdf

    application/pdfPDF (193Kb)
  • Hendrix, Joseph D. (2008-09)
    This work develops new automated reasoning techniques for verifying the correctness of equationally specified programs. These techniques are not just theoretical, but have been implemented, and applied to actual program ...

    application/pdf

    application/pdfPDF (1Mb)
  • Hendrix, Joseph D. (2008-09)
    This work develops new automated reasoning techniques for verifying the correctness of equationally specified programs. These techniques are not just theoretical, but have been implemented, and applied to actual program ...

    application/pdf

    application/pdfPDF (1Mb)
  • Baugh, Lee W.; Zilles, Craig (2005-10)
    Because they are based on large content-addressable memories, load-store queues (LSQs) present implementation challenges in superscalar processors, especially as issue width and number of in-flight instructions are scaled. ...

    application/pdf

    application/pdfPDF (198Kb)
  • Lin, Chia-Chi; Jalaparti, Virajith; Caesar, Matthew; Van der Merwe, Jacobus (USENIX, 2013)
    Large-scale networks are among the most complex software infrastructures in existence. Unfortunately, the extreme complexity of their basis, the control-plane software, leads to a rich variety of nondeterministic failure ...

    application/pdf

    application/pdfPDF (755Kb)
  • Ellison, Chucky; Rosu, Grigore (2012-04-27)
    This paper investigates undefined behavior in C and offers a few simple techniques for operationally specifying such behavior formally. A semantics-based undefinedness checker for C is developed using these techniques, as ...

    application/pdf

    application/pdfPDF (257Kb)
  • Jayachandran, Praveen; Abdelzaher, Tarek F. (2007-05)
    In this paper, we present a delay composition rule that bounds the worst-case end-to-end delay of a job as a function of per-stage execution times of higher priority jobs along its path, in a multistage distributed system ...

    application/pdf

    application/pdfPDF (220Kb)
  • d'Amorim, Marcelo; Lauterburg, Steven; Marinov, Darko (2007-05)
    State-space exploration is the essence of model checking and an increasingly popular approach for automating test generation. A key issue in exploration of object-oriented programs is handling the program state, in particular ...

    application/pdf

    application/pdfPDF (300Kb)
  • Uddin, Md Yusuf Sarwar; Khurshid, Ahmed; Hee Dong Jung; Carl Gunter (2010-01-19)
    Disruption-tolerant network (DTN) is an intermittently connected network where the traditional end-to-end data communication between a source-destination pair is hardly possible. Instead, nodes opportunistically replicate ...

    application/pdf

    application/pdfPDF (234Kb)
  • Ding, Hui (2006-11)
    Due to the complexity and requirements of modern real-time systems, multiple teams must often work concurrently and independently to develop the various components of the system. Since a team typically only knows the ...

    application/pdf

    application/pdfPDF (768Kb)
  • Fesehaye, Debessay (2013-01-25)
    Existing literature shows that Peer-to-Peer (P2P) content sharing can result in significant scalability gains in addition to assisting content distribution networks (CDNs). However, currently proposed CDN and P2P hybrid ...

    application/pdf

    application/pdfPDF (292Kb)
  • Chen, Chun-cheng; Seo, Eunsoo; Luo, Haiyun (2006-11)
    Contention-based MAC protocols such as IEEE 802.11 DCF are known to perform well in a network with small number of nodes. As the number of nodes increases, the cost of collisions increases and dominates. This increasing ...

    application/pdf

    application/pdfPDF (259Kb)
  • So, Jungmin (2006-08)
    Wireless networks have been widely deployed in the past few years. With rapidly increasing number of users, it is important to maximize utilization of given resources to achieve high performance. Among many approaches, the ...

    application/pdf

    application/pdfPDF (2Mb)