Results 31 to 40 of about 531,033 (266)
Pediatric Blood &Cancer, EarlyView.ABSTRACT A lethal round‐cell malignancy with an MN1::ZNF341 fusion has recently been reported in three infants. Here, we describe four further tumors, three in newborns (including monozygotic twins), and one in an adolescent. Detailed clinical, radiological, and histopathological data differentiate these tumors from their main mimics, neuroblastoma and
Thomas R. W. Oliver +25 more
wiley +1 more source
On the proper enumeration of all finite length strings for source coding
Kuwait Journal of ScienceIn the proper enumeration of the binary words, the sequence is arranged as {X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, ...} = {0, 1, 00, 01, 10, 11, 000, 001, 010, ...}.
Bella Bose, Luca G. Tallini
doaj +1 more source
A Universal Random Coding Ensemble for Sample-Wise Lossy Compression
Entropy, 2023 We propose a universal ensemble for the random selection of rate–distortion codes which is asymptotically optimal in a sample-wise sense. According to this ensemble, each reproduction vector, x^, is selected independently at random under the probability ...
Neri Merhav
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Neurotoxicity is a rare, often dose‐limiting adverse effect of methotrexate (MTX) therapy that disproportionally affects Latino children. Factors contributing to the observed disparity are not well understood. This study leveraged admixture mapping to identify genetic regions associated with MTX‐related neurotoxicity susceptibility ...
Rachel D. Harris +24 more
wiley +1 more source
Privacy-utility tradeoff method using multi-variable source coding
Tongxin xuebao, 2015 In the age of big data,data providers need to ensure their privacy,while data analysts need to mine the value of data.So,how to find the privacy-utility tradeoff has become a research hotspot.Current works mostly focus on privacy preserving methods ...
Yong-hao GU, Jiu-chuan LIN
doaj +2 more sources
A Low-Complexity and Asymptotically Optimal Coding Strategy for Gaussian Vector Sources
Entropy, 2019 In this paper, we present a low-complexity coding strategy to encode (compress) finite-length data blocks of Gaussian vector sources. We show that for large enough data blocks of a Gaussian asymptotically wide sense stationary (AWSS) vector source, the ...
Marta Zárraga-Rodríguez +2 more
doaj +1 more source
Information Bottleneck for a Rayleigh Fading MIMO Channel with an Oblivious Relay
Information, 2021 This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel with an oblivious relay. The relay is constrained to operating without knowledge of the codebooks, i.e., it performs oblivious ...
Hao Xu +3 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Germ cell tumors (GCTs) often arise in the ovaries and testes (extracranial) but can also develop in the brain (intracranial). We examined the relationship of individual, family, and community‐level socioeconomic status (SES) with stage of disease at diagnosis in a cohort of pediatric patients with GCT from Children's Oncology Group
Heydon K. Kaddas +7 more
wiley +1 more source
On the Performance of the Cache Coding Protocol
Information, 2018 Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes to increase performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers ...
Behnaz Maboudi +3 more
doaj +1 more source
Gaussian source coding with spherical codes [PDF]
IEEE Transactions on Information Theory, 2002 Summary: A fixed-rate shape-gain quantizer for the memoryless Gaussian source is proposed. The shape quantizer is constructed from wrapped spherical codes that map a sphere packing in \(\mathbb R^{k-1}\) onto a sphere in \(\mathbb R^k\), and the gain codebook is a globally optimal scalar quantizer.
Jon Hamkins, Kenneth Zeger
openaire +1 more source