Towards Understanding Reasoning Complexity in Practice

Although the computational complexity of the logic underlying the standard OWL 2 for the Web Ontology Language (OWL) appears discouraging for real applications, several contributions have shown that reasoning with OWL ontologies is feasible in practice. It turns out that reasoning in practice is often far less complex than is suggested by the established theoretical complexity bound, which reflects the worstcase scenario. State-of-the reasoners like FACT++, HERMIT, PELLET and RACER have demonstrated that, even with fairly expressive fragments of OWL 2, acceptable performances can be achieved. However, it is still not well understood why reasoning is feasible in practice and it is rather unclear how to study this problem. In this paper, we suggest first steps that in our opinion could lead to a better understanding of practical complexity. We also provide and discuss some initial empirical results with HERMIT on prominent ontologies

The late Miocene macroflora of the La Cerdaña Basin, Eastern Pirenees, Spain. Towards a Synthesis

The fossil plant-bearing beds of the Tortonian (late Miocene) intramontane basin of La Cerdanya (Eastern Pyrenees, Catalonia, Spain) have been investigated for more than a century, and 165 species from 12 outcrops have been described in previous publications. The sediments with rich plant fossil assemblages, which correspond to lacustrine diatomitic deposits, contain large numbers of plant remains, mainly leaf compressions and impressions. These assemblages are well preserved, a consequence of the rapid accumulation of plant remains in the sediments of the basin's ancient lake, and the often close proximity of its shores to wetland and upland vegetation. This paper provides a comprehensive taxonomic and nomenclatural review of the historic and new collections of late Miocene macroflora for the La Cerdanya Basin. Examination of the newer materials allowed emendments to be made to the diagnoses ofAbies saportana, Acer pyrenakum,Alnus occidentalis, Quercus hispanka and Tilia vidali provided by REROLLE for the basin at the end of the 19th century. In addition, 24 species of vascular plants are identified for the basin for the first time, including one horsetail, three conifers, 19 arboreal or bushy dicotyledonous angiosperms, and one monocotyledonous angiosperm. Indeed, this is the first time that Cedrela helkonia (UNGER) KNOBLOCH, Decodon sp„ Hedera cf multinervis KOLAKOVSKII, Mahonia cf pseudosimplex KVACEK & WALTHER, Smilax cf. aspera L. vm.fossilis and Ulmus cf. plurinervia UNGER have been recorded anywhere in the Iberian Peninsula. The La Cerdanya Basin plant assemblages of the late Miocene mainly consisted of conifers and deciduous broadleaved taxa of Arctotertiary origin; evergreen Palaeotropical elements were less well represented. This flora is similar to those recorded at coeval sites in northern Greece, northern Italy and central and eastern France. Within the Iberian Peninsula, the late Miocene macroflora reported for the nearby Seu d'Urgell Basin is the most similar.

Fast modularisation and aomic decomposition of ontologies using axiom dependency hypergraphs

In this paper we define the notion of an axiom dependency hypergraph, which explicitly represents how axioms are included into a module by the algorithm for computing locality-based modules. A locality-based module of an ontology corresponds to a set of connected nodes in the hypergraph, and atoms of an ontology to strongly connected components. Collapsing the strongly connected components into single nodes yields a condensed hypergraph that comprises a representation of the atomic decomposition of the ontology. To speed up the condensation of the hypergraph, we first reduce its size by collapsing the strongly connected components of its graph fragment employing a linear time graph algorithm. This approach helps to significantly reduce the time needed for computing the atomic decomposition of an ontology. We provide an experimental evaluation for computing the atomic decomposition of large biomedical ontologies. We also demonstrate a significant improvement in the time needed to extract locality-based modules from an axiom dependency hypergraph and its condensed version.

Strong Connectivity in Directed Hypergraphs and its Application to the Atomic Decomposition of Ontologies

Los hipergrafos dirigidos se han empleado en problemas relacionados con lógica proposicional, bases de datos relacionales, linguística computacional y aprendizaje automático. Los hipergrafos dirigidos han sido también utilizados como alternativa a los grafos (bipartitos) dirigidos para facilitar el estudio de las interacciones entre componentes de sistemas complejos que no pueden ser fácilmente modelados usando exclusivamente relaciones binarias. En este contexto, este tipo de representación es conocida como hiper-redes. Un hipergrafo dirigido es una generalización de un grafo dirigido especialmente adecuado para la representación de relaciones de muchos a muchos. Mientras que una arista en un grafo dirigido define una relación entre dos de sus nodos, una hiperarista en un hipergrafo dirigido define una relación entre dos conjuntos de sus nodos. La conexión fuerte es una relación de equivalencia que divide el conjunto de nodos de un hipergrafo dirigido en particiones y cada partición define una clase de equivalencia conocida como componente fuertemente conexo. El estudio de los componentes fuertemente conexos de un hipergrafo dirigido puede ayudar a conseguir una mejor comprensión de la estructura de este tipo de hipergrafos cuando su tamaño es considerable. En el caso de grafo dirigidos, existen algoritmos muy eficientes para el cálculo de los componentes fuertemente conexos en grafos de gran tamaño. Gracias a estos algoritmos, se ha podido averiguar que la estructura de la WWW tiene forma de “pajarita”, donde más del 70% del los nodos están distribuidos en tres grandes conjuntos y uno de ellos es un componente fuertemente conexo. Este tipo de estructura ha sido también observada en redes complejas en otras áreas como la biología. Estudios de naturaleza similar no han podido ser realizados en hipergrafos dirigidos porque no existe algoritmos capaces de calcular los componentes fuertemente conexos de este tipo de hipergrafos. En esta tesis doctoral, hemos investigado como calcular los componentes fuertemente conexos de un hipergrafo dirigido. En concreto, hemos desarrollado dos algoritmos para este problema y hemos determinado que son correctos y cuál es su complejidad computacional. Ambos algoritmos han sido evaluados empíricamente para comparar sus tiempos de ejecución. Para la evaluación, hemos producido una selección de hipergrafos dirigidos generados de forma aleatoria inspirados en modelos muy conocidos de grafos aleatorios como Erdos-Renyi, Newman-Watts-Strogatz and Barabasi-Albert. Varias optimizaciones para ambos algoritmos han sido implementadas y analizadas en la tesis. En concreto, colapsar los componentes fuertemente conexos del grafo dirigido que se puede construir eliminando ciertas hiperaristas complejas del hipergrafo dirigido original, mejora notablemente los tiempos de ejecucion de los algoritmos para varios de los hipergrafos utilizados en la evaluación. Aparte de los ejemplos de aplicación mencionados anteriormente, los hipergrafos dirigidos han sido también empleados en el área de representación de conocimiento. En concreto, este tipo de hipergrafos se han usado para el cálculo de módulos de ontologías. Una ontología puede ser definida como un conjunto de axiomas que especifican formalmente un conjunto de símbolos y sus relaciones, mientras que un modulo puede ser entendido como un subconjunto de axiomas de la ontología que recoge todo el conocimiento que almacena la ontología sobre un conjunto especifico de símbolos y sus relaciones. En la tesis nos hemos centrado solamente en módulos que han sido calculados usando la técnica de localidad sintáctica. Debido a que las ontologías pueden ser muy grandes, el cálculo de módulos puede facilitar las tareas de re-utilización y mantenimiento de dichas ontologías. Sin embargo, analizar todos los posibles módulos de una ontología es, en general, muy costoso porque el numero de módulos crece de forma exponencial con respecto al número de símbolos y de axiomas de la ontología. Afortunadamente, los axiomas de una ontología pueden ser divididos en particiones conocidas como átomos. Cada átomo representa un conjunto máximo de axiomas que siempre aparecen juntos en un modulo. La decomposición atómica de una ontología es definida como un grafo dirigido de tal forma que cada nodo del grafo corresponde con un átomo y cada arista define una dependencia entre una pareja de átomos. En esta tesis introducimos el concepto de“axiom dependency hypergraph” que generaliza el concepto de descomposición atómica de una ontología. Un modulo en una ontología correspondería con un componente conexo en este tipo de hipergrafos y un átomo de una ontología con un componente fuertemente conexo. Hemos adaptado la implementación de nuestros algoritmos para que funcionen también con axiom dependency hypergraphs y poder de esa forma calcular los átomos de una ontología. Para demostrar la viabilidad de esta idea, hemos incorporado nuestros algoritmos en una aplicación que hemos desarrollado para la extracción de módulos y la descomposición atómica de ontologías. A la aplicación la hemos llamado HyS y hemos estudiado sus tiempos de ejecución usando una selección de ontologías muy conocidas del área biomédica, la mayoría disponibles en el portal de Internet NCBO. Los resultados de la evaluación muestran que los tiempos de ejecución de HyS son mucho mejores que las aplicaciones más rápidas conocidas. ABSTRACT Directed hypergraphs are an intuitive modelling formalism that have been used in problems related to propositional logic, relational databases, computational linguistic and machine learning. Directed hypergraphs are also presented as an alternative to directed (bipartite) graphs to facilitate the study of the interactions between components of complex systems that cannot naturally be modelled as binary relations. In this context, they are known as hyper-networks. A directed hypergraph is a generalization of a directed graph suitable for representing many-to-many relationships. While an edge in a directed graph defines a relation between two nodes of the graph, a hyperedge in a directed hypergraph defines a relation between two sets of nodes. Strong-connectivity is an equivalence relation that induces a partition of the set of nodes of a directed hypergraph into strongly-connected components. These components can be collapsed into single nodes. As result, the size of the original hypergraph can significantly be reduced if the strongly-connected components have many nodes. This approach might contribute to better understand how the nodes of a hypergraph are connected, in particular when the hypergraphs are large. In the case of directed graphs, there are efficient algorithms that can be used to compute the strongly-connected components of large graphs. For instance, it has been shown that the macroscopic structure of the World Wide Web can be represented as a “bow-tie” diagram where more than 70% of the nodes are distributed into three large sets and one of these sets is a large strongly-connected component. This particular structure has been also observed in complex networks in other fields such as, e.g., biology. Similar studies cannot be conducted in a directed hypergraph because there does not exist any algorithm for computing the strongly-connected components of the hypergraph. In this thesis, we investigate ways to compute the strongly-connected components of directed hypergraphs. We present two new algorithms and we show their correctness and computational complexity. One of these algorithms is inspired by Tarjan’s algorithm for directed graphs. The second algorithm follows a simple approach to compute the stronglyconnected components. This approach is based on the fact that two nodes of a graph that are strongly-connected can also reach the same nodes. In other words, the connected component of each node is the same. Both algorithms are empirically evaluated to compare their performances. To this end, we have produced a selection of random directed hypergraphs inspired by existent and well-known random graphs models like Erd˝os-Renyi and Newman-Watts-Strogatz. Besides the application examples that we mentioned earlier, directed hypergraphs have also been employed in the field of knowledge representation. In particular, they have been used to compute the modules of an ontology. An ontology is defined as a collection of axioms that provides a formal specification of a set of terms and their relationships; and a module is a subset of an ontology that completely captures the meaning of certain terms as defined in the ontology. In particular, we focus on the modules computed using the notion of syntactic locality. As ontologies can be very large, the computation of modules facilitates the reuse and maintenance of these ontologies. Analysing all modules of an ontology, however, is in general not feasible as the number of modules grows exponentially in the number of terms and axioms of the ontology. Nevertheless, the modules can succinctly be represented using the Atomic Decomposition of an ontology. Using this representation, an ontology can be partitioned into atoms, which are maximal sets of axioms that co-occur in every module. The Atomic Decomposition is then defined as a directed graph such that each node correspond to an atom and each edge represents a dependency relation between two atoms. In this thesis, we introduce the notion of an axiom dependency hypergraph which is a generalization of the atomic decomposition of an ontology. A module in the ontology corresponds to a connected component in the hypergraph, and the atoms of the ontology to the strongly-connected components. We apply our algorithms for directed hypergraphs to axiom dependency hypergraphs and in this manner, we compute the atoms of an ontology. To demonstrate the viability of this approach, we have implemented the algorithms in the application HyS which computes the modules of ontologies and calculate their atomic decomposition. In the thesis, we provide an experimental evaluation of HyS with a selection of large and prominent biomedical ontologies, most of which are available in the NCBO Bioportal. HyS outperforms state-of-the-art implementations in the tasks of extracting modules and computing the atomic decomposition of these ontologies.

BALAÃO – O QUE OUVE AS PALAVRAS DE EL, TEM O CONHECIMENTO DE ELYON E VÊ A VISÃO DE SHADDAI: UM ESTUDO DE NÚMEROS 22-24

A presente pesquisa busca avaliar exegeticamente o texto que se encontra na Bíblia, especificamente no livro de Números capítulos 22-24 que relata sobre um personagem conhecido como Balaão. A pesquisa tem também como objeto o estudo sobre o panteão de divindades relatado no mesmo texto, assim como também o estudo dos textos descobertos em Deir Alla, na Jordânia, que apresentam um personagem designado como Balaão, possivelmente o mesmo personagem de Nm 22-24. A motivação que levou ao desenvolvimento dessa pesquisa foi o fato de se ter deparado com os conceitos dos diversos nomes divinos exibidos no texto, além da questão do profetismo fora de Israel, assim como as possibilidades hermenêuticas que se abrem para a leitura desse texto bíblico. O conceito geral sempre foi o de que Israel era a única nação onde existiam “verdadeiros” profetas e uma adoração a um único Deus, o “monoteísmo”. O que despertou interesse foi perceber, especialmente por meio da leitura dos livros bíblicos, que o profetismo não se restringiu somente a Israel. Ele antecede à formação do antigo Israel e já existia no âmbito das terras do antigo Oriente Médio, e que Israel ainda demorou muito tempo para ser monoteísta. Quem é esse Balaão, filho de Beor? Estudaremos sobre sua pessoa e sua missão. Examinaremos os textos de Deir Alla sobre Balaão e sua natureza de personagem mediador entre o divino e o humano. Esse personagem é apresentado como um grande profeta e que era famoso como intérprete de presságios divinos. Analisaremos a importante questão sobre o panteão de deuses que são apresentados na narrativa de Balaão nomeados como: El, Elyon Elohim e Shaddai, além de Yahweh. Entendemos, a princípio, que o texto possui uma conexão com a sociedade na qual foi criado e usando da metodologia exegética, faremos uma análise da narrativa em questão, buscando compreender o sentido do texto, dentro de seu cenário histórico e social. Cenário este, que nos apresentou esse profeta, não israelita, que profere bênçãos dos deuses sobre Israel e que, além disso, pronuncia maldições sobre os inimigos desse mesmo Israel. Percebemos que, parte do texto pesquisado é apresentado sob a ótica de Israel sobre as outras nações. A pesquisa defende, portanto, que o texto de Nm 22-24, além de nos apresentar um profeta fora de Israel igual aos profetas da Bíblia, defende que, o panteão de divindades também era adorado por Israel e que tais nomes são epítetos de uma mesma divindade, no caso YHWH. Defende, também, um delineamento de um projeto de domínio político e militar de Israel sobre as nações circunvizinhas.

Conversion of cucumber linoleate 13-lipoxygenase to a 9-lipoxygenating species by site-directed mutagenesis

Multiple lipoxygenase sequence alignments and structural modeling of the enzyme/substrate interaction of the cucumber lipid body lipoxygenase suggested histidine 608 as the primary determinant of positional specificity. Replacement of this amino acid by a less-space-filling valine altered the positional specificity of this linoleate 13-lipoxygenase in favor of 9-lipoxygenation. These alterations may be explained by the fact that H608V mutation may demask the positively charged guanidino group of R758, which, in turn, may force an inverse head-to-tail orientation of the fatty acid substrate. The R758L+H608V double mutant exhibited a strongly reduced reaction rate and a random positional specificity. Trilinolein, which lacks free carboxylic groups, was oxygenated to the corresponding (13S)-hydro(pero)xy derivatives by both the wild-type enzyme and the linoleate 9-lipoxygenating H608V mutant. These data indicate the complete conversion of a linoleate 13-lipoxygenase to a 9-lipoxygenating species by a single point mutation. It is hypothesized that H608V exchange may alter the orientation of the substrate at the active site and/or its steric configuration in such a way that a stereospecific dioxygen insertion at C-9 may exclusively take place.

Characterization of human telomerase complex

Telomerase, a ribonucleoprotein complex, adds hexameric repeats called “telomeres” to the growing ends of chromosomal DNA. Characterization of mammalian telomerase has been elusive because of its low level of expression. We describe a bioinformatics approach to enrich and characterize the human telomerase complex. Using local sequence homology search methods, we detected similarity of the Tetrahymena p80 subunit of telomerase with the autoantigen Ro60. Antibodies to Ro60 immunoprecipitated the telomerase activity. Ro60 and p80 proteins were cross-recognizable by antibodies to either protein. Telomerase activity and the RNA component of telomerase complex were localized to a doublet in a native gel from the Ro60 antibody-precipitated material. The enriched material showed specific binding to a TTA GGG probe in vitro in an RNA template-dependent manner. Polyclonal antibodies to the doublet also immunoprecipitated the telomerase activity. These results suggest an evolutionary conservation of the telomerase proteins.

Identification of a prion protein epitope modulating transmission of bovine spongiform encephalopathy prions to transgenic mice

There is considerable concern that bovine prions from cattle with bovine spongiform encephalopathy (BSE) may have been passed to humans (Hu), resulting in a new form of Creutzfeldt–Jakob disease (CJD). We report here the transmission of bovine (Bo) prions to transgenic (Tg) mice expressing BoPrP; one Tg line exhibited incubation times of ≈200 days. Like most cattle with BSE, vacuolation and astrocytic gliosis were confined in the brainstems of these Tg mice. Unexpectedly, mice expressing a chimeric Bo/Mo PrP transgene were resistant to BSE prions whereas mice expressing Hu or Hu/Mo PrP transgenes were susceptible to Hu prions. A comparison of differences in Mo, Bo, and Hu residues within the C terminus of PrP defines an epitope that modulates conversion of PrPC into PrPSc and, as such, controls prion transmission across species. Development of susceptible Tg(BoPrP) mice provides a means of measuring bovine prions that may prove critical in minimizing future human exposure.

Autoimmune response to U1 small nuclear ribonucleoprotein (U1 snRNP) associated with cytomegalovirus infection

The induction of autoantibodies to U1 small nuclear ribonucleoprotein (U1 snRNP) complexes is not well understood. We present evidence that healthy individuals with cytomegalovirus (CMV) infection have an increased frequency and quantity of antibodies to ribonucleoprotein, directed primarily against the U1-70k protein. A significant association between the presence of antibodies to CMV and antibodies to the total RNP targeted by the immune response to the spliceosome (to both the Sm and RNP; Sm/RNP) was found for patients with systemic lupus erythematosus (SLE) but not those with mixed connective-tissue disease. CMV thus may play a role in inducing autoimmune responses in a subset of patients with systemic lupus erythematosus.

Gesture performance in first- and multiple-episode patients with schizophrenia spectrum disorders

BACKGROUND/AIM Gesturing plays an important role in social behavior and social learning. Deficits are frequent in schizophrenia and may contribute to impaired social functioning. Information about deficits during the course of the disease and presence of severity and patterns of impairment in first-episode patients is missing. Hence, we aimed to investigate gesturing in first- compared to multiple-episode schizophrenia patients and healthy controls. METHODS In 14 first-episode patients, 14 multiple-episode patients and 16 healthy controls matched for age, gender and education, gesturing was assessed by the comprehensive Test of Upper Limb Apraxia. Performance in two domains of gesturing - imitation and pantomime - was recorded on video. Raters of gesture performance were blinded. RESULTS Patients with multiple episodes had severe gestural deficits. For almost all gesture categories, performance was worse in multiple- than in first-episode patients. First-episode patients demonstrated subtle deficits with a comparable pattern. CONCLUSIONS Subjects with multiple psychotic episodes have severe deficits in gesturing, while only mild impairments were found in first-episode patients independent of age, gender, education and negative symptoms. The results indicate that gesturing is impaired at the onset of disease and likely to further deteriorate during its course.

Mountains of the world - Sustainable development in mountain areas: The need for adequate policies and instruments

This brochure deals with policies and policy instruments needed to promote sustainable development in mountain areas. The first part presents an overview of key issues in mountain development, and principles and strategies that should be adopted. Each principle contains a checklist for policy-makers. The second part presents national and regional case studies of successful approaches and initiatives relating to mountain policy from all over the world. The brochure concludes with a call for multi-level initiatives and partnerships. This full-colour publication is part of the Mountains of the World series. It was prepared for the 2002 World Summit on Sustainable Development in Johannesburg by an international panel of experts coordinated by CDE. It was commissioned and funded by the Swiss Agency for Development and Cooperation (SDC).