Search results for "deterministic"
showing 10 items of 141 documents
On computation in the limit by non-deterministic Turing machines
1974
Noise contribution to resonance phenomena and information propagation in non linear electronic networks
2015
This manuscript presents research aiming to show possible positive effects of deterministic and stochastic perturbations on the responses of different nonlinear systems. To that end, both numerical and experimental studies were carried out on two kinds of structures : an elementary electronic FitzHugh-Nagumo oscillator and an electrical line developed by resistively coupling 45 elementary cells. In the first section, the elementary cell characterization was undertaken in a deterministic regime. In the presence of a bichromatic stimulus, it is shown that when the low frequency component is subthreshold, its detection can be maximized for an optimal magnitude of the second component thanks to…
Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes *
2013
A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the dynamics of $(S_t)$. This so-called "persistent" random walk is nolonger Markovian and, under suitable conditions, the rescaled process converges towards the integrated telegraph noise (ITN) as the time-scale and space-scale parameters tend to zero (see Herrmann and Vallois, 2010; Tapiero-Vallois, Tapiero-Vallois2}). The ITN process is effectively non-Markovian too. The aim is to consider persistent random walks $(S_t)$ whose increments are Markov chains with…
On the suffix automaton with mismatches
2007
International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.
Inductive inference of recursive functions: complexity bounds
1991
This survey includes principal results on complexity of inductive inference for recursively enumerable classes of total recursive functions. Inductive inference is a process to find an algorithm from sample computations. In the case when the given class of functions is recursively enumerable it is easy to define a natural complexity measure for the inductive inference, namely, the worst-case mindchange number for the first n functions in the given class. Surely, the complexity depends not only on the class, but also on the numbering, i.e. which function is the first, which one is the second, etc. It turns out that, if the result of inference is Goedel number, then complexity of inference ma…
Comparing various concepts of function prediction. Part 2.
1975
Prediction: f(m+1) is guessed from given f(0), ..., f(m). Program synthesis: a program computing f is guessed from given f(0), ..., f(m). The hypotheses are required to be correct for all sufficiently large m, or with some positive frequency. These approaches yield a hierarchy of function prediction and program synthesis concepts. The comparison problem of the concepts is solved.
Comparing various types of limiting synthesis and prediction of functions
1974
Comparing Different approaches - Data mining, Geostatistic, and Deterministic pedology - to assess the Frequency of WRB reference soil groups in the …
2014
Estimating frequency of soil classes in map unit is always affected by some degree of uncertainty, especially at small scales, with a larger generalization. The aim of this study was to compare different possible approaches - data mining, geostatistic, deterministic pedology - to assess the frequency of WRB Reference Soil Groups (RSG) in the major Italian soil regions. In the soil map of Italy (Costantini et al., 2012), a list of the first five RSG was reported in each major 10 soil regions. The soil map was produced using the national soil geodatabase, which stored 22,015 analyzed and classified pedons, 1,413 soil typological unit (STU) and a set of auxiliary variables (lithology, land-use…
ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS
2012
In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.
Modelling the effects of cropping systems on weed dynamics: the trade-off between process analysis and decision support
2022
Models are essential to synthesize knowledge on weeds and to design integrated weed-management strategies. These models must rank cropping systems as a function of weed infestation, and account for variability in effects to estimate probabilities of success or failure. Three case studies are presented: (1) an empirical static single-equation model that directly relates weed biomass to crop management, with few inputs and parameters, (2) a matrix-based multiannual model predicting a few key weed stages annually, from weed control options and a few parameters, (3) a mechanistic process-based multiannual model predicting detailed soil, crop and weed state variables daily, with an individual-ba…