Secu[n]da pars Veteris testamenti Hebraico Grecoq[ue] idiomate nunc primum impressa : adiuncta vtriq[ue] sua latina interpretatione.

Pie de imp. consta en el colofón del v. IV

Tertia pars Veteris testamenti Hebraico Grecoq[ue] idiomate nunc primum impressa : adiuncta vtriq[ue] sua latina interpretatione.

Pie de imp. consta en el colofón del v. IV

Quarta pars Veteris testamenti Hebraico Grecoq[ue] idiomate nunc primum impressa : adiuncta vtriq[ue] sua latina interpretatione.

Marca tip. en G4r (Vindel, 28)

Nouum testamentum grece [et] latine in academia complutensi nouiter impressum : qu[a]e vero sigillatim [et] per ordinem in toto ope[re] contine[n]tur, hic studiose lector oculis tuis subiiciuntur ...

Marca tip. en 2M7v (Vindel, 29)

Vocabularium hebraicum atq[ue] chaldaicu[m] totius veteris testamenti cu[m] aliis tractatibus prout infra in prefatione continetur in academia complutensi nouiter impressum.

Marca tip. en 2F4r (Vindel, 28)

Aedicio secunda commentariorum & quaestionum in quinque voces Porphyrij / Autore Gasparo Cardillo Villalpandeo ...

Sign.: A4, B-N8, O6

Commentarius in librum Perihermaenias Aristotelis cui adiectae sunt quaestiones illae quae ad explanandam, vberius eius sententiam conducere videntur / autore Gasparo Cardillo Villalpa[n]deo ...

Sign.: A2, B-L4

De architectura : diuidido en diez libros / M. Vitruuio Pollion ; traduzidos de Latin en Castellano por Miguel de Vrrea architecto y sacado en su perfectio[n] por Iuan Gracian impressor vezino de Alcala ...

Hojas imp. por ambas caras

Tratado de re militari : tratado de caualleria hecho a manera de dialogo ... entre ... Don Gonçalo Fernandez de Cordoua ... y Don Pedro Ma[n]riq[ue] de Lara ...

Autor tomado de Juan Catalina García

Metaheuristic approaches for MWT and MWPT problems

It is known that the Minimum Weight Triangulation problem is NP-hard. Also the complexity of the Minimum Weight Pseudo-Triangulation problem is unknown, yet it is suspected to be also NP-hard. Therefore we focused on the development of approximate algorithms to find high quality triangulations and pseudo-triangulations of minimum weight. In this work we propose two metaheuristics to solve these problems: Ant Colony Optimization (ACO) and Simulated Annealing (SA). For the experimental study we have created a set of instances for MWT and MWPT problems, since no reference to benchmarks for these problems were found in the literature. Through experimental evaluation, we assess the applicability of the ACO and SA metaheuristics for MWT and MWPT problems. These results are compared with those obtained from the application of deterministic algorithms for the same problems (Delaunay Triangulation for MWT and a Greedy algorithm respectively for MWT and MWPT).

Solving the minimum vertex floodlight problem with hybrid metaheuristics

In this paper we propose four approximation algorithms (metaheuristic based), for the Minimum Vertex Floodlight Set problem. Urrutia et al. [9] solved the combinatorial problem, although it is strongly believed that the algorithmic problem is NP-hard. We conclude that, on average, the minimum number of vertex floodlights needed to illuminate a orthogonal polygon with n vertices is n/4,29.

Connecting red cells in a bichromatic Voronoi diagram

Let S be a set of n + m sites, of which n are red and have weight wR, and m are blue and weigh wB. The objective of this paper is to calculate the minimum value of wR such that the union of the red Voronoi cells in the weighted Voronoi diagram of S is a connected set. The problem is solved for the multiplicatively-weighted Voronoi diagram in O((n+m)^2 log(nm)) time and for the additively-weighted Voronoi diagram in O(nmlog(nm)) time.

Improving shortest paths in the Delaunay triangulation

We study a problem about shortest paths in Delaunay triangulations. Given two nodes s; t in the Delaunay triangulation of a point set P, we look for a new point p that can be added, such that the shortest path from s to t in the Delaunay triangulation of P u{p} improves as much as possible. We study properties of the problem and give efficient algorithms to find such a point when the graph-distance used is Euclidean and for the link-distance. Several other variations of the problem are also discussed.

Aplicación de técnicas de inteligencia de negocio al seguimiento del aprendizaje en MERLÍN

Este artículo propone la aplicación de técnicas de inteligencia de negocio para el seguimiento de alumnos en la plataforma educativa MERLIN, basada en portlets. Se hace una revisión de las funcionalidades de seguimiento existentes en las plataformas de e-learning más populares y se propone un módulo de seguimiento integrado basado en código abierto. Este módulo desarrolla un panel de control del estudiante que permite analizar su progreso desde diferentes perspectivas, que se componen con tecnología de portlets.

Aplicación de tecnologías de la web semántica para la catalogación de contenidos musicales

El siguiente artículo describe el proceso de aplicación de tecnologías de la Web semántica para el enriquecimiento de una biblioteca de contenidos musicales, en el contexto del proyecto Semusici. El propósito del proyecto Semusici es investigar como las tecnologías de la Web semántica pueden ser aplicadas a bibliotecas digitales y como esto puede mejorar la búsqueda y la accesibilidad. Este proyecto parte de los resultados del proyecto de eContent Harmos, que definía una taxonomía musical para la catalogación de clases magistrales, y propone una metodología para la conversión de esta taxonomía en una ontología y la migración de los contenidos de Harmos.