Results 61 to 70 of about 91,802 (164)

Hamming Distance Oracle

CoRR
In this paper, we present and study the \emph{Hamming distance oracle problem}. In this problem, the task is to preprocess two strings $S$ and $T$ of lengths $n$ and $m$, respectively, to obtain a data-structure that is able to answer queries regarding the Hamming distance between a substring of $S$ and a substring of $T$. For a constant size alphabet
Itai Boneh, Dvir Fried, Shay Golan 0001, Matan Kraus   +3 more
openaire   +2 more sources

A note on Hamming spheres

Discrete Mathematics, 1985
The purpose of the paper is to prove in a more natural way three theorems, which were found by \textit{J. Körner} and \textit{V. K. Wei} [Discrete Math. 51, 147--165 (1984; Zbl 0547.05004)]. The first two theorems are concerned with subsets of \(\mathbb F^ n_ 2\), having inner distance \(\geq 2\) and attaining minimal boundary.
openaire   +2 more sources

HamSCI HF multipath propagation mode analysis using amateur radios and audio waveforms sensitive to time difference of arrival

Frontiers in Astronomy and Space Sciences
This study describes a method to deduce the ionization layer virtual height and propagation path geometry responsible for communication between two HF radio stations a fixed distance apart.
Stephen A. Cerwin, Jesse T. McMahan, Alexandros S. Papadopoulos, Alexandros S. Papadopoulos, Gerard N. Piccini, Gerard N. Piccini, Nathaniel A. Frissell, Nathaniel A. Frissell, Kristina V. Collins, Kristina V. Collins, Aidan Montare, Paul Bilberry, Samuel Blackshear, David R. Themens, David R. Themens   +14 more
doaj   +1 more source

Consistency verification and interpretation of explainable AI for predicting annual home runs of professional baseball players from sensor data

Scientific Reports
This study aimed to verify and interpret a model for predicting the number of home runs per year using sensor data from professional baseball players during batting practice.
Shohei Shibata, Yuto Kase, Yusuke Yoshikawa, Kai Ishibe, Takaki Nomoto, Tetsuya Ijiri, Yasuhiro Tahara, Yuta Yamaguchi   +7 more
doaj   +1 more source

Burning Hamming graphs

Graphs and Combinatorics
The Hamming graph $H(n,q)$ is defined on the vertex set $[q]^n$ and two vertices are adjacent if and only if they differ in precisely one coordinate. Alon \cite{Alon} proved that the burning number of $H(n,2)$ is $\lceil\frac n2\rceil+1$. In this note we give a short proof of a fact that the burning number of $H(n,q)$ is $(1-\frac 1q)n+O(\sqrt{n\log n})
openaire   +3 more sources

Erratum to: Intersection of Hamming codes avoiding Hamming subcodes [PDF]

Designs, Codes and Cryptography, 2014
Josep Rifà, Faina I. Solov'eva, Mercè Villanueva   +2 more
openaire   +1 more source

Fecal Microbiota Transplantation Improves Biota and Hepatic Metabolism, Promoting Growth in SD Rats Under Hypobaric Hypoxia Exposure. [PDF]

Microorganisms
Bao S, Xu S, Wang Z, Chai S, Wang S, Dai D, Wang X, Lv J.   +7 more
europepmc   +1 more source

Evaluating a Dual Digital Cognitive Behavioral Therapy and Health and Wellness Coaching Intervention for Anxiety and Depression: Single-Arm Pilot Study. [PDF]

JMIR Hum Factors
Kirk A, King CS, Gallop R, Doan BD, Simpson Rowe L, Randa LE.   +5 more
europepmc   +1 more source

Therapeutic Approaches for HTLV-1-Associated Myelopathy/Tropical Spastic Paraparesis: Current and Emerging Strategies. [PDF]

Pathogens
Nakamura T, Satoh K.
europepmc   +1 more source

Early Trajectory of Depressive Symptoms in Alcohol Dependence: Insights From a Four-Week Clinical Decision Window. [PDF]

Cureus
Raja D, Singh A, Singh H.
europepmc   +1 more source