Project OASIS: The Design of a Signal Detector for the Search for Extraterrestrial Intelligence

An 8 million channel spectrum analyzer (MCSA) was designed the meet to meet the needs of a SETI program. The MCSA puts out a very large data base at very high rates. The development of a device which follows the MCSA, is presented

High performance genetic algorithm for land use planning

[Abstract] This study uses genetic algorithms to formulate and develop land use plans. The restrictions to be imposed and the variables to be optimized are selected based on current local and national legal rules and experts’ criteria. Other considerations can easily be incorporated in this approach. Two optimization criteria are applied: land suitability and the shape-regularity of the resulting land use patches. We consider the existing plots as the minimum units for land use allocation. As the number of affected plots can be large, the algorithm execution time is potentially high. The work thus focuses on implementing and analyzing different parallel paradigms: multi-core parallelism, cluster parallelism and the combination of both. Some tests were performed that show the suitability of genetic algorithms to land use planning problems.Xunta de Galicia; 2010/06Xunta de Galicia; 2010/28Xunta de Galicia; 08SIN011291P

In vivo facilitated diffusion model

Under dilute in vitro conditions transcription factors rapidly locate their target sequence on DNA by using the facilitated diffusion mechanism. However, whether this strategy of alternating between three-dimensional bulk diffusion and one-dimensional sliding along the DNA contour is still beneficial in the crowded interior of cells is highly disputed. Here we use a simple model for the bacterial genome inside the cell and present a semi-analytical model for the in vivo target search of transcription factors within the facilitated diffusion framework. Without having to resort to extensive simulations we determine the mean search time of a lac repressor in a living E. coli cell by including parameters deduced from experimental measurements. The results agree very well with experimental findings, and thus the facilitated diffusion picture emerges as a quantitative approach to gene regulation in living bacteria cells. Furthermore we see that the search time is not very sensitive to the parameters characterizing the DNA configuration and that the cell seems to operate very close to optimal conditions for target localization. Local searches as implied by the colocalization mechanism are only found to mildly accelerate the mean search time within our model.Comment: 19 pages, 9 figures, Supplementary Information directly include

Solving Irregular Strip Packing Problems With Free Rotations Using Separation Lines

Solving nesting problems or irregular strip packing problems is to position polygons in a fixed width and unlimited length strip, obeying polygon integrity containment constraints and non-overlapping constraints, in order to minimize the used length of the strip. To ensure non-overlapping, we used separation lines. A straight line is a separation line if given two polygons, all vertices of one of the polygons are on one side of the line or on the line, and all vertices of the other polygon are on the other side of the line or on the line. Since we are considering free rotations of the polygons and separation lines, the mathematical model of the studied problem is nonlinear. Therefore, we use the nonlinear programming solver IPOPT (an algorithm of interior points type), which is part of COIN-OR. Computational tests were run using established benchmark instances and the results were compared with the ones obtained with other methodologies in the literature that use free rotation

Thermal evolution and sintering of chondritic planetesimals III. Modelling the heat conductivity of porous chondrite material

The construction of models for the internal constitution and the temporal evolution of large planetesimals, the parent bodies of chondrites, requires information on the heat conductivity of the complex mixture of minerals and iron metal found in chondrites. It is attempted to evaluate the heat conductivity of a multi-component mineral mixture and granular medium from the heat conductivities of its mixture components. Random mixtures of solids with chondritic composition and packings of spheres are numerically generated. The heat conduction equation is solved in high spatial resolution for a test cube filled with such matter. From the heat flux through the cube the heat conductivity of the mixture is derived. The model results for porous material are consistent with data for compacted sandstone, but are at odds with measurements for H and L chondrites. The discrepancy is traced back to shock modification of the currently available meteoritic material by impacts on the parent body over the last 4.5 Ga. This causes numerous micro-cracks that act as additional barriers for heat transfer. The void structure in meteorites is different from that which probably existed in the pristine material of the parent bodies. The results obtained for the heat conductivity of the pristine material are used for calculating models for the evolution of the H chondrite parent body which are fitted to the cooling data of a number of H chondrites. The fit to the data good.Comment: 19 pages, 8 figures, accepted by Astronomy & Astrophysic

Terrain Aware Traverse Planning for Mars Rovers

NASA is proposing a Mars Sample Return mission, to be completed within one Martian year, that will require enhanced autonomy to perform its duties faster, safer, and more efficiently. With its main purpose being to retrieve samples possibly tens of kilometers away, it will need to drive beyond line-of-sight to get to its target more quickly than any rovers before. This research proposes a new methodology to support a sample return mission and is divided into three compo-nents: map preparation (map of traversability, i.e., ability of a terrain to sustain the traversal of a vehicle), path planning (pre-planning and replanning), and terrain analysis. The first component aims at creating a better knowledge of terrain traversability to support planning, by predicting rover slip and drive speed along the traverse using orbital data. By overlapping slope, rock abundance and terrain types at the same location, the expected drive velocity is obtained. By combining slope and thermal data, additional information about the experienced slip is derived, indicating whether it will be low (less than 30%) or medium to high (more than 30%). The second component involves planning the traverse for one Martian day (or sol) at a time, based on the map of expected drive speed. This research proposes to plan, offline, several paths traversable in one sol. Once online, the rover chooses the fastest option (the path cost being calculated using the distance divided by the expected velocity). During its drive, the rover monitors the terrain via analysis of its experienced wheel slip and actual speed. This information is then passed along the different pre-planned paths over a given distance (e.g., 25 m) and the map of traversability is locally updated given this new knowledge. When an update occurs, the rover calculates the new time of arrival of the various paths and replans its route if necessary. When tested in a simulation study on maps of the Columbia Hills, Mars, the rover successfully updates the map given new information drawn from a modified map used as ground truth for simulation purposes and replans its traverse when needed. The third component describes a method to assess the soil in-situ in case of dangerous terrain detected during the map update, or if the monitoring is not enough to confirm the traversability predicted by the map. The rover would deploy a shear vane instrument to compute intrinsic terrain parameters, information then propagated ahead of the rover to update the map and replan if necessary. Experiments in a laboratory setting as well as in the field showed promising results, the mounted shear vane giving values close to the expected terrain parameters of the tested soils

A Parallel Adaptive P3M code with Hierarchical Particle Reordering

We discuss the design and implementation of HYDRA_OMP a parallel implementation of the Smoothed Particle Hydrodynamics-Adaptive P3M (SPH-AP3M) code HYDRA. The code is designed primarily for conducting cosmological hydrodynamic simulations and is written in Fortran77+OpenMP. A number of optimizations for RISC processors and SMP-NUMA architectures have been implemented, the most important optimization being hierarchical reordering of particles within chaining cells, which greatly improves data locality thereby removing the cache misses typically associated with linked lists. Parallel scaling is good, with a minimum parallel scaling of 73% achieved on 32 nodes for a variety of modern SMP architectures. We give performance data in terms of the number of particle updates per second, which is a more useful performance metric than raw MFlops. A basic version of the code will be made available to the community in the near future.Comment: 34 pages, 12 figures, accepted for publication in Computer Physics Communication

Garbage Collection of Linked Data Structures: An Example in a Network Oriented Database Management System

A unified view of the numerous existing algorithms for performing garbage collection of linked data structure has been presented. An implementation of a garbage collection tool in a network oriented database management system has been described