8202363
Coordinated Services Provision in Peer-to-Peer Environments
In recent years, inspired by the emerging Web services standard and peer-to-peer technology, a new federated service providing (FSP) system paradigm has attracted increasing research interests. Many existing systems have either explicitly or implicitly followed this paradigm. Instead of exchanging files, peers in FSP systems share their computation resources in order to offer domain-specific services. In this paper, we focused on the coordination problem of how to self-organize the service group structures in response to the varying service demand. We presented our solution in the form of a coordination mechanism, which includes a labor-market model, a recruiting protocol, and a policy-driven decision architecture. Peers make their service providing decisions based on their local policies, which can be added, removed, or modified by users. A general methodology is introduced in this paper to facilitate policy design. Specifically, a heuristic inspired by the extremal optimization technique is utilized to handle potential inconsistencies among policies. A stimulus-response mechanism was further applied to make the decision process adjustable. Experiments under five application scenarios verified our ideas and demonstrated the effectiveness of our coordination mechanism.
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.
2378122
Self-organized manufacturing resource management: An ant-colony inspired approach
In a typical manufacturing system, jobs are released from a production planning stage to a shop floor, where they are allocated to resources like machines. An optimal or near optimal schedule is generally found for those jobs. In reality, the execution of this schedule is often interrupted by dynamic events like unexpected incoming new jobs, machine breakdowns, etc. A rapid recovery or a self-organized feature of the interrupted schedule is desirable for manufacturing resource management. This paper proposes an ant-colony inspired approach to recover the interrupted schedule through a self-organization mechanism. The experiments show that this mechanism significantly improves the quality of the recovered schedules.
3870686
An improved dead reckoning method for mobile robot with redundant odometry information
Dead reckoning is an important method for mobile robot. If its accuracy can be improved, navigation tasks will be simplified. The mobile robot concerned in this paper is with five wheels, in which there are dual driving wheels and a castor. A measurement wheel with encoder is fixed beside each driving wheel. There are two encoders fixed on the castor. One measures the castor's movement, and another indicates the angle of yawing. A new kind of kinematics equations derived from the robot's turning radius and angle of movement trajectory is presented. We can get a group of turning radius and angle from the data of four encoders, in which there are four different values for radius and six different values for angle. The estimated values of radius and angle can be gotten by fusion using fuzzy algorithm. The improved dead reckoning method has the advantages of simplicity, less computation cost, cheapness and good performance in uneven road. The simulation shows its effectiveness.
15177546
Semantic enhanced rule driven workflow execution in Collaborative Virtual Enterprise
Globalization leads to an efficient new business paradigm generally known as collaborative virtual enterprise (CVE) which demands flexible service orchestration and robust workflow execution. As two major service orchestration strategies, OWL-S and BPEL have their own strength and deficiencies. To meet the challenge in CVE, in this paper, we propose a workflow execution system (WES) that takes advantage of the complementary strengths of these two technologies. On the one hand, having semantic support, OWL-S is used in dynamic service discovery and composition at high level. On the other hand, at the concrete level, industry-based BPEL is exploited in service execution. The description of each semantic Web service is enhanced with rule-based modeling of the essential business logic behind the service interface. In order to realize interoperability in OWL-S and BPEL without loss of semantic information, we further proposed an OWLS2BPEL Mapper to facilitate the workflow robustness and support rule evaluation to increase responsiveness to customers. A concrete scenario in PC manufacturing collaborative virtual enterprise is analyzed to demonstrate the effectiveness of our workflow execution system.
537363
Change propagation algorithm in a unified feature modeling scheme
Product lifecycle stages are inter-related and mutually constraining. Due to the sequential nature of the product development processes, some constraints or conflicts may emerge in a later stage and require modifications to the decisions made in earlier stages. The iterations between stages are hence unavoidable and must be managed carefully to maintain the consistency, integrity and validity of product information models. Due to the inter- or intra-stage relations, a chain of changes is very likely to occur as the consequence of an initial change. Modeling and maintaining these relations are important in collaborative engineering to evolve the state of the whole product model in a consistent manner. This paper introduces a new method of modeling associative engineering relations in a unified feature modeling scheme and elaborates a change propagation algorithm for the information consistency control among multiple applications of product lifecycle stages. The algorithm is established on a JTMS-based dependency network. Two case studies are used to illustrate the proposed dependency network and change propagation algorithm.
1107258
Improving image clustering: An unsupervised feature weight learning framework
We address the problem of feature weight learning for image clustering. In practice, before clustering data, we generally normalize all data features between 0 and 1, because we cannot determine which features are more important. In this paper, we provide a feature weight learning framework for clustering which can obtain the feature weights and cluster labels simultaneously. An alternative optimization algorithm is adopted to solve this problem. Empirical studies on the toy data and real image data demonstrate our algorithm's effectiveness in improving the clustering performance.
16819932
A Client Peer Adjustment Policy for Peer-to-Peer Media Streaming
Previous work indicates that more cooperation is needed between peers for peer-to-peer (P2P) media streaming application than files sharing. That implies it is important to select cooperators in P2P networks. However, most of peer selection algorithms are performed at requesting ones and focus on how to choose servers from which clients can benefit more while ignoring whether the scalability and service capacity of systems will be influenced by these results. In this paper, we pay more attention to heterogeneous network capacity of peers and propose a policy fulfilled by server peers to select and adjust clients according to their service capacity and contribution. Peers with higher service capacity may replace existing children. And experiments proved that our policy could improve system's overall utilization and contribution, as well as the depth of multicast tree when compared with delay-based algorithm
6983597
A Comparative Study of Parallel Prefix Adders in FPGA Implementation of EAC
Several regular parallel trees have been proposed over the years to optimize logic depth, area, fan-out and in- terconnect count for logic circuits. In this paper, we propose a comparative study of different parallel prefix trees used in the design of a new end-around carry (EAC) adder targeting FPGA technology. This new adder is based on the fast 128-bit binary floating-point EAC adder which has been implemented in the IBM POWER6 microprocessor's fused multiply-add unit. The parallel prefix tree implemented on the IBM's EAC adder is a Kogge-Stone tree which has been chosen for its high performance and its low power consumption. Our comparative study highlights the main performance differences among fourteen different architecture configurations when targeting an FPGA EAC adder design. We focus on the area requirements and the critical path delay of these designs. Our experimental results show that there is one architecture configuration with the lower area requirement and the higher performance.
20633806
Inelastic Simulation of Insect Cuticle Using Artificial Neural Network
Neural networks have been availably applied to the simulations of the mechanical behaviors of many materials. In this work, a neural network material model is built for the simulation of the inelastic behavior of biocomposite insect cuticle. Radial basis function neural network is adopted in the simulation for that the neural network has the characteristic of fast and exactly completing the simulation. In the construction of the neural network, the network is trained based on the experimental data of the load-displacement relationship of a chafer cuticle. A strain-controlled mode and the iterative method of data are adopted in the training process of the neural network. The obtained neural network model is used for the simulation of the inelastic behavior of another kind of insect cuticle. It is shown that the obtained material model of the radial basis function neural network can satisfactorily simulate the inelastic behavior of insect cuticle.
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.