37964793
Object-Oriented Design and Implementation of the OE-Scheduler in Real Time Environments
5325970
Nearly Dynamic Task Model Scheduling with Aperiodic Tasks
671835
Algorithm for Reducing the Complexity of Switching Time in Real-Time Multitask Environments
46464172
Metrics Comparison for Java Programs Using a Software Tool
11585078
An Arrival Time Approach to M/G/1-type Queues with Generalized Vacations
We propose a simple way, called the arrival time approach, of finding the queue length distributions for M/G/1-type queues with generalized server vacations. The proposed approach serves as a useful alternative to understanding complicated queueing processes such as priority queues with server vacations and MAP/G/1 queues with server vacations.
35319384
Gesture spotting from continuous hand motion
This paper proposes a new method of gesture spotting based on the Hidden Markov Model (HMM) that extracts meaningful gestures from continuous hand motion. To remove non-gesture patterns from input patterns, we introduce the threshold model that calculates the threshold likelihood of the input pattern and helps to qualify an input pattern as a gesture. The proposed method extracts gestures with 93.38% reliability.
5211893
The Growth of Broadband and Electronic Commerce in South Korea: Contributing Factors
From 1998 through 2001, South Korea witnessed a remarkable diffusion in broadband Internet connections. Using published and other data, this paper explores the actions and factors contributing to this diffusion from three viewpoints: government, private sector, and social. We suggest that the matching of demand and supply is the most important factor in the fast diffusion of broadband in Korea. In particular, fierce infrastructure competition led to quality services at a low fixed price. Online gaming exhibits some of the characteristics of a "killer application"; there are also some social and cultural drivers of demand. We then consider the impact that this rapid diffusion has had on electronic commerce. We produce conclusions of value to policymakers.
9646078
Parallel hashing algorithms on BSP and QSM models
Summary form only given. We study two parallel computing models - the bulk synchronous parallel (BSP) and the queued shared memory (QSM) - as alternatives to the PRAM model to provide more accurate performance predictions and analyses, and compares the two models in detail. As a case study, we consider a simple hashing problem, design the two versions - the message passing version and the shared memory version - of the algorithm, and compare their run time analytically. The message passing version of the algorithm is implemented and the experiments are performed to display the accuracy and the limitations of the predicted performance analysis.
2331504
Centroidal Voronoi Tessellation-Based Reduced-Order Modeling of Complex Systems
\noindent A reduced-order modeling methodology based on centroidal Voronoi tessellations (CVTs) is introduced. CVTs are special Voronoi tessellations for which the generators of the Voronoi diagram are also the centers of mass (means) of the corresponding Voronoi cells. For discrete data sets, CVTs are closely related to the h-means and k-means clustering techniques. A discussion of reduced-order modeling for complex systems such as fluid flows is given to provide a context for the application of reduced-order bases. Then, detailed descriptions of CVT-based reduced-order bases and how they can be constructed from snapshot sets and how they can be applied to the low-cost simulation of complex systems are given. Subsequently, some concrete incompressible flow examples are used to illustrate the construction and use of CVT-based reduced-order bases. The CVT-based reduced-order modeling methodology is shown to be effective for these examples.