Evolution of the gene regulatory network controlling flower dorsoventral asymmetry

Tese de Doutoramento em Biologia de Plantas.

Aceleración de Algoritmos en Procesadores Multicore, GPGPU y FPGA. Algorithm Acceleration with Multicore, GPGPU and FPGA Processors.

El avance en la potencia de cómputo en nuestros días viene dado por la paralelización del procesamiento, dadas las características que disponen las nuevas arquitecturas de hardware. Utilizar convenientemente este hardware impacta en la aceleración de los algoritmos en ejecución (programas). Sin embargo, convertir de forma adecuada el algoritmo en su forma paralela es complejo, y a su vez, esta forma, es específica para cada tipo de hardware paralelo. En la actualidad los procesadores de uso general más comunes son los multicore, procesadores paralelos, también denominados Symmetric Multi-Processors (SMP). Hoy en día es difícil hallar un procesador para computadoras de escritorio que no tengan algún tipo de paralelismo del caracterizado por los SMP, siendo la tendencia de desarrollo, que cada día nos encontremos con procesadores con mayor numero de cores disponibles. Por otro lado, los dispositivos de procesamiento de video (Graphics Processor Units - GPU), a su vez, han ido desarrollando su potencia de cómputo por medio de disponer de múltiples unidades de procesamiento dentro de su composición electrónica, a tal punto que en la actualidad no es difícil encontrar placas de GPU con capacidad de 200 a 400 hilos de procesamiento paralelo. Estos procesadores son muy veloces y específicos para la tarea que fueron desarrollados, principalmente el procesamiento de video. Sin embargo, como este tipo de procesadores tiene muchos puntos en común con el procesamiento científico, estos dispositivos han ido reorientándose con el nombre de General Processing Graphics Processor Unit (GPGPU). A diferencia de los procesadores SMP señalados anteriormente, las GPGPU no son de propósito general y tienen sus complicaciones para uso general debido al límite en la cantidad de memoria que cada placa puede disponer y al tipo de procesamiento paralelo que debe realizar para poder ser productiva su utilización. Los dispositivos de lógica programable, FPGA, son dispositivos capaces de realizar grandes cantidades de operaciones en paralelo, por lo que pueden ser usados para la implementación de algoritmos específicos, aprovechando el paralelismo que estas ofrecen. Su inconveniente viene derivado de la complejidad para la programación y el testing del algoritmo instanciado en el dispositivo. Ante esta diversidad de procesadores paralelos, el objetivo de nuestro trabajo está enfocado en analizar las características especificas que cada uno de estos tienen, y su impacto en la estructura de los algoritmos para que su utilización pueda obtener rendimientos de procesamiento acordes al número de recursos utilizados y combinarlos de forma tal que su complementación sea benéfica. Específicamente, partiendo desde las características del hardware, determinar las propiedades que el algoritmo paralelo debe tener para poder ser acelerado. Las características de los algoritmos paralelos determinará a su vez cuál de estos nuevos tipos de hardware son los mas adecuados para su instanciación. En particular serán tenidos en cuenta el nivel de dependencia de datos, la necesidad de realizar sincronizaciones durante el procesamiento paralelo, el tamaño de datos a procesar y la complejidad de la programación paralela en cada tipo de hardware. Today´s advances in high-performance computing are driven by parallel processing capabilities of available hardware architectures. These architectures enable the acceleration of algorithms when thes ealgorithms are properly parallelized and exploit the specific processing power of the underneath architecture. Most current processors are targeted for general pruposes and integrate several processor cores on a single chip, resulting in what is known as a Symmetric Multiprocessing (SMP) unit. Nowadays even desktop computers make use of multicore processors. Meanwhile, the industry trend is to increase the number of integrated rocessor cores as technology matures. On the other hand, Graphics Processor Units (GPU), originally designed to handle only video processing, have emerged as interesting alternatives to implement algorithm acceleration. Current available GPUs are able to implement from 200 to 400 threads for parallel processing. Scientific computing can be implemented in these hardware thanks to the programability of new GPUs that have been denoted as General Processing Graphics Processor Units (GPGPU).However, GPGPU offer little memory with respect to that available for general-prupose processors; thus, the implementation of algorithms need to be addressed carefully. Finally, Field Programmable Gate Arrays (FPGA) are programmable devices which can implement hardware logic with low latency, high parallelism and deep pipelines. Thes devices can be used to implement specific algorithms that need to run at very high speeds. However, their programmability is harder that software approaches and debugging is typically time-consuming. In this context where several alternatives for speeding up algorithms are available, our work aims at determining the main features of thes architectures and developing the required know-how to accelerate algorithm execution on them. We look at identifying those algorithms that may fit better on a given architecture as well as compleme

Modelling of a symmetric molten carbonate fuel cell stack

Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2011

Corrigendum to "On randomized matching mechanisms" [Economic Theory 8(1996)377-381]

Ma (1996) studied the random order mechanism, a matching mechanism suggested by Roth and Vande Vate (1990) for marriage markets. By means of an example he showed that the random order mechanism does not always reach all stable matchings. Although Ma's (1996) result is true, we show that the probability distribution he presented - and therefore the proof of his Claim 2 - is not correct. The mistake in the calculations by Ma (1996) is due to the fact that even though the example looks very symmetric, some of the calculations are not as ''symmetric.''

Elicited bid functions in (a)symmetric first-price auctions

We report on a series of experiments that examine bidding behavior in first-price sealed bid auctions with symmetric and asymmetric bidders. To study the extent of strategic behavior, we use an experimental design that elicits bidders' complete bid functions in each round (auction) of the experiment. In the aggregate, behavior is consistent with the basic equilibrium predictions for risk neutral or homogenous risk averse bidders (extent of bid shading, average seller's revenues and deviations from equilibrium). However, when we look at the extent of best reply behavior and the shape of bid functions, we find that individual behavior is not in line with the received equilibrium models, although it exhibits strategic sophistication.

On the injectivity of the Kudla-Millson lift and surjectivity of the Borcherds lift

We consider the Kudla-Millson lift from elliptic modular forms of weight (p+q)/2 to closed q-forms on locally symmetric spaces corresponding to the orthogonal group O(p,q). We study the L²-norm of the lift following the Rallis inner product formula. We compute the contribution at the Archimedian place. For locally symmetric spaces associated to even unimodular lattices, we obtain an explicit formula for the L²-norm of the lift, which often implies that the lift is injective. For O(p,2) we discuss how such injectivity results imply the surjectivity of the Borcherds lift.

On the number of K3,3-minor-free and maximal K3,3-minor-free graphs

"Vegeu el resum a l'inici del document del fitxer adjunt."

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

On the growth rate of minor-closed classes of graphs

"Vegeu el resum a l'inici del document del fitxer adjunt."

3-Regime symmetric STAR modeling and exchange rate reversion

The breakdown of the Bretton Woods system and the adoption of generalized oating exchange rates ushered in a new era of exchange rate volatility and uncer- tainty. This increased volatility lead economists to search for economic models able to describe observed exchange rate behavior. In the present paper we propose more general STAR transition functions which encompass both threshold nonlinearity and asymmetric e¤ects. Our framework allows for a gradual adjustment from one regime to another, and considers threshold e¤ects by encompassing other existing models, such as TAR models. We apply our methodology to three di¤erent exchange rate data-sets, one for developing countries, and o¢ cial nominal exchange rates, the sec- ond emerging market economies using black market exchange rates and the third for OECD economies.

Subsidies as Optimal Fiscal Stimuli

In the theoretical macroeconomics literature, fiscal policy is almost uniformly taken to mean taxing and spending by a ‘benevolent government’ that exploits the potential aggregate demand externalities inherent in the imperfectly competitive nature of goods markets. Whilst shown to raise aggregate output and employment, these policies crowd-out private consumption and hence typically reduce welfare. In this paper we consider the use of ‘tax-and-subsidise’ instead of ‘taxand- spend’ policies on account of their widespread use by governments, even in the recent recession, to stimulate economic activity. Within a static general equilibrium macro-model with imperfectly competitive good markets we examine the effect of wage and output subsidies and show that, for a small open economy, positive tax and subsidy rates exist which maximise welfare, rendering no intervention as a suboptimal state. We also show that, within a two-country setting, a Nash non-cooperative symmetric equilibrium with positive tax and subsidy rates exists, and that cooperation between trading partners in setting these rates is more expansionary and leads to an improvement upon the non-cooperative solution.

Symmetric planar central configurations of five bodies: Euler plus two

We study planar central configurations of the five-body problem where three of the bodies are collinear, forming an Euler central configuration of the three-body problem, and the two other bodies together with the collinear configuration are in the same plane. The problem considered here assumes certain symmetries. From the three bodies in the collinear configuration, the two bodies at the extremities have equal masses and the third one is at the middle point between the two. The fourth and fifth bodies are placed in a symmetric way: either with respect to the line containing the three bodies, or with respect to the middle body in the collinear configuration, or with respect to the perpendicular bisector of the segment containing the three bodies. The possible stacked five-body central configurations satisfying these types of symmetries are: a rhombus with four masses at the vertices and a fifth mass in the center, and a trapezoid with four masses at the vertices and a fifth mass at the midpoint of one of the parallel sides.

On Strategy-proofness and symmetric single-peakedness

We characterize the class of strategy-proof social choice functions on the domain of symmetric single-peaked preferences. This class is strictly larger than the set of generalized median voter schemes (the class of strategy-proof and tops-only social choice functions on the domain of single-peaked preferences characterized by Moulin (1980)) since, under the domain of symmetric single-peaked preferences, generalized median voter schemes can be disturbed by discontinuity points and remain strategy-proof on the smaller domain. Our result identifies the specific nature of these discontinuities which allow to design non-onto social choice functions to deal with feasibility constraints.

On graphs with few disjoint t-stars

"Vegeu el resum a l'inici del document del fitxer adjunt."

Chirurgie viscérale. Chirurgie mini-invasive: encore moins invasive? Chirurgie oncologique: multidisciplinaire d'abord [Minimally-invasive surgery: even less invasive? Oncological surgery: multidisciplinary first]

Despite advertising for NOTES in 2009, single trocart laparoscopic surgery is about to become a new standard in selected indications. As other important topics, the limits of oncological surgery are extended due to a systematic multidisciplinary approach. To discuss every publication would be difficult and our review will focus on a selected number of papers of importance for daily practice. As examples, the management of acute calculous cholecystitis, gastro-esophageal reflux, inguinal and incisional hernia repair as well as colorectal surgery are presented.