Phylogeny of snake trypanosomes inferred by SSU rDNA sequences, their possible transmission by phlebotomines, and taxonomic appraisal by molecular, cross-infection and morphological analysis

Blood examination by microhaematocrit and haemoculture of 459 snakes belonging to 37 species revealed 24% trypanosome prevalence in species of Viperidae (Crotalus durissus and Bothrops jararaca) and Colubridae (Pseudoboa nigra). Trypanosome cultures from C. durissus and P. nigra were behaviourally and morphologically indistinguishable. In addition, the growth and morphological features of a trypanosome from the sand fly Viannaniyia tuberculata were similar to those of snake isolates. Cross-infection experiments revealed a lack of host restriction, as snakes of 3 species were infected with the trypanosome from C. durissus. Phylogeny based on ribosomal sequences revealed that snake trypanosomes clustered together with the sand fly trypanosome, forming a new phylogenetic lineage within Trypanosoma closest to a clade of lizard trypanosomes transmitted by sand flies dagger. The clade of trypanosomes from snakes and lizards suggests an association between the evolutionary histories of these trypanosomes and their squamate hosts. Moreover, data strongly indicated that these trypanosomes are transmitted by sand flies. The flaws of the current taxonomy of snake trypanosomes are discussed, and the need for molecular parameters to be adopted is emphasized. To our knowledge, this is the first molecular phylogenetic study of snake trypanosomes.

Grid job scheduling using Route with Genetic Algorithm support

In 2006 the Route load balancing algorithm was proposed and compared to other techniques aiming at optimizing the process allocation in grid environments. This algorithm schedules tasks of parallel applications considering computer neighborhoods (where the distance is defined by the network latency). Route presents good results for large environments, although there are cases where neighbors do not have an enough computational capacity nor communication system capable of serving the application. In those situations the Route migrates tasks until they stabilize in a grid area with enough resources. This migration may take long time what reduces the overall performance. In order to improve such stabilization time, this paper proposes RouteGA (Route with Genetic Algorithm support) which considers historical information on parallel application behavior and also the computer capacities and load to optimize the scheduling. This information is extracted by using monitors and summarized in a knowledge base used to quantify the occupation of tasks. Afterwards, such information is used to parameterize a genetic algorithm responsible for optimizing the task allocation. Results confirm that RouteGA outperforms the load balancing carried out by the original Route, which had previously outperformed others scheduling algorithms from literature.

X-ray transmission through nanostructured and microstructured CuO materials

This study presents a comparison of the X-ray transmission through microsized and nanosized materials. For this purpose CuO nanoparticles, with 13.4 nm average grain size, and CuO microparticles, with a mean particle size of 56 mu m, were incorporated separately to beeswax in a concentration of 5%. Results show that the transmission through the above material plates with microsized and nanosized CuO was almost the same for X-ray beams generated at 60 and 102 kV tube voltages. However, for the radiation beams generated at 26 and 30 kV tube voltages the X-rays are more attenuated by the nanostructured CuO plates by a factor of at least 14%. Results suggest that the difference in the low energy range may be due to the higher number of particles/gram in the plates designed with CuO nanoparticles and due to the grain size effect on the X-ray transmission. (C) 2010 Elsevier Ltd. All rights reserved.

Scheduling Grid Applications with Software Requirements

The aim of task scheduling is to minimize the makespan of applications, exploiting the best possible way to use shared resources. Applications have requirements which call for customized environments for their execution. One way to provide such environments is to use virtualization on demand. This paper presents two schedulers based on integer linear programming which schedule virtual machines (VMs) in grid resources and tasks on these VMs. The schedulers differ from previous work by the joint scheduling of tasks and VMs and by considering the impact of the available bandwidth on the quality of the schedule. Experiments show the efficacy of the schedulers in scenarios with different network configurations.

Refraction corrected transmission ultrasound computed tomography for application in breast imaging

Purpose: We present an iterative framework for CT reconstruction from transmission ultrasound data which accurately and efficiently models the strong refraction effects that occur in our target application: Imaging the female breast. Methods: Our refractive ray tracing framework has its foundation in the fast marching method (FNMM) and it allows an accurate as well as efficient modeling of curved rays. We also describe a novel regularization scheme that yields further significant reconstruction quality improvements. A final contribution is the development of a realistic anthropomorphic digital breast phantom based on the NIH Visible Female data set. Results: Our system is able to resolve very fine details even in the presence of significant noise, and it reconstructs both sound speed and attenuation data. Excellent correspondence with a traditional, but significantly more computationally expensive wave equation solver is achieved. Conclusions: Apart from the accurate modeling of curved rays, decisive factors have also been our regularization scheme and the high-quality interpolation filter we have used. An added benefit of our framework is that it accelerates well on GPUs where we have shown that clinical 3D reconstruction speeds on the order of minutes are possible.

Application execution management on the InteGrade opportunistic grid middleware

The InteGrade project is a multi-university effort to build a novel grid computing middleware based on the opportunistic use of resources belonging to user workstations. The InteGrade middleware currently enables the execution of sequential, bag-of-tasks, and parallel applications that follow the BSP or the MPI programming models. This article presents the lessons learned over the last five years of the InteGrade development and describes the solutions achieved concerning the support for robust application execution. The contributions cover the related fields of application scheduling, execution management, and fault tolerance. We present our solutions, describing their implementation principles and evaluation through the analysis of several experimental results. (C) 2010 Elsevier Inc. All rights reserved.

Estrogen receptor: Structural differences and potential implications on selectivity examined by the GRID/CPCA approach

Selective Estrogen Receptor Modulators ( SERMs) have been developed, but the selectivity towards the subtypes ( ER or ER is not well understood. Based on three-dimensional structural properties of ligand binding domains, a model that takes into account this aspect was developed via molecular interaction fields and consensus principal component analysis (GRID/CPCA).

Energy Storage for a Grid-Connected PV-System: A Feasibility Study

The work presented in this thesis concerns the dimensioning of an Energy Storage System (ESS) which will be used as an energy buffer for a grid-connected PV plant. This ESS should help managing the PV plant to inject electricity into the grid according to the requirements of the grid System Operator. It is desired to obtain a final production not below 1300kWh/kWp with a maximum ESS budget of 0.9€/Wp. The PV plant will be sited in Martinique Island and connected to the main grid. This grid is a small one where the perturbations due clouds in the PV generation are not negligible anymore. A software simulation tool, incorporating a model for the PV-plant production, the ESS and the required injection pattern of electricity into the grid has been developed in MS Excel. This tool has been used to optimize the relevant parameters defining the ESS so that the feed-in of electricity into the grid can be controlled to fulfill the conditions given by the System Operator. The inputs used for this simulation tool are, besides the conditions given by the System Operator on the allowed injection pattern, the production data from a similar PV-plant in a close-by location, and variables for defining the ESS. The PV production data used is from a site with similar climate and weather conditions as for the site on the Martinique Island and hence gives information on the short term insolation variations as well as expected annual electricity production. The ESS capacity and the injected electric energy will be the main figures to compare while doing an economic study of the whole plant. Hence, the Net Present Value, Benefit to Cost method and Pay-back period studies are carried on as dependent of the ESS capacity. The conclusion of this work is that it is possible to obtain the requested injection pattern by using an ESS. The design of the ESS can be made within an acceptable budget. The capacity of ESS to link with the PV system depends on the priorities of the final output characteristics, and it also depends on which economic parameter that is chosen as a priority.

Personalised Grid Service Discovery

The authors take a broad view that ultimately Grid- or Web-services must be located via personalised, semantic-rich discovery processes. They argue that such processes must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. Examples of such metadata are reliability metrics, quality of service data, or semantic service description markup. This paper presents UDDI-MT, an extension to the standard UDDI service directory approach that supports the storage of such metadata via a tunnelling technique that ties the metadata store to the original UDDI directory. They also discuss the use of a rich, graph-based RDF query language for syntactic queries on this data. Finally, they analyse the performance of each of these contributions in our implementation.

Personalised Grid Service Discovery

We take a broad view that ultimately Grid- or Web-services must be located via personalised, semantic-rich discovery processes. We argue that such processes must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. Examples of such metadata are reliability metrics, quality of service data, or semantic service description markup. This paper presents UDDI-MT, an extension to the standard UDDI service directory approach that supports the storage of such metadata via a tunnelling technique that ties the metadata store to the original UDDI directory. We also discuss the use of a rich, graph-based RDF query language for syntactic queries on this data. Finally, we analyse the performance of each of these contributions in our implementation.

Towards a Protocol for the Attachment of Semantic Descriptions to Grid Services

Service discovery in large scale, open distributed systems is difficult because of the need to filter out services suitable to the task at hand from a potentially huge pool of possibilities. Semantic descriptions have been advocated as the key to expressive service discovery, but the most commonly used service descriptions and registry protocols do not support such descriptions in a general manner. In this paper, we present a protocol, its implementation and an API for registering semantic service descriptions and other task/user-specific metadata, and for discovering services according to these. Our approach is based on a mechanism for attaching structured and unstructured metadata, which we show to be applicable to multiple registry technologies. The result is an extremely flexible service registry that can be the basis of a sophisticated semantically-enhanced service discovery engine, an essential component of a Semantic Grid.

Agents and the Grid: Service Discovery

The Grid is a large-scale computer system that is capable of coordinating resources that are not subject to centralised control, whilst using standard, open, general-purpose protocols and interfaces, and delivering non-trivial qualities of service. In this chapter, we argue that Grid applications very strongly suggest the use of agent-based computing, and we review key uses of agent technologies in Grids: user agents, able to customize and personalise data; agent communication languages offering a generic and portable communication medium; and negotiation allowing multiple distributed entities to reach service level agreements. In the second part of the chapter, we focus on Grid service discovery, which we have identified as a prime candidate for use of agent technologies: we show that Grid-services need to be located via personalised, semantic-rich discovery processes, which must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. We present UDDI-MT, an extension to the standard UDDI service directory approach that supports the storage of such metadata via a tunnelling technique that ties the metadata store to the original UDDI directory. The outcome is a flexible service registry which is compatible with existing standards and also provides metadata-enhanced service discovery.