8577812
Dynamic Self-Healing for Service Flows with Semantic Web Services
With an increasing complexity of business processes, self-healing capability is becoming an important issue in order to support robust service flow execution. In this paper, a dynamic self-healing mechanism is proposed, which can dynamically identify suitable alternatives and replace faulty services such that a service flow can be performed successfully despite of unexpected exceptions. This mechanism explicitly utilizes semantic Web services for service matching and selection of a composite service in business service flow, and Semantic Web services are equipped with rich business rules in a domain-dependent manner. We explore the self-healing mechanism for supporting self-healable service flow execution which is modeled in BPEL4WS. A demo system of self-healing capable service flow execution is built to validate its effectiveness by a concrete scenario, PC manufacturing application.
17947344
Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest
Peer-to-peer (P2P) networks establish loosely coupled application-level overlays on top of the Internet to facilitate efficient sharing of resources. They can be roughly classified as either structured or unstructured networks. Without stringent constraints over the network topology, unstructured P2P networks can be constructed very efficiently and are therefore considered suitable to the Internet environment. However, the random search strategies adopted by these networks usually perform poorly with a large network size. In this paper, we seek to enhance the search performance in unstructured P2P networks through exploiting users' common interest patterns captured within a probability-theoretic framework termed the user interest model (UIM). A search protocol and a routing table updating protocol are further proposed in order to expedite the search process through self organizing the P2P network into a small world. Both theoretical and experimental analyses are conducted and demonstrated the effectiveness and efficiency of our approach.
10592217
Design Wizards and Visual Programming Environments for GenVoca Generators
Domain-specific generators will increasingly rely on graphical languages for declarative specifications of target applications. Such languages will provide front-ends to generators and related tools to produce customized code on demand. Critical to the success of this approach will be domain-specific design wizards, tools that guide users in their selection of components for constructing particular applications. The authors present the P3 ContainerStore graphical language, its generator, and design wizard.
26667538
Research on Service Management Data Modeling Based on SID
In order to resolve problems related to information integration in service management system (SMS), this paper introduces Meta Object Facility (MOF) into SMS to propose the concept of universal metamodel in service management domain. And then, Service Management Data Model (SMDM) is established to complete instantiation of metamodel by studying Share Information /Data (SID) Model. In this methodology, firstly, universal metamodel is established to ensure data sharing and reuse in SMS. Secondly, based on analysis of all kinds of information and process in SMS, core classes are defined to instantiate metadata classes and guarantee extendibility of SMDM. Each operational process can establish corresponding data model by definition of sub-class inheriting core class. Finally, data model of service quality monitoring is established to validate modeling methodology's validity. Therefore, consistency between SMDM and functional requirements is achieved and extension of business entities in SID is realized.
5928745
Beyond Banditron: A Conservative and Efficient Reduction for Online Multiclass Prediction with Bandit Setting Model
In this paper, we consider a recently proposed supervised learning problem, called online multiclass prediction with bandit setting model. Aiming at learning from partial feedback of online classification results, i.e. “true” when the predicting label is right or “false” when the predicting label is wrong, this new kind of problems arouses much of researchers’ interest due to its close relations to real world internet applications and human cognitive procedure. While some algorithms have been brought forward, we propose a novel algorithm to deal with such problems. First, we reduce the multiclass prediction problem to binary based on Conservative one-versus-all others Reduction scheme; Then Online Passive-Aggressive Algorithm is embedded as binary learning algorithm to solve the reduced problem. Also we derive a pleasing cumulative mistake bound for our algorithm and a time complexity bound linear to the sample size. Further experimental evaluation on several real world multiclass datasets including RCV1, MNIST, 20 Newsgroups and USPS shows that our method outperforms the existing algorithms with a great improvement.
25276326
Web-Based Service Management of Distributed Learning
This paper tries to design structure of Web-Based Service Management of Distributed Learning (WSMDL). The structure integrating IT service and Educational Auxiliary System service flow. Help desk becomes only interface for all levels of users according to their individual demands. Though analysis of service events and user’s feedback in service flow, it also provides the decision-making to improve the quality of Web-based Service Management of Distributed Learning Service Management. The paper also depicts the functions of WSMDL.
15892947
Torsional Pile Subjected to Transient Loading in Viscoelastic Poroelastic Medium
Considering viscoelastic saturated soil, The transient dynamic response of an elastic pile is studied. The pile-soil system is divided into thin layers, the control equations of the soil are solved respectively by using Laplace transform. Considering the mixed boundary-value conditions at the interface of pile and soil, expression is derived to describe the relationship between the inner force and the displacement of the pile segment. Then the expressions of all pile segments are integrated to form the stiffness matrix of pile. Considering the transient torsional loading at the pile head, the pile displacement in time domain is calculated by numerical method, with the result showing the influence of various pile parameters.