Introducing massively parallel computers into operational weather forecasting

Numerical weather prediction and climate simulation have been among the computationally most demanding applications of high performance computing eversince they were started in the 1950's. Since the 1980's, the most powerful computers have featured an ever larger number of processors. By the early 2000's, this number is often several thousand. An operational weather model must use all these processors in a highly coordinated fashion. The critical resource in running such models is not computation, but the amount of necessary communication between the processors. The communication capacity of parallel computers often fallsfar short of their computational power. The articles in this thesis cover fourteen years of research into how to harness thousands of processors on a single weather forecast or climate simulation, so that the application can benefit as much as possible from the power of parallel high performance computers. The resultsattained in these articles have already been widely applied, so that currently most of the organizations that carry out global weather forecasting or climate simulation anywhere in the world use methods introduced in them. Some further studies extend parallelization opportunities into other parts of the weather forecasting environment, in particular to data assimilation of satellite observations.

FPGA-Based Control Design for Power Electronic Applications

Tehoelektoniikkalaitteella tarkoitetaan ohjaus- ja säätöjärjestelmää, jolla sähköä muokataan saatavilla olevasta muodosta haluttuun uuteen muotoon ja samalla hallitaan sähköisen tehon virtausta lähteestä käyttökohteeseen. Tämä siis eroaa signaalielektroniikasta, jossa sähköllä tyypillisesti siirretään tietoa hyödyntäen eri tiloja. Tehoelektroniikkalaitteita vertailtaessa katsotaan yleensä niiden luotettavuutta, kokoa, tehokkuutta, säätötarkkuutta ja tietysti hintaa. Tyypillisiä tehoelektroniikkalaitteita ovat taajuudenmuuttajat, UPS (Uninterruptible Power Supply) -laitteet, hitsauskoneet, induktiokuumentimet sekä erilaiset teholähteet. Perinteisesti näiden laitteiden ohjaus toteutetaan käyttäen mikroprosessoreja, ASIC- (Application Specific Integrated Circuit) tai IC (Intergrated Circuit) -piirejä sekä analogisia säätimiä. Tässä tutkimuksessa on analysoitu FPGA (Field Programmable Gate Array) -piirien soveltuvuutta tehoelektroniikan ohjaukseen. FPGA-piirien rakenne muodostuu erilaisista loogisista elementeistä ja niiden välisistä yhdysjohdoista.Loogiset elementit ovat porttipiirejä ja kiikkuja. Yhdysjohdot ja loogiset elementit ovat piirissä kiinteitä eikä koostumusta tai lukumäärää voi jälkikäteen muuttaa. Ohjelmoitavuus syntyy elementtien välisistä liitännöistä. Piirissä on lukuisia, jopa miljoonia kytkimiä, joiden asento voidaan asettaa. Siten piirin peruselementeistä voidaan muodostaa lukematon määrä erilaisia toiminnallisia kokonaisuuksia. FPGA-piirejä on pitkään käytetty kommunikointialan tuotteissa ja siksi niiden kehitys on viime vuosina ollut nopeaa. Samalla hinnat ovat pudonneet. Tästä johtuen FPGA-piiristä on tullut kiinnostava vaihtoehto myös tehoelektroniikkalaitteiden ohjaukseen. Väitöstyössä FPGA-piirien käytön soveltuvuutta on tutkittu käyttäen kahta vaativaa ja erilaista käytännön tehoelektroniikkalaitetta: taajuudenmuuttajaa ja hitsauskonetta. Molempiin testikohteisiin rakennettiin alan suomalaisten teollisuusyritysten kanssa soveltuvat prototyypit,joiden ohjauselektroniikka muutettiin FPGA-pohjaiseksi. Lisäksi kehitettiin tätä uutta tekniikkaa hyödyntävät uudentyyppiset ohjausmenetelmät. Prototyyppien toimivuutta verrattiin vastaaviin perinteisillä menetelmillä ohjattuihin kaupallisiin tuotteisiin ja havaittiin FPGA-piirien mahdollistaman rinnakkaisen laskennantuomat edut molempien tehoelektroniikkalaitteiden toimivuudessa. Työssä on myösesitetty uusia menetelmiä ja työkaluja FPGA-pohjaisen säätöjärjestelmän kehitykseen ja testaukseen. Esitetyillä menetelmillä tuotteiden kehitys saadaan mahdollisimman nopeaksi ja tehokkaaksi. Lisäksi työssä on kehitetty FPGA:n sisäinen ohjaus- ja kommunikointiväylärakenne, joka palvelee tehoelektroniikkalaitteiden ohjaussovelluksia. Uusi kommunikointirakenne edistää lisäksi jo tehtyjen osajärjestelmien uudelleen käytettävyyttä tulevissa sovelluksissa ja tuotesukupolvissa.

On the differential evolution algorithm and its appliation to training radial basis function networks

The parameter setting of a differential evolution algorithm must meet several requirements: efficiency, effectiveness, and reliability. Problems vary. The solution of a particular problem can be represented in different ways. An algorithm most efficient in dealing with a particular representation may be less efficient in dealing with other representations. The development of differential evolution-based methods contributes substantially to research on evolutionary computing and global optimization in general. The objective of this study is to investigatethe differential evolution algorithm, the intelligent adjustment of its controlparameters, and its application. In the thesis, the differential evolution algorithm is first examined using different parameter settings and test functions. Fuzzy control is then employed to make control parameters adaptive based on an optimization process and expert knowledge. The developed algorithms are applied to training radial basis function networks for function approximation with possible variables including centers, widths, and weights of basis functions and both having control parameters kept fixed and adjusted by fuzzy controller. After the influence of control variables on the performance of the differential evolution algorithm was explored, an adaptive version of the differential evolution algorithm was developed and the differential evolution-based radial basis function network training approaches were proposed. Experimental results showed that the performance of the differential evolution algorithm is sensitive to parameter setting, and the best setting was found to be problem dependent. The fuzzy adaptive differential evolution algorithm releases the user load of parameter setting and performs better than those using all fixedparameters. Differential evolution-based approaches are effective for training Gaussian radial basis function networks.

Evolutionary perspective on the interplay between family life, and parent and offspring personality

Consistent inter-individual variation in behaviour over time and across contexts has been reported for a wide variety of animals, a phenomenon commonly referred to as personality. As behavioural patterns develop inside families, rearing conditions could have lasting effects on the expression of adult personality. In species with parental care, conflicts among family members impose selection on parental and offspring behaviour through co-adaptation. Here, we argue that the interplay between the evolution of personality traits (i.e. boldness, exploration, activity, aggressiveness and sociability) expressed outside the family context and the specialized behaviours expressed inside families (i.e. offspring begging behaviour and parental response to offspring solicitations) can have important evolutionary consequences. Personality differences among parents may relate to the typically observed variation in the way they respond to offspring demand, and dependent offspring may already express personality differences which may relate to the way they communicate with their parents and siblings. However, there has been little research on how personality relates to parental and offspring behaviours. Future research should thus focus on how and why personality may be related to the specialized parent and offspring behaviour that evolved as adaptations to family life.

Algorithms and cryptographic protocols using elliptic curves

En els darrers anys, la criptografia amb corbes el.líptiques ha adquirit una importància creixent, fins a arribar a formar part en la actualitat de diferents estàndards industrials. Tot i que s'han dissenyat variants amb corbes el.líptiques de criptosistemes clàssics, com el RSA, el seu màxim interès rau en la seva aplicació en criptosistemes basats en el Problema del Logaritme Discret, com els de tipus ElGamal. En aquest cas, els criptosistemes el.líptics garanteixen la mateixa seguretat que els construïts sobre el grup multiplicatiu d'un cos finit primer, però amb longituds de clau molt menor. Mostrarem, doncs, les bones propietats d'aquests criptosistemes, així com els requeriments bàsics per a que una corba sigui criptogràficament útil, estretament relacionat amb la seva cardinalitat. Revisarem alguns mètodes que permetin descartar corbes no criptogràficament útils, així com altres que permetin obtenir corbes bones a partir d'una de donada. Finalment, descriurem algunes aplicacions, com són el seu ús en Targes Intel.ligents i sistemes RFID, per concloure amb alguns avenços recents en aquest camp.

Spatially varying selection shapes life history clines among populations of Drosophila melanogaster from sub-Saharan Africa.

Clines in life history traits, presumably driven by spatially varying selection, are widespread. Major latitudinal clines have been observed, for example, in Drosophila melanogaster, an ancestrally tropical insect from Africa that has colonized temperate habitats on multiple continents. Yet, how geographic factors other than latitude, such as altitude or longitude, affect life history in this species remains poorly understood. Moreover, most previous work has been performed on derived European, American and Australian populations, but whether life history also varies predictably with geography in the ancestral Afro-tropical range has not been investigated systematically. Here, we have examined life history variation among populations of D. melanogaster from sub-Saharan Africa. Viability and reproductive diapause did not vary with geography, but body size increased with altitude, latitude and longitude. Early fecundity covaried positively with altitude and latitude, whereas lifespan showed the opposite trend. Examination of genetic variance-covariance matrices revealed geographic differentiation also in trade-off structure, and QST -FST analysis showed that life history differentiation among populations is likely shaped by selection. Together, our results suggest that geographic and/or climatic factors drive adaptive phenotypic differentiation among ancestral African populations and confirm the widely held notion that latitude and altitude represent parallel gradients.

Statistical modelling of CSP solving algorithms performance

The goal of this work is to try to create a statistical model, based only on easily computable parameters from the CSP problem to predict runtime behaviour of the solving algorithms, and let us choose the best algorithm to solve the problem. Although it seems that the obvious choice should be MAC, experimental results obtained so far show, that with big numbers of variables, other algorithms perfom much better, specially for hard problems in the transition phase.

All-sky search algorithms for monochromatic signals in bar gravitational wave detector data

In this paper we design and develop several filtering strategies for the analysis of data generated by a resonant bar gravitational wave (GW) antenna, with the goal of assessing the presence (or absence) therein of long-duration monochromatic GW signals, as well as the eventual amplitude and frequency of the signals, within the sensitivity band of the detector. Such signals are most likely generated in the fast rotation of slightly asymmetric spinning stars. We develop practical procedures, together with a study of their statistical properties, which will provide us with useful information on the performance of each technique. The selection of candidate events will then be established according to threshold-crossing probabilities, based on the Neyman-Pearson criterion. In particular, it will be shown that our approach, based on phase estimation, presents a better signal-to-noise ratio than does pure spectral analysis, the most common approach.

Gene flow and gene flux shape evolutionary patterns of variation in Drosophila subobscura

Gene flow (defined as allele exchange between populations) and gene flux (defined as allele exchange during meiosis in heterokaryotypic females) are important factors decreasing genetic differentiation between populations and inversions. Many chromosomal inversions are under strong selection and their role in recombination reduction enhances the maintenance of their genetic distinctness. Here we analyze levels and patterns of nucleotide diversity, selection and demographic history, using 37 individuals of Drosophila subobscura from Mount Parnes (Greece) and Barcelona (Spain). Our sampling focused on two frequent O-chromosome arrangements that differ by two overlapping inversions (OST and O3+4), which are differentially adapted to the environment as observed by their opposing latitudinal clines in inversion frequencies. The six analyzed genes (Pif1A, Abi, Sqd, Yrt, Atpa and Fmr1) were selected for their location across the O-chromosome and their implication in thermal adaptation. Despite the extensive gene flux detected outside the inverted region, significant genetic differentiation between both arrangements was found inside it. However, high levels of gene flow were detected for all six genes when comparing the same arrangement among populations. These results suggest that the adaptive value of inversions is maintained, regardless of the lack of genetic differentiation within arrangements from different populations, and thus favors the Local Adaptation hypothesis over the Coadapted Genome hypothesis as the basis of the selection acting on inversions in these populations.

Evolutionary Games in Networked Populations: Models and Experiments

Cooperation and coordination are desirable behaviors that are fundamental for the harmonious development of society. People need to rely on cooperation with other individuals in many aspects of everyday life, such as teamwork and economic exchange in anonymous markets. However, cooperation may easily fall prey to exploitation by selfish individuals who only care about short- term gain. For cooperation to evolve, specific conditions and mechanisms are required, such as kinship, direct and indirect reciprocity through repeated interactions, or external interventions such as punishment. In this dissertation we investigate the effect of the network structure of the population on the evolution of cooperation and coordination. We consider several kinds of static and dynamical network topologies, such as Baraba´si-Albert, social network models and spatial networks. We perform numerical simulations and laboratory experiments using the Prisoner's Dilemma and co- ordination games in order to contrast human behavior with theoretical results. We show by numerical simulations that even a moderate amount of random noise on the Baraba´si-Albert scale-free network links causes a significant loss of cooperation, to the point that cooperation almost vanishes altogether in the Prisoner's Dilemma when the noise rate is high enough. Moreover, when we consider fixed social-like networks we find that current models of social networks may allow cooperation to emerge and to be robust at least as much as in scale-free networks. In the framework of spatial networks, we investigate whether cooperation can evolve and be stable when agents move randomly or performing Le´vy flights in a continuous space. We also consider discrete space adopting purposeful mobility and binary birth-death process to dis- cover emergent cooperative patterns. The fundamental result is that cooperation may be enhanced when this migration is opportunistic or even when agents follow very simple heuristics. In the experimental laboratory, we investigate the issue of social coordination between indi- viduals located on networks of contacts. In contrast to simulations, we find that human players dynamics do not converge to the efficient outcome more often in a social-like network than in a random network. In another experiment, we study the behavior of people who play a pure co- ordination game in a spatial environment in which they can move around and when changing convention is costly. We find that each convention forms homogeneous clusters and is adopted by approximately half of the individuals. When we provide them with global information, i.e., the number of subjects currently adopting one of the conventions, global consensus is reached in most, but not all, cases. Our results allow us to extract the heuristics used by the participants and to build a numerical simulation model that agrees very well with the experiments. Our findings have important implications for policymakers intending to promote specific, desired behaviors in a mobile population. Furthermore, we carry out an experiment with human subjects playing the Prisoner's Dilemma game in a diluted grid where people are able to move around. In contrast to previous results on purposeful rewiring in relational networks, we find no noticeable effect of mobility in space on the level of cooperation. Clusters of cooperators form momentarily but in a few rounds they dissolve as cooperators at the boundaries stop tolerating being cheated upon. Our results highlight the difficulties that mobile agents have to establish a cooperative environment in a spatial setting without a device such as reputation or the possibility of retaliation. i.e. punishment. Finally, we test experimentally the evolution of cooperation in social networks taking into ac- count a setting where we allow people to make or break links at their will. In this work we give particular attention to whether information on an individual's actions is freely available to poten- tial partners or not. Studying the role of information is relevant as information on other people's actions is often not available for free: a recruiting firm may need to call a job candidate's refer- ences, a bank may need to find out about the credit history of a new client, etc. We find that people cooperate almost fully when information on their actions is freely available to their potential part- ners. Cooperation is less likely, however, if people have to pay about half of what they gain from cooperating with a cooperator. Cooperation declines even further if people have to pay a cost that is almost equivalent to the gain from cooperating with a cooperator. Thus, costly information on potential neighbors' actions can undermine the incentive to cooperate in dynamical networks.

Parallel feedback loops control the basal activity of the HOG MAPK signaling cascade.

Tight regulation of the MAP kinase Hog1 is crucial for survival under changing osmotic conditions. Interestingly, we found that Hog1 phosphorylates multiple upstream components, implying feedback regulation within the signaling cascade. Taking advantage of an unexpected link between glucose availability and Hog1 activity, we used quantitative single cell measurements and computational modeling to unravel feedback regulation operating in addition to the well-known adaptation feedback triggered by glycerol accumulation. Indeed, we found that Hog1 phosphorylates its activating kinase Ssk2 on several sites, and cells expressing a non-phosphorylatable Ssk2 mutant are partially defective for feedback regulation and proper control of basal Hog1 activity. Together, our data suggest that Hog1 activity is controlled by intertwined regulatory mechanisms operating with varying kinetics, which together tune the Hog1 response to balance basal Hog1 activity and its steady-state level after adaptation to high osmolarity.

Identification of potential HIV restriction factors by combining evolutionary genomic signatures with functional analyses.

BACKGROUND: Known antiretroviral restriction factors are encoded by genes that are under positive selection pressure, induced during HIV-1 infection, up-regulated by interferons, and/or interact with viral proteins. To identify potential novel restriction factors, we performed genome-wide scans for human genes sharing molecular and evolutionary signatures of known restriction factors and tested the anti-HIV-1 activity of the most promising candidates. RESULTS: Our analyses identified 30 human genes that share characteristics of known restriction factors. Functional analyses of 27 of these candidates showed that over-expression of a strikingly high proportion of them significantly inhibited HIV-1 without causing cytotoxic effects. Five factors (APOL1, APOL6, CD164, TNFRSF10A, TNFRSF10D) suppressed infectious HIV-1 production in transfected 293T cells by >90% and six additional candidates (FCGR3A, CD3E, OAS1, GBP5, SPN, IFI16) achieved this when the virus was lacking intact accessory vpr, vpu and nef genes. Unexpectedly, over-expression of two factors (IL1A, SP110) significantly increased infectious HIV-1 production. Mechanistic studies suggest that the newly identified potential restriction factors act at different steps of the viral replication cycle, including proviral transcription and production of viral proteins. Finally, we confirmed that mRNA expression of most of these candidate restriction factors in primary CD4+ T cells is significantly increased by type I interferons. CONCLUSIONS: A limited number of human genes share multiple characteristics of genes encoding for known restriction factors. Most of them display anti-retroviral activity in transient transfection assays and are expressed in primary CD4+ T cells.

Tuning Performance of Multi-threaded programs

Diplomityö tarkastelee säikeistettyä ohjelmointia rinnakkaisohjelmoinnin ylemmällä hierarkiatasolla tarkastellen erityisesti hypersäikeistysteknologiaa. Työssä tarkastellaan hypersäikeistyksen hyviä ja huonoja puolia sekä sen vaikutuksia rinnakkaisalgoritmeihin. Työn tavoitteena oli ymmärtää Intel Pentium 4 prosessorin hypersäikeistyksen toteutus ja mahdollistaa sen hyödyntäminen, missä se tuo suorituskyvyllistä etua. Työssä kerättiin ja analysoitiin suorituskykytietoa ajamalla suuri joukko suorituskykytestejä eri olosuhteissa (muistin käsittely, kääntäjän asetukset, ympäristömuuttujat...). Työssä tarkasteltiin kahdentyyppisiä algoritmeja: matriisioperaatioita ja lajittelua. Näissä sovelluksissa on säännöllinen muistinkäyttökuvio, mikä on kaksiteräinen miekka. Se on etu aritmeettis-loogisissa prosessoinnissa, mutta toisaalta huonontaa muistin suorituskykyä. Syynä siihen on nykyaikaisten prosessorien erittäin hyvä raaka suorituskyky säännöllistä dataa käsiteltäessä, mutta muistiarkkitehtuuria rajoittaa välimuistien koko ja useat puskurit. Kun ongelman koko ylittää tietyn rajan, todellinen suorituskyky voi pudota murto-osaan huippusuorituskyvystä.

Evolutionary steps in the reproductive biology of Annonaceae

Flowers of Annonaceae are characterized by fleshy petals, many stamens with hard connective shields and numerous carpels with sessile stigmas often covered by sticky secretions. The petals of many representatives during anthesis form a closed pollination chamber. Protogynous dichogamy with strong scent emissions especially during the pistillate stage is a character of nearly all species. Scent emissions can be enhanced by thermogenesis. The prevailing reproductive system in the family seems to be self-compatibility. The basal genus Anaxagorea besides exhibiting several ancestral morphological characters has also many characters which reappear in other genera. Strong fruit-like scents consisting of fruit-esters and alcohols mainly attract small fruit-beetles (genus Colopterus, Nitidulidae) as pollinators, as well as several other beetles (Curculionidae, Chrysomelidae) and fruit-flies (Drosophilidae), which themselves gnaw on the thick petals or their larvae are petal or ovule predators. The flowers and the thick petals are thus a floral brood substrate for the visitors and the thick petals of Anaxagorea have to be interpreted as an antipredator structure. Another function of the closed thick petals is the production of heat by accumulated starch, which enhances scent emission and provides a warm shelter for the attracted beetles. Insight into floral characters and floral ecology of Anaxagorea, the sister group of the rest of the Annonaceae, is particularly important for understanding functional evolution and diversification of the family as a whole. As beetle pollination (cantharophily) is plesiomorphic in Anaxagorea and in Annonaceae, characters associated with beetle pollination appear imprinted in members of the whole family. Pollination by beetles (cantharophily) is the predominant mode of the majority of species worldwide. Examples are given of diurnal representatives (e.g., Guatteria, Duguetia, Annona) which function on the basis of fruit-imitating flowers attracting mainly fruit-inhabiting nitidulid beetles, as well as nocturnal species (e.g., large-flowered Annona and Duguetia species), which additionally to most of the diurnal species exhibit strong flower warming and provide very thick petal tissues for the voracious dynastid scarab beetles (Dynastinae, Scarabaeidae). Further examples will show that a few Annonaceae have adapted in their pollination also to thrips, flies, cockroaches and even bees. Although this non-beetle pollinated species have adapted in flower structure and scent compounds to their respective insects, they still retain some of the specialized cantharophilous characters of their ancestors.