bound
RSS boundDelivering on the Promise of eLearning
White Paper This white paper defines the framework to launch e-learning as a set of teaching, training, and learning practices not bound by a specific technology platform or learning management system. The use of eLearning is reemerging as a solution for... [12 Aug 2008]
Instance-Level Security Management in Web Service Business Processes
White Paper By using Web services, people can generate flexible business processes whose activities are scattered across different organizations, with the services carrying out the activities bound at run-time. The paper investigates the security issues... [04 Aug 2008]
METERG: Measurement-Based End-to-End Performance Estimation Technique in QoS-Capable Multiprocessors
White Paper This paper introduces the METERG (Measurement-Time Enforcement and Run-Time Guarantee) QoS system that provides an easy method of obtaining a tight estimate of the lower bound on end-to-end performance for a given configuration of resource... [04 Aug 2008]
OverQoS: An Overlay Based Architecture for Enhancing Internet QoS
White Paper Using a Controlled Loss Virtual Link (CLVL) abstraction to bound the loss rate observed by a traffic aggregate, OverQoS can provide a variety of services including: (a) smoothing packet losses; (b) prioritizing packets within an aggregate; (c... [04 Aug 2008]
Adaptive Resource Allocation for Multimedia QoS Management in Wireless Networks
White Paper Appropriate call-admission control and resource-reservation schemes are developed to allocate resources adaptively to the real-time service classes with a stringent delay bound. Adaptive resource allocation for multimedia Quality of Service (QoS... [04 Aug 2008]
Investment Governance Webcast: Solving Presidential Mandates, OMB Requirements and Serving the American Public
White Paper With the goal of creating a process that is Specific, Measurable, Achievable, Relevant and Time-bound (SMART), the OMB continues to drive continuous improvement in the delivery of America's most vital programs. [04 Aug 2008]
Sufficient Rate Constraints for QoS Flows in Ad-Hoc Networks
White Paper Using the cliques (complete subgraphs) of the conflict graph, the authors derive constraints that are sufficient for a set of flow rates to be feasible, yet are guaranteed to be within a constant bound of the optimal. [04 Aug 2008]
Blowing up hard drives, stinky broadband and super cars
Photo The modestly named Hero bot uses its spotlights and high resolution cameras to scan the underside of UK-bound lorries and coaches travelling through Calais - one of Europe's biggest ports. The Tesla Roadster, a sporty variation on the electric car... [01 Aug 2008]
Photos: 'Hero' bot hunts criminals
Photo The modestly named Hero bot uses its spotlights and high resolution cameras to scan the underside of UK-bound lorries and coaches travelling through Calais - one of Europe's biggest ports. It might only be the size of a briefcase but an intelligent... [24 Jul 2008]
AC Algorithms in AQUILA QoS IP Network
White Paper The applied approach employs the well known Hoeffding bound formula for calculating required link capacity to assure packet loss ratio at a predefined level. This paper presents the Admission Control (AC) algorithms that are implemented in the... [18 Jul 2008]
The 15-petabyte network behind the Cern atom smasher
News But there are bound to be surprises around the corner, the biggest challenge is for the software to work out which of the 200 or so tier two sites has which data. Enough information to fill multiple CDs every second is flowing across the world on a... [15 Jul 2008]
Hybrid Bandwidth Scheduling for CAN-Based Networked Control Systems
White Paper Moreover, considering the constraints of control performance and network schedulability, a heuristic branch and bound & Genetic Algorithm (GA) algorithm is presented for the control data to minimize their bandwidth occupancy and the jitter caused... [11 Jul 2008]
Better Bounds for Online Load Balancing on Unrelated Machines
White Paper It presents an improved upper bound for the greedy algorithm through simple analysis; this bound is also shown to be best possible within the class of deterministic online algorithms for the problem. This paper studies the problem of scheduling... [10 Jul 2008]
Load Balancing in Bounded-Latency Content Distribution
White Paper It investigate the problem of provisioning an underlying balanced data replication service to provide a global latency bound on data retrieval in content distribution networks. The solution involves constructing an overlay network based on the... [10 Jul 2008]
Online Client-Server Load Balancing Without Global Information
White Paper In contrast to that work, it proves a strong lower bound (polynomial in n, the size of the graph) on the competitive ratio of any oblivious algorithm. A distributed online algorithm is considered for maximizing throughput in a network of clients... [10 Jul 2008]
