Computer-aided system for morphometric mandibular index computation (Using dental panoramic radiographs)

Objective: We propose and validate a computer aided system to measure three different mandibular indexes: cortical width, panoramic mandibular index and, mandibular alveolar bone resorption index. Study Design: Repeatability and reproducibility of the measurements are analyzed and compared to the manual estimation of the same indexes. Results: The proposed computerized system exhibits superior repeatability and reproducibility rates compared to standard manual methods. Moreover, the time required to perform the measurements using the proposed method is negligible compared to perform the measurements manually. Conclusions: We have proposed a very user friendly computerized method to measure three different morphometric mandibular indexes. From the results we can conclude that the system provides a practical manner to perform these measurements. It does not require an expert examiner and does not take more than 16 seconds per analysis. Thus, it may be suitable to diagnose osteoporosis using dental panoramic radiographs.

Evolutionary aspects of population structure for molecular and quantitative traits in the freshwater snail Radix balthica.

Detecting the action of selection in natural populations can be achieved using the QST-FST comparison that relies on the estimation of FST with neutral markers, and QST using quantitative traits potentially under selection. QST higher than FST suggests the action of directional selection and thus potential local adaptation. In this article, we apply the QST-FST comparison to four populations of the hermaphroditic freshwater snail Radix balthica located in a floodplain habitat. In contrast to most studies published so far, we did not detect evidence of directional selection for local optima for any of the traits we measured: QST calculated using three different methods was never higher than FST. A strong inbreeding depression was also detected, indicating that outcrossing is probably predominant over selfing in the studied populations. Our results suggest that in this floodplain habitat, local adaptation of R. balthica populations may be hindered by genetic drift, and possibly altered by uneven gene flow linked to flood frequency.

Ranking-Dominance Relation for (Evolutionary) Multi-Objective Optimization

An alternative relation to Pareto-dominance relation is proposed. The new relation is based on ranking a set of solutions according to each separate objective and an aggregation function to calculate a scalar fitness value for each solution. The relation is called as ranking-dominance and it tries to tackle the curse of dimensionality commonly observedin evolutionary multi-objective optimization. Ranking-dominance can beused to sort a set of solutions even for a large number of objectives when Pareto-dominance relation cannot distinguish solutions from one another anymore. This permits search to advance even with a large number of objectives. It is also shown that ranking-dominance does not violate Pareto-dominance. Results indicate that selection based on ranking-dominance is able to advance search towards the Pareto-front in some cases, where selection based on Pareto-dominance stagnates. However, in some cases it is also possible that search does not proceed into direction of Pareto-front because the ranking-dominance relation permits deterioration of individual objectives. Results also show that when the number of objectives increases, selection based on just Pareto-dominance without diversity maintenance is able to advance search better than with diversity maintenance. Therefore, diversity maintenance is connive at the curse of dimensionality.

Data-parallel computation in parallel and distributed environments

The past few decades have seen a considerable increase in the number of parallel and distributed systems. With the development of more complex applications, the need for more powerful systems has emerged and various parallel and distributed environments have been designed and implemented. Each of the environments, including hardware and software, has unique strengths and weaknesses. There is no single parallel environment that can be identified as the best environment for all applications with respect to hardware and software properties. The main goal of this thesis is to provide a novel way of performing data-parallel computation in parallel and distributed environments by utilizing the best characteristics of difference aspects of parallel computing. For the purpose of this thesis, three aspects of parallel computing were identified and studied. First, three parallel environments (shared memory, distributed memory, and a network of workstations) are evaluated to quantify theirsuitability for different parallel applications. Due to the parallel and distributed nature of the environments, networks connecting the processors in these environments were investigated with respect to their performance characteristics. Second, scheduling algorithms are studied in order to make them more efficient and effective. A concept of application-specific information scheduling is introduced. The application- specific information is data about the workload extractedfrom an application, which is provided to a scheduling algorithm. Three scheduling algorithms are enhanced to utilize the application-specific information to further refine their scheduling properties. A more accurate description of the workload is especially important in cases where the workunits are heterogeneous and the parallel environment is heterogeneous and/or non-dedicated. The results obtained show that the additional information regarding the workload has a positive impact on the performance of applications. Third, a programming paradigm for networks of symmetric multiprocessor (SMP) workstations is introduced. The MPIT programming paradigm incorporates the Message Passing Interface (MPI) with threads to provide a methodology to write parallel applications that efficiently utilize the available resources and minimize the overhead. The MPIT allows for communication and computation to overlap by deploying a dedicated thread for communication. Furthermore, the programming paradigm implements an application-specific scheduling algorithm. The scheduling algorithm is executed by the communication thread. Thus, the scheduling does not affect the execution of the parallel application. Performance results achieved from the MPIT show that considerable improvements over conventional MPI applications are achieved.

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.

A parameterization method for the computation of invariant tori and their whiskers in quasi-periodic maps: explorations and mechanisms for the breakdown of hyperbolicity

In two previous papers [J. Differential Equations, 228 (2006), pp. 530 579; Discrete Contin. Dyn. Syst. Ser. B, 6 (2006), pp. 1261 1300] we have developed fast algorithms for the computations of invariant tori in quasi‐periodic systems and developed theorems that assess their accuracy. In this paper, we study the results of implementing these algorithms and study their performance in actual implementations. More importantly, we note that, due to the speed of the algorithms and the theoretical developments about their reliability, we can compute with confidence invariant objects close to the breakdown of their hyperbolicity properties. This allows us to identify a mechanism of loss of hyperbolicity and measure some of its quantitative regularities. We find that some systems lose hyperbolicity because the stable and unstable bundles approach each other but the Lyapunov multipliers remain away from 1. We find empirically that, close to the breakdown, the distances between the invariant bundles and the Lyapunov multipliers which are natural measures of hyperbolicity depend on the parameters, with power laws with universal exponents. We also observe that, even if the rigorous justifications in [J. Differential Equations, 228 (2006), pp. 530-579] are developed only for hyperbolic tori, the algorithms work also for elliptic tori in Hamiltonian systems. We can continue these tori and also compute some bifurcations at resonance which may lead to the existence of hyperbolic tori with nonorientable bundles. We compute manifolds tangent to nonorientable bundles.

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.

Predicting drug metabolism: experiment and/or computation?

Drug metabolism can produce metabolites with physicochemical and pharmacological properties that differ substantially from those of the parent drug, and consequently has important implications for both drug safety and efficacy. To reduce the risk of costly clinical-stage attrition due to the metabolic characteristics of drug candidates, there is a need for efficient and reliable ways to predict drug metabolism in vitro, in silico and in vivo. In this Perspective, we provide an overview of the state of the art of experimental and computational approaches for investigating drug metabolism. We highlight the scope and limitations of these methods, and indicate strategies to harvest the synergies that result from combining measurement and prediction of drug metabolism.

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.

Evolutionary computing in search-based software engineering

This master’s thesis aims to study and represent from literature how evolutionary algorithms are used to solve different search and optimisation problems in the area of software engineering. Evolutionary algorithms are methods, which imitate the natural evolution process. An artificial evolution process evaluates fitness of each individual, which are solution candidates. The next population of candidate solutions is formed by using the good properties of the current population by applying different mutation and crossover operations. Different kinds of evolutionary algorithm applications related to software engineering were searched in the literature. Applications were classified and represented. Also the necessary basics about evolutionary algorithms were presented. It was concluded, that majority of evolutionary algorithm applications related to software engineering were about software design or testing. For example, there were applications about classifying software production data, project scheduling, static task scheduling related to parallel computing, allocating modules to subsystems, N-version programming, test data generation and generating an integration test order. Many applications were experimental testing rather than ready for real production use. There were also some Computer Aided Software Engineering tools based on evolutionary algorithms.

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.

Evolutionary patchwork of an insecticidal toxin shared between plant-associated pseudomonads and the insect pathogens Photorhabdus and Xenorhabdus.

BACKGROUND: Root-colonizing fluorescent pseudomonads are known for their excellent abilities to protect plants against soil-borne fungal pathogens. Some of these bacteria produce an insecticidal toxin (Fit) suggesting that they may exploit insect hosts as a secondary niche. However, the ecological relevance of insect toxicity and the mechanisms driving the evolution of toxin production remain puzzling. RESULTS: Screening a large collection of plant-associated pseudomonads for insecticidal activity and presence of the Fit toxin revealed that Fit is highly indicative of insecticidal activity and predicts that Pseudomonas protegens and P. chlororaphis are exclusive Fit producers. A comparative evolutionary analysis of Fit toxin-producing Pseudomonas including the insect-pathogenic bacteria Photorhabdus and Xenorhadus, which produce the Fit related Mcf toxin, showed that fit genes are part of a dynamic genomic region with substantial presence/absence polymorphism and local variation in GC base composition. The patchy distribution and phylogenetic incongruence of fit genes indicate that the Fit cluster evolved via horizontal transfer, followed by functional integration of vertically transmitted genes, generating a unique Pseudomonas-specific insect toxin cluster. CONCLUSIONS: Our findings suggest that multiple independent evolutionary events led to formation of at least three versions of the Mcf/Fit toxin highlighting the dynamic nature of insect toxin evolution.

Inference of Evolutionary Forces Acting on Human Biological Pathways.

Because natural selection is likely to act on multiple genes underlying a given phenotypic trait, we study here the potential effect of ongoing and past selection on the genetic diversity of human biological pathways. We first show that genes included in gene sets are generally under stronger selective constraints than other genes and that their evolutionary response is correlated. We then introduce a new procedure to detect selection at the pathway level based on a decomposition of the classical McDonald-Kreitman test extended to multiple genes. This new test, called 2DNS, detects outlier gene sets and takes into account past demographic effects and evolutionary constraints specific to gene sets. Selective forces acting on gene sets can be easily identified by a mere visual inspection of the position of the gene sets relative to their two-dimensional null distribution. We thus find several outlier gene sets that show signals of positive, balancing, or purifying selection but also others showing an ancient relaxation of selective constraints. The principle of the 2DNS test can also be applied to other genomic contrasts. For instance, the comparison of patterns of polymorphisms private to African and non-African populations reveals that most pathways show a higher proportion of nonsynonymous mutations in non-Africans than in Africans, potentially due to different demographic histories and selective pressures.