AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee

How to compose existing web services automatically and to guarantee the correctness of the design(e.g. freeness of deadlock and unspecified reception,and temporal constraints) is an important and challenging problem in web services. Most existing approaches require a detailed specification of the desired behaviors of a composite service beforehand and then perform certain formal verification to guarantee the correctness of the design,which makes the composition process both complex and time-consuming. In th...     

Web-based visualization of spatial objects in 3DGIS

Adaptive rendering large and complex spatial data has become an important research issue in a 3DGIS application. In order to transmit the data to the client efficiently,this paper proposes a node-layer data model to manage the 3D scene. Because the large spatial data and limited network bandwidth are the main bottlenecks of web-based 3DGIS,a client/server architecture including progressive transmission methods and multiresolution representations,together with the spatial index,are developed to improve the p...     

Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode

The majority of existing escrowable identity-based key agreement protocols only provide partial forward secrecy. Such protocols are, arguably, not suitable for many real-word applications, as the latter tends to require a stronger sense of forward secrecy—perfect forward secrecy. In this paper, we propose an efficient perfect forward-secure identity-based key agreement protocol in the escrow mode. We prove the security of our protocol in the random oracle model, assuming the intractability of the Gap Biline...     

Logic Programs,Compatibility and Forward Chaining Construction

Logic programming under the stable model semantics is proposed as a non-monotonic language for knowledge representation and reasoning in artificial intelligence. In this paper, we explore and extend the notion of compatibility and the Λ operator, which were first proposed by Zhang to characterize default theories. First, we present a new characterization of stable models of a logic program and show that an extended notion of compatibility can characterize stable submodels. We further propose the notion of weak auto-compatibility which characterizes the Normal Forward Chaining Construction proposed by Marek, Nerode and Remmel. Previously, this construction was only known to construct the stable models of FC-normal logic programs, which turn out to be a proper subclass of weakly auto-compatible logic programs. We investigate the properties and complexity issues for weakly auto-compatible logic programs and compare them with some subclasses of logic programs.     

A backstepping controller for path‐tracking of an underactuated autonomous airship

In this paper we propose a nonlinear control approach for the path‐tracking of an autonomous underactuated airship. A backstepping controller is designed from the airship nonlinear dynamic model including wind disturbances, and further enhanced to consider actuators saturation. Control implementation issues related to airship underactuation are also addressed, namely control allocation and an attitude reference shaping to obtain a faster error correction with smoother input requests. The results obtained demonstrate the capacity of an underactuated unmanned airship to execute a realistic mission including vertical take‐off and landing, stabilization and path‐tracking, in the presence of wind disturbances, with a single robust control law. Copyright © 2008 John Wiley & Sons, Ltd.     

Dynamic Clustering of Interval-Valued Data Based on Adaptive Quadratic Distances

This paper presents partitioning dynamic clustering methods for interval-valued data based on suitable adaptive quadratic distances. These methods furnish a partition and a prototype for each cluster by optimizing an adequacy criterion that measures the fitting between the clusters and their representatives. These adaptive quadratic distances change at each algorithm iteration and can either be the same for all clusters or different from one cluster to another. Moreover, various tools for the partition and cluster interpretation of interval-valued data are also presented. Experiments with real and synthetic interval-valued data sets show the usefulness of these adaptive clustering methods and the merit of the partition and cluster interpretation tools.     

The Influence of the Internet on European Journalism

This study investigates how European journalists evaluate the changes that have occurred in their profession since the Internet has been integrated in newsrooms. How do journalists perceive the features and innovations associated with the Internet? What are the principal changes in the profession? Do practitioners believe that the quality of journalism has been raised or lowered? To answer to these research questions, we carried out a survey across 11 European countries–Cyprus, Estonia, Finland, Greece, Ireland, Italy, Lithuania, United Kingdom, Slovenia, Spain, Sweden–of 239 journalists, working for 40 of the most‐read print/online news outlets in these countries. The survey shows that the opportunity to use the Internet to reinforce the social functions of journalism has not been fully recognised.     

Pattern discovery and change detection of online music query streams

Mining of music data is one of the most important problems in multimedia data mining. In this paper, two research issues of mining music data, i.e., online mining of music query streams and change detection of music query streams, are discussed. First, we proposed an efficient online algorithm, FTP-stream (Frequent Temporal Pattern mining of streams), to mine all frequent melody structures over sliding windows of music melody sequence streams. An effective bit-sequence representation is used in the proposed algorithm to reduce the time and memory needed to slide the windows. An effective list structure is developed in the FTP-stream algorithm to overcome the performance bottleneck of 2-candidate generation. Experiments show that the proposed algorithm FTP-stream only needs a half of memory requirement of original melody sequence data, and just scans the music query stream once. After mining frequent melody structures, we developed a simple online algorithm, MQS-change (changes of Music Query Streams), to detect the changes of frequent melody structures in current user-centered music query streams. Two music melody structures (set of chord-sets and string of chord-sets) are maintained and four melody structure changes (positive burst, negative burst, increasing change and decreasing change) are monitored in a new summary data structure, MSC-list (a list of Music Structure Changes). Experiments show that the MQS-change algorithm is an effective online method to detect the changes of music melody structures over continuous music query streams.

From MPEG-7 user interaction tools to hanging basket models: bridging the gap

The content–user gap is the difference between the limited range of content-relevant preferences that may be expressed using the MPEG-7 user interaction tools and the much wider range of metadata that may be represented using the MPEG-7 content tools. One approach for closing this gap is to make the user and content metadata isomorphic by using the existing MPEG-7 content tools to represent user (as well as content) metadata (Agius and Angelides 2006, 2007). Subsequently, user preferences may be specified for all content, without omission. Since there is a wealth of user preference and history metadata within the MPEG-7 user interaction tools that can usefully complement these specific content preferences, in this paper we develop a method by which all user and content metadata may be bridged.