Results 111 to 120 of about 399,115 (333)
There have been several recent suggestions for tableau systems for deciding satisfiability in the practically important branching time temporal logic known as CTL*.
Reynolds, Mark
core +2 more sources
Single‐cell RNA/TCR/BCR sequencing reveals that 5CAR therapy in T‐ALL induces T‐cell exhaustion, reduces EBV‐associated TCRs, lowers TCR/BCR diversity, and increases NK/DC/monocyte activation and function. In contrast, 7CAR therapy reduces multiple pathogen‐associated TCRs, enhances NK cell activation and function, decreases monocyte activation, and ...
Yuechen Luo +12 more
wiley +1 more source
A diversity of novel type-2 innate lymphoid cell subpopulations revealed during tumour expansion
Type 2 innate lymphoid cells (ILC2s) perform vital functions in orchestrating humoral immune responses, facilitating tissue remodelling, and ensuring tissue homeostasis.
Clara Wenjing Xia +10 more
doaj +1 more source
Enhanced induction of HIV-specific CTL by dendritic cell-targeted delivery of SOCS-1 siRNA [PDF]
Sandesh Subramanya +3 more
openalex +1 more source
Immune Predictors of Radiotherapy Outcomes in Cervical Cancer
This study reveals dynamic immune remodeling in cervical cancer following radiotherapy. Single‐cell analysis identifies the C3/C3AR1 axis as a central mediator of epithelial–myeloid crosstalk, whose inhibition reduces treatment efficacy in mice. Guided by these insights, the eight‐feature machine‐learning model: Cervical Cancer Radiotherapy Immune ...
Linghao Wang +8 more
wiley +1 more source
A major challenge facing photodynamic therapy (PDT) is that the activity of the immune-induced infiltrating CD8+ T cells is subject to the regulatory T lymphocytes (Tregs), leaving the tumor at risk of recurrence and metastasis after the initial ablation.
Siqin He +8 more
doaj +1 more source
Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder. Following recent work in the linear framework, only logics with a single variable are considered.
Weber, Volker
core +1 more source
Branching-time model checking of one-counter processes [PDF]
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CTL) over OCPs. A PSPACE upper bound is inherited from the modal mu-calculus
Göller, Stefan, Lohrey, Markus
core +4 more sources

