Results 81 to 90 of about 4,474,845 (304)
An all‐in‐one analog AI accelerator is presented, enabling on‐chip training, weight retention, and long‐term inference acceleration. It leverages a BEOL‐integrated CMO/HfOx ReRAM array with low‐voltage operation (<1.5 V), multi‐bit capability over 32 states, low programming noise (10 nS), and near‐ideal weight transfer.
Donato Francesco Falcone +11 more
wiley +1 more source
A multifunctional nanodiamond platform enables pH‐triggered Diazoxide (DZX) delivery and quantum sensing of subcellular radical dynamics in triple‐negative breast cancer cells. Diamond relaxometry revealed reduced lysosomal radicals during DZX‐induced mitochondrial radical elevation, providing insights into redox modulation and organelle‐ resolved ...
Kaiqui Wu +8 more
wiley +1 more source
Optimum Block Size in Separate Block Bootstrap to Estimate the Variance of Sample Mean for Lattice Data [PDF]
The statistical analysis of spatial data is usually done under Gaussian assumption for the underlying random field model. When this assumption is not satisfied, block bootstrap methods can be used to analyze spatial data.
M. Mohammadzadeh
doaj
Finite-Length Analyses for Source and Channel Coding on Markov Chains
We derive finite-length bounds for two problems with Markov chains: source coding with side-information where the source and side-information are a joint Markov chain and channel coding for channels with Markovian conditional additive noise.
Masahito Hayashi, Shun Watanabe
doaj +1 more source
Bayesian estimation of one-parameter qubit gates
We address estimation of one-parameter unitary gates for qubit systems and seek for optimal probes and measurements. Single- and two-qubit probes are analyzed in details focusing on precision and stability of the estimation procedure.
Barndorff-Nielsen O E +21 more
core +1 more source
Asymptotics for Strassen’s optimal transport problem
In this paper, we consider Strassen's version of optimal transport (OT) problem, which concerns minimizing the excess-cost probability (i.e., the probability that the cost is larger than a given value) over all couplings of two given distributions. We derive large deviation, moderate deviation, and central limit theorems for this problem.
openaire +3 more sources
Observation of Relativistic Domain Wall Motion in Amorphous Ferrimagnets
Domain walls in ferrimagnets and antiferromagnets move as relativistic sine‐Gordon solitons, with the spin‐wave velocity setting their speed limit. Such relativistic domain‐wall motion is demonstrated in amorphous GdFeCo near angular momentum compensation, where current‐driven walls reach 90% of the 2 kms−1 spin‐wave speed, enabling ultrafast, device ...
Pietro Diona +3 more
wiley +1 more source
Achieving Optimal Throughput and Near-Optimal Asymptotic Delay Performance in Multi-Channel Wireless Networks with Low Complexity: A Practical Greedy Scheduling Policy [PDF]
In this paper, we focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in fourth generation (4G) OFDM-based cellular networks.
Gupta, Gagan R. +4 more
core
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +1 more source
Universal entanglement concentration
We propose a new protocol of \textit{universal} entanglement concentration, which converts many copies of an \textit{unknown} pure state to an \textit{% exact} maximally entangled state.
H. Nagaoka +4 more
core +1 more source

