DILIGENT: integrating digital library and Grid technologies for a new Earth observation research infrastructure

This paper introduces DILIGENT, a digital library infrastructure built by integrating digital library and Grid technologies and resources. This infrastructure allows different communities to dynamically build specialised digital libraries capable to support the entire e-Science knowledge production and consumption life-cycle by using shared computing, storage, content, and application resources. The paper presents some of the main software services that implement the DILIGENT system. Moreover, it exemplifies the provided features by presenting how the DILIGENT infrastructure is being exploited in supporting the activity of user communities working in the Earth Science Environmental sector. This work is partially funded by the European Commission in the context of the DILIGENT project, under the 2nd call of FP6 IST priority.     

THROO: a Tracked Hybrid Rover to Overpass Obstacles

In this paper, the design, simulation and experimental tests are presented for THROO: a Tracked Hybrid Rover, which has been developed to Overpass Obstacles. The proposed mobile robot has 3-DOFs and it is capable of straight motion, turning ability and two operations, namely rover-like motion with tracks on flat terrain and walking-like motion with track and legs to overpass obstacles to move on uneven terrain. The leg mechanism is composed of a four-bar linkage, which has been synthesized according to the desired features. In particular, the Burmester problem, which aims at finding the geometric parameters of a four-bar linkage required for a prescribed set of finitely separated poses are solved for the case understudy. Dynamic simulations have been carried out and a prototype has been built. The proposed results show the hybrid rover ability to overpass obstacles, for which size is comparable or greater than the track high.     

A vision towards Scientific Communication Infrastructures

The two pillars of the modern scientific communication are Data Centers and Research Digital Libraries (RDLs), whose technologies and admin staff support researchers at storing, curating, sharing, and discovering the data and the publications they produce. Being realized to maintain and give access to the results of complementary phases of the scientific research process, such systems are poorly integrated with one another and generally do not rely on the strengths of the other. Today, such a gap hampers achieving the objectives of the modern scientific communication, that is, publishing, interlinking, and discovery of all outcomes of the research process, from the experimental and observational datasets to the final paper. In this work, we envision that instrumental to bridge the gap is the construction of “Scientific Communication Infrastructures”. The main goal of these infrastructures is to facilitate interoperability between Data Centers and RDLs and to provide services that simplify the implementation of the large variety of modern scientific communication patterns.     

Spectral‐ALS data fusion for different roughness parameterizations of forested floodplains

Natural river floodplains and adjacent wetlands grow typically a diverse and heterogeneous combination of herbs, shrubs and trees, which play an essential role in determining the total flow resistance. Hydrodynamic effects of trees in forested floodplains can provide the majority of flow resistance during flood events. Nevertheless, ground‐based techniques to acquire vegetation parameters are expensive and difficult to apply over long reaches. This paper presents a novel method of automated roughness parameterization of riparian woody vegetation by fusion of Quickbird multi‐spectral image with airborne laser scanning (ALS) data. The data fusion approach includes: individual tree detection and estimation of vegetation metrics from light detection and ranging (LiDAR) data, assessment of predictive models for the vegetation parameters and spatial mapping of the vegetation parameters for the forest plants in the riparian corridor. The proposed method focuses on estimation of plant density (d), crown diameters (D_C), tree height (h), stem diameter (D_S), crown base height (cbh) and leaf area index (LAI). The procedure is tested along a 14‐km reach of the Sieve River (Tuscany, Italy) characterized by high woody plant density. Due to the complex study area, the data fusion approach explains with variable reliability the local vegetation properties (R²(D_C) = 0.14, R²(h) = 0.84, R²(D_S) = 0.25, R²(cbh) = 0.66). The generated structural parameter maps represent spatially explicit data layers that can be used as inputs to hydrodynamic models used to analyse flow resistance effects in different submergence conditions of vegetation. A simple flow resistance model was applied over a test area comparing the results of the proposed method and a traditional ground‐based approach. The modelling results showed that the new method is able to provide accurate output data to describe the interaction between water levels and bio‐mechanical characteristics of vegetation. The proposed methodology provides a fast, repeatable and accurate way of obtaining floodplain roughness, which enables regular updating of vegetation characteristics. Copyright © 2010 John Wiley & Sons, Ltd.     

Succinct Representation of Labeled Graphs

In many applications, the properties of an object being modeled are stored as labels on vertices or edges of a graph. In this paper, we consider succinct representation of labeled graphs. Our main results are the succinct representations of labeled and multi-labeled graphs (we consider planar triangulations, planar graphs and k-page graphs) to support various label queries efficiently. The additional space cost to store the labels is essentially the information-theoretic minimum. As far as we know, our representations are the first succinct representations of labeled graphs. We also have two preliminary results to achieve the main contribution. First, we design a succinct representation of unlabeled planar triangulations to support the rank/select of edges in ccw (counter clockwise) order in addition to the other operations supported in previous work. Second, we design a succinct representation for a k-page graph when k is large to support various navigational operations more efficiently. In particular, we can test the adjacency of two vertices in O(lg?k) time, while previous work uses O(k) time.     

Bounds on expansion in LZ'77-like coding

We investigate the maximum increase in number of phrases that results from changing k consecutive symbols in a string x having length n parsed using an LZ'77-like algorithm. We consider a class of compression algorithms that partition a sequence into a collection y of nonoverlapping, variable-length phrases and encode them. Each phrase either is a singleton or matches a substring that starts to its left. We show that changing a single symbol of x in position i can yield an expansion that is of order O(n-i)/sup 2/3/ as (n-i)/spl rarr//spl infin/. Our lower bound requires an alphabet size of O(n-i)/sup 1/3/. We also show that changing k consecutive symbols starting from position i can yield an expansion having a similar but somewhat more involved form. The paper contains both analytically derived upper and lower bounds, and algorithms for numerically computing tighter bounds. While deriving the bounds, we provide a detailed analysis of how expansion can arise when changing consecutive symbols. This problem is motivated by management policies for computer systems, such as the IBM Memory eXpansion Technology (MXT) or the IBM iSeries compressed disks, that use LZ'77-like coding on small compression units, such as 1-4 kbyte, and store the compressed data in memory or on disk tracks. Here, when a change of a portion of the compression unit occurs, for example, an L2 cache line, or a 512-byte disk sector, the data is recompressed and potentially stored in a different location. Knowing the maximum expansion, rather than the average expansion, is an important factor for designing policies for allocation and management of memory or disk space.     

Performance of genetic algorithms in search for water splitting perovskites

We examine the performance of genetic algorithms (GAs) in uncovering solar water light splitters over a space of almost 19,000 perovskite materials. The entire search space was previously calculated using density functional theory to determine solutions that fulfill constraints on stability, band gap, and band edge position. Here, we test over 2500 unique GA implementations in finding these solutions to determine whether GA can avoid the need for brute force search, and thereby enable larger chemical spaces to be screened within a given computational budget. We find that the best GAs tested offer almost a 6 times efficiency gain over random search, and are comparable to the performance of a search based on informed chemical rules. In addition, the GA is almost 10 times as efficient as random search in finding half the solutions within the search space. By employing chemical rules, the performance of the GA can be further improved to approximately 12–17 better than random search. We discuss the effect of population size, selection function, crossover function, mutation rate, fitness function, and elitism on the final result, finding that selection function and elitism are especially important to GA performance. In addition, we determine that parameters that perform well in finding solar water splitters can also be applied to discovering transparent photocorrosion shields. Our results indicate that coupling GAs to high-throughput density functional calculations presents a promising method to rapidly search large chemical spaces for technological materials.     

In Vivo Evaluation of Sgc8-c Aptamer as a Molecular Imaging Probe for Colon Cancer in a Mouse Xenograft Model

Recent biotechnological applications in the field of clinical oncology led to the identification of new biomarkers as molecular targets of cancer, and to broad developments in the field of personalized medicine. Aptamers are oligonucleotides (ssDNA or RNA) that are selected to specifically recognize a molecular target with high affinity and specificity. Based on this, new horizons for their use as molecular imaging probes are being explored. The objective of this work was to evaluate the Sgc8-c aptamer conjugated with Alexa Fluor 647 fluorophore as an imaging probe in a colon tumor xenograft mouse model, with potential application in molecular imaging. In this study, the LS174T cell line was used to induce colorectal adenocarcinoma in nude mice. After confirmation of PTK7 overexpression by immunohistochemistry, in vivo studies were performed. Pharmacokinetic, in vivo and ex vivo biodistribution imaging, and a competition assay were evaluated by fluorescence imaging. In vivo visualization of the probe in the tumors was assessed two hours after aptamer probe administration, exhibiting excellent tumor-to-background ratios in biodistribution studies and high specificity in the competition test. Our results demonstrated the functionality of Scg8-c as an imaging probe for colon cancer, with potential clinical applications.     

Theoretical and Experimental Investigation of Gas-Lubricated,Pivoted-Pad Journal Bearings

This paper presents some of the theoretical predictions and experimental results for the steady-state characteristics of a gas-lubricated, pivoted-pad journal bearing of finite length. An analytical expression for the prediction of load-carrying capacity for these bearings is developed from numerical computer solutions. Sample calculations are presented to show how the theoretical data may be utilized in the design of an actual pivoted-pad bearing. Improvements over previous approximate theories are discussed.