Dynamic disturbance rejection controllers for neutral time delay systems with application to a central heating system

In the present paper the problem of disturbance rejection of single input-single output neutral time delay systems with multiple measurable disturbances is solved via dynamic controllers. In particular, the general form of the controller matrices is presented, while the necessary and sufficient conditions for the controller to be realizable are offered. The proposed technique is applied to a test case neutral time delay central heating system. In particular, the nonlinear model of the plant and its linearized approximation are presented. Based on the linearized model, a two-stage controller is designed in order to regulate the room temperature and the boiler effluent temperature. The performance of the closed loop system is investigated through computational experiments.     

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...     

Guiding Attention by Cooperative Cues

A common assumption in visual attention is based on the rationale of ＂limited capacity of information processing＂. From this view point there is little consideration of how different information channels or modules are cooperating because cells in processing stages are forced to compete for the limited resource. To examine the mechanism behind the cooperative behavior of information channels, a computational model of selective attention is implemented based on two hypotheses. Unlike the traditional view of visual attention, the cooperative behavior is assumed to be a dynamic integration process between the bottom-up and top-down information. Furthermore, top-down information is assumed to provide a contextual cue during selection process and to guide the attentional allocation among many bottom-up candidates. The result from a series of simulation with still and video images showed some interesting properties that could not be explained by the competitive aspect of selective attention alone.     

Ubiquitous Mining with Interactive Data Mining Agents

Due to the increasing availability and sophistication of data recording techniques, multiple information sources and distributed computing are becoming the important trends of modern information systems. Many applications such as security informatics and social computing require a ubiquitous data analysis platform so that decisions can be made rapidly under distributed and dynamic system environments. Although data mining has now been popularly used to achieve such goals, building a data mining system is, however, a nontrivial task, which may require a complete understanding on numerous data mining techniques as well as solid programming skills. Employing agent techniques for data analysis thus becomes increasingly important, especially for users not familiar with engineering and computational sciences, to implement an effective ubiquitous mining platform. Such data mining agents should, in practice, be intelligent, complete, and compact. In this paper, we present an interactive data mining agent — OIDM (online interactive data mining), which provides three categories (classification, association analysis, and clustering) of data mining tools, and interacts with the user to facilitate the mining process. The interactive mining is accomplished through interviewing the user about the data mining task to gain efficient and intelligent data mining control. OIDM can help users find appropriate mining algorithms, refine and compare the mining process, and finally achieve the best mining results. Such interactive data mining agent techniques provide alternative solutions to rapidly deploy data mining techniques to broader areas of data intelligence and knowledge informatics.     

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.     

H-Trust: A Group Trust Management System for Peer-to-Peer Desktop Grid

Peer-to-Peer Desktop Grid (P2PDG) has emerged as a pervasive cyber-infrastructure tackling many large-scale applications with high impacts. As a burgeoning research area, P2PDG can support numerous applications, including scientific computing, file sharing, web services, and virtual organization for collaborative activities and projects. To handle trustworthiness issues of these services, trust and reputation schemes are proposed to establish trust among peers in P2PDG. In this paper, we propose a robust group trust management system, called H-Trust, inspired by the H-index aggregation technique. Leveraging the robustness of the H-index algorithm under incomplete and uncertain circumstances, H-Trust offers a robust personalized reputation evaluation mechanism for both individual and group trusts with minimal communication and computation overheads. We present the H-Trust scheme in five phases, including trust recording, local trust evaluation, trust query phase, spatial-temporal update phase, and group reputation evaluation phases. The rationale for its design, the analysis of the algorithm are further investigated. To validate the performance of H-Trust scheme, we designed the H-Trust simulator HTrust-Sim to conduct multi-agent-based simulations. Simulation results demonstrate that H-Trust is robust and can identify and isolate malicious peers in large scale systems even when a large portion of peers are malicious.     

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.