In this paper we describe an approach for using semantic annotations of process models to support business process benchmarking. We show how semantic annotations can support the preparation of process benchmarking data by adding machine-processable semantic information to existing process models without modifying the original modeling language, conduct semantic analyses for the purpose of perfo...

In addressing the growing model sizes used in simulation environments, I examine adding machine learning techniques to the entities in a model in an effort to produce such side effects as emergent behavior. Distributing the environment in order to increase the efficiency of the simulation also plays an important role in this thesis. The added intelligence of entities may have some affect upon t...

In this paper, we demonstrate how approximation structures called sufficient semirings can provide information about measure-preserving dynamical systems. We describe the basic properties of measure-preserving dynamical systems and illustrate their connections to sufficient semirings by investigating the dyadic adding machine.

In this paper we use a result by J. Krasinkiewicz to present a description of the topological behavior of an open map defined between dendrites. It is shown that, for every such map f : X → Y, there exist n subcontinua X1, X2,. . ., Xn of X such that X = X1∪X2∪· · ·∪Xn, each set Xi∩Xj consists of at most one element which is a critical point of f , and each map f|Xi : Xi → Y is open, onto and c...

1. TALK SUMMARY I chose the title Metadata is back! because of schema.org, which is a joint effort of Bing, Google and Yahoo to provide a collection of schemas for marking up Web pages with machine-readable data. This helps search engines to understand the meaning of information and allows them to provide rich search results to the user, which makes it easier for them to find relevant informati...

This paper describes how electronic grammars can be further enhanced by adding machine-readable grammars and treebanks. We explore the potential benefits of implemented grammars and treebanks for descriptive linguistics, following the discursive methodology of Bird & Simons (2003) and the values and maxims identified by Nordhoff (2008).1 We describe the resources which we believe make implement...

We show that the family of the Smale-Williams solenoid attractors parameterized by its contraction rate can be characterized as a solution of a differential equation. The exact formula describing the attractor can be obtained by solving the differential equation subject to an explicitly given initial condition. Using the formula, we present a simple and explicit proof that the dynamics on the s...

A Fibonacci(-like) unimodal map is defined by special combinatorial properties which guarantee that the critical omega-limit set ω(c) is a minimal Cantor set. In this paper we give conditions to ensure that f |ω(c) is invertible, except at a subset of the backward critical orbit. Furthermore, any finite subtree of the binary tree can appear for some f as the tree connecting all points at which ...