- OpenBU
- →
- College of Arts and Sciences
- →
- Browsing College of Arts and Sciences by Title
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing College of Arts and Sciences by Title
Now showing items 1015-1034 of 1265
-
(CS Department, Boston University, 2010-01-19)NetSketch is a tool for the specification of constrained-flow networks (CFNs) and the certification of desirable safety properties imposed thereon, conceived to assist system integrators in modeling and design. It provides ...
-
(Boston University Computer Science Department, 2009-10-30)NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of activities: ...
-
(Boston University Computer Science Department, 2009-10-01)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 ...
-
(Boston University Computer Science Department, 2004-05-14)The Science of Network Service Composition has clearly emerged as one of the grand themes driving many of our research questions in the networking field today [NeXtworking 2003]. This driving force stems from the rise of ...
-
(Boston University Computer Science Department, 2005-12-28)We present a type inference algorithm, in the style of compositional analysis, for the language TRAFFIC—a specification language for flow composition applications proposed in [2]—and prove that this algorithm is correct: ...
-
(Boston University Computer Science Department, 2005-05-01)This paper formally defines the operational semantic for TRAFFIC, a specification language for flow composition applications proposed in BUCS-TR-2005-014, and presents a type system based on desired safety assurance. We ...
-
(Boston University Computer Science Department, 2006-10-26)In the framework of iBench research project, our previous work created a domain specific language TRAFFIC [6] that facilitates specification, programming, and maintenance of distributed applications over a network. It ...
-
(Boston University Computer Science Department, 2002-05-22)As new multi-party edge services are deployed on the Internet, application-layer protocols with complex communication models and event dependencies are increasingly being specified and adopted. To ensure that such protocols ...
-
(Boston University Computer Science Department, 2002-07-15)Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute studies have led some authors to conclude that the router graph of ...
-
(Boston University Computer Science Department, 2001-10)To serve asynchronous requests using multicast, two categories of techniques, stream merging and periodic broadcasting have been proposed. For sequential streaming access where requests are uninterrupted from the beginning ...
-
(Boston University Computer Science Department, 2005-01-20)Emerging network monitoring infrastructures capture packet-level traces or keep per-flow statistics at a set of distributed vantage points. Today, distributed monitors in such an infrastructure do not coordinate monitoring ...
-
(Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 2000-09)From the dawn of modern neural network theory, the mammalian cerebellum has been a favored object of mathematical modeling studies. Early studies focused on the fan-out, convergence, thresholding, and learned weighting of ...
-
(Boston University Computer Science Department, 2006-07-14)Overlay networks have become popular in recent times for content distribution and end-system multicasting of media streams. In the latter case, the motivation is based on the lack of widespread deployment of IP multicast ...
-
(Boston University Computer Science Department, 2002-08-27)We present a distributed indexing scheme for peer to peer networks. Past work on distributed indexing traded off fast search times with non-constant degree topologies or network-unfriendly behavior such as flooding. In ...
-
(Boston University Computer Science Department, 2002-03-21)Previous studies have shown that giving preferential treatment to short jobs helps reduce the average system response time, especially when the job size distribution possesses the heavy-tailed property. Since it has been ...
-
(Boston University Computer Science Department, 1994-10)We describe our work on shape-based image database search using the technique of modal matching. Modal matching employs a deformable shape decomposition that allows users to select example objects and have the computer ...
-
(Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 2009)SyNAPSE program of the Defense Advanced Projects Research Agency (HRL Laboratories LLC, subcontract #801881-BS under DARPA prime contract HR0011-09-C-0001); CELEST, a National Science Foundation Science of Learning Center ...
-
(Boston University Computer Science Department, 1999-10-08)To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of-Service (QoS) constraints. However, the ...
-
(BioMed Central, 2003-11-21)BACKGROUND. Differences among species and among years in reproductive seasonality (the tendency for clusters of events to fall at approximately the same point in each year) and synchrony (amount of clustering of events ...
-
(Oxford University Press, 2006-07-05)The hybridization kinetics for a series of designed 25mer probe–target pairs having varying degrees of secondary structure have been measured by UV absorbance and surface plasmon resonance (SPR) spectroscopy in solution ...
Now showing items 1015-1034 of 1265
