17910425
TMO-structured distributed location information system prototype
To realize location-based services, it is essential to handle the extreme situation that must cope with a very large volume, at least millions, of moving items. In this paper, we describe a location information system prototype of GALIS, which is a cluster-based scalable distributed computing system architecture which consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone. The proposed system contains all of the major computing nodes of GALIS architecture and is developed as a middleware on top of commercial main-memory database engines and spatial database engines, for short-term data and long-term data processing, respectively. To show the usefulness of our system, some experimental results showing clear advantages of distributed computing are also explained.
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
13472281
Bending and Stretching an Elastic Strip Around a Narrow Cylindrical Drum
An analysis is made of the deflected forms assumed by an elastic strip when it is bent and stretched around a rigid drum. A summary is first given of the method of analysis used and the results obtained in a previous study where the drum width is equal to or greater than that of the strip. This work is then extended to the case where the strip width exceeds that of the drum. Deflected forms and contact regions are delineated for a strip-width/drum-width ratio of two and for various values of two parameters: anticlastic deformation and tension.
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.
11785144
Scheduling Algorithm for Minimizing Context Switches of Periodic and Bounded Predictable Tasks
21234984
A distributed utility max-min flow control algorithm
A fair allocation of utility (application-layer performance) is essential in providing QoS (Quality of Service) guarantee. However, there have been few researches in the literature of utility-fair network resource allocation scheme. In this paper, we propose a distributed utility max-min flow control algorithm which accommodates application diversity in that it does not require the concavity of utility functions, and is scalable in that it does not require any per-flow operation in the network. The algorithm is proved to be convergent under the assumption that there exists a single bottleneck link and the communication delay between any two links in the network is bounded. Although the convergence of the algorithm is analyzed only for the case of a single bottleneck link, we show through simulations that the proposed algorithm works as designed for the case of multiple bottleneck links as well.
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.