Results 51 to 60 of about 864,269 (299)

Sparse and shift-invariant representations of music

, 2006
Redundancy reduction has been proposed as the main computational process in the primary sensory pathways in the mammalian brain. This idea has led to the development of sparse coding techniques, which are exploited in this article to extract salient ...
Mike Davies, Blumensath, Thomas, Davies, Mike, Thomas Blumensath   +3 more
core   +1 more source

Erasure codes with a banded structure for hybrid iterative-ML decoding [PDF]

, 2009
This paper presents new FEC codes for the erasure channel, LDPC-Band, that have been designed so as to optimize a hybrid iterative-Maximum Likelihood (ML) decoding.
Soro, Alexandre, Alexandre Soro, Lacan, Jérôme, Cunche, Mathieu, Mathieu Cunche, Vincent Roca, Roca, Vincent, Jerome Lacan   +7 more
core   +1 more source

Diversity and complexity in neural organoids

FEBS Letters, EarlyView.
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley   +1 more source

Design and analysis strategies for robust microbiome ageing research

FEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik, İsmail Güderer, Yi Wang, Tayyaba Alvi, Prasoon Pandey, Handan Melike Dönertaş   +5 more
wiley   +1 more source

Sparse Grassmannian Design for Noncoherent Codes via Schubert Cell Decomposition

IEEE Open Journal of the Communications Society
In this paper, we propose a method for designing sparse Grassmannian codes for noncoherent multiple-input multiple-output systems. Conventional pairwise error probability formulations under uncorrelated Rayleigh fading channels fail to account for rank ...
Joe Asano, Yuto Hama, Hiroki Iimori, Chandan Pradhan, Szabolcs Malomsoky, Naoki Ishikawa   +5 more
doaj   +1 more source

Robust Dictionary Learning and Sparse Coding With Riemannian Geometry Preserving Method in Symmetric Matrices Inner Product Space

IEEE Access, 2020
Existing Dictionary Learning and Sparse Coding (DLSC) algorithms for Symmetric Positive Definite (SPD) matrices usually adopt Reproducing Kernel Hilbert Space as workspace to perform necessary linear operations.
Yang Zhang, Yuesheng Zhu
doaj   +1 more source

Fast computation of cyclic convolutions and their applications in code-based asymmetric encryption schemes

Моделирование и анализ информационных систем, 2023
The development of fast algorithms for key generation, encryption and decryption not only increases the efficiency of related operations. Such fast algorithms, for example, for asymmetric cryptosystems on quasi-cyclic codes, make it possible to ...
Andrey N. Sushko, Boris Y. Steinberg, Kirill V. Vedenev, Anton A. Glukhikh, Yury V. Kosolapov   +4 more
doaj   +1 more source

Gut microbiota alterations in patients with non‐small‐cell lung cancer undergoing chemoradiotherapy

Molecular Oncology, EarlyView.
We investigated the impact of concurrent chemoradiotherapy (CRT) on the gut microbiota in patients with locally advanced non‐small‐cell lung cancer. Overall gut microbiota composition remained largely stable throughout CRT while antibiotic exposure may influence microbial diversity.
Hanne Marte Nymoen, Zhi Zhao, Henrik Horndalsveen, Maria Moksnes Bjaanæs, Bjørn Henning Grønberg, Tarje Halvorsen, Tesfaye Madebo, Marianne Aanerud, Jussi Koivunen, Kersti Oselin, Saulius Cicenas, Nina Helbekkmo, Jarkko Ahvonen, Maria Silvoniemi, Tine Norman Alver, Tonje Dalen, Åsa Kristina Öjlert, Saima Jamil Farooqi, Åslaug Helland, Vilde Drageset Haakensen   +19 more
wiley   +1 more source

Monte Carlo methods for adaptive sparse approximations of time-series

, 2007
This paper deals with adaptive sparse approximations of time-series. The work is based on a Bayesian specification of the shift-invariant sparse coding model.
Michael E. Davies, Davies, Mike E., Blumensath, Thomas, Thomas Blumensath   +3 more
core   +1 more source

sparse-ir: Optimal compression and sparse sampling of many-body propagators

SoftwareX, 2023
We introduce sparse-ir, a collection of libraries to efficiently handle imaginary-time propagators, a central object in finite-temperature quantum many-body calculations. We leverage two concepts: firstly, the intermediate representation (IR), an optimal
Markus Wallerberger, Samuel Badr, Shintaro Hoshino, Sebastian Huber, Fumiya Kakizawa, Takashi Koretsune, Yuki Nagai, Kosuke Nogaki, Takuya Nomoto, Hitoshi Mori, Junya Otsuki, Soshun Ozaki, Thomas Plaikner, Rihito Sakurai, Constanze Vogel, Niklas Witt, Kazuyoshi Yoshimi, Hiroshi Shinaoka   +17 more
doaj   +1 more source