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.
For the functioning of American democracy, the Lobbying Disclosure Act (LDA), for the very first time, provides data to empirically research interest groups behaviors and their influence on congressional policymaking. One of the main research challenges is to automatically find the topic(s), by short & sparse text classification, in a large corpus of unorganized, semi-structured, and poorly...
Wireless sensor networks are very much concerned on conserving power and error control coding is a considerable burden on this power conservation. Thus, this paper proposes a diversity based routing algorithm to achieve the reliability in the absence of error control coding. Two diversity combining techniques are also proposed. The simulation results demonstrate that the proposed routing algorithm...
With the explosive increase of the data by volume in various fields of science, engineering, information services, etc., data-intensive computing has gained significant interest in recent years. Various challenges ranging from efficient peta-scale data management to the adoption of highly scalable cloud computing have become a norm for data center administrators. Highly scalable architectures such...
The scaling down of semiconductor technology in FPGA increases the soft errors due to radiation effects in space. To address this technological challenge a novel coding technique, Counter Matrix Code (CMC) is proposed to protect the SRAM based FPGA's configuration memories (FCM) against radiation induced Multiple Bit Upsets (MBU) with Low cost and maximum correction capability. The proposed CMC is...
Safety of embedded systems has the highest priority because it helps contribute to customer confidence and thereby ensures growth of the new markets, like electromobility. In series production fail-safe systems as well as fault-tolerant systems are realized with redundant hardware concepts like dual core microcontrollers running in lock-step-mode to reach highest safety requirements given by standards,...
In this paper, we investigate the problem of visual information encoding and decoding for face recognition. We propose a decomposition representation with vector quantization and constrained likelihood projection. The optimal solution is considered from the point of view of the best achievable classification accuracy by minimizing the probability of error under a given class of distortions. The performance...
In this paper we propose a novel co-allocation scheme, called a Reliable Multicast Brute-Force co-allocation scheme (ReMBF for short), which employs a reliable multicast (RM for short) technique with the Brute-Force (BF for short) scheme to accelerate data retrieval and delivery, and reliably transmit data to its users for data grids. Several types of data access patterns, including Zipf-like, geometric,...
The recently proposed Glossy protocol demonstrated the high potential of constructive interference (CI) in improving communication performance in wireless sensor networks. This paper presents a network flooding protocol, Ripple, which also exploits CI while improving Glossy in terms of throughput and energy efficiency by a factor of three each. To this end, we propose to pipeline transmissions on...
Multimedia services distribution is very dependent on the quality of the communications link. Due to the nature of the related services, these are usually very sensitive to packet loss, delay and jitter, and hence service quality is immediately worsen in harsh scenarios. This paper proposes an OSI-Layer2 cooperative link layer scheme (known as GalaReS) that remarkably improves the multimedia content...
We investigate the cross-layer design of wireless networks where end-to-end data transmission is subject to delay constraint and there is no end-to-end feedback. The transmission is coded by random linear network coding (RLNC) on packet level to recover from packet erasures and by forward error-correction coding (FEC) on bit level to combat channel distortions. Based on the two-layer model developed...
Endurance and retention are measured in 1Xnm Triple Level Cell (TLC) NAND and the flexible nLC scheme (flex-nLC) is proposed to improve reliability. This method enables the use of lowest-cost TLC NAND as is, in long term storage applications such as cold flash and digital archive: millennium memory, which have 20 and 1000 years retention, respectively.
Endurance and retention are measured in 1Xnm Triple Level Cell (TLC) NAND and the flexible nLC scheme (flex-nLC) is proposed to improve reliability. This method enables the use of lowest-cost TLC NAND as is, in long term storage applications such as cold flash and digital archive: millennium memory, which have 20 and 1000 years retention, respectively.
Consider a symmetric primitive relay channel, where, the source X wants to send information to the destination Y with the help of a relay Z, the relay Z can communicate to the destination Y via an error-free digital link of rate R0, and Y, Z are conditionally independent and identically distributed given X. This paper presents two new upper bounds on the capacity of such relay channels, where the...
In this paper, a wiretap channel where the transmitter and receiver communicate through a discrete memoryless channel, and the eavesdropper (Eve) has perfect access to a fixed fraction of transmitted symbols (of its choosing) is considered. An outer bound for the rate-equivocation region of the channel, for all such fractions, is derived. An achievable scheme, which provides an inner bound for the...
The digital contents in large distributed storage systems may have different reliability and access delay requirements, and for this reason, erasure codes with different strengths need to be utilized to achieve the best storage efficiency. At the same time, in such large distributed storage systems, nodes fail on a regular basis, and the contents stored on them need to be regenerated and stored on...
The problem of multicasting multi-messages over Gaussian broadcast channels with receiver message side information is investigated for K = 3 receivers. The problem generalizes various broadcasting scenarios where the receivers have some message side information, including broadcasting with common message. Based on rate splitting, network coding and Gelfand-Pinsker coding, a successive coding scheme...
This paper presents a polar coding scheme for fading wiretap channels that achieves reliability as well as security without the knowledge of instantaneous channel state information at the transmitter. Specifically, a block fading model is considered for the wiretap channel that consists of a transmitter, a receiver, and an eavesdropper; and only the information regarding the statistics (i.e., distribution)...
We present a new achievable rate region for the two-user binary-input classical-quantum broadcast channel. The result is a generalization of the classical Marton-Gelfand-Pinsker region and is provably larger than the best previously known rate region for classical-quantum broadcast channels. The proof of achievability is based on the recently introduced polar coding scheme and its generalization to...
We propose a base-station (BS) cooperation model for broadcasting a discrete memoryless source in a cellular or heterogeneous network. The model allows the receivers to use helper BSs to improve network performance, and it permits the receivers to have prior side information about the source. We establish the model's information-theoretic limits in two operational modes: In Mode 1, the helper BSs...
An open problem in polarization theory is to determine the binary operations that always lead to polarization when they are used in Arıkan style constructions. This paper solves this problem by providing a necessary and sufficient condition for a binary operation to be polarizing. The characterization is given in terms of a new mathematical framework that we introduce. We show that a binary operation...
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.