Some notes on an extended query language for FSM

FSM is a database model that has been recently proposed by the authors. FSM uses basic concepts of classification, generalization, aggregation and association that are commonly used in semantic modelling and supports the fuzziness of real-world at attribute, entity, class and relations intra and inter-classes levels. Hence, it provides tools to formalize and conceptualize real-world within a manner adapted to human perception of and reasoning about this real-word. In this paper we briefly review basic concepts of FSM and provide some notes on an extended query language adapted to it.ou

Ontology-based model abstraction

In recent years, there has been a growth in the use of reference conceptual models to capture information about complex and critical domains. However, as the complexity of domain increases, so does the size and complexity of the models that represent them. Over the years, different techniques for complexity management in large conceptual models have been developed. In particular, several authors have proposed different techniques for model abstraction. In this paper, we leverage on the ontologically well-founded semantics of the modeling language OntoUML to propose a novel approach for model abstraction in conceptual models. We provide a precise definition for a set of Graph-Rewriting rules that can automatically produce much-reduced versions of OntoUML models that concentrate the models’ information content around the ontologically essential types in that domain, i.e., the so-called Kinds. The approach has been implemented using a model-based editor and tested over a repository of OntoUML models

Cross-Border Flows of People, Technology Diffusion and Aggregate Productivity

A number of empirical studies have investigated the hypothesis that cross-border flows of goods (international trade) and capital (FDI) lead to international technology diffusion. The contribution of the present paper consists in examining an as yet neglected vehicle for technology diffusion: cross-border flows of people. We find that increasing the intensity of international travel, for the purpose of business and otherwise, by 1% increases the level of aggregate total factor productivity and GDP per worker by roughly 0.2%.Technology diffusion, Productivity, IV estimation

ESTIMATION OF COST ALLOCATION COEFFICIENTS AT THE FARM LEVEL USING AN ENTROPY APPROACH

This paper aims to estimate the farm cost allocation coefficients from whole farm input costs. An entropy approach was developed under a Tobit formulation and was applied to a sample of farms from the 2004 FADN data base for Alentejo region, Southern Portugal. A Generalized Maximum Entropy model and Cross Generalized Entropy model were developed to the sample conditions and were tested. Model results were assessed in terms of their precision and estimation power and were compared with observed data. The entropy approach showed to be a flexible and valid tool to estimate incomplete information, namely regarding farm costs. Keywords: Generalized maximum entropy; costs; estimation; Alentejo, FADN

Engineering Object-Oriented Semantics Using Graph Transformations

In this paper we describe the application of the theory of graph transformations to the practise of language design. We have defined the semantics of a small but realistic object-oriented language (called TAAL) by mapping the language constructs to graphs and their operational semantics to graph transformation rules. In the process we establish a mapping between UML models and graphs. TAAL was developed for the purpose of this paper, as an extensive case study in engineering object-oriented language semantics using graph transformation. It incorporates the basic aspects of many commonly used object-oriented programming languages: apart from essential imperative programming constructs, it includes inheritance, object creation and method overriding. The language specification is based on a number of meta-models written in UML. Both the static and dynamic semantics are defined using graph rewriting rules. In the course of the case study, we have built an Eclipse plug-in that automatically transforms arbitrary TAAL programs into graphs, in a graph format readable by another tool. This second tool is called Groove, and it is able to execute graph transformations. By combining both tools we are able to visually simulate the execution of any TAAL program