Petri Nets for Object-Oriented Modeling
|
|
- Lewis Sharp
- 5 years ago
- Views:
Transcription
1 Peri Nes for Objec-Oriened Modeling Sefan Wi Absrac Ensuring he correcness of concurren rograms is difficul since common aroaches for rogram design do no rovide aroriae mehods This aer gives a brief inroducion o Objec Colored Peri Nes which can be used for modeling he conrol flow of concurren rograms for heir simulaion and for deriving and roving secific roeries Emhasis will no rely uon he recise formal definiions bu raher on he conces and alicaions The aer is inended o give comuer scieniss who are no familiar wih Peri nes a shor overview of hem esecially of objecoriened nes 1 Inroducion Objec-oriened modeling requires formal echniques o handle he srucure of comlex sysems There are many differen aroaches such as he Objec Modeling Technique OMT or he Unified Modeling Language UML These are exensively used nowadays and hey rovide very good means for modeling he saic srucure of objec-oriened sysems ha means he classes and heir relaionshi They also roose mehods for describing dynamic asecs like dynamically generaed objecs in Objec Ineracion Diagrams or objec saes in Sae Diagrams Bu hese echniques for objec-oriened modeling lack formal mehods for describing concurrency Some echniques have been roosed bu hey do no rovide as much flexibiliy as Peri nes This aer inroduces Peri nes for objec-oriened modeling Peri nes are a formal aroach for modeling acions which are carried ou by concurren rocesses on a comuer Elemenary Peri Nes are defined in secion They are inroduced formally in order o give an imression of he necessary mahemaics ha is used o rove secific roeries of Peri nes The rinciles of exending hem o Higher Peri Nes are described in he hird ar In he main secion secion 4 Objec Colored Peri Nes are briefly inroduced which are a formal echnique for modeling concurren objecoriened sysems Finally a summary is given in secion 5 Elemenary Peri Nes A Peri ne describes he saic relaionshi beween concurren acions of rocesses as well as heir dynamic behavior during heir execuion The saic srucure of a Peri ne consiss of ransiions which deic he acions laces which are recondiions and oscondiions of he acions and a flow relaion ha models he inerdeendence of he ransiions and laces Formally hese can be defined as follows: Definiion A ne is a ule is he se of laces is he se of ransiions! " # and is he flow relaion Furhermore and mus be fulfilled 1
2 f A m K{ K{ m H Peri nes can be visualized in grahs Places are deiced as circles ransiions as squares and elemens of he flow relaion are drawn as arrows $ %'&() &+* &+- &/0 An examle is shown in figure 1 which resens he grah of a ne wih 1 $%'() 45*60 7 $%8 9&() '(:: ; '() &4*<= '() &4->: 9&4*? 5*: 9&4-? 5*: 5* &4<=0 and '( 5* The acions which are modeled by ransiions and can be carried ou concurrenly because he recondiion of one ransiion is no a oscondiion of he oher one 1 1 Figure 1: A Peri ne Since nes describe only he sa- ic srucure of acions hey are exended o lace/ransiion nes ha model he dynamic behavior This is done using okens which lie in laces if he corresonding condiion is fulfilled A ransiion swiches by aking okens from he recondiion laces and uing new okens in he oscondiion laces A comlee and formal definiion will be given now sulied from [4] and ' ' AB CD EFG Definiion A lace/ransiion ne is a ule Is ordered elemens are defined as follows: 1 4 and are a finie ne ie a ne wih a finie number of laces and ransiions AIHJ K LDM%>NO0 N is a caaciy funcion for each lace defined as where is an infinie caaciy CPH+ QR ST U VR WK LDXY%<Z[0 is a weigh U\] '^_` funcion ha aaches a weigh a Cb \] '^[W cz o each arc of he flow relaion If and only if hen E F H8 dk$le%>no0 is an iniial marking which indicaes he number of okens in each lace I resecs he caaciies ie f & a dh6e F g&ihjak g&+ The following definiion gives he swiching rule also called firing rule for lace/ransiion ne (see also [4]): l ' ' AB CD E F Definiion Le be a ne a 1 The recondiion se of a ransiion is defined as m nho %'&eqr 9&] ' a s0 Similarly he oscondiion se of is defined as m Ho %'&q[ = & a s0 A funcion H4 KuLeT%>NO0 is called a marking of if f & a vh g&yh Ak g& a A ransiion is enabled in if f & a ih g&iw!cb 9&] and f & a 9&+]xkCb U= &+ih!ay 9&+ This is denoed as z a 4 A ransiion swiches or fires o a follower marking of if K{ z and & a H g&} 9&+ { Cb g&] ']xkcb U= & This is denoed as z 4
3 ~ d ' 'A C 'E F An examle is given in figure which shows he Peri ne wih V%'&S(< &+* &4-)0 c V%'(G0 V%8 9&() '(:: '() &4*>: U'( &+-=0 A H:&(O KƒN &4* KƒN &4- K1N C H4 g&( '(>} KI [ < U'() &4*<} KI / U'(G &4-< K ˆ E F H& ( K / & * KŠˆ6 & - KI and The lef E ( E F side of figure shows he iniial marking he righ side shows C he marking afer swiching of ransiion 1 According o he arc weighs given by he ransiion akes E okens ( H[& ( & ( ou KPˆ? & & * of * laces KŒ / & & - - okens KŒ ino and one ino The new marking is hus Noe ha he number of inu okens may differ from he number of ouu okens ie a ransiion can absorb and generae okens Figure : Swiching a ransiion of an Elemenary Peri Ne On he lef he marking before he swiching is shown and on he righ he marking aferwards 1 Exensions of Elemenary Peri Nes Since he firs inroducion of Peri Nes by CA Peri in 196 differen exensions of Elemenary Peri Nes have been defined so-called Higher Peri Nes The basic idea of hese exensions is he usage of individual okens insead of elemenary ones In Colored Peri Nes each oken is of a cerain ye and each arc of he ne is inscribed wih a ye A ransiion can be enabled in a marking only if he okens in he recondiion se are of he yes he arcs require A se furher is he idea of using nes as okens insead of elemenary okens This resuls in a wo-level hierarchy of nes consising of one sysem ne and many oken nes These nes are called higher order Peri nes However hey are no furher regarded in his aer For objec-oriened modeling differen Peri nes have been defined Elemenary Objec Nes as described in [5] use Elemenary Peri Nes as okens and a swiching rule which regards boh he sae of he Sysem Ne and he Objec Ne (he okens) There is only one objec ne and hus he flexibiliy of Elemenary Objec Nes is resriced and no suiable for objec-oriened modeling Therefore hey are mainly used in workflow rocess modeling
4 Newer aroaches inroduce Higher Peri Nes for objec-oriened modeling which are used for formal modeling of concurren rocesses in racically used objec-oriened languages There are wo differen aroaches: Hierarchichal Objec-Oriened Peri Nes [1] and Objec Colored Peri Nes [] The laer will be described in more deail in he following secion and examles will be given Hierarchical Objec-Oriened Peri Nes are no followed in his aer since heir basic ideas are similar o Objec Colored Peri Nes for insance hey also use communicaion ransiions (called absrac ransiions ) for invoking mehods of oher nes 4 Objec Colored Peri Nes Objec Colored Peri Nes are a comound of saic class nes which describe he behavior of an objec class and dynamically generaed objec nes which are insances of class nes They have been defined in [] esecially for objec-oriened design of concurren rogram sysems Therefore hey reflec he asecs of objec-oriened rogramming such as dynamic generaion of objecs communicaion beween objecs and inheriance A class ne which is formally defined in [] is a Peri ne wih he following exensions comared o Elemenary Peri Nes: 1 I is a Colored Peri Ne ie he okens are of differen yes and he ransiions are enabled in a marking if he recondiion ses conain markings of he ye secified by he arcs from he recondiion laces o he ransiion Predefined yes are for anonymous okens and OID for objec idenifiers Objec idenifiers are used o reference o a secific objec ne There are differen ransiion yes: Normal ransiions and communicaion ransiions (IN OUT INV and REC) which are used for mehod invocaions (see below) A ransiion canno be of more han one ye Each lace is inscribed wih a ye and only okens of ha secific ye can be u ino he lace aend(x) x x aend ok ok aend() IN elem INT xs x::xs lis INT LIST aendok Figure : Funcion aend modeled as a service of a class ne OUT An examle of a class ne is given in figure similar o an examle from [] I shows he model of an aend mehod in a lis class ha can sore ineger values The mehod arameer \ is an ineger which is o be aended o he lis The model 4
5 consiss of an inu ransiion aend(x) an ouu ransiion aend() and a normal ransiion aend The inu ransiion is swiches every ime he mehod is invoked wih he arameer \ (see below) and laces one oken of ye INT ino he lace elem Noe ha he lace elem can only conain okens of INT The aend ransiion erforms he aend oeraion by uing he ineger value \ and he old lis \ ino he lis lace and aking he new lis \ from i I also us an anonym oken ie an unyed oken ino he lace aendok Finally he ouu ransiion aend() fires when he aend oeraion is done A call of he aend mehod is shown in figure 4 This class ne invokes he aend mehod by firing he idaendcall() ransiion which is marked as an invocaion I requires an INT oken ie an ineger value from lace elem and an objec idenifier of he ye OID ha idenifies he objec insance of he called elem INT aendok mylis OID y ok id id idaendcall(x) INV idaendret(x) REC Figure 4: Class ne calling he service aend mehod The conrol flow is given o he called mehod and when he call reurns he idaendret(x) ransiion which is of he receive ye swiches and us an anonymous oken ino he aendok lace This is indicaed by he doed arrow in figure 4 The dynamic asec of Objec Colored Peri Nes is he creaion and deleion of objec nes They are creaed by he funcion new which is a reserved funcion ha is globally defined I assigns a unique idenifier o he calling class ne and adds he new objec ne o he global se of nes An examle is shown in figure 5: The class ne A creaes a new insance of class ne B whenever ransiion Ž swiches An objec idenifier for he new objec ne is u ino lace Ž & - The creaed objec ne of class B looks like he class ne B and is addressed by a unique idenifier * ok ok a a 1 b b 1 ok ok a ok new B ok 1 a a b1 b OID Class Ne A ok ok Class Ne B Figure 5: Creaion of Objec Nes The lef side shows he class ne A which generaes a new insance of class ne B shown on he righ side Aar from dynamic generaion of objecs and mehod invocaion anoher objecoriened conce can be modeled using Objec Colored Peri Nes he inheriance relaion beween classes This is done by defining a subye relaion for he mehod signaures of a class For deails on his refer o [] 5
6 5 Summary In his aer an aroach for objec-oriened modeling wih Peri nes has been inroduced Objec Colored Peri Nes They rovide a formal mehod for describing boh saic and dynamic asecs of a sysem The saic srucure consiss of he class definiions along wih heir mehods and he class hierarchy The dynamic asecs are dynamically generaed objec nes and mehod invocaion Objec Colored Peri Nes can be used for simulaing he conrol flow of rogram sysems and for roving is correcness They are esecially good for objec-oriened rograms ha use concurrency because hey are mahemaically well undersood and hus rogram roeries can be derived from hem An examle is examinaion if deadlocks can occur in a aricular concurren rogram see [4] Using a Peri ne simulaor like Renew [] he modeling can be done comuer aided and furhermore roeries of modeled nes can be derived auomaically References [1] Jang-Eui Hong Doo-Hwan Bae Sofware modeling and analysis using a hierarchical objec-oriened Peri ne In Informaion Science Vol 10 no 1 4 ages Elsevier Science 000 [] Chrisoh Maier Daniel Mold Objec Coloured Peri Nes A Formal Technique for Objec Oriened Modelling In Gul A Agha Fiorella De Cindio Grzegorz Rozenberg ediors Concurren Objec-Oriened Programming and Peri Nes ages Sringer-Verlag Berlin Heidelberg New York 001 [] Renew The Reference Ne Worksho Available a h://wwwrenewde [4] Wolfgang Reisig Peri Nes An Inroducion Sringer-Verlag Berlin Heidelberg 1985 [5] Rüdiger Valk Peri Nes as Token Objecs An Inroducion o Elemenary Objec Nes In Jörg Desel Manuel Silva ediors Alicaion and Theory of Peri Nes 1998 ages 1 5 Sringer-Verlag Berlin Heidelberg New York
Gauss-Jordan Algorithm
Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried
More informationPART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR
. ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral
More informationA Matching Algorithm for Content-Based Image Retrieval
A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using
More informationLecture 18: Mix net Voting Systems
6.897: Advanced Topics in Crypography Apr 9, 2004 Lecure 18: Mix ne Voing Sysems Scribed by: Yael Tauman Kalai 1 Inroducion In he previous lecure, we defined he noion of an elecronic voing sysem, and specified
More informationNEWTON S SECOND LAW OF MOTION
Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during
More informationA new method for 3-dimensional roadway design using visualization techniques
Urban Transor XIII: Urban Transor and he Environmen in he 2s Cenury 23 A new mehod for 3-dimensional roadway design using visualizaion echniques G. Karri & M. K. Jha Dearmen of Civil Engineering, Morgan
More informationDiscrete Event Systems. Lecture 14: Discrete Control. Continuous System. Discrete Event System. Discrete Control Systems.
Lecure 14: Discree Conrol Discree Even Sysems [Chaper: Sequenial Conrol + These Slides] Discree Even Sysems Sae Machine-Based Formalisms Saechars Grafce Laboraory 2 Peri Nes Implemenaion No covered in
More informationSam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.
8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged
More informationScheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012
EDA421/DIT171 - Parallel and Disribued Real-Time Sysems, Chalmers/GU, 2011/2012 Lecure #4 Updaed March 16, 2012 Aemps o mee applicaion consrains should be done in a proacive way hrough scheduling. Schedule
More informationPointer Analysis. Outline: What is pointer analysis Intraprocedural pointer analysis Interprocedural pointer analysis. Andersen and Steensgaard
Poiner anaysis Poiner Anaysis Ouine: Wha is oiner anaysis Inrarocedura oiner anaysis Inerrocedura oiner anaysis Andersen and Seensgaard Poiner and Aias Anaysis Aiases: wo exressions ha denoe he same memory
More informationSyntax Specification by Graph Grammars and Meta-Models
Ou Synax Speciicaion by Graph Grammars and Mea-Models Mark Minas Insiue or Soware Technology Universiä der Bundeswehr München Germany (Some) Dimensions o Visual Languages & Ediors DiaGen Edior archiecure
More informationLearning in Games via Opponent Strategy Estimation and Policy Search
Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen
More information1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom.
DRUM SET KEY Hi-ha Cmbal Clave block Cowbell (mouh) 0 Cowbell (neck) Floor om (shell) Hi om Mid om Snare Floor om Snare cross sick or clave block Bass drum Hi-ha wih foo 8 Odd Meer Clave Conor Guilfole
More informationIntroduction to Data-Driven Animation: Programming with Motion Capture Jehee Lee
Inroducion o Daa-Driven Animaion: Programming wih Moion Caure Jehee Lee Seoul Naional Universiy Daa-Driven Animaion wih Moion Caure Programming wih Moion Caure Why is i difficul? Encomass a lo of heerogeneous
More informationA Formalization of Ray Casting Optimization Techniques
A Formalizaion of Ray Casing Opimizaion Techniques J. Revelles, C. Ureña Dp. Lenguajes y Sisemas Informáicos, E.T.S.I. Informáica, Universiy of Granada, Spain e-mail: [jrevelle,almagro]@ugr.es URL: hp://giig.ugr.es
More informationCoded Caching with Multiple File Requests
Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a
More informationVoltair Version 2.5 Release Notes (January, 2018)
Volair Version 2.5 Release Noes (January, 2018) Inroducion 25-Seven s new Firmware Updae 2.5 for he Volair processor is par of our coninuing effors o improve Volair wih new feaures and capabiliies. For
More informationImplementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)
Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,
More informationtr_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Report no TR-22/88
r_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Repor no TR-22/88 Deparmen of Compuer Science and Sysems McMaser Universiy 1988 McESE-FranzLISP: McMASTER
More informationShortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.
Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah
More informationIDEF3 Process Description Capture Method
IDEF3 Process Descripion Capure Mehod IDEF3 is par of he IDEF family of mehods developmen funded by he US Air Force o provide modelling suppor for sysems engineering and enerprise inegraion 2 IDEF3 Mehod
More informationEvaluation and Improvement of Region-based Motion Segmentation
Evaluaion and Improvemen of Region-based Moion Segmenaion Mark Ross Universiy Koblenz-Landau, Insiue of Compuaional Visualisics, Universiässraße 1, 56070 Koblenz, Germany Email: ross@uni-koblenz.de Absrac
More informationWhy not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems
Simulaion Wha is simulaion? Simple synonym: imiaion We are ineresed in sudying a Insead of experimening wih he iself we experimen wih a model of he Experimen wih he Acual Ways o sudy a Sysem Experimen
More information4 Error Control. 4.1 Issues with Reliable Protocols
4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can
More informationData Structures and Algorithms
Daa Srucures and Algorihms The maerial for his lecure is drawn, in ar, from The Pracice of Programming (Kernighan & Pike) Chaer 2 1 Goals of his Lecure Hel you learn (or refresh your memory) abou: Common
More informationSTEREO PLANE MATCHING TECHNIQUE
STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo
More informationEfficient Computation of Parameterized Pointer Information for Interprocedural Analyses
Efficien Comuaion of Parameerized Poiner Informaion for Inerrocedural Analyses Donlin Lian and Mary Jean Harrold Collee of Comuin Georia Insiue of Technoloy Alana, GA 30332, USA {dlian,harrold}@cc.aech.edu
More informationNetwork management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);
QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is
More informationAML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves
AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves
More informationMORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES
MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image
More informationControl of Job Arrivals with Processing Time Windows into Batch Processor Buffer
onrol of Job Arrivals wih Processing ime Windows ino Bach Processor John Benedic. AJAN 1, Aa Iyer SIVAKUMAR 1, and Sanley B. GERSHWIN 2 1 Nanyang echnological Universiy 2 Massachuses Insiue of echnology
More informationSimple Network Management Based on PHP and SNMP
Simple Nework Managemen Based on PHP and SNMP Krasimir Trichkov, Elisavea Trichkova bsrac: This paper aims o presen simple mehod for nework managemen based on SNMP - managemen of Cisco rouer. The paper
More informationNURBS rendering in OpenSG Plus
NURS rering in OpenSG Plus F. Kahlesz Á. alázs R. Klein Universiy of onn Insiue of Compuer Science II Compuer Graphics Römersrasse 164. 53117 onn, Germany Absrac Mos of he indusrial pars are designed as
More informationFIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS
FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2
More informationAnalysis of Various Types of Bugs in the Object Oriented Java Script Language Coding
Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened
More informationAxiomatic Foundations and Algorithms for Deciding Semantic Equivalences of SQL Queries
Axiomaic Foundaions and Algorihms for Deciding Semanic Equivalences of SQL Queries Shumo Chu, Brendan Murphy, Jared Roesch, Alvin Cheung, Dan Suciu Paul G. Allen School of Compuer Science and Engineering
More informationAn efficient approach to improve throughput for TCP vegas in ad hoc network
Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: 395-0056 Volume: 0 Issue: 03 June-05 www.irje.ne p-issn: 395-007 An efficien approach o improve hroughpu for TCP vegas in ad hoc
More informationSecurity aspects of the Authentication used in Quantum Cryptography
SECURITY ASPECTS OF THE AUTHENTICATION USED IN QUANTUM CRYPTOGRAPHY Securiy asecs of he Auhenicaion used in Quanum Cryograhy Jörgen Cederlöf and Jan-Åe Larsson jc@lysaor.liu.se and jalar@mai.liu.se) Maemaisa
More informationConcurrency Control and Recovery in Transactional Process Management
In: Proceedings of he ACM Symposium on Principles of Daabase Sysems (PODS 99), pages 316-326, Philadelphia, Pennsylvania, USA, May/June, 1999. Concurrency Conrol and Recovery in Transacional Process Managemen
More informationIn fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps
In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magneic Field Maps A. D. Hahn 1, A. S. Nencka 1 and D. B. Rowe 2,1 1 Medical College of Wisconsin, Milwaukee, WI, Unied
More informationAn Improved Square-Root Nyquist Shaping Filter
An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com
More informationMATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008
MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o
More informationLocation. Electrical. Loads. 2-wire mains-rated. 0.5 mm² to 1.5 mm² Max. length 300 m (with 1.5 mm² cable). Example: Belden 8471
Produc Descripion Insallaion and User Guide Transiser Dimmer (454) The DIN rail mouned 454 is a 4channel ransisor dimmer. I can operae in one of wo modes; leading edge or railing edge. All 4 channels operae
More informationStreamline Pathline Eulerian Lagrangian
Sreamline Pahline Eulerian Lagrangian Sagnaion Poin Flow V V V = + = + = + o V xi y j a V V xi y j o Pahline and Sreakline Insananeous Sreamlines Pahlines Sreaklines Maerial Derivaive Acceleraion
More informationVisualizing Complex Notions of Time
Visualizing Complex Noions of Time Rober Kosara, Silvia Miksch Insiue of Sofware Technology, Vienna Universiy of Technology, Vienna, Ausria Absrac Time plays an imporan role in medicine. Condiions are
More informationA time-space consistency solution for hardware-in-the-loop simulation system
Inernaional Conference on Advanced Elecronic Science and Technology (AEST 206) A ime-space consisency soluion for hardware-in-he-loop simulaion sysem Zexin Jiang a Elecric Power Research Insiue of Guangdong
More informationNumerical Solution of ODE
Numerical Soluion of ODE Euler and Implici Euler resar; wih(deools): wih(plos): The package ploools conains more funcions for ploing, especially a funcion o draw a single line: wih(ploools): wih(linearalgebra):
More informationCAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL
CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz
More informationQuick Verification of Concurrent Programs by Iteratively Relaxed Scheduling
Quick Verificaion of Concurren Programs by Ieraively Relaxed Scheduling Parick Mezler, Habib Saissi, Péer Bokor, Neeraj Suri Technische Univerisä Darmsad, Germany {mezler, saissi, pbokor, suri}@deeds.informaik.u-darmsad.de
More informationA Petri Net Approach for. Performance Oriented Parallel Program Design. A. Ferscha. Institut fur Statistik und Informatik, Universitat Wien
A eri Ne Approach for erformance Oriened arallel rogram Design A. Ferscha Insiu fur Saisik und Informaik, Universia Wien Lenaugasse 2/8, A-1080 Vienna, AUSTRIA Tel.: +43 1 408 63 66 5, Fax: +43 1 408 63
More informationMB86297A Carmine Timing Analysis of the DDR Interface
Applicaion Noe MB86297A Carmine Timing Analysis of he DDR Inerface Fujisu Microelecronics Europe GmbH Hisory Dae Auhor Version Commen 05.02.2008 Anders Ramdahl 0.01 Firs draf 06.02.2008 Anders Ramdahl
More information4. Minimax and planning problems
CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems
More informationQuantitative macro models feature an infinite number of periods A more realistic (?) view of time
INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many
More informationCOSC 3213: Computer Networks I Chapter 6 Handout # 7
COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:
More informationMichiel Helder and Marielle C.T.A Geurts. Hoofdkantoor PTT Post / Dutch Postal Services Headquarters
SHORT TERM PREDICTIONS A MONITORING SYSTEM by Michiel Helder and Marielle C.T.A Geurs Hoofdkanoor PTT Pos / Duch Posal Services Headquarers Keywords macro ime series shor erm predicions ARIMA-models faciliy
More informationImproving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services
Improving he Efficiency of Dynamic Service Provisioning in Transpor Neworks wih Scheduled Services Ralf Hülsermann, Monika Jäger and Andreas Gladisch Technologiezenrum, T-Sysems, Goslarer Ufer 35, D-1585
More informationTest - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version
Tes - Accredied Configuraion Engineer (ACE) Exam - PAN-OS 6.0 Version ACE Exam Quesion 1 of 50. Which of he following saemens is NOT abou Palo Alo Neworks firewalls? Sysem defauls may be resored by performing
More informationAutomatic Calculation of Coverage Profiles for Coverage-based Testing
Auomaic Calculaion of Coverage Profiles for Coverage-based Tesing Raimund Kirner 1 and Waler Haas 1 Vienna Universiy of Technology, Insiue of Compuer Engineering, Vienna, Ausria, raimund@vmars.uwien.ac.a
More informationAdding Time to an Object-Oriented Versions Model
Insiuo de Informáica Universidade Federal do Rio Grande do Sul Poro Alegre - RS - BRAZIL Adding Time o an Objec-Oriened Versions Model Mirella Moura Moro Nina Edelweiss Silvia Maria Saggiorao Clesio Saraiva
More informationNRMI: Natural and Efficient Middleware
NRMI: Naural and Efficien Middleware Eli Tilevich and Yannis Smaragdakis Cener for Experimenal Research in Compuer Sysems (CERCS), College of Compuing, Georgia Tech {ilevich, yannis}@cc.gaech.edu Absrac
More informationLandmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases
Lmarks: A New Model for Similariy-Based Paern Querying in Time Series Daabases Chang-Shing Perng Haixun Wang Sylvia R. Zhang D. So Parker perng@cs.ucla.edu hxwang@cs.ucla.edu Sylvia Zhang@cle.com so@cs.ucla.edu
More informationSmall Spacecraft Software Modeling: A Petri Net-Based Approach
SSC13-VIII-3 Small Spacecraf Sofware Modeling: A Peri Ne-Based Approach Levi, Pasha Missouri Universiy of Science and Technology 400 Wes 13h Sree, Rolla, MO 65409-0050; 573-341-7280 lmnn3@ms.edu Faculy
More informationVideo-Based Face Recognition Using Probabilistic Appearance Manifolds
Video-Based Face Recogniion Using Probabilisic Appearance Manifolds Kuang-Chih Lee Jeffrey Ho Ming-Hsuan Yang David Kriegman klee10@uiuc.edu jho@cs.ucsd.edu myang@honda-ri.com kriegman@cs.ucsd.edu Compuer
More informationVideo Content Description Using Fuzzy Spatio-Temporal Relations
Proceedings of he 4s Hawaii Inernaional Conference on Sysem Sciences - 008 Video Conen Descripion Using Fuzzy Spaio-Temporal Relaions rchana M. Rajurkar *, R.C. Joshi and Sananu Chaudhary 3 Dep of Compuer
More informationFlow graph/networks MAX FLOW APPLICATIONS. Flow constraints. Max flow problem 4/26/12
4// low graph/nework MX LOW PPLIION 30, pring 0 avid Kauchak low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource V wih no incoming
More informationService Oriented Solution Modeling and Variation Propagation Analysis based on Architectural Building Blocks
Carnegie Mellon Universiy From he SelecedWorks of Jia Zhang Ocober, 203 Service Oriened Soluion Modeling and Variaion Propagaion Analysis based on Archiecural uilding locks Liang-Jie Zhang Jia Zhang Available
More informationCENG 477 Introduction to Computer Graphics. Modeling Transformations
CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World
More informationEECS 487: Interactive Computer Graphics
EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified
More informationBI-TEMPORAL INDEXING
BI-TEMPORAL INDEXING Mirella M. Moro Uniersidade Federal do Rio Grande do Sul Poro Alegre, RS, Brazil hp://www.inf.ufrgs.br/~mirella/ Vassilis J. Tsoras Uniersiy of California, Rierside Rierside, CA 92521,
More informationData Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2
Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,
More informationSTRING DESCRIPTIONS OF DATA FOR DISPLAY*
SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac
More informationChapter 4 Sequential Instructions
Chaper 4 Sequenial Insrucions The sequenial insrucions of FBs-PLC shown in his chaper are also lised in secion 3.. Please refer o Chaper, "PLC Ladder diagram and he Coding rules of Mnemonic insrucion",
More informationHandling uncertainty in semantic information retrieval process
Handling uncerainy in semanic informaion rerieval process Chkiwa Mounira 1, Jedidi Anis 1 and Faiez Gargouri 1 1 Mulimedia, InfoRmaion sysems and Advanced Compuing Laboraory Sfax Universiy, Tunisia m.chkiwa@gmail.com,
More informationAssignment 2. Due Monday Feb. 12, 10:00pm.
Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218, LEC11 ssignmen 2 Due Monday Feb. 12, 1:pm. 1 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how
More informationSOT: Compact Representation for Triangle and Tetrahedral Meshes
SOT: Compac Represenaion for Triangle and Terahedral Meshes Topraj Gurung and Jarek Rossignac School of Ineracive Compuing, College of Compuing, Georgia Insiue of Technology, Alana, GA ABSTRACT The Corner
More informationVerified Validation of Lazy Code Motion
Verified Validaion of Lazy Code Moion Jean-Bapise Trisan INRIA Paris-Rocquencour jean-bapise.risan@inria.fr Xavier Leroy INRIA Paris-Rocquencour xavier.leroy@inria.fr Absrac Translaion validaion esablishes
More informationImage Content Representation
Image Conen Represenaion Represenaion for curves and shapes regions relaionships beween regions E.G.M. Perakis Image Represenaion & Recogniion 1 Reliable Represenaion Uniqueness: mus uniquely specify an
More informationReinforcement Learning by Policy Improvement. Making Use of Experiences of The Other Tasks. Hajime Kimura and Shigenobu Kobayashi
Reinforcemen Learning by Policy Improvemen Making Use of Experiences of The Oher Tasks Hajime Kimura and Shigenobu Kobayashi Tokyo Insiue of Technology, JAPAN genfe.dis.iech.ac.jp, kobayasidis.iech.ac.jp
More informationResearch Article Auto Coloring with Enhanced Character Registration
Compuer Games Technology Volume 2008, Aricle ID 35398, 7 pages doi:0.55/2008/35398 Research Aricle Auo Coloring wih Enhanced Characer Regisraion Jie Qiu, Hock Soon Seah, Feng Tian, Quan Chen, Zhongke Wu,
More informationY. Tsiatouhas. VLSI Systems and Computer Architecture Lab
CMOS INEGRAED CIRCUI DESIGN ECHNIQUES Universiy of Ioannina Clocking Schemes Dep. of Compuer Science and Engineering Y. siaouhas CMOS Inegraed Circui Design echniques Overview 1. Jier Skew hroughpu Laency
More informationTUTORING TEXTS IN MATHCAD
TUTORING TEXTS IN MATHCAD MIROSLAV DOLOZÍILEK and ANNA RYNDOVÁ Faculy of Mechanical Engineering, Brno Universiy of Technology Technická, 616 69 Brno, Czech Republic E-ail: irdo@fyzika.fe.vubr.cz Absrac
More informationJava Metadata Interface(JMI) Specification
Java Meadaa Inerface(JMI) Specificaion JSR 040 Java Communiy Process hp://www.jcp.org/ Version 1.0 Final Specificaion 07-June-2002 Technical commens: jmi-commens@sun.com Specificaion Lead: Ravi Dirckze,
More informationIt is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );
Mah 467 Homework Se : some soluions > wih(deools): wih(plos): Warning, he name changecoords has been redefined Problem :..7 Find he fixed poins, deermine heir sabiliy, for x( ) = cos x e x > plo(cos(x)
More informationSaturday from 09:00-13:00 (GMT) Documentation on all Paxton products can be found on our website -
4/05/0 Ins-30080 Ne plus conrol uni Paxon Technical Suppor 073 80 suppor@paxon.co.uk Technical help is available: Monday - Friday from 07:00-9:00 (GMT) Saurday from 09:00-3:00 (GMT) Documenaion on all
More informationPoint Cloud Representation of 3D Shape for Laser- Plasma Scanning 3D Display
Poin Cloud Represenaion of 3D Shape for Laser- Plasma Scanning 3D Displa Hiroo Ishikawa and Hideo Saio Keio Universi E-mail {hiroo, saio}@ozawa.ics.keio.ac.jp Absrac- In his paper, a mehod of represening
More informationConstruction Process. Transactional Process Scheduler. Production Process. 2.3 Transactional Subsystems. Test. CAD Documentation. Conflict!
Philadelphia, Pennsylvania, USA, May 31 - June 2, 1999. Concurrency Conrol and Recovery in Transacional Process Managemen Heo Schuld Gusavo Alonso Insiue of Informaion Sysems Swiss Federal Insiue of Technology
More informationSaturday from 09:00-13:00 (GMT) Documentation on all Paxton Access products can be found on our website -
9/3/9 Ins-38 Ne plus conrol uni Paxon Access Technical Suppor +44 ()173 81111 suppor@paxon.co.uk Technical help is available: Monday - Friday from 7: - 19: (GMT) Saurday from 9: - 13: (GMT) Documenaion
More informationAn Implementation of the PCP, SRP, D-PCP, M-PCP, and FMLP Real-Time Synchronization Protocols in LITMUS RT
An Implemenaion of he PCP, SRP, D-PCP, M-PCP, and FMLP Real-Time Synchronizaion Proocols in LITMUS RT Björn B. Brandenburg and James H. Anderson The Universiy of Norh Carolina a Chapel Hill Absrac We exend
More informationUsing CANopen Slave Driver
CAN Bus User Manual Using CANopen Slave Driver V1. Table of Conens 1. SDO Communicaion... 1 2. PDO Communicaion... 1 3. TPDO Reading and RPDO Wriing... 2 4. RPDO Reading... 3 5. CANopen Communicaion Parameer
More informationRepresenting Non-Manifold Shapes in Arbitrary Dimensions
Represening Non-Manifold Shapes in Arbirary Dimensions Leila De Floriani,2 and Annie Hui 2 DISI, Universiy of Genova, Via Dodecaneso, 35-646 Genova (Ialy). 2 Deparmen of Compuer Science, Universiy of Maryland,
More informationAchieving Security Assurance with Assertion-based Application Construction
Achieving Securiy Assurance wih Asserion-based Applicaion Consrucion Carlos E. Rubio-Medrano and Gail-Joon Ahn Ira A. Fulon Schools of Engineering Arizona Sae Universiy Tempe, Arizona, USA, 85282 {crubiome,
More informationMIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch
CableCARD Power Swich General Descripion is designed o supply power o OpenCable sysems and CableCARD hoss. These CableCARDs are also known as Poin of Disribuion (POD) cards. suppors boh Single and Muliple
More informationTime Expression Recognition Using a Constituent-based Tagging Scheme
Track: Web Conen Analysis, Semanics and Knowledge Time Expression Recogniion Using a Consiuen-based Tagging Scheme Xiaoshi Zhong and Erik Cambria School of Compuer Science and Engineering Nanyang Technological
More informationOptimal Crane Scheduling
Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move
More informationComputer representations of piecewise
Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom
More informationOptics and Light. Presentation
Opics and Ligh Presenaion Opics and Ligh Wha comes o mind when you hear he words opics and ligh? Wha is an opical illusion? Opical illusions can use color, ligh and paerns o creae images ha can be
More informationPacket Scheduling in a Low-Latency Optical Interconnect with Electronic Buffers
Packe cheduling in a Low-Laency Opical Inerconnec wih Elecronic Buffers Lin Liu Zhenghao Zhang Yuanyuan Yang Dep Elecrical & Compuer Engineering Compuer cience Deparmen Dep Elecrical & Compuer Engineering
More informationRay Tracing II. Improving Raytracing Speed. Improving Computational Complexity. Raytracing Computational Complexity
Ra Tracing II Iproving Raracing Speed Copuer Graphics Ra Tracing II 2005 Fabio Pellacini 1 Copuer Graphics Ra Tracing II 2005 Fabio Pellacini 2 Raracing Copuaional Coplei ra-scene inersecion is epensive
More informationVerified Validation of Lazy Code Motion
Verified Validaion of Lazy Code Moion Jean-Bapise Trisan, Xavier Leroy To cie his version: Jean-Bapise Trisan, Xavier Leroy. Verified Validaion of Lazy Code Moion. ACM SIGPLAN conference on Programming
More informationNon-uniform Subdivision for B-splines of Arbitrary Degree
Non-niform Sbdivision for B-slines of Arbirary Degree S. Schaefer, R. Goldman We resen an efficien algorihm for sbdividing non-niform B-slines of arbirary degree in a manner similar o he Lane-Riesenfeld
More information