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.
19085830
An analysis of multiple-class vacation queues with individual thresholds
This study examines a multiple-class M/G/1 queue with multiple thresholds. Each class of customer arrives according to an independent Poisson process, and each class has its own threshold. The idle server is reactivated as soon as any one of the thresholds is reached. Both FCFS and non-preemptive priority cases are considered. The Laplace-Stieltjes transform of the waiting time distribution function and the mean waiting time for each class of customers are derived.
30313812
A flexible agent system for change adaptation in supply chains
The importance of supply chain management is increasing with globalization and the advancement of electronic business. Supply chains are dynamic due to frequent changes in suppliers, customers, and products. However, information systems for supply chains are not flexible enough to adapt to the changes, requiring high cost and time for re-implementation and re-customization. This paper suggests a flexible agent system for supply chains that can adapt to the changes in transactions introduced by new products or new trading partners. The flexible agent system consists of an interpretable conversation policy model, a procedure for exchanging new conversation policies, and a mechanism for actual transactions with newly acquired conversation policies. By using the flexible agent system, formation of supply chains becomes more robust to the dynamic changes. To show how the approach can be realized, a PC supply chain application is illustrated with a prototype agent platform.
7244802
Design, implementation and testing of an interactive video retrieval system
In this paper we present and discuss the system we developed for the search task of the TRECVID 2002, and its evaluation in an interactive search task. To do this we will look at the strategy we used in designing the system, and we discuss and evaluate the experiments used to determine the value and effectiveness of one system incorporating both feature evidence and transcript retrieval compared to a transcript-only retrieval system. Both systems tested are built on the foundation of the Físchlár System developed and running for a number of years at the CDVP. The system is fully MPEG-7 compliant and uses XML for exchange of information within the overall architecture.
3053834
Evidence for growth of microbial genomes by short segmental duplications
Textual analysis of microbial genomes reveals footprints of their early evolution of the genomes. It is shown that distributions frequency occurrence of words less than nine letters in genomes have widths that are many times those of Poisson distributions. This phenomenon suggests a simple biologically plausible model for the growth of genomes: the genome first grows randomly to an initial length of approximately one thousand nucleotides (1 kb), or about one thousandth of its final length, thereafter mainly grows by random short segmental duplication. We show that using duplicated segments averaging around 25 b, model sequences generated in this model possess statistical properties characteristic of present day genomes. Both the initial length and the duplicated segment length support an RNA world at the time duplication began.
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
671835
Algorithm for Reducing the Complexity of Switching Time in Real-Time Multitask Environments