Results 41 to 50 of about 47,932 (337)

Dendritic cells steering antigen and leukocyte traffic in lymph nodes

open access: yesFEBS Letters, EarlyView.
Dendritic cells are key players in the activation of T cells and their commitment to effector function. In this In a Nutshell Review, we will discuss how dendritic cells guide the trafficking of antigen and leukocytes in the lymph node, thus influencing T‐cell activation processes. Dendritic cells (DCs) play a central role in initiating and shaping the
Enrico Dotta   +3 more
wiley   +1 more source

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories [PDF]

open access: yesLogical Methods in Computer Science, 2013
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007).
Luis Barguñó   +4 more
doaj   +1 more source

Decidability of All Minimal Models (Revised Version - 2012) [PDF]

open access: yes, 2012
This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of the existence of a cellular term in each observational equivalence class of a minimal ...
Padovani, Vincent
core   +3 more sources

Alternating register automata on finite words and trees [PDF]

open access: yes, 2012
We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain.
Figueira, Diego
core   +4 more sources

FoxO1 signaling in B cell malignancies and its therapeutic targeting

open access: yesFEBS Letters, EarlyView.
FoxO1 has context‐specific tumor suppressor or oncogenic character in myeloid and B cell malignancies. This includes tumor‐promoting properties such as stemness maintenance and DNA damage tolerance in acute leukemias, or regulation of cell proliferation and survival, or migration in mature B cell malignancies.
Krystof Hlavac   +3 more
wiley   +1 more source

To the 90th anniversary of the birth of A. I. Kokorin. Stages of scientific and pedagogical way

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2019
The paper is devoted to the scientific and pedagogical activity of A. I. Kokorin, the founder of the Irkutsk algebraic-logical school, whose 90th anniversary is celebrated in November 2019. Five research areas with the most significant contributions made
V. V. Bludov   +3 more
doaj   +1 more source

Decidability of higher-order matching [PDF]

open access: yesLogical Methods in Computer Science, 2009
We show that the higher-order matching problem is decidable using a game-theoretic argument.
Colin Stirling
doaj   +1 more source

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 progress of science from a computational point of view: the drive towards ever higher solvability

open access: yesFoundations of Computing and Decision Sciences, 2019
This essay’s content is rendered by the titles of the successive sections. 1. Effective solvability versus intuitive solvability. — 2. Decidability, i.e. effective solvability, in predicate logic. The speedup phenomenon — 3.
Marciszewski Witold
doaj   +1 more source

On decidability of pure hybrid logic

open access: yesLietuvos Matematikos Rinkinys, 2012
In this paper we study a decidable class of pure Hybrid Logic. To prove decidability we use terminating sequent for formulae of H(@) logic.
Stanislovas Norgėla
doaj   +1 more source

Home - About - Disclaimer - Privacy