Read e-book online Advanced Information Systems Engineering: 19th International PDF

By Pekka Abrahamsson (auth.), John Krogstie, Andreas Opdahl, Guttorm Sindre (eds.)

ISBN-10: 3540729879

ISBN-13: 9783540729877

This ebook constitutes the refereed court cases of the nineteenth foreign convention on complex details structures Engineering, CAiSE 2007, held in Trondheim, Norway in June 2007.

The 39 revised complete papers provided including 1 keynote speak have been rigorously reviewed and chosen from 301 submissions. The papers are geared up in topical sections on ontologies, prolonged organisations, info integration, service-oriented structure, strategic alignment, necessities, approach modeling, approach engineering, novel purposes, participative modeling, and process-aware details systems.

Show description

Read or Download Advanced Information Systems Engineering: 19th International Conference, CAiSE 2007, Trondheim, Norway, June 11-15, 2007. Proceedings PDF

Similar technique books

Germany's fighting machine by Ernest F. Henderson PDF

;Germany's struggling with computing device КНИГИ ;ВОЕННАЯ ИСТОРИЯ Автор:Ernest F. Henderson Название: Germany's battling machineИздательство: Indianapolis : Robbs Merrill Год: 1914 Формат: PDF Размер: 12,8 mbЯзык: English Germany's battling computer : her military, her military, her airships, and why she arrayed them opposed to the allied powers of Europe.

Kozo Sugiyama's Graph Drawing and Applications for Software and Knowledge PDF

This article goals to aid readers who are looking to visualize graphs as representing structural wisdom. It provides an overview of the total box, describes intimately the consultant tools for drawing graphs, explains extensions similar to fisheye and dynamic drawing, offers many sensible functions, and discusses methods of review.

Additional resources for Advanced Information Systems Engineering: 19th International Conference, CAiSE 2007, Trondheim, Norway, June 11-15, 2007. Proceedings

Example text

The set parents holds pairs of nodes and edge types (parent, type), meaning the edge from parent to the new node to be of type type. – DeleteN ode(node) deletes node from the graph. A node can only be deleted, if it does not have any children. With the node, all its incident edges are deleted as well. – InsertEdge(parent, child, type) creates an edge of type type from parent to child. The new edge must not close a cycle in the graph. – DeleteEdge(parent, child) deletes the edge from parent to child.

For that purpose, we assume that every node is connected to the root via a path consisting only of edges defined to be acyclic. This will hold for many ontologies, because they often comprise a generalization hierarchy. For all nodes x not satisfying this requirement, we create a vroot relation from the root to x. As a last step, we create the so called slots, representing cyclic edges. Each slot has a name and a type. For each relation from a node parent to node child, with relation type edgeT ype, where edgeT ype is not defined as acyclic, we add the slot with name edgeT ype of type child to the node parent and remove the edge between parent and child.

This gives at most d2 node pairs to be compared. For similarity determination of inner nodes we again have to compare the common leaves, which is in O(nl ), thus renaming detection is in O(nl · d2 ). The detection of the remaining graph differences (i. e. Inserts, Deletes, Updates, Edge and Slot changes) requires at least two graph traversals (∈ O(n)). The number of edit operations to be found here is in O(d). As for the Inserts and Edge Changes for each node its parents have to be checked, the overall complexity here is in O(n · p + d · p).

Download PDF sample

Advanced Information Systems Engineering: 19th International Conference, CAiSE 2007, Trondheim, Norway, June 11-15, 2007. Proceedings by Pekka Abrahamsson (auth.), John Krogstie, Andreas Opdahl, Guttorm Sindre (eds.)


by Donald
4.4

Rated 4.75 of 5 – based on 25 votes