Ontology Mapping Evolution

Introdução Hoje em dia, o conceito de ontologia (Especificação explícita de uma conceptualização [Gruber, 1993]) é um conceito chave em sistemas baseados em conhecimento em geral e na Web Semântica em particular. Entretanto, os agentes de software nem sempre concordam com a mesma conceptualização, justificando assim a existência de diversas ontologias, mesmo que tratando o mesmo domínio de discurso. Para resolver/minimizar o problema de interoperabilidade entre estes agentes, o mapeamento de ontologias provou ser uma boa solução. O mapeamento de ontologias é o processo onde são especificadas relações semânticas entre entidades da ontologia origem e destino ao nível conceptual, e que por sua vez podem ser utilizados para transformar instâncias baseadas na ontologia origem em instâncias baseadas na ontologia destino. Motivação Num ambiente dinâmico como a Web Semântica, os agentes alteram não só os seus dados mas também a sua estrutura e semântica (ontologias). Este processo, denominado evolução de ontologias, pode ser definido como uma adaptação temporal da ontologia através de alterações que surgem no domínio ou nos objectivos da própria ontologia, e da gestão consistente dessas alterações [Stojanovic, 2004], podendo por vezes deixar o documento de mapeamento inconsistente. Em ambientes heterogéneos onde a interoperabilidade entre sistemas depende do documento de mapeamento, este deve reflectir as alterações efectuadas nas ontologias, existindo neste caso duas soluções: (i) gerar um novo documento de mapeamento (processo exigente em termos de tempo e recursos computacionais) ou (ii) adaptar o documento de mapeamento, corrigindo relações semânticas inválidas e criar novas relações se forem necessárias (processo menos existente em termos de tempo e recursos computacionais, mas muito dependente da informação sobre as alterações efectuadas). O principal objectivo deste trabalho é a análise, especificação e desenvolvimento do processo de evolução do documento de mapeamento de forma a reflectir as alterações efectuadas durante o processo de evolução de ontologias. Contexto Este trabalho foi desenvolvido no contexto do MAFRA Toolkit1. O MAFRA (MApping FRAmework) Toolkit é uma aplicação desenvolvida no GECAD2 que permite a especificação declarativa de relações semânticas entre entidades de uma ontologia origem e outra de destino, utilizando os seguintes componentes principais: Concept Bridge – Representa uma relação semântica entre um conceito de origem e um de destino; Property Bridge – Representa uma relação semântica entre uma ou mais propriedades de origem e uma ou mais propriedades de destino; Service – São aplicados às Semantic Bridges (Property e Concept Bridges) definindo como as instâncias origem devem ser transformadas em instâncias de destino. Estes conceitos estão especificados na ontologia SBO (Semantic Bridge Ontology) [Silva, 2004]. No contexto deste trabalho, um documento de mapeamento é uma instanciação do SBO, contendo relações semânticas entre entidades da ontologia de origem e da ontologia de destino. Processo de evolução do mapeamento O processo de evolução de mapeamento é o processo onde as entidades do documento de mapeamento são adaptadas, reflectindo eventuais alterações nas ontologias mapeadas, tentando o quanto possível preservar a semântica das relações semântica especificadas. Se as ontologias origem e/ou destino sofrerem alterações, algumas relações semânticas podem tornar-se inválidas, ou novas relações serão necessárias, sendo por isso este processo composto por dois sub-processos: (i) correcção de relações semânticas e (ii) processamento de novas entidades das ontologias. O processamento de novas entidades das ontologias requer a descoberta e cálculo de semelhanças entre entidades e a especificação de relações de acordo com a ontologia/linguagem SBO. Estas fases (“similarity measure” e “semantic bridging”) são implementadas no MAFRA Toolkit, sendo o processo (semi-) automático de mapeamento de ontologias descrito em [Silva, 2004]. O processo de correcção de entidades SBO inválidas requer um bom conhecimento da ontologia/linguagem SBO, das suas entidades e relações, e de todas as suas restrições, i.e. da sua estrutura e semântica. Este procedimento consiste em (i) identificar as entidades SBO inválidas, (ii) a causa da sua invalidez e (iii) corrigi-las da melhor forma possível. Nesta fase foi utilizada informação vinda do processo de evolução das ontologias com o objectivo de melhorar a qualidade de todo o processo. Conclusões Para além do processo de evolução do mapeamento desenvolvido, um dos pontos mais importantes deste trabalho foi a aquisição de um conhecimento mais profundo sobre ontologias, processo de evolução de ontologias, mapeamento etc., expansão dos horizontes de conhecimento, adquirindo ainda mais a consciência da complexidade do problema em questão, o que permite antever e perspectivar novos desafios para o futuro.

Turbulence and unemployment in a job matching model

According to Ljungqvist and Sargent (1998), high European unemployment since the 1980s can be explained by a rise in economic turbulence, leading to greater numbers of unemployed workers with obsolete skills. These workers refuse new jobs due to high unemployment benefits. In this paper we reassess the turbulence-unemployment relationship using a matching model with endogenous job destruction. In our model, higher turbulence reduces the incentives of employed workers to leave their jobs. If turbulence has only a tiny effect on the skills of workers experiencing endogenous separation, then the results of Lungqvist and Sargent (1998, 2004) are reversed, and higher turbulence leads to a reduction in unemployment. Thus, changes in turbulence cannot provide an explanation for European unemployment that reconciles the incentives of both unemployed and employed workers.

General preferences for consumption goods in the random matching model of commodity money

This paper generalizes the original random matching model of money byKiyotaki and Wright (1989) (KW) in two aspects: first, the economy ischaracterized by an arbitrary distribution of agents who specialize in producing aparticular consumption good; and second, these agents have preferences suchthat they want to consume any good with some probability. The resultsdepend crucially on the size of the fraction of producers of each goodand the probability with which different agents want to consume eachgood. KW and other related models are shown to be parameterizations ofthis more general one.

Informational matching

This paper analyzes the problem of matching heterogeneous agents in aBayesian learning model. One agent gives a noisy signal to another agent,who is responsible for learning. If production has a strong informationalcomponent, a phase of cross-matching occurs, so that agents of low knowledgecatch up with those of higher one. It is shown that:(i) a greater informational component in production makes cross-matchingmore likely;(ii) as the new technology is mastered, production becomes relatively morephysical and less informational;(iii) a greater dispersion of the ability to learn and transfer informationmakes self-matching more likely; and(iv) self-matching leads to more self-matching, whereas cross-matching canmake less productive agents overtake more productive ones.

Shocks and institutions in a job matching model

This paper explains the divergent behavior of European an US unemploymentrates using a job market matching model of the labor market with aninteraction between shocks an institutions. It shows that a reduction inTF growth rates, an increase in real interest rates, and an increase intax rates leads to a permanent increase in unemployment rates when thereplacement rates or initial tax rates are high, while no increase inunemployment occurs when institutions are "employment friendly". The paperalso shows that an increase in turbulence, modelle as an increase probabilityof skill loss, is not a robust explanation for the European unemploymentpuzzle in the context of a matching model with both endogenous job creationand job estruction.

Business cycles, unemployment insurance and the calibration of matching models

This paper theoretically and empirically documents a puzzle that arises when an RBC economy with a job matching function is used to model unemployment. The standard model can generate sufficiently large cyclical fluctuations in unemployment, or a sufficiently small response of unemployment to labor market policies, but it cannot do both. Variable search and separation, finite UI benefit duration, efficiency wages, and capital all fail to resolve this puzzle. However, either sticky wages or match-specific productivity shocks can improve the model's performance by making the firm's flow of surplus more procyclical, which makes hiring more procyclical too.

Endogeneous matching in university-industry collaboration: Theory and empirical evidence from the UK

We develop a two-sided matching model to analyze collaboration between heterogeneousacademics and firms. We predict a positive assortative matching in terms of both scientificability and affinity for type of research, but negative assortative in terms of ability on one sideand affinity in the other. In addition, the most able and most applied academics and the mostable and most basic firms shall collaborate rather than stay independent. Our predictionsreceive strong support from the analysis of the teams of academics and firms that proposeresearch projects to the UK's Engineering and Physical Sciences Research Council.

MSISpIC: A Probabilistic Scan Matching Algorithm Using a Mechanical Scanned Imaging Sonar

This paper compares two well known scan matching algorithms: the MbICP and the pIC. As a result of the study, it is proposed the MSISpIC, a probabilistic scan matching algorithm for the localization of an Autonomous Underwater Vehicle (AUV). The technique uses range scans gathered with a Mechanical Scanning Imaging Sonar (MSIS), and the robot displacement estimated through dead-reckoning with the help of a Doppler Velocity Log (DVL) and a Motion Reference Unit (MRU). The proposed method is an extension of the pIC algorithm. Its major contribution consists in: 1) using an EKF to estimate the local path traveled by the robot while grabbing the scan as well as its uncertainty and 2) proposing a method to group into a unique scan, with a convenient uncertainty model, all the data grabbed along the path described by the robot. The algorithm has been tested on an AUV guided along a 600m path within a marina environment with satisfactory results

The Gene Ontology: enhancements for 2011.

The Gene Ontology (GO) (http://www.geneontology.org) is a community bioinformatics resource that represents gene product function through the use of structured, controlled vocabularies. The number of GO annotations of gene products has increased due to curation efforts among GO Consortium (GOC) groups, including focused literature-based annotation and ortholog-based functional inference. The GO ontologies continue to expand and improve as a result of targeted ontology development, including the introduction of computable logical definitions and development of new tools for the streamlined addition of terms to the ontology. The GOC continues to support its user community through the use of e-mail lists, social media and web-based resources.

Complete Ontology- Three level Integration

This file contains the complete ontology (OntoProcEDUOC_OKI_Final.owl). At loading time to edit, the OKI ontology corresponding to the implementation level (OntoOKI_DEFINITIVA.owl)must be imported.

Labor market heterogeneity and the aggregate matching function

The matching function -a key building block in models of labor market frictions- impliesthat the job finding rate depends only on labor market tightness. We estimate such amatching function and find that the relation, although remarkably stable over 1967-2007,broke down spectacularly after 2007. We argue that labor market heterogeneities are notfully captured by the standard matching function, but that a generalized matching functionthat explicitly takes into account worker heterogeneity and market segmentation is fullyconsistent with the behavior of the job finding rate. The standard matching function canbreak down when, as in the Great Recession, the average characteristics of the unemployedchange too much, or when dispersion in labor market conditions -the extent to which somelabor markets fare worse than others- increases too much.

Semantic domains and supersens tagging for domain-specific ontology learning

In this paper we propose a novel unsupervised approach to learning domain-specific ontologies from large open-domain text collections. The method is based on the joint exploitation of Semantic Domains and Super Sense Tagging for Information Retrieval tasks. Our approach is able to retrieve domain specific terms and concepts while associating them with a set of high level ontological types, named supersenses, providing flat ontologies characterized by very high accuracy and pertinence to the domain.

Matching at one loop for the four-quark operators in NRQCD

The matching coefficients for the four-quark operators in NRQCD (NRQED) are calculated at one loop using dimensional regularization for ultraviolet and infrared divergences. The matching for the electromagnetic current follows easily from our results. Both the unequal and equal mass cases are considered. The role played by the Coulomb infrared singularities is explained in detail.