Results 81 to 90 of about 5,642,848 (291)

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

Evaluating the Readability of Patient‐Facing Online Educational Materials for Pediatric Leukemia and Lymphoma

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Together, leukemia and lymphoma account for 38.7% of newly diagnosed pediatric cancer cases in the United States each year. Many caregivers utilize online resources to inform medical health decisions. Understanding the readability of these materials is critical to ensuring comprehensible patient education.
Chloe Strege, Simone Intriago Tito, Courtney Popp, William C. Miller, Cindy Eide, Christen Ebens, Jakub Tolar   +6 more
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

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

Impact of Japan's 2024 Physician Work‐Style Reform on Pediatric Hematology–Oncology: Educational Implications in a 2‐Year Survey

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Japan's 2024 physician work‐style reform introduced legally binding limits on physicians’ working hours, but its impact on education and workforce sustainability in pediatric hematology–oncology (PHO) remains unclear. Procedure We conducted a repeated cross‐sectional study with structured quantitative items and free‐text responses ...
Kiyohiko Kaizu, Masaharu Akiyama, Toshikazu Itabashi, Jun Hayakawa, Takahiro Kikuchi, Ryohei Fukunaga, Katsuyoshi Koh, Takahiro Ueda   +7 more
wiley   +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

Organoids in pediatric cancer research

FEBS Letters, EarlyView.
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley   +1 more source

Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game [PDF]

Computer Science Journal of Moldova, 2018
We propose to use the new methodology for solving the complete and perfect information bimatrix game. To solve the games of these type we construct the incomplete and imperfect information game generated by the informational extended strategies.
Boris Hancu, Anatolie Gladei
doaj  

Pseudodeterministic Communication Complexity

Proceedings of the 58th Annual ACM Symposium on Theory of Computing
We exhibit an $n$-bit partial function with randomized communication complexity $O(\log n)$ but such that any completion of this function into a total one requires randomized communication complexity $n^{Ω(1)}$. In particular, this shows an exponential separation between randomized and \emph{pseudodeterministic} communication protocols.
Mika Göös, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan   +5 more
openaire   +3 more sources

Phosphatidylinositol 4‐kinase as a target of pathogens—friend or foe?

FEBS Letters, EarlyView.
This graphical summary illustrates the roles of phosphatidylinositol 4‐kinases (PI4Ks). PI4Ks regulate key cellular processes and can be hijacked by pathogens, such as viruses, bacteria and parasites, to support their intracellular replication. Their dual role as essential host enzymes and pathogen cofactors makes them promising drug targets.
Ana C. Mendes, Guilherme M. Azevedo, Amanda P. Barcellos, Diana Bahia   +3 more
wiley   +1 more source