Results 181 to 190 of about 1,561,137 (279)
Flow-Guided Mimicry Covert Communication over Learned Legitimate OFDM Signal Manifolds. [PDF]
Feng Q, Zhang J, Li M, Chen L.
europepmc +1 more source
Joint Design of Polar Coding and Physical Network Coding for Two-User Downlink Non-Orthogonal Multiple Access. [PDF]
Xie Z, Chen P, Li Y.
europepmc +1 more source
Quantifying coastal ocean anthropogenic carbon changes and their uncertainties
Abstract Despite recent progress in quantifying anthropogenic carbon (Canth) in global oceans, coastal regions remain understudied due to methodological and observational challenges. Here, we develop and generalize a Regional rEgression–based Coastal Anthropogenic carbon estimation algorithm (RECA) designed specifically for coastal environments ...
Xinyu Li, Brendan Carter
wiley +1 more source
5G/6G Networks for Wireless Communication and IoT. [PDF]
Suraci C, Araniti G.
europepmc +1 more source
Abstract Progressive supranuclear palsy is a rare and rapidly progressive neurodegenerative syndrome. Clinical manifestations are heterogeneous and include Parkinsonism, postural instability, oculomotor dysfunction and cognitive impairment, with 80% of patients progressing to dementia within 3 years. Cognitive impairment is consistently associated with
Timothy P. Siejka +4 more
wiley +1 more source
Short-Packet Communications in Multi-Antenna Cooperative NOMA Networks with Hardware Impairments. [PDF]
Zhang X +5 more
europepmc +1 more source
ABSTRACT Purpose Gap‐filled zero echo time (ZTE) acquisitions combined with dedicated short‐T2 hardware enable direct collagen imaging on the timescale of macromolecular (MM) signals, with T2s ˜ 10 μs. However, present methods offer limited depiction fidelity, and their specificity towards MM content is poorly understood. This work presents methodology
Jason Daniel van Schoor +3 more
wiley +1 more source
Quasi-Optimal Path Convergence-Aided Automorphism Ensemble Decoding of Reed-Muller Codes. [PDF]
Tian K, Sun H, Liu Y, Liu R.
europepmc +1 more source
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
Low-Complexity Automorphism Ensemble Decoding of Reed-Muller Codes Using Path Pruning. [PDF]
Tian K, Liu R, Lu Z.
europepmc +1 more source

