Results 31 to 40 of about 6,419 (111)
Completeness of Flat Coalgebraic Fixpoint Logics
, 2010 Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type.
Gastin, P. +3 more
core +1 more source
Stability-mediated epistasis constrains the evolution of an influenza protein. [PDF]
, 2013 John Maynard Smith compared protein evolution to the game where one word is converted into another a single letter at a time, with the constraint that all intermediates are words: WORD→WORE→GORE→GONE→GENE. In this analogy, epistasis constrains evolution,
Bloom, Jesse D +2 more
core +1 more source
LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees [PDF]
, 2011 We present a method to generate a robot control strategy that maximizes the probability to accomplish a task. The task is given as a Linear Temporal Logic (LTL) formula over a set of properties that can be satisfied at the regions of a partitioned ...
Belta, Calin +3 more
core +1 more source
A Review on Microreactor Design for Effective Fischer–Tropsch Process Intensification
Advanced Materials Technologies, EarlyView.Design strategies for effective Fischer–Tropsch process intensification are summarized based on experimental and simulation experiences. Recommendations for catalyst loading of packed‐bed and wash‐coated microchannel, microtube, micromonolith, and microstructured reactors are discussed.
Yangjun Wei +5 more
wiley +1 more source
PRISM: a tool for automatic verification of probabilistic systems [PDF]
, 2006 Probabilistic model checking is an automatic formal verification technique for analysing quantitative properties of systems which exhibit stochastic behaviour. PRISM is a probabilistic model checking tool which has already been successfully deployed in a
Hinton, A. +3 more
core +3 more sources
Advanced Science, EarlyView.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
Advanced Human Immune Cell‐Organoid Co‐Cultures for Functional Testing of Cancer Nanovaccines
Advanced Science, EarlyView.Pancreatic ductal adenocarcinoma remains difficult to treat. We establish an organoid–immune co‐culture using patient‐derived organoids and matched T‐cells to assess cancer vaccines. A mesothelin‐targeted nanovaccine activates antigen‐specific T‐cells, increases IFN‐γ, and targets MSLN+ organoids.
Nathalia Ferreira +18 more
wiley +1 more source
An Algorithm for Probabilistic Alternating Simulation [PDF]
, 2012 In probabilistic game structures, probabilistic alternating simulation (PA-simulation) relations preserve formulas defined in probabilistic alternating-time temporal logic with respect to the behaviour of a subset of players. We propose a partition based
C. Baier +19 more
core +3 more sources
Advanced Science, EarlyView.Donor‐derived tdTomato+ mature hepatocytes were FACS‐isolated and transplanted into Fah−/− host mice. During regeneration, these cells convert into proliferative, unipotent Afp+ rHeps. Their plasticity is governed by a PPARγ/AFP‐dependent metabolic switch, segregating into pro‐proliferative Afplow and pro‐survival Afphigh subpopulations.
Ting Fang +12 more
wiley +1 more source
Quantitative model checking of continuous-time Markov chains against timed automata specifications [PDF]
, 2009 We study the following problem: given a continuous-time Markov chain (CTMC) C, and a linear real-time property provided as a deterministic timed automaton (DTA) A, what is the probability of the set of paths of C that are\ud accepted by A (C satisfies A)?
Chen, Taolue +3 more
core +4 more sources