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.     

A speed sensorless control based on a MRAS applied to a double fed induction machine drive

This paper proposes a new MRAS method to estimate the mechanical quantities in a double fed induction machine. In the traditional formulation the integral term, introduced by the PI MRAS regulator, is canceled in the transfer function between the estimated and the real speed. As a novelty, an additional term depending on the reference rotor flux through a constant gain g is introduced in the adjustable model of the MRAS. This innovation restores the integral term in the transfer function. As a consequence, during the closed loop operation, the estimated speed does not exhibit anymore a steady state error. The influence of the inverter non-linearities and of the non-linear rotor brush resistance on the speed estimation is also discussed. Some experimental tests validate the proposed method.     

Experimental and Theoretical Analysis of the Gas-Lubricated Porous Rotating Journal Bearing

An experimental and theoretical analysis of the externally gas-pressurized, porous wall, rotating and nonrotating journal bearing is presented. The theoretical results are found to be in good agreement with the experimental ones.

The proposed numerical method enables one to design a bearing and to evaluate the influence of journal rotation speed and gas compressibility on its operational performance.     

Determination of Performance Characteristics of Hydrostatic Bearing Systems that Support a Rigid Body

An analysis of a system of hydrostatic bearings used to support a rigid structure subjected to either specified loads or movements is described, and results of sample problems are shown. The governing equations are developed, considering generalized system supply circuitry and arbitrary selection of fixed type compensating elements for each bearing. The equations have been programmed for solution on a high-speed digital computer. The methods of solution and conceptual flow chart of the program are described. From specified loads (or alternatively displacements) of a point on the body chosen as the origin, individual bearing performance parameters, resultant body displacements (or alternatively loads), and the hydraulic system parameters are determined.     

Riparian Vegetation Mapping for Hydraulic Roughness Estimation Using Very High Resolution Remote Sensing Data Fusion

For detailed hydraulic modeling, accurate spatial information of riparian vegetation patterns needs to be derived in automatic fashion. We propose a supervised classification for heterogeneous riparian corridors with a low number of spectrally separate classes using data fusion of a Quickbird image and LIDAR data. The approach considers nine land cover classes including three woody riparian species, brush, cultivated areas, grassland, urban infrastructures, bare soil and water. The classical “stacked vector” approach is adopted for data fusion, while the nonparametric weighted feature-extraction method and the pixel-oriented maximum likelihood algorithm are used for feature-reduction and classification purposes, respectively. We test the approach over a 14-km stretch of the Sieve River (Tuscany Region, Italy). A one-dimensional river modeling is applied over the study reach comparing the results of a classification-derived hydraulic roughness map and a traditional ground-based approach. Despite the complex study reach, the classification method produced encouraging accuracies (OKS = 0.77) and represents a useful tool to delineate application domains of flow resistance models suited to different hydrodynamic patterns (e.g., stiff/flexible vegetation). Hydraulic modeling results showed that the remotely derived floodplain roughness parameterization captures the equivalent Manning coefficient over 20 test cross sections with uncertainty distributions described by low mean and standard deviation values.