Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Towards unconstrained face recognition from image sequences
AJ Howell, H Buxton - Proceedings of the Second International …, 1996 - ieeexplore.ieee.org
The paper presents experiments using a radial basis function (RBF) network to tackle the
unconstrained face recognition problem using low resolution video information. Input …
unconstrained face recognition problem using low resolution video information. Input …
Deterministic timed finite state machines: Equivalence checking and expressive power
There has been a growing interest in defining models of automata enriched with time. For
instance, timed automata were introduced as automata extended with clocks. In this paper …
instance, timed automata were introduced as automata extended with clocks. In this paper …
FSM-based test derivation strategies for systems with time-outs
M Zhigulin, N Yevtushenko, S Maag… - … Conference on Quality …, 2011 - ieeexplore.ieee.org
The paper presents a method for deriving a complete test suite for a timed deterministic FSM
with time-outs when only the upper bound on the number of states and the largest finite time …
with time-outs when only the upper bound on the number of states and the largest finite time …
Testing the control-flow, data-flow, and time aspects of communication systems: a survey
Communication software systems are considered as critical national infrastructures that
support users, corporations, and governments. Their description, implementation, and …
support users, corporations, and governments. Their description, implementation, and …
Passive testing with asynchronous communications and timestamps
We develop a formal passive testing framework for software systems where parties
communicate asynchronously. Monitors, placed in between the entities, check that a certain …
communicate asynchronously. Monitors, placed in between the entities, check that a certain …
Testing from a stochastic timed system with a fault model
In this paper we present a method for testing a system against a non-deterministic stochastic
finite state machine. As usual, we assume that the functional behaviour of the system under …
finite state machine. As usual, we assume that the functional behaviour of the system under …
Testing timed finite state machines with guaranteed fault coverage
A method is presented for deriving test suites with the guaranteed fault coverage for
deterministic possibly partial Timed Finite State Machines (TFSMs). TFSMs have integer …
deterministic possibly partial Timed Finite State Machines (TFSMs). TFSMs have integer …
Distinguing non-deterministic timed finite state machines
M Gromov, K El-Fakih, N Shabaldina… - … Conference on Formal …, 2009 - Springer
Conformance testing with the guaranteed fault coverage is based on distinguishing faulty
system implementations from the corresponding system specification. We consider timed …
system implementations from the corresponding system specification. We consider timed …
Implementation relations and test generation for systems with distributed interfaces
Some systems interact with their environment at physically distributed interfaces called ports
and we separately observe sequences of inputs and outputs at each port. As a result we …
and we separately observe sequences of inputs and outputs at each port. As a result we …
Using genetic algorithms to generate test sequences for complex timed systems
The generation of test data for state-based specifications is a computationally expensive
process. This problem is magnified if we consider that time constraints have to be taken into …
process. This problem is magnified if we consider that time constraints have to be taken into …