Verifying Interaction Protocol Compliance of Service Orchestrations

Size: px
Start display at page:

Download "Verifying Interaction Protocol Compliance of Service Orchestrations"

Transcription

1 Verifying Interation Protool Compliane of Servie Orhestrations Andreas Shroeder and Philip Mayer Ludwig-Maximilians-Universität Münhen, Germany {shroeda, Abstrat. An important aspet of servie-oriented omputing is the ability to invoke servies without knowledge of the atual implementation. This requires at least a desription of the servie interfae; better yet is a speifiation of the omplete interation protool. This applies to atomi servies as well as servie ompositions. In both ases, however, guaranteeing that a servie omplies with the promised interation protool is ruial for deadlok-free ommuniation. In this paper, we present an analysis method and tool for verifying ompliane of servie orhestrations with servie interation protools given as UML models. Our method is part of a larger suite of methods and tools for model driven development of servie oriented arhitetures overing ode generation for the Web servie stak and other servie platforms: MDD4SOA. 1 Introdution A ore aspet of Servie-Oriented Computing (SOC) is enabling (semi-) automati disovery and omposition of servies. To ahieve this aim, servies are aompanied with a desription of their interfae, onsisting of a desription of aepted and sent messages and its interation protool detailing whih interations with the servie are legal at a ertain point in a onversation. Interation protools greatly help in assembling servies and enable more thorough mehanial hekings of whether servies fit together. However, for this heking to be helpful, it is ruial that servie orhestrations onform to their interation protools; otherwise, servies may be proven inompatible although fitting, or even worse, servies may be onsidered ompatible when they are not. Therefore, tools for heking the onformane of servie implementation (in our ase, the orhestration) and servie desription (i.e., the interation protool) are urgently needed. In this paper, we present an approah for heking the onformane of servie orhestrations given as UML ativity diagrams and interation protools given as UML protool state mahines. We use the UML as it onstitutes the lingua frana of software engineers, and furthermore allows to follow a model driven approah: to reate platform independent software models that an be transformed into platform speifi realizations. The remainder of this paper is strutured as follows. First, we give a brief overview over our UML profile for servies in Se. 2. In Se. 3, we detail the basi ideas of This work has been partially supported by the EC projet SENSORIA, IST

2 Fig. 1. Thesis Management: Servie Orhestration. our refinement analysis, and desribe an aompanying tool. Finally, we present related work in Se. 4, and onlude in Se. 5. The work presented in this paper has been developed in the EU projet S ENSO RIA, whih aims at developing a novel omprehensive approah to the engineering of servie-oriented software systems. More about S ENSORIA may be found in [14]. 2 Modelling Servies with UML4SOA Our UML profile UML4SOA [9] enables onvenient modelling of servie-oriented systems on a platform independent level. So far, UML4SOA inluded stereotypes for modelling (a) servie orhestrations only, and was extended for the purpose of onformane heking to address (b) servie arhiteture modelling with UML omposite struture diagrams, and () servie interfae desriptions using lass diagrams (for the stati part) and protool state mahines (for the dynami part). Servie Orhestration. UML4SOA inludes a profile for modelling servie orhestrations with UML ativity diagrams. The profile employs native UML2 elements where possible, e.g. for modelling branhes, loops, and parallel ontrol flow, and extends the UML2 with servie-speifi onepts like servie alls as well as event- and ompensation handling. For details on the extension for servie orhestration, see [9]. Fig. 1 shows the orhestration of the student thesis management example taken from [9]. It models the proess of handling a student thesis from the initial topi provided by a tutor, through managing the ongoing thesis writing proess, to the final assessment and notifiation. Servie Composition Struture. The servie omposition struture desribes the partiipants in a servie oriented arhiteture and how servies may be used by partiipants. For this, we use UML2 omposite struture diagrams. To speify the servies of a SOA, UML4SOA follows the UML2 omponent-based design approah: servie stereotyped Ports represent servies, and servie provider - stereotyped Components

3 represent servie providers, that is to say, software entities that expose and offer servies to other software entities. Servie Interfaes. While the servie omposition struture gives an overview over the SOA infrastruture, it does not desribe the interfaes of the involved servies. For this task, we use UML2 lass diagrams to model servie providers, their servies, provided operations, and required allbaks. Going beyond stati servie desriptions, we use UML2 protool state mahines to desribe behavioural aspets of servie interfaes. In this way, the intended usage an be speified more preisely than by relying on operation names and message types as done e.g. in WSDL. UML protool state mahines (PrSM) are used to desribe valid interation sequenes of a port with finite state mahines onsisting of protool states and protool transitions between them. Transitions of PrSMs may ontain a preondition, event, and postondition. In UML4SOA, we use events to model inoming and outgoing messages. Pre- and postonditions are not onsidered yet, but may be in the future. Fig. 2(a) shows the protool offered to a thesis tutor by the thesis management servie provider. It speifies that the provider first requires to reeive a newtopi message, and only allowing status queries (performed by reeive getstatus and send / reply getstatus from the servie) from a tutor one the topi was piked up by a student, whih is invisible to the tutor an hene internal. In addition to the orret protool, we introdued a reeive transition from and to topiposted with the reeption of a posttopi message, hene requiring that the topi for a thesis may be posted arbitrarily often; obviously, the orhestration does not satisfy this requirement, whih is disovered by the onformane verifiation tool, as disussed in Se Analysing Servie Orhestrations One a servie orhestration and its servie interfae is modelled, the question arises whether the orhestration onforms to the defined protool whih is part of the published servie desription. In more formal terms, the question is whether the orhestration onstitutes a valid refinement of the protool. For this, we implemented an approah that (1) allows to selet servie providers and servies for heking, (2) analyses the assoiated servie orhestrations and interation protools for syntati onsisteny, (3) allows to selet failure onfigurations, (4) generates modal input/output labelled transition systems (modal I/O LTS, see [8] for the omplete formal framework) from both servie orhestrations and interation protools, (5) performs the onformane analysis and (6) outputs the results graphially. Seleting servie providers and servies. The MDD4SOA onformane heker aepts UML XMI files and allows users to selet, from the model, the servies and servie providers they would like to validate. Cheking Syntati Consisteny. Sine not all UML ativity diagrams may be translated into a modal I/O LTS, the MDD4SOA analysis tool heks the syntati onsisteny of a given servie orhestration before performing any refinement analysis, and informs the servie engineer about syntati inonsistenies found in the model. We over general onsisteny onstraints suh as forbidding non-exeutable ativities and MDD4SOA speifi onstraints restriting the branhing and forking struture.

4 Seleting Failure Configurations. Before performing the onformane analysis, the tool allows the user to hoose possible erroneous servie interations, i.e. servie interations that may fail due to unavailability of the ommuniation partner or transmission errors. By this, the user is able to adjust the generated LTS and hene analyse the servie orhestration onformane with varying fault assumptions. This feature emerged from pratie, as onformane to reasonable servie protools is only ahievable if some servie interations are assumed as being reliable. Generating Modal I/O LTS. In order to reah an answer to the question of protool onformane, a ommon semanti basis for servie orhestrations and interation protools must be found. We hose as this ommon basis modal I/O LTS. Sine the simple UML protool state mahines we use in our approah an be easily translated to modal I/O LTS, one half of the transformation is very straightforward. Servie orhestration models on the other hand use a subset of UML ativity diagram onstruts as well as the stereotypes introdued by UML4SOA. We defined a translation of servie orhestration models to modal I/O LTS by following the widespread interpretation of ativity diagrams as Petri nets in the sense that a state is a set of markers, and markers an be roughly interpreted as Petri net tokens (f. Fig. 2(b) for an extrat of the LTS generated for the thesis management orhestration). The modal I/O LTS that is onstruted from a servie orhestration S roughly onsists of states representing possible exeution states of S, and transitions from one exeution state to its suessor for eah servie interation or event that may our. An exeution state of S onsists of the orhestration S with markers of different kinds (e.g. program ounter markers, ative markers on urrently proessed sopes, or ompleted markers attahed to ativity nodes). Performing Conformane Analysis. Now that both servie orhestration and interation protool are represented as modal I/O LTS, we an verify whether a refinement exists using observational modal refinement as defined in [8]. Observational modal refinement is omputed in the MDD4SOA onformane analysis tool by starting from the pair of initial orhestration and protool states enumerating all alternative suessor pairs using and-or trees. If a pair of states is found during proess whih violates the observational modal refinement onditions in one step (by not providing a required ation or performing an illegal ation), this fat is memorized within the and-or tree, and propagated to its predeessor nodes in a final step. All propagated paths that lead (together with others or alone) to a falsifiation of the initial pair represent exeution traes that must be reported to the user, as they onstitute violation traes of the refinement between interation protool and servie orhestration. Graphial Output. Considering the thesis management example, Fig. 2() shows how an error trae is displayed: the servie orhestration does not support the reeption of posttopi after it was one reeived. The analysis result states that the servie orhestration fails to support the reeption of a posttopi message one it ompleted the first posttopi reeive ativity. The MDD4SOA onformane analysis tool is an open soure Elipse plugin available at mdd4soa.eu. The MDD4SOA tool suite also features ode generation tools that allow the generation of e.g. BPEL/WSDL ode from UML4SOA models.

5 newtopi <<reeive>> <<reeive>> newtopi() / <<r eei ve>> newtopi newtopi() / Mi ssi ngi nt opi Post ed: newtopi topiposted <<internal>> <<exept i on>> <<internal>> topiaepted <<send>> post Topi <<internal>> <<send>> <<reply>> <<reeive>> getstatus() / getstatus() / <<send&r v>> get Assessment retrievingstatus (a) Wrong Tutor Protool <<ompens.al l >> f r eetopi (b) Orhestration LTS () Resulting Analysis Output Fig. 2. Analysing with UML4SOA 4 Related Work Several proposals exists for modelling servie-oriented systems defining own UML profiles for SOA or proposing a proprietary approah. For a omparison of these approahes to our UML4SOA profile, see [9]. Several other approahes to ativity diagram semantis exist, of whih a omprehensive overview an be found in [12]. Other tools for refinement analysis based on bisimulation exist, e.g. Ti [1] and Chi [4], where the latter is also appliable to Web servies [3]. Both tools however define their own textual notations for modelling. Other approahes to analyzing servies often fous on BPEL [5,7,6], XLANG [15] or own notations (based on petri nets, e.g. [13], finite state mahines, e.g. [2], or proessaluli, e.g. [11]), entailing platform lok-in or a steeper learning urve for software engineers ompared to our UML-based approah, respetively. Furthermore, most approahes fous the analysis of single servies (e.g. verifying internal onsisteny of single BPEL proesses) or on omposability of servies (e.g. heking whether a omposition of BPEL proesses is deadlok-free or satisfies other properties). However, onformane of servies to behavioural desriptions will onstitute a vital part in servie engineering and deployment [11,10]. This may be related to the fat that the Web servie stak does not yet offer means for behavioural desription of Web servies. A partiular lose approah to ours is [15], whih generates behavioural desriptions of orhestrations instead of heking their onformane. This is an interesting approah that however does not support top-down servie engineering (first reating the desription, then the realization) as a onformane verifiation approah does. 5 Conlusion In this paper, we have addressed the problem of heking ompliane of servie orhestrations with their interations protools. We employ modal observational refinement based on a modal I/O LTS semantis of servie orhestrations and servie protools,

6 whih allows to display informative error traes to the servie engineer. Our work is built on an extension for UML2, the UML4SOA profile, whih inludes stereotypes for speifying both stati and dynami aspets of servie ompositions. As onformane between servie orhestration and interation protool is of ruial importane for (semi-) automati servie omposition, we believe that the provided ability to mehanially verify and onfirm that an orhestration follows its promised interation protool signifiantly eases ahieving error-free ommuniation between servies. With the UML4SOA profile and the MDD4SOA tool suite, our approah offers straightforward modelling, heking, and generation of SOA artefats. Referenes 1. B. T. Adler, L. de Alfaro, L. D. da Silva, M. Faella, A. Legay, V. Raman, and P. Roy. Ti: A Tool for Interfae Compatibility and Composition. In 18th Int. Conf. Computer Aided Verifiation, volume 4144 of LNCS, pages Springer, D. Berardi, D. Calvanese, G. De Giaomo, M. Lenzerini, and M. Meella. Automati Composition of E-Servies that Export Their Behavior. In 1st Int. Conf. Servie-Oriented Computing, volume 2910 of LNCS, pages Springer, D. Beyer, A. Chakrabarti, and T. A. Henzinger. Web servie interfaes. In 14th Int. Conf. on World Wide Web, pages ACM, D. Beyer, K. Chatterjee, T. A. Henzinger, and F. Y. C. Mang. Chi: Cheker for Interfae Compatibility. arindam/hi. 5. H. Foster, S. Uhitel, J. Magee, and J. Kramer. Compatibility Verifiation for Web Servie Choreography. In 3rd Int. Conf. on Web Servies, pages IEEE, X. Fu, T. Bultan, and J. Su. Analysis of Interating BPEL Web Servies. In 3rd Int. Conf. on Web Servies, pages IEEE, M. Kovás and L. Gönzy. Simulation and Formal Analysis of Workflow Models. In 5th Int. Wshp. on Graph Transformation and Visual Modeling Tehniques, Eletroni Notes in Theoretial Computer Siene, pages Elsevier, K. Larsen, U. Nyman, and A. Wasowski. Modal I/O Automata for Interfae and Produt Line Theories. In 16th Eur. Symp. on Programming, volume 4421 of LNCS, pages Springer, P. Mayer, A. Shroeder, and N. Koh. UML4SOA: Model-Driven Servie Orhestration. In 12th Int. Enterprise Computing Conf. IEEE, Meredith, L.G. and Bjorg, S. Contrats and Types. Comm. ACM, 46(10):41 47, G. Salan, L. Bordeaux, and M. Shaerf. Desribing and Reasoning on Web Servies Using Proess Algebra. In 3rd Int. Conf. on Web Servies, pages IEEE, H. Störrle. Strutured Nodes in UML 2.0 Ativities. Nord. J. of Comput., 11(3): , W. van der Aalst and M. Weske. The P2P approah to interorganizational workflows. In 13th Int. Conf. on Advaned Information Systems Engineering, volume 2068 of LNCS, pages Springer, M. Wirsing, A. Clark, S. Gilmore, M. Hölzl, A. Knapp, N. Koh, and A. Shroeder. Semanti-Based Development of Servie-Oriented Systems. In 26th Int. Conf. on Formal Methods for Networked and Distributed Systems, volume 4229 of LNCS, pages Springer, A. Wombaher and B. Mahleko. Finding trading partners to establish ad-ho business proesses. In Int. Conf. on Cooperative Information Systems, volume 2519 of LNCS, pages Springer, 2002.

A service-oriented UML profile with formal support

A service-oriented UML profile with formal support A servie-oriented UML profile with formal support Roberto Bruni 1, Matthias Hölzl 3, Nora Koh 2,3, Alberto Lluh Lafuente 1, Philip Mayer 3, Ugo Montanari 1, and Andreas Shroeder 3 1 University of Pisa,

More information

A Formal Hybrid Analysis Technique for Composite Web Services Verification

A Formal Hybrid Analysis Technique for Composite Web Services Verification A Formal Hybrid Analysis Tehnique for Composite Web Servies Verifiation MAY HAIDAR 1,2, HICHAM H. HALLAL 1 1 Computer Siene Department / Department of Eletrial Engineering Fahad Bin Sultan University P.O

More information

Exploring the Commonality in Feature Modeling Notations

Exploring the Commonality in Feature Modeling Notations Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om

More information

The SODA AOSE Methodology

The SODA AOSE Methodology The SODA AOSE Methodology Multiagent Systems LM Sistemi Multiagente LM Ambra Molesini & Andrea Omiini {ambra.molesini, andrea.omiini}@unibo.it Dipartimento di Informatia Sienza e Ingegneria (DISI) Alma

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

Test Case Generation from UML State Machines

Test Case Generation from UML State Machines Test Case Generation from UML State Mahines Dirk Seifert To ite this version: Dirk Seifert. Test Case Generation from UML State Mahines. [Researh Report] 2008. HAL Id: inria-00268864

More information

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department

More information

Parametric Abstract Domains for Shape Analysis

Parametric Abstract Domains for Shape Analysis Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Interconnection Styles

Interconnection Styles Interonnetion tyles oftware Design Following the Export (erver) tyle 2 M1 M4 M5 4 M3 M6 1 3 oftware Design Following the Export (Client) tyle e 2 e M1 M4 M5 4 M3 M6 1 e 3 oftware Design Following the Export

More information

Formal Verification by Model Checking

Formal Verification by Model Checking Formal Verifiation by Model Cheking Jonathan Aldrih Carnegie Mellon University Based on slides developed by Natasha Sharygina 15-413: Introdution to Software Engineering Fall 2005 3 Formal Verifiation

More information

CA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1

CA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1 Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0 Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer

More information

CA Unified Infrastructure Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1

CA Unified Infrastructure Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1 Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information.

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

Test Case Generation from UML State Machines

Test Case Generation from UML State Machines Test Case Generation from UML State Mahines Dirk Seifert Loria Université Nany 2 Campus Sientifique, BP 239 F-54506 Vandoeuvre lès Nany edex Dirk.Seifert@Loria.fr inria-00268864, version 2-23 Apr 2008

More information

CA Privileged Identity Manager r12.x (CA ControlMinder) Implementation Proven Professional Exam (CAT-480) Study Guide Version 1.5

CA Privileged Identity Manager r12.x (CA ControlMinder) Implementation Proven Professional Exam (CAT-480) Study Guide Version 1.5 Proven Professional Exam (CAT-480) Study Guide Version 1.5 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Verification of Parameterized Concurrent Programs By Modular Reasoning about Data and Control

Verification of Parameterized Concurrent Programs By Modular Reasoning about Data and Control Verifiation of Parameterized Conurrent Programs By Modular Reasoning about Data and Control Azadeh Farzan Zahary Kinaid University of Toronto azadeh,zkinaid@s.toronto.edu Abstrat In this paper, we onsider

More information

CA Identity Suite 14.x Implementation Proven Professional Exam (CAT-760) Study Guide Version 1.1

CA Identity Suite 14.x Implementation Proven Professional Exam (CAT-760) Study Guide Version 1.1 Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2018 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized use,

More information

Introductory Programming, IMM, DTU Systematic Software Test. Software test (afprøvning) Motivation. Structural test and functional test

Introductory Programming, IMM, DTU Systematic Software Test. Software test (afprøvning) Motivation. Structural test and functional test Introdutory Programming, IMM, DTU Systemati Software Test Peter Sestoft a Programs often ontain unintended errors how do you find them? Strutural test Funtional test Notes: Systemati Software Test, http://www.dina.kvl.dk/

More information

- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger.

- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger. - 1 - S 21 Diretory-based Administration of Virtual Private Networks: Poliy & Configuration Charles A Kunzinger kunzinge@us.ibm.om - 2 - Clik here Agenda to type page title What is a VPN? What is VPN Poliy?

More information

CA Privileged Access Manager 3.x Proven Implementation Professional Exam (CAT-661) Study Guide Version 1.0

CA Privileged Access Manager 3.x Proven Implementation Professional Exam (CAT-661) Study Guide Version 1.0 Exam (CAT-661) Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFMATION 2018 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

Chapter 2: Introduction to Maple V

Chapter 2: Introduction to Maple V Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard

More information

COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems

COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems Andreas Brokalakis Synelixis Solutions Ltd, Greee brokalakis@synelixis.om Nikolaos Tampouratzis Teleommuniation

More information

CA Agile Requirements Designer 2.x Implementation Proven Professional Exam (CAT-720) Study Guide Version 1.0

CA Agile Requirements Designer 2.x Implementation Proven Professional Exam (CAT-720) Study Guide Version 1.0 Exam (CAT-720) Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

A Visualization Technique for Unit Testing and Static Checking with Caller Callee Relationships

A Visualization Technique for Unit Testing and Static Checking with Caller Callee Relationships A Visualization Tehnique for Unit Testing and Stati Cheking with Caller Callee Relationships Yuko Muto, Kozo Okano, Shinji Kusumoto Graduate Shool of Information Siene and Tehnology Osaka University Suita,

More information

Towards an Axiomatic Semantics of P Systems

Towards an Axiomatic Semantics of P Systems Towards an Axiomati Semantis of P Systems Roberto Barbuti Andrea Maggiolo Shettini Paolo Milazzo Simone Tini. Dipartimento di Informatia, Università di Pisa, Italy. Dipartimento di Sienze della Cultura,

More information

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

1. Introduction. 2. The Probable Stope Algorithm

1. Introduction. 2. The Probable Stope Algorithm 1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground

More information

Adobe Certified Associate

Adobe Certified Associate Adobe Certified Assoiate About the Adobe Certified Assoiate (ACA) Program The Adobe Certified Assoiate (ACA) program is for graphi designers, Web designers, video prodution designers, and digital professionals

More information

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,

More information

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Partial Character Decoding for Improved Regular Expression Matching in FPGAs Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia

More information

XML Data Streams. XML Stream Processing. XML Stream Processing. Yanlei Diao. University of Massachusetts Amherst

XML Data Streams. XML Stream Processing. XML Stream Processing. Yanlei Diao. University of Massachusetts Amherst XML Stream Proessing Yanlei Diao University of Massahusetts Amherst XML Data Streams XML is the wire format for data exhanged online. Purhase orders http://www.oasis-open.org/ommittees/t_home.php?wg_abbrev=ubl

More information

Zippy - A coarse-grained reconfigurable array with support for hardware virtualization

Zippy - A coarse-grained reconfigurable array with support for hardware virtualization Zippy - A oarse-grained reonfigurable array with support for hardware virtualization Christian Plessl Computer Engineering and Networks Lab ETH Zürih, Switzerland plessl@tik.ee.ethz.h Maro Platzner Department

More information

Speeding up Consensus by Chasing Fast Decisions

Speeding up Consensus by Chasing Fast Decisions Speeding up Consensus by Chasing Fast Deisions Balaji Arun, Sebastiano Peluso, Roberto Palmieri, Giuliano Losa, Binoy Ravindran ECE, Virginia Teh, USA {balajia,peluso,robertop,giuliano.losa,binoy}@vt.edu

More information

Multi-Channel Wireless Networks: Capacity and Protocols

Multi-Channel Wireless Networks: Capacity and Protocols Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:

More information

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr

More information

Dynamic Algorithms Multiple Choice Test

Dynamic Algorithms Multiple Choice Test 3226 Dynami Algorithms Multiple Choie Test Sample test: only 8 questions 32 minutes (Real test has 30 questions 120 minutes) Årskort Name Eah of the following 8 questions has 4 possible answers of whih

More information

CA Service Desk Manager 14.x Implementation Proven Professional Exam (CAT-181) Study Guide Version 1.3

CA Service Desk Manager 14.x Implementation Proven Professional Exam (CAT-181) Study Guide Version 1.3 Exam (CAT-181) Study Guide Version 1.3 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,

More information

Reverse Engineering of Assembler Programs: A Model-Based Approach and its Logical Basis

Reverse Engineering of Assembler Programs: A Model-Based Approach and its Logical Basis Reverse Engineering of Assembler Programs: A Model-Based Approah and its Logial Basis Tom Lake and Tim Blanhard, InterGlossa Ltd., Reading, UK Tel: +44 174 561919 email: {Tom.Lake,Tim.Blanhard}@glossa.o.uk

More information

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion

More information

CA Single Sign-On 12.x Proven Implementation Professional Exam (CAT-140) Study Guide Version 1.5

CA Single Sign-On 12.x Proven Implementation Professional Exam (CAT-140) Study Guide Version 1.5 Study Guide Version 1.5 PROPRIETARY AND CONFIDENTIAL INFORMATION 2018 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized use,

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8

Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8 Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center Construting Transation Serialization Order for Inremental Data Warehouse Refresh Ming-Ling Lo and Hui-I Hsiao IBM T. J. Watson Researh Center July 11, 1997 Abstrat In typial pratie of data warehouse, the

More information

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,

More information

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Make your process world

Make your process world Automation platforms Modion Quantum Safety System Make your proess world a safer plae You are faing omplex hallenges... Safety is at the heart of your proess In order to maintain and inrease your ompetitiveness,

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm

More information

Mining effective design solutions based on a model-driven approach

Mining effective design solutions based on a model-driven approach ata Mining VI 463 Mining effetive design solutions based on a model-driven approah T. Katsimpa 2, S. Sirmakessis 1,. Tsakalidis 1,2 & G. Tzimas 1,2 1 Researh ademi omputer Tehnology Institute, Hellas 2

More information

PERSISTENT NAMING FOR PARAMETRIC MODELS

PERSISTENT NAMING FOR PARAMETRIC MODELS PERSISTENT NAMING FOR PARAMETRIC MODELS Dago AGBODAN, David MARCHEIX and Guy PIERRA Laboratory of Applied Computer Siene (LISI) National Shool of Engineers in Mehanis and Aeronautis (ENSMA) Téléport 2

More information

Improved flooding of broadcast messages using extended multipoint relaying

Improved flooding of broadcast messages using extended multipoint relaying Improved flooding of broadast messages using extended multipoint relaying Pere Montolio Aranda a, Joaquin Garia-Alfaro a,b, David Megías a a Universitat Oberta de Catalunya, Estudis d Informàtia, Mulimèdia

More information

13.1 Numerical Evaluation of Integrals Over One Dimension

13.1 Numerical Evaluation of Integrals Over One Dimension 13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied

More information

CA API Management 8.x Implementation Proven Professional Exam (CAT-560) Study Guide Version 1.1

CA API Management 8.x Implementation Proven Professional Exam (CAT-560) Study Guide Version 1.1 Exam (CAT-560) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

High-level Robot Programming and Program Execution.

High-level Robot Programming and Program Execution. High-level Robot Programming and Program Exeution Abstrat We propose a logial framework for robot programming whih allows the seamless integration of expliit agent programming with planning and with monitoring

More information

Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis

Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Journal of Computer Siene 4 (): 9-97, 008 ISSN 549-3636 008 Siene Publiations Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Deepti Gaur, Aditya Shastri and Ranjit Biswas Department of Computer

More information

A Novel Timestamp Ordering Approach for Co-existing Traditional and Cooperative Transaction Processing

A Novel Timestamp Ordering Approach for Co-existing Traditional and Cooperative Transaction Processing A Novel Timestamp Ordering Approah for Co-existing Traditional and Cooperative Transation Proessing Author Sun, Chengzheng, Zhang, Y., Kambayashi, Y., Yang, Y. Published 1998 Conferene Title Proeedings

More information

Multiple-Criteria Decision Analysis: A Novel Rank Aggregation Method

Multiple-Criteria Decision Analysis: A Novel Rank Aggregation Method 3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr

More information

Boosted Random Forest

Boosted Random Forest Boosted Random Forest Yohei Mishina, Masamitsu suhiya and Hironobu Fujiyoshi Department of Computer Siene, Chubu University, 1200 Matsumoto-ho, Kasugai, Aihi, Japan {mishi, mtdoll}@vision.s.hubu.a.jp,

More information

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive

More information

CONTROL SYSTEMS ANALYSIS & DESIGN SERVER. F. Morilla*, A. Fernández +, S. Dormido Canto*

CONTROL SYSTEMS ANALYSIS & DESIGN SERVER. F. Morilla*, A. Fernández +, S. Dormido Canto* CONTROL SYSTEMS ANALYSS & ESGN SERVER F. Morilla*, A. Fernández +, S. ormido Canto* * pto de nformátia y Automátia, UNE, Avda. Senda del Rey 9, 28040 Madrid, Spain. Phone:34-91-3987156, Fax:34-91-3986697,

More information

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Ho Wireless Networks Giorgio Quer, Federio Librino, Lua Canzian, Leonardo Badia, Mihele Zorzi, University of California San Diego La

More information

Automated System for the Study of Environmental Loads Applied to Production Risers Dustin M. Brandt 1, Celso K. Morooka 2, Ivan R.

Automated System for the Study of Environmental Loads Applied to Production Risers Dustin M. Brandt 1, Celso K. Morooka 2, Ivan R. EngOpt 2008 - International Conferene on Engineering Optimization Rio de Janeiro, Brazil, 01-05 June 2008. Automated System for the Study of Environmental Loads Applied to Prodution Risers Dustin M. Brandt

More information

mahines. HBSP enhanes the appliability of the BSP model by inorporating parameters that reet the relative speeds of the heterogeneous omputing omponen

mahines. HBSP enhanes the appliability of the BSP model by inorporating parameters that reet the relative speeds of the heterogeneous omputing omponen The Heterogeneous Bulk Synhronous Parallel Model Tiani L. Williams and Rebea J. Parsons Shool of Computer Siene University of Central Florida Orlando, FL 32816-2362 fwilliams,rebeag@s.uf.edu Abstrat. Trends

More information

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,

More information

Automatic Generation of Transaction-Level Models for Rapid Design Space Exploration

Automatic Generation of Transaction-Level Models for Rapid Design Space Exploration Automati Generation of Transation-Level Models for Rapid Design Spae Exploration Dongwan Shin, Andreas Gerstlauer, Junyu Peng, Rainer Dömer and Daniel D. Gajski Center for Embedded Computer Systems University

More information

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

Anonymity Trilemma: Strong Anonymity, Low Bandwidth, Low Latency Choose Two

Anonymity Trilemma: Strong Anonymity, Low Bandwidth, Low Latency Choose Two Anonymity Trilemma: Strong Anonymity, Low Bandwidth, Low Lateny Choose Two Debajyoti Das Purdue University, USA das48@purdue.edu Sebastian Meiser University College London, U s.meiser@ul.a.uk Esfandiar

More information

Bring Your Own Coding Style

Bring Your Own Coding Style Bring Your Own Coding Style Naoto Ogura, Shinsuke Matsumoto, Hideaki Hata and Shinji Kusumoto Graduate Shool of Information Siene and Tehnology, Osaka University, Japan {n-ogura, shinsuke, kusumoto@ist.osaka-u.a.jp

More information

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,

More information

Parallelizing Frequent Web Access Pattern Mining with Partial Enumeration for High Speedup

Parallelizing Frequent Web Access Pattern Mining with Partial Enumeration for High Speedup Parallelizing Frequent Web Aess Pattern Mining with Partial Enumeration for High Peiyi Tang Markus P. Turkia Department of Computer Siene Department of Computer Siene University of Arkansas at Little Rok

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,

More information

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in

More information

Total 100

Total 100 CS331 SOLUTION Problem # Points 1 10 2 15 3 25 4 20 5 15 6 15 Total 100 1. ssume you are dealing with a ompiler for a Java-like language. For eah of the following errors, irle whih phase would normally

More information

Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday

Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday Eletroni Communiations of the EASST Volume 26 (2010) Manipulation of Graphs, Algebras and Pitures Essays Dediated to Hans-Jörg Kreowski on the Oasion of His 60th Birthday Autonomous Units for Solving the

More information

Intra- and Inter-Stream Synchronisation for Stored Multimedia Streams

Intra- and Inter-Stream Synchronisation for Stored Multimedia Streams IEEE International Conferene on Multimedia Computing & Systems, June 17-23, 1996, in Hiroshima, Japan, p 372-381 Intra- and Inter-Stream Synhronisation for Stored Multimedia Streams Ernst Biersak, Werner

More information

Sparse Certificates for 2-Connectivity in Directed Graphs

Sparse Certificates for 2-Connectivity in Directed Graphs Sparse Certifiates for 2-Connetivity in Direted Graphs Loukas Georgiadis Giuseppe F. Italiano Aikaterini Karanasiou Charis Papadopoulos Nikos Parotsidis Abstrat Motivated by the emergene of large-sale

More information

Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks

Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 2, FEBRUARY 2013 289 Disovery and Verifiation of Neighbor Positions in Mobile Ad Ho Networks Maro Fiore, Member, IEEE, Claudio Ettore Casetti, Member,

More information

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

Evolutionary Feature Synthesis for Image Databases

Evolutionary Feature Synthesis for Image Databases Evolutionary Feature Synthesis for Image Databases Anlei Dong, Bir Bhanu, Yingqiang Lin Center for Researh in Intelligent Systems University of California, Riverside, California 92521, USA {adong, bhanu,

More information

C 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2)

C 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2) SPECIAL ISSUE OF IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION: MULTI-ROBOT SSTEMS, 00 Distributed reonfiguration of hexagonal metamorphi robots Jennifer E. Walter, Jennifer L. Welh, and Nany M. Amato Abstrat

More information

Verifying Cyber-Physical Systems by Combining Software Model Checking with Hybrid Systems Reachability

Verifying Cyber-Physical Systems by Combining Software Model Checking with Hybrid Systems Reachability Verifying Cyber-Physial Systems by Combining Software Model Cheking with Hybrid Systems Reahability ABSTRACT Stanley Bak stanleybak@gmail.om Cyber-physial systems (CPS) span the ommuniation, omputation

More information

Numerical simulation of hemolysis: a comparison of Lagrangian and Eulerian modelling

Numerical simulation of hemolysis: a comparison of Lagrangian and Eulerian modelling Modelling in Mediine and Biology VI 361 Numerial simulation of hemolysis: a omparison of Lagrangian and Eulerian modelling S. Pirker 1, H. Shima 2 & M. Stoiber 2 1 Johannes Kepler University, 4040 Linz,

More information

Cluster-based Cooperative Communication with Network Coding in Wireless Networks

Cluster-based Cooperative Communication with Network Coding in Wireless Networks Cluster-based Cooperative Communiation with Network Coding in Wireless Networks Zygmunt J. Haas Shool of Eletrial and Computer Engineering Cornell University Ithaa, NY 4850, U.S.A. Email: haas@ee.ornell.edu

More information

Improved Circuit-to-CNF Transformation for SAT-based ATPG

Improved Circuit-to-CNF Transformation for SAT-based ATPG Improved Ciruit-to-CNF Transformation for SAT-based ATPG Daniel Tille 1 René Krenz-Bååth 2 Juergen Shloeffel 2 Rolf Drehsler 1 1 Institute of Computer Siene, University of Bremen, 28359 Bremen, Germany

More information