15046055
Transform from Models to Service Description Based on MDA
Within MDA framework, system models can be built up on an abstract level that is independent from the platform. Later on, this abstract model can be transmitted into service description, which is related to specific platform on the implementation level. In Web services applications, this transition has a great advantage. Because, while the model of implementation changes from one case to another to fit the different platforms, the model of whole system, on a higher abstract level, stays the same. Thus, the efficiency is promoted. This paper firstly discusses the extension of UML for Web services, and then it presents the modeling process of WSDL. Finally, it gives the rules and arithmetic of transition from models to WSDL documents in detail
28131114
Utilizing Fuzzy Petri Net for Choreography Based Semantic Web Services Discovery
Semantic Web Services have received great popularity these days for their capability of providing more automatic web services discoveries and compositions. However, the issue of behavior compatibility is still not properly solved. In this paper, we propose a choreography-based formal approach to discover semantic web services that are compatible with their behaviors. The fuzzy petri net is used to perform the modeling, verification, analysis and evaluation for the matchmaking of semantic web services. The requested and provided services are modeled by two fuzzy petri nets combined through a set of combination rules. By analyzing the composite fuzzy petri net, the behavior compatibility can be verified, and the matching degree between requested and provided services can be obtained. With our approach, the success rate and accuracy of the semantic web services discoveries can be improved, and the final services set can be optimized.
17737533
Semantic Matching of Web Services Based on Choreographies
Web services facilitate the efficient execution of B2B e-commerce by integrating business processes over the Internet, which needs dynamic and flexible binding of services. However, current Web service standards do not support it. A formal approach for semantic matching of service specifications based on choreographies, i.e., the behavior of Web services, is developed in this paper. It can accurately and automatically discover required services for integrating business processes. Firstly an extended deterministic finite state automaton (EDFA) is proposed by labeling state transitions using binary-tuples (input, output) rather than letters. The automata describe Web services in a more accurate way: the nodes represent states maintained by services; the state transitions represent communication activities of services. The automata depict the temporal sequences of communication activities that describe the behaviors of services. Further, the intersection of two EDFAs is defined. Finally, an algorithm for testing the emptiness of the languages accepted by EDFAs is presented and used to evaluate the compatibility of Web services
20441735
Web Services Discovery with Rough Sets
Web services are emerging as a major technology for building service-oriented distributed systems. Potentially, various resources on the Internet can be virtualized as Web services for a wider use by their communities. Service discovery becomes an issue of vital importance for Web services applications. This article presents ROSSE, a Rough Sets based Search Engine for Web service discovery. One salient feature of ROSSE lies in its capability to deal with uncertainty of service properties when matching services. A use case is presented to demonstrate the use of ROSSE for discovery of car services. ROSSE is evaluated in terms of its accuracy and efficiency in service discovery.
30182996
Requirements Engineering Processes Improvement: A Systematic View
Requirement is the foundation for both software development and project management activities, so an effective requirements process which has a potential influence on the quality of the final software product must be committed by all stakeholders. However current process improvement maturity models pay little attention to requirements engineering process and they are “black-box test” for organizations’ competence. It is the precondition for our research to understand the fundamental issues and to identify the characteristic that requirement process possessed. We suggest a systematic view for requirement process improvement that includes measurement-based improvement for activities, methods, peoples as “white-box test”, emphasizing the people factor, such as communication and collaboration, etc. Our future work will involve structuring the platform or tools which integrate methods, technologies, checklists, templates, lessons-learned, and providing basic supporting for requirements process improvement and distributed requirements development and management.
18279965
Information in the Nonstationary Case
Information estimates such as the direct method of Strong, Koberle, de Ruyter van Steveninck, and Bialek (1998) sidestep the difficult problem of estimating the joint distribution of response and stimulus by instead estimating the difference between the marginal and conditional entropies of the response. While this is an effective estimation strategy, it tempts the practitioner to ignore the role of the stimulus and the meaning of mutual information. We show here that as the number of trials increases indefinitely, the direct (or plug-in) estimate of marginal entropy converges (with probability 1) to the entropy of the time-averaged conditional distribution of the response, and the direct estimate of the conditional entropy converges to the time-averaged entropy of the conditional distribution of the response. Under joint stationarity and ergodicity of the response and stimulus, the difference of these quantities converges to the mutual information. When the stimulus is deterministic or nonstationary the direct estimate of information no longer estimates mutual information, which is no longer meaningful, but it remains a measure of variability of the response distribution across time.
35646601
Iterated logarithmic expansions of the pathwise code lengths for exponential families
Rissanen's (1978, 1986, 1989, 1996) minimum description length (MDL) principle is a statistical modeling principle motivated by coding theory. For exponential families we obtain pathwise expansions, to the constant order, of the predictive and mixture codelengths used in MDL. The results are useful for understanding different MDL forms.
16993770
Service matchmaking with rough sets
With the wide adoption of open grid services architecture (OGSA) and Web services resource framework (WSRF), the grid is emerging as a service-oriented computing infrastructure for engineers and scientists to solve data and computationally intensive problems. It is envisioned that computing resources in a future grid environment will be exposed as services. Service discovery becomes an issue of vital importance for a wider uptake of the grid. This paper presents RSSM, a rough sets based service matchmaking algorithm for service discovery with an aim to tolerate uncertainty in identifying service properties. The evaluation results show that the RSSM algorithm is more effective in service discovery compared with other mechanisms such as UDDI and OWLS.