Search results for "Proximate"

From Nerode's congruence to Suffix Automata with mismatches

2009

AbstractIn this paper we focus on the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. As first result we give a characterization of the Nerode’s right-invariant congruence that is associated with Sk. This result generalizes the classical characterization described in [A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 1985, 31–55]. As second result we present an algorithm that makes use of Sk to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the…

Modern taurine cattle descended from small number of near-eastern founders.

2012

Archaeozoological and genetic data indicate that taurine cattle were first domesticated from local wild ox (aurochs) in the Near East some 10,500 years ago. However, while modern mitochondrial DNA (mtDNA) variation indicates early Holocene founding event(s), a lack of ancient DNA data from the region of origin, variation in mutation rate estimates, and limited application of appropriate inference methodologies have resulted in uncertainty on the number of animals first domesticated. A large number would be expected if cattle domestication was a technologically straightforward and unexacting region-wide phenomenon, while a smaller number would be consistent with a more complex and challengin…

2021

The domestication and spreading of grapevine as well as the gene flow history had been described in many studies. We used a high-quality 7k SNP dataset of 1,038 Eurasian grape varieties with unique profiles to assess the population genetic diversity, structure, and relatedness, and to infer the most likely migration events. Comparisons of putative scenarios of gene flow throughout Europe from Caucasus helped to fit the more reliable migration routes around the Mediterranean Basin. Approximate Bayesian computation (ABC) approach made possible to provide a response to several questions so far remaining unsolved. Firstly, the assessment of genetic diversity and population structure within a we…

Approximate energy functionals for one-body reduced density matrix functional theory from many-body perturbation theory

2018

We develop a systematic approach to construct energy functionals of the one-particle reduced density matrix (1RDM) for equilibrium systems at finite temperature. The starting point of our formulation is the grand potential $\Omega [\mathbf{G}]$ regarded as variational functional of the Green's function $G$ based on diagrammatic many-body perturbation theory and for which we consider either the Klein or Luttinger-Ward form. By restricting the input Green's function to be one-to-one related to a set on one-particle reduced density matrices (1RDM) this functional becomes a functional of the 1RDM. To establish the one-to-one mapping we use that, at any finite temperature and for a given 1RDM $\…

Low Complexity Image Compression using Pruned 8-point DCT Approximation in Wireless Visual Sensor Networks

2017

International audience; Since the transmission of the uncompressed image in the context of wireless visual sensor networks (WVSNs) consumes less energy than transmitting the compressed image, developing energy-aware compression algorithms are mandatory to extend the camera node's lifetime and thereby the whole network lifetime. The present paper studies a low-complexity image compression algorithm in the context of WVSNs. This algorithm consists of applying a pruning approach on a DCT approximation transform. The scheme is investigated in terms of computation cycles, processing time, energy consumption and image quality. Experimental works are conducted using the Atmel Atmega128 processor o…

Hydrological post-processing based on approximate Bayesian computation (ABC)

2019

[EN] This study introduces a method to quantify the conditional predictive uncertainty in hydrological post-processing contexts when it is cumbersome to calculate the likelihood (intractable likelihood). Sometimes, it can be difficult to calculate the likelihood itself in hydrological modelling, specially working with complex models or with ungauged catchments. Therefore, we propose the ABC post-processor that exchanges the requirement of calculating the likelihood function by the use of some sufficient summary statistics and synthetic datasets. The aim is to show that the conditional predictive distribution is qualitatively similar produced by the exact predictive (MCMC post-processor) or …

Uniformization of metric surfaces using isothermal coordinates

2021

We establish a uniformization result for metric surfaces - metric spaces that are topological surfaces with locally finite Hausdorff 2-measure. Using the geometric definition of quasiconformality, we show that a metric surface that can be covered by quasiconformal images of Euclidean domains is quasiconformally equivalent to a Riemannian surface. To prove this, we construct suitable isothermal coordinates.

Computing continuous numerical solutions of matrix differential equations

1995

Abstract In this paper, we construct analytical approximate solutions of initial value problems for the matrix differential equation X ′( t ) = A ( t ) X ( t ) + X ( t ) B ( t ) + L ( t ), with twice continuously differentiable functions A ( t ), B ( t ), and L ( t ), continuous. We determine, in terms of the data, the existence interval of the problem. Given an admissible error e, we construct an approximate solution whose error is smaller than e uniformly, in all the domain.

On Approximate Jumbled Pattern Matching in Strings

2011

Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of a Parikh vector q in the text s requires finding a substring t of s with p(t) = q. This can be viewed as the task of finding a jumbled (permuted) version of a query pattern, hence the term Jumbled Pattern Matching. We present several algorithms for the approximate version of the problem: Given a string s and two Parikh vectors u, v (the query bounds), find all maximal occurrences in s of some Parikh vector q such that u <= q <= v. This definition encompasses several natural versions of approximate Parikh vector search. We present an algorithm solving this problem …

Half-width plots, a simple tool to predict peak shape, reveal column kinetics and characterise chromatographic columns in liquid chromatography: Stat…

2013

Peak profiles in chromatography are characterised by their height, position, width and asymmetry; the two latter depend on the values of the left and right peak half-widths. Simple correlations have been found between the peak half-widths and the retention times. The representation of such correlations has been called half-width plots. For isocratic elution, the plots are parabolic, although often, the parabolas can be approximated to straight-lines. The plots can be obtained with the half-widths/retention time data for a set of solutes experiencing the same kinetics, eluted with a mobile phase at fixed or varying composition. When the analysed solutes experience different resistance to mas…