نتایج جستجو برای: fountain

تعداد نتایج: 1470  

Journal: :IEEE Trans. Circuits Syst. Video Techn. 2007
Qian Xu Vladimir Stankovic Zixiang Xiong

The proliferation of video streaming applications that distribute data to a large number of clients motivates the design of fast and reliable multimedia delivery systems capable to adapt effectively to diverse transmission conditions. Receiver-driven layered multicast (RLM) efficiently addresses the issue of heterogeneity in clients’ available bandwidths and packet loss rates by shifting rate c...

2012
Nasser Aly

Background: The healing aspects of natural sounds therapy including water sound are beginning to get a lot of interest in the medical fields. Numerous studies conducted on the value of natural sounds as a therapy for various psychological treatments. Objective: to observe the influence of water fountain melodies on anxiety level among the experimental groups before undergoing dental chec kup an...

Journal: :Computer Communications 2017
George Parisis Vasilis Sourlas Konstantinos V. Katsaros Wei Koong Chai George Pavlou Ian Wakeman

Opportunistic networks can increase network capacity, support collaborative downloading of content and offload traffic from a cellular to a cellular-assisted, device-to-device network. They can also support communication and content exchange when the cellular infrastructure is under severe stress and when the network is down or inaccessible. Fountain coding has been considered as especially sui...

2018
Jonghoon Kang

The adaptive humoral immune system of vertebrates functions by evolving a huge repertoire of binding proteins, which target potentially all molecules that come into contact with developing B cells. The key to endowing these binders with immunological activity is the adjustment of antibody structure and affinity against molecular targets. As a result, antibodies with a wide range of affinities a...

2013
Khaled Farouq Hayajneh Shahram Yousefi

Fountain codes were introduced to provide higher reliability, lower complexities, and more scalability for networks such as the Internet. In this thesis, we study LubyTransform (LT) codes which are the first realization of Fountain codes. In the LT codes, a sparse random factor graph is dynamically generated on both the encoder and decoder sides of the communications channel. The graph is gener...

2002
T. P. Heavner S. R. Jefferts T. E. Parker V. Schweikhard F. Levi

The Time and Frequency Division of the National Institute of Standards and Technology (NIST) is developing a miniature laser-cooled Cs-fountain frequency standard. We anticipate that this device will be useful as a transportable reference for comparison of frequency standards at other laboratories. Additionally, it could be useful for measuring the gravitational clock shift at various locations...

1991
Jian Zhang

In this paper, we investigate the existence of infinitely many solutions for a class of biharmonic equations where the nonlinearity involves a combination of superlinear and asymptotically linear terms. The solutions are obtained from a variant version of Fountain Theorem.

Journal: :CoRR 2014
Suayb S. Arslan

The idea of writing such a technical brief goes back to our days in Quantum corporation, when we were studying efficient coding strategies for cloud storage applications. Having had a thorough review of the literature, I decided to write this document in order to establish a common base ground on which the majority of the relevant research can be analyzed and compared. As far as I am concerned,...

Journal: :JCM 2014
Ahasanun Nessa Michel Kadoch Bo Rong

—In the past few years, joint network-channel coding (JNCC) has drawn significant attention for reliable data communication in wireless network. However, it appears that fixed-rate channel coding is ineffective to make the outage probability to zero without having precise channel state information at the transmitter. To enhance the link robustness and the system throughput, this paper presents...

2010
B. T. Maharaj

A new universal noise-robust lossless compression algorithm based on a decremental redundancy approach with Fountain codes is proposed. The binary entropy code is harnessed to compress complex sources with the addition of a preprocessing system in this paper. Both the whole binary entropy range compression performance and the noise-robustness of an existing incremental redundancy Fountain code ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید