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

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

Journal: :CoRR 2005
Daisuke Kobayashi Hirosuke Yamamoto Tomohiro Ogawa

It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity CS , which is usually smaller than the channel capacity C. In order to remove the loss C−CS , we propose a multiplex coding scheme with plural independent messages. In this paper, it is shown that the proposed multipl...

Journal: :Electronic Notes in Discrete Mathematics 2015
L. Elisa Celis Filip Pavetic Brunella Spinelli Patrick Thiran

This paper considers the problem of source localization on graphs. We assume that a diffusion process on a graph is partially observed, i.e., that only the time at which some of the vertices are reached by the diffusion is known, and we want to identify the vertex that initiated the diffusion. In particular, we address the problem of choosing a fixed number of sensor vertices based on whose dif...

2006
Tao Jia

This thesis investigates the performances of the Rake receiving and the Transmitted Reference (TR) schemes for Ultra Wideband (UWB) communication systems. UWB technology has been proposed as a promising physical layer candidate for indoor wireless c:ommunications, because it offers very fine time resolution and multipath resolvability. Hovlrever, these beneficial properties also pose great chal...

Journal: :Journal of biomedical optics 2011
David D-U Li Jochen Arlt David Tyndall Richard Walker Justin Richardson David Stoppa Edoardo Charbon Robert K Henderson

A high-speed and hardware-only algorithm using a center of mass method has been proposed for single-detector fluorescence lifetime sensing applications. This algorithm is now implemented on a field programmable gate array to provide fast lifetime estimates from a 32 × 32 low dark count 0.13 μm complementary metal-oxide-semiconductor single-photon avalanche diode (SPAD) plus time-to-digital conv...

Journal: :Revista da Escola de Enfermagem da U S P 2013
Lidiane Lima de Andrade Maria Miriam Lima da Nóbrega Maria Eliane Moreira Freire Renata Valeria Nóbrega

The aim of this exploratory descriptive study was to create nursing diagnosis statements for hospitalized clients based on the Database of Special Nursing Language Terms of the Infectious Diseases Clinic of a teaching hospital and on the ICNP®. Further, we aimed to validate the diagnosis statements with the participation of clinical nurses and nursing teachers who worked at the clinic. Eighty-e...

Journal: :Revista da Escola de Enfermagem da U S P 2012
Tatiane Baratieri Edir Nei Teixeira Mandu Sonia Silva Marcon

The present study aimed at describing nurses' perceptions regarding care under the perspective of longitudinality. This descriptive-exploratory qualitative study was performed in April 2010 with twenty family health nurses from cities of the 10th Regional Health District of Paraná, using semi-structured interviews. The data were submitted to content analysis. Results pointed at the following ca...

Journal: :IEEE Trans. Information Theory 1996
Dharmendra S. Modha Elias Masry

The minimum complexity regression estimation framework, due to Andrew Barron, is a general data-driven methodology for estimating a regression function from a given list of parametric models using independent and identically distributed (i.i.d.) observations. We extend Barron’s regression estimationframework tom-dependent observations and to stronglymixing observations. In particular, we propos...

2015
Jingbo Liu Paul W. Cuff Sergio Verdú

We study the amount of randomness needed for an input process to approximate a given output distribution of a channel in the Eγ distance. A general one-shot achievability bound for the precision of such an approximation is developed. In the i.i.d. setting where γ = exp(nE), a (nonnegative) randomness rate above infQU:D(QX||πX)≤E{D(QX||πX) + I(QU, QX|U)−E} is necessary and sufficient to asymptot...

Journal: :European Transactions on Telecommunications 2003
Steven R. Weller Sarah J. Johnson

This paper presents a construction of low-density parity-check (LDPC) codes based on the incidence matrices of oval designs. The new LDPC codes have regular parity-check matrices and Tanner graphs free of 4-cycles. Like the finite geometry codes, the codes from oval designs have parity-check matrices with a large proportion of linearly dependent rows and can achieve significantly better minimum...

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

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