Results 41 to 50 of about 180,278 (321)
Petri Net Based Symbolic Model Checking for Computation Tree Logic of Knowledge [PDF]
Computation Tree Logic of Knowledge (CTLK) can specify many design requirements of privacy and security of multi-agent systems (MAS). In our conference paper, we defined Knowledge-oriented Petri Nets (KPN) to model MAS and proposed Reachability Graphs with Equivalence Relations (RGER) to verify CTLK.
arxiv +1 more source
Conditional Superagonist CTL Ligands for the Promotion of Tumor-Specific CTL Responses [PDF]
Abstract Although it has been demonstrated that CTLs can be raised against tumor-associated self-antigens, achieving consistent and effective clinical responses has proven challenging. Superagonist altered peptide ligands (APLs) can often elicit potent antitumor CTL responses where the native tumor-associated epitope fails.
C. Siddiq Abdul-Alim+2 more
openaire +3 more sources
On CTL* with Graded Path Modalities [PDF]
Graded path modalities count the number of paths satisfying a property, and generalize the existential $$\mathsf {E}$$ and universal $$\mathsf {A}$$ path modalities of $$\textsc {CTL}^{*}$$. The resulting logic is denoted $$\textsc {G}\textsc {CTL}^{*}$$, and is a very powerful logic since as we show it is equivalent, over trees, to monadic path logic.
Aminof, Benjamin+2 more
openaire +6 more sources
Background Tumor mutational burden (TMB) is a promising predictor, which could stratify colorectal cancer (CRC) patients based on the response to immune checkpoint inhibitors (ICIs).
Lijun Xu, Qing Zheng
doaj +1 more source
CTL-MTNet: A Novel CapsNet and Transfer Learning-Based Mixed Task Net for the Single-Corpus and Cross-Corpus Speech Emotion Recognition [PDF]
Speech Emotion Recognition (SER) has become a growing focus of research in human-computer interaction. An essential challenge in SER is to extract common attributes from different speakers or languages, especially when a specific source corpus has to be trained to recognize the unknown data coming from another speech corpus.
arxiv
The Satisfiability Problem for Probabilistic CTL [PDF]
We study the satisfiability problem for qualitative PCTL (probabilistic computation tree logic), which is obtained from "ordinary" CTL by replacing the EX, AX, EU, and AU operators with their qualitative counterparts X > 0, X = 1, U > 0, and U = 1, respectively.
Brázdil, T+3 more
openaire +3 more sources
Satisfiability Games for Branching-Time Logics [PDF]
The satisfiability problem for branching-time temporal logics like CTL*, CTL and CTL+ has important applications in program specification and verification. Their computational complexities are known: CTL* and CTL+ are complete for doubly exponential time, CTL is complete for single exponential time.
arxiv +1 more source
This study aimed to investigate the effects of the combined injectable contraceptive (CIC) containing estradiol valerate (EV) and norethisterone enanthate (NET-EN) on aorta function and morphology, as well as on redox status, of female Wistar rats ...
LUDMILLA C. DO ESPÍRITO SANTO NERY+6 more
doaj +1 more source
Model Checking CTL is Almost Always Inherently Sequential [PDF]
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004).
arxiv +1 more source
We fabricated the charge-trap memory thin film transistors (CTM-TFTs) using InGaZnO (IGZO) active channel and HfO2/ZnO stack-structured charge-trap layer (CTL).
So-Yeong Na, Sung-Min Yoon
doaj +1 more source