This work applies knowledge engineering’s techniques to medieval illuminations. Inside it, an illumination is considered as a knowledge graph which was used by some elites in the Middle Ages to represent themselves as a social group and exhibit the events in their lives, and their cultural values. That graph is based on combinations of symbolic elements linked each to others with semantic relations. Those combinations were used to encode visual metaphors and influential messages whose interpretations are sometimes tricky for not experts. Our work aims to describe the meaning of those elements through logical modelling using ontologies. To achieve that, we construct logical reasoning rules and simulate them using artificial intelligence mechanisms. The goal is to facilitate the interpretation of illuminations and provide, in a future evolution of current social media, logical formalisation of new encoding and information transmission services.
History of scholarship and learning. The humanities, Bibliography. Library science. Information resources
This work applies knowledge engineering’s techniques to medieval illuminations. Inside it, an illumination is considered as a knowledge graph which was used by some elites in the Middle Ages to represent themselves as a social group and exhibit the events in their lives, and their cultural values. That graph is based on combinations of symbolic elements linked each to others with semantic relations. Those combinations were used to encode visual metaphors and influential messages whose interpretations are sometimes tricky for not experts. Our work aims to describe the meaning of those elements through logical modelling using ontologies. To achieve that, we construct logical reasoning rules and simulate them using artificial intelligence mechanisms. The goal is to facilitate the interpretation of illuminations and provide, in a future evolution of current social media, logical formalisation of new encoding and information transmission services.
History of scholarship and learning. The humanities, Bibliography. Library science. Information resources
AbstractCs2S kristallisiert orthorhombisch, a = 8,571, b = 5,383, c = 10,39 Å, Z = 4, drö = 4,13, dpyk = 4,19 g · cm−3, D–Pnma mit \documentclass{article}\pagestyle{empty}\begin{document}$ \mathop {{\rm Cs}}\limits^|,\mathop {{\rm Cs}}\limits^\parallel $\end{document} und S je in 4(c), Parameter siehe Text. Es ist R = 10,4% für 202 von 222 möglichen Reflexen. Es liegt eine der hexagonal‐dichtesten Kugelpackung entsprechende Abfolge von S2− vor. Cs besetzt je zur Hälfte „Tetraeder”︁‐ und „Oktaederlücken”︁; die Auslenkung aus den „Oktaederlücken”︁ ist merklich. Effektive Koordinationszahlen, ECoN, und der Madelunganteil der Gitterenergie, MAPLE, werden berechnet und diskutiert.
The cesium polyselenide Cs4Se16 has been prepared by the methanolothermal reaction of Cs2CO3 and Se at 160 °C and 13 bar. [Se16]4- fragments may be regarded as containing an Se6 ring with Cs symmetry and two Se5 chains related by the crystallographic mirror plane. Se4 of the sixmembered ring, which displays a square planar geometry, participates in two relatively long Se4—Se5 bonds [2.989(4) A] to individual chains. The trans-sited Se4—Se3 bonds [2.425(4) A] are markedly longer than the remaining Se—Se bonds in the Se6 ring [2.344(4), 2.356(4) A]. Further Se—Se interactions of length 3.132(4) and 3.346(4) Å are observed between individual [Se16]4- fragments.
Methanolothermal reaction of Cs2CO3 with Ge and Se at 190 °C yields Cs4Ge4Se10 · 2 CH3OH and Cs4Ge2Se8, the structures of which have been determined by X-ray structural analysis. The anion [Ge4Se10]4 in Cs4Ge4Se10)·2 CH3OH displays an adamantane-like structure in which four GeSe4 tetrahedra are linked via joint vertices. In contrast Cs4Ge2Se8 contains the novel dinuclear anion [Ge2Se8]4-, the first example of a selenidogermanate(IV) exhibiting Se2 bridging units. Two GeSe4 tetrahedra are linked in this anion through Se-Se bonds to yield a six-membered ring, which displays a chair conformation and crystallographic C2h symmetry.
D. Kranzlmüller, Christian Schaubschläger, J. Volkert
Abstract Debugging parallel and distributed programs is a difficult activity due to the multiplicity of“sequential bugs”, the existence of malign effects like race conditions and deadlocks, and thehuge amounts of data that have to be processed. These problems are addressed by the Moni-toring And Debugging environment MAD, which offers debugging functionality based on agraphical representation of a program’s execution. The target applications of MAD are paral-lel programs applying the standard Message-Passing Interface MPI, which is used extensivelyin the high-performance computing domain. The highlights of MAD are interactive inspectionmechanisms including visualization of distributed arrays, the possibility to graphically placebreakpoints, a mechanism for monitor overhead removal, and the evaluation of racing mes-sages occurring due to nondeterminism in the code.Keywords: debugging, message-passing programs, array visualization, race conditions, mon-itor overhead. 1. Introduction Parallel programs consist of several, concurrently executing and communicating tasks, whichjointly solve a given problem. In message-passing programs, the communication and synchro-nization between these tasks is carried out with dedicated functions for message transmission.Consequently, the traditional software life-cycle has to be adapted to cope with concurrencyand process interaction. This exhibits problems unknown in sequential computing, whichmust be addressed during software design, implementation, and testing and debugging.The testing and debugging phase is responsible for detecting erroneous behavior and locat-ing its original reason as established by the application’s source code. This is achieved withmethods like breakpointing and inspection, which are applied during re-executions of the tar-get program to comprehend its behavior [10]. A parallel debugging tool must adapt thesebasic methods to the characteristics of the parallel program and may additionally supplementthe error detection activities by facilities addressing problems established by parallelism.Both goals are covered by the Monitoring And Debugging environment MAD, which is atoolset for debugging parallel programs based on the message-passing paradigm. The princi-pal idea of MAD is to display observed program interactions as a space-time diagram andapply this graphical representation as the main debugging abstraction. The advantage of thisapproach compared to other debugging environments is improved program understanding.1. In M. Ducasse (ed), proceedings of the Fourth International Workshop on Automated De-bugging (AADEBUG 2000), August 2000, Munich, COmputer Research Repository (http://www.acm.org/corr/), cs.SE/yymmnnn; whole proceedings:cs.SE/0010035.
AbstractChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable via the “References” option.
AbstractChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable via the “References” option.
It is next to impossible to develop real-life applications in just pure Prolog. With XPCE we realised a mechanism for integrating Prolog with an external object-oriented system that turns this OO system into a natural extension to Prolog. We describe the design and how it can be applied to other external OO systems.
Type analyses of logic programs which aim at inferring the types of the program being analyzed are presented in a unified abstract interpretation-based framework. This covers most classical abstract interpretation-based type analyzers for logic programs, built on either top-down or bottom-up interpretation of the program. In this setting, we discuss the widening operator, arguably a crucial one. We present a new widening which is more precise than those previously proposed. Practical results with our analysis domain are also presented, showing that it also allows for efficient analysis.
This paper describes the COINS (COnstraint-based INteractive Solving) system: a conflict-based constraint solver. It helps understanding inconsistencies, simulates constraint additions and/or retractions (without any propagation), determines if a given constraint belongs to a conflict and provides diagnosis tools (e.g. why variable v cannot take value val). COINS also uses user-friendly representation of conflicts and explanations.
The Gisela framework for declarative programming was developed with the specific aim of providing a tool that would be useful for knowledge representation and reasoning within real-world applications. To achieve this, a complete integration into an object-oriented application development environment was used. The framework and methodology developed provide two alternative application programming interfaces (APIs): Programming using objects or programming using a traditional equational declarative style. In addition to providing complete integration, Gisela also allows extensions and modifications due to the general computation model and well-defined APIs. We give a brief overview of the declarative model underlying Gisela and we present the methodology proposed for building applications together with some real examples.
Magnus Agren, Tamas Szeredi, Nicolas Beldiceanu
et al.
Previous work in the area of tracing CLP(FD) programs mainly focuses on providing information about control of execution and domain modification. In this paper, we present a trace structure that provides information about additional important aspects. We incorporate explanations in the trace structure, i.e. reasons for why certain solver actions occur. Furthermore, we come up with a format for describing the execution of the filtering algorithms of global constraints. Some new ideas about the design of the trace are also presented. For example, we have modeled our trace as a nested block structure in order to achieve a hierarchical view. Also, new ways about how to represent and identify different entities such as constraints and domain variables are presented.
In this paper we present a simple source code configuration tool. ExLibris operates on libraries and can be used to extract from local libraries all code relevant to a particular project. Our approach is not designed to address problems arising in code production lines, but rather, to support the needs of individual or small teams of researchers who wish to communicate their Prolog programs. In the process, we also wish to accommodate and encourage the writing of reusable code. Moreover, we support and propose ways of dealing with issues arising in the development of code that can be run on a variety of like-minded Prolog systems. With consideration to these aims we have made the following decisions: (i) support file-based source development, (ii) require minimal program transformation, (iii) target simplicity of usage, and (iv) introduce minimum number of new primitives.