CSOM/PL

CSOM/PL PDF Author: Michael Haupt
Publisher: Universitätsverlag Potsdam
ISBN: 3869561343
Category : Computers
Languages : en
Pages : 38

Get Book Here

Book Description
Business process models are abstractions of concrete operational procedures that occur in the daily business of organizations. To cope with the complexity of these models, business process model abstraction has been introduced recently. Its goal is to derive from a detailed process model several abstract models that provide a high-level understanding of the process. While techniques for constructing abstract models are reported in the literature, little is known about the relationships between process instances and abstract models. In this paper we show how the state of an abstract activity can be calculated from the states of related, detailed process activities as they happen. The approach uses activity state propagation. With state uniqueness and state transition correctness we introduce formal properties that improve the understanding of state propagation. Algorithms to check these properties are devised. Finally, we use behavioral profiles to identify and classify behavioral inconsistencies in abstract process models that might occur, once activity state propagation is used.

The JCop language specification : Version 1.0, April 2012

The JCop language specification : Version 1.0, April 2012 PDF Author: Malte Appeltauer
Publisher: Universitätsverlag Potsdam
ISBN: 3869561939
Category : Computers
Languages : en
Pages : 60

Get Book Here

Book Description
Program behavior that relies on contextual information, such as physical location or network accessibility, is common in today's applications, yet its representation is not sufficiently supported by programming languages. With context-oriented programming (COP), such context-dependent behavioral variations can be explicitly modularized and dynamically activated. In general, COP could be used to manage any context-specific behavior. However, its contemporary realizations limit the control of dynamic adaptation. This, in turn, limits the interaction of COP's adaptation mechanisms with widely used architectures, such as event-based, mobile, and distributed programming. The JCop programming language extends Java with language constructs for context-oriented programming and additionally provides a domain-specific aspect language for declarative control over runtime adaptations. As a result, these redesigned implementations are more concise and better modularized than their counterparts using plain COP. JCop's main features have been described in our previous publications. However, a complete language specification has not been presented so far. This report presents the entire JCop language including the syntax and semantics of its new language constructs.

Precision Engineering

Precision Engineering PDF Author: K. Narayanasamy
Publisher: Alpha Science Int'l Ltd.
ISBN: 9788173193514
Category : Computers
Languages : en
Pages : 548

Get Book Here

Book Description
Micro-electronics, micro-optics and micro-mechanical components form an integral part of advanced engineered products coming under the broad area of precision engineering. This book covers theme articles and research reports covering the broad area of precision engineering.

An Abstraction for Version Control Systems

An Abstraction for Version Control Systems PDF Author: Matthias Kleine
Publisher: Universitätsverlag Potsdam
ISBN: 3869561580
Category : Computers
Languages : en
Pages : 88

Get Book Here

Book Description
Version Control Systems (VCS) allow developers to manage changes to software artifacts. Developers interact with VCSs through a variety of client programs, such as graphical front-ends or command line tools. It is desirable to use the same version control client program against different VCSs. Unfortunately, no established abstraction over VCS concepts exists. Instead, VCS client programs implement ad-hoc solutions to support interaction with multiple VCSs. This thesis presents Pur, an abstraction over version control concepts that allows building rich client programs that can interact with multiple VCSs. We provide an implementation of this abstraction and validate it by implementing a client application.

Advancing the Discovery of Unique Column Combinations

Advancing the Discovery of Unique Column Combinations PDF Author: Ziawasch Abedjan
Publisher: Universitätsverlag Potsdam
ISBN: 3869561483
Category : Computers
Languages : en
Pages : 30

Get Book Here

Book Description
Unique column combinations of a relational database table are sets of columns that contain only unique values. Discovering such combinations is a fundamental research problem and has many different data management and knowledge discovery applications. Existing discovery algorithms are either brute force or have a high memory load and can thus be applied only to small datasets or samples. In this paper, the wellknown GORDIAN algorithm and "Apriori-based" algorithms are compared and analyzed for further optimization. We greatly improve the Apriori algorithms through efficient candidate generation and statistics-based pruning methods. A hybrid solution HCAGORDIAN combines the advantages of GORDIAN and our new algorithm HCA, and it significantly outperforms all previous work in many situations.

Scalable Compatibility for Embedded Real-time Components Via Language Progressive Timed Automata

Scalable Compatibility for Embedded Real-time Components Via Language Progressive Timed Automata PDF Author: Stefan Neumann
Publisher: Universitätsverlag Potsdam
ISBN: 3869562269
Category : Computers
Languages : en
Pages : 82

Get Book Here

Book Description
The proper composition of independently developed components of an embedded real- time system is complicated due to the fact that besides the functional behavior also the non-functional properties and in particular the timing have to be compatible. Nowadays related compatibility problems have to be addressed in a cumbersome integration and configuration phase at the end of the development process, that in the worst case may fail. Therefore, a number of formal approaches have been developed, which try to guide the upfront decomposition of the embedded real-time system into components such that integration problems related to timing properties can be excluded and that suitable configurations can be found. However, the proposed solutions require a number of strong assumptions that can be hardly fulfilled or the required analysis does not scale well. In this paper, we present an approach based on timed automata that can provide the required guarantees for the later integration without strong assumptions, which are difficult to match in practice. The approach provides a modular reasoning scheme that permits to establish the required guarantees for the integration employing only local checks, which therefore also scales. It is also possible to determine potential configuration settings by means of timed game synthesis.

Plasmonics

Plasmonics PDF Author: Ki Young Kim
Publisher: BoD – Books on Demand
ISBN: 9535107976
Category : Technology & Engineering
Languages : en
Pages : 560

Get Book Here

Book Description
The title of this book, Plasmonics: Principles and Applications, encompasses theory, technical issues, and practical applications which are of interest for diverse classes of the plasmonics. The book is a collection of the contemporary researches and developments in the area of plasmonics technology. It consists of 21 chapters that focus on interesting topics of modeling and computational methods, plasmonic structures for light transmission, focusing, and guiding, emerging concepts, and applications.

Adaptive Windows for Duplicate Detection

Adaptive Windows for Duplicate Detection PDF Author: Uwe Draisbach
Publisher: Universitätsverlag Potsdam
ISBN: 3869561432
Category : Computers
Languages : en
Pages : 46

Get Book Here

Book Description
Duplicate detection is the task of identifying all groups of records within a data set that represent the same real-world entity, respectively. This task is difficult, because (i) representations might differ slightly, so some similarity measure must be defined to compare pairs of records and (ii) data sets might have a high volume making a pair-wise comparison of all records infeasible. To tackle the second problem, many algorithms have been suggested that partition the data set and compare all record pairs only within each partition. One well-known such approach is the Sorted Neighborhood Method (SNM), which sorts the data according to some key and then advances a window over the data comparing only records that appear within the same window. We propose several variations of SNM that have in common a varying window size and advancement. The general intuition of such adaptive windows is that there might be regions of high similarity suggesting a larger window size and regions of lower similarity suggesting a smaller window size. We propose and thoroughly evaluate several adaption strategies, some of which are provably better than the original SNM in terms of efficiency (same results with fewer comparisons).

Model-driven engineering of adaptation engines for self-adaptive software

Model-driven engineering of adaptation engines for self-adaptive software PDF Author: Thomas Vogel
Publisher: Universitätsverlag Potsdam
ISBN: 3869562277
Category : Computers
Languages : en
Pages : 74

Get Book Here

Book Description
The development of self-adaptive software requires the engineering of an adaptation engine that controls and adapts the underlying adaptable software by means of feedback loops. The adaptation engine often describes the adaptation by using runtime models representing relevant aspects of the adaptable software and particular activities such as analysis and planning that operate on these runtime models. To systematically address the interplay between runtime models and adaptation activities in adaptation engines, runtime megamodels have been proposed for self-adaptive software. A runtime megamodel is a specific runtime model whose elements are runtime models and adaptation activities. Thus, a megamodel captures the interplay between multiple models and between models and activities as well as the activation of the activities. In this article, we go one step further and present a modeling language for ExecUtable RuntimE MegAmodels (EUREMA) that considerably eases the development of adaptation engines by following a model-driven engineering approach. We provide a domain-specific modeling language and a runtime interpreter for adaptation engines, in particular for feedback loops. Megamodels are kept explicit and alive at runtime and by interpreting them, they are directly executed to run feedback loops. Additionally, they can be dynamically adjusted to adapt feedback loops. Thus, EUREMA supports development by making feedback loops, their runtime models, and adaptation activities explicit at a higher level of abstraction. Moreover, it enables complex solutions where multiple feedback loops interact or even operate on top of each other. Finally, it leverages the co-existence of self-adaptation and off-line adaptation for evolution.

Cyber-physical Systems with Dynamic Structure

Cyber-physical Systems with Dynamic Structure PDF Author: Basil Becker
Publisher: Universitätsverlag Potsdam
ISBN: 386956217X
Category : Computers
Languages : en
Pages : 40

Get Book Here

Book Description
Cyber-physical systems achieve sophisticated system behavior exploring the tight interconnection of physical coupling present in classical engineering systems and information technology based coupling. A particular challenging case are systems where these cyber-physical systems are formed ad hoc according to the specific local topology, the available networking capabilities, and the goals and constraints of the subsystems captured by the information processing part. In this paper we present a formalism that permits to model the sketched class of cyber-physical systems. The ad hoc formation of tightly coupled subsystems of arbitrary size are specified using a UML-based graph transformation system approach. Differential equations are employed to define the resulting tightly coupled behavior. Together, both form hybrid graph transformation systems where the graph transformation rules define the discrete steps where the topology or modes may change, while the differential equations capture the continuous behavior in between such discrete changes. In addition, we demonstrate that automated analysis techniques known for timed graph transformation systems for inductive invariants can be extended to also cover the hybrid case for an expressive case of hybrid models where the formed tightly coupled subsystems are restricted to smaller local networks.