Results 261 to 270 of about 3,487,435 (303)

Preoperative Neuropsychology Subtypes Predict Neuropsychological Change after Temporal Lobe resection

Binding LP, Liu S, Ansara A, Miserocchi A, McEvoy AW, Altmann A, Young A, Duncan JS, Baxendale S, Koepp M, Xiao F.   +10 more
europepmc   +1 more source

Real-world growth outcomes of vosoritide in children with achondroplasia: a single-center cohort study. [PDF]

J Endocr Soc
Regev R, Waksman Y, Cohen-Sela E, Brener A, Dechovich N, Gal M, Borger O, Zeitlin L, Lebenthal Y.   +8 more
europepmc   +1 more source

Remote digital cognitive assessment in a trial-ready Alzheimer's disease cohort: A scalable approach for early intervention studies. [PDF]

Alzheimers Dement (N Y)
Aschenbrenner AJ, Wilks H, Welhaf M, Katteri S, Stout SH, Sliwinski MJ, Benzinger TLS, Gordon B, Li Y, Perrin RJ, Renton A, Wang G, Xiong C, van Dyck CH, Allegri R, Brooks WS, Bechara JA, Jayadev S, Levin J, Mummery CJ, Sanchez-Valle R, Aguillon D, McDade EM, Bateman RJ, Dominantly Inherited Alzheimer Network Trials Unit (DIAN‐TU), Hassenstab J.   +25 more
europepmc   +1 more source

Risk factors and cognitive domain markers of progression in subjective cognitive decline. [PDF]

J Alzheimers Dis
Bubu OM, Mbah AK, Bernard MA, Briggs A, Faustin A, Gurin L, Rao JA, Tall SO, Osorio RS, Masurkar AV.   +9 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the linear span of the p-ary cascaded GMW sequences

Science in China Series F: Information Sciences, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources

The linear span of the frequency hopping sequences in optimal sets

Designs, Codes, and Cryptography, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qi Wang
exaly   +3 more sources

The Generalized Turán Number of Spanning Linear Forests

Graphs and Combinatorics, 2022
Let $\mathcal{F}$ be a family of graphs. A graph $G$ is called \textit{$\mathcal{F}$-free} if for any $F\in \mathcal{F}$, there is no subgraph of $G$ isomorphic to $F$. Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized Turán number of $\mathcal{F}$ is the maximum number of copies of $T$ in an $\mathcal{F}$-free graph on $n ...
Lin-Peng Zhang, Ligong Wang 0001, Jiale Zhou   +2 more
openaire   +1 more source

The Turán number for spanning linear forests

Discrete Applied Mathematics, 2019
For a set of graphs $\mathcal{F}$, the extremal number $ex(n;\mathcal{F})$ is the maximum number of edges in a graph of order $n$ not containing any subgraph isomorphic to some graph in $\mathcal{F}$. If $\mathcal{F}$ contains a graph on $n$ vertices, then we often call the problem a spanning Turán problem.
Jian Wang 0092, Weihua Yang
openaire   +1 more source

A lower bound on the linear span of an FCSR

IEEE Transactions on Information Theory, 2000
Summary: We have derived a lower bound on the linear span of a binary sequence generated by a feedback with carry shift register (FCSR) under the following condition: \(q\) is a power of a prime such that \(q=r^e\) \((e\geq 2)\) and \(r=2p+1\), where both \(r\) and \(p\) are 2-prime.
Changho Seo, Sangjin Lee, Yeoulouk Sung, Keunhee Han, Sangchoon Kim   +4 more
openaire   +3 more sources

Bounds on the linear span of bent sequences

IEEE Transactions on Information Theory, 1983
Bent functions are Boolean functions all of whose Fourier coefficients have constant magnitude. Bent sequences are families of binary sequences that can be generated by employing bent functions to operate as feed- forward nonlinearities upon the contents of a shift-register that has been set up to generate a maximum-length linear-feedback shift ...
P. Vijay Kumar, Robert A. Scholtz
openaire   +3 more sources