Results 261 to 270 of about 771,251 (387)

EGGNet, a Generalizable Geometric Deep Learning Framework for Protein Complex Pose Scoring

open access: yesACS Omega
Zichen Wang   +9 more
doaj   +1 more source

Functional Connectivity to the Cerebellum and Resting‐State Networks Predict Earlier Improvement of Dystonia Following Globus Pallidus Internus‐Deep Brain Stimulation (GPi‐DBS)

open access: yesMovement Disorders, EarlyView.
Early improvement of dystonia after globus pallidus internus‐deep brain stimulation (GPi‐DBS) is associated with stimulation of the globus pallidus externus‐subthalamic nucleus (GPe‐STN) fibers and the lenticular fasciculus. Functional connectivity to the cerebellar cortex and the limbic and default mode networks predict early improvement of symptoms ...
A. Enrique Martinez‐Nunez   +9 more
wiley   +1 more source

Large-scale crustal growth driven by LIP magmatism during the Paleoproterozoic. [PDF]

open access: yesNat Commun
Simões MS   +6 more
europepmc   +1 more source

Conditional Generative Modeling for Enhanced Credit Risk Management in Supply Chain Finance

open access: yesNaval Research Logistics (NRL), EarlyView.
ABSTRACT The rapid expansion of cross‐border e‐commerce (CBEC) has created significant opportunities for small‐ and medium‐sized sellers, yet financing remains a critical challenge due to their limited credit histories. Third‐party logistics (3PL)‐led supply chain finance (SCF) has emerged as a promising solution, leveraging in‐transit inventory as ...
Qingkai Zhang, L. Jeff Hong, Houmin Yan
wiley   +1 more source

Updating the frequency of CCR5Δ32 in Brazil: Descriptive analysis of malaria cases and controls from Acre State, Amazon region. [PDF]

open access: yesGenet Mol Biol
Ziliotto M   +5 more
europepmc   +1 more source

Drought Sensitivity of the Amazon Rainforest

open access: yesScience, 2009
O. Phillips   +65 more
semanticscholar   +1 more source

Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs

open access: yesNetworks, EarlyView.
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy