Search results for "Proximate"
showing 10 items of 74 documents
Whole-Genome Re-Sequencing Data to Infer Historical Demography and Speciation Processes in Land Snails: the Study of Two Candidula Sister Species
2021
Despite the global biodiversity of terrestrial gastropods and their ecological and economic importance, the genomic basis of ecological adaptation and speciation in land snail taxa is still largely unknown. Here, we combined whole-genome re-sequencing with population genomics to evaluate the historical demography and the speciation process of two closely related species of land snails from western Europe, Candidula unifasciata and C. rugosiuscula. Historical demographic analysis indicated fluctuations in the size of ancestral populations, probably driven by Pleistocene climatic fluctuations. Although the current population distributions of both species do not overlap, our approximate Bayesi…
Collocation Method for Linear BVPs via B-spline Based Fuzzy Transform
2018
The paper is devoted to an application of a modified F-transform technique based on B-splines in solving linear boundary value problems via the collocation method. An approximate solution is sought as a composite F-transform of a discrete function (which allows the solution to be compactly stored as the values of this discrete function). We demonstrate the effectiveness of the described technique with numerical examples, compare it with other methods and propose theoretical results on the order of approximation when the fuzzy partition is based on cubic B-splines.
Languages with mismatches
2007
AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…
"Indexing structures for approximate string matching
2003
In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by considering the Hamming distance, having the following properties. i) Their size is linear times a polylog of the size of the text on average. ii) For each pattern x, the time spent by our algorithms for finding the list occ(x) of all occurrences of a pattern x in the text, up to a certain distance, is proportional on average to |x| + |occ(x)|, under an additional but realistic hypothesis.
Costly punishment prevails in intergroup conflict.
2011
Understanding how societies resolve conflicts between individual and common interests remains one of the most fundamental issues across disciplines. The observation that humans readily incur costs to sanction uncooperative individuals without tangible individual benefits has attracted considerable attention as a proximate cause as to why cooperative behaviours might evolve. However, the proliferation of individually costly punishment has been difficult to explain. Several studies over the last decade employing experimental designs with isolated groups have found clear evidence that the costs of punishment often nullify the benefits of increased cooperation, rendering the strong human tenden…
Multi-modality of polysomnography signals’ fusion for automatic sleep scoring
2019
Abstract Objective The study aims to develop an automatic sleep scoring method by fusing different polysomnography (PSG) signals and further to investigate PSG signals’ contribution to the scoring result. Methods Eight combinations of four modalities of PSG signals, namely electroencephalogram (EEG), electrooculogram (EOG), electromyogram (EMG), and electrocardiogram (ECG) were considered to find the optimal fusion of PSG signals. A total of 232 features, covering statistical characters, frequency characters, time-frequency characters, fractal characters, entropy characters and nonlinear characters, were derived from these PSG signals. To select the optimal features for each signal fusion, …
Adaptive Importance Sampling: The past, the present, and the future
2017
A fundamental problem in signal processing is the estimation of unknown parameters or functions from noisy observations. Important examples include localization of objects in wireless sensor networks [1] and the Internet of Things [2]; multiple source reconstruction from electroencephalograms [3]; estimation of power spectral density for speech enhancement [4]; or inference in genomic signal processing [5]. Within the Bayesian signal processing framework, these problems are addressed by constructing posterior probability distributions of the unknowns. The posteriors combine optimally all of the information about the unknowns in the observations with the information that is present in their …
Are nonlinear model-free conditional entropy approaches for the assessment of cardiac control complexity superior to the linear model-based one?
2016
Objective : We test the hypothesis that the linear model-based (MB) approach for the estimation of conditional entropy (CE) can be utilized to assess the complexity of the cardiac control in healthy individuals. Methods : An MB estimate of CE was tested in an experimental protocol (i.e., the graded head-up tilt) known to produce a gradual decrease of cardiac control complexity as a result of the progressive vagal withdrawal and concomitant sympathetic activation. The MB approach was compared with traditionally exploited nonlinear model-free (MF) techniques such as corrected approximate entropy, sample entropy, corrected CE, two k -nearest-neighbor CE procedures and permutation CE. Electroca…
Characterization of entropy measures against data loss: Application to EEG records
2012
This study is aimed at characterizing three signal entropy measures, Approximate Entropy (ApEn), Sample Entropy (SampEn) and Multiscale Entropy (MSE) over real EEG signals when a number of samples are randomly lost due to, for example, wireless data transmission. The experimental EEG database comprises two main signal groups: control EEGs and epileptic EEGs. Results show that both SampEn and ApEn enable a clear distinction between control and epileptic signals, but SampEn shows a more robust performance over a wide range of sample loss ratios. MSE exhibits a poor behavior for ratios over a 40% of sample loss. The EEG non-stationary and random trends are kept even when a great number of samp…
Characterization of the LGBTI-speaking community discourse. An approach to Hispanic queer linguistics.
2020
Toda subcultura forma una comunidad lingüística particular en la que, aunque se comparta la lengua con el resto de la sociedad, varía el habla en ciertos aspectos. Es el caso de la comunidad de habla LGTBI, que se hace servir de un léxico peculiar, así como una fraseología característica, unas estructuras gramaticales especiales y, en definitiva, unos recursos pragmáticos muy llamativos que tienen como objetivo mitigar ciertos enunciados, intensificar otros en determinados contextos y construir actos de habla afiliativos que expresen solidaridad social. Por otro lado, cumple una función muy importante en la construcción identitaria de sus usuarios. En este trabajo se propone un análisis pra…