Results 101 to 110 of about 423,241 (305)

Hunger and Obesity as Symptoms of Non-Sustainable Food Systems and Malnutrition

open access: yesApplied Sciences, 2019
Among the great challenges the world faces are how to ensure food security for its growing population—projected to rise to around 10 billion by 2050—so it can meet their nutritional needs for a healthy life.
Gerald Steiner   +2 more
doaj   +1 more source

Molecular dynamics simulations of positively selected codons in FcγRI reveal novel biochemical binding properties

open access: yesFEBS Open Bio, EarlyView.
Evolutionary analysis across 32 placental mammals identified positive selection at residues H148 and W149 in the immune receptor FcγR1. Ancestral reconstruction combined with molecular dynamics simulations reveals how these mutations may influence receptor structure and dynamics, providing insight into the evolution of antibody recognition and immune ...
David A. Young   +7 more
wiley   +1 more source

Guiding AlphaFold to predict how Munc13‐1 opens Syntaxin‐1

open access: yesFEBS Open Bio, EarlyView.
The syntaxin‐1 Habc‐domain (orange), linker (pink) and SNARE motif (yellow) form a closed conformation that binds to Munc18‐1 (violet) and is opened by the Munc13‐1 MUN domain (cyan) to form the SNARE complex that triggers neurotransmitter release.
Madhurima Chattopadhyay   +2 more
wiley   +1 more source

Statistical framework for video decoding complexity modeling and prediction

open access: yes, 2009
Video decoding complexity modeling and prediction is an increasingly important issue for efficient resource utilization in a variety of applications, including task scheduling, receiver-driven complexity shaping, and adaptive dynamic voltage scaling.
Andreopoulos, Y   +2 more
core  

Approximation norms and duality for communication complexity lower bounds

open access: yes, 2008
: We will discuss a general norm based framework for showing lower bounds on communication complexity. An advantage of this approach is that one can use duality theory to obtain a lower bound quantity phrased as a maximization problem, which can be ...
Shraibman, Adi, Lee, Troy
core   +1 more source

Kolmogorov Complexity and Combinatorial Methods in Communication Complexity

open access: yesTheoretical Computer Science, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marc Kaplan, Sophie Laplante
openaire   +2 more sources

From energy provision to protein synthesis: Tunnelling nanotubes as mediators of intercellular metabolic cooperation in cancer

open access: yesFEBS Open Bio, EarlyView.
The cytoskeleton‐mediated transport of mitochondria via tunnelling nanotubes restores respiration, increases ATP production, rescues cells from apoptosis, activates the AKT/mTOR signalling pathway, promotes cell migration and invasiveness, contributes to cancer progression and treatment resistance.
Stanislava Martínková, Jan Trnka
wiley   +1 more source

Query-to-Communication Lifting

open access: yes, 2019
This will be a tutorial-style talk, with a particular focus on the following result. For any n-bit boolean function $f$, we show that the randomized communication complexity of the composed function $f o g^n$, where $g$ is a small index gadget, is ...
Göös, Mika
core  

Artificial Intelligence and Mental Well‐Being in Adult Education: Implications for Practice and Professional Responsibility

open access: yesNew Directions for Adult and Continuing Education, EarlyView.
ABSTRACT Mental well‐being is central to adult learner success, yet many adult education institutions lack capacity to provide timely and accessible support. This article examines how artificial intelligence (AI) can strengthen mental health–adjacent supports in adult and continuing higher education, with attention to professional practice and ...
Adam L. McClain, Thomas Wade
wiley   +1 more source

Hybrid Quantum Cryptography from Communication Complexity [PDF]

open access: yesQuantum
We introduce an explicit construction for a key distribution protocol in the Quantum Computational Timelock (QCT) security model, where one assumes that computationally secure encryption may only be broken after a time much longer than the coherence time
Francesco Mazzoncini   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy