34408109
Modeling GIS Data Using OMEGA
46069080
A Graph-Theoretic Model for Optimizing Large Join Queries
9253270
Query Optimization in Multidatabase Systems Considering Schema Conflicts
In a multidatabase system, the participating databases are autonomous. The schemas of these databases may be different in various ways, while the same information is represented. A global query issued against the global database needs to be translated to a proper form before it can be executed in a local database. Since data requested by a query (or a part of a query) is sometimes available in multiple sites, the site (database) that processes the query with the least cost is the desired query processing site. The authors study the effect of differences in schemas on the cost of query processing in a multidatabase environment. They first classify schema conflicts to different types. For each type of conflict, they show how much more or less complex a translated query can become in comparison with the originally user-issued global query. Based on this observation, they propose an analytical method that considers the conflicts between local databases and finds the database(s) that renders the least execution cost in processing a global query. This research introduces a new level of query optimization (termed the schema-level optimization) in multidatabase environments. The results provide a new dimension of enhancement for the capability of a query optimizer in multidatabase systems.
18796888
Design and Performance Evaluation of Broadcast Algorithms for Time-Constrained Data Retrieval
We refer "time-constrained services" to those requests that have to be replied to within a certain client-expected time duration. If the answer cannot reach the client within this expected time, the value of the information may seriously degrade or even become useless. On-demand channels may not be able to handle all time-constrained services without degrading the performance. How to handle these services in broadcast channels becomes crucial to balance the load of wireless systems. In this paper, we study this problem and find the minimum number of broadcast channels required for such a task. Also, we propose solutions for this problem when the available channels are insufficient. Our performance result reveals that only a moderate number of channels is required to promote these time-constrained services
2862791
A data delivery strategy in ubiquitous computing systems
Browsing Web pages through wireless devices will become more and more popular in the near future. However, accessing a large chunk of Web data incurs a great amount of access latency while a mobile user migrates across cells. This paper investigates this problem and proposes an effective way of delivering such data to a mobile user in a ubiquitous computing system. Our data delivery (/spl Dscr//sup 2/) strategy is based on the dynamic programming skill needed to pre-assign the user-requested data on the possible cells to be visited in order to reduce the access latency. We first design an encoding method for the cells and then derive the properties of the encoding scheme. These properties are then used in our algorithm to deliver the data. Finally, experiments are conducted to demonstrate the feasibility and efficiency of the proposed method.
2051959
Performance Evaluation of Forwarding Strategies for Location Management in Mobile Networks
This paper presents a methodology for evaluating the performance of forwarding strategies for location management in a personal communication services (PCS) mobile network. A forwarding strategy in the PCS network can be implemented by two mechanisms: a forwarding operation which follows a chain of databases to locate a mobile user and a resetting operation which updates the databases in the chain so that the current location of a mobile user can be known directly without having to follow a chain of databases. In this paper, we consider the PCS network as a server whose function is to provide services to the mobile user for ‘updating the location of the user as the user moves across a database boundary’ and ‘locating the mobile user’. We use a Markov chain to describe the behavior of the mobile user and analyze the best time when forwarding and resetting should be performed in order to optimize the service rate of the PCS network. We demonstrate the applicability of our approach with hexagonal and mesh coverage models for the PCS network and provide a physical interpretation of the result.
6694048
The human infrastructure of cyberinfrastructure
Despite their rapid proliferation, there has been little examination of the coordination and social practices of cyberinfrastructure projects. We use the notion of "human infrastructure" to explore how human and organizational arrangements share properties with technological infrastructures. We conducted an 18-month ethnographic study of a large-scale distributed biomedical cyberinfrastructure project and discovered that human infrastructure is shaped by a combination of both new and traditional team and organizational structures. Our data calls into question a focus on distributed teams as the means for accomplishing distributed work and we argue for using human infrastructure as an alternative perspective for understanding how distributed collaboration is accomplished in big science.
206793088
A fuzzy ontology and its application to news summarization
In this paper, a fuzzy ontology and its application to news summarization are presented. The fuzzy ontology with fuzzy concepts is an extension of the domain ontology with crisp concepts. It is more suitable to describe the domain knowledge than domain ontology for solving the uncertainty reasoning problems. First, the domain ontology with various events of news is predefined by domain experts. The document preprocessing mechanism will generate the meaningful terms based on the news corpus and the Chinese news dictionary defined by the domain expert. Then, the meaningful terms will be classified according to the events of the news by the term classifier. The fuzzy inference mechanism will generate the membership degrees for each fuzzy concept of the fuzzy ontology. Every fuzzy concept has a set of membership degrees associated with various events of the domain ontology. In addition, a news agent based on the fuzzy ontology is also developed for news summarization. The news agent contains five modules, including a retrieval agent, a document preprocessing mechanism, a sentence path extractor, a sentence generator, and a sentence filter to perform news summarization. Furthermore, we construct an experimental website to test the proposed approach. The experimental results show that the news agent based on the fuzzy ontology can effectively operate for news summarization.
1626827
Augmenting kitchen appliances with a shared context using knowledge about daily events
Networked appliances might make them aware of each other, but interacting with a complex network can be difficult in itself. KitchenSense is a sensor rich networked kitchen research platform that uses Common Sense reasoning to simplify control interfaces and augment interaction. The system's sensor net attempts to interpret people's intentions to create fail-soft support for safe, efficient and aesthetic activity. By considering embedded sensor data together with daily-event knowledge, a centrally-controlled system can develop a shared context across various appliances. The system is a research platform that is used to evaluate augmented intelligent support of work scenarios in physical spaces.
32212919
Balancing loads on sonet rings with integer demand splitting
SONET Self Healing ring is one of the most intriguing schemes which provide survivability for telecommunication networks. To design a cost effective SONET ring it is necessary to consider load balancing problems by which the link capacity is determined. In this paper, we consider the load balancing problem in SONET ring when demand splitting is allowed only by integer. A bounded approximation to the optimal solution is presented and proved by employing the arc-demand matrix which represents the amount of demand routed on each arc. A very efficient algorithm is provided which always satisfies the optimality at termination. The algorithm iteratively decreases the maximum load by considering counter-clockwise routing of a demand which passes through the arc with maximum load. Justification of the algorithm is also provided.
42435746
Efficiently supporting hard/soft deadline transactions in real-time database systems
As in other application areas, there is an increasing need for managing a large amount of data in the real-time area. This need gave birth to a system called a real-time database system (RTDBS) that provides database operations with timing constraints. One typical timing constraint in an RTDBS is temporal consistency that states that a transaction must read temporally valid data objects. This requires the data objects to be updated repeatedly. This paper proposes three novel schemes that aim to minimize the number of updates of data objects needed for guaranteeing the temporal consistency requirements of transactions with hard-deadlines. The three guarantee schemes differ from each other in the amount of updates and the implementation complexity. This paper also gives a framework for integrating transactions with soft-deadlines into the three guarantee schemes.