Results 71 to 80 of about 309,095 (284)

Clustering Algorithm Reveals Dopamine‐Motor Mismatch in Cognitively Preserved Parkinson's Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To explore the relationship between dopaminergic denervation and motor impairment in two de novo Parkinson's disease (PD) cohorts. Methods n = 249 PD patients from Parkinson's Progression Markers Initiative (PPMI) and n = 84 from an external clinical cohort.
Rachele Malito   +14 more
wiley   +1 more source

Neutral Rhenadicarbaboranes with Re(CO)2(NO) Vertices: A Theoretical Study of Building Blocks for Rhenacarborane-Based Drug Delivery Agents

open access: yesMolecules, 2019
The rhenadicarbaborane carbonyl nitrosyls (C2Bn−3Hn−1)Re(CO)2(NO), (n = 8 to 12), of interest in drug delivery agents based on the experimentally known C2B9H11Re(CO)2(NO) and related species, have been investigated by density functional ...
Amr A. A. Attia   +3 more
doaj   +1 more source

Vertex degrees of planar graphs

open access: yesJournal of Combinatorial Theory, Series B, 1979
AbstractLet G be a planar graph having n vertices with vertex degrees d1, d2,…,dn. It is shown that Σi=1ndi2 ≤ 2n2 + O(n). The main term in this upper bound is best possible.
openaire   +1 more source

Bistable Mechanisms 3D Printing for Mechanically Programmable Vibration Control

open access: yesAdvanced Engineering Materials, EarlyView.
This work introduces a 3D‐printed bistable mechanism integrated into tuned mass dampers (TMDs) for mechanically adaptive passive vibration suppression. Through optimized geometry, the bistable design provides adaptable vibration reduction across a broad range of scenarios, achieving effective vibration mitigation without complex controls or external ...
Ali Zolfagharian   +4 more
wiley   +1 more source

On the Number of Spanning Trees of Graphs

open access: yesThe Scientific World Journal, 2014
We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Δ1), minimum vertex degree (δ), …first Zagreb index (M1), and Randić index (R-1).
Ş. Burcu Bozkurt, Durmuş Bozkurt
doaj   +1 more source

3D‐Printed Serial Snap‐Through Architectures for Programmable Mechanical Response

open access: yesAdvanced Engineering Materials, EarlyView.
A serial snap‐through architecture is realized using compact 3D‐printed von Mises truss units arranged in a staged cascade. Their geometry and boundary conditions program multistage mechanical responses with plateaux and re‐hardening regimes. An inverted‐compliance model predicts these behaviors and enables analytical design of programmable force ...
Filipe A. Santos
wiley   +1 more source

On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion [PDF]

open access: yes, 2014
In this paper, we investigate the approximability of two node deletion problems. Given a vertex weighted graph $G=(V,E)$ and a specified, or "distinguished" vertex $p \in V$, MDD(min) is the problem of finding a minimum weight vertex set $S \subseteq V ...
Devi, N Safina   +2 more
core  

The largest component in a subcritical random graph with a power law degree distribution

open access: yes, 2008
It is shown that in a subcritical random graph with given vertex degrees satisfying a power law degree distribution with exponent $\gamma>3$, the largest component is of order $n^{1/(\gamma-1)}$.
Janson, Svante
core   +4 more sources

ON THE DISTRIBUTION OF THE SECOND DEGREES OF CONFIGURATION GRAPHS VERTICES

open access: yesTransactions of the Karelian Research Centre of the Russian Academy of Sciences, 2019
The object is configuration graphs with N vertices, numbered from 1 to N, whosevertex degrees are independent identically distributed random variables.
Elena Khvorostyanskaya
doaj   +1 more source

Bias‐Free Highly Efficient and Stable Dye‐Sensitized Photoelectrochemical Cells via Cascade Charge Transfer

open access: yesAdvanced Functional Materials, EarlyView.
A buried‐junction DSPEC design is introduced that leverages cascade charge transfer to enhance efficiency, stability, and versatility. This approach facilitates effective charge transfer and minimizes recombination losses, leading to significant improvements.
Jun‐Hyeok Park   +8 more
wiley   +1 more source

Home - About - Disclaimer - Privacy