SlideShare a Scribd company logo
1 of 19
Download to read offline
A semantic framework and software design to enable
the transparent integration, reorganization
and discovery of natural systems knowledge
Ferdinando Villa
Published online: 7 February 2007
# Springer Science + Business Media, LLC 2007
Abstract I present a conceptualization that attempts to unify diverse representations of
natural knowledge while providing a workable computational framework, based on current
semantic web theory, for developing, communicating, and running integrated simulation
models. The approach is based on a long-standing principle of scientific investigation: the
separation of the ontological character of the object of study from the semantics of the
observation context, the latter including location in space and time and other observation-
related aspects. I will show how current Knowledge Representation theories coupled with
the object-oriented paradigm allow an efficient integration through the abstract model of a
domain, which relates to the idea of aspect in software engineering. This conceptualization
allows us to factor out two fundamental causes of complexity and awkwardness in the
representation of knowledge about natural system: (a) the distinction between data and
models, both seen here as generic knowledge sources; (b) the multiplicity of states in data
sources, handled through the hierarchical composition of independently defined domain
objects, each accounting for all states in one well-known observational dimension. This
simplification leaves modelers free to work with the bare conceptual bones of the problem,
encapsulating complexities connected to data format, and scale. I will then describe the
design of a software system that implements the approach, referring to explicit ontologies to
unambiguously characterize the semantics of the objects of study, and allowing the
independent definition of a global observation context that can be redefined as required. I
will briefly discuss applications to multi-scale, multi-paradigm modeling, intelligent
database design, and web-based collaboration.
Keywords Semantic web theory. Intelligent database design . Web-based collaboration .
Multi-paradigm modelling
J Intell Inf Syst (2007) 29:79–96
DOI 10.1007/s10844-006-0032-x
F. Villa (*)
Ecoinformatics Collaboratory, Gund Institute for Ecological Economics and Department of Botany,
University of Vermont, 590 Main Street, Burlington, VT 05405, USA
e-mail: ferdinando.villa@uvm.edu
1 Introduction
Computer science has proved to be greatly effective in providing operational metaphors that
have made many complex tasks intuitive. Nevertheless, scientific investigation is still a
painstaking, inefficient process that relies largely on the manipulation of raw data. Despite
the powerful capabilities of dedicated analytical software such as GIS and statistical
packages, we have not yet identified a framework that allows natural system scientists to
work with natural world representations (data and models) using the same language that we
use to think about natural phenomena and entities. Long-established achievements in
personal productivity, information management, and scientific software allow us to work
efficiently with spreadsheets, GIS coverages, systems of differential equations; still, such
activities employ a very low level of abstraction compared to our thinking in terms of
biomass, temperature, or species diversity. Complexities related to data format, scale,
different granularities in space and time, and ambiguous, often opaque semantics make the
workflow of natural systems investigation slow and awkward, severely limiting a scientist’s
creativity and productivity.
Identifying synthetic approaches to enable more productive ecological knowledge
representation and management is ultimately a technical problem, but it cannot be
addressed at the technical level before a breakthrough in language is reached. In this paper I
will propose a conceptual framework that unifies and simplifies access to and integration of
data and models while at the same time providing a sound computational blackboard for
simulation modeling. The framework I present builds on the most recent efforts in
knowledge engineering applied to ecological research to address the following priorities:
& Give scientists the ability of searching and retrieving generalized knowledge sources
(data and models) in a predefined observation context, leaving issues of scale, unit
translation and enforcement of compatibility, and measurement of accuracy to an
automated system.
& Enable arbitrary recombination and composition of models and analytical pipelines
based solely on compatibility of semantics.
& Enable a network-enabled collaboration model where data, models, and modeling
scenarios can be communicated, modified and exchanged in the same ways that text-
based, discursive knowledge is.
The conceptualization presented here strives to “generalize away” two fundamental
causes of complexity in natural system representation:
& The distinction between data and models, seen as special cases of a generic “module”
or information source;
& The multiplicity of states in data sources, defined and managed through the hierarchical
composition of independently defined objects each of which determines a multiplicity
of states in one well-known representational dimension.
This simplification leaves us with the basic concept to work with and eliminates
complexities relating to data format, scale, and nature of the information. The concept
presented here differs from current model integration frameworks (e.g., ANL (URL);
DMSO (URL); Fishwick, 1995; Mosterman & Vangheluwe, 2000; Villa & Costanza, 2000;
Vangheluwe, Kerckhoffs, & Vansteenkiste, 2001), toolkits, and languages (e.g., Fritzson &
Engelson, 1998; Minar, Burkhart, Langton, & Askenazi, 1996) in that it is based in
established semantic web and data integration paradigms (Madhavan, Bernstein, Domingos,
80 J Intell Inf Syst (2007) 29:79–96
& Halevy, 2002; SciDI 2002; Stockinger, Rana, Moore, & Merzky, 2001), and advocates a
representational breakthrough before dealing with the engineering aspects of the data flow
between distributed and heterogeneous sources and analytical processes. After a description
of the conceptual framework, I will show how a software system can be efficiently designed
to allow an operational translation of this concepts that is by its own nature distributed and
web-enabled.
2 Approach
The framework I propose in this paper extends previous work on integration infrastructure
(Villa, 2001; Villa & Costanza, 2000) and is based on the fundamental epistemological
separation between an object of study and the process of its observation. Each object of
study can be associated to a concept and an observation context. The concept is a
formalization of the ontological nature of the object, and is immutable by definition. The
observation context defines all the aspects of an “observation window” such as temporal
and spatial extent and granularity, the classification schemata employed, the authors that
have reported the data, etc. The observation context defines a set of constraints whose
representation is not necessarily and not entirely fixed: representational aspects connected
to scaling, such as granularity and extent, can be manipulated by the observer without
modifying the nature (semantics) of the object. I argue that reflecting this fundamental
epistemological distinction in the representational model can be instrumental in developing
a more efficient semantics for natural system representation.
2.1 Formalizing the semantics of the object of study
Long-standing research in knowledge engineering has only recently started to percolate
down to the natural sciences. The semantic characterization of data sources is a long-
standing issue in knowledge representation, and much KR research has been motivated by
the need to apply uniform constraints to data sources independent on the specifics of their
representation (Doan, Madhavan, Domingos, & Halevy, 2002; Ives, Halevy, Mork, &
Tatarinov, 2004; Madhavan et al., 2002; SciDI 2002; Stockinger et al., 2001). On the other
hand, no workable strategies have been identified to allow for practical, seamless model
composition and communication, within an infrastructure that deals automatically with
conformance checking and the generation of transformations to mediate between different,
compatible representations.
With a renewed attention to semantics issues and naming problems, efforts that try to
match the concept incorporated in an object of study to a formally specified semantic type
are now becoming common, with the most activity occurring in the field of taxonomy and
biodiversity conservation (GBIF, URL; Stevenson, Haber, & Morris, 2003; TDWG, URL).
In most of these studies, the semantic type is a pointer into an explicit ontology, where the
knowledge is mapped to the terms of a controlled vocabulary and, in the best cases, a set of
attributes and relationships that link the terms of the vocabulary into a conceptual structure.
Going one step beyond, Ludaescher et al. (2001) define a semantic map for a set of
problems in neural transmission, and use it to query heterogeneous repositories of
conceptually related data sources. Projects such as SEEK (Michener et al., 2007; SEEK,
URL) and GEON (URL) are defining protocols and techniques to enable a semantically
explicit approach to ecological dataflows, capable of enforcing the consistency of semantic
J Intell Inf Syst (2007) 29:79–96 81
types along data paths as well as that of storage types, and to automatically insert
transformations to mediate compatible representations into a predefined workflow.
A semantic map, the structured equivalent of the set of keywords used traditionally to
characterize the semantics of stored datasets, can serve as a precious aid in browsing and
querying of knowledge bases, as it connects concepts in a meaningful way and lends itself
to powerful and intuitive forms of interactive graphical representation. Linked as it is to
disciplines and their interpretation, there can hardly be a requirement of uniqueness in the
semantic typing of an object: in most applications, an object can refer to several semantic
maps, but can only have one position in each.
For the purposes of this discussion, objects that share the same semantic type are
representations of the same concept. As a result they can be observed in the same way. The
semantic type defines unambiguously the aggregation properties of the object, the
elementary unit of measurement that can be applied to it, and the storage properties of
any measurement of its state.
2.2 Semantics and role of the observation context
Natural system science, and Ecology in particular, has long been concerned with issues of
scale, and with the effect of the scale of observation on the perceived properties of a system.
It is easy to understand the fundamental role of scaling when considering that the observers
are also the components of the systems under study, as is the case in highly integrative
Ecology. The realization that scaling is rooted in observation, as opposed to the inherent
semantics of the object of study, has been prominent, if often implicit, in ecological
literature for at least two decades (Allen & Starr, 1982).
Separating the semantics of the object of study from the aspects that pertain to its
observation can be the starting point of a new integrative synthesis in ecological knowledge
representation. To enable this, it is necessary to make a fundamental simplifying assumption:
that the observation context can be separated into orthogonal axes, each accounting for a
domain of observation that has well-defined semantics, methods, and interfaces.
In most cases, the multiplicity of states in a data source can be attributed to the
observation context, not to the semantic type. For example, timeseries data detail the
various states of a concept in a certain extent of time, viewed at a defined granularity. GIS
coverages specify different states in different portions of a given spatial extent. By
encapsulating the observation context of an object into separately characterized observa-
tional dimensions, we can design infrastructure that allows us to only use the semantic
types to assemble models and analytical procedures, concentrating on the bare conceptual
aspects and leaving the task of merging of the observation contexts of heterogeneous
knowledge sources to an automated mediating engine. The separation of the various axes of
observation into independently defined “observation domains”—such as space or time—is
key to the possibility of implementing such a mechanism in a modular and flexible way.
The observation context is as relevant to the analytical phase of the scientific workflow
as it is to the process of searching and retrieving knowledge from repositories. In fact,
predefining a semantic type and an observation “window” is equivalent to defining a query
on a knowledge base. The implications of using formally specified semantic maps to
perform queries (possibly by translating natural language interrogations or interactively
browsing a graphical knowledge map) have been extensively explored (e.g., Ives et al.,
2004; Ludaescher, Altintas, & Gupta, 2002). Once a concept is selected, a user can look for
all objects that express that concept in a particular setting of time, space, classification, or
82 J Intell Inf Syst (2007) 29:79–96
other observational domain. The retrieved objects can be returned unmodified or rescaled to
fit a user-specified extent or granularity. This applies intuitively to space and time, but may
apply to less obvious domains such as bibliographic source. As an example, if a knowledge
base contains the same concept measured at the same time and space by different authors, a
query may return both measures and their aggregated (average) measure if the granularity
and extent of the bibliographic source domain is not specified—i.e, no specific source was
requested. This would depend on having incorporated in the representational semantics of
the repository a formal definition of a bibliographic “dimension” of the observation context,
whose methods would be isomorphic with those used to aggregate over space and time.
In this framework, data can be thought of as the simplest representation of an object of
study, in which the measurements of a concept in a given observation context is known
directly in its numeric form. A system represented by data has a “natural” observation
context that is conventionally captured in the associated metadata. Its state can be observed
in a different context by transforming it (e.g. by aggregating, distributing or subsetting)
over the represented extents, or extrapolating it to a different extent.
A system represented by algorithmic knowledge (model) may be defined more or less
generally, from a completely abstract specification to one that depends on a particular time,
space, and scale. To access its states in one of the permissible observation contexts, they
need to be calculated.
2.3 Representation of models and analytical processes
Models, where the information necessary to produce the states is defined algorithmically,
can be expressed as a hierarchy of generic knowledge sources (modules) connected in a
dependency structure, where each module has a semantic type and can adopt a specified
observation window. The structural properties of the model do not depend on time, space or
other observation-related aspect; rather, the strategy to calculate its states and the mode of
visualization of its result depend on the semantics and nature of the composite observation
context implicit in the model and the data used as input.
Before states can be calculated across the model hierarchy, the observation contexts of
the components must be compounded into an overall context, their compatibility assessed,
and a strategy (composed of a set of transformations) defined to produce the states. I will
detail a software design implementing this concept in the following sections.
Building a model based on dependency and other semantically characterized relation-
ships, with a formally specified set of ontologies guiding the matching of inputs and
outputs, is an extension and a simplification over the common box-and-arrow representa-
tional paradigm adopted in many modeling toolkits. In some of these (e.g. Ptolemy, URL;
Simulink, URL) the connections reflect the data flow between processing steps, usually
implying a temporal sequence or a control hierarchy. Sometimes (e.g., STELLA: HPS,
1995; Costanza, Duplisea, & Kautsky, 1998) the interface reflects a more conceptual
approach, where connections reflect dependency and the types of the connected entities
reflects the way states are calculated (e.g., STELLA’s “stocks” and “flows”). In all these
applications, the “upper ontology” that defines the meaning of the entities and the
observation context is usually fixed and implicit. Sometimes, generic metaphors with no
semantic underpinning are provided that are able to simulate, although not represent,
aspects such as spatial distribution (e.g. SIMILE, URL).
In this paper, I advocate an approach to handling the complexities of natural system
representation that adopts a full conceptual specification based on extensible ontologies,
J Intell Inf Syst (2007) 29:79–96 83
and separates the description of the conceptual nature of the modeled entity from the
dataflow that calculates its states. One advantage of using a fully specified conceptual
description that includes the observation context in its semantics is that much control
flow (particularly the looping over multiple states due to time and space replication)
becomes unnecessary, and allows a system to automatically determine the proper
sequence of calculation of the states of a model, as well as the potential for parallel
calculation. Box-and-arrow dependency diagrams that reflect the concept, as opposed to
the dataflow, can be much more easily designed by non-technical users, particularly if
explicit semantic types aid the choosing and matching of entities to satisfy dependency
relationships.
The uniformity of representation between data and models has many advantages. Models
can be semantically characterized to represent analytical steps (such as GIS processing,
statistical analysis or function optimization) just as well as interpretive or predictive models
of natural phenomena. By virtue of semantic type propagation and composition across a
model structure, analysis steps acquire a semantics of their own and can become legitimate
components of other models. As an example, a GIS processing step may calculate the
fractal dimension of a surface. By representing the calculation step as a module and its
result as its state, the observational context of the original data is inherited by the fractal
dimension data, which maintain the temporal and spatial extents of the input map. At this
point, any further processing that uses the result as input will be able to use the information
to enforce proper design and correct coupling with other spatially- and temporally-explicit
data and models. The “metadata” in the resulting module will be in large part created
automatically by inheriting the observation context.
The observation context encapsulates much of the complexity that scientists have to deal
with when manipulating data and models, without getting in the way of conceptualizing and
analyzing. By separating the semantics of the observation into clean abstraction that do not
influence the semantic type, we can model natural systems using the same intuitive
language we use when conceptualizing.
Another strong property of this approach is the fact that a model can be defined without
any reference to a particular observational dimension, e.g. space, and used with data that
contain it. The calculation of, e.g., a difference equation model using spatially explicit data
as input would propagate the spatial nature of the input data across the model hierarchy and
make the model spatially explicit, without user intervention. This mechanism is detailed in
the following, where I will sketch an object-oriented interpretation of the concepts
expressed this far, meant to illustrate the translation of the approach into an operational
software design.
3 An ontology-driven object-oriented design: the Integrating Modelling Architecture
The most general representation of a system in a semantically explicit object-oriented
framework can be thought of as a set of interconnected modules, each corresponding to a
semantically characterized object of study. Great power and generality can be obtained by
adopting the semantics of the natural entities represented (e.g. economic value, biomass, or
nitrogen flow) as opposed to that of the execution workflow that calculates the desired
results. The declaration of each module can follow strictly the characterization of a set of
ontologies, which predefines a distribution relationship linking to an observation context
that encompasses all aspects connected to scaling, such as granularity and extent in space
84 J Intell Inf Syst (2007) 29:79–96
and time. The observation context can be manipulated by the investigator or by the system
when mediating across different, compatible representations used together.
This section deals with the definition of the fundamental module, including the set of
fundamental properties that a minimal upper ontology needs to define in order to enable the
behaviors outlined so far. The principles exposed here are incorporated in the most recent
design of the Integrating Modelling Architecture (IMA : Villa, 2001; IMA, URL), an open
source integrative architecture for natural system modeling. In this section I concentrate on
the conceptual design of the system. A brief description of the current implementation is
given in a later section of this paper.
3.1 Modules as generic knowledge sources
A module is a generic knowledge source, specified by a document in the XML/RDF
language (RDF, URL), and validated as an instance of a formal ontology (e.g. in OWL,
URL) accessible to an IMA runtime system. According to its semantic characterization,
each module can have a state belonging to a precisely identified storage type, such as
integer, floating point number, string, etc. Most modules of interest to natural system
modeling will contain numeric states. To be fully specified, the state must be given along
with the actual units of measurement employed, which must be compatible with the unit
class implied by the semantic type. The generic module is an abstract specification that fits
both data- and algorithm-specified sources of information. Data modules come with
predefined numeric states and require no further calculation, unless scaling transformations
need to be applied to modify their observation context (e.g. the spatial resolution) to fit an
application or a user request. Algorithmically defined modules (models) have additional
specification syntax that defines the algorithms and their dependencies on the state of other
modules, expressed directly or as queries on a generic or URI-identified dataspace.
The declaration of models reflects their conceptual identity and does not detail their
procedural characterization. This is a key feature to ensure streamlined, understandable
model structures that can be documented automatically and remain comprehensible to
users: as an example, the conceptual characterization of a spatio-temporal model will not
include loop constructs to calculate the different states of space and time, because those are
implicit in the way the conceptualization of time and space is expanded automatically by
the IMA runtime. The IMA infrastructure is capable of producing the sequence of
operations and transformations (workflow) that calculates the modules’ state, based of the
conceptual description. The declarative workflow can then be interpreted, or compiled and
executed in a conventional procedural language like C or Java.
The IMA implements an ontology-driven, extensible object system based on semantic
web-endorsed standards (OWL and RDFS at the time of this writing). New classes can be
added dynamically to the system by providing URLs to new ontologies and, if necessary,
implementing extension code in a compatible language (native C++ or other languages that
can interface to C). As an example, a DDE plug-in defines basic “stock” and “flow” classes,
and extension code to teach the runtime to execute the corresponding workflow, which
defines and integrates the difference equations implied by the concept. When the XML/
RDF specifications of a module are validated, the IMA can create an instance
implementation that is stored along with the instance, and can be specialized to performing
functions that depend on the class it represents.
Subclasses of the basic module class represent the data sources used in the system, from
data to models or wrappers around remote computation services. A key feature of the IMA
J Intell Inf Syst (2007) 29:79–96 85
is unlimited, uncoordinated extensibility of all aspects, from model and data types to
ontologies, storage back-ends, user interfaces, strategies of workflow execution, and
support for input and output data formats. Existing module classes (developed or in
development) include:
& “Wrapper” classes that interface to executable legacy applications and web services;
& Optimizing modules (based on genetic and hill-climbing algorithms) that optimize
goals stated by the user about the output of other models—e.g., to produce parameter
sets that maximize the fit between the model’s output and a specified dataset;
& An interface to the R statistical package (CRAN, URL) that allows complex statistical
operations to be semantically characterized with ontologies, becoming part of IMA
models;
& Modules that support dynamic difference equation models based on a stock and flow
metaphor, with import filters that translate models developed with popular modeling
packages such as STELLA (Costanza et al., 1998; HPS, 1995) or Simile (SIMILE,
URL);
& Import/export plug-ins that provide read and write interfaces data format such as ASCII
delimited and GIS coverages;
& Import plug-ins that allow modules to define their temporal, spatial and semantic
context by reading formally specified metadata standards such as ISO/TC 211 (ISO,
URL) and EML (PBI, URL).
3.2 Semantic typing, integration and mediation
By means of simple subsumption relationships or of multiple inheritance, the semantics
of any of the basic module classes (e.g. numeric data, flows, optimizers) can be
extended to represent actual natural—or otherwise significant—entities. In modules
whose state is defined algorithmically, a dependency graph is constructed and used at
the time of calculation, by analyzing the modules linked to it in relationships that
specialize the generic dependency relationship defined in the IMA upper ontology for
the base module class.
As an example, the “flow” class in the DDE/STELLA import package is normally not
used as is, but as part of a logical intersection that makes it represent a flow of, e.g.,
nitrogen. The “flow” identity tells the IMA engine how to calculate of the state of the flow
through integration and defines a mandatory dependency on time (which also allows
checking for correct units of measurement). The “nitrogen” semantic extension from, e.g.,
an ecological process ontology, enables the enforcement of semantic integrity and reasoning
on the overall model, allowing substitutability of dependencies having compatible semantic
types and functional definitions.
The compatibility of storage type and elementary units of measurement is guaranteed by
the definition of semantic type, and by the mapping implemented in the IMA between
instance implementation and semantic types. While the state of a module can have multiple
values in a given observation context, a module’s state is conceptually always atomic: it
does not hold information about its multiplicity, as this it not a stable property of the object,
being entirely dependent on the observation context. If initial data are available, they’re
merely used to define a default state when the object is observed through its “native”
observation window. No concept of array or matrix is necessary in the whole system:
multiplicity does not correspond to an observational characteristic of the states of natural
86 J Intell Inf Syst (2007) 29:79–96
entity, and complex, multistate objects are best represented through the composition of
modules with separated, connected identities.
As a result of this conceptualization, a model that (e.g.) uses available grass biomass and
temperature to determine the increase in body weight in an organism can be modified to
take the temperature indifferently from a timeseries or a complex global change model, as
long as the “temperature” identity and the relevant observation context (such as space and
time: see below) are compatible. Also, because objects adopting a particular domain are
compatible with objects that do not adopt it (unless specifically prohibited by the relative
ontology), it is possible to make (e.g.) a non-spatial model spatially explicit by linking a
parameter or data source that adopts space: the domain will be propagated to the whole
model during contextualization (see Section 3.4.1).
A containment relationship is also defined for modules and can be subclassed in derived
classes to identify its precise meaning for a particular semantic type. A set of modules may
result as the effect of a containment relationship. In this case, the state of a module that
contains other modules may be defined, according to its semantic type, as the union or the
aggregation of the states of its components. As an example, individual-based models can
contain modules that represent different properties such as body weight, age, temperature
(Fig. 1): such properties have a well defined semantic type of their own, but they only make
sense in the context of the individual. It must be noted that in such cases, the contained
modules cannot exist alone: in other words, the semantic of the submodules is defined
“hierarchically” in terms of their relationship with the containing module.
A specialized containment relationship specifies the aggregation of similar components.
For example, a population can be defined in terms of the individuals that compose it. In this
case, the individuals’ states can be automatically aggregated into the population’s (e.g., the
total biomass will be the sum of individual body mass), and additional semantics can be
Fig. 1 An hypothetical model hierarchy and its internal relationships. Boxes represent modules and
containment relationships. The solid arrows mean dependency, the dotted arrows mean aggregation by
containment, and the dash-and-dot arrows mean inheritance or compounding of a set of domains
J Intell Inf Syst (2007) 29:79–96 87
given to account for properties that only appear as a result of the aggregation (emergent
properties), such as the age structure. One of the most useful functions enabled by an
explicit semantic characterization is the “smart aggregation” of data sources, which allows
(e.g.) retrieved data to be aggregated and compared meaningfully by automatically placing
non-conformant data (e.g. calculated with different methods) in separate groups, and
automatically transforming compatible representations within a group (e.g. data expressed
in different measurement units, or maps recorded at different resolutions in the same
geographic region) in order to allow aggregation of their values.
3.3 Domains: an object-oriented translation of the observation context
The observation context is represented in each module as a set of independently defined
objects called domains, which can only exist in connection with a module, linked to them
by a state distribution relationship. Each domain accounts for one “axis” of the observation
context: e.g., space or time. Each domain specifies all the necessary information about the
corresponding concept in the semantics of the observation: e.g., in a “discrete time” domain
the specification syntax requires a start time, an end time, and the duration of a step.
Modules adopt domains from their original XML/RDF specifications or by inheriting them
from the modules they are linked to in any dependency relationship. Adopting a domain
with a single step (multiplicity=1) defines the extent of existence in that domain: e.g. the
time period where a data object has the stored value. Adopting a domain that specifies more
that one time step determines a multiplicity of states in time for the module, and should be
matched by appropriately defined input data. At the same time, the module may adopt a
space domain defined through a set of polygons or raster cells covering a specified extent,
and possibly loaded from a GIS coverage. The full state of each module is the Cartesian
product of the set of states implied by each domain, and the total multiplicity of its state is
the product of the multiplicities attributable to each domain.
The set of all domains adopted is the module’s observation context. In the IMA object-
oriented implementation, domains are polymorphic, and their associated methods can
calculate, merge, and morph across different representations of the same domain (e.g.
rasters, polygons) using methods and techniques tailored to the specific nature of the
domain and its representation. A domain’s abstract model is defined generally and precisely
in terms of granularity and extent, and new classes of domains can be defined by deriving
representations of the granularity and extent that fit the domain, and providing an interface
to them in the terms required by the abstract specification.
Most sources of multiplicity in a concept’s state can be encapsulated into domains. For
example, a bibliographic source domain can be devised that gives an object different states
according to the source or author that has published their value. In this case, the granularity
is the number of different sources that contain different values of the object, and the extent
is the set of sources.
In the example of Fig. 1, a population module aggregates a number of individual
modules. By virtue of the aggregation relationship, the body mass of the individual
aggregates into the population biomass automatically, since the population class is derived
from the individual class, and the biomass semantic type knows the proper aggregation type
for a containment relationship. The individual growth depends on nutrient availability and
temperature, which are linked from external modules. The individual model does not adopt
domains, but time and space are inherited from the first module in the dependency chain (e.g.,
temperature) and compounded with all others. This way, the compatibility of the time and
88 J Intell Inf Syst (2007) 29:79–96
space domains adopted by the individuals is assessed through the individual class. The
containment relationship makes the population adopt the common observation context of the
individuals, which in turn comes from the compounded nutrient data and climate change
model. Using data for temperature and a model for nutrients would not change the mechanism
or the interface for a user who builds the model.
New domains can be devised that are capable of determining and enforcing
compatibility of more sophisticated aspects. For example it is possible, although hard to
do at the present state of knowledge, to design an ecological domain that will enable the
selection of only prey species that are known to be preyed upon by a specific predator once
the predator is selected. The concept is general enough to accommodate most design
problems. The modular nature of the IMA allows users to develop and add support for new
domains in an uncoordinated, flexible way.
This use of domain objects for mediation of semantics and methods is conceptually
related to the field of aspect-oriented programming (Grundy, 2000), a technique that allows
to modularize cross-cutting aspects of a system. Nevertheless, the IMA ideas did not evolve
with aspect-oriented programming in mind and the system does not employ the technique in
its software infrastructure.
3.4 Operations on a module hierarchy
To be useful, an implementation must be able to produce all states of a concept in the
defined observation context. This is accomplished in the IMA by two fundamental
operations defined on the module, which comprehend the main functionalities of the
infrastructure and are the key to all uses of the conceptualization presented here. Figure 2
represents a sketch of the operations in the overall IMA approach.
During contextualization, an overall observation context is defined, either by the user or
as the compounded observation context of all the modules; during this phase, the
Fig. 2 Flowchart of the contextualization and domainization processes in the IMA
J Intell Inf Syst (2007) 29:79–96 89
compatibility between linked modules is assessed, and a high-level transformation and
calculation strategy to produce the states is defined;
During domainization, the high-level strategy is passed to a software engine that carries
it on and produces the states of all modules in the global observation context.
The states resulting from domainization can be visualized according to the semantics of
the observation context. The rest of this section explains the two operations and how
module and domains are used to carry them on.
3.4.1 Contextualization
The overall observation context over a hierarchy of modules is defined by compounding the
domains adopted by the modules in bottom-up order across the chain of dependencies and
the containment structure of the model hierarchy. A module is exposed to all the domains of
all modules it depends on or contains. Different actions are taken according to whether the
compounding module originally adopts the domain or not. If module M1 depends on
module M2, and module M2 adopts domain d, the two possible actions are:
& If M1 does not adopt domain d from its original specifications, it adopts a copy of
domain d from the linked module. For example, a non-spatial equation becomes spatial
by adopting a spatial operand; its state will be replicated to cover the whole multiplicity
of d, and the equation will be calculated the same number of times with all the different
values of M2 in d, in the order specified by ordering rules specific to domain d’s class.
& If M1 adopts d from its original specifications, the domain in M1 is compounded with
the domain of the same class in M2. The operation of compounding involves calls to
domain d’s interface methods to asses the compatibility of extent and granularity
between the two domains, and if compatible, the generation of a transformation that
can compute a minimum common denominator representation. The transformation, if
any, is memorized as part of the overall link strategy, and the common representation is
memorized in d and carried over to the next level.
If module M1 adopts d and M2 does not, M2 is considered domain-neutral with respect
to d, and its state will be used untransformed (with the possible exception of unit
conversion) to calculate all states of M1.
If the contextualization process fails because of domain incompatibility, an error is
generated and the operation is interrupted. If the operation is successful, it produces the overall
observation context of the model hierarchy, and a link strategy represented by a set of
transformations that, carried out by an appropriate calculation engine, will “filter” the states of
the dependent modules and reduce them to the same observation context of the requiring ones.
After the bottom-up domain compounding phase, a second pass is done to expose the
whole hierarchy to the newly calculated overall context, this time top-down. This step has
the purpose of defining partially defined domains using the overall context to provide
defaults. It is common that algorithmically defined modules are defined very generally,
without a precise statement of extents and granularities (although they may contain specific
extents in order to prevent application to situations where they have been proved not to
apply). In such cases, the top-down inheritance of domain properties has the role of
defining the missing information, thus preparing the modules for calculation.
The compounded context in the root module is the overall view of all the axis of the
observation context defined across the dependency hierarchy, and is defined as the natural
context of the module. The same process that is used during linking to contextualize a
90 J Intell Inf Syst (2007) 29:79–96
model in the context of another can be used to impose a user-defined observation context.
When the overall context is defined, all modules know precisely their state storage
requirements, and the system knows the transformation strategy and the precise ordering in
which the states should be calculated. The contextualization of a single data source
produces an empty strategy. The overall observation context represents the compounded
concept of space, time, and other domains across the whole model. This phase flags any
incompatibility and defines the context transformations, if any, that will be inserted in the
dataflow.
The concept of conformance between connected data sources is crucial to enabling
recomposition and recontextualization of models. A simple example is aggregation, which
requires non-trivial choices of algorithm (e.g. point attributes like temperature are
aggregated differently than distributed quantities like biomass) and must ensure that, e.g.,
quantities measured with incompatible protocols are not combined. For all its algorithmic
simplicity, the problem goes far beyond the identity constraint of “apples and oranges” that
could be addressed by a linear hierarchy of types, or the relatively simple problem of unit
conversion. In fact, it is merely a special case of the generalized conformance problem in
model composition, which requires all common properties and observation contexts (like
space and time) to be compatible for the stated purposes before modules can be aggregated
or substituted. Conformance in model composition is a facet of the general problem of data
integration and mediation (Gupta, Ludaescher, & Martone, 2000; SciDI, 2002; Stockinger
et al, 2001) that has been tackled with ontology-based approaches (Ludaescher, Gupta, &
Martone, 2001; 2002). The IMA uses ontologies and supporting algorithms to ensure
conformance along data paths, inserting transformations into the calculation sequence when
necessary, e.g. to translate between compatible but different space representations. The
important realization that conformance depends on the purposes, and may be defined in
more or less stringent ways according to user priorities, is taken care of in the IMA by the
adoption of conformance policies, formally defined, purpose-specific strategies with user-
modifiable parameters that can be defined to apply to specific classes of models and
operations on models.
3.4.2 Domainization
If the process of contextualizing a model hierarchy produces the overall observation context
and a strategy to produce the modules’ states, the process of domainization uses that
strategy to produce the states that are implied by the overall context. This may require
calculating states when the knowledge base is described algorithmically, and applying
scaling transformations when the same domain is present at different granularities or extents
throughout the hierarchy of modules.
Domainization is the equivalent of running a model in the conventional sense, an can be
accomplished in several ways. In the IMA, the domainization phase produces a workflow in
declarative form, and passes its definition to a configurable workflow compiler or
interpreter that can either execute it, or translate it to a procedural language such as C++ or
Java, or to a further declarative specification for a workflow environment such as Ptolemy
(Ptolemy, URL).
Separating the contextualization and domainization phases allows a clean design where
the domainization strategy is calculated independently and expressed in a high-level
representation which is later fed to a “domainization engine” that is capable of carrying it
on optimally, using distributed parallel processing when possible and available. Web
J Intell Inf Syst (2007) 29:79–96 91
services provide a promising platform to enable a clean separation of the different
processing stages components of such a system. When the knowledge source contains
algorithmic specifications, the contextualization process, informed by the specifications
linked to the module classes adopted, declares a workflow that is capable of producing the
desired states and integrating data from compatible sources, composed of functional
operators and context transformations. Transformations can consist in changes of
representation (e.g. rasterization of polygon maps), aggregation or propagation of data
across different extents, unit translation and storage type conversion.
The domainization phase starts with a topological sort of the dependency graph
(assessing the potential for parallelization) and calculates states for all modules, in
dependency order, along the finest granularity of each domain in the overall observation
context. The order of calculation is chosen accordingly to domain-specific rules, as some
domains such as time imply an irreversible sequence of states while others (such as space)
do not implicitly require that, but may have internal dependencies (e.g. when representing
flows in space) that require a specific ordering of calculation of different states within the
domain.
The workflow is defined in terms of an extensible library of operators or actors, declared
with the main functional module classes. The generated workflow also contains all
transformation defined in the contextualization phase. The high-level representation of the
transformation strategy is suitable to independent optimization, and can be stored or cached
as necessary to speed repeated calculations in the same observation context. An important
property of a well-defined transformation strategy is the ability of estimating in advance the
loss of accuracy that the domainization process will cause compared to the use of
untransformed data. This feature is extremely important in any integration architecture,
since error propagation is even more of an issue when the output of an analytical process
can be readily used as input for another, causing potentially infinite propagation of error.
Estimates of accuracy can be permanently carried in the resulting modules’ data model and
influence the confidence that users should put in the results.
No matter how it is carried out, the domainization process produces a separate
module hierarchy whose modules contain all states implied by the context, and a copy
of all the domains after the contextualization step, but no algorithm specifications. In
other words, the result is a hierarchy composed of data modules only, where the
dependency relationship in the original module is substituted by containment so that the
original structure is still recognizable. These “result modules,” represented in XML/RDF
just like the original model hierarchy, can be independently visualized and saved to
permanent storage.
3.4.3 Visualization
While the IMA does not mandate any standard for visualization, the observation context
of each module is usually sufficient to determine the proper way to visualize the state
of each module. For example, the state of a module with multiple states in both time
and space is best represented as an animation of maps, while the state of a module that
only has multiple numeric states in time is typically represented as a line graph. The
visualization engine uses the popular MIME types used by browsers and user interfaces
to map a set of states in a particular context to a given MIME type, and invokes a third
party plug-in, if present, to generate the corresponding representation (possibly handled
through an external visualization program).
92 J Intell Inf Syst (2007) 29:79–96
3.4.4 Persistent distributed storage, self-documentation and web deployment of modules.
The IMA defines a generalized, distributed permanent storage interface that can be
implemented on top of existing storage back-ends and data retrieval web services. The
interface uses a uniform internal query language similar to RDQL (RDQL, URL) used in
several ways in the system.
The IMA runtime is capable of dispatching a query to one or more repositories,
identified through a URL whose protocol identifier specifies the implementation of the
storage interface. As an example, an URL using the “pg:” protocol identifier specifies that
the relative repository is implemented on top of a PostgreSQL, (URL) database, and must
be handled by the PostgreSQL interface plug-in, which translates queries into SQL,
enriched with robust spatial operators and others. Other implementations (corresponding to
different protocol identifiers) can translate the query into XQuery (XQUERY, URL) and
dispatch it to an XML database, or into the SEEK EcoGrid query language (Michener et al.,
2004) and interface to an EcoGrid service. This mechanism provides an easy bridge to
online query services as well as the capability of supporting local repositories based on a
preferred back-end.
The generic storage interface takes care of returning query results to the IMA in a
consistent format that allows merging results. The IMA can declare, along with specific
repositories, the ontologies needed to validate and reason on their contents, and load them
automatically as the repository is accessed. Each individual data item is specified in the
IMA by the URL of its repository followed by the fragment that identifies the instance in it,
following established RDF/OWL conventions for concept identification.
3.4.5 Role of the IMA in assisting user interaction
The IMA ontology-driven architecture can automatically define and enforce a discipline in
creating meaningful models when its principles are extended to the user interface.
Recontextualization of a retrieved model can be assisted by the software by dynamically
restricting the view of the knowledge base presented to the user to only search content that
conforms semantically to model components being substituted. As new modules are
inserted in a model structure (e.g. modifying an input parameter with one from a different
geographic context), the overall observation context can be recalculated, and the the search
range for subsequent substitutions can be restricted to only retrieve data that are conformant
(as defined above) with the new overall context. This mechanism prevents meaningless
models to be constructed without placing the burden of integrity checking on the user.
Another important property is that the semantic integrity of the result is known. While
conformance constraints can be selectively loosened by the user to explore hypothetical,
unrealistic scenarios, no models that violate any conformance constraints will be a suitable
candidate for submission to the public data base. An IMA-powered interface can handle all
these checks directly and automatically.
3.4.6 A prototype IMA implementation: the Integrating Modelling Toolkit
An open-source prototype implementation of the principles illustrated above, the
Integrating Modelling Toolkit (IMT), is available on the World Wide Web (IMA, URL).
Despite its prototype stage, the IMT is being actively used in database and modeling
projects. The IMT prototype is written in a modular fashion using policy-based design
J Intell Inf Syst (2007) 29:79–96 93
(Alexandrescu, 2001). This allows the runtime behavior to be customized in many ways.
As an example, it is possible to create a IMT runtime that operates as a command-line
application or as a threaded server by changing one line of code. Critical system
components such as the XML parsing engine, the permanent storage interface, or the
support for multiple concurrent sessions can be customized in the same way. To interact
with a IMT runtime that is running as a server, a generic client software is also available
that can be customized to suit different modes of interaction. A specialized client program
operates following the Common Gateway Interface (CGI) conventions and communicates
results through HTML, giving full access to the functionalities of the IMT server through a
web browser. This approach is being currently used to develop two projects, sponsored by
the US National Science Foundation:
& The Ecosystem services database (ESD, URL; Villa et al, 2002), a web-accessible
database integrating data about the economic valuation of ecosystem services, the
models that produce the values and allow their projections in the future, and the
valuation methods themselves as models, allowing users to apply valuation methods to
different data as the database grows.
& An integration of the existing African Mammals Databank (AMD, URL) and the
pertaining entries in the IUCN Red List of threatened species, coupled with spatial data
and predictive models, as a proof of concept in integrating data and predictive models
in web-accessible databases.
The IMT can be easily extended with new classes of modules and domains that can
support advanced functionalities. A major strength of the system is its ability to use and
integrate the great amount of existing general-purpose open source libraries to achieve
specific goals.
4 Perspectives
The IMA provides a semantic framework and a software infrastructure that unifies
commonly separated entities and allows interoperability of independently developed
representations of the natural world. The overall design principles have the ultimate
purpose of enabling working with data and concepts using the same language that we use to
think about phenomena and entities. Another fundamental goal is that any transformation
can take place with known accuracy, and an estimate of the error implied by each
transformation carried out is always available.
The proposed conceptual framework can have a direct effect on scientific creativity by
removing many impediments to integration and testing of ideas, and producing faster
feedback between conceiving ideas and testing results. IMA-enabled databases are ideal for
intuitive and safe exploration of complex data and models.
I argue that through this and other projects that are currently operating to extend the
semantic awareness of natural systems research, we are nearing a switch in perspective and
a shift in language that has the potential of getting rid of many artificial distinctions that
currently clutter our vision of the concepts and prevent efficient and precise modeling of
natural entities and phenomena. As an example, ecology has long been concerned with
concepts like “modeling paradigms”, whose boundaries have rarely been crossed: “process-
based models” and “individual-based models”, to mention only two of the most popular,
have traditionally been well-separated areas of investigation (Villa, 1992). I argue that this
94 J Intell Inf Syst (2007) 29:79–96
can be as much the result of weak semantics as an actual difference in approach. A
representational framework that embodies a sufficiently expressive concept of scale has the
potential of making many of these differences disappear. As an example, Fig. 1 depicts a
completely consistent model hierarchy, which contains both individual-based modules and
traditionally process-based ones. We may be on the eve of developing new, simple
representations that can encompass scales, representational paradigms and architecture-
induced constraints and serve as a sound base for a semantic reorganization of the natural
world which is computationally practical.
Acknowledgements The author acknowledges the generous support of the National Science Foundation,
with grants 0243957 (Biological Database and Informatics), 0243962 (Biodiversity and Ecosystem
Informatics) and 0225676 (ITR-SEEK). Many people have contributed to the development of the concepts
expressed here. Among these, I must mention at least Serguei Krivov and the many participants to the SEEK
project.
References
Alexandrescu, A. (2001). Modern C++ design: Generic program and design patterns applied. New York,
NY: Addison-Wesley.
Allen, T. F. H., & Starr, T. B. (1982). Hierarchy: Perspectives for ecological complexity. Chicago, IL:
University of Chicago Press.
AMD (URL). The african mammals databank. Internet: http://gorilla.bio.uniroma1.it/amd.
Argonne National Laboratories (URL). Review of the Dynamic Information Architecture System (DIAS).
Internet: http://www.dis.anl.gov/DEEM/DIAS.
Costanza, R., Duplisea, D., & Kautsky, U. (1998). Ecological modelling and economic systems with
STELLA Introduction. Ecological Modelling, 110, 1–4.
CRAN (URL). The comprehensive R archive network. Internet: http://www.ci.tuwien.ac.at/R.
DMSO (URL). DoD high level architecture. Internet: http://www.dmso.mil/projects/hla.
Doan, A., J. Madhavan, J., Domingos, P., & Halevy, A. Y. (2002). Learning to map between ontologies on
the semantic web. In Proceedings of the eleventh international conference on World Wide Web, May
07–11, Honolulu, Hawaii, USA.
ESD (URL). The ecosystem services database. Internet: http://esd.uvm.edu.
Fishwick, P. (1995). Simulation model design and execution: Building digital worlds. Upper Saddle River,
NJ: Prentice Hall.
Fritzson, P., & Engelson, V. (1998). Modelica—A unified object-oriented language for system modelling and
simulation. In Proceedings of European Conference on Object-Oriented Programming (ECOOP98),
Brussels, July 20–24, 1998. Internet: http://citeseer.nj.nec.com/fritzson98modelica.html.
GBIF (URL). Global biodiversity information facility. Internet: http://www.gbif.org.
GEON (URL). GEON Cyberinfrastructure for the geosciences. Internet: http://www.geongrid.org.
Grundy, J. C. (2000). Multi-perspective specification, design and implementation of software components
using aspects. International Journal of Software Engineering and Knowledge Engineering, 20(6).
Gupta, A., Ludaescher, B., & Martone, M. E. (2000). Knowledge-based integration of neuroscience data
sources. In 12th Intl. Conference on Scientific and Statistical Database Management (SSDBM), pp. 39–
52. Berlin, Germany: IEEE Computer Society.
HPS (1995). STELLA User’s manual. High performance systems.
IMA (URL). Integrating modelling architecture home page. Internet: http://www.integratedmodelling.org.
ISO (URL). ISO/TC211 Geographic information metadata standard. Internet: http://www.isotc211.org.
Ives, Z. G., Halevy, A. Y., Mork, P., & Tatarinov, I. (2004.) Piazza: Mediation and integration infrastructure for
Semantic Web data. Web Semantics: Science, Services and Agents on the World Wide Web, 2, 155–175.
Ludaescher, B., Altintas, I., & Gupta, A. (2002). Time to leave the trees: From syntactic to conceptual
querying of XML. In Intl. Workshop on XML data management, in junction with Conference on
Extending Database Technology (EDBT). Prague, March 2002.
Ludaescher, B., Gupta, A., & Martone, M. E. (2001). Model-based mediation with domain maps.
Proceedings 17th Intl. Conference on Data Engineering (ICDE), Heidelberg, Germany.
J Intell Inf Syst (2007) 29:79–96 95
Madhavan, J., Bernstein, P. A., Domingos, P., & Halevy, A. Y. (2002). Representing and reasoning about
mappings between domain models. Proceedings of the Eighteenth National Conference on Artificial
Intelligence (pp. 80–86). Edmonton, Alberta, Canada.
Michener, W. K., Beach, J. H., Jones, M. B., Ludaescher, B., Pennington, D. D., et al. (2007). A
knowledge environment for the biodiversity and ecological sciences. Journal of Intelligent Information
Systems, in this issue.
Minar, N., Burkhart, R., Langton, C., & Askenazi, M. (1996). The swarm simulation system: A toolkit for
building multi-agent simulations. Santa Fe Institute Working Paper 96-06-042.
Mosterman, P., & Vangheluwe, H. L. (2000). Computer automated multi paradigm modeling in control
system design. In A. Varga (Ed.), IEEE International Symposium on Computer-Aided Control System
Design, 65–70. Anchorage, Alaska; IEEE Computer Society Press.
OWL (URL). OWL Web Ontology Language Guide W3C Recommendation 10 February 2004. Internet:
http://www.w3.org/TR/owl-guide.
PBI: Partnership for Biological Informatics (URL). Ecological metadata language (EML). Internet: http://
www.ecoinformatics.org/software/eml.
PostgreSQL (URL). PostgreSQL home page. Internet: http://www.postgresql.org.
Ptolemy (URL). The Ptolemy project. Internet: http://ptolemy.eecs.berkeley.edu.
RDF (URL). Resource Description Framework (RDF). Internet: http://www.w3.org/RDF.
RDQL (URL). RDQL—A Query Language for RDF W3C Member Submission 9 January 2004. Internet:
http://www.w3.org/Submission/RDQL/.
SciDI: SEMANTIC MEDIATION IDENTIFIED AS APPROACH TO SCI DATA INTEGRATION (2002).
Scientific Data Integration Panel, Intl. Conf. On Extending Database Technology (EDBT), Prague,
March 2002.
SEEK (URL). Science Environment for Ecological Knowledge (SEEK). Internet: http://seek.ecoinformatics.
org.
SIMILE (URL). Simulistics home page. Internet: http://www.simulistics.com.
Simulink (URL). Mathworks home page. Internet: http://www.mathworks.com.
Stevenson, R. D., Haber, W. A., & Morris, R. A. (2003). Electronic field guides and user communities in the eco-
informatics revolution. Conservation Ecology, 7(1), 3. Internet: http://www.consecol.org/vol7/iss1/art3.
Stockinger, H., Rana, O., Moore, R., & Merzky, A. (2001). Data management for grid. Environments, High
Performance Computing and Networking (HPCN 2001), Amsterdam, NL, June 2001.
TDWG (URL). International working group on taxonomic databases. Internet: http://www.tdwg.org.
Vangheluwe, H. L., Kerckhoffs, E. J. H., & Vansteenkiste, G. C. (2001). Computer automated modelling of
complex systems. In E. J. H. Kerckhoffs, & M. Snorek (Eds.), 15th European Simulation Multi-conference
(ESM), 7–18. Prague, Czech Republic; Society for Computer Simulation International (SCS).
Villa, F. (1992). New computer architectures as tools for ecological thought. Trends in Ecology and
Evolution, 7, 179–183.
Villa, F. (2001). Integrating modelling architecture: A declarative framework for multi-scale, multi-paradigm
ecological modelling. Ecological Modelling, 137, 23–42.
Villa, F., & Costanza, R. (2000). Design of multi-paradigm integrating modelling tools for ecological
research. Environmental Modelling and Software, 15, 169–177.
Villa, F., Wilson, M. A., DeGroot, R., Farber, S., Costanza, R., & Boumans, R. M. J. (2002). Design of an
integrated knowledge base to support ecosystem services valuation. Ecological Economics, 41, 445–456.
XQUERY (URL). XQuery 1.0: An XML query language. W3C Working Draft 12 November 2003. http://
www.w3.org/TR/xquery.
96 J Intell Inf Syst (2007) 29:79–96
Reproduced with permission of the copyright owner. Further reproduction prohibited without permission.

More Related Content

What's hot

New prediction method for data spreading in social networks based on machine ...
New prediction method for data spreading in social networks based on machine ...New prediction method for data spreading in social networks based on machine ...
New prediction method for data spreading in social networks based on machine ...TELKOMNIKA JOURNAL
 
IRJET- Automated Document Summarization and Classification using Deep Lear...
IRJET- 	  Automated Document Summarization and Classification using Deep Lear...IRJET- 	  Automated Document Summarization and Classification using Deep Lear...
IRJET- Automated Document Summarization and Classification using Deep Lear...IRJET Journal
 
Volume 2-issue-6-1969-1973
Volume 2-issue-6-1969-1973Volume 2-issue-6-1969-1973
Volume 2-issue-6-1969-1973Editor IJARCET
 
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)IJERD Editor
 
Lloyd Swarmfest 2010 Presentation
Lloyd   Swarmfest 2010 PresentationLloyd   Swarmfest 2010 Presentation
Lloyd Swarmfest 2010 Presentationkalloyd
 
Protein-protein interactions-graph-theoretic-modeling
Protein-protein interactions-graph-theoretic-modelingProtein-protein interactions-graph-theoretic-modeling
Protein-protein interactions-graph-theoretic-modelingRangarajan Chari
 
Tools for Ontology Building from Texts: Analysis and Improvement of the Resul...
Tools for Ontology Building from Texts: Analysis and Improvement of the Resul...Tools for Ontology Building from Texts: Analysis and Improvement of the Resul...
Tools for Ontology Building from Texts: Analysis and Improvement of the Resul...IOSR Journals
 
Case-Based Reasoning for Explaining Probabilistic Machine Learning
Case-Based Reasoning for Explaining Probabilistic Machine LearningCase-Based Reasoning for Explaining Probabilistic Machine Learning
Case-Based Reasoning for Explaining Probabilistic Machine Learningijcsit
 
Collnet _Conference_Turkey
Collnet _Conference_TurkeyCollnet _Conference_Turkey
Collnet _Conference_TurkeyGohar Feroz Khan
 
Collnet turkey feroz-core_scientific domain
Collnet turkey feroz-core_scientific domainCollnet turkey feroz-core_scientific domain
Collnet turkey feroz-core_scientific domainHan Woo PARK
 
Automatically Generating Wikipedia Articles: A Structure-Aware Approach
Automatically Generating Wikipedia Articles:  A Structure-Aware ApproachAutomatically Generating Wikipedia Articles:  A Structure-Aware Approach
Automatically Generating Wikipedia Articles: A Structure-Aware ApproachGeorge Ang
 
The Advancement and Challenges in Computational Physics - Phdassistance
The Advancement and Challenges in Computational Physics - PhdassistanceThe Advancement and Challenges in Computational Physics - Phdassistance
The Advancement and Challenges in Computational Physics - PhdassistancePhD Assistance
 
Bayesian network-based predictive analytics applied to invasive species distr...
Bayesian network-based predictive analytics applied to invasive species distr...Bayesian network-based predictive analytics applied to invasive species distr...
Bayesian network-based predictive analytics applied to invasive species distr...Wisdom Dlamini
 
A preliminary survey on optimized multiobjective metaheuristic methods for da...
A preliminary survey on optimized multiobjective metaheuristic methods for da...A preliminary survey on optimized multiobjective metaheuristic methods for da...
A preliminary survey on optimized multiobjective metaheuristic methods for da...ijcsit
 
Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...
Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...
Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...Sarvesh Kumar
 
Ontology-based Data Integration
Ontology-based Data IntegrationOntology-based Data Integration
Ontology-based Data IntegrationJanna Hastings
 

What's hot (19)

New prediction method for data spreading in social networks based on machine ...
New prediction method for data spreading in social networks based on machine ...New prediction method for data spreading in social networks based on machine ...
New prediction method for data spreading in social networks based on machine ...
 
Drijvers et al_two_lenses
Drijvers et al_two_lensesDrijvers et al_two_lenses
Drijvers et al_two_lenses
 
IRJET- Automated Document Summarization and Classification using Deep Lear...
IRJET- 	  Automated Document Summarization and Classification using Deep Lear...IRJET- 	  Automated Document Summarization and Classification using Deep Lear...
IRJET- Automated Document Summarization and Classification using Deep Lear...
 
Volume 2-issue-6-1969-1973
Volume 2-issue-6-1969-1973Volume 2-issue-6-1969-1973
Volume 2-issue-6-1969-1973
 
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)
 
Lloyd Swarmfest 2010 Presentation
Lloyd   Swarmfest 2010 PresentationLloyd   Swarmfest 2010 Presentation
Lloyd Swarmfest 2010 Presentation
 
Summary2 (1)
Summary2 (1)Summary2 (1)
Summary2 (1)
 
Protein-protein interactions-graph-theoretic-modeling
Protein-protein interactions-graph-theoretic-modelingProtein-protein interactions-graph-theoretic-modeling
Protein-protein interactions-graph-theoretic-modeling
 
Tools for Ontology Building from Texts: Analysis and Improvement of the Resul...
Tools for Ontology Building from Texts: Analysis and Improvement of the Resul...Tools for Ontology Building from Texts: Analysis and Improvement of the Resul...
Tools for Ontology Building from Texts: Analysis and Improvement of the Resul...
 
Case-Based Reasoning for Explaining Probabilistic Machine Learning
Case-Based Reasoning for Explaining Probabilistic Machine LearningCase-Based Reasoning for Explaining Probabilistic Machine Learning
Case-Based Reasoning for Explaining Probabilistic Machine Learning
 
Collnet _Conference_Turkey
Collnet _Conference_TurkeyCollnet _Conference_Turkey
Collnet _Conference_Turkey
 
Collnet turkey feroz-core_scientific domain
Collnet turkey feroz-core_scientific domainCollnet turkey feroz-core_scientific domain
Collnet turkey feroz-core_scientific domain
 
Automatically Generating Wikipedia Articles: A Structure-Aware Approach
Automatically Generating Wikipedia Articles:  A Structure-Aware ApproachAutomatically Generating Wikipedia Articles:  A Structure-Aware Approach
Automatically Generating Wikipedia Articles: A Structure-Aware Approach
 
The Advancement and Challenges in Computational Physics - Phdassistance
The Advancement and Challenges in Computational Physics - PhdassistanceThe Advancement and Challenges in Computational Physics - Phdassistance
The Advancement and Challenges in Computational Physics - Phdassistance
 
Research Proposal
Research ProposalResearch Proposal
Research Proposal
 
Bayesian network-based predictive analytics applied to invasive species distr...
Bayesian network-based predictive analytics applied to invasive species distr...Bayesian network-based predictive analytics applied to invasive species distr...
Bayesian network-based predictive analytics applied to invasive species distr...
 
A preliminary survey on optimized multiobjective metaheuristic methods for da...
A preliminary survey on optimized multiobjective metaheuristic methods for da...A preliminary survey on optimized multiobjective metaheuristic methods for da...
A preliminary survey on optimized multiobjective metaheuristic methods for da...
 
Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...
Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...
Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...
 
Ontology-based Data Integration
Ontology-based Data IntegrationOntology-based Data Integration
Ontology-based Data Integration
 

Similar to A semantic framework and software design to enable the transparent integration, reorganization and discovery of natural systems knowledge

ICDMWorkshopProposal.doc
ICDMWorkshopProposal.docICDMWorkshopProposal.doc
ICDMWorkshopProposal.docbutest
 
Automatically converting tabular data to
Automatically converting tabular data toAutomatically converting tabular data to
Automatically converting tabular data toIJwest
 
SEMANTIC INTEGRATION FOR AUTOMATIC ONTOLOGY MAPPING
SEMANTIC INTEGRATION FOR AUTOMATIC ONTOLOGY MAPPING SEMANTIC INTEGRATION FOR AUTOMATIC ONTOLOGY MAPPING
SEMANTIC INTEGRATION FOR AUTOMATIC ONTOLOGY MAPPING cscpconf
 
Sensing complicated meanings from unstructured data: a novel hybrid approach
Sensing complicated meanings from unstructured data: a novel hybrid approachSensing complicated meanings from unstructured data: a novel hybrid approach
Sensing complicated meanings from unstructured data: a novel hybrid approachIJECEIAES
 
INTELLIGENT INFORMATION RETRIEVAL WITHIN DIGITAL LIBRARY USING DOMAIN ONTOLOGY
INTELLIGENT INFORMATION RETRIEVAL WITHIN DIGITAL LIBRARY USING DOMAIN ONTOLOGYINTELLIGENT INFORMATION RETRIEVAL WITHIN DIGITAL LIBRARY USING DOMAIN ONTOLOGY
INTELLIGENT INFORMATION RETRIEVAL WITHIN DIGITAL LIBRARY USING DOMAIN ONTOLOGYcscpconf
 
SEMANTIC NETWORK BASED MECHANISMS FOR KNOWLEDGE ACQUISITION
SEMANTIC NETWORK BASED MECHANISMS FOR KNOWLEDGE ACQUISITIONSEMANTIC NETWORK BASED MECHANISMS FOR KNOWLEDGE ACQUISITION
SEMANTIC NETWORK BASED MECHANISMS FOR KNOWLEDGE ACQUISITIONcscpconf
 
Association Rule Mining Based Extraction of Semantic Relations Using Markov ...
Association Rule Mining Based Extraction of  Semantic Relations Using Markov ...Association Rule Mining Based Extraction of  Semantic Relations Using Markov ...
Association Rule Mining Based Extraction of Semantic Relations Using Markov ...dannyijwest
 
Association Rule Mining Based Extraction of Semantic Relations Using Markov L...
Association Rule Mining Based Extraction of Semantic Relations Using Markov L...Association Rule Mining Based Extraction of Semantic Relations Using Markov L...
Association Rule Mining Based Extraction of Semantic Relations Using Markov L...IJwest
 
An Incremental Method For Meaning Elicitation Of A Domain Ontology
An Incremental Method For Meaning Elicitation Of A Domain OntologyAn Incremental Method For Meaning Elicitation Of A Domain Ontology
An Incremental Method For Meaning Elicitation Of A Domain OntologyAudrey Britton
 
Concept integration using edit distance and n gram match
Concept integration using edit distance and n gram match Concept integration using edit distance and n gram match
Concept integration using edit distance and n gram match ijdms
 
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASESTRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASEScscpconf
 
CONTEXT-AWARE CLUSTERING USING GLOVE AND K-MEANS
CONTEXT-AWARE CLUSTERING USING GLOVE AND K-MEANSCONTEXT-AWARE CLUSTERING USING GLOVE AND K-MEANS
CONTEXT-AWARE CLUSTERING USING GLOVE AND K-MEANSijseajournal
 
Mining knowledge graphs to map heterogeneous relations between the internet o...
Mining knowledge graphs to map heterogeneous relations between the internet o...Mining knowledge graphs to map heterogeneous relations between the internet o...
Mining knowledge graphs to map heterogeneous relations between the internet o...IJECEIAES
 
Research on ontology based information retrieval techniques
Research on ontology based information retrieval techniquesResearch on ontology based information retrieval techniques
Research on ontology based information retrieval techniquesKausar Mukadam
 
The Revolution Of Cloud Computing
The Revolution Of Cloud ComputingThe Revolution Of Cloud Computing
The Revolution Of Cloud ComputingCarmen Sanborn
 
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASESTRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASEScsandit
 
Semantics in Financial Services -David Newman
Semantics in Financial Services -David NewmanSemantics in Financial Services -David Newman
Semantics in Financial Services -David NewmanPeter Berger
 

Similar to A semantic framework and software design to enable the transparent integration, reorganization and discovery of natural systems knowledge (20)

ICDMWorkshopProposal.doc
ICDMWorkshopProposal.docICDMWorkshopProposal.doc
ICDMWorkshopProposal.doc
 
Automatically converting tabular data to
Automatically converting tabular data toAutomatically converting tabular data to
Automatically converting tabular data to
 
SEMANTIC INTEGRATION FOR AUTOMATIC ONTOLOGY MAPPING
SEMANTIC INTEGRATION FOR AUTOMATIC ONTOLOGY MAPPING SEMANTIC INTEGRATION FOR AUTOMATIC ONTOLOGY MAPPING
SEMANTIC INTEGRATION FOR AUTOMATIC ONTOLOGY MAPPING
 
Sensing complicated meanings from unstructured data: a novel hybrid approach
Sensing complicated meanings from unstructured data: a novel hybrid approachSensing complicated meanings from unstructured data: a novel hybrid approach
Sensing complicated meanings from unstructured data: a novel hybrid approach
 
INTELLIGENT INFORMATION RETRIEVAL WITHIN DIGITAL LIBRARY USING DOMAIN ONTOLOGY
INTELLIGENT INFORMATION RETRIEVAL WITHIN DIGITAL LIBRARY USING DOMAIN ONTOLOGYINTELLIGENT INFORMATION RETRIEVAL WITHIN DIGITAL LIBRARY USING DOMAIN ONTOLOGY
INTELLIGENT INFORMATION RETRIEVAL WITHIN DIGITAL LIBRARY USING DOMAIN ONTOLOGY
 
SEMANTIC NETWORK BASED MECHANISMS FOR KNOWLEDGE ACQUISITION
SEMANTIC NETWORK BASED MECHANISMS FOR KNOWLEDGE ACQUISITIONSEMANTIC NETWORK BASED MECHANISMS FOR KNOWLEDGE ACQUISITION
SEMANTIC NETWORK BASED MECHANISMS FOR KNOWLEDGE ACQUISITION
 
Association Rule Mining Based Extraction of Semantic Relations Using Markov ...
Association Rule Mining Based Extraction of  Semantic Relations Using Markov ...Association Rule Mining Based Extraction of  Semantic Relations Using Markov ...
Association Rule Mining Based Extraction of Semantic Relations Using Markov ...
 
Association Rule Mining Based Extraction of Semantic Relations Using Markov L...
Association Rule Mining Based Extraction of Semantic Relations Using Markov L...Association Rule Mining Based Extraction of Semantic Relations Using Markov L...
Association Rule Mining Based Extraction of Semantic Relations Using Markov L...
 
An Incremental Method For Meaning Elicitation Of A Domain Ontology
An Incremental Method For Meaning Elicitation Of A Domain OntologyAn Incremental Method For Meaning Elicitation Of A Domain Ontology
An Incremental Method For Meaning Elicitation Of A Domain Ontology
 
Concept integration using edit distance and n gram match
Concept integration using edit distance and n gram match Concept integration using edit distance and n gram match
Concept integration using edit distance and n gram match
 
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASESTRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES
 
What is What, When?
What is What, When?What is What, When?
What is What, When?
 
CONTEXT-AWARE CLUSTERING USING GLOVE AND K-MEANS
CONTEXT-AWARE CLUSTERING USING GLOVE AND K-MEANSCONTEXT-AWARE CLUSTERING USING GLOVE AND K-MEANS
CONTEXT-AWARE CLUSTERING USING GLOVE AND K-MEANS
 
Mining knowledge graphs to map heterogeneous relations between the internet o...
Mining knowledge graphs to map heterogeneous relations between the internet o...Mining knowledge graphs to map heterogeneous relations between the internet o...
Mining knowledge graphs to map heterogeneous relations between the internet o...
 
Research on ontology based information retrieval techniques
Research on ontology based information retrieval techniquesResearch on ontology based information retrieval techniques
Research on ontology based information retrieval techniques
 
The Revolution Of Cloud Computing
The Revolution Of Cloud ComputingThe Revolution Of Cloud Computing
The Revolution Of Cloud Computing
 
Dc32644652
Dc32644652Dc32644652
Dc32644652
 
AN IMPROVED TECHNIQUE FOR DOCUMENT CLUSTERING
AN IMPROVED TECHNIQUE FOR DOCUMENT CLUSTERINGAN IMPROVED TECHNIQUE FOR DOCUMENT CLUSTERING
AN IMPROVED TECHNIQUE FOR DOCUMENT CLUSTERING
 
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASESTRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES
TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES
 
Semantics in Financial Services -David Newman
Semantics in Financial Services -David NewmanSemantics in Financial Services -David Newman
Semantics in Financial Services -David Newman
 

Recently uploaded

DSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine TuningDSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine TuningLars Bell
 
"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii Soldatenko"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii SoldatenkoFwdays
 
Time Series Foundation Models - current state and future directions
Time Series Foundation Models - current state and future directionsTime Series Foundation Models - current state and future directions
Time Series Foundation Models - current state and future directionsNathaniel Shimoni
 
A Journey Into the Emotions of Software Developers
A Journey Into the Emotions of Software DevelopersA Journey Into the Emotions of Software Developers
A Journey Into the Emotions of Software DevelopersNicole Novielli
 
unit 4 immunoblotting technique complete.pptx
unit 4 immunoblotting technique complete.pptxunit 4 immunoblotting technique complete.pptx
unit 4 immunoblotting technique complete.pptxBkGupta21
 
What is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdfWhat is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdfMounikaPolabathina
 
TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024Lonnie McRorey
 
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxDigital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxLoriGlavin3
 
Take control of your SAP testing with UiPath Test Suite
Take control of your SAP testing with UiPath Test SuiteTake control of your SAP testing with UiPath Test Suite
Take control of your SAP testing with UiPath Test SuiteDianaGray10
 
Developer Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQLDeveloper Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQLScyllaDB
 
Artificial intelligence in cctv survelliance.pptx
Artificial intelligence in cctv survelliance.pptxArtificial intelligence in cctv survelliance.pptx
Artificial intelligence in cctv survelliance.pptxhariprasad279825
 
SALESFORCE EDUCATION CLOUD | FEXLE SERVICES
SALESFORCE EDUCATION CLOUD | FEXLE SERVICESSALESFORCE EDUCATION CLOUD | FEXLE SERVICES
SALESFORCE EDUCATION CLOUD | FEXLE SERVICESmohitsingh558521
 
How to write a Business Continuity Plan
How to write a Business Continuity PlanHow to write a Business Continuity Plan
How to write a Business Continuity PlanDatabarracks
 
Rise of the Machines: Known As Drones...
Rise of the Machines: Known As Drones...Rise of the Machines: Known As Drones...
Rise of the Machines: Known As Drones...Rick Flair
 
A Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptxA Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptxLoriGlavin3
 
How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.Curtis Poe
 
WordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your BrandWordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your Brandgvaughan
 
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Mark Simos
 
The Ultimate Guide to Choosing WordPress Pros and Cons
The Ultimate Guide to Choosing WordPress Pros and ConsThe Ultimate Guide to Choosing WordPress Pros and Cons
The Ultimate Guide to Choosing WordPress Pros and ConsPixlogix Infotech
 
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxPasskey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxLoriGlavin3
 

Recently uploaded (20)

DSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine TuningDSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine Tuning
 
"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii Soldatenko"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii Soldatenko
 
Time Series Foundation Models - current state and future directions
Time Series Foundation Models - current state and future directionsTime Series Foundation Models - current state and future directions
Time Series Foundation Models - current state and future directions
 
A Journey Into the Emotions of Software Developers
A Journey Into the Emotions of Software DevelopersA Journey Into the Emotions of Software Developers
A Journey Into the Emotions of Software Developers
 
unit 4 immunoblotting technique complete.pptx
unit 4 immunoblotting technique complete.pptxunit 4 immunoblotting technique complete.pptx
unit 4 immunoblotting technique complete.pptx
 
What is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdfWhat is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdf
 
TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024
 
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxDigital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
 
Take control of your SAP testing with UiPath Test Suite
Take control of your SAP testing with UiPath Test SuiteTake control of your SAP testing with UiPath Test Suite
Take control of your SAP testing with UiPath Test Suite
 
Developer Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQLDeveloper Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQL
 
Artificial intelligence in cctv survelliance.pptx
Artificial intelligence in cctv survelliance.pptxArtificial intelligence in cctv survelliance.pptx
Artificial intelligence in cctv survelliance.pptx
 
SALESFORCE EDUCATION CLOUD | FEXLE SERVICES
SALESFORCE EDUCATION CLOUD | FEXLE SERVICESSALESFORCE EDUCATION CLOUD | FEXLE SERVICES
SALESFORCE EDUCATION CLOUD | FEXLE SERVICES
 
How to write a Business Continuity Plan
How to write a Business Continuity PlanHow to write a Business Continuity Plan
How to write a Business Continuity Plan
 
Rise of the Machines: Known As Drones...
Rise of the Machines: Known As Drones...Rise of the Machines: Known As Drones...
Rise of the Machines: Known As Drones...
 
A Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptxA Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptx
 
How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.
 
WordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your BrandWordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your Brand
 
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
 
The Ultimate Guide to Choosing WordPress Pros and Cons
The Ultimate Guide to Choosing WordPress Pros and ConsThe Ultimate Guide to Choosing WordPress Pros and Cons
The Ultimate Guide to Choosing WordPress Pros and Cons
 
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxPasskey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
 

A semantic framework and software design to enable the transparent integration, reorganization and discovery of natural systems knowledge

  • 1. A semantic framework and software design to enable the transparent integration, reorganization and discovery of natural systems knowledge Ferdinando Villa Published online: 7 February 2007 # Springer Science + Business Media, LLC 2007 Abstract I present a conceptualization that attempts to unify diverse representations of natural knowledge while providing a workable computational framework, based on current semantic web theory, for developing, communicating, and running integrated simulation models. The approach is based on a long-standing principle of scientific investigation: the separation of the ontological character of the object of study from the semantics of the observation context, the latter including location in space and time and other observation- related aspects. I will show how current Knowledge Representation theories coupled with the object-oriented paradigm allow an efficient integration through the abstract model of a domain, which relates to the idea of aspect in software engineering. This conceptualization allows us to factor out two fundamental causes of complexity and awkwardness in the representation of knowledge about natural system: (a) the distinction between data and models, both seen here as generic knowledge sources; (b) the multiplicity of states in data sources, handled through the hierarchical composition of independently defined domain objects, each accounting for all states in one well-known observational dimension. This simplification leaves modelers free to work with the bare conceptual bones of the problem, encapsulating complexities connected to data format, and scale. I will then describe the design of a software system that implements the approach, referring to explicit ontologies to unambiguously characterize the semantics of the objects of study, and allowing the independent definition of a global observation context that can be redefined as required. I will briefly discuss applications to multi-scale, multi-paradigm modeling, intelligent database design, and web-based collaboration. Keywords Semantic web theory. Intelligent database design . Web-based collaboration . Multi-paradigm modelling J Intell Inf Syst (2007) 29:79–96 DOI 10.1007/s10844-006-0032-x F. Villa (*) Ecoinformatics Collaboratory, Gund Institute for Ecological Economics and Department of Botany, University of Vermont, 590 Main Street, Burlington, VT 05405, USA e-mail: ferdinando.villa@uvm.edu
  • 2. 1 Introduction Computer science has proved to be greatly effective in providing operational metaphors that have made many complex tasks intuitive. Nevertheless, scientific investigation is still a painstaking, inefficient process that relies largely on the manipulation of raw data. Despite the powerful capabilities of dedicated analytical software such as GIS and statistical packages, we have not yet identified a framework that allows natural system scientists to work with natural world representations (data and models) using the same language that we use to think about natural phenomena and entities. Long-established achievements in personal productivity, information management, and scientific software allow us to work efficiently with spreadsheets, GIS coverages, systems of differential equations; still, such activities employ a very low level of abstraction compared to our thinking in terms of biomass, temperature, or species diversity. Complexities related to data format, scale, different granularities in space and time, and ambiguous, often opaque semantics make the workflow of natural systems investigation slow and awkward, severely limiting a scientist’s creativity and productivity. Identifying synthetic approaches to enable more productive ecological knowledge representation and management is ultimately a technical problem, but it cannot be addressed at the technical level before a breakthrough in language is reached. In this paper I will propose a conceptual framework that unifies and simplifies access to and integration of data and models while at the same time providing a sound computational blackboard for simulation modeling. The framework I present builds on the most recent efforts in knowledge engineering applied to ecological research to address the following priorities: & Give scientists the ability of searching and retrieving generalized knowledge sources (data and models) in a predefined observation context, leaving issues of scale, unit translation and enforcement of compatibility, and measurement of accuracy to an automated system. & Enable arbitrary recombination and composition of models and analytical pipelines based solely on compatibility of semantics. & Enable a network-enabled collaboration model where data, models, and modeling scenarios can be communicated, modified and exchanged in the same ways that text- based, discursive knowledge is. The conceptualization presented here strives to “generalize away” two fundamental causes of complexity in natural system representation: & The distinction between data and models, seen as special cases of a generic “module” or information source; & The multiplicity of states in data sources, defined and managed through the hierarchical composition of independently defined objects each of which determines a multiplicity of states in one well-known representational dimension. This simplification leaves us with the basic concept to work with and eliminates complexities relating to data format, scale, and nature of the information. The concept presented here differs from current model integration frameworks (e.g., ANL (URL); DMSO (URL); Fishwick, 1995; Mosterman & Vangheluwe, 2000; Villa & Costanza, 2000; Vangheluwe, Kerckhoffs, & Vansteenkiste, 2001), toolkits, and languages (e.g., Fritzson & Engelson, 1998; Minar, Burkhart, Langton, & Askenazi, 1996) in that it is based in established semantic web and data integration paradigms (Madhavan, Bernstein, Domingos, 80 J Intell Inf Syst (2007) 29:79–96
  • 3. & Halevy, 2002; SciDI 2002; Stockinger, Rana, Moore, & Merzky, 2001), and advocates a representational breakthrough before dealing with the engineering aspects of the data flow between distributed and heterogeneous sources and analytical processes. After a description of the conceptual framework, I will show how a software system can be efficiently designed to allow an operational translation of this concepts that is by its own nature distributed and web-enabled. 2 Approach The framework I propose in this paper extends previous work on integration infrastructure (Villa, 2001; Villa & Costanza, 2000) and is based on the fundamental epistemological separation between an object of study and the process of its observation. Each object of study can be associated to a concept and an observation context. The concept is a formalization of the ontological nature of the object, and is immutable by definition. The observation context defines all the aspects of an “observation window” such as temporal and spatial extent and granularity, the classification schemata employed, the authors that have reported the data, etc. The observation context defines a set of constraints whose representation is not necessarily and not entirely fixed: representational aspects connected to scaling, such as granularity and extent, can be manipulated by the observer without modifying the nature (semantics) of the object. I argue that reflecting this fundamental epistemological distinction in the representational model can be instrumental in developing a more efficient semantics for natural system representation. 2.1 Formalizing the semantics of the object of study Long-standing research in knowledge engineering has only recently started to percolate down to the natural sciences. The semantic characterization of data sources is a long- standing issue in knowledge representation, and much KR research has been motivated by the need to apply uniform constraints to data sources independent on the specifics of their representation (Doan, Madhavan, Domingos, & Halevy, 2002; Ives, Halevy, Mork, & Tatarinov, 2004; Madhavan et al., 2002; SciDI 2002; Stockinger et al., 2001). On the other hand, no workable strategies have been identified to allow for practical, seamless model composition and communication, within an infrastructure that deals automatically with conformance checking and the generation of transformations to mediate between different, compatible representations. With a renewed attention to semantics issues and naming problems, efforts that try to match the concept incorporated in an object of study to a formally specified semantic type are now becoming common, with the most activity occurring in the field of taxonomy and biodiversity conservation (GBIF, URL; Stevenson, Haber, & Morris, 2003; TDWG, URL). In most of these studies, the semantic type is a pointer into an explicit ontology, where the knowledge is mapped to the terms of a controlled vocabulary and, in the best cases, a set of attributes and relationships that link the terms of the vocabulary into a conceptual structure. Going one step beyond, Ludaescher et al. (2001) define a semantic map for a set of problems in neural transmission, and use it to query heterogeneous repositories of conceptually related data sources. Projects such as SEEK (Michener et al., 2007; SEEK, URL) and GEON (URL) are defining protocols and techniques to enable a semantically explicit approach to ecological dataflows, capable of enforcing the consistency of semantic J Intell Inf Syst (2007) 29:79–96 81
  • 4. types along data paths as well as that of storage types, and to automatically insert transformations to mediate compatible representations into a predefined workflow. A semantic map, the structured equivalent of the set of keywords used traditionally to characterize the semantics of stored datasets, can serve as a precious aid in browsing and querying of knowledge bases, as it connects concepts in a meaningful way and lends itself to powerful and intuitive forms of interactive graphical representation. Linked as it is to disciplines and their interpretation, there can hardly be a requirement of uniqueness in the semantic typing of an object: in most applications, an object can refer to several semantic maps, but can only have one position in each. For the purposes of this discussion, objects that share the same semantic type are representations of the same concept. As a result they can be observed in the same way. The semantic type defines unambiguously the aggregation properties of the object, the elementary unit of measurement that can be applied to it, and the storage properties of any measurement of its state. 2.2 Semantics and role of the observation context Natural system science, and Ecology in particular, has long been concerned with issues of scale, and with the effect of the scale of observation on the perceived properties of a system. It is easy to understand the fundamental role of scaling when considering that the observers are also the components of the systems under study, as is the case in highly integrative Ecology. The realization that scaling is rooted in observation, as opposed to the inherent semantics of the object of study, has been prominent, if often implicit, in ecological literature for at least two decades (Allen & Starr, 1982). Separating the semantics of the object of study from the aspects that pertain to its observation can be the starting point of a new integrative synthesis in ecological knowledge representation. To enable this, it is necessary to make a fundamental simplifying assumption: that the observation context can be separated into orthogonal axes, each accounting for a domain of observation that has well-defined semantics, methods, and interfaces. In most cases, the multiplicity of states in a data source can be attributed to the observation context, not to the semantic type. For example, timeseries data detail the various states of a concept in a certain extent of time, viewed at a defined granularity. GIS coverages specify different states in different portions of a given spatial extent. By encapsulating the observation context of an object into separately characterized observa- tional dimensions, we can design infrastructure that allows us to only use the semantic types to assemble models and analytical procedures, concentrating on the bare conceptual aspects and leaving the task of merging of the observation contexts of heterogeneous knowledge sources to an automated mediating engine. The separation of the various axes of observation into independently defined “observation domains”—such as space or time—is key to the possibility of implementing such a mechanism in a modular and flexible way. The observation context is as relevant to the analytical phase of the scientific workflow as it is to the process of searching and retrieving knowledge from repositories. In fact, predefining a semantic type and an observation “window” is equivalent to defining a query on a knowledge base. The implications of using formally specified semantic maps to perform queries (possibly by translating natural language interrogations or interactively browsing a graphical knowledge map) have been extensively explored (e.g., Ives et al., 2004; Ludaescher, Altintas, & Gupta, 2002). Once a concept is selected, a user can look for all objects that express that concept in a particular setting of time, space, classification, or 82 J Intell Inf Syst (2007) 29:79–96
  • 5. other observational domain. The retrieved objects can be returned unmodified or rescaled to fit a user-specified extent or granularity. This applies intuitively to space and time, but may apply to less obvious domains such as bibliographic source. As an example, if a knowledge base contains the same concept measured at the same time and space by different authors, a query may return both measures and their aggregated (average) measure if the granularity and extent of the bibliographic source domain is not specified—i.e, no specific source was requested. This would depend on having incorporated in the representational semantics of the repository a formal definition of a bibliographic “dimension” of the observation context, whose methods would be isomorphic with those used to aggregate over space and time. In this framework, data can be thought of as the simplest representation of an object of study, in which the measurements of a concept in a given observation context is known directly in its numeric form. A system represented by data has a “natural” observation context that is conventionally captured in the associated metadata. Its state can be observed in a different context by transforming it (e.g. by aggregating, distributing or subsetting) over the represented extents, or extrapolating it to a different extent. A system represented by algorithmic knowledge (model) may be defined more or less generally, from a completely abstract specification to one that depends on a particular time, space, and scale. To access its states in one of the permissible observation contexts, they need to be calculated. 2.3 Representation of models and analytical processes Models, where the information necessary to produce the states is defined algorithmically, can be expressed as a hierarchy of generic knowledge sources (modules) connected in a dependency structure, where each module has a semantic type and can adopt a specified observation window. The structural properties of the model do not depend on time, space or other observation-related aspect; rather, the strategy to calculate its states and the mode of visualization of its result depend on the semantics and nature of the composite observation context implicit in the model and the data used as input. Before states can be calculated across the model hierarchy, the observation contexts of the components must be compounded into an overall context, their compatibility assessed, and a strategy (composed of a set of transformations) defined to produce the states. I will detail a software design implementing this concept in the following sections. Building a model based on dependency and other semantically characterized relation- ships, with a formally specified set of ontologies guiding the matching of inputs and outputs, is an extension and a simplification over the common box-and-arrow representa- tional paradigm adopted in many modeling toolkits. In some of these (e.g. Ptolemy, URL; Simulink, URL) the connections reflect the data flow between processing steps, usually implying a temporal sequence or a control hierarchy. Sometimes (e.g., STELLA: HPS, 1995; Costanza, Duplisea, & Kautsky, 1998) the interface reflects a more conceptual approach, where connections reflect dependency and the types of the connected entities reflects the way states are calculated (e.g., STELLA’s “stocks” and “flows”). In all these applications, the “upper ontology” that defines the meaning of the entities and the observation context is usually fixed and implicit. Sometimes, generic metaphors with no semantic underpinning are provided that are able to simulate, although not represent, aspects such as spatial distribution (e.g. SIMILE, URL). In this paper, I advocate an approach to handling the complexities of natural system representation that adopts a full conceptual specification based on extensible ontologies, J Intell Inf Syst (2007) 29:79–96 83
  • 6. and separates the description of the conceptual nature of the modeled entity from the dataflow that calculates its states. One advantage of using a fully specified conceptual description that includes the observation context in its semantics is that much control flow (particularly the looping over multiple states due to time and space replication) becomes unnecessary, and allows a system to automatically determine the proper sequence of calculation of the states of a model, as well as the potential for parallel calculation. Box-and-arrow dependency diagrams that reflect the concept, as opposed to the dataflow, can be much more easily designed by non-technical users, particularly if explicit semantic types aid the choosing and matching of entities to satisfy dependency relationships. The uniformity of representation between data and models has many advantages. Models can be semantically characterized to represent analytical steps (such as GIS processing, statistical analysis or function optimization) just as well as interpretive or predictive models of natural phenomena. By virtue of semantic type propagation and composition across a model structure, analysis steps acquire a semantics of their own and can become legitimate components of other models. As an example, a GIS processing step may calculate the fractal dimension of a surface. By representing the calculation step as a module and its result as its state, the observational context of the original data is inherited by the fractal dimension data, which maintain the temporal and spatial extents of the input map. At this point, any further processing that uses the result as input will be able to use the information to enforce proper design and correct coupling with other spatially- and temporally-explicit data and models. The “metadata” in the resulting module will be in large part created automatically by inheriting the observation context. The observation context encapsulates much of the complexity that scientists have to deal with when manipulating data and models, without getting in the way of conceptualizing and analyzing. By separating the semantics of the observation into clean abstraction that do not influence the semantic type, we can model natural systems using the same intuitive language we use when conceptualizing. Another strong property of this approach is the fact that a model can be defined without any reference to a particular observational dimension, e.g. space, and used with data that contain it. The calculation of, e.g., a difference equation model using spatially explicit data as input would propagate the spatial nature of the input data across the model hierarchy and make the model spatially explicit, without user intervention. This mechanism is detailed in the following, where I will sketch an object-oriented interpretation of the concepts expressed this far, meant to illustrate the translation of the approach into an operational software design. 3 An ontology-driven object-oriented design: the Integrating Modelling Architecture The most general representation of a system in a semantically explicit object-oriented framework can be thought of as a set of interconnected modules, each corresponding to a semantically characterized object of study. Great power and generality can be obtained by adopting the semantics of the natural entities represented (e.g. economic value, biomass, or nitrogen flow) as opposed to that of the execution workflow that calculates the desired results. The declaration of each module can follow strictly the characterization of a set of ontologies, which predefines a distribution relationship linking to an observation context that encompasses all aspects connected to scaling, such as granularity and extent in space 84 J Intell Inf Syst (2007) 29:79–96
  • 7. and time. The observation context can be manipulated by the investigator or by the system when mediating across different, compatible representations used together. This section deals with the definition of the fundamental module, including the set of fundamental properties that a minimal upper ontology needs to define in order to enable the behaviors outlined so far. The principles exposed here are incorporated in the most recent design of the Integrating Modelling Architecture (IMA : Villa, 2001; IMA, URL), an open source integrative architecture for natural system modeling. In this section I concentrate on the conceptual design of the system. A brief description of the current implementation is given in a later section of this paper. 3.1 Modules as generic knowledge sources A module is a generic knowledge source, specified by a document in the XML/RDF language (RDF, URL), and validated as an instance of a formal ontology (e.g. in OWL, URL) accessible to an IMA runtime system. According to its semantic characterization, each module can have a state belonging to a precisely identified storage type, such as integer, floating point number, string, etc. Most modules of interest to natural system modeling will contain numeric states. To be fully specified, the state must be given along with the actual units of measurement employed, which must be compatible with the unit class implied by the semantic type. The generic module is an abstract specification that fits both data- and algorithm-specified sources of information. Data modules come with predefined numeric states and require no further calculation, unless scaling transformations need to be applied to modify their observation context (e.g. the spatial resolution) to fit an application or a user request. Algorithmically defined modules (models) have additional specification syntax that defines the algorithms and their dependencies on the state of other modules, expressed directly or as queries on a generic or URI-identified dataspace. The declaration of models reflects their conceptual identity and does not detail their procedural characterization. This is a key feature to ensure streamlined, understandable model structures that can be documented automatically and remain comprehensible to users: as an example, the conceptual characterization of a spatio-temporal model will not include loop constructs to calculate the different states of space and time, because those are implicit in the way the conceptualization of time and space is expanded automatically by the IMA runtime. The IMA infrastructure is capable of producing the sequence of operations and transformations (workflow) that calculates the modules’ state, based of the conceptual description. The declarative workflow can then be interpreted, or compiled and executed in a conventional procedural language like C or Java. The IMA implements an ontology-driven, extensible object system based on semantic web-endorsed standards (OWL and RDFS at the time of this writing). New classes can be added dynamically to the system by providing URLs to new ontologies and, if necessary, implementing extension code in a compatible language (native C++ or other languages that can interface to C). As an example, a DDE plug-in defines basic “stock” and “flow” classes, and extension code to teach the runtime to execute the corresponding workflow, which defines and integrates the difference equations implied by the concept. When the XML/ RDF specifications of a module are validated, the IMA can create an instance implementation that is stored along with the instance, and can be specialized to performing functions that depend on the class it represents. Subclasses of the basic module class represent the data sources used in the system, from data to models or wrappers around remote computation services. A key feature of the IMA J Intell Inf Syst (2007) 29:79–96 85
  • 8. is unlimited, uncoordinated extensibility of all aspects, from model and data types to ontologies, storage back-ends, user interfaces, strategies of workflow execution, and support for input and output data formats. Existing module classes (developed or in development) include: & “Wrapper” classes that interface to executable legacy applications and web services; & Optimizing modules (based on genetic and hill-climbing algorithms) that optimize goals stated by the user about the output of other models—e.g., to produce parameter sets that maximize the fit between the model’s output and a specified dataset; & An interface to the R statistical package (CRAN, URL) that allows complex statistical operations to be semantically characterized with ontologies, becoming part of IMA models; & Modules that support dynamic difference equation models based on a stock and flow metaphor, with import filters that translate models developed with popular modeling packages such as STELLA (Costanza et al., 1998; HPS, 1995) or Simile (SIMILE, URL); & Import/export plug-ins that provide read and write interfaces data format such as ASCII delimited and GIS coverages; & Import plug-ins that allow modules to define their temporal, spatial and semantic context by reading formally specified metadata standards such as ISO/TC 211 (ISO, URL) and EML (PBI, URL). 3.2 Semantic typing, integration and mediation By means of simple subsumption relationships or of multiple inheritance, the semantics of any of the basic module classes (e.g. numeric data, flows, optimizers) can be extended to represent actual natural—or otherwise significant—entities. In modules whose state is defined algorithmically, a dependency graph is constructed and used at the time of calculation, by analyzing the modules linked to it in relationships that specialize the generic dependency relationship defined in the IMA upper ontology for the base module class. As an example, the “flow” class in the DDE/STELLA import package is normally not used as is, but as part of a logical intersection that makes it represent a flow of, e.g., nitrogen. The “flow” identity tells the IMA engine how to calculate of the state of the flow through integration and defines a mandatory dependency on time (which also allows checking for correct units of measurement). The “nitrogen” semantic extension from, e.g., an ecological process ontology, enables the enforcement of semantic integrity and reasoning on the overall model, allowing substitutability of dependencies having compatible semantic types and functional definitions. The compatibility of storage type and elementary units of measurement is guaranteed by the definition of semantic type, and by the mapping implemented in the IMA between instance implementation and semantic types. While the state of a module can have multiple values in a given observation context, a module’s state is conceptually always atomic: it does not hold information about its multiplicity, as this it not a stable property of the object, being entirely dependent on the observation context. If initial data are available, they’re merely used to define a default state when the object is observed through its “native” observation window. No concept of array or matrix is necessary in the whole system: multiplicity does not correspond to an observational characteristic of the states of natural 86 J Intell Inf Syst (2007) 29:79–96
  • 9. entity, and complex, multistate objects are best represented through the composition of modules with separated, connected identities. As a result of this conceptualization, a model that (e.g.) uses available grass biomass and temperature to determine the increase in body weight in an organism can be modified to take the temperature indifferently from a timeseries or a complex global change model, as long as the “temperature” identity and the relevant observation context (such as space and time: see below) are compatible. Also, because objects adopting a particular domain are compatible with objects that do not adopt it (unless specifically prohibited by the relative ontology), it is possible to make (e.g.) a non-spatial model spatially explicit by linking a parameter or data source that adopts space: the domain will be propagated to the whole model during contextualization (see Section 3.4.1). A containment relationship is also defined for modules and can be subclassed in derived classes to identify its precise meaning for a particular semantic type. A set of modules may result as the effect of a containment relationship. In this case, the state of a module that contains other modules may be defined, according to its semantic type, as the union or the aggregation of the states of its components. As an example, individual-based models can contain modules that represent different properties such as body weight, age, temperature (Fig. 1): such properties have a well defined semantic type of their own, but they only make sense in the context of the individual. It must be noted that in such cases, the contained modules cannot exist alone: in other words, the semantic of the submodules is defined “hierarchically” in terms of their relationship with the containing module. A specialized containment relationship specifies the aggregation of similar components. For example, a population can be defined in terms of the individuals that compose it. In this case, the individuals’ states can be automatically aggregated into the population’s (e.g., the total biomass will be the sum of individual body mass), and additional semantics can be Fig. 1 An hypothetical model hierarchy and its internal relationships. Boxes represent modules and containment relationships. The solid arrows mean dependency, the dotted arrows mean aggregation by containment, and the dash-and-dot arrows mean inheritance or compounding of a set of domains J Intell Inf Syst (2007) 29:79–96 87
  • 10. given to account for properties that only appear as a result of the aggregation (emergent properties), such as the age structure. One of the most useful functions enabled by an explicit semantic characterization is the “smart aggregation” of data sources, which allows (e.g.) retrieved data to be aggregated and compared meaningfully by automatically placing non-conformant data (e.g. calculated with different methods) in separate groups, and automatically transforming compatible representations within a group (e.g. data expressed in different measurement units, or maps recorded at different resolutions in the same geographic region) in order to allow aggregation of their values. 3.3 Domains: an object-oriented translation of the observation context The observation context is represented in each module as a set of independently defined objects called domains, which can only exist in connection with a module, linked to them by a state distribution relationship. Each domain accounts for one “axis” of the observation context: e.g., space or time. Each domain specifies all the necessary information about the corresponding concept in the semantics of the observation: e.g., in a “discrete time” domain the specification syntax requires a start time, an end time, and the duration of a step. Modules adopt domains from their original XML/RDF specifications or by inheriting them from the modules they are linked to in any dependency relationship. Adopting a domain with a single step (multiplicity=1) defines the extent of existence in that domain: e.g. the time period where a data object has the stored value. Adopting a domain that specifies more that one time step determines a multiplicity of states in time for the module, and should be matched by appropriately defined input data. At the same time, the module may adopt a space domain defined through a set of polygons or raster cells covering a specified extent, and possibly loaded from a GIS coverage. The full state of each module is the Cartesian product of the set of states implied by each domain, and the total multiplicity of its state is the product of the multiplicities attributable to each domain. The set of all domains adopted is the module’s observation context. In the IMA object- oriented implementation, domains are polymorphic, and their associated methods can calculate, merge, and morph across different representations of the same domain (e.g. rasters, polygons) using methods and techniques tailored to the specific nature of the domain and its representation. A domain’s abstract model is defined generally and precisely in terms of granularity and extent, and new classes of domains can be defined by deriving representations of the granularity and extent that fit the domain, and providing an interface to them in the terms required by the abstract specification. Most sources of multiplicity in a concept’s state can be encapsulated into domains. For example, a bibliographic source domain can be devised that gives an object different states according to the source or author that has published their value. In this case, the granularity is the number of different sources that contain different values of the object, and the extent is the set of sources. In the example of Fig. 1, a population module aggregates a number of individual modules. By virtue of the aggregation relationship, the body mass of the individual aggregates into the population biomass automatically, since the population class is derived from the individual class, and the biomass semantic type knows the proper aggregation type for a containment relationship. The individual growth depends on nutrient availability and temperature, which are linked from external modules. The individual model does not adopt domains, but time and space are inherited from the first module in the dependency chain (e.g., temperature) and compounded with all others. This way, the compatibility of the time and 88 J Intell Inf Syst (2007) 29:79–96
  • 11. space domains adopted by the individuals is assessed through the individual class. The containment relationship makes the population adopt the common observation context of the individuals, which in turn comes from the compounded nutrient data and climate change model. Using data for temperature and a model for nutrients would not change the mechanism or the interface for a user who builds the model. New domains can be devised that are capable of determining and enforcing compatibility of more sophisticated aspects. For example it is possible, although hard to do at the present state of knowledge, to design an ecological domain that will enable the selection of only prey species that are known to be preyed upon by a specific predator once the predator is selected. The concept is general enough to accommodate most design problems. The modular nature of the IMA allows users to develop and add support for new domains in an uncoordinated, flexible way. This use of domain objects for mediation of semantics and methods is conceptually related to the field of aspect-oriented programming (Grundy, 2000), a technique that allows to modularize cross-cutting aspects of a system. Nevertheless, the IMA ideas did not evolve with aspect-oriented programming in mind and the system does not employ the technique in its software infrastructure. 3.4 Operations on a module hierarchy To be useful, an implementation must be able to produce all states of a concept in the defined observation context. This is accomplished in the IMA by two fundamental operations defined on the module, which comprehend the main functionalities of the infrastructure and are the key to all uses of the conceptualization presented here. Figure 2 represents a sketch of the operations in the overall IMA approach. During contextualization, an overall observation context is defined, either by the user or as the compounded observation context of all the modules; during this phase, the Fig. 2 Flowchart of the contextualization and domainization processes in the IMA J Intell Inf Syst (2007) 29:79–96 89
  • 12. compatibility between linked modules is assessed, and a high-level transformation and calculation strategy to produce the states is defined; During domainization, the high-level strategy is passed to a software engine that carries it on and produces the states of all modules in the global observation context. The states resulting from domainization can be visualized according to the semantics of the observation context. The rest of this section explains the two operations and how module and domains are used to carry them on. 3.4.1 Contextualization The overall observation context over a hierarchy of modules is defined by compounding the domains adopted by the modules in bottom-up order across the chain of dependencies and the containment structure of the model hierarchy. A module is exposed to all the domains of all modules it depends on or contains. Different actions are taken according to whether the compounding module originally adopts the domain or not. If module M1 depends on module M2, and module M2 adopts domain d, the two possible actions are: & If M1 does not adopt domain d from its original specifications, it adopts a copy of domain d from the linked module. For example, a non-spatial equation becomes spatial by adopting a spatial operand; its state will be replicated to cover the whole multiplicity of d, and the equation will be calculated the same number of times with all the different values of M2 in d, in the order specified by ordering rules specific to domain d’s class. & If M1 adopts d from its original specifications, the domain in M1 is compounded with the domain of the same class in M2. The operation of compounding involves calls to domain d’s interface methods to asses the compatibility of extent and granularity between the two domains, and if compatible, the generation of a transformation that can compute a minimum common denominator representation. The transformation, if any, is memorized as part of the overall link strategy, and the common representation is memorized in d and carried over to the next level. If module M1 adopts d and M2 does not, M2 is considered domain-neutral with respect to d, and its state will be used untransformed (with the possible exception of unit conversion) to calculate all states of M1. If the contextualization process fails because of domain incompatibility, an error is generated and the operation is interrupted. If the operation is successful, it produces the overall observation context of the model hierarchy, and a link strategy represented by a set of transformations that, carried out by an appropriate calculation engine, will “filter” the states of the dependent modules and reduce them to the same observation context of the requiring ones. After the bottom-up domain compounding phase, a second pass is done to expose the whole hierarchy to the newly calculated overall context, this time top-down. This step has the purpose of defining partially defined domains using the overall context to provide defaults. It is common that algorithmically defined modules are defined very generally, without a precise statement of extents and granularities (although they may contain specific extents in order to prevent application to situations where they have been proved not to apply). In such cases, the top-down inheritance of domain properties has the role of defining the missing information, thus preparing the modules for calculation. The compounded context in the root module is the overall view of all the axis of the observation context defined across the dependency hierarchy, and is defined as the natural context of the module. The same process that is used during linking to contextualize a 90 J Intell Inf Syst (2007) 29:79–96
  • 13. model in the context of another can be used to impose a user-defined observation context. When the overall context is defined, all modules know precisely their state storage requirements, and the system knows the transformation strategy and the precise ordering in which the states should be calculated. The contextualization of a single data source produces an empty strategy. The overall observation context represents the compounded concept of space, time, and other domains across the whole model. This phase flags any incompatibility and defines the context transformations, if any, that will be inserted in the dataflow. The concept of conformance between connected data sources is crucial to enabling recomposition and recontextualization of models. A simple example is aggregation, which requires non-trivial choices of algorithm (e.g. point attributes like temperature are aggregated differently than distributed quantities like biomass) and must ensure that, e.g., quantities measured with incompatible protocols are not combined. For all its algorithmic simplicity, the problem goes far beyond the identity constraint of “apples and oranges” that could be addressed by a linear hierarchy of types, or the relatively simple problem of unit conversion. In fact, it is merely a special case of the generalized conformance problem in model composition, which requires all common properties and observation contexts (like space and time) to be compatible for the stated purposes before modules can be aggregated or substituted. Conformance in model composition is a facet of the general problem of data integration and mediation (Gupta, Ludaescher, & Martone, 2000; SciDI, 2002; Stockinger et al, 2001) that has been tackled with ontology-based approaches (Ludaescher, Gupta, & Martone, 2001; 2002). The IMA uses ontologies and supporting algorithms to ensure conformance along data paths, inserting transformations into the calculation sequence when necessary, e.g. to translate between compatible but different space representations. The important realization that conformance depends on the purposes, and may be defined in more or less stringent ways according to user priorities, is taken care of in the IMA by the adoption of conformance policies, formally defined, purpose-specific strategies with user- modifiable parameters that can be defined to apply to specific classes of models and operations on models. 3.4.2 Domainization If the process of contextualizing a model hierarchy produces the overall observation context and a strategy to produce the modules’ states, the process of domainization uses that strategy to produce the states that are implied by the overall context. This may require calculating states when the knowledge base is described algorithmically, and applying scaling transformations when the same domain is present at different granularities or extents throughout the hierarchy of modules. Domainization is the equivalent of running a model in the conventional sense, an can be accomplished in several ways. In the IMA, the domainization phase produces a workflow in declarative form, and passes its definition to a configurable workflow compiler or interpreter that can either execute it, or translate it to a procedural language such as C++ or Java, or to a further declarative specification for a workflow environment such as Ptolemy (Ptolemy, URL). Separating the contextualization and domainization phases allows a clean design where the domainization strategy is calculated independently and expressed in a high-level representation which is later fed to a “domainization engine” that is capable of carrying it on optimally, using distributed parallel processing when possible and available. Web J Intell Inf Syst (2007) 29:79–96 91
  • 14. services provide a promising platform to enable a clean separation of the different processing stages components of such a system. When the knowledge source contains algorithmic specifications, the contextualization process, informed by the specifications linked to the module classes adopted, declares a workflow that is capable of producing the desired states and integrating data from compatible sources, composed of functional operators and context transformations. Transformations can consist in changes of representation (e.g. rasterization of polygon maps), aggregation or propagation of data across different extents, unit translation and storage type conversion. The domainization phase starts with a topological sort of the dependency graph (assessing the potential for parallelization) and calculates states for all modules, in dependency order, along the finest granularity of each domain in the overall observation context. The order of calculation is chosen accordingly to domain-specific rules, as some domains such as time imply an irreversible sequence of states while others (such as space) do not implicitly require that, but may have internal dependencies (e.g. when representing flows in space) that require a specific ordering of calculation of different states within the domain. The workflow is defined in terms of an extensible library of operators or actors, declared with the main functional module classes. The generated workflow also contains all transformation defined in the contextualization phase. The high-level representation of the transformation strategy is suitable to independent optimization, and can be stored or cached as necessary to speed repeated calculations in the same observation context. An important property of a well-defined transformation strategy is the ability of estimating in advance the loss of accuracy that the domainization process will cause compared to the use of untransformed data. This feature is extremely important in any integration architecture, since error propagation is even more of an issue when the output of an analytical process can be readily used as input for another, causing potentially infinite propagation of error. Estimates of accuracy can be permanently carried in the resulting modules’ data model and influence the confidence that users should put in the results. No matter how it is carried out, the domainization process produces a separate module hierarchy whose modules contain all states implied by the context, and a copy of all the domains after the contextualization step, but no algorithm specifications. In other words, the result is a hierarchy composed of data modules only, where the dependency relationship in the original module is substituted by containment so that the original structure is still recognizable. These “result modules,” represented in XML/RDF just like the original model hierarchy, can be independently visualized and saved to permanent storage. 3.4.3 Visualization While the IMA does not mandate any standard for visualization, the observation context of each module is usually sufficient to determine the proper way to visualize the state of each module. For example, the state of a module with multiple states in both time and space is best represented as an animation of maps, while the state of a module that only has multiple numeric states in time is typically represented as a line graph. The visualization engine uses the popular MIME types used by browsers and user interfaces to map a set of states in a particular context to a given MIME type, and invokes a third party plug-in, if present, to generate the corresponding representation (possibly handled through an external visualization program). 92 J Intell Inf Syst (2007) 29:79–96
  • 15. 3.4.4 Persistent distributed storage, self-documentation and web deployment of modules. The IMA defines a generalized, distributed permanent storage interface that can be implemented on top of existing storage back-ends and data retrieval web services. The interface uses a uniform internal query language similar to RDQL (RDQL, URL) used in several ways in the system. The IMA runtime is capable of dispatching a query to one or more repositories, identified through a URL whose protocol identifier specifies the implementation of the storage interface. As an example, an URL using the “pg:” protocol identifier specifies that the relative repository is implemented on top of a PostgreSQL, (URL) database, and must be handled by the PostgreSQL interface plug-in, which translates queries into SQL, enriched with robust spatial operators and others. Other implementations (corresponding to different protocol identifiers) can translate the query into XQuery (XQUERY, URL) and dispatch it to an XML database, or into the SEEK EcoGrid query language (Michener et al., 2004) and interface to an EcoGrid service. This mechanism provides an easy bridge to online query services as well as the capability of supporting local repositories based on a preferred back-end. The generic storage interface takes care of returning query results to the IMA in a consistent format that allows merging results. The IMA can declare, along with specific repositories, the ontologies needed to validate and reason on their contents, and load them automatically as the repository is accessed. Each individual data item is specified in the IMA by the URL of its repository followed by the fragment that identifies the instance in it, following established RDF/OWL conventions for concept identification. 3.4.5 Role of the IMA in assisting user interaction The IMA ontology-driven architecture can automatically define and enforce a discipline in creating meaningful models when its principles are extended to the user interface. Recontextualization of a retrieved model can be assisted by the software by dynamically restricting the view of the knowledge base presented to the user to only search content that conforms semantically to model components being substituted. As new modules are inserted in a model structure (e.g. modifying an input parameter with one from a different geographic context), the overall observation context can be recalculated, and the the search range for subsequent substitutions can be restricted to only retrieve data that are conformant (as defined above) with the new overall context. This mechanism prevents meaningless models to be constructed without placing the burden of integrity checking on the user. Another important property is that the semantic integrity of the result is known. While conformance constraints can be selectively loosened by the user to explore hypothetical, unrealistic scenarios, no models that violate any conformance constraints will be a suitable candidate for submission to the public data base. An IMA-powered interface can handle all these checks directly and automatically. 3.4.6 A prototype IMA implementation: the Integrating Modelling Toolkit An open-source prototype implementation of the principles illustrated above, the Integrating Modelling Toolkit (IMT), is available on the World Wide Web (IMA, URL). Despite its prototype stage, the IMT is being actively used in database and modeling projects. The IMT prototype is written in a modular fashion using policy-based design J Intell Inf Syst (2007) 29:79–96 93
  • 16. (Alexandrescu, 2001). This allows the runtime behavior to be customized in many ways. As an example, it is possible to create a IMT runtime that operates as a command-line application or as a threaded server by changing one line of code. Critical system components such as the XML parsing engine, the permanent storage interface, or the support for multiple concurrent sessions can be customized in the same way. To interact with a IMT runtime that is running as a server, a generic client software is also available that can be customized to suit different modes of interaction. A specialized client program operates following the Common Gateway Interface (CGI) conventions and communicates results through HTML, giving full access to the functionalities of the IMT server through a web browser. This approach is being currently used to develop two projects, sponsored by the US National Science Foundation: & The Ecosystem services database (ESD, URL; Villa et al, 2002), a web-accessible database integrating data about the economic valuation of ecosystem services, the models that produce the values and allow their projections in the future, and the valuation methods themselves as models, allowing users to apply valuation methods to different data as the database grows. & An integration of the existing African Mammals Databank (AMD, URL) and the pertaining entries in the IUCN Red List of threatened species, coupled with spatial data and predictive models, as a proof of concept in integrating data and predictive models in web-accessible databases. The IMT can be easily extended with new classes of modules and domains that can support advanced functionalities. A major strength of the system is its ability to use and integrate the great amount of existing general-purpose open source libraries to achieve specific goals. 4 Perspectives The IMA provides a semantic framework and a software infrastructure that unifies commonly separated entities and allows interoperability of independently developed representations of the natural world. The overall design principles have the ultimate purpose of enabling working with data and concepts using the same language that we use to think about phenomena and entities. Another fundamental goal is that any transformation can take place with known accuracy, and an estimate of the error implied by each transformation carried out is always available. The proposed conceptual framework can have a direct effect on scientific creativity by removing many impediments to integration and testing of ideas, and producing faster feedback between conceiving ideas and testing results. IMA-enabled databases are ideal for intuitive and safe exploration of complex data and models. I argue that through this and other projects that are currently operating to extend the semantic awareness of natural systems research, we are nearing a switch in perspective and a shift in language that has the potential of getting rid of many artificial distinctions that currently clutter our vision of the concepts and prevent efficient and precise modeling of natural entities and phenomena. As an example, ecology has long been concerned with concepts like “modeling paradigms”, whose boundaries have rarely been crossed: “process- based models” and “individual-based models”, to mention only two of the most popular, have traditionally been well-separated areas of investigation (Villa, 1992). I argue that this 94 J Intell Inf Syst (2007) 29:79–96
  • 17. can be as much the result of weak semantics as an actual difference in approach. A representational framework that embodies a sufficiently expressive concept of scale has the potential of making many of these differences disappear. As an example, Fig. 1 depicts a completely consistent model hierarchy, which contains both individual-based modules and traditionally process-based ones. We may be on the eve of developing new, simple representations that can encompass scales, representational paradigms and architecture- induced constraints and serve as a sound base for a semantic reorganization of the natural world which is computationally practical. Acknowledgements The author acknowledges the generous support of the National Science Foundation, with grants 0243957 (Biological Database and Informatics), 0243962 (Biodiversity and Ecosystem Informatics) and 0225676 (ITR-SEEK). Many people have contributed to the development of the concepts expressed here. Among these, I must mention at least Serguei Krivov and the many participants to the SEEK project. References Alexandrescu, A. (2001). Modern C++ design: Generic program and design patterns applied. New York, NY: Addison-Wesley. Allen, T. F. H., & Starr, T. B. (1982). Hierarchy: Perspectives for ecological complexity. Chicago, IL: University of Chicago Press. AMD (URL). The african mammals databank. Internet: http://gorilla.bio.uniroma1.it/amd. Argonne National Laboratories (URL). Review of the Dynamic Information Architecture System (DIAS). Internet: http://www.dis.anl.gov/DEEM/DIAS. Costanza, R., Duplisea, D., & Kautsky, U. (1998). Ecological modelling and economic systems with STELLA Introduction. Ecological Modelling, 110, 1–4. CRAN (URL). The comprehensive R archive network. Internet: http://www.ci.tuwien.ac.at/R. DMSO (URL). DoD high level architecture. Internet: http://www.dmso.mil/projects/hla. Doan, A., J. Madhavan, J., Domingos, P., & Halevy, A. Y. (2002). Learning to map between ontologies on the semantic web. In Proceedings of the eleventh international conference on World Wide Web, May 07–11, Honolulu, Hawaii, USA. ESD (URL). The ecosystem services database. Internet: http://esd.uvm.edu. Fishwick, P. (1995). Simulation model design and execution: Building digital worlds. Upper Saddle River, NJ: Prentice Hall. Fritzson, P., & Engelson, V. (1998). Modelica—A unified object-oriented language for system modelling and simulation. In Proceedings of European Conference on Object-Oriented Programming (ECOOP98), Brussels, July 20–24, 1998. Internet: http://citeseer.nj.nec.com/fritzson98modelica.html. GBIF (URL). Global biodiversity information facility. Internet: http://www.gbif.org. GEON (URL). GEON Cyberinfrastructure for the geosciences. Internet: http://www.geongrid.org. Grundy, J. C. (2000). Multi-perspective specification, design and implementation of software components using aspects. International Journal of Software Engineering and Knowledge Engineering, 20(6). Gupta, A., Ludaescher, B., & Martone, M. E. (2000). Knowledge-based integration of neuroscience data sources. In 12th Intl. Conference on Scientific and Statistical Database Management (SSDBM), pp. 39– 52. Berlin, Germany: IEEE Computer Society. HPS (1995). STELLA User’s manual. High performance systems. IMA (URL). Integrating modelling architecture home page. Internet: http://www.integratedmodelling.org. ISO (URL). ISO/TC211 Geographic information metadata standard. Internet: http://www.isotc211.org. Ives, Z. G., Halevy, A. Y., Mork, P., & Tatarinov, I. (2004.) Piazza: Mediation and integration infrastructure for Semantic Web data. Web Semantics: Science, Services and Agents on the World Wide Web, 2, 155–175. Ludaescher, B., Altintas, I., & Gupta, A. (2002). Time to leave the trees: From syntactic to conceptual querying of XML. In Intl. Workshop on XML data management, in junction with Conference on Extending Database Technology (EDBT). Prague, March 2002. Ludaescher, B., Gupta, A., & Martone, M. E. (2001). Model-based mediation with domain maps. Proceedings 17th Intl. Conference on Data Engineering (ICDE), Heidelberg, Germany. J Intell Inf Syst (2007) 29:79–96 95
  • 18. Madhavan, J., Bernstein, P. A., Domingos, P., & Halevy, A. Y. (2002). Representing and reasoning about mappings between domain models. Proceedings of the Eighteenth National Conference on Artificial Intelligence (pp. 80–86). Edmonton, Alberta, Canada. Michener, W. K., Beach, J. H., Jones, M. B., Ludaescher, B., Pennington, D. D., et al. (2007). A knowledge environment for the biodiversity and ecological sciences. Journal of Intelligent Information Systems, in this issue. Minar, N., Burkhart, R., Langton, C., & Askenazi, M. (1996). The swarm simulation system: A toolkit for building multi-agent simulations. Santa Fe Institute Working Paper 96-06-042. Mosterman, P., & Vangheluwe, H. L. (2000). Computer automated multi paradigm modeling in control system design. In A. Varga (Ed.), IEEE International Symposium on Computer-Aided Control System Design, 65–70. Anchorage, Alaska; IEEE Computer Society Press. OWL (URL). OWL Web Ontology Language Guide W3C Recommendation 10 February 2004. Internet: http://www.w3.org/TR/owl-guide. PBI: Partnership for Biological Informatics (URL). Ecological metadata language (EML). Internet: http:// www.ecoinformatics.org/software/eml. PostgreSQL (URL). PostgreSQL home page. Internet: http://www.postgresql.org. Ptolemy (URL). The Ptolemy project. Internet: http://ptolemy.eecs.berkeley.edu. RDF (URL). Resource Description Framework (RDF). Internet: http://www.w3.org/RDF. RDQL (URL). RDQL—A Query Language for RDF W3C Member Submission 9 January 2004. Internet: http://www.w3.org/Submission/RDQL/. SciDI: SEMANTIC MEDIATION IDENTIFIED AS APPROACH TO SCI DATA INTEGRATION (2002). Scientific Data Integration Panel, Intl. Conf. On Extending Database Technology (EDBT), Prague, March 2002. SEEK (URL). Science Environment for Ecological Knowledge (SEEK). Internet: http://seek.ecoinformatics. org. SIMILE (URL). Simulistics home page. Internet: http://www.simulistics.com. Simulink (URL). Mathworks home page. Internet: http://www.mathworks.com. Stevenson, R. D., Haber, W. A., & Morris, R. A. (2003). Electronic field guides and user communities in the eco- informatics revolution. Conservation Ecology, 7(1), 3. Internet: http://www.consecol.org/vol7/iss1/art3. Stockinger, H., Rana, O., Moore, R., & Merzky, A. (2001). Data management for grid. Environments, High Performance Computing and Networking (HPCN 2001), Amsterdam, NL, June 2001. TDWG (URL). International working group on taxonomic databases. Internet: http://www.tdwg.org. Vangheluwe, H. L., Kerckhoffs, E. J. H., & Vansteenkiste, G. C. (2001). Computer automated modelling of complex systems. In E. J. H. Kerckhoffs, & M. Snorek (Eds.), 15th European Simulation Multi-conference (ESM), 7–18. Prague, Czech Republic; Society for Computer Simulation International (SCS). Villa, F. (1992). New computer architectures as tools for ecological thought. Trends in Ecology and Evolution, 7, 179–183. Villa, F. (2001). Integrating modelling architecture: A declarative framework for multi-scale, multi-paradigm ecological modelling. Ecological Modelling, 137, 23–42. Villa, F., & Costanza, R. (2000). Design of multi-paradigm integrating modelling tools for ecological research. Environmental Modelling and Software, 15, 169–177. Villa, F., Wilson, M. A., DeGroot, R., Farber, S., Costanza, R., & Boumans, R. M. J. (2002). Design of an integrated knowledge base to support ecosystem services valuation. Ecological Economics, 41, 445–456. XQUERY (URL). XQuery 1.0: An XML query language. W3C Working Draft 12 November 2003. http:// www.w3.org/TR/xquery. 96 J Intell Inf Syst (2007) 29:79–96
  • 19. Reproduced with permission of the copyright owner. Further reproduction prohibited without permission.