15977207
Exploiting hierarchical CP-nets to increase the reliability of Web services workflow
Individual Web services can be composed together to form value-added composite Web services represented as business process workflow. However, the value of such composite Web services is directly influenced by the reliability of the composite services. Composing Web services is not an easy task and is error-prone, so there is a growing interest for the verification techniques which enable designers to find and repair design errors even before actual running of the service, or allow designers to detect erroneous properties such as deadlocks or livelocks and formally verify whether the service process design does have certain desired properties (such as consistency with the conversation protocols of partner service). In this paper, we present to analyze and verify Web services composition by using some kind of colored Petri nets (CP-nets) called hierarchical CP-nets, which combine the strengths of Petri nets with the expressive power of high-level programming and have sound mathematical semantics. Services composition proposals can be transformed by transformation rules into CP-nets, which can be simulated to analyze the performance and verified to investigate behavioral properties by exploiting existing CP-nets specialized tools
12282317
A note on “a mapping algorithm for computer-assisted exploration in the design of embedded systems”
The scaling of autoclave and leaching-equipment surfaces during the high pressure leaching of nickeliferous oxide and silicate ores is controlled during leaching to favor the formation of scale containing substantial amounts of magnesium sulfate that is more easily removed by chemical dissolution using water or dilute sulfuric acid at temperatures ranging from about 50 DEG C. to 250 DEG C. than scale containing substantial amounts of alunite.
28489429
Transmission Scheduling in Data-Driven Peer-to-Peer Streaming towards Optimal Throughput
Peer-to-peer media streaming has been an important service on the internet in recent years. The Data-driven (or mesh-based) structure is adopted by most working systems,in which data scheduling is one of the important problems.However, those frequently used scheduling algorithms are often faced with such a case: A neighbor peer takes up its bandwidth to deliver the packets that other neighbors can also supply, but some packets only held by it are not delivered.These packets can not be delivered in the current scheduling cycle, even though that the other neighbors have surplus bandwidth. This is a kind of waste of bandwidth and decreases the throughput of transmission. In this paper we propose anew scheduling algorithm aiming at the optimal throughput:Bipartite-matching based Block Scheduling algorithm(BBS).We convert the original data scheduling problem to a problem of finding a maximum match on the correspond bipartite graph, then assign data packets to neighbors according to the maximum match. We evaluate the performance of BBS with extensive experiments and the results show that BBS throughput and provides better streaming quality than those frequently used scheduling algorithms.
33185687
Supremum of Agent Number Needed in Analyzing Security Protocols Based on Horn Logic
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.
13252008
Anode-ALM: An Aggregation-Based Application Level Multicast for Media Streaming
Building application level multicast (ALM) for media streaming, we had better keep the invariability of source to-end delay (S2EDelay) of any node on the tree, so as to avoid delay jitter problem. In this paper, we proposed an aggregation-based ALM architecture, which aggregates the unstable nodes within a local area into a relative stable aggregation node Anode, and then builds tree by Anodes. Anode shields node’s dynamicity inside and behaves as a stable one outside. To build the architecture, we first proposed an Anode structure by n-dimension anti-cube, and proposed a distributed algorithm to bind the logic view and physical view of an Anode dynamically by the differentiation and assimilation operations, which maintain the integrality of the logic view while the physical view changes dynamically. Experiment results indicate that our algorithm can keep theS2EDelay invariability of the built ALM tree effectively.
14744630
TARGET: Two-way Web Service Router Gateway
In this paper, we present the approach and architecture of TARGET: two-way Web service router gateway, for two-way Web service interaction crossing enterprise domain and firewall. It provides a full support for asynchronous outbound operation and event notification in communication services. TARGET addresses an acute issue for Internet applications that today's enterprise NATs and firewalls only allow outbound HTTP request from the inside to the outside and block any request from the outside to the inside, which is a serious problem for two-way Web services. TARGET is a generic solution to allow two-way Web service interaction to traverse legitimately through NATs and strictly configured firewalls; and it is based on two-way SOAP message tunneling, service local registry, and service routing to bridge two-way Web service interaction. A research TARGET system has been implemented and applied to real time communication services, e.g. conferencing. Extensive experiments on TARGET are performed, and its performance with various sizes of SOAP messages is studied. The applicability and feasibility of TARGET for two-way Web service interaction is verified
11582687
Web service enablement of communication services
In this paper, we introduce Web service application session services, WS-session, for Web service based application session management in communication. A two-way Web service framework is described. It supports the use of Web service in the situation of telecommunication where the communication endpoint can be both a client and a peer-to-peer server. We describe the interface design in two-way Web service interaction based on the concept of tightly coupled interface and loosely coupled interface solutions. The proposed approach provides full support of asynchronous outbound operations and event notifications in communication services. It is implemented in a research prototype system that provides both standard based (ECMA-348) services and Avaya service extensions. In addition, we investigated the integration of our proposed approach with BPEL4WS. It allows the user to create new services through a drag-n-drop based service creation environment (ECLIPSE/BPEL4WS). It leads to a paradigm of service creation through Web service composition. More sophisticated telecommunication services are created from composing the basic services.
1617013
Motion Path Synthesis for Intelligent Avatar
In this paper, we present a new motion generation technique, called motion path synthesis. The objective is to generate a motion for an intelligent avatar to move along a planned route using a pre-existing motion library. First, motion primitives, each defined as a dynamic motion segment, are extracted from the motion library. Then a motion graph is constructed based on the motion primitives and their connectivities. Within this motion graph, the desired realistic motion for avatars can be synthesized through a two-stage process: search an optimal motion path within the motion graph, joint the motion path and adapt it to the route. The experiment shows the effectiveness of the presented technique.
950378
Extending OpenMP for heterogeneous chip multiprocessors
The emergence of system-on-chip (SOC) design shows the growing popularity of the integration of multiple-processors into one chip. We propose that high-level abstraction of parallel programming like OpenMP is suitable for chip multiprocessors. For SOCs, the heterogeneity exists within one chip such that it may have different types of multiprocessors, e.g. RISC-like processors or DSP-like processors. Incorporating different processors into OpenMP is challenging. We present our solutions to extend OpenMP directives to tackle this heterogeneity. Several optimization techniques are proposed to utilize advanced architecture features of our target SOC, the software scalable system on chip (3SoC). Preliminary performance evaluation shows scalable speedup using different types of processors and performance improvement through individual optimization.
18563923
Forward and Inverse Solutions of Electrocardiography Problem Using an Adaptive BEM Method
The construction of geometry models of heart-torso is critical for solving the forward and inverse problems of magneto- and electrocardiography (MCG/ECG). Boundary element method (BEM) is a commonly used numerical approach for the solution of these problems and it requires the modeling of interfaces between various tissue regions. In this study, a new BEM (h-adaptive type) has been applied to the ECG forward/inverse problems. Compared with those traditional BEMs, the adaptive BEM can self-adjust the number and size of the boundary element (BE) meshes according to an error indicator, and thus can save a lot of computational time and also improve the accuracy of the forward and inverse solutions. In this paper, the procedure of the adaptive triangular mesh generation is detailed and the algorithm is tested using a concentric sphere model and a realistic heart-torso model. For the realistic torso model, to improve the numerical accuracy, a number of new nodes are added on the basis of initial torso BE meshes, and the corresponding node coordinates are determined using an approach called Parametric Fourier Representation (PFR) of closed polygons. The simulation results show that the adaptive BEM is more accurate and efficient than traditional BEMs and therefore it is a very promising numerical scheme for ECG forward/inverse problems.