We study the complexity of the confluence problem for restricted kinds of semi–Thue systems, vector replacement systems and general trace rewriting systems. We prove that confluence for length– reducing semi–Thue systems is P–complete and that this complexity reduces to NC in the monadic case. For length–reducing vector replacement systems we prove that the confluence problem is PSPACE– complet...

Trace conditioning is a form of classical conditioning, where a neutral stimulus (conditioned stimulus, CS) is associated with a following appetitive or aversive stimulus (unconditioned stimulus, US). Unlike classical delay conditioning, in trace conditioning there is a stimulus-free gap between CS and US, and thus a poststimulus neural representation (trace) of the CS is required to bridge the...

Abstract A discrete fracture network (DFN) model based on non-parametric kernel density estimators (KDE) and directional-linear statistics is developed. The provides a characterization of the with distributions orientation size jointly. solution to Bertrand paradox used for calculation disk sizes from trace lengths, latter calculated intersection disks highwall faces by triangulation. Poisson p...

We present a novel methodology to perform passive testing. The usual approach consists in recording the trace produced by the implementation under test and trying to find a fault by comparing this trace with the specification. We propose a more active approach to passive testing where the minimum set of (critical) properties required to a correct implementation may be explicitly indicated. In s...

[Purpose] The purpose of this study was to investigate the effect of local vibration stimuli on body balance (trace area, trace length, and velocity) in healthy adults during double-leg standing. [Subjects and Methods] Thirty-nine subjects (10 male, 29 female) participated in this study. They were asked to keep their balance while holding four positions: standing with their eyes open, with and ...

The Langlands Program relates Galois representations and automorphic representations of reductive algebraic groups. The trace formula is a powerful tool in the study of this connection and the Langlands Functoriality Conjecture. After giving an introduction to the Langlands Program and its geometric version, which applies to curves over finite fields and over the complex field, I give a survey ...