16266978
Ontology Reconciliation for Service-Oriented Computing
Service-oriented computing (SOC) is viewed as the computing paradigm of the near future, allowing for the dynamic interaction of services provided by distributed business partners. Being a declarative knowledge representation model, ontologies serve as a foundation for SOC. Due to the heterogeneous nature of independently designed ontologies, it is problematic for partners to understand the concepts adopted in ontologies from other sources. In order for partners to achieve seamless collaboration of services, they need to reconcile their ontologies with each other. During the alignment process and the following service interactions, compatibility is an important measurement that has been neglected in most research work. We extend a vector system to encode ontology compatibility. In addition, we present a new model - probabilistic center ontology - for better recording and maintenance of ontology alignment results. Our precise and efficient approach is verified by both theoretic proofs and experimental results
14986573
Sharing ontology schema information for Web service integration
In spite of many standards efforts, Web services with similar or compatible functionalities often have heterogeneous semantics. One reason is the disparate ontologies used for service descriptions. In order to compare and compose Web services, the ability to merge different ontologies is essential. This paper describes an approach to align numerous, independently designed ontologies. Our approach is a completely automated one, without the need for prior agreement on semantics. It incorporates WordNet and heuristic reasoning and infers new knowledge by self-learning. Our system provides a solid base for the seamless integration of Web services.
8925570
Auction-Based Spectrum Sharing
We study auction mechanisms for sharing spectrum among a group of users, subject to a constraint on the interference temperature at a measurement point. The users access the channel using spread spectrum signaling and so interfere with each other. Each user receives a utility that is a function of the received signal-to-interference plus noise ratio. We propose two auction mechanisms for allocating the received power. The first is an auction in which users are charged for received SINR, which, when combined with logarithmic utilities, leads to a weighted max-min fair SINR allocation. The second is an auction in which users are charged for power, which maximizes the total utility when the bandwidth is large enough and the receivers are co-located. Both auction mechanisms are shown to be socially optimal for a limiting “large system” with co-located receivers, where bandwidth, power and the number of users are increased in fixed proportion. We also formulate an iterative and distributed bid updating algorithm, and specify conditions under which this algorithm converges globally to the Nash equilibrium of the auction.
6334357
An energy-conserved on-demand data broadcasting system
We propose in this paper an energy-conserved on-demand data broadcasting system by employing the data indexing technique. We also propose algorithm AIDOA to adjust the degree of buckets according to system workload. Experimental results show that algorithm AIDOA is able to greatly reduce power consumption at the cost of slight increment in average access time and adjust the index and data organization dynamically to adapt to change of system workload.
16728359
TRAC: toward recency and consistency reporting in a database with distributed data sources
Distributed computing environments, including workflows in computational grids, present challenges for monitoring, as the state of the system may be captured only in logs distributed throughout the system. One approach to monitoring such systems is to "sniff" these distributed logs and to store their transformed content in a DBMS. This centralizes the state and exposes it for querying; unfortunately, it also creates uncertainty with respect to the recency and consistency of the data. Previous related work has focused on allowing queries to express currency and consistency constraints, which are then enforced by "pulling" data from the distributed sources on demand, or by requiring synchronous updates of a centralized data store. In some instances this is impossible due to legacy system issues or inefficient as the system scales to large numbers of processors. Accordingly, we propose that instead of enforcing consistency and recency, such monitoring systems should report these properties along with query results, with the hope that this will allow the data to be appropriately interpreted. We present techniques for reporting consistency and recency for queries and evaluate them with respect to efficiency and precision. Finally, we describe our prototype implementation and present experimental results of our techniques.
15852893
The swisshouse: an inhabitable interface for connecting nations
We present the Swisshouse, a novel type of "inhabitable interface" that supports direct and indirect communication and cultural awareness of habitants in different nations. The Swisshouse allows unsophisticated users to collaborate and be aware of each other over distance. By carefully sculpting the space and choreographing interactive elements in the space, the Swisshouse allows users to instantly separate, combine, and customize environments for specific collaborative activities. By providing visual representations of remote users and places, the Swisshouse provides awareness of the culture, presence and identities of virtual participants. And by tagging physical users with RFID tags, the Swisshouse makes participants aware of the social interaction occurring in the physical space. The combination of these primitives provides a single consistent inhabitable interface that integrates architectural and user interface design thinking, hardware and software design. To illustrate the power of this convergent approach, we describe several examples of real-life applications including a remote lecture, a brainstorming session, a business meeting, and an exhibition.
21658897
A QoS-aware transcoding proxy using on-demand data broadcasting
The high diversity in the capabilities of various mobile devices such as display capabilities and computation power makes the design of mobile information systems more challenging. A transcoding proxy is placed between a client and an information server to coordinate the mismatch between what the server provides and what the client prefers. However, most research works in transcoding proxies in mobile computing environments are under the traditional client-server architecture and do not employ the data broadcast technique which is has been deemed a promising technique to design a power conservation, high scalable and high band-width utilization. In addition, the issue of QoS provision is also not addressed. In view of this, we design in this paper a QoS-aware transcoding proxy by utilizing the on-demand broadcasting technique. We first propose a QoS-aware transcoding proxy architecture, abbreviated as QTP, and model it as a queueing network. By analyzing the queueing network, several theoretical results are derived. We then propose a version decision policy and a service admission control scheme to provide QoS in QTP. The derived results are used to guide the execution of the proposed version decision policy and service admission control scheme to achieve the given QoS requirement. To measure the performance of QTP, several experiments are conducted. Experimental results show that the proposed scheme is more scalable than traditional client-server systems. In addition, the proposed scheme is able to effectively control the system load to attain the desired QoS