15772260
DHT-Based Range Query Processing for Web Service Discovery
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries play an important role in service discovery, and in recent years a number of DHT-based range query schemes have been proposed. However, most of them suffer from high query delay and high processing cost. This paper presents ERQ, an Efficient scheme for delay bounded Range Query processing over DHTs. We first emulate the PHT structure and design a balanced Kautz (BK) tree to uniformly map the m-dimensional data space onto DHT nodes, and then present a novel algorithm that processes range queries in a parallel fashion, where an on-the-fly space pruning mechanism is adopted to reduce the processing cost. In a DHT with N nodes, ERQ can answer any range query in less than logN (2loglogN+1) hops with low processing cost, irrespective of the queried range, the whole space size, or the number of queried attributes. The effectiveness of ERQ is demonstrated through extensive experiments.
33185687
Supremum of Agent Number Needed in Analyzing Security Protocols Based on Horn Logic
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.
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.
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.
16996391
WIP: Web Service Initiation Protocol for Multimedia and Voice Communication over IP
In this paper, we present WIP - Web service initiation protocol for multimedia and voice communication over IP. WIP is an entirely Web service based communication protocol, consisting of a set of Web service operations for initiating and establishing converged (e.g. multimedia, IM, voice, etc.) communication services over IP. It inherits the principle of separation signaling and media transmission of SIP (session initiation protocol); but it relies on a single Web service stack to provide a full featured communication signaling protocol. WIP opens a new paradigm of Web service based VoIP communication, which is extensible and can be easily integrated in end-to-end SOA solutions. The generic Web service approach used in WIP overcomes many limitations which would be otherwise difficult to achieve in non-Web service based communication methods used today. WIP is based on two-way, full duplex Web service interaction. The communication signaling establishment in WIP is through Web service interactions, and the media negotiation in WIP is modeled as a special Web service "event" subscription, which is fully extensible for various media needs. The signaling messages of WIP are encoded in the standard based SOAP message envelops which can be carried by multiple transport protocols, including HTTP. WIP supports both P2P (peer-to-peer) and B2B (back-to-back) broker mode communication services. A prototype research system has been implemented, and the results indicate that WIP, as a full Web service based communication protocol, is both feasible and advantageous
42839671
A Novel Integrated Supporting System for Mesh-Pull Based P2P IPTV
This paper presents a novel integrated supporting system for the mesh-pull based P2P IPTV. The proposed system can monitor the service quality of each overlays within the system by initiating random walks to sample key metrics of the system periodically and analyze the service quality statistically, and improve them to some extend. When the service quality is below the threshold, the system will increase its upload bandwidth adaptive to the workload of the system. The supporting system will allocate its bandwidth among multiple overlays to get the as much revenue as possible. This paper presents the design of this architecture and describes its functions and shows its adaptability to the high dynamic nature of p2p IPTV system and fitness for commercial deployment. At last we verify the feasibility of the architecture by simulation, and the results show its performance and adaptability.
42610771
A Novel Ordering-Based Greedy Bayesian Network Learning Algorithm on Limited Data
27634891
Nonlinear Adaptive Blind Source Separation Based on Kernel Function
As the linear method is difficult to recover the sources from the nonlinear mixture signals, in this paper a new nonlinear adaptive blind signal separation algorithm based kernel space is proposed for general invertible nonlinearities. The received mixture signals are mapped from low dimensional space to high dimensional kernel feature space. In the feature space, the received signals form a smaller submanifold, and an orthonormal basis of the submanifold is constructed in this space, as the same time, the mixture signals are parameterized by the basis in the high dimensional kernel space. In the noiseless or noisy situation, the sources are rebuilt online processing by M-EASI and subspace tracking. The results of computer simulations are also presented.
45720537
Bayesian Network Structure Ensemble Learning
Bayesian networks (BNs) have been widely used for learning model structures of a domain in the area of data mining and knowledge discovery. This paper incorporates ensemble learning into BN structure learning algorithms and presents a novel ensemble BN structure learning approach. Based on the Markov condition and the faithfulness condition of BN structure learning, our ensemble approach proposes a novel sample decomposition technique and a components integration technique. The experimental results reveal that our ensemble BN structure learning approach can achieve an improved result compared with individual BN structure learning approach in terms of accuracy.