The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We give a test that can distinguish efficiently between product states of n quantum systems and states which are far from product. If applied to a state |φ) whose maximum overlap with a product state is 1- ε, the test passes with probability 1-Θ(ε), regardless of n or the local dimensions of the individual systems. The test uses two copies of |φ). We prove correctness of this test as a special case...
This paper proposed a chaotic image scrambling scheme based on sorting transformation. The algorithm calculates the permuting address codes by sorting the chaotic sequence. Therefore, the scheme does not require knowing the probability density function of the chaotic orbits in advance, thus not only facilitating the choice of chaotic systems but also reducing the complexity of the scheme. The paper...
It is widely suspected that Erdös-Renyi random graphs are a source of hard instances for clique problems. Giving further evidence for this belief, we prove the first average-case hardness result for the k-clique problem on monotone circuits. Specifically, we show that no monotone circuit of size O(nk/4) solves the k-clique problem with high probability on G(n,p) for two sufficiently far-apart threshold...
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest execution of the protocol by both parties results in a fair coin toss, and (2) Security: a cheating party cannot increase the probability of its desired outcome by any significant amount. Since its introduction by Blum, coin flipping...
Abstract-We consider the problem of testing if a given function f:F2n → F2 is close to any degree d polynomial in n variables, also known as the Reed-Muller testing problem. Alon et al. [1] proposed and analyzed a natural 2d+1-query test for this problem. This test turned out to be intimately related to the Gowers norm. Alon et. al. showed that this test accepts every degree d polynomial with probability...
In this paper, focusing on a multi-source, two-stage selective decode-and-forward (DF) relaying network in which the multiple sources have a common destination, we propose an effective cooperative relaying transmission scheme via exploiting decentralized distributed space-time block coding (Dis-STBC). This scheme is a unified multi-source cooperative transmission scheme, regardless of the number of...
Given a random binary sequence X(n) of random variables, Xt, t = 1, 2, ..., n, for instance, one that is generated by a Markov source (teacher) of order k* (each state represented by k* bits). Assume that the probability of the event Xt = 1 is constant and denote it by ??. Consider a learner which is based on a parametric model, for instance a Markov model of order k, who trains on a sequence x(m)...
It has been reported that Internet Protocol (IP) packet traffic exhibits self-similarity or long range dependence (LRD) and causes the degradation of switch performance. Therefore, it is crucial for an appropriate buffer design of switch. In this paper, we investigate the packet loss behavior of the switch under self-similar variable packet length traffic by modeling it MMPP/M/1/K as queueing system...
When provisioning the quantitative QoS based VPN services over packet switched networks, parameters such as packet loss, delay and delay jitter, besides the required bandwidth, have to be guaranteed. While the bandwidth is easier to guarantee during the lifetime of a VPN service, maintaining a value of the loss parameter below a preset value presents serious difficulties. Thus one of the main issues...
We consider the problem of length-constrained maximum a posteriori (MAP) decoding of a Markov sequence that is variable length encoded and transmitted over a binary symmetric channel. We convert this problem into one of maximum-weight k-link path in a weighted directed acyclic graph. The induced graph optimization problem can be solved by a fast parameterized search algorithm that finds either the...
This paper presents a new approach for multitarget tracking in a cluttered environment. Optimal all neighbour multi-target tracking (MTT) in clutter enumerates all possible joint measurement-to-target assignments and calculates the a posteriori probabilities of each of these joint assignments, e.g. J(I)PDA and MHT. The numerical complexity of this process is exponential in the number of tracks and...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.