Results 41 to 50 of about 3,225 (296)

Generating and Employing Witness Automata for ACTLW Formulae

open access: yesIEEE Access, 2022
When verifying the validity of a formula in a system model by a model checker, a common feature is the generation of a linear witness or counterexample, which is a computation path usually showing a single reason why the formula is valid or, respectively,
Rok Vogrin, Robert Meolic, Tatjana Kapus
doaj   +1 more source

TRAIL‐PEG‐Apt‐PLGA nanosystem as an aptamer‐targeted drug delivery system potential for triple‐negative breast cancer therapy using in vivo mouse model

open access: yesMolecular Oncology, EarlyView.
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat   +8 more
wiley   +1 more source

Optimizing the length of checking sequences

open access: yes, 2006
A checking sequence, generated from a finite state machine, is a test sequence that is guaranteed to lead to a failure if the system under test is faulty and has no more states than the specification.
Hierons, RM, Ural, H
core   +1 more source

An Image Encryption Scheme Based on DNA Computing and Cellular Automata

open access: yesDiscrete Dynamics in Nature and Society, 2016
Networks have developed very quickly, allowing the speedy transfer of image information through Internet. However, the openness of these networks poses a serious threat to the security of image information.
Shihua Zhou   +3 more
doaj   +1 more source

COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells

open access: yesMolecular Oncology, EarlyView.
This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos   +6 more
wiley   +1 more source

Checking sequence construction using adaptive and preset distinguishing sequences

open access: yes, 2009
Methods for testing from finite state machine-based specifications often require the existence of a preset distinguishing sequence for constructing checking sequences.
Husnu Yenigun   +11 more
core   +1 more source

Research of the method of pseudo-random number generation based on asynchronous cellular automata with several active cells

open access: yesMATEC Web of Conferences, 2017
To date, there are many tasks that are aimed at studying the dynamic changes in physical processes. These tasks do not give advance known result. The solution of such problems is based on the construction of a dynamic model of the object.
Bilan Stepan, Bilan Mykola, Bilan Sergii
doaj   +1 more source

Inference of Finite Automata Using Homing Sequences

open access: yesInformation and Computation, 1989
We present new algorithms for inferring an unknown finite-state automaton from its input/output behavior, even in the absence of a means of resetting the machine to a start state. A key technique used is inference of a homing sequence for the unknown automaton.
Ronald L. Rivest, Robert E. Schapire
openaire   +1 more source

Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer

open access: yesMolecular Oncology, EarlyView.
COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann   +61 more
wiley   +1 more source

A Family of Controllable Cellular Automata for Pseudorandom Number Generation

open access: yes, 2002
In this paper, we present a family of novel Pseudorandom Number Generators (PRNGs) based on Controllable Cellular Automata (CCA) ─ CCA0, CCA1, CCA2 (NCA), CCA3 (BCA), CCA4 (asymmetric NCA), CCA5, CCA6 and CCA7 PRNGs.
Zhang, S.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy