OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Lapets, Andrei (Boston University Computer Science Department, 2009-11-06)
    In college courses dealing with material that requires mathematical rigor, the adoption of a machine-readable representation for formal arguments can be advantageous. Students can focus on a specific collection of constructs ...
  • Reynolds, Mark C. (Boston University Computer Science Department, 2008-12-30)
    The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly in the component known as the Bytecode ...
  • Kfoury, A.J. (Boston University Computer Science Department, 1996-08-19)
    If every lambda-abstraction in a lambda-term M binds at most one variable occurrence, then M is said to be "linear". Many questions about linear lambda-terms are relatively easy to answer, e.g. they all are beta-strongly ...
  • Aversa, Luis; Bestavros, Azer (Boston University Computer Science Department, 1999-01-06)
    In this paper, we propose and evaluate an implementation of a prototype scalable web server. The prototype consists of a load-balanced cluster of hosts that collectively accept and service TCP connections. The host IP ...
  • Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 1997-05-14)
    High-speed networks, such as ATM networks, are expected to support diverse Quality of Service (QoS) constraints, including real-time QoS guarantees. Real-time QoS is required by many applications such as those that involve ...
  • Bestavros, Azer (Boston University Computer Science Department, 1996-08-01)
    Load balancing is often used to ensure that nodes in a distributed systems are equally loaded. In this paper, we show that for real-time systems, load balancing is not desirable. In particular, we propose a new load-profiling ...
  • Park, Kihong (Boston University Computer Science Department, 1993-07-31)
    This paper presents a lower-bound result on the computational power of a genetic algorithm in the context of combinatorial optimization. We describe a new genetic algorithm, the merged genetic algorithm, and prove that for ...
  • Morcos, Hany; Matta, Ibrahim; Bestavros (Boston University Computer Science Department, 2004-07-14)
    Routing protocols in wireless sensor networks (WSN) face two main challenges: first, the challenging environments in which WSNs are deployed negatively affect the quality of the routing process. Therefore, routing protocols ...
  • Heddaya, Abdelsalam; Park, Kihong (Boston University Computer Science Department, 1994-02-07)
    For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally ...
  • Harfoush, Khaled; Bestavros, Azer; Byers, John (Boston University Computer Science Department, 2001-07-31)
    Accurate measurement of network bandwidth is crucial for flexible Internet applications and protocols which actively manage and dynamically adapt to changing utilization of network resources. These applications must do so ...
  • Carter, Robert L.; Crovella, Mark, E. (Boston University Computer Science Department, 1996-03-15)
    The quality of available network connections can often have a large impact on the performance of distributed applications. For example, document transfer applications such as FTP, Gopher and the World Wide Web suffer ...
  • Almeida, Jussara; Almeida, Virgílio; Yates, David J. (Boston University Computer Science Department, 1996-10-29)
    Server performance has become a crucial issue for improving the overall performance of the World-Wide Web. This paper describes Webmonitor, a tool for evaluating and understanding server performance, and presents new results ...
  • Barford, Paul; Crovella, Mark (Boston University Computer Science Department, 1999-04-23)
    One of the most vexing questions facing researchers interested in the World Wide Web is why users often experience long delays in document retrieval. The Internet's size, complexity, and continued growth make this a difficult ...
  • 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 ...
  • 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 ...
  • Sinha, Himanshu Shekhar (Boston University Computer Science Department, 1993-04)
    The proliferation of inexpensive workstations and networks has prompted several researchers to use such distributed systems for parallel computing. Attempts have been made to offer a shared-memory programming model on such ...
  • Marwan, Shaban (Boston University Computer Science Department, 1993-10-26)
    We describe a GB parser implemented along the lines of those written by Fong [4] and Dorr [2]. The phrase structure recovery component is an implementation of Tomita's generalized LR parsing algorithm (described in [10]), ...
  • Lakhina, Anukool; Mark, Crovella; Diot, Christophe (Boston University Computer Science Department, 2005-10-05)
    The increasing practicality of large-scale flow capture makes it possible to conceive of traffic analysis methods that detect and identify a large and diverse set of anomalies. However the challenge of effectively analyzing ...
  • Laoutaris, Nikolaos; Smaragdakis, Georgios; Bestavros, Azer; Ioannis Stavrakakis (Boston University Computer Science Department, 2005-07-07)
    Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems ...
  • Sclaroff, S.; Pentland, A. (Boston University Computer Science Department, 1995-03)
    Modal matching is a new method for establishing correspondences and computing canonical descriptions. The method is based on the idea of describing objects in terms of generalized symmetries, as defined by each object's ...

Search OpenBU


Browse

Deposit Materials

Statistics