5051365
Promising Approach to Distributed Query Processing
15816324
Multi-level specification and protocol design for distributed multimedia communication
The major challenge in the design of an efficient distributed multimedia system is the integration and support of a wide variety of applications. Investigating the basic issues involved in the design and specification of distributed muttimcdia systems is the focus of this paper. A basic layered network architecture is proposed as the uniform framework for the investigation of different levels of functionality typically associated with the communication network that supports multimedia communication. Within this framework, we propose to identify the communication requirements for multimedia applications and characterize a set of communication primitives which specify different qualities of scrvicc to reflect different real-time rcquircmcnts. ‘Ilis investigation is guided by an efficient and flexible multi-level specification model. We will characterize this model and show that the model can be amenable to the construction of a set of communication primitives that support synchronization and communication of multimedia applications.
35519508
Extending Visual Languages for Multimedia
Visual languages, which let users customize iconic sentences, can be extended to accommodate multimedia objects, letting users access media dynamically. Teleaction objects, or multimedia objects with knowledge structures, can be designed using visual languages to automatically respond to events and perform tasks like "find related books" in a virtual library.
17298481
Iconic language design for people with significant speech and multiple impairments
We present an approach of iconic language design for people with significant speech and multiple impairments (SSMI), based upon the theory of Icon Algebra and the theory of Conceptual Dependency (CD) to derive the meaning of iconic sentences. An interactive design environment based upon this methodology is described.
39945679
Iconic Language Design for People with Significant Speech and Multiple Impairments
34016873
Parsing 2D Languages by a Pictorial GLR Parser
18088728
Order Consolidation for Batch Processing
We consider the batch processing of orders where either whole or part of a single order or a specific pair of different orders may be grouped in a batch with a fixed capacity. The problem can be modelled by a graph G = (V,E), where each node v$${\in}$$V corresponds to an order, its weight w(v) corresponds to the amount of ordered quantity and a pair of orders, say u and v may be grouped in a batch if there exists the edge (u,v) $${\in}$$E. The objective is to maximize the number of batches filled up to its capacity $$\lambda$$. In this paper, we prove that the problem is NP-hard and, moreover, that no PTAS exists unless P = NP. Then, an optimal algorithm is developed with running time O(|V|log |V|) for the special case when G is a tree.
17634440
An optimal cache algorithm for streaming VBR video over a heterogeneous network
High quality video content for on-demand services is usually stored and streamed in a compressed format with a VBR (variable bit rate) property; however, the streaming traffic is extremely bursty. If there is no client buffer to regulate the video's delivery, the backbone WAN (wide area network) bandwidth needs to allocate the video's peak bit rate to guarantee playback quality. To reduce the bandwidth requirement in the backbone WAN, previous researchers have proposed a Video Staging Mechanism to cache portions of the video in a video proxy close to clients. In this paper, we propose a very effective OC (optimal cache) algorithm to handle the Video Staging Mechanism and prove theoretically that the proxy cache computed by our OC algorithm for each video is minimal when all other resources remain constant. On the basis of experiment results, we cache the least amount of video data in the video proxy by using the OC algorithm, and reduce the WAN bandwidth requirement by an amount equal to that of conventional algorithms. In contrast, given the equal size of the storage in a video proxy, the OC algorithm reduces the bandwidth requirement in the backbone WAN much more than conventional algorithms.
44449006
Online and semi-online scheduling of two machines under a grade of service provision
We consider the online scheduling of two machines under a grade of service (GoS) provision and its semi-online variant where the total processing time is known. Respectively for the online and semi-online problems, we develop algorithms with competitive ratios of 53 and 32 which are shown to be optimal.
7967901
The effect of machine availability on the worst-case performance of LPT
We consider the makespan minimization parallel machine scheduling problem where each machine may be unavailable for a known time interval. For this problem, we investigate how the worst-case behavior of the longest processing time first algorithm (LPT) is affected by the availability of machines. In particular, for given m machines, we analyze the cases where arbitrary number, λ, ranging from one to m - 1, machines are unavailable simultaneously. Then, we show that the makespan of the schedule generated by LPT is never more than the tight worst-case bound of 1 + ½ ⌊m/(m - λ)⌋ times the optimum makespan.
15655721
The Worst-case Analysis of the MULTIFIT Algorithm for Scheduling Nonsimultaneous Parallel Machines
Abstract In this paper we consider the nonsimultaneous multiprocessor scheduling problem, or NMSP for short. The NMSP is a makespan minimization scheduling problem which involves the nonpreemptive assignment of independent jobs on m parallel machines with different starting times. It is well known that the longest processing time (LPT) algorithm and the modified LPT(MLPT) algorithm yield schedules with makespans bounded by 3 2 − 1 2m and 4/3 times the optimum makespan, respectively. In this paper, we show that the best known worst-case performance bound, 4/3 of the MLPT, is tight by constructing a worst-case example. Then, we employ the bin-packing heuristic algorithm called the MULTIFIT to solve the NMSP and show that the makespan of the schedule generated by the MULTIFIT algorithm is bounded by 9/7+2−k times the optimum makespan, where k is the selected number of the major iterations in the MULTIFIT. This worst-case bound of the MULTIFIT algorithm is, so far, the best bound for the NMSP and the tightness of the bound is still an open question.