Bin Li

An Adaptive Agent Coordination Framework for Web Services Composition

Web service composition is an important technology for agile inter-enterprise application integration. Centric composition engines are widely adopted to enact composite services in many Web service composition research projects. Such a centralized architecture, however, results in problem of scalability, message exchange efficiency, autonomy and adaptation. To deal with the problems discussed above, an adaptive agent coordination framework for service composition is proposed in this paper. Firstly, an agent-based framework for Web services composition is presented. Next, agent model and agent conversation are proposed. Finally, an algorithm of process partition is introduced and the adaptation of service composition is discussed. Simulation results indicate that this framework can support highly concurrent requests and large volume of data more effectively than traditional architecture, so it is helpful to improve the scalability of composite services.

An Automated Trust Negotiation Framework Based on Subjective Trust Model

In open and dynamic systems, interaction between participants suffers the problem of determining one anothers trustworthiness. Automated trust negotiation is a process of establishing trust step by step between participants through the bilateral exchange of credentials and policies. However, due to the lack of credentials, negotiation is prone to fail. This paper presents an ATN framework based on subjective trust model. Representation of subjective trust in access control policies and negotiation processes of different negotiation strategies based on trust model are discussed and analyzed. Meanwhile, it presents the trust model FIRE . With the matrix representation of interaction history, it increases evaluation information effectively. It also gives out the complete method of evaluating trust.

The Research and Implematation of Services Discovery Agent in Web Services Composition Framework

Web services are emerging as a dominant paradigm for constructing and composing distributed business applications and enabling enterprise-wide interoperability. A critical factor to the overall utility of web services composition is a flexible services discovery mechanism. The goal of this paper is to propose an agent-based approach to web services discovery. Firstly, an agent-based framework for web services composition is presented. Next, web services QoS model and description are introduced and an algorithm of selecting services from the perspective of composition is given. Finally, web services discovery agent is designed and its implementation based on JADE platform is presented in detail.

L1-Norm Sparse Learning and its Application

The need on finding sparse representations has attracted more and more people to research it. Researchers have developed many approaches (such as nonnegative constraint, l1-norm sparsity regularization and sparse Bayesian learning with independent Gaussian prior) for encouraging sparse solutions and established some conditions under which the feasible solutions could be found by those approaches. This paper commbined the L1-norm regularization and bayesian learning, called L1-norm sparse bayesian learning, which was inspired by RVM (relative vector machine). L1-norm sparse bayesian learning has found its applications in many fields such as MCR (multivariate curve resolution) and so on. We proposed a new method called BSMCR (bayesian sparse MCR) to enhance the quality of resolve result.

A rulespaces for Semantic Web services based on tuplespace and SWRL

Coordination is a vital aspect of any type of interaction between computer agents in open distributed systems such as the Web. As distributed systems become more ubiquitous, autonomous and complex, the need to ground them on common data model grows stronger. In particular, semantic Web services are based on synchronous message exchange, thus being incompatible with the REST architectural model of the (semantic) Web. Recent advances in middleware technologies propose semantic aware tuplespaces as an infrastructure for coping with these issues. However, all of the existing related works do not support rule in their extensions of tuplespace. This paper presents a RuleSpaces based on a combination of tuplespace computing and semantic Web rule language. We describe overview of the conceptual model and discuss the necessary extensions to the original tuplespace. An initial version of the RuleSpaces prototype system has been implemented.

Simultaneous Determination of Pb2+ and Co2+ Based on Fluorescence Quenching of Bi-Color Quantum Dots with the Aid of Multivariate Calibration Techniques

Simultaneous determination of Pb2+ and Co2+ without separation has been successfully achieved by a bicolor quantumn dots mixture. This method takes advantage of the different degrees of the fluorescence quenching effects of Pb2+ and Co2+ to the bio-color quantum dots. Chemometrical approaches were applied to assist the discrimination and detection process. The construction of the multivariate calibration models, based on partial least squares (PLS), orthogonal projections to latent structures least squares (O-PLS) and kenel based orthogonal projections to latent structures (K-OPLS), allowed the simultaneous determination of Pb2+ (in the concentration range of 0-120 mM) and Co2+ (0-300 mM). The optimal number of factors in PLS and the optimal number of orthogonal components in O-PLS and K-OPLS were carefully selected. A comparison of prediction performances between these results was performed by relative prediction errors, square of the correlation coefficient and root mean squares error of prediction.

Towards a communication and coordination infrastructure for open and dynamic distributed systems

The coordination between agents will be vital for ensuring the success of their interactions in open and dynamic distributed systems. Tuplespace offers a coordination model for communication between autonomous entities. However, in a heterogeneous environment, agents must be able to exchange information with some assurance that they have a common meaning, this can pose some limitations. In this paper we introduce semantic tuplespaces (STS) based on a combination of semantic Web technologies and tuplespace computing. It acts as a middleware to enable communication and coordination based on the principle of publish and retrieve of semantic information.

A Tuplespace-Based Middleware for Semantic Web Services Using SWRL

Coordination is a vital aspect of any type of interaction between computer agents in open distributed systems such as the Web. As distributed systems become more ubiquitous, autonomous and complex, the need to ground them on common data model grows stronger. In particular, Semantic Web services are based on synchronous message exchange, thus being incompatible with the REST architectural model of the (Semantic) Web. Recent advances in middleware technologies propose semantic aware tuplespaces as an infrastructure for coping with these issues. However, all of the existing related works do not support rule in their extensions of tuplespace. This paper presents a RuleSpaces based on a combination of tuplespace computing and Semantic Web Rule Language. We describe overview of the conceptual model and discuss the necessary extensions to the original tuplespace. An initial version of the RuleSpaces prototype system has been implemented.