Architecture and Icon: the Origin of the Stepped Gables in the Icon ‘The Vision of the Sexton Tarasiy of Khutyn’

The article invites to look afresh at the late 16th century Novgorod icon‘The Vision of the Sexton Tarasiy of Khutyn`’ and the Faceted Palace,built in 1433 by German craftsmen. The stepped gables of the building,located west of St Sophia Cathedral in the icon, were interpreted asrealistic image of the upper parts of the Faceted Palace that havenot survived. However, the iconographic analysis of more than ahundred of the Russian icons and illuminated manuscripts datingback to the second half of the 16th – early 17th centuries proved thatthe stepped gable was a decorative architectural motive, widespreadsince the 1560s–1570s. The authors classified the images of buildingswith stepped gable in the late medieval Russian art, and determinedtheir possible sources among the Northern European prints of the15th – 16th centuries. The comprehensive study ascertained that thebuilding in the icon ‘The Vision of the Sexton Tarasiy’ can’t be used forreconstruction of the Faceted Palace. Since 1560s–1570s the schematicrepresentation of the city in Russian art often placed buildings withthe stepped gables (initially acquired from the European prints)next to the churches. Panorama of Novgorod in the Khutyn` iconfollowed this pattern and combined fantastic forms with ratherrealistic depiction of the church edifices

Search improvement within the geospatial web in the context of spatial data infrastructures

El trabajo desarrollado en esta tesis doctoral demuestra que es posible mejorar la búsqueda en el contexto de las Infraestructuras de Datos Espaciales mediante la aplicación de técnicas y buenas prácticas de otras comunidades científicas, especialmente de las comunidades de la Web y de la Web Semántica (por ejemplo, Linked Data). El uso de las descripciones semánticas y las aproximaciones basadas en el contenido publicado por la comunidad geoespacial pueden ayudar en la búsqueda de información sobre los fenómenos geográficos, y en la búsqueda de recursos geoespaciales en general. El trabajo comienza con un análisis de una aproximación para mejorar la búsqueda de las entidades geoespaciales desde la perspectiva de geocodificación tradicional. La arquitectura de geocodificación compuesta propuesta en este trabajo asegura una mejora de los resultados de geocodificación gracias a la utilización de diferentes proveedores de información geográfica. En este enfoque, el uso de patrones estructurales de diseño y ontologías en esta aproximación permite una arquitectura avanzada en términos de extensibilidad, flexibilidad y adaptabilidad. Además, una arquitectura basada en la selección de servicio de geocodificación permite el desarrollo de una metodología de la georreferenciación de diversos tipos de información geográfica (por ejemplo, direcciones o puntos de interés). A continuación, se presentan dos aplicaciones representativas que requieren una caracterización semántica adicional de los recursos geoespaciales. El enfoque propuesto en este trabajo utiliza contenidos basados en heurísticas para el muestreo de un conjunto de recursos geopesaciales. La primera parte se dedica a la idea de la abstracción de un fenómeno geográfico de su definición espacial. La investigación muestra que las buenas prácticas de la Web Semántica se puede reutilizar en el ámbito de una Infraestructura de Datos Espaciales para describir los servicios geoespaciales estandarizados por Open Geospatial Consortium por medio de geoidentificadores (es decir, por medio de las entidades de una ontología geográfica). La segunda parte de este capítulo desglosa la aquitectura y componentes de un servicio de geoprocesamiento para la identificación automática de ortoimágenes ofrecidas a través de un servicio estándar de publicación de mapas (es decir, los servicios que siguen la especificación OGC Web Map Service). Como resultado de este trabajo se ha propuesto un método para la identificación de los mapas ofrecidos por un Web Map Service que son ortoimágenes. A continuación, el trabajo se dedica al análisis de cuestiones relacionadas con la creación de los metadatos de recursos de la Web en el contexto del dominio geográfico. Este trabajo propone una arquitectura para la generación automática de conocimiento geográfico de los recursos Web. Ha sido necesario desarrollar un método para la estimación de la cobertura geográfica de las páginas Web. Las heurísticas propuestas están basadas en el contenido publicado por os proveedores de información geográfica. El prototipo desarrollado es capaz de generar metadatos. El modelo generado contiene el conjunto mínimo recomendado de elementos requeridos por un catálogo que sigue especificación OGC Catalogue Service for the Web, el estandar recomendado por deiferentes Infraestructuras de Datos Espaciales (por ejemplo, the Infrastructure for Spatial Information in the European Community (INSPIRE)). Además, este estudio determina algunas características de la Web Geoespacial actual. En primer lugar, ofrece algunas características del mercado de los proveedores de los recursos Web de la información geográfica. Este estudio revela algunas prácticas de la comunidad geoespacial en la producción de metadatos de las páginas Web, en particular, la falta de metadatos geográficos. Todo lo anterior es la base del estudio de la cuestión del apoyo a los usuarios no expertos en la búsqueda de recursos de la Web Geoespacial. El motor de búsqueda dedicado a la Web Geoespacial propuesto en este trabajo es capaz de usar como base un motor de búsqueda existente. Por otro lado, da soporte a la búsqueda exploratoria de los recursos geoespaciales descubiertos en la Web. El experimento sobre la precisión y la recuperación ha demostrado que el prototipo desarrollado en este trabajo es al menos tan bueno como el motor de búsqueda remoto. Un estudio dedicado a la utilidad del sistema indica que incluso los no expertos pueden realizar una tarea de búsqueda con resultados satisfactorios

The RCSB Protein Data Bank: redesigned web site and web services

The RCSB Protein Data Bank (RCSB PDB) web site (http://www.pdb.org) has been redesigned to increase usability and to cater to a larger and more diverse user base. This article describes key enhancements and new features that fall into the following categories: (i) query and analysis tools for chemical structure searching, query refinement, tabulation and export of query results; (ii) web site customization and new structure alerts; (iii) pair-wise and representative protein structure alignments; (iv) visualization of large assemblies; (v) integration of structural data with the open access literature and binding affinity data; and (vi) web services and web widgets to facilitate integration of PDB data and tools with other resources. These improvements enable a range of new possibilities to analyze and understand structure data. The next generation of the RCSB PDB web site, as described here, provides a rich resource for research and education

Towards memory supporting personal information management tools

In this article we discuss re-retrieving personal information objects and relate the task to recovering from lapse(s) in memory. We propose that fundamentally it is lapses in memory that impede users from successfully re-finding the information they need. Our hypothesis is that by learning more about memory lapses in non-computing contexts and how people cope and recover from these lapses, we can better inform the design of PIM tools and improve the user's ability to re-access and re-use objects. We describe a diary study that investigates the everyday memory problems of 25 people from a wide range of backgrounds. Based on the findings, we present a series of principles that we hypothesize will improve the design of personal information management tools. This hypothesis is validated by an evaluation of a tool for managing personal photographs, which was designed with respect to our findings. The evaluation suggests that users' performance when re-finding objects can be improved by building personal information management tools to support characteristics of human memory

A software classification scheme

Reusing code is one approach to software reusability. Code is the end product of the software lifecycle. It is delivered in a low level representation that is difficult to reuse unless an almost perfect match exists between available features and required specifications. There is a need to organize large inventories of software such that reusable code is easy to locate and exchange. The relative success in the reuse of code fragments reported by some software factories is due in part to their capacity to encapsulate domain specific functions and create specialized libraries of components classified by these locally standardized functions.A general software classification scheme that organizes reusability related attributes and common functions from different domains is proposed as a partial solution to the software reusability problem. For the problem of selecting from similar, potentially reusable. components, a partial solution based on evaluation of common characteristics is also proposed. A library system is presented that integrates the proposed classification scheme with an evaluation mechanism based on inherent component attributes, programming languages characteristics and reuser experience.The fundamental contribution of this dissertation is a formal treatment of a faceted scheme for software classification leading to better understanding of reusability at the code level. This approach has been prototyped in a library system for the semi-automatic classification of software components. Analysis were performed to evaluate the classification scheme. The results show the potential of the scheme in organizing collections of code fragments, in improving retrieval, and in simplifying the classification process. Tests of the evaluation mechanism showed positive correlation with evaluations conducted by potential reusers

Parallel surface reconstruction through virtual milling

Surface definition deals with representing a surface analytically using a finite number of parameters and with acceptable levels of error. In the past few years it has become a key discipline in Computational Fluid Dynamics (CFD). Recent advances in computers and numerical algorithms have made it possible for CFD practitioners to attempt flow solutions about complex three-dimensional geometries. The first step in this process is having a numerical representation of the shape. In many cases of interest such a representation already exists; i.e., aircraft designed on a computer. Such Computer-Aided Design (CAD) descriptions do not exist, though, for objects found in nature or predating CAD. In such situations a technique for measuring the object and then constructing a surface conforming to these measurements is needed;Existing techniques for 3-D surface definition often require considerable human intervention, both in the measuring and the reconstruction process. This is a time consuming proposition. It is desirable to develop a fully automated alternative;Three-dimensional objects can be measured accurately and quickly from multiple viewpoints using a Cyberware laser digitizer. The digitizer returns the coordinates of a set of surface points. The problem is then to construct a faithful representation of the original object from these points. The algorithm proposed here has two distinct stages. In the first stage, surface fragments, using information from a single view, are produced by employing a visibility constraint and a 2-D Delaunay triangulation technique. In the next stage, surfaces from multiple views are combined through an approach that emulates the machining operation of milling. The final result is a non-convex, triangular faceted, polyhedron that approximates the object shape;A sequential version of the virtual milling algorithm exists on a Silicon Graphics workstation. The algorithm is of O(NlogN) complexity, where N is the number of data points. Experimental results have been obtained for a scaled F117-A model scanned from multiple viewpoints. Several topological issues have been addressed;A parallel version of the algorithm has been implemented on the Intel Gamma Prototype, a 128 node, distributed-memory, MIMD computer. Run times are compared to those obtained on an Iris 310/VGX workstation

Connected Information Management

Society is currently inundated with more information than ever, making efficient management a necessity. Alas, most of current information management suffers from several levels of disconnectedness: Applications partition data into segregated islands, small notes don’t fit into traditional application categories, navigating the data is different for each kind of data; data is either available at a certain computer or only online, but rarely both. Connected information management (CoIM) is an approach to information management that avoids these ways of disconnectedness. The core idea of CoIM is to keep all information in a central repository, with generic means for organization such as tagging. The heterogeneity of data is taken into account by offering specialized editors. The central repository eliminates the islands of application-specific data and is formally grounded by a CoIM model. The foundation for structured data is an RDF repository. The RDF editing meta-model (REMM) enables form-based editing of this data, similar to database applications such as MS access. Further kinds of data are supported by extending RDF, as follows. Wiki text is stored as RDF and can both contain structured text and be combined with structured data. Files are also supported by the CoIM model and are kept externally. Notes can be quickly captured and annotated with meta-data. Generic means for organization and navigation apply to all kinds of data. Ubiquitous availability of data is ensured via two CoIM implementations, the web application HYENA/Web and the desktop application HYENA/Eclipse. All data can be synchronized between these applications. The applications were used to validate the CoIM ideas

Linking Roman Coins: Current Work at the American Numismatic Society

This paper details a current project at the American Numismatic Society: Online Coins of the Roman Empire (OCRE), an open-access catalogue of Roman Imperial coin types. The paper discusses linked data approaches applied to numismatic collections, the application architecture of the project, and the practical functionality of the project’s web interface, illustrating its value to researchers