Results 71 to 80 of about 423,241 (305)

Microbiome−host proteostasis crosstalk—An emerging perspective on mechanisms and interventions toward healthy longevity

FEBS Letters, EarlyView.
Proteostasis and the gut microbiota play a key role in shaping host physiology. Microbiota‐derived metabolites, vitamins, and RNA modulate host proteostasis. Findings from model systems, including C. elegans, indicate microbes can either stabilize or disrupt host proteostasis.
Abhishek Anil Dubey, Maria Ermolaeva
wiley   +1 more source

Low-Latency Communication with Computational Complexity Constraints

, 2019
Low-latency communication is one of the most important application scenarios in next-generation wireless networks. Often in communication-theoretic studies latency is defined as the time required for the transmission of a packet over a channel.
Hasan Basri Celebi, Pitarokoilis, Antonios,, Mikael Skoglund, Celebi, Hasan Basri,, Antonios Pitarokoilis, Skoglund, Mikael,   +5 more
core   +1 more source

Information-based measure of nonlocality

New Journal of Physics, 2016
Quantum nonlocality concerns correlations among spatially separated systems that cannot be explained classically without communication among the parties.
Alberto Montina, Stefan Wolf
doaj   +1 more source

PARK(ing) time–How park deficiency affects the biological clock in a Drosophila model of Parkinson's disease

FEBS Letters, EarlyView.
Drosophila park mutants serve as a model for Parkinson's disease. We used this strain to investigate the connection between oxidative stress and the circadian clock mechanism. We showed that increased oxidative stress affects the physiology of pacemaker cells, disrupting their daily structural plasticity. Lack of rhythmic signaling from pacemaker cells
Kamila Zientara, Kinga Skoczek, Elzbieta Pyza, Milena Damulewicz   +3 more
wiley   +1 more source

Round Elimination in Exact Communication Complexity

, 2015
We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity.
Speelman, Florian, Leung, D., König, R., Buhrman, Harry, Briët, J., Speelman, F., Piovesan, T., Piovesan, Teresa, Koenig, R., Buhrman, H., Beigi, S., Briët, Jop   +11 more
core   +1 more source

Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment

Molecular Oncology, EarlyView.
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley   +1 more source

Decentralized Inexact Cubic Newton Method With Consensus Procedure

IEEE Access
Distributed optimization is widely used in large-scale and privacy-preserving machine learning, where each agent stores a local objective and communicates only with its neighbors in a connected network.
Artem Agafonov, Anton Novitskii, Alexander Rogozin, Yury Sokolov, Dmitry Kamzolov, Alexander G. Dyakonov, Martin Takac, Alexander Gasnikov   +7 more
doaj   +1 more source

Discrimination of Non-Local Correlations

Entropy, 2019
In view of the importance of quantum non-locality in cryptography, quantum computation, and communication complexity, it is crucial to decide whether a given correlation exhibits non-locality or not.
Alberto Montina, Stefan Wolf
doaj   +1 more source

Entanglement-based quantum communication complexity beyond Bell nonlocality

npj Quantum Information, 2022
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks, such as parallel computation and circuit optimisation.
Joseph Ho, George Moreno, Samuraí Brito, Francesco Graffitti, Christopher L. Morrison, Ranieri Nery, Alexander Pickston, Massimiliano Proietti, Rafael Rabelo, Alessandro Fedrizzi, Rafael Chaves   +10 more
doaj   +1 more source

The Quantum Communication Complexity of Sampling [PDF]

SIAM Journal on Computing, 2002
Summary: Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function \(f: X \times Y \rightarrow \{0,1\}\) and a probability distribution \({\mathcal D}\) over \(X \times Y\), we define the sampling complexity of \((f, {\mathcal D})\) as the minimum number of bits that Alice ...
Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson   +4 more
openaire   +3 more sources