Lower bound cost estimation for logic programs

It is generally recognized that information about the runtime cost of computations can be useful for a variety of applications, including program transformation, granularity control during parallel execution, and query optimization in deductive databases. Most of the work to date on compile-time cost estimation of logic programs has focused on the estimation of upper bounds on costs. However, in many applications, such as parallel implementations on distributed-memory machines, one would prefer to work with lower bounds instead. The problem with estimating lower bounds is that in general, it is necessary to account for the possibility of failure of head unification, leading to a trivial lower bound of 0. In this paper, we show how, given type and mode information about procedures in a logic program, it is possible to (semi-automatically) derive nontrivial lower bounds on their computational costs. We also discuss the cost analysis for the special and frequent case of divide-and-conquer programs and show how —as a pragmatic short-term solution —it may be possible to obtain useful results simply by identifying and treating divide-and-conquer programs specially.

Estimating the computational cost of logic programs

Information about the computational cost of programs is potentially useful for a variety of purposes, including selecting among different algorithms, guiding program transformations, in granularity control and mapping decisions in parallelizing compilers, and query optimization in deductive databases. Cost analysis of logic programs is complicated by nondeterminism: on the one hand, procedures can return múltiple Solutions, making it necessary to estímate the number of solutions in order to give nontrivial upper bound cost estimates; on the other hand, the possibility of failure has to be taken into account while estimating lower bounds. Here we discuss techniques to address these problems to some extent.

Mapping Genetic Diversity of Cherimoya (Annona cherimola Mill.): Application of Spatial Analysis for Conservation and Use of Plant Genetic Resources.

There is a growing call for inventories that evaluate geographic patterns in diversity of plant genetic resources maintained on farm and in species' natural populations in order to enhance their use and conservation. Such evaluations are relevant for useful tropical and subtropical tree species, as many of these species are still undomesticated, or in incipient stages of domestication and local populations can offer yet-unknown traits of high value to further domestication. For many outcrossing species, such as most trees, inbreeding depression can be an issue, and genetic diversity is important to sustain local production. Diversity is also crucial for species to adapt to environmental changes. This paper explores the possibilities of incorporating molecular marker data into Geographic Information Systems (GIS) to allow visualization and better understanding of spatial patterns of genetic diversity as a key input to optimize conservation and use of plant genetic resources, based on a case study of cherimoya (Annona cherimola Mill.), a Neotropical fruit tree species. We present spatial analyses to (1) improve the understanding of spatial distribution of genetic diversity of cherimoya natural stands and cultivated trees in Ecuador, Bolivia and Peru based on microsatellite molecular markers (SSRs); and (2) formulate optimal conservation strategies by revealing priority areas for in situ conservation, and identifying existing diversity gaps in ex situ collections. We found high levels of allelic richness, locally common alleles and expected heterozygosity in cherimoya's putative centre of origin, southern Ecuador and northern Peru, whereas levels of diversity in southern Peru and especially in Bolivia were significantly lower. The application of GIS on a large microsatellite dataset allows a more detailed prioritization of areas for in situ conservation and targeted collection across the Andean distribution range of cherimoya than previous studies could do, i.e. at province and department level in Ecuador and Peru, respectively.

Design and integration of lower ports for ITER diagnostic systems

All around the ITER vacuum vessel, forty-four ports will provide access to the vacuum vessel for remotehandling operations, diagnostic systems, heating, and vacuum systems: 18 upper ports, 17 equatorialports, and 9 lower ports. Among the lower ports, three of them will be used for the remote handlinginstallation of the ITER divertor. Once the divertor is in place, these ports will host various diagnosticsystems mounted in the so-called diagnostic racks. The diagnostic racks must allow the support andcooling of the diagnostics, extraction of the required diagnostic signals, and providing access and main-tainability while minimizing the leakage of radiation toward the back of the port where the humans areallowed to enter. A fully integrated inner rack, carrying the near plasma diagnostic components, will bean stainless steel structure, 4.2 m long, with a maximum weight of 10 t. This structure brings water forcooling and baking at maximum temperature of 240?C and provides connection with gas, vacuum andelectric services. Additional racks (placed away from plasma and not requiring cooling) may be requiredfor the support of some particular diagnostic components. The diagnostics racks and its associated exvessel structures, which are in its conceptual design phase, are being designed to survive the lifetimeof ITER of 20 years. This paper presents the current state of development including interfaces, diagnos-tic integration, operation and maintenance, shielding requirements, remote handling, loads cases anddiscussion of the main challenges coming from the severe environment and engineering requirements.