Search results for "REEs"
showing 10 items of 921 documents
Restricted 123-avoiding Baxter permutations and the Padovan numbers
2007
AbstractBaxter studied a particular class of permutations by considering fixed points of the composite of commuting functions. This class is called Baxter permutations. In this paper we investigate the number of 123-avoiding Baxter permutations of length n that also avoid (or contain a prescribed number of occurrences of) another certain pattern of length k. In several interesting cases the generating function depends only on k and is expressed via the generating function for the Padovan numbers.
On extremal cases of Hopcroft’s algorithm
2010
AbstractIn this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees of freedom, so there can exist different executions that can lead to different sequences of refinements of the set of the states up to the final partition. We find an infinite family of binary automata for which such a process is unique, whatever strategy is chosen. Some recent papers (cf. Berstel and Carton (2004) [3], Castiglione et al. (2008) [6] and Berstel et al. (2009) [1]) have been devoted to find families of automata for which Hopcroft’s algorithm has its worst execution time. They are unary automata as…
Hopcroft's algorithm and tree-like automata
2011
Minimizing a deterministic finite automata (DFA) is a very important problem in theory of automata and formal languages. Hopcroft's algorithm represents the fastest known solution to the such a problem. In this paper we analyze the behavior of this algorithm on a family binary automata, called tree-like automata, associated to binary labeled trees constructed by words. We prove that all the executions of the algorithm on tree-like automata associated to trees, constructed by standard words, have running time with the same asymptotic growth rate. In particular, we provide a lower and upper bound for the running time of the algorithm expressed in terms of combinatorial properties of the trees…
Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks
2017
A minimum node weight spanning tree in a weighted, directed graph is a tree whose node with maximum out-weight is minimal among all spanning trees. This type of trees are important because they appear in the solutions of the maximum lifetime broadcasting problem in wireless sensor networks. In a complete graph build of N nodes there are NN-2 spanning trees and to find such trees it is necessary to perform more than O(NN-2) operations. In this paper we propose an algorithm for searching the minimum node weight spanning trees in the graph. In the proposed algorithm, instead of calculating the symbolic determinant of the generalized Laplacian matrix, numerical operations on its exponents are p…
Data Compression Using Wavelet and Local Cosine Transforms
2015
The chapter describes an algorithm that compresses two-dimensional data arrays, which are piece-wise smooth in one direction and have oscillating events in the other direction. Seismic, hyper-spectral and fingerprints data, for example, have such a mixed structure. The transform part of the compression process is an algorithm that combines wavelet and local cosine transform (LCT). The quantization and the entropy coding parts of the compression are taken from the SPIHT codec. To efficiently apply the SPIHT codec to a mixed coefficients array, reordering of the LCT coefficients takes place. On the data arrays, which have the mixed structure, this algorithm outperforms other algorithms that a…
Discrete wavelet transform based multispectral filter array demosaicking
2013
International audience; The idea of colour filter array may be adapted to multi-spectral image acquisition by integrating more filter types into the array, and developing associated demosaicking algorithms. Several methods employing discrete wavelet transform (DWT) have been proposed for CFA demosaicking. In this work, we put forward an extended use of DWT for mul-tispectral filter array demosaicking. The extension seemed straightforward, however we observed striking results. This work contributes to better understanding of the issue by demonstrating that spectral correlation and spatial resolution of the images exerts a crucial influence on the performance of DWT based demosaicking.
Monte Carlo Simulation of a Modified Chi Distribution with Unequal Variances in the Generating Gaussians. A Discrete Methodology to Study Collective …
2020
The Chi distribution is a continuous probability distribution of a random variable obtained from the positive square root of the sum of k squared variables, each coming from a standard Normal distribution (mean = 0 and variance = 1). The variable k indicates the degrees of freedom. The usual expression for the Chi distribution can be generalised to include a parameter which is the variance (which can take any value) of the generating Gaussians. For instance, for k = 3, we have the case of the Maxwell-Boltzmann (MB) distribution of the particle velocities in the Ideal Gas model of Physics. In this work, we analyse the case of unequal variances in the generating Gaussians whose distribution w…
Fractional Derivatives in Interval Analysis
2017
In this paper, interval fractional derivatives are presented. We consider uncertainty in both the order and the argument of the fractional operator. The approach proposed takes advantage of the property of Fourier and Laplace transforms with respect to the translation operator, in order to first define integral transform of interval functions. Subsequently, the main interval fractional integrals and derivatives, such as the Riemann–Liouville, Caputo, and Riesz, are defined based on their properties with respect to integral transforms. Moreover, uncertain-but-bounded linear fractional dynamical systems, relevant in modeling fractional viscoelasticity, excited by zero-mean stationary Gaussian…
Split decomposition A technique to analyze viral evolution
1993
A clustering technique allowing a restricted amount of overlapping and based on an abstract theory of coherent decompositions of finite metrics is used to analyze the evolution of foot-and-mouth disease viruses. The emerging picture is compatible with the existence of viral populations with a quasispecies structure and illustrates various forms of evolution of this virus family. In addition, it allows the correlation of these forms with geographic occurrence.
De la normatividad hacia la alteridad. Estudio mixto sobre el tratamiento de la diversidad en películas Disney
2021
La diversidad es condición sine qua non de la propia existencia, no entendida únicamente a nivel físico sino como cualquier diferencia entre personas. Por ello, esta se percibe como la suma de la normatividad y alteridad. Esta realidad se convierte en una de las pretensiones de la escuela actual, especialmente durante la Educación Infantil como periodo educativo en el que se asientan los valores de tolerancia y respeto. No obstante, se cuenta con barreras en cuanto a dicho paradigma inclusivo con elementos como la cultura visual de la imagen que en parte de sus producciones incluye un discurso separatista, clasista y en contra de la diferencia. Un ejemplo concreto radica en la colección “Lo…