Expressing the tacit knowledge of a digital library system as linked data

Library organizations have enthusiastically undertaken semantic web initiatives and in particular the data publishing as linked data. Nevertheless, different surveys report the experimental nature of initiatives and the consumer difficulty in re-using data. These barriers are a hindrance for using linked datasets, as an infrastructure that enhances the library and related information services. This paper presents an approach for encoding, as a Linked Vocabulary, the "tacit" knowledge of the information system that manages the data source. The objective is the improvement of the interpretation process of the linked data meaning of published datasets. We analyzed a digital library system, as a case study, for prototyping the "semantic data management" method, where data and its knowledge are natively managed, taking into account the linked data pillars. The ultimate objective of the semantic data management is to curate the correct consumers' interpretation of data, and to facilitate the proper re-use. The prototype defines the ontological entities representing the knowledge, of the digital library system, that is not stored in the data source, nor in the existing ontologies related to the system's semantics. Thus we present the local ontology and its matching with existing ontologies, Preservation Metadata Implementation Strategies (PREMIS) and Metadata Objects Description Schema (MODS), and we discuss linked data triples prototyped from the legacy relational database, by using the local ontology. We show how the semantic data management, can deal with the inconsistency of system data, and we conclude that a specific change in the system developer mindset, it is necessary for extracting and "codifying" the tacit knowledge, which is necessary to improve the data interpretation process

Electronic evidence and the meaning of "original"

Article based on a paper given at the Tokyo Institute of Technology, Graduate School of Decision Science and Technology, Ookayama-campus, Tokyo.Article by Stephen Mason published in Amicus Curiae - Journal of the Society for Advanced Legal Studies. The Journal is produced by the Society for Advanced Legal Studies at the Institute of Advanced Legal Studies, University of London

Addressing the tacit knowledge of a digital library system

Recent surveys, about the Linked Data initiatives in library organizations, report the experimental nature of related projects and the difficulty in re-using data to provide improvements of library services. This paper presents an approach for managing data and its "tacit" organizational knowledge, as the originating data context, improving the interpretation of data meaning. By analyzing a Digital Libray system, we prototyped a method for turning data management into a "semantic data management", where local system knowledge is managed as a data, and natively foreseen as a Linked Data. Semantic data management aims to curates the correct consumers' understanding of Linked Datasets, driving to a proper re-use

Asymmetric Epoxidation: A Twinned Laboratory and Molecular Modeling Experiment for Upper-Level Organic Chemistry Students

The coupling of a student experiment involving the preparation and use of a catalyst for the asymmetric epoxidation of an alkene with computational simulations of various properties of the resulting epoxide is set out in the form of a software toolbox from which students select appropriate components. At the core of these are the computational spectroscopic tools, whereby a measured spectrum can be interpreted in some detail using theoretical simulations. These include a range of modern chiroptical methods to accompany the increased use of such techniques in modern teaching laboratories. Computational experiments are captured in a Wiki-based electronic laboratory notebook, which features data-stamping, authenticated entries, and inclusion of semantically intact data via interactive models rendered within the Wiki using JSmol and its referencing via a digital object identifier (DOI) to a digital data repository

Enhanced Parallel Generation of Tree Structures for the Recognition of 3D Images

Segmentations of a digital object based on a connectivity criterion at n-xel or sub-n-xel level are useful tools in image topological analysis and recognition. Working with cell complex analogous of digital objects, an example of this kind of segmentation is that obtained from the combinatorial representation so called Homological Spanning Forest (HSF, for short) which, informally, classifies the cells of the complex as belonging to regions containing the maximal number of cells sharing the same homological (algebraic homology with coefficient in a field) information. We design here a parallel method for computing a HSF (using homology with coefficients in Z/2Z) of a 3D digital object. If this object is included in a 3D image of m1 × m2 × m3 voxels, its theoretical time complexity order is near O(log(m1 + m2 + m3)), under the assumption that a processing element is available for each voxel. A prototype implementation validating our results has been written and several synthetic, random and medical tridimensional images have been used for testing. The experiments allow us to assert that the number of iterations in which the homological information is found varies only to a small extent from the theoretical computational time.Ministerio de Economía y Competitividad MTM2016-81030-

Adaptive Discrete Laplace Operator

International audienceDiffusion processes capture information about the geometry of an object such as its curvature, symmetries and particular points. The evolution of the diffusion is governed by the Laplace-Beltrami operator which presides to the diffusion on the manifold. In this paper, we define a new discrete adaptive Laplacian for digital objects, gener- alizing the operator defined on meshes. We study its eigenvalues and eigenvectors recovering interesting geometrical informations. We discuss its convergence towards the usual Laplacian operator especially on lat- tice of diamonds. We extend this definition to 3D shapes. Finally we use this Laplacian in classical but adaptive denoising of pictures preserving zones of interest like thin structures

Multiuser Detection Assisted Time- and Frequency-Domain Spread Multicarrier Code-Division Multiple-Access

In this contribution, we study a reduced-complexity multiuser detection aided multicarrier direct-sequence code-division multiple-access (MC DS-CDMA) scheme, which employs both time (T)-domain and frequency (F)-domain spreading. We investigate the achievable detection performance in the context of synchronous TF-domain spread MC DS-CDMA when communicating over an additive white Gaussian noise (AWGN) channel. Five detection schemes are investigated, which include the single-user correlation based detector, the joint TF-domain decorrelating multiuser detector (MUD), the joint TF-domain MMSEMUD, the separate TF-domain decorrelating/MMSE MUD, and the separate TF-domain MMSE/decorrelating MUD. Our simulation results show that the separate TF-domain MUD schemes are capable of achieving a similar bit error rate (BER) performance to that of the significantly more complex joint TF-domain MUD schemes. Index Terms—Code-division multiple-access (CDMA), decorrelating, frequency-domain spreading, joint detection, minimum mean square error (MMSE), multicarrier (MC), multiuser detection, separate detection, time-domain spreading

A Hole Avoiding Routing Protocol with Relative Neighborhood Graph for Wireless Sensor Network

[[abstract]]In wireless sensor networks, ¿holes¿ are hardly to know its location and avoid either because of various actual geographical environments. A hole can be dynamically formed due to unbalanced deployment, failure or power exhaustion of sensors, animus interference, or physical barriers such as buildings or mountains. Hence, we hope to propose the RNG Hole Avoiding Routing protocol, RNGHAR which can model ¿holes¿ existed in wireless sensor network and event packets can avoid meeting a ¿hole¿ in advance instead of bypassing a hole when it meets the hole. This paper proposes a novel algorithm RNGHAR which uses RNG (relative neighborhood graph) modeling holes then we can collect hole information in order to construct in advance hole avoiding routing path. Hence event packets will be guided to overcome the hole and move along the shortest path from source node to the sink node. Simulation studies show that my proposed method achieves good performance in terms of average hop count, packet delivery success rate and power consumption in comparison with the existing protocols.[[sponsorship]]IEEE Taipei Section; National Science Council; Ministry of Education; Tamkang University; Asia University; Providence University; The University of Aizu; Lanzhou University[[conferencetype]]國際[[conferencetkucampus]]淡水校園[[conferencedate]]20091203~20091205[[iscallforpapers]]Y[[conferencelocation]]Taipei, Taiwa

Liberating links between datasets using lightweight data publishing: an example using plant names and the taxonomic literature

Constructing a biodiversity knowledge graph will require making millions of cross links between diversity entities in different datasets. Researchers trying to bootstrap the growth of the biodiversity knowledge graph by constructing databases of links between these entities lack obvious ways to publish these sets of links. One appealing and lightweight approach is to create a "datasette", a database that is wrapped together with a simple web server that enables users to query the data. Datasettes can be packaged into Docker containers and hosted online with minimal effort. This approach is illustrated using a dataset of links between globally unique identifiers for plant taxonomic namesand identifiers for the taxonomic articles that published those names

A digital index theorem

Proc. of the 7th Int. Workshop on Combinatorial Image Analysis. IWCIA00. Caen. France. July 2000.This paper is devoted to prove a Digital Index Theorem for digital (n − 1)-manifolds in a digital space (Rn, f), where f belongs to a large family of lighting functions on the standard cubical decomposition Rn of the n-dimensional Euclidean space. As an immediate consequence we obtain the corresponding theorems for all (α, β)-surfaces of Kong-Roscoe, with α, β ∈ {6, 18, 26} and (α, β) 6≠(6, 6),(18, 26),(26, 26), as well as for the strong 26-surfaces of Bertrand-Malgouyres.Dirección General de Investigación Científica y TécnicaDirección General de Enseñanza Superio