Boston University

Displaying 121-160 of 176 results

  • White Papers // Mar 2010

    Colocation as a Service Strategic and Operational Services for Cloud Colocation

    By co-locating with other tenants of an Infrastructure as a Service (IaaS) offering, IaaS users could reap significant cost savings by judiciously sharing their use of the fixed-size instances offered by IaaS providers. This paper presents the blueprints of a Co-location as a Service (CaaS) framework. CaaS strategic services identify...

    Provided By Boston University

  • White Papers // Mar 2010

    Colocation as a Service: Strategic and Operational Services for Cloud Colocation

    By colocating with other tenants of an Infrastructure as a Service (IaaS) offering, IaaS users could reap significant cost savings by judiciously sharing their use of the fixed-size instances offered by IaaS providers. This paper presents the blueprints of a Colocation as a Service (CaaS) framework. CaaS strategic services identify...

    Provided By Boston University

  • White Papers // Mar 2010

    Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases

    Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. The authors present a general transformation that compiles any circuit into a new, functionally equivalent circuit which is resilient against well-defined classes of leakage. Their construction requires a small, stateless and computation-independent leak-proof component that...

    Provided By Boston University

  • White Papers // Feb 2010

    A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems

    Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. The mapping between what constitutes desirable performance and SLAs is not unique: multiple SLA expressions might be functionally equivalent....

    Provided By Boston University

  • White Papers // Feb 2010

    Scale Invariant Properties Of Public Debt Growth

    Public debt is one of the important economic variables that quantitatively describe a nation's economy. Because bankruptcy is a risk faced even by institutions as large as governments (e.g. Iceland), national debt should be strictly controlled with respect to national wealth. Also, the problem of eliminating extreme poverty in the...

    Provided By Boston University

  • White Papers // Feb 2010

    Mixture Models of Endhost Network Traffic

    In recent years there has been much interest in modeling internet traffic that comes from inside large networks, such as at routers or gateways. In this paper, the authors focus on modeling a little studied type of traffic - namely the network traffic generated from end-hosts. They study traffic data...

    Provided By Boston University

  • White Papers // Feb 2010

    Distributed Advance Network Reservation With Delay Guarantees

    New architectures have recently been proposed and deployed to support end-to-end advance reservation of network resources. These architectures rely on the use a centralized scheduler, which may be unpractical in large or administratively heterogeneous networks. In this paper, the authors explore and demonstrate the feasibility of implementing distributed solutions for...

    Provided By Boston University

  • White Papers // Jan 2010

    Does Lumpy Investment Matter For Business Cycles?

    The authors present an analytically tractable general equilibrium business cycle model that features micro-level investment lumpiness. They prove an exact irrelevance proposition which provides sufficient conditions on preferences, technology, and the fixed cost distribution such that any positive upper support of the fixed cost distribution yields identical equilibrium dynamics of...

    Provided By Boston University

  • White Papers // Jan 2010

    Design-Space Exploration for CMOS Photonic Processor Networks

    This paper presents a review of recent advances in building high-throughput, energy-efficient photonic networks for core-to-core and core-to-DRAM communication in many-core processor systems. To sustain the performance scaling in these systems, the increase in core count has to be followed by the corresponding increase in energy-efficiency of the core, the...

    Provided By Boston University

  • White Papers // Jan 2010

    Wireless Infrared Communications

    Wireless infrared communications refers to the use of free-space propagation of light waves in the near infrared band as a transmission medium for communication. The communication can be between one portable communication device and another or between a portable de-vice and a tethered device, called an access point or base...

    Provided By Boston University

  • White Papers // Dec 2009

    Extreme Value FEC for Reliable Broadcasting in Wireless Networks

    The advent of practical rateless codes enables implementation of highly efficient packet-level Forward Error Correction (FEC) strategies for reliable data broadcasting in loss-prone wireless networks, such as sensor networks. Yet, the critical question of accurately quantifying the proper amount of redundancy has remained largely unsolved. In this paper, the authors...

    Provided By Boston University

  • White Papers // Dec 2009

    The Structure And Growth Of Weighted Networks

    The authors develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In the framework, the Barabasi-Albert model of network evolution is extended by assuming that link weights evolve according to a geometric Brownian motion. The model...

    Provided By Boston University

  • White Papers // Dec 2009

    Reliable Wireless Broadcasting With Near-Zero Feedback

    The authors examine the problem of minimizing feedbacks in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Their key observation is that, in a broadcast environment, this problem resolves into estimating the maximum number of packets dropped among many receivers rather than for each individual receiver. With...

    Provided By Boston University

  • White Papers // Dec 2009

    On-Line Pricing of Secondary Spectrum Access With Unknown Demand Function and Call Length Distribution

    The authors consider a wireless provider who caters to two classes of customers, namely primary and secondary users. Primary users have long term contracts while secondary users are admitted and priced according to current availability of excess spectrum. Secondary users accept an advertised price with a certain probability defined by...

    Provided By Boston University

  • White Papers // Nov 2009

    A Distributed Actor-Critic Algorithm and Applications to Mobile Sensor Network Coordination Problems

    The authors introduce and establish the convergence of a distributed actor-critic method that orchestrates the coordination of multiple agents solving a general class of a Markov decision problem. The method leverages the centralized single-agent actor-critic algorithm of and uses a consensus-like algorithm for updating agents' policy parameters. As an application...

    Provided By Boston University

  • White Papers // Oct 2009

    Safe Compositional Network Sketches: The Formal Framework

    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: Modeling and design. As a modeling tool, it enables the of an existing system while retaining sufficient information about...

    Provided By Boston University

  • White Papers // Oct 2009

    Safe Compositional Network Sketches: Tool & Use Cases

    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 activities: modeling and design. As a modeling tool, it enables the of an existing system while retaining sufficient information...

    Provided By Boston University

  • White Papers // Oct 2009

    Impact of Asymmetric Traffic Densities on Delay Tolerant Vehicular Ad Hoc Networks

    Vehicular networking can be achieved with short, medium, or long-range communication technologies. However, there are trade-offs in the adoption of these technologies including data capacity, continuity of connections, energy use and contention with other users. The authors focus on short range technologies that support both near-neighbor communication, for safety applications,...

    Provided By Boston University

  • White Papers // Oct 2009

    Limits and Opportunities for Designing Manycore Processor-to-Memory Networks Using Monolithic Silicon Photonics

    To sustain the historic performance improvement in VLSI systems, while remaining within the power envelope, the trend has moved towards designing multiple cores on a single die. However, if designed using current and/or projected electrical solutions, these systems would quickly get bandwidth-limited due to bandwith density limitations and power constraints....

    Provided By Boston University

  • White Papers // Oct 2009

    PhD Forum: Routing Protocol and Performance Modeling in Delay Tolerant Vehicular Networks

    Development of networking protocols is essential for an emerging class of applications described as Vehicular Ad hoc NETworks (VANETs). The scope and requirements of applications vary significantly, and existing techniques do not apply. The nature of data exchange varies in time and space and thus, the protocols need to accommodate...

    Provided By Boston University

  • White Papers // Oct 2009

    On Fair Sharing of Spectrum Via CSMA

    The authors contrast CSMA and TDMA schemes for medium access in spatially dispersed wireless networks under the primary interference model. CSMA is based on random access via dynamically tuned parameters, whereas TDMA involves periodic bursts that are offset in time so as to avoid packet collisions. They study TDMA in...

    Provided By Boston University

  • White Papers // Sep 2009

    Active Hidden Models for Tracking With Kernel Projections

    The authors introduce Active Hidden Models (AHM) that utilize kernel methods traditionally associated with classification. They use AHMs to track deformable objects in video sequences by leveraging kernel projections. They introduce the "Subset projection" method which improves the efficiency of the tracking approach by a factor of ten. They successfully...

    Provided By Boston University

  • White Papers // Sep 2009

    Asymptotically Optimal Data Dissemination in Multi-Channel Wireless Sensor Networks: Single Radios Suffice

    The authors analyze the performance limits of data dissemination with multi-channel, single radio sensors under random packet loss. They formulate the problem of minimizing the average delay of data dissemination as a stochastic shortest path problem and show that, for an arbitrary topology network, an optimal control policy can be...

    Provided By Boston University

  • White Papers // Sep 2009

    Is a Detector Only Good for Detection?

    A common design of an object recognition system has two steps, a detection step followed by a foreground within class classification step. For example, consider face detection by a boosted cascade of detectors followed by face ID recognition via One-Vs-All (OVA) classifiers. Another example is human detection followed by pose...

    Provided By Boston University

  • White Papers // Sep 2009

    Tracking a Large Number of Objects From Multiple Views

    The authors propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. They formulate the problem of finding correspondences across multiple views as a multidimensional assignment problem and use a greedy randomized adaptive search procedure to solve this NP-hard problem efficiently. To...

    Provided By Boston University

  • White Papers // Aug 2009

    Principles of Safe Policy Routing Dynamics

    This paper introduces the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the notion of causation chains where the route flap at one node causes a flap at the next node along the chain. Using DPR,...

    Provided By Boston University

  • White Papers // Aug 2009

    PreDA: Predicate Routing for DTN Architectures Over MANET

    The authors consider a Delay Tolerant Network (DTN) whose users (Nodes) are connected by an underlying Mobile Ad hoc NETwork (MANET) substrate. Users can declaratively express high-level policy constraints on how "Content" should be routed. For example, content can be directed through an intermediary DTN node for the purposes of...

    Provided By Boston University

  • White Papers // Aug 2009

    Angels: In-Network Support for Minimum Distribution Time in P2P Overlays

    This paper proposes the use of in-network caches (which the authors call Angels) to reduce the Minimum Distribution Time (MDT) of a file from a seeder - a node that possesses the file - to a set of leechers - nodes who are interested in downloading the file. An Angel...

    Provided By Boston University

  • White Papers // Aug 2009

    Pricing Strategies for Spectrum Lease in Secondary Markets

    The authors develop analytical models to characterize pricing of spectrum rights in cellular CDMA networks. Specifically, they consider a primary license holder that aims to lease its spectrum within a certain geographic sub-region of its network. Such a transaction has two contrasting economic implications: On the one hand the lessor...

    Provided By Boston University

  • White Papers // Jul 2009

    Brief Announcement: Cloud Computing Games: Pricing Services of Large Data Centers

    Organizations opt to reduce costs by contracting their day-to-day computing needs to service providers who offer large-scale data centers and cloud computing services. Like other computing commodities, data centers provide paid services that require careful pricing. Using a Stackelberg game formulation, this paper presents a demand-based pricing model for maximizing...

    Provided By Boston University

  • White Papers // Jun 2009

    CSR: Constrained Selfish Routing in Ad-Hoc Networks

    Routing protocols for ad-hoc networks assume that the nodes forming the network are either under a single authority, or else that they would be altruistically forwarding data for other nodes with no expectation of a return. These assumptions are unrealistic since in ad-hoc networks, nodes are likely to be autonomous...

    Provided By Boston University

  • White Papers // May 2009

    RefLink: An Interface That Enables People With Motion Impairments to Analyze Web Content and Dynamically Link to References

    In this paper, the authors present RefLink, an interface that allows users to analyze the content of web page by dynamically linking to an online encyclopedia such as Wikipedia. Upon opening a webpage, RefLink instantly provides a list of terms extracted from the webpage and annotates each term by the...

    Provided By Boston University

  • White Papers // May 2009

    Colocation Games and Their Application to Distributed Resource Management

    The authors introduce Colocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed/cloud computing environments, where resources are offered in an open marketplace to independent, rational parties interested in setting up their own applications. Virtualization technologies enable the...

    Provided By Boston University

  • White Papers // May 2009

    Elucidating the Instability of Random Access Wireless Mesh Networks

    This paper investigates both theoretically and experimentally the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. The authors identify two key factors that impact stability: the network size and the...

    Provided By Boston University

  • White Papers // Apr 2009

    Optimized Scheduled Multiple Access Control for Wireless Sensor Networks

    The authors consider wireless sensor networks with multiple sensor modalities that capture data to be transported over multiple frequency channels to potentially multiple gateways. They study a general problem of maximizing a utility function of achievable transmission rates between communicating nodes. Decisions involve routing, transmission scheduling, power control, and channel...

    Provided By Boston University

  • White Papers // Apr 2009

    On the Performance and Robustness of Managing Reliable Transport Connections

    The authors revisit the problem of connection management for reliable transport. At one extreme, a pure Soft-State (SS) approach safely removes the state of a connection at the sender and receiver once the state timers expire without the need for explicit removal messages. And new connections are established without an...

    Provided By Boston University

  • White Papers // Apr 2009

    Mining Frequent Arrangements of Temporal Intervals

    The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed that the database consists of sequences of events, where an event occurs during a time-interval. The goal is to mine temporal arrangements of event intervals that appear frequently in the database. The motivation of this work...

    Provided By Boston University

  • White Papers // Apr 2009

    Seed Scheduling for Peer-to-Peer Networks

    The initial phase in a content distribution (file sharing) scenario is a delicate phase due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of the pieces in this phase can cause delays in reaching steady state, thus increasing file download times. The authors...

    Provided By Boston University

  • White Papers // Mar 2009

    Spot Pricing of Secondary Spectrum Access in Wireless Cellular Networks

    Recent deregulation initiatives enable cellular providers to sell excess spectrum for secondary usage. In this paper, the authors investigate the problem of optimal spot pricing of spectrum by a provider in the presence of both non-elastic primary users, with long-term commitments, and opportunistic, elastic secondary users. They first show that...

    Provided By Boston University

  • White Papers // Mar 2009

    On Spectrum Sharing in Narrowband Cellular Wireless Networks

    The authors study secondary spectrum sharing in narrow-band cellular networks in which calls in neighboring cells need to be assigned different channels. Analysis of such networks are in general difficult due to large state spaces and lack of closed form expressions. Here they consider linear topologies and show that they...

    Provided By Boston University

  • White Papers // Jan 2011

    iJoin: Importance-Aware Join Approximation Over Data Streams

    The authors consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective eviction of tuples (load-shedding) is needed, but is challenging since data distributions and arrival rates are unknown a priori. Also, in many real-world applications such as...

    Provided By Boston University

  • White Papers // Jun 2010

    On The Dynamics Of Unemployment And Wage Distributions

    Postel-Vinay and Robin's (2002) sequential auction model is extended to allow for aggregate productivity shocks. Workers exhibit permanent differences in ability while firms are identical. Negative aggregate productivity shocks induce job destruction by driving the surplus of matches with low ability workers to negative values. Endogenous job destruction coupled with...

    Provided By Boston University

  • White Papers // Sep 2010

    Credit Risk And Business Cycles

    The authors incorporate long-term defaultable corporate bonds and credit risk in a dynamic stochastic general equilibrium business cycle model. Credit risk amplifies aggregate technology shocks. The debt-capital ratio is a new state variable and its endogenous movements provide a propagation mechanism. The model can match the persistence and volatility of...

    Provided By Boston University

  • White Papers // Jan 2010

    Does Lumpy Investment Matter For Business Cycles?

    The authors present an analytically tractable general equilibrium business cycle model that features micro-level investment lumpiness. They prove an exact irrelevance proposition which provides sufficient conditions on preferences, technology, and the fixed cost distribution such that any positive upper support of the fixed cost distribution yields identical equilibrium dynamics of...

    Provided By Boston University

  • White Papers // Oct 2009

    Impact of Asymmetric Traffic Densities on Delay Tolerant Vehicular Ad Hoc Networks

    Vehicular networking can be achieved with short, medium, or long-range communication technologies. However, there are trade-offs in the adoption of these technologies including data capacity, continuity of connections, energy use and contention with other users. The authors focus on short range technologies that support both near-neighbor communication, for safety applications,...

    Provided By Boston University

  • White Papers // Feb 2011

    Entangled Financial Systems

    This paper analyzes counterparty risk in entangled financial systems in which banks hedge risks using a network of bilateral over-the-counter contracts. If banks have large exposures to a few counterparties, they do not buy insurance against a low probability counterparty default even though it is socially desirable. This is because...

    Provided By Boston University

  • White Papers // Nov 2008

    Tracking Multiple Targets Using Binary Decisions from Wireless Sensor Networks

    This paper introduces a framework for tracking multiple targets over time using binary decisions collected by a wireless sensor network, and applies the methodology to two case studies - an experiment involving tracking people and a project tracking zebras. The tracking approach is based on a penalized maximum likelihood framework,...

    Provided By Boston University

  • White Papers // Jan 2011

    Virtual-CPU Scheduling in the Quest Operating System

    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, the authors focus on one aspect of predictability, involving the integrated management of tasks and I/O events such...

    Provided By Boston University

  • White Papers // Jul 2011

    A V2X-Based Approach for Reduction of Delay Propagation in Vehicular Ad-Hoc Networks

    In this paper, the authors investigate the time delay propagation rates in a Vehicular Ad-Hoc Network, where vehicular connectivity is supported by both Vehicle-To-Vehicle (V2V) and Vehicle-To-Infrastructure (V2I) protocols. In their vision, seamless connectivity issues in a VANET with nearby network infrastructure, can be fixed by an opportunistic choice of...

    Provided By Boston University

  • White Papers // May 2010

    Role of Directional Wireless Communication in Vehicular Networks

    Enabling safety in vehicles is an ongoing challenge for the automotive sector. One approach towards enhancing safety is to increase knowledge within a vehicle of the actions of vehicles in the vicinity. Increased awareness is essential for activating the safety systems to take evasive or precautionary actions in the event...

    Provided By Boston University

  • White Papers // Jan 2011

    Characterizing and Exploiting Reference Locality in Data Stream Applications

    In this paper, the authors investigate a new approach to process queries in data stream applications. They show that reference locality characteristics of data streams could be exploited in the design of superior and flexible data stream query processing techniques. They identify two different causes of reference locality: popularity over...

    Provided By Boston University

  • White Papers // Sep 2010

    Trade & Cap: A Customer-Managed, Market-Based System for Trading Bandwidth Allowances at a Shared Link

    This paper proposes Trade & Cap (T&C), an economics-inspired mechanism that incentivizes users to voluntarily coordinate their consumption of the bandwidth of a shared network link so as to converge on what they perceive to be an equitable allocation, while ensuring efficient resource utilization. Under T&C, rather than acting as...

    Provided By Boston University

  • White Papers // Jan 2011

    Programming With Dependently Typed Data Structures

    The mechanism for declaring datatypes in functional programming languages such as ML and Haskell is of great use in practice. This mechanism, however, often suffers from its imprecision in capturing various invariants inherent in data structures. The introduction of dependent datatypes in Dependent ML (DML) can partly remedy the situation,...

    Provided By Boston University

  • White Papers // Jan 2011

    Dependent Types for Program Termination Verification

    Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is still undeniably a difficult task to design a termination checker for a realistic programming language that supports general recursion. In this paper, the authors...

    Provided By Boston University

  • White Papers // Jan 2011

    Dependent ML: An Approach to Practical Programming With Dependent Types

    The authors present an approach to enriching the type system of ML with a restricted form of dependent types, where type index terms are required to be drawn from a given type index language that is completely separate from run-time programs, leading to the DML language schema. This enrichment allows...

    Provided By Boston University

  • White Papers // Mar 2011

    A Token Based Approach to Distributed Computation in Sensor Networks

    The authors consider distributed algorithms for data aggregation and function computation in sensor networks. The algorithms perform pairwise computations along edges of an underlying communication graph. A token is associated with each sensor node, which acts as a transmission permit. Nodes with active tokens have transmission permits; they generate messages...

    Provided By Boston University

  • White Papers // Feb 2009

    Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation

    The authors propose an information theoretic framework for the Secure two-party Function Computation (SFC) problem and introduce the notion of SFC capacity. They study and extend string Oblivious Transfer (OT) to sample-wise OT. They propose an efficient, perfectly private OT protocol utilizing the binary erasure channel or source. They also...

    Provided By Boston University

  • White Papers // May 2010

    Using Lightweight Formal Methods for JavaScript Security

    The goal of this investigation was to apply lightweight formal methods to the study of the security of the JavaScript language. Previous work has shown that lightweight formal methods present a new approach to the study of security in the context of the Java Virtual Machine (JVM). Since there is...

    Provided By Boston University

  • White Papers // Jul 2010

    Learning Actions From The Web

    This paper proposes a generic method for action recognition in uncontrolled videos. The idea is to use images collected from the Web to learn representations of actions and use this knowledge to automatically annotate actions in videos. The authors approach is unsupervised in the sense that it requires no human...

    Provided By Boston University

  • White Papers // Feb 2011

    Formal Verification of SLA Transformations

    Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. The mapping between what constitutes desirable performance and SLAs is not unique: multiple SLA expressions might be functionally equivalent....

    Provided By Boston University

  • White Papers // Apr 2010

    On the Detection of Policy Conflicts in Interdomain Routing

    The Dynamic Policy Routing model (DPR) was recently introduced to explicitly model the dynamics of policy routing. DPR extends the formalism of the stable paths problem with discrete synchronous time to capture the propagation of path changes in any dynamic network using a structure called the causation chain. In this...

    Provided By Boston University

  • White Papers // Mar 2010

    A Green Distributed Cooperation for Network and Content Management

    The authors propose a distributed approach in which an Internet Service Provider (ISP) and a Content Provider (CP) cooperate to minimize total power consumption. The authors solution is distributed between the ISP and the CP to limit shared information, such as network topology and servers load. In particular, they develop...

    Provided By Boston University

  • White Papers // Mar 2010

    Colocation as a Service: Strategic and Operational Services for Cloud Colocation

    By colocating with other tenants of an Infrastructure as a Service (IaaS) offering, IaaS users could reap significant cost savings by judiciously sharing their use of the fixed-size instances offered by IaaS providers. This paper presents the blueprints of a Colocation as a Service (CaaS) framework. CaaS strategic services identify...

    Provided By Boston University

  • White Papers // Sep 2009

    Is a Detector Only Good for Detection?

    A common design of an object recognition system has two steps, a detection step followed by a foreground within class classification step. For example, consider face detection by a boosted cascade of detectors followed by face ID recognition via One-Vs-All (OVA) classifiers. Another example is human detection followed by pose...

    Provided By Boston University

  • White Papers // Oct 2010

    On Unconditionally Secure Computation With Vanishing Communication Cost

    The authors propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalized sum-type function of those sequences. They construct three-party protocols that allow Charlie to compute the function with arbitrarily high accuracy, while maintaining unconditional privacy...

    Provided By Boston University

  • White Papers // Oct 2010

    Exact Analysis of Rate Adaptation Algorithms in Wireless LANs

    Rate adaptation plays a key role in determining the performance of wireless LANs. In this paper, the authors introduce a semi-Markovian framework to analyze the performance of two of the most popular rate adaptation algorithms used in wireless LANs, namely Automatic Rate Fallback (ARF) and Adaptive Automatic Rate Fallback (AARF)....

    Provided By Boston University

  • White Papers // Jul 2010

    A Novel Web-Based Approach for Balancing Usability and Security Requirements of Text Passwords

    Many Internet applications, for example e-commerce or email services require that users create a username and password which serves as an authentication mechanism. Though text passwords have been around for a while, not much has been done in helping naive Internet users in creating strong passwords. Generally users prefer easy-to-remember...

    Provided By Boston University

  • White Papers // Sep 2009

    Tracking a Large Number of Objects From Multiple Views

    The authors propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. They formulate the problem of finding correspondences across multiple views as a multidimensional assignment problem and use a greedy randomized adaptive search procedure to solve this NP-hard problem efficiently. To...

    Provided By Boston University

  • White Papers // Sep 2009

    Active Hidden Models for Tracking With Kernel Projections

    The authors introduce Active Hidden Models (AHM) that utilize kernel methods traditionally associated with classification. They use AHMs to track deformable objects in video sequences by leveraging kernel projections. They introduce the "Subset projection" method which improves the efficiency of the tracking approach by a factor of ten. They successfully...

    Provided By Boston University

  • White Papers // Aug 2010

    Example-Based Image Registration Via Boosted Classifiers

    The authors propose a novel image registration framework which uses classifiers trained from examples of aligned images to achieve registration. The approach is designed to register images of medical data where the physical condition of the patient has changed significantly and image intensities are drastically different. They use two boosted...

    Provided By Boston University

  • White Papers // May 2010

    A Message Propagation Model for Hybrid Vehicular Communication Protocols

    This paper addresses a hybrid approach on message propagation in vehicular networks. Short-range Vehicle-To-Vehicle (V2V) communications cannot always guarantee connectivity to the network cloud, especially when traffic density is very low. By utilizing existing wireless network infrastructure it is possible to greatly enhance the capabilities of short range V2V technologies....

    Provided By Boston University

  • White Papers // Mar 2010

    QoS-Enabled Video Streaming in Wireless Sensor Networks

    Recent advances in wireless communications technology and low-power, low-cost CMOS imaging sensors enable a new sensing modality employing ubiquitous distributed video sensing. In many video sensing applications multimedia streams are often required by the base station to provide detailed information of the target spot in the sensor field. However, limited...

    Provided By Boston University

  • White Papers // May 2010

    Throughput Estimation for Singleton Video Streaming Application Over Wireless Sensor Network

    Recent advances in wireless communications technology and low-power, low-cost CMOS imaging sensors enable a new sensing modality employing ubiquitous distributed video sensing. In many video sensing applications multimedia streams are often required by the base station to provide detailed information of the target spot in the sensor field. Such applications...

    Provided By Boston University

  • White Papers // Oct 2009

    PhD Forum: Routing Protocol and Performance Modeling in Delay Tolerant Vehicular Networks

    Development of networking protocols is essential for an emerging class of applications described as Vehicular Ad hoc NETworks (VANETs). The scope and requirements of applications vary significantly, and existing techniques do not apply. The nature of data exchange varies in time and space and thus, the protocols need to accommodate...

    Provided By Boston University

  • White Papers // Dec 2008

    Access Point Placement in Vehicular Networking

    Providing wireless networking to vehicles has been identified as a near-term goal by the automotive industry in the support of basic Internet access as well as an enabler to a variety of safety enhancement applications. Network connectivity to on-board computers can be provided via existing mobile telephony; however, these systems...

    Provided By Boston University

  • White Papers // Dec 2008

    Phase Transition Behavior of Message Propagation in Delay Tolerant Vehicular Ad Hoc Networks

    The vehicular networking environment is characterized by time-varying traffic density and relatively high vehicular mobility rates. Enabling networking in the vehicular environment is challenging due to the rapidly changing topology and the vast network of roadways. In this paper, the authors present an analytical model to describe the behavior of...

    Provided By Boston University

  • White Papers // Aug 2011

    Phase Transition of Message Propagation Speed in Delay Tolerant Vehicular Networks

    Delay Tolerant Network (DTN) architectures have recently been proposed as a means to enable efficient routing of messages in Vehicular Area NETworks (VANETs), which are characterized by alternating periods of connectivity and disconnection. Under such architectures, when multi-hop connectivity is available, messages propagate at the speed of radio over connected...

    Provided By Boston University

  • White Papers // Jul 2010

    Reservation Policies for Revenue Maximization From Secondary Spectrum Access in Cellular Networks

    The authors consider the problem of providing opportunistic spectrum access to secondary users in wireless cellular networks. From the standpoint of spectrum license holders, achieving benefits of secondary access entails balancing the revenue from such access and its impact on the service of primary users. While dynamic optimization is a...

    Provided By Boston University

  • White Papers // Sep 2009

    Asymptotically Optimal Data Dissemination in Multi-Channel Wireless Sensor Networks: Single Radios Suffice

    The authors analyze the performance limits of data dissemination with multi-channel, single radio sensors under random packet loss. They formulate the problem of minimizing the average delay of data dissemination as a stochastic shortest path problem and show that, for an arbitrary topology network, an optimal control policy can be...

    Provided By Boston University

  • White Papers // Sep 2008

    Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes

    Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their limitations present challenges to fundamental network services such as routing. In this paper, the authors utilize an abstraction of WSNs based on the theory of identifying codes. This abstraction has been useful in recent literature...

    Provided By Boston University