C4 Photosynthesis evolved in grasses via parallel adaptive genetic changes.

Phenotypic convergence is a widespread and well-recognized evolutionary phenomenon. However, the responsible molecular mechanisms remain often unknown mainly because the genes involved are not identified. A well-known example of physiological convergence is the C4 photosynthetic pathway, which evolved independently more than 45 times [1]. Here, we address the question of the molecular bases of the C4 convergent phenotypes in grasses (Poaceae) by reconstructing the evolutionary history of genes encoding a C4 key enzyme, the phosphoenolpyruvate carboxylase (PEPC). PEPC genes belong to a multigene family encoding distinct isoforms of which only one is involved in C4 photosynthesis [2]. By using phylogenetic analyses, we showed that grass C4 PEPCs appeared at least eight times independently from the same non-C4 PEPC. Twenty-one amino acids evolved under positive selection and converged to similar or identical amino acids in most of the grass C4 PEPC lineages. This is the first record of such a high level of molecular convergent evolution, illustrating the repeatability of evolution. These amino acids were responsible for a strong phylogenetic bias grouping all C4 PEPCs together. The C4-specific amino acids detected must be essential for C4 PEPC enzymatic characteristics, and their identification opens new avenues for the engineering of the C4 pathway in crops.

Scheduling an European basketball competition. An application of graph theory

The object of this project is to schedule a ctitious European basketball competition with many teams situated a long distances. The schedule must be fair, feasible and economical, which means that the total distance trav- eled by every team must be the minimal possible. First, we de ne the sport competition terminology and study di erent competition systems, focusing on the NBA and the Euroleague systems. Then we de ne concepts of graph theory and spherical distance that will be needed. Next we propose a com- petition system, explaining where will be allocated the teams and how will be the scheduling. Then there is a description of the programs that have been implemented, and, nally, the complete schedule is displayed, and some possible improvements are mentioned.

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.

Guidelines for irrigation scheduling of banana crop in São Francisco Valley, Brazil. I - Root distribution and activity

In order to establish guidelines for irrigation water management of banana cv. Pacovan (AAB group, Prata sub-group) in Petrolina County, northeastern Brazil, the root distribution and activity were measured on an irrigated plantation, in a medium texture soil, with plants spaced in a 3 x 3 m grid. Root distribution was evaluated by the soil profile method aided by digital image analysis, while root activity was indirectly determined by the changing of soil water content and by the direction of soil water flux. Data were collected since planting in January 1999 to the 3rd harvest in September 2001. Effective rooting depth increased from 0.4 m at 91 days after planting (dap), to 0.6 m at 370, 510, and 903 dap, while water absorption by roots was predominantly in the top 0,6 m.

Guidelines for irrigation scheduling of banana crop in São Francisco Valley, Brazil. II - Water consumption, crop coefficient, and physiologycal behavior

The water consumption and the crop coefficient of the banana cv. Pacovan were estimated in Petrolina County, northeastern Brazil, in order to establish guidelines to irrigation water management. Evaluations were carried out since planting in January 1999 to the 3rd harvest in September 2001 on a microsprinkler irrigated orchard, with plants spaced in a 3 x 3 m grid. Average daily water consumption was 3.9, 4.0, and 3.3 mm in the 1st, 2nd and 3rd growing seasons, respectively. Crop coefficient values increased from 0.7 (vegetative growth) to 1.1 (flowering). Even with high soil water availability, transpiration was reduced due to high evaporative demand.

What to consider for applying backfilling on non-dedicated environments

The resource utilization level in open laboratories of several universities has been shown to be very low. Our aim is to take advantage of those idle resources for parallel computation without disturbing the local load. In order to provide a system that lets us execute parallel applications in such a non-dedicated cluster, we use an integral scheduling system that considers both Space and Time sharing concerns. For dealing with the Time Sharing (TS) aspect, we use a technique based on the communication-driven coscheduling principle. This kind of TS system has some implications on the Space Sharing (SS) system, that force us to modify the way job scheduling is traditionally done. In this paper, we analyze the relation between the TS and the SS systems in a non-dedicated cluster. As a consequence of this analysis, we propose a new technique, termed 3DBackfilling. This proposal implements the well known SS technique of backfilling, but applied to an environment with a MultiProgramming Level (MPL) of the parallel applications that is greater than one. Besides, 3DBackfilling considers the requirements of the local workload running on each node. Our proposal was evaluated in a PVM/MPI Linux cluster, and it was compared with several more traditional SS policies applied to non-dedicated environments.

Web user interface architecture for advanced planning and scheduling systems Case: Nokia Demand / Supply Planning Applications

In modem hitec industry Advanced Planning and Scheduling (APS) systems provide the basis for e-business solutions towards the suppliers and the customers. One objective of this thesis was to clarify the modem supply chain management with the APS systems and especially concentrate on the area of Collaborative Planning. In order Advanced Planning and Scheduling systems to be complete and usable, user interfaces are needed. Current Visual Basic user interfaces have faced many complaints and arguments from the users as well as from the development team. This thesis is trying to analyze the reasons and causes for the encountered problems and also provide ways to overcome them. The decision has been made to build the new user interfaces to be Web-enabled. Therefore another objective of this thesis was to research and find suitable technologies for building the Web-based user interfaces for Advanced Planning and Scheduling Systems in Nokia Demand/Supply Planning business area. Comparison between the most suitable technologies is made. Usability issues of Web-enabled user interfaces are also covered. The empirical part of the thesis includes design and implementation of a Web-based user interface with the chosen technology for a particular APS module that enables Collaborative Planning with suppliers.

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.

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.

Biological variation of established and novel biomarkers for atherosclerosis: Results from a prospective, parallel-group cohort study.

BACKGROUND: Biomarkers are a promising tool for the management of patients with atherosclerosis, but their variation is largely unknown. We assessed within-subject and between-subject biological variation of biomarkers in peripheral artery disease (PAD) patients and healthy controls, and defined which biomarkers have a favorable variation profile for future studies. METHODS: Prospective, parallel-group cohort study, including 62 patients with stable PAD (79% men, 65±7years) and 18 healthy control subjects (44% men, 57±7years). Blood samples were taken at baseline, and after 3-, 6-, and 12-months. We calculated within-subject (CVI) and between-subject (CVG) coefficients of variation and intra-class correlation coefficient (ICC). RESULTS: Mean levels of D-dimer, hs-CRP, IL-6, IL-8, MMP-9, MMP-3, S100A8/A9, PAI-1, sICAM-1, and sP-selectin levels were higher in PAD patients than in healthy controls (P≤.05 for all). CVI and CVG of the different biomarkers varied considerably in both groups. An ICC≥0.5 (indicating moderate-to-good reliability) was found for hs-CRP, D-Dimer, E-selectin, IL-10, MCP-1, MMP-3, oxLDL, sICAM-1 and sP-selectin in both groups, for sVCAM in healthy controls and for MMP-9, PAI-1 and sCD40L in PAD patients. CONCLUSIONS: Single biomarker measurements are of limited utility due to large within-subject variation, both in PAD patients and healthy subjects. D-dimer, hs-CRP, MMP-9, MMP-3, PAI-1, sP-selectin and sICAM-1 are biomarkers with both higher mean levels in PAD patients and a favorable variation profile making them most suitable for future studies.

On the computation of reducible invariant tori on a parallel computer

We present an algorithm for the computation of reducible invariant tori of discrete dynamical systems that is suitable for tori of dimensions larger than 1. It is based on a quadratically convergent scheme that approximates, at the same time, the Fourier series of the torus, its Floquet transformation, and its Floquet matrix. The Floquet matrix describes the linearization of the dynamics around the torus and, hence, its linear stability. The algorithm presents a high degree of parallelism, and the computational effort grows linearly with the number of Fourier modes needed to represent the solution. For these reasons it is a very good option to compute quasi-periodic solutions with several basic frequencies. The paper includes some examples (flows) to show the efficiency of the method in a parallel computer. In these flows we compute invariant tori of dimensions up to 5, by taking suitable sections.

Bernoulli correction to viscous losses: Radial flow between two parallel discs

For a massless fluid (density = 0), the steady flow along a duct is governed exclusively by viscous losses. In this paper, we show that the velocity profile obtained in this limit can be used to calculate the pressure drop up to the first order in density. This method has been applied to the particular case of a duct, defined by two plane-parallel discs. For this case, the first-order approximation results in a simple analytical solution which has been favorably checked against numerical simulations. Finally, an experiment has been carried out with water flowing between the discs. The experimental results show good agreement with the approximate solution