Results 71 to 80 of about 842,589 (329)
Weighted automata are compact and actively learnable [PDF]
Information Processing Letters, 2020 We show that weighted automata over the field of two elements can be exponentially more compact than non-deterministic finite state automata. To show this, we combine ideas from automata theory and communication complexity. However, weighted automata are
Artem Kaznatcheev, P. Panangaden
semanticscholar +1 more source
Model Checking One-clock Priced Timed Automata [PDF]
Logical Methods in Computer Science, 2008 We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Patricia Bouyer +2 more
doaj +1 more source
Rational streams coalgebraically [PDF]
Logical Methods in Computer Science, 2008 We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the equivalence of four notions of representability of rational streams: by finite ...
J. J. M. M. Rutten
doaj +1 more source
Efficient and Modular Coalgebraic Partition Refinement [PDF]
Logical Methods in Computer Science, 2020 We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification.
Thorsten Wißmann +3 more
doaj +1 more source
Molecular Oncology, EarlyView.We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source
Weighted Automata Extraction from Recurrent Neural Networks via Regression on State Spaces [PDF]
AAAI Conference on Artificial Intelligence, 2019 We present a method to extract a weighted finite automaton (WFA) from a recurrent neural network (RNN). Our method is based on the WFA learning algorithm by Balle and Mohri, which is in turn an extension of Angluin's classic L* algorithm.
Takamasa Okudono +3 more
semanticscholar +1 more source
Molecular Oncology, EarlyView.Beyond its role in immune evasion, this study identified that CD47 drives tumor‐intrinsic signaling in non‐small cell lung cancer (NSCLC). Transcriptomic profiling and functional studies revealed that CD47 regulates cell adhesion, migration, and metastasis through an ERK–EMT signaling axis.
Asa P.Y. Lau +8 more
wiley +1 more source
Human Activity Recognition through Weighted Finite Automata
Proceedings, 2018 This work addresses the problem of human activity identification in an ubiquitous environment, where data is collected from a wide variety of sources.
Sergio Salomón, Cristina Tîrnăucă
doaj +1 more source
Joint low power state assignment of sequential automata of a net implementing a parallel automaton
Informatika, 2023 Objectives. The problem of low power state assignment of partial states of a parallel automaton is considered. The objective of the paper is to investigate the possibilities of using the decomposition in state assignment of partial states in order to ...
Yu. V. Pottosin
doaj +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source