Results 111 to 120 of about 3,355,376 (309)
Graph-based complexity and computational capabilities of proteinoid spike systemsGraph-based complexity and computational capabilities of proteinoid spike systems [PDF]
Royal Society Open ScienceProteinoid microspheres exhibit oscillatory electrical dynamics that encode rich temporal structure. We analyse five proteinoid spike-train datasets using a two-step nonlinear transformation based on spiral sampling and significant-digit extraction ...
Saksham Sharma +4 more
doaj +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
, 2019 Addressing the management of water bodies that cross political, cultural, and ecological boundaries entails working with a level of complexity that requires creative, adaptive management strategies that build resilience throughout the system and allow ...
Spett, Emma J
core +1 more source
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Common Agency and Computational Complexity: Theory and Experimental Evidence [PDF]
In a common agency game, several principals try to influence the behavior of an agent. Common agency games typically have multiple equilibria. One class of equilibria, called truthful, has been identified by Bernheim and Whinston and has found widespread
Prat, A., Kirchsteiger, G.
core
On the Complexity of Target Set Selection in Simple Geometric Networks [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual
Michal Dvořák +2 more
doaj +1 more source
RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells
FEBS Open Bio, EarlyView.RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour +2 more
wiley +1 more source
Depth lower bounds in Stabbing Planes for combinatorial principles [PDF]
Logical Methods in Computer ScienceStabbing Planes (also known as Branch and Cut) is a proof system introduced very recently which, informally speaking, extends the DPLL method by branching on integer linear inequalities instead of single variables.
Stefan Dantchev +3 more
doaj +1 more source
Directed evolution of enzymes at the crossroads of tradition and innovation
FEBS Open Bio, EarlyView.An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova +2 more
wiley +1 more source
The need for structure in quantum speedups [PDF]
, 2009 Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms operate ...
Scott Aaronson +3 more
core