<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="https://hdl.handle.net/11000/459">
    <title>DSpace Colección :</title>
    <link>https://hdl.handle.net/11000/459</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="https://hdl.handle.net/11000/39038" />
        <rdf:li rdf:resource="https://hdl.handle.net/11000/39037" />
        <rdf:li rdf:resource="https://hdl.handle.net/11000/39036" />
        <rdf:li rdf:resource="https://hdl.handle.net/11000/39035" />
        <rdf:li rdf:resource="https://hdl.handle.net/11000/39034" />
        <rdf:li rdf:resource="https://hdl.handle.net/11000/39033" />
        <rdf:li rdf:resource="https://hdl.handle.net/11000/39032" />
        <rdf:li rdf:resource="https://hdl.handle.net/11000/39031" />
        <rdf:li rdf:resource="https://hdl.handle.net/11000/39020" />
        <rdf:li rdf:resource="https://hdl.handle.net/11000/39019" />
      </rdf:Seq>
    </items>
    <dc:date>2026-04-05T13:31:25Z</dc:date>
  </channel>
  <item rdf:about="https://hdl.handle.net/11000/39038">
    <title>Comparing the behaviour of basic linear algebra routines on multicore platforms</title>
    <link>https://hdl.handle.net/11000/39038</link>
    <description>Título : Comparing the behaviour of basic linear algebra routines on multicore platforms
Autor : Cuenca, Javier; García, Luis P.; Giménez, Domingo; Quesada-Martínez, Manuel
Resumen : The use of an OpenMP compiler optimized for a multicore system could contribute&#xD;
to obtain programs with satisfactory execution time, but it is possible to have access in a&#xD;
system to more than one compiler, and different compilers optimize different parts of the&#xD;
code at different levels. In this paper, the influence of the compiler used on the performance&#xD;
of linear algebra routines is studied. From the results of the experiments carried&#xD;
out, we conclude a poly-compiling approach is necessary to decide automatically the best&#xD;
compiler.</description>
    <dc:date>2026-01-27T12:55:55Z</dc:date>
  </item>
  <item rdf:about="https://hdl.handle.net/11000/39037">
    <title>Modelado y autooptimización en esquemas paralelos de backtracking</title>
    <link>https://hdl.handle.net/11000/39037</link>
    <description>Título : Modelado y autooptimización en esquemas paralelos de backtracking
Autor : Quesada-Martínez, Manuel; Giménez, Domingo
Resumen : En este trabajo se estudia el modelado&#xD;
del tiempo de ejecuci´on de esquemas paralelos de backtracking.&#xD;
Se estudian diferentes esquemas de programaci&#xD;
´on identificando par´ametros que influyen en el&#xD;
tiempo de ejecuci´on. Se propone una metodolog´ıa&#xD;
de optimizaci´on basada en la selecci´on autom´atica de&#xD;
par´ametros para obtener ejecuciones con un tiempo&#xD;
reducido. Se estudian las propiedades que deber´ıa&#xD;
tener un esquema algor´ıtmico secuencial de backtracking&#xD;
para poder realizar internamente la paralelizaci´on.&#xD;
De esta manera se pretende abstraer a los usuarios&#xD;
finales de las complejidades de la programaci´on paralela.</description>
    <dc:date>2026-01-27T12:53:34Z</dc:date>
  </item>
  <item rdf:about="https://hdl.handle.net/11000/39036">
    <title>Analysis of the Influence of the Compiler on Multicore Performance</title>
    <link>https://hdl.handle.net/11000/39036</link>
    <description>Título : Analysis of the Influence of the Compiler on Multicore Performance
Autor : Cuenca, Javier; García, Luis P; Giménez, Domingo; Quesada-Martínez, Manuel
Resumen : The possibility of connecting several nodes in a&#xD;
network of processors has popularized parallel programming&#xD;
in the scientific community, but its use has been limited by the&#xD;
difficulty of message-passing programming. With the arrival&#xD;
of multicore processors, parallel programming has regained&#xD;
popularity. The use of an OpenMP compiler optimized for&#xD;
the multicore system in question is a good option, but it is&#xD;
possible to have access in a system to more than one compiler&#xD;
and different compilers can appropriately optimize different&#xD;
parts of the code. In this paper we study theoretically and&#xD;
experimentally the influence of the compiler on performance&#xD;
of routines. We conclude that a poly-compiling approach that&#xD;
decides the best compiler for each situation is necessary.</description>
    <dc:date>2026-01-27T12:52:56Z</dc:date>
  </item>
  <item rdf:about="https://hdl.handle.net/11000/39035">
    <title>OBANSoft: integrated software for Bayesian statistics and high performance computing with R</title>
    <link>https://hdl.handle.net/11000/39035</link>
    <description>Título : OBANSoft: integrated software for Bayesian statistics and high performance computing with R
Autor : Quesada-Martínez, Manuel; Giménez, Domingo; Martínez, Asunción
Resumen : Among all the applications for Bayesian analysis, there is none that integrates the whole process of Objective&#xD;
Bayesian Analysis. The aim of the “Software for Objective Bayesian Analysis” (OBANSoft) is to cover this&#xD;
gap. The first version includes the easiest models (Yang and Berger (1996)) but its design will allow for&#xD;
more complex algorithms in time.&#xD;
The statistics engine has been implemented using R. Implementing the algorithms with this language lets&#xD;
us take advantage of the increasing number of new routines that the R community is developing, so we can&#xD;
focus the effort on other purposes such as high performance computing. For this reason, OBANSoft has been&#xD;
designed taking into account that it is going to incorporate a variety of parallelism levels, and it will be the&#xD;
first R parallel in a shared memory architecture. Moreover, the heterogeneity of parallel architectures will&#xD;
obstruct non advance users in parallelism optimizing the performance of their programs without the help&#xD;
of an expert. Concerning parallel performance, OBANSoft is ready to include an auto tuning module that&#xD;
configures the best parameters to execute the parallel algorithms (Katagiri et al. (2004)).&#xD;
Although the statistics engine is developed in R, this is envolved in a top layer defined like a Java interface&#xD;
(using JRI to link them). This main layer coordinates the lower layers where the different engines based on&#xD;
several architectures are implemented. Indeed, this top layer will implement the auto-tuning algorithms. The&#xD;
final user will only use a desktop application that will solve a problem in the most efficient way for each&#xD;
platform.&#xD;
The first version is a complete and integrated Java Desktop Application (OBANSoft) implementing the&#xD;
first models used to teach Bayesian analysis (Quesada (2010)). All the models are implemented using R&#xD;
libraries that have been reorganized to compose our R engine. The SnowFall library (SnowFall (2011))&#xD;
allows exploitation of parallelism in multicore systems. However, the performance of this library is not&#xD;
satisfactory enough and other parallelism strategies need to be considered.&#xD;
In conclusion, we have developed the base application where we are going to include more complex models&#xD;
with higher computational needs. Our concern is to implement and link the R engine with other parallel&#xD;
languages and high performance libraries (BLAS, OpenMP, MPI, CUDA, etc.). OBANSoft will assume all&#xD;
those new routines, including auto-tuning decisions. Our goal is to distance the final user from the problems&#xD;
of parallel computation.</description>
    <dc:date>2026-01-27T12:51:28Z</dc:date>
  </item>
  <item rdf:about="https://hdl.handle.net/11000/39034">
    <title>Enrichment of OWL Ontologies: a method for defining axioms from labels</title>
    <link>https://hdl.handle.net/11000/39034</link>
    <description>Título : Enrichment of OWL Ontologies: a method for defining axioms from labels
Autor : Quesada-Martínez, Manuel; Fernández-Breis, Jesualdo Tomás; Stevens, Robert
Resumen : An increasing interest has provoked the development of a&#xD;
significant number of ontologies, and many more are expected to be produced&#xD;
in the next years. A significant proportion of such ontologies have&#xD;
not been created by computer scientists or ontology engineers, but by&#xD;
domain experts. Many of such ontologies are rich in implicit knowledge,&#xD;
but are really basic taxonomies and controlled vocabularies, with little&#xD;
axiomatization. Many such ontologies have much information within the&#xD;
labels of the classes. There is a great deal of knowledge about the entities&#xD;
described within such labels and text definitions held on classes; these&#xD;
are useful for human users, but not for machine processing. In previous&#xD;
work we proposed a process for enriching ontologies which included the&#xD;
analysis of such labels, the identification of linguistic patterns and the&#xD;
design of knowledge patterns from them. However, such processes relied&#xD;
on manual intervention. In this paper we present a method and tool to&#xD;
guide the process of including axiomatisation in ontologies through the&#xD;
study of labels. This method guides domain experts in the definition of&#xD;
OWL axioms. The first step is the identification of linguistic patterns&#xD;
based on repetitions of sets of words. Second, the expert is provided&#xD;
with such patterns and recommendations about the existence of classes&#xD;
and properties in such labels by reusing existing ontologies. Third, the&#xD;
user is guided in the process of defining knowledge patterns that would&#xD;
code both the axioms to be added in the ontology and the classes that&#xD;
would be affected. Such axioms would also re-use existing ontologies.&#xD;
Such knowledge patterns are coded and executed using the Ontology&#xD;
Pre-Processor Language (OPPL), but our tool permits their definition&#xD;
without advanced knowledge of OPPL. Finally, we describe the application&#xD;
of the method and tool to the Molecular Function ontology of the&#xD;
Gene Ontology.</description>
    <dc:date>2026-01-27T12:50:53Z</dc:date>
  </item>
  <item rdf:about="https://hdl.handle.net/11000/39033">
    <title>Extraction and Analysis of the Structure of Labels in Biomedical Ontologies</title>
    <link>https://hdl.handle.net/11000/39033</link>
    <description>Título : Extraction and Analysis of the Structure of Labels in Biomedical Ontologies
Autor : Quesada-Martínez, Manuel; Fernández-Breis, Jesualdo Tomás; Stevens, Robert
Resumen : The increasing interest in biomedical ontologies has provoked&#xD;
the development of a significant number of ontologies,&#xD;
and many more are expected to be produced in the near future.&#xD;
A significant proportion of such ontologies have not&#xD;
been created by computer scientists or ontology engineers,&#xD;
but by domain experts. Many such ontologies are rich in&#xD;
implicit knowledge, but are really just plain taxonomies and&#xD;
controlled vocabularies, with little axiomatization.&#xD;
Many of these ontologies have much information within&#xD;
the labels of the classes. There is a great deal of knowledge&#xD;
about the entities described within such labels and text definitions&#xD;
held on classes; these are useful for human users, but&#xD;
not for machine processing. In previous work we proposed a&#xD;
process for enriching ontologies, which included the analysis&#xD;
of such labels, the identification of lexical patterns and the&#xD;
design of corresponding knowledge patterns. However, this&#xD;
process relied on manual intervention.&#xD;
In this paper we present a method to analyze and extract&#xD;
unused information contained in the structure of the&#xD;
labels in biomedical ontologies. The aim of this method is to&#xD;
improve the source ontology. The first step is the identification&#xD;
of lexical patterns based on repetitions of sets of words.&#xD;
Second, such lexical patterns will be examined in existing&#xD;
biomedical ontologies to identify whether those patterns are&#xD;
referencing existing ontological entities. Finally, the results&#xD;
obtained with relevant biomedical ontologies are presented&#xD;
and discussed.</description>
    <dc:date>2026-01-27T12:50:18Z</dc:date>
  </item>
  <item rdf:about="https://hdl.handle.net/11000/39032">
    <title>Analysis and Classification of Bio-ontologies by the Structure of their Labels</title>
    <link>https://hdl.handle.net/11000/39032</link>
    <description>Título : Analysis and Classification of Bio-ontologies by the Structure of their Labels
Autor : Quesada-Martínez, Manuel; Fernández-Breis, Jesualdo Tomás; Stevens, Robert
Resumen : The development and success of the Gene Ontology were key factors for attracting the interest of biomedical researchers and bioinformaticists to ontologies. In recent years, hundreds of biomedical ontologies have been produced, most of them developed in collaborative e orts and following a set of construction principles, including the use of a systematic naming convention and using descriptive labels. Such ontologies have been mainly used for supporting the annotation process, but more sophisticated uses would require such ontologies to have more axioms. In recent works, we have found that exploiting the structure of the labels could contribute to that axiomatic enrichment. Hence, in this work we perform a study of the labels of the ontologies available in BioPortal to classify them in terms of potential interest for their axiomatic enrichment.</description>
    <dc:date>2026-01-27T12:49:37Z</dc:date>
  </item>
  <item rdf:about="https://hdl.handle.net/11000/39031">
    <title>Lexical Characterization and Analysis of the BioPortal Ontologies</title>
    <link>https://hdl.handle.net/11000/39031</link>
    <description>Título : Lexical Characterization and Analysis of the BioPortal Ontologies
Autor : Quesada-Martínez, Manuel; Fernández-Breis, Jesualdo Tomás; Stevens, Robert
Resumen : The increasing interest of the biomedical community in ontologies&#xD;
can be exemplified by the availability of hundreds of biomedical&#xD;
ontologies and controlled vocabularies, and by the international recommendations&#xD;
and efforts that suggest ontologies should play a critical role&#xD;
in the achievement of semantic interoperability in healthcare. However,&#xD;
many of the available biomedical ontologies are rich in human understandable&#xD;
labels, but are less rich in machine processable axioms, so their&#xD;
effectiveness for supporting advanced data analysis processes is limited.&#xD;
In this context, developing methods for analysing the labels and deriving&#xD;
axioms from them would contribute to make biomedical ontologies&#xD;
more useful. In fact, our recent work revealed that exploiting the regularities&#xD;
and structure of the labels could contribute to that axiomatic&#xD;
enrichment.&#xD;
In this paper, we present an approach for analysing and characterising&#xD;
biomedical ontologies from a lexical perspective, that is, by analysing the&#xD;
structure and content of the labels. This study has several goals: (1) characterization&#xD;
of the ontologies by the patterns found in their labels; (2)&#xD;
identifying which ones would be more appropriate for applying enrichment&#xD;
processes based on the labels; (3) inspecting how ontology re-use&#xD;
is being addressed for patterns found in more than one ontology.&#xD;
Our analysis method has been applied to BioPortal, which is likely&#xD;
to be the most popular repository of biomedical ontologies, containing&#xD;
more than two hundred resources. We have found that there is a high&#xD;
redundancy in the labels of the ontologies; it would be interesting to&#xD;
exploit the content and structure of the labels of many of them and that&#xD;
it seems that re-use is not always performed as it should be.
Notas: Serie: Lecture Notes in Artificial Intelligence (LNAI) - 7885</description>
    <dc:date>2026-01-27T12:49:01Z</dc:date>
  </item>
  <item rdf:about="https://hdl.handle.net/11000/39020">
    <title>OntoEnrich: A Platform for the Lexical Analysis of Ontologies</title>
    <link>https://hdl.handle.net/11000/39020</link>
    <description>Título : OntoEnrich: A Platform for the Lexical Analysis of Ontologies
Autor : Quesada-Martínez, Manuel; Fernández-Breis, Jesualdo Tomás; Stevens, Robert; Aussenac-Guilles, Nathalie
Resumen : The content of the labels in ontologies is usually considered&#xD;
hidden semantics, because the domain knowledge of such labels is not&#xD;
available as logical axioms in the ontology. The use of systematic naming&#xD;
conventions as best practice for the design of the content of the labels generates&#xD;
labels with structural regularities, namely, lexical regularities. The&#xD;
structure and content of such regularities can help ontology engineers to&#xD;
increase the amount of machine-friendly content in ontologies, that is, to&#xD;
increase the number of logical axioms.&#xD;
In this paper we present a web platform based on the OntoEnrich&#xD;
framework, which detects and analyzes lexical regularities, providing a&#xD;
series of useful insights about the structure and content of the labels,&#xD;
which can be helpful for the study of the engineering of the ontologies&#xD;
and their axiomatic enrichment. Here, we describe its software architecture,&#xD;
and how it can be used for analyzing the labels of ontologies, which&#xD;
will be illustrated with some examples from our research studies.
Notas: Lecture Notes in Artificial Intelligence (LNAI) - 8982</description>
    <dc:date>2026-01-26T11:33:25Z</dc:date>
  </item>
  <item rdf:about="https://hdl.handle.net/11000/39019">
    <title>A Quality Assurance Workflow for Ontologies Based on Semantic Regularities</title>
    <link>https://hdl.handle.net/11000/39019</link>
    <description>Título : A Quality Assurance Workflow for Ontologies Based on Semantic Regularities
Autor : Mikroyannidi, Eleni; Quesada-Martínez, Manuel; Tsarkov, Dmitry; Fernández-Breis, Jesualdo Tomás; Stevens, Robert; Palmisano, Ignazio
Resumen : Syntactic regularities or syntactic patterns are sets of axioms&#xD;
in an OWL ontology with a regular structure. Detecting these patterns&#xD;
and reporting them in human readable form should help the understanding&#xD;
the authoring style of an ontology and is therefore useful in itself.&#xD;
However, pattern detection is sensitive to syntactic variations in the assertions;&#xD;
axioms that are semantically equivalent but syntactically different&#xD;
can reduce the effectiveness of the technique. Semantic regularity&#xD;
analysis focuses on the knowledge encoded in the ontology, rather than&#xD;
how it is spelled out, which is the focus of syntactic regularity analysis.&#xD;
Cluster analysis of the information provided by an OWL DL reasoner&#xD;
mitigates this sensitivity, providing measurable benefits over purely syntactic&#xD;
patterns - an example being patterns that are instantiated only&#xD;
in the entailments of an ontology. In this paper, we demonstrate, using&#xD;
SNOMED-CT, how the detection of semantic regularities in entailed&#xD;
axioms can be used in ontology quality assurance, in combination with&#xD;
lexical techniques. We also show how the detection of irregularities, i.e.,&#xD;
deviations from a pattern, are useful for the same purpose. We evaluate&#xD;
and discuss the results of performing a semantic pattern inspection and&#xD;
we compare them against existing work on syntactic regularity detection.&#xD;
Systematic extraction of lexical, syntactic and semantic patterns is&#xD;
used and a quality assurance workflow that combines these patterns is&#xD;
presented.</description>
    <dc:date>2026-01-26T11:32:24Z</dc:date>
  </item>
</rdf:RDF>

