Lelde Lace

Quantum Query Complexity for Some Graph Problems

The paper [4] by H. Buhrman and R. de Wolf contains an impressive survey of solved and open problems in quantum query complexity, including many graph problems. We use recent results by A.Ambainis [1] to prove higher lower bounds for some of these problems. Some of our new lower bounds do not close the gap between the best upper and lower bounds. We prove in these cases that it is impossible to provide a better application of Ambainis’ technique for these problems.

DSL Based Platform for Business Process Management

Currently nearly all commercial and open source BPMS are based on BPMN as a process notation. In contrast, the paper proposes to build a BPMS based on a domain specific language (DSL) as a process notation – DSBPMS. In such a DSBPMS a specific business process support could be created by business analysts. A platform for creating such DSBPMS with feasible efforts is described. This platform contains a Configurator for easy creation of graphical editors for the chosen DSL and a simple mapping language for transforming processes in this DSL to a language directly executable by the execution engine of this platform. The engine includes also all typical execution support functions so no other tools are required.

Architecture and Language for Semantic Reduction of Domain-Specific Models in BPMS

Nowadays each business process management system (BPMS) supports either an industry standard or its own specific modeling language. But no BPMS supports a specific language for each organization. We propose an architecture for building BPMS that allows creating a domain-specific modeling language for every client easily. The main problem is to bridge the gap between the domain-specific language and the executable language. We show that we can look at this problem as a classification of the domain-specific language constructs in the terms of the executable language. To solve this problem we present a novel model transformation language, with which this type of problem can be solved more naturally than with existing transformation languages.

OWL Orthogonal Extension

It is critical for knowledge bases to capture the reality in direct and intuitive way. OWL ontology language was designed for this goal. In this paper we study the limitations of the OWL open world semantics for the task of knowledge capture and retrieval. We propose a new mechanism based on the closed world semantics that alleviates part of the limitations. Further we describe a system where both OWL and the new mechanisms interoperate together. Finally, we outline some immediate applications and further research directions.