In today's web, more and more software and applications are wrapped as services. However interactions between services are not always perfectly completed because of mismatches among them. Service mediation and ada...
详细信息
In today's web, more and more software and applications are wrapped as services. However interactions between services are not always perfectly completed because of mismatches among them. Service mediation and adaptation problems obtain increasingly concerns. In this paper, we propose an extension of interface automata, labelled interface automata, to illustrate mismatching services and adaptation. We characterize the problem by classifying different kinds of adaptation scenarios. Then we focus on how to use labelled interface automata to illustrate the building of adaption service between mismatching services.
We present in this paper a supervised topic model for multi-class classification problems. To incorporate supervisory information, we jointly model documents and their labels in a graphical model called LogisticLDA, w...
详细信息
keyphrases extracted from articles are beneficial in helping people boost browsing speed, but unfortunately keyphrases are rarely available for news articles due to the high expense of labor and time for manual annota...
详细信息
The Adomian decomposition method （ADM） and Pade approximants are combined to solve the well-known Blaszak-Marciniak lattice, which has rich mathematical structures and many important applications in physics and math...
详细信息
The Adomian decomposition method （ADM） and Pade approximants are combined to solve the well-known Blaszak-Marciniak lattice, which has rich mathematical structures and many important applications in physics and mathematics. In some cases, the truncated series solution of ADM is adequate only in a small region when the exact solution is not reached. To overcome the drawback, the Pade approximants, which have the advantage in turning the polynomials approximation into a rational function, are applied to the series solution to improve the accuracy and enlarge the convergence domain. By using the ADM-Pade technique, the soliton solutions of the Blaszak-Marciniak lattice are constructed with better accuracy and better convergence than by using the ADM alone. Numerical and figurative illustrations show that it is a promising tool for solving nonlinear problems.
Nowadays complex information system's integrated formal models of function verification and performance evaluation lack properties constraint about space aspect. This paper presents an integrated verification mode...
详细信息
Nowadays complex information system's integrated formal models of function verification and performance evaluation lack properties constraint about space aspect. This paper presents an integrated verification model atsFPM by defining a space requirement function over the states of the considered information system. The patterns of paths which are based on regular expressions is proposed in order to specify the functional specifications. The syntax and semantic of the model atsFPM is defined. A conversion product model is obtained by the combination of the system model and the automaton of the pattern of paths which expresses the functional specifications. The verification of the model atsFPM is tackled by the performance verification technique of Markov Reward Model. Experimental results show that the atsFPM model and its verification approach can satisfy the modeling of information system and verification of functional and performance specifications.
One of the most promising advantages of Web service technology is the possibility of creating value-added services by combining existing ones. A major challenge is how to discover and select concrete service according...
详细信息
One of the most promising advantages of Web service technology is the possibility of creating value-added services by combining existing ones. A major challenge is how to discover and select concrete service according to user requirements. This paper addresses the topic of service discovery composite Web services. The main feature is that we take the process model as well as service profile into account. Firstly, the process models of Web services are translated into Petri nets. Based on this, we propose a service matchmaking algorithm, via comparing the functionality compatibility and process consistency, thus leading to more accurate matchmaking.
By means of the generalized direct method,a relationship is constructed between the new solutions andthe old ones of the (3+1)-dimensional breaking soliton *** on the relationship,a new solution is obtainedby using a ...
详细信息
By means of the generalized direct method,a relationship is constructed between the new solutions andthe old ones of the (3+1)-dimensional breaking soliton *** on the relationship,a new solution is obtainedby using a given solution of the *** symmetry is also obtained for the (3+1)-dimensional breaking *** using the equivalent vector of the symmetry,we construct a seven-dimensional symmetry algebra and getthe optimal system of group-invariant *** every case of the optimal system,the (3+1)-dimensional breakingsoliton equation is reduced and some solutions to the reduced equations are ***,some new explicitsolutions are found for the (3+1)-dimensional breaking soliton equation.
Painleve property of the （2＋1）-dimensional multi-component Broer-Kaup （BK） system is considered by using the standard Weiss Kruskal approaches. Applying the Clarkson and Kruskal （CK） direct method to the （2＋1...
详细信息
Painleve property of the （2＋1）-dimensional multi-component Broer-Kaup （BK） system is considered by using the standard Weiss Kruskal approaches. Applying the Clarkson and Kruskal （CK） direct method to the （2＋1）- dimensional multi-component BK system, some types of similarity reductions are obtained. By solving the reductions, one can get the solutions of the （2＋1）-dimensional multi-component BK system.
Web service has emerged as a new solution for enterprise application integration. Automatic service composite algorithm is to build a composite service for user's request or complex business requirement. Most form...
详细信息
In this paper, we present the parallel implementation of the traffic microsimulation PMTS (Parallel Microscopic Traffic Simulation) focusing on the performance issues. The parallelization of PMTS is domain decompositi...
详细信息
ISBN:
(纸本)9781427629807
In this paper, we present the parallel implementation of the traffic microsimulation PMTS (Parallel Microscopic Traffic Simulation) focusing on the performance issues. The parallelization of PMTS is domain decomposition, which means that each processor of the PC cluster is responsible for a different geographical area of the simulation region. We describe the transportation network graph partition and information exchange between domains. We demonstrate the time cost mathematics models for PMTS: the vehicle generation, vehicle position calculation, and vehicle information exchange between domains. The workload balance is obtained by adjusting the boundary lines according to the relative load of adjacent subnetworks. All these works have been proved to be effective when PMTS put into use and the experiment results are also provided which match our analysis.
暂无评论