Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Validating Arbitrarily Large Network Protocol Compositions with Finite Computation
    Bradley, Adam D.; Bestavros, Azer; Kfoury, Assaf J. (Boston University Computer Science Department, 2002-09-08)
    Formal tools like finite-state model checkers have proven useful in verifying the correctness of systems of bounded size and for hardening single system components against arbitrary inputs. However, conventional applications ...
  • Value-cognizant Speculative Concurrency Control
    Bestavros, Azer; Braoudakis, Spyridon (Boston University Computer Science Department, 1995-02-20)
    A problem with Speculative Concurrency Control algorithms and other common concurrency control schemes using forward validation is that committing a transaction as soon as it finishes validating, may result in a value loss ...
  • Verification with Natural Contexts: Soundness of Safe Compositional Network Sketches
    Lapets, Andrei; Kfoury, Assaf (Boston University Computer Science Department, 2009-10-01)
    In research areas involving mathematical rigor, there are numerous benefits to adopting a formal representation of models and arguments: reusability, automatic evaluation of examples, and verification of consistency and ...
  • View Registration Using Interesting Segments of Planar Trajectories
    Nunziati, Walter; Alon, Jonathan; Sclaroff, Stan; Del Bimbo, Alberto (Boston University Computer Science Department, 2005-05-19)
    We introduce a method for recovering the spatial and temporal alignment between two or more views of objects moving over a ground plane. Existing approaches either assume that the streams are globally synchronized, so that ...
  • Virtual-CPU Scheduling in the Quest Operating System
    Danish, Matthew; Li, Ye; West, Rich (CS Department, Boston University, 2010-11-10)
    This paper describes the scheduling framework for a new operating system called "Quest". The three main goals of Quest are to ensure safety, predictability and efficiency of software execution. For this paper, we focus on ...
  • A Virtual Deadline Scheduler for Window-Constrained Service Guarantees
    Zhang, Yuting; West, Richard; Qi, Xin (Boston University Computer Science Department, 2004-03-23)
    This paper presents a new approach to window-constrained scheduling, suitable for multimedia and weakly-hard real-time systems. We originally developed an algorithm, called Dynamic Window-Constrained Scheduling (DWCS), ...
  • Visible Volume: a Robust Measure for Protein Structure Characterization
    Lo Conte, Loredana; Smith, Temple (Boston University Computer Science Department, 1997-07-10)
    We propose a new characterization of protein structure based on the natural tetrahedral geometry of the β carbon and a new geometric measure of structural similarity, called visible volume. In our model, the side-chains ...
  • The War Between Mice and Elephants
    Guo, Liang; Matta, Ibrahim (Boston University Computer Science Department, 2001)
    Recent measurement based studies reveal that most of the Internet connections are short in terms of the amount of traffic they carry (mice), while a small fraction of the connections are carrying a large portion of the ...
  • Web Mediators for Accessible Browsing
    Waber, Benjamin N.; Magee, John J.; Betke, Margrit (Boston University Computer Science Department, 2006-05-11)
    We present a highly accurate method for classifying web pages based on link percentage, which is the percentage of text characters that are parts of links normalized by the number of all text characters on a web page. ...
  • WebWave: Globally Load Balanced Fully Distributed Caching of Hot Published Documents
    Heddaya, Abdelsalam; Mirdad, Sulaiman (Boston University Computer Science Department, 1996-10-10)
    Document publication service over such a large network as the Internet challenges us to harness available server and network resources to meet fast growing demand. In this paper, we show that large-scale dynamic caching ...
  • What Are Polymorphically-Typed Ambients?
    Amtoft, Torben; Kfoury, Assaf J.; Pericas-Geertsen, Santiago M. (Boston University Computer Science Department, 2000-10-19)
    Abstract: The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. We consider an Ambient Calculus where ambients transport and exchange programs rather ...
  • Wireless and Physical Security via Embedded Sensor Networks
    Ocean, Michael J.; Bestavros, Azer (Boston University Computer Science Department, 2008-01-15)
    Wireless Intrusion Detection Systems (WIDS) monitor 802.11 wireless frames (Layer-2) in an attempt to detect misuse. What distinguishes a WIDS from a traditional Network IDS is the ability to utilize the broadcast nature ...
  • World Wide Web Image Search Engines
    Sclaroff, Stan (Boston University Computer Science Department, 1995-05-27)
    We propose the development of a world wide web image search engine that crawls the web collecting information about the images it finds, computes the appropriate image decompositions and indices, and stores this extracted ...

Search OpenBU


Advanced Search

Browse

Deposit Materials