Automated wordlength optimization framework for multi-source statistical interval-based analysis of nonlinear systems with control-flow structures

El uso de aritmética de punto fijo es una opción de diseño muy extendida en sistemas con fuertes restricciones de área, consumo o rendimiento. Para producir implementaciones donde los costes se minimicen sin impactar negativamente en la precisión de los resultados debemos llevar a cabo una asignación cuidadosa de anchuras de palabra. Encontrar la combinación óptima de anchuras de palabra en coma fija para un sistema dado es un problema combinatorio NP-hard al que los diseñadores dedican entre el 25 y el 50 % del ciclo de diseño. Las plataformas hardware reconfigurables, como son las FPGAs, también se benefician de las ventajas que ofrece la aritmética de coma fija, ya que éstas compensan las frecuencias de reloj más bajas y el uso más ineficiente del hardware que hacen estas plataformas respecto a los ASICs. A medida que las FPGAs se popularizan para su uso en computación científica los diseños aumentan de tamaño y complejidad hasta llegar al punto en que no pueden ser manejados eficientemente por las técnicas actuales de modelado de señal y ruido de cuantificación y de optimización de anchura de palabra. En esta Tesis Doctoral exploramos distintos aspectos del problema de la cuantificación y presentamos nuevas metodologías para cada uno de ellos: Las técnicas basadas en extensiones de intervalos han permitido obtener modelos de propagación de señal y ruido de cuantificación muy precisos en sistemas con operaciones no lineales. Nosotros llevamos esta aproximación un paso más allá introduciendo elementos de Multi-Element Generalized Polynomial Chaos (ME-gPC) y combinándolos con una técnica moderna basada en Modified Affine Arithmetic (MAA) estadístico para así modelar sistemas que contienen estructuras de control de flujo. Nuestra metodología genera los distintos caminos de ejecución automáticamente, determina las regiones del dominio de entrada que ejercitarán cada uno de ellos y extrae los momentos estadísticos del sistema a partir de dichas soluciones parciales. Utilizamos esta técnica para estimar tanto el rango dinámico como el ruido de redondeo en sistemas con las ya mencionadas estructuras de control de flujo y mostramos la precisión de nuestra aproximación, que en determinados casos de uso con operadores no lineales llega a tener tan solo una desviación del 0.04% con respecto a los valores de referencia obtenidos mediante simulación. Un inconveniente conocido de las técnicas basadas en extensiones de intervalos es la explosión combinacional de términos a medida que el tamaño de los sistemas a estudiar crece, lo cual conlleva problemas de escalabilidad. Para afrontar este problema presen tamos una técnica de inyección de ruidos agrupados que hace grupos con las señales del sistema, introduce las fuentes de ruido para cada uno de los grupos por separado y finalmente combina los resultados de cada uno de ellos. De esta forma, el número de fuentes de ruido queda controlado en cada momento y, debido a ello, la explosión combinatoria se minimiza. También presentamos un algoritmo de particionado multi-vía destinado a minimizar la desviación de los resultados a causa de la pérdida de correlación entre términos de ruido con el objetivo de mantener los resultados tan precisos como sea posible. La presente Tesis Doctoral también aborda el desarrollo de metodologías de optimización de anchura de palabra basadas en simulaciones de Monte-Cario que se ejecuten en tiempos razonables. Para ello presentamos dos nuevas técnicas que exploran la reducción del tiempo de ejecución desde distintos ángulos: En primer lugar, el método interpolativo aplica un interpolador sencillo pero preciso para estimar la sensibilidad de cada señal, y que es usado después durante la etapa de optimización. En segundo lugar, el método incremental gira en torno al hecho de que, aunque es estrictamente necesario mantener un intervalo de confianza dado para los resultados finales de nuestra búsqueda, podemos emplear niveles de confianza más relajados, lo cual deriva en un menor número de pruebas por simulación, en las etapas iniciales de la búsqueda, cuando todavía estamos lejos de las soluciones optimizadas. Mediante estas dos aproximaciones demostramos que podemos acelerar el tiempo de ejecución de los algoritmos clásicos de búsqueda voraz en factores de hasta x240 para problemas de tamaño pequeño/mediano. Finalmente, este libro presenta HOPLITE, una infraestructura de cuantificación automatizada, flexible y modular que incluye la implementación de las técnicas anteriores y se proporciona de forma pública. Su objetivo es ofrecer a desabolladores e investigadores un entorno común para prototipar y verificar nuevas metodologías de cuantificación de forma sencilla. Describimos el flujo de trabajo, justificamos las decisiones de diseño tomadas, explicamos su API pública y hacemos una demostración paso a paso de su funcionamiento. Además mostramos, a través de un ejemplo sencillo, la forma en que conectar nuevas extensiones a la herramienta con las interfaces ya existentes para poder así expandir y mejorar las capacidades de HOPLITE. ABSTRACT Using fixed-point arithmetic is one of the most common design choices for systems where area, power or throughput are heavily constrained. In order to produce implementations where the cost is minimized without negatively impacting the accuracy of the results, a careful assignment of word-lengths is required. The problem of finding the optimal combination of fixed-point word-lengths for a given system is a combinatorial NP-hard problem to which developers devote between 25 and 50% of the design-cycle time. Reconfigurable hardware platforms such as FPGAs also benefit of the advantages of fixed-point arithmetic, as it compensates for the slower clock frequencies and less efficient area utilization of the hardware platform with respect to ASICs. As FPGAs become commonly used for scientific computation, designs constantly grow larger and more complex, up to the point where they cannot be handled efficiently by current signal and quantization noise modelling and word-length optimization methodologies. In this Ph.D. Thesis we explore different aspects of the quantization problem and we present new methodologies for each of them: The techniques based on extensions of intervals have allowed to obtain accurate models of the signal and quantization noise propagation in systems with non-linear operations. We take this approach a step further by introducing elements of MultiElement Generalized Polynomial Chaos (ME-gPC) and combining them with an stateof- the-art Statistical Modified Affine Arithmetic (MAA) based methodology in order to model systems that contain control-flow structures. Our methodology produces the different execution paths automatically, determines the regions of the input domain that will exercise them, and extracts the system statistical moments from the partial results. We use this technique to estimate both the dynamic range and the round-off noise in systems with the aforementioned control-flow structures. We show the good accuracy of our approach, which in some case studies with non-linear operators shows a 0.04 % deviation respect to the simulation-based reference values. A known drawback of the techniques based on extensions of intervals is the combinatorial explosion of terms as the size of the targeted systems grows, which leads to scalability problems. To address this issue we present a clustered noise injection technique that groups the signals in the system, introduces the noise terms in each group independently and then combines the results at the end. In this way, the number of noise sources in the system at a given time is controlled and, because of this, the combinato rial explosion is minimized. We also present a multi-way partitioning algorithm aimed at minimizing the deviation of the results due to the loss of correlation between noise terms, in order to keep the results as accurate as possible. This Ph.D. Thesis also covers the development of methodologies for word-length optimization based on Monte-Carlo simulations in reasonable times. We do so by presenting two novel techniques that explore the reduction of the execution times approaching the problem in two different ways: First, the interpolative method applies a simple but precise interpolator to estimate the sensitivity of each signal, which is later used to guide the optimization effort. Second, the incremental method revolves on the fact that, although we strictly need to guarantee a certain confidence level in the simulations for the final results of the optimization process, we can do it with more relaxed levels, which in turn implies using a considerably smaller amount of samples, in the initial stages of the process, when we are still far from the optimized solution. Through these two approaches we demonstrate that the execution time of classical greedy techniques can be accelerated by factors of up to ×240 for small/medium sized problems. Finally, this book introduces HOPLITE, an automated, flexible and modular framework for quantization that includes the implementation of the previous techniques and is provided for public access. The aim is to offer a common ground for developers and researches for prototyping and verifying new techniques for system modelling and word-length optimization easily. We describe its work flow, justifying the taken design decisions, explain its public API and we do a step-by-step demonstration of its execution. We also show, through an example, the way new extensions to the flow should be connected to the existing interfaces in order to expand and improve the capabilities of HOPLITE.

Positive solutions for nonlinear m-point Eigenvalue problems

In this paper, we are concerned with determining values of lambda, for which there exist positive solutions of the nonlinear eigenvalue problem [GRAPHICS] where a, b, c, d is an element of [0, infinity), xi(i) is an element of (0, 1), alpha(i), beta(i) is an element of [0 infinity) (for i is an element of {1, ..., m - 2}) are given constants, p, q is an element of C ([0, 1], (0, infinity)), h is an element of C ([0, 1], [0, infinity)), and f is an element of C ([0, infinity), [0, infinity)) satisfying some suitable conditions. Our proofs are based on Guo-Krasnoselskii fixed point theorem. (C) 2004 Elsevier Inc. All rights reserved.

On the Optimal Allocations in Economy with Fixed Total Resources

Здравко Д. Славов - В тази статия се разглежда математически модел на икономика с фиксирани общи ресурси, както и краен брой агенти и блага. Обсъжда се ролята на някои предположения за отношенията на предпочитание на икономическите агенти, които влияят на характеристиките на оптимално разпределените дялове. Доказва се, че множеството на оптимално разпределените дялове е свиваемо и притежава свойството на неподвижната точка.

Indice de Point Fixe pour les Morphismes de Chaînes

2000 Mathematics Subject Classification: 54H25, 55M20.

Minimal Nielsen Root Classes and Roots of Liftings

Given a continuous map f : K -> M from a 2-dimensional CW complex into a closed surface, the Nielsen root number N(f) and the minimal number of roots mu(f) of f satisfy N(f) <= mu(f). But, there is a number mu(C)(f) associated to each Nielsen root class of f, and an important problem is to know when mu(f) = mu(C)(f)N(f). In addition to investigate this problem, we determine a relationship between mu(f) and mu((f) over tilde), when (f) over tilde f is a lifting of f through a covering space, and we find a connection between this problems, with which we answer several questions related to them when the range of the maps is the projective plane.

Phase diagram of a model for a binary mixture of nematic molecules on a Bethe lattice

We investigate the phase diagram of a discrete version of the Maier-Saupe model with the inclusion of additional degrees of freedom to mimic a distribution of rodlike and disklike molecules. Solutions of this problem on a Bethe lattice come from the analysis of the fixed points of a set of nonlinear recursion relations. Besides the fixed points associated with isotropic and uniaxial nematic structures, there is also a fixed point associated with a biaxial nematic structure. Due to the existence of large overlaps of the stability regions, we resorted to a scheme to calculate the free energy of these structures deep in the interior of a large Cayley tree. Both thermodynamic and dynamic-stability analyses rule out the presence of a biaxial phase, in qualitative agreement with previous mean-field results.

Nilpotent noncommutativity and renormalization

We analyze renormalizability properties of noncommutative (NC) theories with a bifermionic NC parameter. We introduce a new four-dimensional scalar field model which is renormalizable at all orders of the loop expansion. We show that this model has an infrared stable fixed point (at the one-loop level). We check that the NC QED (which is one-loop renormalizable with a usual NC parameter) remains renormalizable when the NC parameter is bifermionic, at least to the extent of one-loop diagrams with external photon legs. Our general conclusion is that bifermionic noncommutativity improves renormalizability properties of NC theories.

Energy gain induced by boundary crisis

We consider a nonlinear system and show the unexpected and surprising result that, even for high dissipation, the mean energy of a particle can attain higher values than when there is no dissipation in the system. We reconsider the time-dependent annular billiard in the presence of inelastic collisions with the boundaries. For some magnitudes of dissipation, we observe the phenomenon of boundary crisis, which drives the particles to an asymptotic attractive fixed point located at a value of energy that is higher than the mean energy of the nondissipative case and so much higher than the mean energy just before the crisis. We should emphasize that the unexpected results presented here reveal the importance of a nonlinear dynamics analysis to explain the paradoxical strategy of introducing dissipation in the system in order to gain energy.

Existence results for a damped second order abstract functional differential equation with impulses

In this work we study the existence and regularity of mild solutions for a damped second order abstract functional differential equation with impulses. The results are obtained using the cosine function theory and fixed point criterions. (C) 2009 Elsevier Ltd. All rights reserved.

Twisted quantum affine superalgebra U-q[sl(2/2)((2))], U-q[osp(2/2)] invariant R-matrices and a new integrable electronic model

We describe the twisted affine superalgebra sl(2\2)((2)) and its quantized version U-q[sl(2\2)((2))]. We investigate the tensor product representation of the four-dimensional grade star representation for the fixed-point sub superalgebra U-q[osp(2\2)]. We work out the tensor product decomposition explicitly and find that the decomposition is not completely reducible. Associated with this four-dimensional grade star representation we derive two U-q[osp(2\2)] invariant R-matrices: one of them corresponds to U-q [sl(2\2)(2)] and the other to U-q [osp(2\2)((1))]. Using the R-matrix for U-q[sl(2\2)((2))], we construct a new U-q[osp(2\2)] invariant strongly correlated electronic model, which is integrable in one dimension. Interestingly this model reduces in the q = 1 limit, to the one proposed by Essler et al which has a larger sl(2\2) symmetry.

Metastable chaos in the ammonia ring laser

We report experimental studies of metastable chaos in the far-infrared ammonia ring: laser. When the laser pump power is switched from above chaos threshold to slightly below, chaotic intensity pulsations continue for a varying time afterward before decaying to either periodic or cw emission. The behavior is in good qualitative agreement with that predicted by the Lorenz equations, previously used to describe this laser. The statistical distribution of the duration of the chaotic transient is measured and shown to be in excellent agreement with the Lorenz equations in showing a modified exponential distribution. We also give a brief numerical analysis and graphical visualization of the Lorenz equations in phase space illustrating the boundary between the metastable chaotic and the stable fixed point basins of attraction. This provides an intuitive understanding of the metastable dynamics of the Lorenz equations and the experimental system.

Two-link approximation schemes for loss networks with linear structure and trunk reservation

Loss networks have long been used to model various types of telecommunication network, including circuit-switched networks. Such networks often use admission controls, such as trunk reservation, to optimize revenue or stabilize the behaviour of the network. Unfortunately, an exact analysis of such networks is not usually possible, and reduced-load approximations such as the Erlang Fixed Point (EFP) approximation have been widely used. The performance of these approximations is typically very good for networks without controls, under several regimes. There is evidence, however, that in networks with controls, these approximations will in general perform less well. We propose an extension to the EFP approximation that gives marked improvement for a simple ring-shaped network with trunk reservation. It is based on the idea of considering pairs of links together, thus making greater allowance for dependencies between neighbouring links than does the EFP approximation, which only considers links in isolation.

Entanglement in the steady state of a collective-angular-momentum (Dicke) model

We model the behavior of an ion trap with all ions driven simultaneously and coupled collectively to a heat bath. The equations for this system are similar to the irreversible dynamics of a collective angular momentum system known as the Dicke model. We show how the steady state of the ion trap as a dissipative many-body system driven far from equilibrium can exhibit quantum entanglement. We calculate the entanglement of this steady state for two ions in the trap and in the case of more than two ions we calculate the entanglement between two ions by tracing over all the other ions. The entanglement in the steady state is a maximum for the parameter values corresponding roughly to a bifurcation of a fixed point in the corresponding semiclassical dynamics. We conjecture that this is a general mechanism for entanglement creation in driven dissipative quantum systems.

Product form approximations for highly linear loss networks with trunk reservation

Admission controls, such as trunk reservation, are often used in loss networks to optimise their performance. Since the numerical evaluation of performance measures is complex, much attention has been given to finding approximation methods. The Erlang Fixed-Point (EFP) approximation, which is based on an independent blocking assumption, has been used for networks both with and without controls. Several more elaborate approximation methods which account for dependencies in blocking behaviour have been developed for the uncontrolled setting. This paper is an exploratory investigation of extensions and synthesis of these methods to systems with controls, in particular, trunk reservation. In order to isolate the dependency factor, we restrict our attention to a highly linear network. We will compare the performance of the resulting approximations against the benchmark of the EFP approximation extended to the trunk reservation setting. By doing this, we seek to gain insight into the critical factors in constructing an effective approximation. (C) 2003 Elsevier Ltd. All rights reserved.

A reduced load approximation accounting for link interactions in a loss network

This paper is concerned with evaluating the performance of loss networks. Accurate determination of loss network performance can assist in the design and dimen- sioning of telecommunications networks. However, exact determination can be difficult and generally cannot be done in reasonable time. For these reasons there is much interest in developing fast and accurate approximations. We develop a reduced load approximation that improves on the famous Erlang fixed point approximation (EFPA) in a variety of circumstances. We illustrate our results with reference to a range of networks for which the EFPA may be expected to perform badly.