Results 81 to 90 of about 141,879 (256)

Forward Analysis and Model Checking for Trace Bounded WSTS

, 2011
We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as ...
A. Annichini, A. Bouajjani, A. Finkel, A. Finkel, A. Finkel, A. Finkel, B. Boigelot, C. Dufourd, C. Rackoff, E. Cardoza, E.A. Emerson, G. Geeraerts, H. Comon, H. Comon, J. Esparza, J. Leroux, L. Fribourg, M. Bozga, P. Ganty, P. Gawrychowski, P.A. Abdulla, P.A. Abdulla, P.A. Abdulla, P.A. Abdulla, R. Mayr, R. Siromoney, R. Valk, R.M. Karp, S. Bardin, S. Bardin, S. Demri, S. Ginsburg, S. Safra, V. Cortier   +33 more
core   +3 more sources

Ultra-recursive sequences

, 2019
We study a new type of sequences whose elements are defined in terms of the position, sign and magnitude of another element of the sequence. The name ultra-recursive comes from the fact that these sequences possess terms that are generated adding either the previous (as in traditional recurrences formulas) or the next terms.
openaire   +2 more sources

Neural Information Processing and Time‐Series Prediction with Only Two Dynamical Memristors

Advanced Electronic Materials, EarlyView.
The present study demonstrates how simple circuits with only two memristive devices are utilized to perform high complexity temporal information processing tasks, like neural spike detection in noisy environment, or time‐series prediction. This circuit simplicity is enabled by the dynamical complexity of the memristive devices, i.e.
Dániel Molnár, Tímea Nóra Török, János Volk, Roland Kövecs, László Pósa, Péter Balázs, György Molnár, Nadia Jimenez Olalla, Zoltán Balogh, János Volk, Juerg Leuthold, Miklós Csontos, András Halbritter   +12 more
wiley   +1 more source

Weighted Random Averages and Recursive Interpolation in Fibonacci Sequences

Fractal and Fractional
We investigate the multifractal geometry of irregular sets arising from weighted averages of random variables, where the weights (wn) form a positive sequence with exponential growth.
Najmeddine Attia, Taoufik Moulahi
doaj   +1 more source

How powerful are integer-valued martingales?

, 2010
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale (strategy) can win an infinite amount of money by betting on the values of
Bienvenu, Laurent, Stephan, Frank, Teutsch, Jason   +2 more
core   +1 more source

What to Make and How to Make It: Combining Machine Learning and Statistical Learning to Design New Materials

Advanced Intelligent Discovery, EarlyView.
Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley   +1 more source

Binet’s formula for operator-valued recursive sequences and the operator moment problem

Extracta Mathematicae
We derive a Binet-type formula for operator-valued sequences satisfying linear recurrence relations, extending the classical scalar case to the setting of bounded operators on Hilbert spaces.
A. Ech-charyfy, A. Ghanmi, K. Idrissi, A. Salhi   +3 more
doaj   +1 more source

Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics

Algorithms for Molecular Biology, 2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is known that such approaches need to be first rewritten using recursive ...
Nuel Grégory
doaj   +1 more source

Automatic Determination of Quasicrystalline Patterns from Microscopy Images

Advanced Intelligent Discovery, EarlyView.
This work introduces a user‐friendly machine learning tool to automatically extract and visualize quasicrystalline tiling patterns from atomically resolved microscopy images. It uses feature clustering, nearest‐neighbor analysis, and support vector machines. The method is broadly applicable to various quasicrystalline systems and is released as part of
Tano Kim Kender, Marco Corrias, Cesare Franchini   +2 more
wiley   +1 more source

Multi‐Crystal X‐Ray Diffraction (MCXRD) Bridges the Crystallographic Characterisation Gap in Chemistry and Materials Science: Application to MOFs

Angewandte Chemie, EarlyView.
Multi‐crystal X‐ray diffraction (MCXRD) methods allow accurate structural characterisation with crystals too small for single‐crystal X‐ray diffraction and too large for electron diffraction, as demonstrated here for metal‐organic frameworks, and alleviate the radiation‐induced chemical changes that can result from using high‐intensity X‐ray sources to
Joshua P. Smith, Rebecca Smith, Thomas M. Roseveare, Dominic Bara, Alexander J. R. Thom, Ross S. Forgan, Mark R. Warren, Anna J. Warren, Robin L. Owen, Lee Brammer   +9 more
wiley   +2 more sources