203663688
Practical Solutions for QoS-Based Resource Allocation
An apparatus and method is disclosed for forming a liquid-tight container having a rectangular cross-section formed from a one-piece, T-shaped blank of paperboard material. The carton preferably includes an access flap and straw element on one side thereof which, when manually lifted, exposes an end of the straw element from which the contents of the carton may be consumed by a user. The apparatus is compact in nature, possessing relatively few transport mechanisms which advance the T-shaped carton blank through a plurality of work stations. A novel method and apparatus for serially applying the straw element and access panel to the carton blank is disclosed, wherein the straw element and a length of polyethylene coated Mylar tape is automatically bonded to the carton blank upon a rotating heat sealing and alignment drum. A conveyor for collating a plural number of the carton blanks about a forming mandrel is also provided, and is positioned transversely to the remainder of the apparatus thereby significantly reducing the overall size of the apparatus. An ultrasonic welder bonds the side seams and end closure panels of the container upon a rotating crossbar mandrel which eliminates any misalignment during the sealing process. A substantially rigid conveyor transport carries a plurality of the carton blanks through pre-form, filler, and end closure work stations, and includes plural anvils for the ultrasonic welding process. An ejector mechanism is additionally provided which ejects the filled carton blanks from the rigid conveyor along a dual direction path, thereby eliminating the possibility of creasing or puncturing the filled and sealed container. The apparatus of the present invention additionally accommodates the production of differing size containers with only minor adjustments.
5320438
On quality of service optimization with discrete QoS options
We present a QoS management framework that enables us to quantitatively measure QoS, and to analytically plan and allocate resources. In this model, end users' quality preferences are considered when system resources are apportional across multiple applications such that the net utility that accrues to the end-users is maximized. We previously worked with continuous QoS dimensions, and assumed that the utility gained by improvements along a QoS dimension were always representable by concave functions. In this paper we relax both assumptions. One, we support discrete QoS operating points. Two, we make no assumptions about the concavity of the utility functions. Using these as the basis, we tackle the problem of maximizing system utility by allocating a single finite resource to satisfy the QoS requirements of multiple applications along multiple QoS dimensions. We present two near-optimal algorithms to solve this problem. The first yields an allocation within a known bounded distance from the optimal solution, and the second yields an allocation whose distance from the optimal solution can be explicitly controlled by the QoS manager, We compare the run-times of these near-optimal algorithms and their solution quality relative to the optimal allocation, which in turn is computed using dynamic programming. These detailed evaluations provide practical insight into which of these algorithms can be used online in real-time systems.
558748
Speech through myoelectric signal recognition SMyLES
People who can not communicate throu­ gh audible speech are separated from society. SMyLES, MES hardware, and Speech generation hardware will allow these people the ability to join society. This paper is about the software called SMyLES that is the heart of the speecli recognition through myoelectric
40821829
Service class based online QoS management in surveillance radar systems
Many application level qualities are functions of available computation resources. Recent studies have handled the computation resource allocation problem to maximize the overall application quality. However such QoS problem is fundamentally a multi-dimensional optimization problem that requires extensive computation. Therefore, online usage of optimization procedures may significantly reduce the computation resource available for applications. This raises the question of how to best use the optimization procedures for dynamic real-time task sets. This paper proposes a method called service classes configuration to address the QoS problem with dynamic arrival and departure of tasks. A simplified radar application is used as an illustrative example.
8167367
Online QoS Optimization Using Service Classes in Surveillance Radar Systems
Many application level qualities are functions of available computation resources. Recent studies have handled the computation resource allocation problem to maximize the overall application quality. However, such QoS problems are fundamentally multi-dimensional optimization problems that require extensive computation. Therefore, online usage of optimization procedures may significantly reduce the computation resource available for applications. This raises the question of how to best use the optimization procedures for dynamic real-time task sets. In dynamic real-time systems, it is important to improve the performance by re-allocating the resources adapting to dynamic situations. However, the overhead of changing task parameters (i.e., algorithms and frequencies) for resource re-allocation is non-negligible in many applications. Thus, too frequent change of resource allocation may not be desirable. This paper proposes a method called service classes configuration to address the QoS problem with dynamic arrival and departure of tasks. The method avoids online usage of optimization procedures by offline designing templates (called service classes) of resource allocation, which will be adaptively used depending on online situations. The service classes are designed by best trading-off the accuracy of dynamic adaptation against the overhead of resource re-allocation. A simplified radar application is used as an illustrative example.
46069080
A Graph-Theoretic Model for Optimizing Large Join Queries
2648996
Determination of the Registration Point for Location Update by Dynamic Programming in PCS
Location management is important to effectively keep track of mobile terminals with reduced signal flows and database queries. Even though dynamic location management strategies are known to show good performance, we in this paper consider the static location management strategy which is easy to implement. A system with single home location register and pointer forwarding is assumed. A mobile terminal is assumed to have memory to store the IDs of visitor location registers (VLRs) each of which has the forwarding pointer to identify its current location. To obtain the registration point which minimizes the database access and signaling cost from the current time to the time of power-off probabilistic dynamic programming formulation is presented. A Selective Pointer Forwarding scheme is proposed which is based on one-step dynamic programming. The proposed location update scheme determines the least cost temporary VLR which point forwards the latest location of the mobile. The computational results show that the proposed scheme outperforms IS-41, pure Pointer Forwarding, and One-step Pointer Forwarding at the expense of small storage and a few computations at the mobile terminals.