Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In 3D-HEVC, single depth intra mode has been applied and has been integrated into depth intra skip mode for efficient depth map coding. With single depth intra mode, one 2N×2N prediction unit (PU) is predicted without high computational prediction process. In this paper, we propose a fast single depth intra mode decision method to address the problem of high computational complexity burden in depth...
We consider a new family of asymmetric Lee codes that arise in the design and implementation of DNA-based storage systems and systems with parallel string transmission protocols. The codewords are defined over a quaternary alphabet, although the results carry over to other alphabet sizes, and have symbol distances dictated by their underlying binary representation. Our contributions are two-fold....
The problem of mismatched decoding with an additive metric q for a discrete memoryelss channel W is addressed. Two max-min multi-letter upper bounds on the mismatch capacity Cq(W) are derived. We further prove that if the average probability of error of a sequence of codebooks converges to zero sufficiently fast, then the rate of the code-sequence is upper bounded by the “product-space” improvement...
By developing one-shot mutual covering lemmas, we derive a one-shot achievability bound for broadcast with a common message which recovers Marton's inner bound (with three auxiliary random variables) in the i.i.d. case. The encoder employed is deterministic. Relationship between the mutual covering lemma and a new type of channel resolvability problem is discussed.
A well-known technique in assessing probabilities of rare events (used, e.g., in the sphere-packing bound), is that of finding a reference measure under which the event of interest has probability of order one and estimating the probability in question using the Kullback-Leibler divergence (KLD). A recent method has been proposed [2], that can be viewed as an extension of this idea in which the probability...
In this work we study the reliability and secrecy performance achievable by practical low-density parity-check (LDPC) codes over the Gaussian wiretap channel. While several works have already addressed this problem in asymptotic conditions, i.e., under the hypothesis of codewords of infinite length, only a few approaches exist for the finite length regime. We propose an approach to measure the performance...
Finding a compact formal representation of a processor instruction set is important for easier comprehension by the designer, as well as for synthesis of an efficient hardware implementation of the processor's microcontroller. We present a new heuristic algorithm for deriving compact models of processor instruction sets. The algorithm is based on finding similarities between pairs of instructions...
Crowd sourcing programming relies on active participation. One way to get such participation is through an engaging game. Code Hunt (https://www.codehunt.com/) from Microsoft Research is a web-based serious gaming platform with the potential to be leveraged as a crowd sourcing system. In Code Hunt, players create programs by re-engineering against a changing set of test cases. The game has been played...
Lately, several algorithms have been proposed to automatically estimate the quality of video sequences, even some have been included in international standards. However, the majority only provide high performance under particular conditions and with certain types of degradations. Therefore, some proposals have been presented setting out the combination of various quality metrics to improve the performance...
Machine learning based link optimization of wireless communications often relies on past experience, accurate estimation of channel conditions, and theoretical performance models. Typically, theoretical models poorly match given situations, past experiences are limited, and spectrum sensing of noise and channel conditions pose many hurdles. Hence, traditional cognitive radio engines based on genetic...
Given the fast growing nature of software engineering data in online software repositories and open source communities, it would be helpful to analyse these assets to discover valuable information about the software engineering development process and other related data. Big Data Analytics (BDA) techniques and frameworks can be applied on these data resources to achieve a high-performance and relevant...
Physical Unclonable Functions (PUFs) as secure providers for cryptographic keys have gained significant research interest in recent years. Since plain PUF responses are typically unreliable, error-correcting mechanisms are employed to transform a fuzzy PUF response into a deterministic cryptographic key. In this context, Index-Based Syndrome Coding (IBS) has been reported as being provably secure...
The currently standardized GMPLS protocol suite for packet over optical networks relies on hierarchical instances of signaling sessions. Such sessions have to be established and maintained also in transit nodes, leading to complex and weighty control plane implementations. A novel technology called Segment Routing (SR) has been recently proposed to address these issues. SR relies on the source routing...
The icosahedral gradient encoding scheme (GES) is widely used in diffusion MRI community due to its uniformly distributed orientations and rotationally invariant condition number. The major drawback with this scheme is that it is not available for arbitrary number of measurements. In this paper (i) we propose an algorithm to find the icosahedral scheme for any number of measurements. Performance of...
This paper investigates a cooperative transmission scheme for a multi-source single-destination system through signal-superposition-based braid coding. The source nodes take turns to transmit, and each time, a source “overlays” its new data together with (some or all of) what it overhears from its partner(s) using signal superposition, in a way similar to French-braiding the hair. We demonstrate how...
In this paper we present an approach for the generation and coding of 3D video objects where the quality is scalable in a definable manner. At first a production chain for the generation and display of 3D video objects based on image based rendering (IBR) methods is described. Starting with this specific generation chain, issues of applying a scalable coding framework for 3D video objects are discussed...
Developers choose identifiers to name entities during software coding. While these names are lexically restricted by the language, they reflect the understanding of the developer on the requirements that the entity is devoted for. In this paper, we analyze the use of such vocabularies to identify experts on code entities. For a real software development, e-Pol (Management Information System for Federal...
The paper presents analysis of simultaneous use of multiple description coding (MDC) algorithm and multipath routing for IP-based videoconferencing system. Experimental results are given for time division of video stream in two and three substreams, compressed by H.264 codec with different quality factors (Q) and different packet loss rates in network (from 0% to 50%). Video quality is estimated with...
“Mobile Ad Hoc Network” (MANET) is a form of ad hoc network in which the devices are dynamic and configure themselves during the fly. Hence, for an energy efficient and stable communication to be established among the nodes, the nodes must be organized into groups called clusters. Associativity is one among the good metrics that can configure the speed of a node with respect to its neighbour. In the...
With the introduction of laptops, I-phones and world wide web it has become very easy for everyone to assess the information and so much so that the people have started reading newspapers on the run. The set of websites of Punjabi and Hindi newspapers has been prepared. There are sixty three websites of Punjabi and eighty four websites of Hindi newspapers all over the world. Five software tools have...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.