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.
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.
7197821
A case study on system-level modeling by aspect-oriented programming
The paper presents a novel and synergistic system-level modeling approach based on aspect-oriented programming (AOP) and SystemC. A case study on a 128-bit binary floating-point adder is performed to demonstrate the modeling strength of the approach. The validation experiment shows the effectiveness of the proposed approach. This work constitutes a first attempt to employ AOP in modeling digital systems.
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
17985803
Verifying Web Services Composition: A Transformation-Based Approach
Web services composition is an emerging paradigm for enabling application integration. BPEL is a promising language describing composition in form of business processes, but is lack of sound formal semantic. This paper presents the transformation of BPEL to CP-nets in a constructive way. Therefore we can translate composition specified in BPEL into CPnets, which can be analyzed and verified by many specialized tools. So we make tool support available for verifying BPEL composition.
9882029
The Group Search Optimizer and its Application on Truss Structure Design
This paper introduces a novel optimization algorithm, group search optimization (GSO) algorithm and its implementation method is presented in detail. The GSO is used to investigate the planar and space truss structures with continuous variables and is tested by two truss optimization problems. The optimization results are compared with that of the particle swarm optimization (PSO) algorithm, the particle swarm optimization with passive congregation (PSOPC) and the heuristic particle swarm optimizer (HPSO) algorithm. Results from the two tested cases illustrate the ability of the GSO algorithm to find the optimal results, which are better than that of the PSO and PSOPC, while are at the same level of that of HPSO optimization method. Meanwhile, the results also show that the GSO algorithm maintains a preferable convergence accuracy among these four algorithms.
3230690
A new verification-based fast-match for large vocabulary continuous speech recognition
Acoustic fast-match is a popular way to accelerate the search in large-vocabulary continuous-speech recognition, where an efficient method is used to identify poorly scoring phonemes and discard them from detailed evaluation. In this paper we view acoustic fast-match as a verification problem, and hence develop an efficient likelihood ratio test, similar to other verification scenarios, to perform the fast match. Various aspects of the test like the design of alternate hypothesis models and the setting of phoneme look-ahead durations and decision thresholds are studied, resulting in an efficient implementation. The proposed fast-match is tested in a large vocabulary speech recognition task and it is demonstrated that depending on the decision threshold, it leads to 20-30% improvement in speed without any loss in recognition accuracy. In addition, it significantly outperforms a similar test based on using likelihoods only, which fails, in our setting, to bring any improvement in speed-accuracy trade-off. In a larger set of experiments with varying acoustic and task conditions, similar improvements are observed for the fast-match with the same model and setting. This indicates the robustness of the proposed technique. The gains due to the proposed method are obtained within a highly efficient 2-pass search strategy and similar or even higher gains are expected in other alternative search architectures.
1036059
Neighbor Relationship and Optimization in Mesh Overlay Multicast
Nodes in mesh overlay multicast system don't have fixed parent-children relationship like that in trees and form neighbors. But in data-driven mesh and based on pulling method, for each packet, it still follows a certain tree and the parent-children relationship does exist. While having the powerful peers stay closer to the source may improve the performance, we make the peers of high out bandwidth preempt the neighbor of the peers near the source. In our paper, we describe the delivery trees set and construct the main distribution tree, which carries most of the data, to construct the signaling path and relay priority preemption message to reduce the cost. We model the neighbor relationship to decide which neighbor to be preempted based on the capacity of the node and the contribution it makes to the probed nodes. Our simulations show that after a temporary reduction in performance at the beginning, which for the optimization chaos of optimization procedure, the system converges to a stable state and gains better performance, especially for playback delay, and meanwhile the control overhead is in reasonable range.
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
118699197
Intentionally and unintentionally: on both, A and non-A, in neutrosophy
The paper presents a fresh new start on the neutrality of neutrosophy in that "both A and Non-A" as an alternative to describe Neuter-A in that we conceptualize things in both intentional and unintentional background. This unity of opposites constitutes both objective world and subjective world. The whole induction of such argument is based on the intensive study on Buddhism and Daoism including I-ching. In addition, a framework of contradiction oriented learning philosophy inspired from the Later Trigrams of King Wen in I-ching is meanwhile presented. It is shown that although A and Non-A are logically inconsistent, but they are philosophically consistent in the sense that Non-A can be the unintentionally instead of negation that leads to confusion. It is also shown that Buddhism and Daoism play an important role in neutrosophy, and should be extended in the way of neutrosophy to all sciences according to the original intention of neutrosophy.