OpenBU

OpenBU

OpenBU

Welcome to OpenBU

The Boston University Institutional Repository contains documents and publications authored or co-authored by BU faculty, students, and staff.

OpenBU is an open access repository, which means that the full text of the work deposited here is freely accessible to the world via the web. Access is restricted only in unavoidable instances, for example where publisher copyright restrictions prevail. However over 90% of scholarly publishers worldwide now allow some version of the documents they publish to be made available in a repository such as this.

Communities in OpenBU

Recently Added

  • Sweha, Raymond; Ishakian, Vatche; Bestavros, Azer (Computer Science Department, Boston University, 2011-12-14)
    Increasingly, commercial content providers (CPs) offer streaming and IPTV solutions that leverage an underlying peer-to-peer (P2P) stream distribution architecture. The use of P2P protocols promises significant scalability ...
  • Skowyra, Richard; Bestavros, Azer; Goldberg, Sharon (Computer Science Department, Boston University, 2011-05-15)
    In this paper we identify and define Zenith attacks, a new class of attacks on content-distribution systems, which seek to expose the popularity (i.e. access frequency) of individual items of content. As the access pattern ...
  • Soule, Nate; Bestavros, Azer; Kfoury, Assaf; Lapets, Andrei (Computer Science Department, Boston University, 2011-02-08)
    NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of ...
  • Paquette, Isaac; Kwan, Christopher; Betke, Margrit (Computer Science Department, Boston University, 2011-03-02)
    Menu Controller was developed to make existing software more accessible for people with severe motor impairments, especially individuals who use mouse-replacement input systems. Windows applications have menus that are ...
  • Hescott, Ben; Finkelstein, Jeffrey (Computer Science Department, Boston University, 2011-12-20)
    In this paper, we examine a recently introduced type of effective reduction which applies solely to problems of equivalence or isomorphism: the "kernel reduction". Specifically, we examine reductions among languages in the ...
  • Fuller, Benjamin; Reyzin, Leonid (Computer Science Department, Boston University, 2011-01-07)
    We investigate how information leakage reduces computational entropy of a random variable X. Recall that HILL and metric computational entropy are parameterized by quality (how distinguishable is X from a variable Z that ...
  • Kwan, Christopher; Betke, Margrit (Computer Science Department, Boston University, 2011-03-02)
    We developed Camera Canvas, photo editing and picture drawing software for individuals who cannot use their hands to operate a computer mouse. Camera Canvas is designed for use with camera-based mouse-replacement interfaces ...
  • Tian, Tai-Peng (Computer Science Department, Boston University, 2011-02-23)
    Human parsing recovers the 2D spatial layout of a human figure in an image. First, patches in the image that resemble body parts, i.e., head, torso and limbs, are identified, then a coherent human figure is assembled from ...
  • Gill, Phillipa; Schapira, Michael; Goldberg, Sharon (Computer Science Department, Boston University, 2011-02-04)
    With a cryptographic root-of-trust for Internet routing (RPKI) on the horizon, we can finally start planning the deployment of one of the secure interdomain routing protocols proposed over a decade ago (Secure BGP, secure ...
  • Goldberg, Sharon; Liu, Zhenming (Computer Science Department, Boston University, 2011-11-10)
    The deployment of new technologies in the Internet is notoriously difficult, as evidence by the myriad of well-developed networking technologies that still have not seen widespread adoption (e.g., secure routing, IPv6, ...
  • Kfoury, Assaf (Computer Science Department, Boston University, 2011-07-11)
    Flow networks are inductively defined, assembled from small network modules to produce arbitrarily large ones, with interchangeable and expanding functionally-equivalent parts. We carry out this induction formally using a ...
  • Wang, Chong; Byers, John (Computer Science Department, Boston University, 2012-06-20)
    With the primacy of content driving the design of new network architectures as well as the successful CDN business model, it is instructive to reconsider problems of content placement from the context of ISPs. In particular, ...
  • Thangali, Ashwin; Nash, Joan; Sclaroff, Stan; Neidle, Carol (Computer Science Department, Boston University, 2011-05-15)
    Handshape is a key linguistic component of signs, and thus, handshape recognition is essential to algorithms for sign language recognition and retrieval. In this work, linguistic constraints on the relationship between ...
  • Brova, George (Computer Science Department, Boston University, 2012-05-09)
    Existing models of information diffusion assume that peer influence is the main reason of the observed propagation patterns. This work examines the role of authority pressure on the observed information cascades. We model ...
  • Bassem, Christine; Bestavros, Azer (Computer Science Department, Boston University, 2012-02-10)
    Mobile agents participating in geo-presence-capable crowdsourcing applications should be presumed rational, competitive, and willing to deviate from their routes if given the right incentive. In this paper, we design a ...
  • Gill, Phillipa; Schapira, Michael; Goldberg, Sharon (Computer Science Department, Boston University, 2011-09-08)
    Researchers studying the interdomain routing system, its properties and new protocols, face many challenges in performing realistic evaluations and simulations. Modeling decisions with respect to AS-level topology, routing ...
  • Lapets, Andrei; Skowyra, Rick; Bassem, Christine; Bahargam, Sanaz; Bestavros, Azer; Kfoury, Assaf (Computer Science Department, Boston University, 2012-12-10)
    Computer science researchers in the programming languages and formal verification communities have produced a variety of automated tools and techniques for assisting formal reasoning tasks. However, while there exist notable ...
  • Schatzberg, Dan; Cadden, James; Krieger, Orran; Appavoo, Jonathan (Computer Science Department, Boston University, 2012-12-10)
    Cloud computing is resulting in fundamental changes to computing infrastructure, yet these changes have not resulted in corresponding changes to operating systems. In this paper we discuss some key changes we see in the ...
  • Lapets, Andrei (Computer Science Department, Boston University, 2012-12-10)
    Computer science researchers in the programming languages and formal verification communities, among others, have produced a variety of automated assistance and verification tools and techniques for formal reasoning. While ...
  • Lapets, Andrei; Mizraei, Saber (Computer Science Department, Boston University, 2012-12-10)
    A large variety of SMT techniques and associated solvers have been developed by the formal modelling and verification communities. For a particular application domain, each technique has its own unique set of advantages ...

View more

Search OpenBU

Browse

Deposit Materials

Discover

Statistics

Syndication Feeds

These feeds are customized for the level at which you are currently browsing OpenBU. Restricted items will not show up in feeds.