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.

DETERMINAÇÃO DAS FORMAS DO ARCO DENTÁRIO INFERIOR NA OCLUSÃO NORMAL NATURAL

Com a finalidade de determinar as formas do arco dentário inferior de maior incidência na oclusão normal natural, utilizou-se um método matemático associado ao emprego de uma função polinomial, o qual foi aplicado a 63 modelos de arcadas inferiores selecionados a partir de 6118 adolescentes. Todos os indivíduos eram portadores de dentição permanente, incluindo os segundos molares, e oclusão normal natural. Em cada dente foi fixada uma esfera de vidro, que teve a função de simular o acessório do aparelho ortodôntico, sendo utilizada na medição das distâncias entre o centro da imagem dessas esferas aos eixos x e y. Após a digitalização dos modelos de gesso, as imagens foram plotadas em um programa de computador, a fim de se obterem a função polinomial de sexto grau e o gráfico dessa função para os 126 segmentos de curva, originados das secções das imagens em lado direito e esquerdo. A seguir organizaram-se esses segmentos, de acordo com as características da curvatura anterior dos arcos dentários, em oito grupos diferentes de formas, que receberam as denominações de Forma A, Forma B, Forma C, Forma D, Forma E, Forma F, Forma G, Forma H. Cada grupo foi, então, dividido em três subgrupos, conforme os tamanhos pequeno, médio e grande. Os resultados indicaram 23 formas representativas do arco dentário inferior e uma forma média para a oclusão normal natural.

DETERMINAÇÃO DAS FORMAS DO ARCO DENTÁRIO INFERIOR NA OCLUSÃO NORMAL NATURAL

Com a finalidade de determinar as formas do arco dentário inferior de maior incidência na oclusão normal natural, utilizou-se um método matemático associado ao emprego de uma função polinomial, o qual foi aplicado a 63 modelos de arcadas inferiores selecionados a partir de 6118 adolescentes. Todos os indivíduos eram portadores de dentição permanente, incluindo os segundos molares, e oclusão normal natural. Em cada dente foi fixada uma esfera de vidro, que teve a função de simular o acessório do aparelho ortodôntico, sendo utilizada na medição das distâncias entre o centro da imagem dessas esferas aos eixos x e y. Após a digitalização dos modelos de gesso, as imagens foram plotadas em um programa de computador, a fim de se obterem a função polinomial de sexto grau e o gráfico dessa função para os 126 segmentos de curva, originados das secções das imagens em lado direito e esquerdo. A seguir organizaram-se esses segmentos, de acordo com as características da curvatura anterior dos arcos dentários, em oito grupos diferentes de formas, que receberam as denominações de Forma A, Forma B, Forma C, Forma D, Forma E, Forma F, Forma G, Forma H. Cada grupo foi, então, dividido em três subgrupos, conforme os tamanhos pequeno, médio e grande. Os resultados indicaram 23 formas representativas do arco dentário inferior e uma forma média para a oclusão normal natural.

Using three-dimensional microfluidic networks for solving computationally hard problems

This paper describes the design of a parallel algorithm that uses moving fluids in a three-dimensional microfluidic system to solve a nondeterministically polynomial complete problem (the maximal clique problem) in polynomial time. This algorithm relies on (i) parallel fabrication of the microfluidic system, (ii) parallel searching of all potential solutions by using fluid flow, and (iii) parallel optical readout of all solutions. This algorithm was implemented to solve the maximal clique problem for a simple graph with six vertices. The successful implementation of this algorithm to compute solutions for small-size graphs with fluids in microchannels is not useful, per se, but does suggest broader application for microfluidics in computation and control.

A positivity result in the theory of Macdonald polynomials

We outline here a proof that a certain rational function Cn(q, t), which has come to be known as the “q, t-Catalan,” is in fact a polynomial with positive integer coefficients. This has been an open problem since 1994. Because Cn(q, t) evaluates to the Catalan number at t = q = 1, it has also been an open problem to find a pair of statistics a, b on the collection

SoxR, a [2Fe-2S] transcription factor, is active only in its oxidized form.

SoxR protein is known to function both as a sensor and as a transcriptional activator for a superoxide response regulon in Escherichia coli. The activity of SoxR was tested by its ability to enable the transcription of its target gene, soxS, in vitro. The activity of the oxidized form was lost when its [2Fe-2S] clusters were reduced by dithionite under anaerobic conditions, and it was rapidly restored by autooxidation. This result is consistent with the hypothesis that induction of the regulon is effected by the univalent oxidation of the Fe-S centers of SoxR. In vivo, this oxidation may be caused by an alteration of the redox balance of electron chain intermediates that normally maintains soxR in an inactive, reduced state. Oxidized SoxR was about twice as effective as reduced SoxR in protecting the soxS operator from endonucleolytic cleavage. However, this difference could not account for a greater than 50-fold difference in their activities and therefore could not support a model in which oxidation activates SoxR by enabling it to bind to DNA. NADPH, ferredoxin, flavodoxin, or ferredoxin (flavodoxin):NADP+ reductase could not reduce SoxR directly in vitro at a measurable rate. The midpoint potential for SoxR was measured at -283 mV.