Results 61 to 70 of about 4,950,534 (360)

Circuit Complexity for Fermionic Thermofield Double states [PDF]

open access: yesPhys. Rev. D 99, 026011 (2019), 2018
Motivated by the holographic complexity proposals, in this paper, we investigate the time dependence of the complexity for the Fermionic thermofield double state (TFD) using the Nielsen approach and Fubini-Study (FS) approach separately. In both two approaches, we discuss the results for different reference states: the Dirac vacuum state and the ...
arxiv   +1 more source

Computations on Nondeterministic Cellular Automata [PDF]

open access: yes, 1998
The work is concerned with the trade-offs between the dimension and the time and space complexity of computations on nondeterministic cellular automata. It is proved, that 1).
Ozhigov, Yuri
core   +3 more sources

Leveraging current insights on IL‐10‐producing dendritic cells for developing effective immunotherapeutic approaches

open access: yesFEBS Letters, EarlyView.
In vivo IL‐10 produced by tissue‐resident tolDC is involved in maintaining/inducing tolerance. Depending on the agent used for ex vivo tolDC generation, cells acquire common features but prime T cells towards anergy, FOXP3+ Tregs, or Tr1 cells according to the levels of IL‐10 produced. Ex vivo‐induced tolDC were administered to patients to re‐establish/
Konstantina Morali   +3 more
wiley   +1 more source

Dynamical complexity of discrete time regulatory networks

open access: yes, 2005
Genetic regulatory networks are usually modeled by systems of coupled differential equations and by finite state models, better known as logical networks, are also used.
Aguirre C Martin J Vilela Mendes R   +5 more
core   +1 more source

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis [PDF]

open access: yes, 2014
Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al.
D. Lau   +14 more
core   +2 more sources

The immunological interface: dendritic cells as key regulators in metabolic dysfunction‐associated steatotic liver disease

open access: yesFEBS Letters, EarlyView.
Metabolic dysfunction‐associated steatotic liver disease (MASLD) affects nearly one‐third of the global population and poses a significant risk of progression to cirrhosis or liver cancer. Here, we discuss the roles of hepatic dendritic cell subtypes in MASLD, highlighting their distinct contributions to disease initiation and progression, and their ...
Camilla Klaimi   +3 more
wiley   +1 more source

The Computational Complexity of Estimating Convergence Time [PDF]

open access: yes, 2010
An important problem in the implementation of Markov Chain Monte Carlo algorithms is to determine the convergence time, or the number of iterations before the chain is close to stationarity. For many Markov chains used in practice this time is not known.
Bhatnagar, Nayantara   +2 more
core  

Insights into PI3K/AKT signaling in B cell development and chronic lymphocytic leukemia

open access: yesFEBS Letters, EarlyView.
This Review explores how the phosphoinositide 3‐kinase and protein kinase B pathway shapes B cell development and drives chronic lymphocytic leukemia, a common blood cancer. It examines how signaling levels affect disease progression, addresses treatment challenges, and introduces novel experimental strategies to improve therapies and patient outcomes.
Maike Buchner
wiley   +1 more source

Relation is an option for processing context information

open access: yesFrontiers in Artificial Intelligence, 2022
Attention mechanisms are one of the most frequently used architectures in the development of artificial intelligence because they can process contextual information efficiently.
Kazunori D Yamada   +4 more
doaj   +1 more source

The special shadow-complexity of $\#_k(S^1\times S^3)$ [PDF]

open access: yesarXiv, 2023
The special shadow-complexity is an invariant of closed $4$-manifolds defined by Costantino using Turaev's shadows. We show that for any positive integer $k$, the special shadow-complexity of the connected sum of $k$ copies of $S^1\times S^3$ is exactly $k+1$.
arxiv  

Home - About - Disclaimer - Privacy