GMonE: a complete approach to cloud monitoring

The inherent complexity of modern cloud infrastructures has created the need for innovative monitoring approaches, as state-of-the-art solutions used for other large-scale environments do not address specific cloud features. Although cloud monitoring is nowadays an active research field, a comprehensive study covering all its aspects has not been presented yet. This paper provides a deep insight into cloud monitoring. It proposes a unified cloud monitoring taxonomy, based on which it defines a layered cloud monitoring architecture. To illustrate it, we have implemented GMonE, a general-purpose cloud monitoring tool which covers all aspects of cloud monitoring by specifically addressing the needs of modern cloud infrastructures. Furthermore, we have evaluated the performance, scalability and overhead of GMonE with Yahoo Cloud Serving Benchmark (YCSB), by using the OpenNebula cloud middleware on the Grid’5000 experimental testbed. The results of this evaluation demonstrate the benefits of our approach, surpassing the monitoring performance and capabilities of cloud monitoring alternatives such as those present in state-of-the-art systems such as Amazon EC2 and OpenNebula.

Modelo de computación conexionista inspirado en las redes de procesadores evolutivos y su aprendizaje

La informática teórica es una disciplina básica ya que la mayoría de los avances en informática se sustentan en un sólido resultado de esa materia. En los últimos a~nos debido tanto al incremento de la potencia de los ordenadores, como a la cercanía del límite físico en la miniaturización de los componentes electrónicos, resurge el interés por modelos formales de computación alternativos a la arquitectura clásica de von Neumann. Muchos de estos modelos se inspiran en la forma en la que la naturaleza resuelve eficientemente problemas muy complejos. La mayoría son computacionalmente completos e intrínsecamente paralelos. Por este motivo se les está llegando a considerar como nuevos paradigmas de computación (computación natural). Se dispone, por tanto, de un abanico de arquitecturas abstractas tan potentes como los computadores convencionales y, a veces, más eficientes: alguna de ellas mejora el rendimiento, al menos temporal, de problemas NPcompletos proporcionando costes no exponenciales. La representación formal de las redes de procesadores evolutivos requiere de construcciones, tanto independientes, como dependientes del contexto, dicho de otro modo, en general una representación formal completa de un NEP implica restricciones, tanto sintácticas, como semánticas, es decir, que muchas representaciones aparentemente (sintácticamente) correctas de casos particulares de estos dispositivos no tendrían sentido porque podrían no cumplir otras restricciones semánticas. La aplicación de evolución gramatical semántica a los NEPs pasa por la elección de un subconjunto de ellos entre los que buscar los que solucionen un problema concreto. En este trabajo se ha realizado un estudio sobre un modelo inspirado en la biología celular denominado redes de procesadores evolutivos [55, 53], esto es, redes cuyos nodos son procesadores muy simples capaces de realizar únicamente un tipo de mutación puntual (inserción, borrado o sustitución de un símbolo). Estos nodos están asociados con un filtro que está definido por alguna condición de contexto aleatorio o de pertenencia. Las redes están formadas a lo sumo de seis nodos y, teniendo los filtros definidos por una pertenencia a lenguajes regulares, son capaces de generar todos los lenguajes enumerables recursivos independientemente del grafo subyacente. Este resultado no es sorprendente ya que semejantes resultados han sido documentados en la literatura. Si se consideran redes con nodos y filtros definidos por contextos aleatorios {que parecen estar más cerca a las implementaciones biológicas{ entonces se pueden generar lenguajes más complejos como los lenguajes no independientes del contexto. Sin embargo, estos mecanismos tan simples son capaces de resolver problemas complejos en tiempo polinomial. Se ha presentado una solución lineal para un problema NP-completo, el problema de los 3-colores. Como primer aporte significativo se ha propuesto una nueva dinámica de las redes de procesadores evolutivos con un comportamiento no determinista y masivamente paralelo [55], y por tanto todo el trabajo de investigación en el área de la redes de procesadores se puede trasladar a las redes masivamente paralelas. Por ejemplo, las redes masivamente paralelas se pueden modificar de acuerdo a determinadas reglas para mover los filtros hacia las conexiones. Cada conexión se ve como un canal bidireccional de manera que los filtros de entrada y salida coinciden. A pesar de esto, estas redes son computacionalmente completas. Se pueden también implementar otro tipo de reglas para extender este modelo computacional. Se reemplazan las mutaciones puntuales asociadas a cada nodo por la operación de splicing. Este nuevo tipo de procesador se denomina procesador splicing. Este modelo computacional de Red de procesadores con splicing ANSP es semejante en cierto modo a los sistemas distribuidos en tubos de ensayo basados en splicing. Además, se ha definido un nuevo modelo [56] {Redes de procesadores evolutivos con filtros en las conexiones{ , en el cual los procesadores tan solo tienen reglas y los filtros se han trasladado a las conexiones. Dicho modelo es equivalente, bajo determinadas circunstancias, a las redes de procesadores evolutivos clásicas. Sin dichas restricciones el modelo propuesto es un superconjunto de los NEPs clásicos. La principal ventaja de mover los filtros a las conexiones radica en la simplicidad de la modelización. Otras aportaciones de este trabajo ha sido el dise~no de un simulador en Java [54, 52] para las redes de procesadores evolutivos propuestas en esta Tesis. Sobre el término "procesador evolutivo" empleado en esta Tesis, el proceso computacional descrito aquí no es exactamente un proceso evolutivo en el sentido Darwiniano. Pero las operaciones de reescritura que se han considerado pueden interpretarse como mutaciones y los procesos de filtrado se podrían ver como procesos de selección. Además, este trabajo no abarca la posible implementación biológica de estas redes, a pesar de ser de gran importancia. A lo largo de esta tesis se ha tomado como definición de la medida de complejidad para los ANSP, una que denotaremos como tama~no (considerando tama~no como el número de nodos del grafo subyacente). Se ha mostrado que cualquier lenguaje enumerable recursivo L puede ser aceptado por un ANSP en el cual el número de procesadores está linealmente acotado por la cardinalidad del alfabeto de la cinta de una máquina de Turing que reconoce dicho lenguaje L. Siguiendo el concepto de ANSP universales introducido por Manea [65], se ha demostrado que un ANSP con una estructura de grafo fija puede aceptar cualquier lenguaje enumerable recursivo. Un ANSP se puede considerar como un ente capaz de resolver problemas, además de tener otra propiedad relevante desde el punto de vista práctico: Se puede definir un ANSP universal como una subred, donde solo una cantidad limitada de parámetros es dependiente del lenguaje. La anterior característica se puede interpretar como un método para resolver cualquier problema NP en tiempo polinomial empleando un ANSP de tama~no constante, concretamente treinta y uno. Esto significa que la solución de cualquier problema NP es uniforme en el sentido de que la red, exceptuando la subred universal, se puede ver como un programa; adaptándolo a la instancia del problema a resolver, se escogerín los filtros y las reglas que no pertenecen a la subred universal. Un problema interesante desde nuestro punto de vista es el que hace referencia a como elegir el tama~no optimo de esta red.---ABSTRACT---This thesis deals with the recent research works in the area of Natural Computing {bio-inspired models{, more precisely Networks of Evolutionary Processors first developed by Victor Mitrana and they are based on P Systems whose father is Georghe Paun. In these models, they are a set of processors connected in an underlying undirected graph, such processors have an object multiset (strings) and a set of rules, named evolution rules, that transform objects inside processors[55, 53],. These objects can be sent/received using graph connections provided they accomplish constraints defined at input and output filters processors have. This symbolic model, non deterministic one (processors are not synchronized) and massive parallel one[55] (all rules can be applied in one computational step) has some important properties regarding solution of NP-problems in lineal time and of course, lineal resources. There are a great number of variants such as hybrid networks, splicing processors, etc. that provide the model a computational power equivalent to Turing machines. The origin of networks of evolutionary processors (NEP for short) is a basic architecture for parallel and distributed symbolic processing, related to the Connection Machine as well as the Logic Flow paradigm, which consists of several processors, each of them being placed in a node of a virtual complete graph, which are able to handle data associated with the respective node. All the nodes send simultaneously their data and the receiving nodes handle also simultaneously all the arriving messages, according to some strategies. In a series of papers one considers that each node may be viewed as a cell having genetic information encoded in DNA sequences which may evolve by local evolutionary events, that is point mutations. Each node is specialized just for one of these evolutionary operations. Furthermore, the data in each node is organized in the form of multisets of words (each word appears in an arbitrarily large number of copies), and all the copies are processed in parallel such that all the possible events that can take place do actually take place. Obviously, the computational process just described is not exactly an evolutionary process in the Darwinian sense. But the rewriting operations we have considered might be interpreted as mutations and the filtering process might be viewed as a selection process. Recombination is missing but it was asserted that evolutionary and functional relationships between genes can be captured by taking only local mutations into consideration. It is clear that filters associated with each node allow a strong control of the computation. Indeed, every node has an input and output filter; two nodes can exchange data if it passes the output filter of the sender and the input filter of the receiver. Moreover, if some data is sent out by some node and not able to enter any node, then it is lost. In this paper we simplify the ANSP model considered in by moving the filters from the nodes to the edges. Each edge is viewed as a two-way channel such that the input and output filters coincide. Clearly, the possibility of controlling the computation in such networks seems to be diminished. For instance, there is no possibility to loose data during the communication steps. In spite of this and of the fact that splicing is not a powerful operation (remember that splicing systems generates only regular languages) we prove here that these devices are computationally complete. As a consequence, we propose characterizations of two complexity classes, namely NP and PSPACE, in terms of accepting networks of restricted splicing processors with filtered connections. We proposed a uniform linear time solution to SAT based on ANSPFCs with linearly bounded resources. This solution should be understood correctly: we do not solve SAT in linear time and space. Since any word and auxiliary word appears in an arbitrarily large number of copies, one can generate in linear time, by parallelism and communication, an exponential number of words each of them having an exponential number of copies. However, this does not seem to be a major drawback since by PCR (Polymerase Chain Reaction) one can generate an exponential number of identical DNA molecules in a linear number of reactions. It is worth mentioning that the ANSPFC constructed above remains unchanged for any instance with the same number of variables. Therefore, the solution is uniform in the sense that the network, excepting the input and output nodes, may be viewed as a program according to the number of variables, we choose the filters, the splicing words and the rules, then we assign all possible values to the variables, and compute the formula.We proved that ANSP are computationally complete. Do the ANSPFC remain still computationally complete? If this is not the case, what other problems can be eficiently solved by these ANSPFCs? Moreover, the complexity class NP is exactly the class of all languages decided by ANSP in polynomial time. Can NP be characterized in a similar way with ANSPFCs?

Veto values in Group Decision Making within MAUT: aggregating complete rankings derived from dominance intensity measures

We consider a groupdecision-making problem within multi-attribute utility theory, in which the relative importance of decisionmakers (DMs) is known and their preferences are represented by means of an additive function. We allow DMs to provide veto values for the attribute under consideration and build veto and adjust functions that are incorporated into the additive model. Veto functions check whether alternative performances are within the respective veto intervals, making the overall utility of the alternative equal to 0, where as adjust functions reduce the utilty of the alternative performance to match the preferences of other DMs. Dominance measuring methods are used to account for imprecise information in the decision-making scenario and to derive a ranking of alternatives for each DM. Specifically, ordinal information about the relative importance of criteria is provided by each DM. Finally, an extension of Kemeny's method is used to aggregate the alternative rankings from the DMs accounting for the irrelative importance.

Complete resolution of the solid-state NMR spectrum of a uniformly 15N-labeled membrane protein in phospholipid bilayers

Complete resolution of the amide resonances in a three-dimensional solid-state NMR correlation spectrum of a uniformly 15N-labeled membrane protein in oriented phospholipid bilayers is demonstrated. The three orientationally dependent frequencies, 1H chemical shift, 1H–15N dipolar coupling, and 15N chemical shift, associated with each amide resonance are responsible for resolution among resonances and provide sufficient angular restrictions for protein structure determination. Because the protein is completely immobilized by the phospholipids on the relevant NMR time scales (10 kHz), the linewidths will not degrade in the spectra of larger proteins. Therefore, these results demonstrate that solid-state NMR experiments can overcome the correlation time problem and extend the range of proteins that can have their structures determined by NMR spectroscopy to include uniformly 15N-labeled membrane proteins in phospholipid bilayers.

Complete sequencing of the Fugu WAGR region from WT1 to PAX6: Dramatic compaction and conservation of synteny with human chromosome 11p13

The pufferfish Fugu rubripes has a genome ≈7.5 times smaller than that of mammals but with a similar number of genes. Although conserved synteny has been demonstrated between pufferfish and mammals across some regions of the genome, there is some controversy as to what extent Fugu will be a useful model for the human genome, e.g., [Gilley, J., Armes, N. & Fried, M. (1997) Nature (London) 385, 305–306]. We report extensive conservation of synteny between a 1.5-Mb region of human chromosome 11 and <100 kb of the Fugu genome in three overlapping cosmids. Our findings support the idea that the majority of DNA in the region of human chromosome 11p13 is intergenic. Comparative analysis of three unrelated genes with quite different roles, WT1, RCN1, and PAX6, has revealed differences in their structural evolution. Whereas the human WT1 gene can generate 16 protein isoforms via a combination of alternative splicing, RNA editing, and alternative start site usage, our data predict that Fugu WT1 is capable of generating only two isoforms. This raises the question of the extent to which the evolution of WT1 isoforms is related to the evolution of the mammalian genitourinary system. In addition, this region of the Fugu genome shows a much greater overall compaction than usual but with significant noncoding homology observed at the PAX6 locus, implying that comparative genomics has identified regulatory elements associated with this gene.

A complete genome screen for genes predisposing to severe bipolar disorder in two Costa Rican pedigrees

Bipolar mood disorder (BP) is a debilitating syndrome characterized by episodes of mania and depression. We designed a multistage study to detect all major loci predisposing to severe BP (termed BP-I) in two pedigrees drawn from the Central Valley of Costa Rica, where the population is largely descended from a few founders in the 16th–18th centuries. We considered only individuals with BP-I as affected and screened the genome for linkage with 473 microsatellite markers. We used a model for linkage analysis that incorporated a high phenocopy rate and a conservative estimate of penetrance. Our goal in this study was not to establish definitive linkage but rather to detect all regions possibly harboring major genes for BP-I in these pedigrees. To facilitate this aim, we evaluated the degree to which markers that were informative in our data set provided coverage of each genome region; we estimate that at least 94% of the genome has been covered, at a predesignated threshold determined through prior linkage simulation analyses. We report here the results of our genome screen for BP-I loci and indicate several regions that merit further study, including segments in 18q, 18p, and 11p, in which suggestive lod scores were observed for two or more contiguous markers. Isolated lod scores that exceeded our thresholds in one or both families also occurred on chromosomes 1, 2, 3, 4, 5, 7, 13, 15, 16, and 17. Interesting regions highlighted in this genome screen will be followed up using linkage disequilibrium (LD) methods.

Complete mitochondrial genome suggests diapsid affinities of turtles

Despite more than a century of debate, the evolutionary position of turtles (Testudines) relative to other amniotes (reptiles, birds, and mammals) remains uncertain. One of the major impediments to resolving this important evolutionary problem is the highly distinctive and enigmatic morphology of turtles that led to their traditional placement apart from diapsid reptiles as sole descendants of presumably primitive anapsid reptiles. To address this question, the complete (16,787-bp) mitochondrial genome sequence of the African side-necked turtle (Pelomedusa subrufa) was determined. This molecule contains several unusual features: a (TA)n microsatellite in the control region, the absence of an origin of replication for the light strand in the WANCY region of five tRNA genes, an unusually long noncoding region separating the ND5 and ND6 genes, an overlap between ATPase 6 and COIII genes, and the existence of extra nucleotides in ND3 and ND4L putative ORFs. Phylogenetic analyses of the complete mitochondrial genome sequences supported the placement of turtles as the sister group of an alligator and chicken (Archosauria) clade. This result clearly rejects the Haematothermia hypothesis (a sister-group relationship between mammals and birds), as well as rejecting the placement of turtles as the most basal living amniotes. Moreover, evidence from both complete mitochondrial rRNA genes supports a sister-group relationship of turtles to Archosauria to the exclusion of Lepidosauria (tuatara, snakes, and lizards). These results challenge the classic view of turtles as the only survivors of primary anapsid reptiles and imply that turtles might have secondarily lost their skull fenestration.

Multiple-complete-digest restriction fragment mapping: Generating sequence-ready maps for large-scale DNA sequencing

Multiple-complete-digest mapping is a DNA mapping technique based on complete-restriction-digest fingerprints of a set of clones that provides highly redundant coverage of the mapping target. The maps assembled from these fingerprints order both the clones and the restriction fragments. Maps are coordinated across three enzymes in the examples presented. Starting with yeast artificial chromosome contigs from the 7q31.3 and 7p14 regions of the human genome, we have produced cosmid-based maps spanning more than one million base pairs. Each yeast artificial chromosome is first subcloned into cosmids at a redundancy of ×15–30. Complete-digest fragments are electrophoresed on agarose gels, poststained, and imaged on a fluorescent scanner. Aberrant clones that are not representative of the underlying genome are rejected in the map construction process. Almost every restriction fragment is ordered, allowing selection of minimal tiling paths with clone-to-clone overlaps of only a few thousand base pairs. These maps demonstrate the practicality of applying the experimental and software-based steps in multiple-complete-digest mapping to a target of significant size and complexity. We present evidence that the maps are sufficiently accurate to validate both the clones selected for sequencing and the sequence assemblies obtained once these clones have been sequenced by a “shotgun” method.

Native display of complete foreign protein domains on the surface of hepatitis B virus capsids

The nucleocapsid of hepatitis B virus (HBV), or HBcAg, is a highly symmetric structure formed by multiple dimers of a single core protein that contains potent T helper epitopes in its 183-aa sequence. Both factors make HBcAg an unusually strong immunogen and an attractive candidate as a carrier for foreign epitopes. The immunodominant c/e1 epitope on the capsid has been suggested as a superior location to convey high immunogenicity to a heterologous sequence. Because of its central position, however, any c/e1 insert disrupts the core protein’s primary sequence; hence, only peptides, or rather small protein fragments seemed to be compatible with particle formation. According to recent structural data, the epitope is located at the tips of prominent surface spikes formed by the very stable dimer interfaces. We therefore reasoned that much larger inserts might be tolerated, provided the individual parts of a corresponding fusion protein could fold independently. Using the green fluorescent protein (GFP) as a model insert, we show that the chimeric protein efficiently forms fluorescent particles; hence, all of its structurally important parts must be properly folded. We also demonstrate that the GFP domains are surface-exposed and that the chimeric particles elicit a potent humoral response against native GFP. Hence, proteins of at least up to 238 aa can be natively displayed on the surface of HBV core particles. Such chimeras may not only be useful as vaccines but may also open the way for high resolution structural analyses of nonassembling proteins by electron microscopy.

An Escherichia coli strain with all chromosomal rRNA operons inactivated: Complete exchange of rRNA genes between bacteria

Current global phylogenies are built predominantly on rRNA sequences. However, an experimental system for studying the evolution of rRNA is not readily available, mainly because the rRNA genes are highly repeated in most experimental organisms. We have constructed an Escherichia coli strain in which all seven chromosomal rRNA operons are inactivated by deletions spanning the 16S and 23S coding regions. A single E. coli rRNA operon carried by a multicopy plasmid supplies 16S and 23S rRNA to the cell. By using this strain we have succeeded in creating microorganisms that contain only a foreign rRNA operon derived from either Salmonella typhimurium or Proteus vulgaris, microorganisms that have diverged from E. coli about 120–350 million years ago. We also were able to replace the E. coli rRNA operon with an E. coli/yeast hybrid one in which the GTPase center of E. coli 23S rRNA had been substituted by the corresponding domain from Saccharomyces cerevisiae. These results suggest that, contrary to common belief, coevolution of rRNA with many other components in the translational machinery may not completely preclude the horizontal transfer of rRNA genes.

The COG database: new developments in phylogenetic classification of proteins from complete genomes

The database of Clusters of Orthologous Groups of proteins (COGs), which represents an attempt on a phylogenetic classification of the proteins encoded in complete genomes, currently consists of 2791 COGs including 45 350 proteins from 30 genomes of bacteria, archaea and the yeast Saccharomyces cerevisiae (http://www.ncbi.nlm.nih.gov/COG). In addition, a supplement to the COGs is available, in which proteins encoded in the genomes of two multicellular eukaryotes, the nematode Caenorhabditis elegans and the fruit fly Drosophila melanogaster, and shared with bacteria and/or archaea were included. The new features added to the COG database include information pages with structural and functional details on each COG and literature references, improvements of the COGNITOR program that is used to fit new proteins into the COGs, and classification of genomes and COGs constructed by using principal component analysis.

Genomic evidence for a complete sexual cycle in Candida albicans

Candida albicans is a diploid fungus that has become a medically important opportunistic pathogen in immunocompromised individuals. We have sequenced the C. albicans genome to 10.4-fold coverage and performed a comparative genomic analysis between C. albicans and Saccharomyces cerevisiae with the objective of assessing whether Candida possesses a genetic repertoire that could support a complete sexual cycle. Analyzing over 500 genes important for sexual differentiation in S. cerevisiae, we find many homologues of genes that are implicated in the initiation of meiosis, chromosome recombination, and the formation of synaptonemal complexes. However, others are striking in their absence. C. albicans seems to have homologues of all of the elements of a functional pheromone response pathway involved in mating in S. cerevisiae but lacks many homologues of S. cerevisiae genes for meiosis. Other meiotic gene homologues in organisms ranging from filamentous fungi to Drosophila melanogaster and Caenorhabditis elegans were also found in the C. albicans genome, suggesting potential alternative mechanisms of genetic exchange.

Complete genomic sequence of Pasteurella multocida,Pm70

We present here the complete genome sequence of a common avian clone of Pasteurella multocida, Pm70. The genome of Pm70 is a single circular chromosome 2,257,487 base pairs in length and contains 2,014 predicted coding regions, 6 ribosomal RNA operons, and 57 tRNAs. Genome-scale evolutionary analyses based on pairwise comparisons of 1,197 orthologous sequences between P. multocida, Haemophilus influenzae, and Escherichia coli suggest that P. multocida and H. influenzae diverged ≈270 million years ago and the γ subdivision of the proteobacteria radiated about 680 million years ago. Two previously undescribed open reading frames, accounting for ≈1% of the genome, encode large proteins with homology to the virulence-associated filamentous hemagglutinin of Bordetella pertussis. Consistent with the critical role of iron in the survival of many microbial pathogens, in silico and whole-genome microarray analyses identified more than 50 Pm70 genes with a potential role in iron acquisition and metabolism. Overall, the complete genomic sequence and preliminary functional analyses provide a foundation for future research into the mechanisms of pathogenesis and host specificity of this important multispecies pathogen.