11785144
Scheduling Algorithm for Minimizing Context Switches of Periodic and Bounded Predictable Tasks
46464172
Metrics Comparison for Java Programs Using a Software Tool
37964793
Object-Oriented Design and Implementation of the OE-Scheduler in Real Time Environments
671835
Algorithm for Reducing the Complexity of Switching Time in Real-Time Multitask Environments
5325970
Nearly Dynamic Task Model Scheduling with Aperiodic Tasks
9287561
A Noninformative Prior for Neural Networks
While many implementations of Bayesian neural networks use large, complex hierarchical priors, in much of modern Bayesian statistics, noninformative (flat) priors are very common. This paper introduces a noninformative prior for feed-forward neural networks, describing several theoretical and practical advantages of this approach. In particular, a simpler prior allows for a simpler Markov chain Monte Carlo algorithm. Details of MCMC implementation are included.
10061799
SEEMLESS: distributed algorithm for topology control of survivable energy efficient multihop wireless sensor networks using adjustable transmission power
This paper suggests a distributed algorithm named (SEEMLESS) survivable energy efficient multihop wireless sensor networks which determines a transmission power level for each sensor in a wireless sensor network (WSN) with guaranteeing survivability of WSN topology and minimizing the energy consumption of each sensor. The SEEMLESS algorithm provides a mechanism to make WSN topology survivable by letting each sensor have two closest neighbors and by letting each cluster head have one additional neighbor.
18817570
Long-term location data management for distributed moving object databases
To handle the extreme situation that must manage positional information of a very large volume, at least millions, of moving objects, a cluster-based scalable distributed computing system architecture, called the GALIS, which consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone, was proposed. In this paper, we propose a valid time management and time-zone shifting scheme, which are essential in realizing the long-term location data subsystem of GALIS, but missed in our previous prototype development. We explain how to manage valid time of moving objects to avoid ambiguity of location information. We also describe time-zone shifting algorithm, with three variations, such as RT-TZS, B-TZS and TPB-TZS. Through experiments related with query processing time and CPU utilization, we show the efficiency of the proposed time-zone shifting schemes
586486
Object-Based Access to TV Rushes Video
Recent years have seen the development of different modalities for video retrieval. The most common of these are (1) to use text from speech recognition or closed captions, (2) to match keyframes using image retrieval techniques like colour and texture [6] and (3) to use semantic features like “indoor”, “outdoor” or “persons”. Of these, text-based retrieval is the most mature and useful, while image-based retrieval using low-level image features usually depends on matching keyframes rather than whole-shots. Automatic detection of video concepts is receiving much attention and as progress is made in this area we will see consequent impact on the quality of video retrieval. In practice it is the combination of these techniques which realises the most useful, and effective, video retrieval as shown by us repeatedly in TRECVid [5].
1174061
Combined QoS Scheduling and Call Admission Control Algorithm in Cellular Networks
In this paper, a scheduling problem in wireless networks is considered when there simultaneously exist CBR (constant bit rate) users requiring exact minimum average throughput guarantee and EMG (elastic with minimum guarantee) users requiring minimum average throughput guarantee and more if possible. By exploiting utility maximization problem without minimum throughput constraint and newly defined utility functions, we propose a combined scheduling and call admission control scheme that exactly guarantees the minimum requirements of CBR and EMG users and then allocates the leftover capacity to EMG users. In the proposed scheme, it is easy to give priority to particular users so that they are guaranteed their requirements prior to any other user. Moreover, the priority structure enables the proposed measurement-based call admission control algorithm to perform admission trial without affecting the minimum performance of existing users. We show through mathematical analysis and simulations that our scheme works as designed.