Generating all permutations by context-free grammars in Chomsky normal form

Let Ln be the finite language of all n! strings that are permutations of n different symbols (n1). We consider context-free grammars Gn in Chomsky normal form that generate Ln. In particular we study a few families {Gn}n1, satisfying L(Gn)=Ln for n1, with respect to their descriptional complexity, i.e. we determine the number of nonterminal symbols and the number of production rules of Gn as functions of n

A General Framework for Static Cost Analysis of Parallel Logic Programs

The estimation and control of resource usage is now an important challenge in an increasing number of computing systems. In particular, requirements on timing and energy arise in a wide variety of applications such as internet of things, cloud computing, health, transportation, and robots. At the same time, parallel computing, with (heterogeneous) multi-core platforms in particular, has become the dominant paradigm in computer architecture. Predicting resource usage on such platforms poses a difficult challenge. Most work on static resource analysis has focused on sequential programs, and relatively little progress has been made on the analysis of parallel programs, or more specifically on parallel logic programs. We propose a novel, general, and flexible framework for setting up cost equations/relations which can be instantiated for performing resource usage analysis of parallel logic programs for a wide range of resources, platforms, and execution models. The analysis estimates both lower and upper bounds on the resource usage of a parallel program (without executing it) as functions on input data sizes. In addition, it also infers other meaningful information to better exploit and assess the potential and actual parallelism of a system. We develop a method for solving cost relations involving the max function that arise in the analysis of parallel programs. Finally, we instantiate our general framework for the analysis of logic programs with Independent AndParallelism, report on an implementation within the CiaoPP system, and provide some experimental results. To our knowledge, this is the first approach to the cost analysis of parallel logic programs

Generating All Permutations by Context-Free Grammars in Greibach Normal Form

We consider context-free grammars $G_n$ in Greibach normal form and, particularly, in Greibach $m$-form ($m=1,2$) which generates the finite language $L_n$ of all $n!$ strings that are permutations of $n$ different symbols ($n\geq 1$). These grammars are investigated with respect to their descriptional complexity, i.e., we determine the number of nonterminal symbols and the number of production rules of $G_n$ as functions of $n$. As in the case of Chomsky normal form these descriptional complexity measures grow faster than any polynomial function

Mean asymptotic behaviour of radix-rational sequences and dilation equations (Extended version)

The generating series of a radix-rational sequence is a rational formal power series from formal language theory viewed through a fixed radix numeration system. For each radix-rational sequence with complex values we provide an asymptotic expansion for the sequence of its Ces\`aro means. The precision of the asymptotic expansion depends on the joint spectral radius of the linear representation of the sequence; the coefficients are obtained through some dilation equations. The proofs are based on elementary linear algebra

Follow-the-leader Formation Marching Through a Scalable O(log2n) Parallel Architecture.

An important topic in the field of Multi Robot Systems focuses on motion coordination and synchronization for formation keeping. Although several works have addressed such problem, little attention has been devoted to study the computational complexity within the framework of large-scale systems. This paper presents our current work on how to achieve high computational performance for systems composed by a large number of robots that must fulfill with a marching and formation task. A scalable Multi-Processor Parallel Architecture is introduced with the purpose of achieving scalability, i.e., computation time of O(log2n) for a n-robots system. Our architecture has been tested onto a multi-processor system and validated against several simulations testing

On-the-fly ab initio semiclassical evaluation of time-resolved electronic spectra

We present a methodology for computing vibrationally and time-resolved pump-probe spectra, which takes into account all vibrational degrees of freedom and is based on the combination of the thawed Gaussian approximation with on-the-fly ab initio evaluation of the electronic structure. The method is applied to the phenyl radical and compared with two more approximate approaches based on the global harmonic approximation - the global harmonic method expands both the ground- and excited-state potential energy surfaces to the second order about the corresponding minima, while the combined global harmonic/on-the-fly method retains the on-the-fly scheme for the excited-state wavepacket propagation. We also compare the spectra by considering their means and widths, and show analytically how these measures are related to the properties of the semiclassical wavepacket. We find that the combined approach is better than the global harmonic one in describing the vibrational structure, while the global harmonic approximation estimates better the overall means and widths of the spectra due to a partial cancellation of errors. Although the full-dimensional on-the-fly ab initio result seems to reflect the dynamics of only one mode, we show, by performing exact quantum calculations, that this simple structure cannot be recovered using a one-dimensional model. Yet, the agreement between the quantum and semiclassical spectra in this simple, but anharmonic model lends additional support for the full-dimensional ab initio thawed Gaussian calculation of the phenyl radical spectra. We conclude that the thawed Gaussian approximation provides a viable alternative to the expensive or unfeasible exact quantum calculations in cases, where low-dimensional models are not sufficiently accurate to represent the full system.Comment: Last 6 pages contain the Supplementary Materia

Fuzzy Quasi-Metric Spaces: Bicompletion, Contractions on Product Spaces, and Applications to Access Predictions

Desde que L.A. Zadeh presentó la teoría de conjuntos difusos en 1965, esta se ha usado en una amplia serie de áreas de las matemáticas y se ha aplicado en una gran variedad de escenarios de la vida real. Estos escenarios cubren procesos complejos sin modelo matemático sencillo tales como dispositivos de control industrial, reconocimiento de patrones o sistemas que gestionen información imprecisa o altamente impredecible. La topología difusa es un importante ejemplo de uso de la teoría de L.A. Zadeh. Durante años, los autores de este campo han buscado obtener la definición de un espacio métrico difuso para medir la distancia entre elementos según grados de proximidad. El presente trabajo trata acerca de la bicompletación de espacios casi-métricos difusos en el sentido de Kramosil y Michalek. Sherwood probó que todo espacio métrico difuso admite completación que es única excepto por isometría basándose en propiedades de la métrica de Lévy. Probamos aquí que todo espacio casi-métrico difuso tiene bicompletación usando directamente el supremo de conjuntos en [0,1] y límites inferiores de secuencias en [0,1] en lugar de usar la métrica de Lévy. Aprovechamos tanto la bicompletitud y bicompletación de espacios casi-métricos difusos como las propiedades de los espacios métricos difusos y difusos intuicionistas para presentar varias aplicaciones a problemas del campo de la informática. Así estudiamos la existencia y unicidad de solución para las ecuaciones de recurrencia asociadas a ciertos algoritmos formados por dos procedimientos recursivos. Para analizar su complejidad aplicamos el principio de contracción de Banach tanto en un producto de casi-métricas no-Arquimedianas en el dominio de las palabras como en la casi-métrica producto de dos espacios de complejidad casi-métricos de Schellekens. Estudiamos también una aplicación de espacios métricos difusos a sistemas de información basados en localidad de accesos.Castro Company, F. (2010). Fuzzy Quasi-Metric Spaces: Bicompletion, Contractions on Product Spaces, and Applications to Access Predictions [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/8420Palanci