1916291
A Novel Anonymous Communication Strategy with Respect to Payment Mechanism
Anonymous communication systems are vulnerable to free-riders who use the systems while provide little or no service to other users in the systems. An anonymous communication strategy is proposed to promote and encourage participants to provide service to the systems. We analyze the number of coins that a sender uses to pay for the peers on its anonymous route, and propose a new measure in the payment mechanism that is suitable to a next-hop anonymous system. Theoretical analysis shows that the system with the new payment mechanism promotes anonymous communication effectively while it keeps the system performance comparable to the existing anonymous systems such as Crowds. Moreover, the new system avoids the drawback of existing anonymous systems that enforces no upper bound on the length of anonymous routes.
14212804
A Broadcasting Retransmission Approach Based on Random Linear Network Coding
In wireless broadcasting retransmission, any node of multi-nodes requests the retransmission of information packets. This approach always needs large amounts of broadcasting packets. This paper presents a novel retransmission approach (RLNCBR) in wireless broadcasting networks based on random linear network coding. Firstly, source node will send linear coding packets based on the largest amounts of lost packets in received nodes. Then, received nodes will decode lost packets with network coding theory. Mathematic analysis reveals that our approach can ensure the solvability in the received nodes, and have optimal performance in wireless retransmission. Simulation results indicate that compared with existing approach, the approach in this paper can effectively reduce the average number of transmissions and advance the transmission efficiency.
8256320
Fast computation with neural oscillators
This paper studies new spike-based models for winner-take-all computation and coincidence detection. In both cases, fast convergence is achieved independent of initial conditions, and network complexity is linear in the number of inputs. Fully distributed versions can be modelled based on groups of interneurons connected through electrical synapses.
18533711
A New Approach for Detecting Anonymity of Patterns
Information sharing becomes more frequently and easily than before. However, it also brings serious threats towards individual's privacy. It is no doubt that sharing personal data can cause privacy breaches. Moreover, sharing the knowledge discovered by data mining may also pose threats to personal privacy. In this paper, we consider the anonymity of patterns derived from the result of frequent itemset mining. A new projection-based approach for detecting anonymity of patterns is presented. We prove that the approach can detect all the maximal inference channels for non-k-anonymous patterns. The experimental results show that our approach is more efficient than previous work especially when the number of closed frequent itemsets in the mining result is close to or larger than the number of transactions in a database.
3544821
11,001 New Features for Statistical Machine Translation
We use the Margin Infused Relaxed Algorithm of Crammer et al. to add a large number of new features to two machine translation systems: the Hiero hierarchical phrase-based translation system and our syntax-based translation system. On a large-scale Chinese-English translation task, we obtain statistically significant improvements of +1.5 Bleu and + 1.1 Bleu, respectively. We analyze the impact of the new features and the performance of the learning algorithm.
10551742
Modeling semantics and structure of discussion threads
The abundant knowledge in web communities has motivated the research interests in discussion threads. The dynamic nature of discussion threads poses interesting and challenging problems for computer scientists. Although techniques such as semantic models or structural models have been shown to be useful in a number of areas, they are inefficient in understanding discussion threads due to the temporal dependence among posts in a discussion thread. Such dependence causes that semantics and structure coupled with each other in discussion threads. In this paper, we propose a sparse coding-based model named SMSS to Simultaneously Model Semantic and Structure of discussion threads.
20468001
Adaptive backstepping control of uncertain systems with unknown input time-delay
In this paper, we establish the robustness of adaptive controllers designed using the standard backstepping technique with respect to unmodeled dynamics involving unknown input time delay. While noting that some results on robust stabilization of non-minimum phase systems using the backstepping technique are available, we realize that the standard adaptive backstepping technique has only been shown applicable to unknown minimum phase systems. Another significance of our result is to enable the class of systems stablizable by adaptive backstepping controllers to cross the boundary of minimum phase systems, since systems with input time delay belong to non-minimum phase systems. Moreover, the L"2 and L"~ norms of the system output are also established as functions of design parameters. This implies that the transient system performance can be adjusted by choosing suitable design parameters.