Results 51 to 60 of about 19,018 (206)

Using large language models to automate herbarium specimen transcription: A case study at the Missouri Botanical Garden

open access: yesPLANTS, PEOPLE, PLANET, EarlyView.
Biological specimens housed in natural history collections are indispensable resources for documenting where species occur and how they have changed through time, and are thus vital for combating biodiversity loss. Digitization of these collections promises to make these critical resources globally available.
Matthew W. Austin   +4 more
wiley   +1 more source

Blind Decoding of Multiple Description Codes over OFDM Systems via Sequential Monte Carlo

open access: yesEURASIP Journal on Wireless Communications and Networking, 2005
We consider the problem of transmitting a continuous source through an OFDM system. Multiple description scalar quantization (MDSQ) is applied to the source signal, resulting in two correlated source descriptions.
Guo Dong, Wang Xiaodong, Yang Zigang
doaj   +2 more sources

An Efficient Polar Coding Scheme for Uplink Data Transmission in Narrowband Internet of Things Systems

open access: yesIEEE Access, 2020
Narrowband Internet of Things (NB-IoT) is an emerging IoT cellular-based wireless technology that builds based on the existing LTE standard to extend its network coverage suited for Low Power Wide Area Network (LPWAN) connectivity.
Rabiu Sale Zakariyya   +4 more
doaj   +1 more source

Irregular Turbo Codes in Block-Fading Channels

open access: yes, 2010
We study irregular binary turbo codes over non-ergodic block-fading channels. We first propose an extension of channel multiplexers initially designed for regular turbo codes.
Boutros, Joseph J.   +2 more
core   +1 more source

Multitype Game Optimisation: A Two‐Stage Fine‐Tuning Framework for Multi‑Game Optimisation With Large Language Models

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Large language models (LLMs) have made remarkable advances in natural language processing, demonstrating great potential in modelling structured sequences. However, adapting these capabilities to machine gaming tasks such as Go remains challenging due to limitations in strategy generalisation and optimisation efficiency.
Xiali Li   +5 more
wiley   +1 more source

The modified Max-Log-MAP turbo decoding algorithm by extrinsic information scaling for wireless applications [PDF]

open access: yes, 2009
The iterative nature of turbo-decoding algorithms increases their complexity compare to conventional FEC decoding algorithms. Two iterative decoding algorithms, Soft-Output-Viterbi Algorithm (SOVA) and Maximum A posteriori Probability (MAP) Algorithm ...
Kale, I.   +5 more
core  

Non-recursive max* operator with reduced implementation complexity for turbo decoding [PDF]

open access: yes, 2012
In this study, the authors deal with the problem of how to effectively approximate the max?? operator when having n > 2 input values, with the aim of reducing implementation complexity of conventional Log-MAP turbo decoders.
Berrou   +6 more
core   +1 more source

Lower density of calretinin‐immunopositive neurons in the putamen of subjects with schizophrenia

open access: yesJournal of Anatomy, Volume 246, Issue 4, Page 505-516, April 2025.
Recent neuroimaging and histological studies highlight the striatum as a key area involved in SCH, but the specific impairment of neuronal subtypes in subcortical structures is not fully understood. This study is the first detailed investigation of neuroanatomical changes in the putamen in SCH, specifically examining the density of calretinin ...
Paz Kelmer   +4 more
wiley   +1 more source

Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes

open access: yes, 2010
We study fountain codes transmitted over the binary-input symmetric-output channel. For channels with small capacity, receivers needs to collects many channel outputs to recover information bits.
Kasai, Kenta, Sakaniwa, Kohichi
core   +1 more source

On optimal and near-optimal turbo decoding using generalized max operator [PDF]

open access: yes, 2009
Motivated by a recently published robust geometric programming approximation, a generalized approach for approximating efficiently the max* operator is presented.
Martina, Maurizio   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy