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.
Distributed storage systems are known to be susceptible to long tails in response time. It has been shown that in modern online applications such as Bing, Facebook, and Amazon, the long tail of latency is of particular concern, with 99.9th percentile response times being orders of magnitude worse than the mean. As erasure codes emerge as a popular technique in distributed storage to achieve high data...
In this work, we consider a variant of the set reconciliation problem where the estimate for the size of the symmetric difference may be inaccurate. Given this setup, we propose a new method to reconciling sets of data and we then compare our method to the Invertible Bloom Filter approach proposed by Eppstein et al. [2].
On the one hand, Constraint Satisfaction Problems (CSP) are a declarative and expressive approach for modeling problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances up to millions of variables and clauses. In this article, we present an approach for taking advantage of both CSP modeling and SAT solving. Our technique consists in expressively...
On the one hand, Constraint Satisfaction Problems (CSP) are a declarative and expressive approach for modeling problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances up to millions of variables and clauses. In this article, we present an approach for taking advantage of both CSP modeling and SAT solving. Our technique consists in expressively...
We consider the problem of finding the capacity of noisy networks under the presence of Byzantine adversaries, modeled by a joint compound channel and arbitrarily varying channel (AVC) model. This extends our earlier work which considers these models only in isolation. The motivation for this setup is that typically the adversary first selects an arbitrary subset of edges from the network and then...
In this work, we investigate the minimum power of transmitting Gaussian multiterminal sources over the Gaussian multiple access channel (MAC) with bandwidth expansion. Distributed encoders observe the individual components of the multiterminal sources and attempt to describe them to a central decoder. Instead of assuming the sources and the channel have matched bandwidth, we consider the scenario...
We study the problem of secure transmission over a caching D2D network. In this model, end users can prefetch a part of popular contents in their local cache. Users make arbitrary requests from the library of available files and interact with each other to deliver requested contents from the local cache to jointly satisfy their demands. The transmission between the users is wiretapped by an external...
Coded multicasting has been shown to be a promising approach to significantly improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, achievable schemes proposed to date have been shown to achieve the proved order-optimal performance only in the asymptotic regime in which the number of packets per requested item goes to infinity...
It has been recently observed that some information can be extracted from the received signal by the reader when the tag collision happens. Using the radio cross section (RCS) technique one can determine how many tags are backscattering simultaneously. Motivated by this technique we introduce the new notion of singulation code. In a singulation code, any two collection of codewords, of size up to...
The conventional assumption made in the design of communication systems is that the energy used to transfer information between a sender and a recipient cannot be reused for future communication tasks. A notable exception to this norm is given by passive RFID systems, in which a reader can transfer both information and energy via the transmitted radio signal. Conceivably, any system that exchanges...
We consider lattice coding over a Gaussian wiretap channel with respect to the secrecy gain, a lattice invariant introduced in [1] to characterize the confusion that a chosen lattice can cause at the eavesdropper. The secrecy gain of the best unimodular lattices constructed from binary self-dual codes in dimension n, 24 ≤ n ≤ 32 are calculated. Numerical upper bounds on the secrecy gain of unimodular...
A Write-Once Memory (WOM)-code is a coding scheme that allows information to be written in a memory block multiple times, but in a way that the stored values are not decreased across writes. This work studies non-binary WOM-codes with applications to flash memory. We present two constructions of non-binary WOM-codes that leverage existing high sum-rate WOM-codes defined over smaller alphabets. In...
Given a set C of q-ary n-tuples and c 2 C, how many symbols of c suffice to distinguish it from the other elements in C ? This is a generalization of an old combinatorial problem, on which we present (asymptotically tight) bounds and variations.
We consider the two-user broadcast erasure channel where feedback in the form of ack messages is fed back to the transmitter. We provide an upper bound to the capacity region of this system. We then present two algorithms whose rate region (information bits per transmitted bit) becomes arbitrarily close to the upper bound for large packet sizes. The first algorithm relies on random coding techniques...
The random network coding approach is an effective technique for linear network coding, however it is highly susceptible to errors and adversarial attacks. Recently Kotter and Kschischang introduced the operator channel, where the inputs and outputs are subspaces of a given vector space, showing that this is a natural transmission model in noncoherent random network coding. A suitable metric, defined...
The performance analysis of random linear network codes is important both theoretically and for its applications. In this paper, we derive improved upper bounds for the failure probability of random linear network codes and analyze the limiting behavior as the field size goes to infinity. Unlike the previously reported bounds, the new bound is shown to be tight as the field size |F| goes to infinity.
We propose a built-in scheme for generating all patterns of a given deterministic test set T. The scheme is based on grouping the columns of T, so that in each group of columns the number ri of unique representatives (row subvectors) as well as their product R over all such groups is kept at a minimum. The representatives of each group (segment) are then generated by a small finite state machine (FSM)...
We consider data-streaming from an access point to multiple receivers, which is modeled as packet erasure channel. A simple network coding is shown to achieve larger rate region than without network coding, using minimal control information. The performance is characterized exactly using state transition graph. The scheme is then mapped to an information theoretic formulation for broadcast channel...
Based on the analysis of the standard Particle Swarm Optimization and the characteristic of typical multi-intersection for urban trunk road, a traffic flow forecasting model using dynamic recursion neural network is presented. The feature of this network is that the output of the hidden layer connects to the input of itself through the delay and storage of the context layer. The method of self-connection...
In the MDD and MDA approaches, models become the primary artifacts of the development process. Therefore, assessment of the correctness of such models is a key issue to ensure the quality of the final application. In that sense, this paper presents an automatic method that uses the Constraint Programming paradigm to verify UML class diagrams extended with OCL constraints. In our approach, both class...
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.