Zobrazeno 1 - 10
of 953
pro vyhledávání: '"PELTOMÄKI, P."'
Autor:
Peltomäki, Jarkko, Porres, Ivan
Black-box runtime verification methods for cyber-physical systems can be used to discover errors in systems whose inputs and outputs are expressed as signals over time and their correctness requirements are specified in a temporal logic. Existing met
Externí odkaz:
http://arxiv.org/abs/2410.03202
In 2014, Vesti proposed the problem of determining the repetition threshold for infinite rich words, i.e., for infinite words in which all factors of length $n$ contain $n$ distinct nonempty palindromic factors. In 2020, Currie, Mol, and Rampersad pr
Externí odkaz:
http://arxiv.org/abs/2409.12068
Autor:
Peltomäki, Jarkko, Porres, Ivan
We present the OGAN algorithm for automatic requirement falsification of cyber-physical systems. System inputs and output are represented as piecewise constant signals over time while requirements are expressed in signal temporal logic. OGAN can find
Externí odkaz:
http://arxiv.org/abs/2310.20493
Publikováno v:
Transportation Engineering, Vol 17, Iss , Pp 100268- (2024)
Various numerical methods are commonly used to model the loading response of traffic infrastructures. However, the broader implementation of these methods into practice is typically limited by the high computing cost or technical complexity of the mo
Externí odkaz:
https://doaj.org/article/68cfbb3665214707bb955e77abc455b5
WOGAN is an online test generation algorithm based on Wasserstein generative adversarial networks. In this note, we present how WOGAN works and summarize its performance in the SBST 2022 CPS tool competition concerning the AI of a self-driving car.
Externí odkaz:
http://arxiv.org/abs/2205.11064
We propose a novel online test generation algorithm WOGAN based on Wasserstein Generative Adversarial Networks. WOGAN is a general-purpose black-box test generator applicable to any system under test having a fitness function for determining failing
Externí odkaz:
http://arxiv.org/abs/2205.11060
Autor:
Peltomäki, Jarkko, Porres, Ivan
We consider the problem of falsifying safety requirements of Cyber-Physical Systems expressed in signal temporal logic (STL). This problem can be turned into an optimization problem via STL robustness functions. In this paper, our focus is in falsify
Externí odkaz:
http://arxiv.org/abs/2205.11057
Autor:
Marjaana Pussila, Aleksi Laiho, Petri Törönen, Pauliina Björkbacka, Sonja Nykänen, Kirsi Pylvänäinen, Liisa Holm, Jukka-Pekka Mecklin, Laura Renkonen-Sinisalo, Taru Lehtonen, Anna Lepistö, Jere Linden, Satu Mäki-Nevala, Päivi Peltomäki, Minna Nyström
Publikováno v:
EBioMedicine, Vol 103, Iss , Pp 105111- (2024)
Summary: Background: Lynch syndrome (LS) is one of the most common hereditary cancer syndromes worldwide. Dominantly inherited mutation in one of four DNA mismatch repair genes combined with somatic events leads to mismatch repair deficiency and micr
Externí odkaz:
https://doaj.org/article/7bacf7e242bd465497bae1072bffb9a5
Autor:
Alisa Olkinuora, Satu Mäki-Nevala, Sanjeevi Ukwattage, Ari Ristimäki, Maarit Ahtiainen, Jukka-Pekka Mecklin, Päivi Peltomäki
Publikováno v:
Frontiers in Oncology, Vol 14 (2024)
BackgroundLynch syndrome (LS) is an autosomal dominant multi-organ cancer syndrome with a high lifetime risk of cancer. The number of cumulative colorectal adenomas in LS does not generally exceed ten, and removal of adenomas via routine screening mi
Externí odkaz:
https://doaj.org/article/98b48140604641d7bf9530485d95c246
Autor:
Peltomäki, Jarkko, Salo, Ville
Publikováno v:
Information and Computation, Vol. 285.B, 104883:1-21 (2022)
To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from a combinatorial game played on the language of $X$. Previously it has been studied what properties of $X$ does $W(X)$ inherit. For example, $X$ and $W(X)$
Externí odkaz:
http://arxiv.org/abs/2106.07249