Merging graph-like object structures

Size: px
Start display at page:

Download "Merging graph-like object structures"

Transcription

1 Mergig graph-like object structures Albert Züdorf Techical Uiversity of Brauschweig Istitute for Software Gaussstr Brauschweig Germay Keywords Versio Maagemet, Object Orietatio, Delta Computatio, Optimistic Lockig, Merge Algorithms, Log Trasactios 1 INTRODUCTION This paper addresses the problem of coordiatig a team of software developers cocurretly workig o a commo software system. The stadard approach to coordiate cocurret activities o a commo set of data is lockig. Ay part of data used by oe perso is locked agaist cocurret use by aother perso. The secod perso has to wait util the first perso has fiished his or her task ad releases the lock. I databases, sophisticated lockig ad trasactio cocepts miimize the waitig times for cocurret users by offerig differet lock graularities ad differet lockig levels (e.g. multiple read locks vs. sigle write locks). However, these lockig strategies assume that locks are hold for relatively short times (some secods), oly. I software developmet, versio cotrol systems like RCS [Tic85] or SCCS [Roc75] employig a pessimistic lockig cocept o a per file, per class, or per method basis are used. However, chages to source code may require some days or weeks. We call such chages log-trasactios. Such log trasactios lock certai source code parts for a log time. For example, oe perso may wat to do a bug fix i a file which is locked by a secod perso. The first perso may have to wait several days util he or she ca proceed or he or she may egotiate with the lock ower. This requires extra efforts. I large developmet teams these extra coordiatio efforts may become a severe productivity problem. To overcome these problems, optimistic lockig cocepts have prove very successful for software developmet i larger teams. CVS [Ced93, CVS] is a well kow cofiguratio ad versio maagemet system that supports optimistic lockig. Optimistic lockig cocepts allow multiple persos to chage the same file, class, or method, cocurretly. The maagemet system just keeps track, which perso works o which versio of a give piece of software. Whe a cocurret chage to the same piece of software happes, the maagemet system computes a delta Jörg P. Wadsack, Igo Rockel Departmet of Mathematics ad Computer Sciece Uiversity of Paderbor Warburger Str Paderbor Germay [maroc iro]@ui-paderbor.de comprisig the chages of oe perso ad this delta is the applied to the versio of the other perso. If the chages do ot actually coflict, the differet versios are combied, automatically. I case of actual coflicts, maual itervetios become ecessary. Based o our experieces with a fairly big software project, the Fujaba (From UML to Java Ad Back Agai) project, ad a umber of idustrial projects, actual coflicts occur seldom (1 out of 1000 chages to a file withi a LOC project with about 500 classes ad a team of about 15 developers results i a merge coflict). Thus, optimistic lockig ad mergig mechaisms seem to provide a solutio to the log trasactio problem. I large projects, a software system may ot oly cosist of source code but also of various other documets like class diagrams, use case diagrams, project plas, ad other desig documets. Most of these desig documets are stored i special biary formats. Ufortuately, most versio maagemet systems work with text files, oly. They are based o diff ad patch mechaisms that compute chages betwee two text files ad that are able to apply such chages to a differet versio of that file, if that versio has ot chaged too much. Thus, optimistic lockig is usually ot supported for desig documets. As desig documets become larger ad more importat, this becomes a severe problem for large projects. Cosequetly, it is absolutely critical to have also object structure based delta ad mergig mechaism to support optimistic lockig cocepts for desig documets. We will first discuss a mergig mechaism for object structures. This mergig mechaism baks o a textual represetatio of the object structure. This do ot solve all emergig problems thus, secod we will outlie our advaced mechaism workig o graph like object structures. 2 TEXTUAL REPRESENTATION BASED OBJECT STRUCTURE MERGING A basic requiremet for a textual persistece mechaism that shall serve as a basis for a mergig mechaism is that readig a textual descriptio ad dumpig it agai without ay modificatios should result i exactly the same text. If the text differs, the textual mergig mechaism will create textual deltas although o modificatio has happeed. This creates a high likelihood that uecessary merge coflicts are created. Naive implemetatio of a textual persistece cocept may chage the textual represetatio of a object structure e.g.

2 due to differet visitig sequeces of the cotaied objects. Let us for example assume, that a object stores a set of refereces to eighbors withi a hash table or tree based cotaier that uses the address or hash code of the stored object as access key. Typically, the readig mechaism of a textual persistece cocept has o or little ifluece o the address or hash code of re-created objects. Thus, the addresses or hash codes of re-created objects may differ from the addresses or hash codes that have bee used durig storig the object structure. Accordigly, the order i which a re-created cotaier retrieves the same set of object differs from the origial order used to store the objects the first time. If the order of the objects chages i the textual represetatio of the object structure dramatically, the textual mergig mechaism is screwed. Similarly, the chage of object idetities (ids) durig the recreatio of a object structure from its textual represetatio creates a problem for the uchaged represetatio of refereces to eighbors. If this represetatio is based o the object id provided by the rutime system, all object ids may have chaged o dumpig the object structure, agai. This screws the textual mergig mechaism, too. To solve these problems, the textual cosistecy cocept should employ its ow persistet object ids that must ot chage o multiple dumps ad readigs of a object structure. I additio, these persistet object ids should be used as sortig ad hashig criterias for cotaiers storig sets of refereces to eighbor objects i order to achieve a stable visitig order durig the textual dumpig. However, usig persistet object ids may ot suffice to guaratee a certai visitig order for cotaiers of refereces. Hash based cotaiers may reorgaize themselves o the isertio or deletio of objects. Thus, isertig oe ew object to such a cotaier may chage the textual represetatio of the whole object structure, dramatically. This may be avoided by sortig the object based o their persistet keys durig the dumpig process. Aother group of problems is related to idepedet additios of objects to a object structure by differet users. Usually, we would expect that the mergig mechaism should merge these idepedet chages without problems. However, aive text dump mechaisms ted to apped ew objects at the ed of the object structure. This may for example happe if persistet object ids are created i cosecutive order ad if these ids are used as sortig criterias for the textual dump. If this happes, cocurretly created ew objects will both be iserted at the ed of the correspodig text dump. Thus, a text based mergig mechaism will have a merge-coflict due to cocurret chages at the same text positio, although the chages do ot actually iterfere. Similarly, a severe problem is created if differet users create differet objects cocurretly ad if these objects get the same persistet object ids, by accidet. If the textual represetatio of these differet objects are placed at differet positios i the dumped text, the mergig algorithm may merge these chages without ay problems. However, this may create a textual represetatio that uses the same persistet object id, twice. This creates severe problems for the re-creatio of the object structure. To solve these problems, separated ame spaces for persistet object ids created i cocurret sessios should be employed. A simple way to achieve this is to employ a uique sessio id which is used as a basis (prefix) for the persistet object ids created i that sessio. If oe user has at most oe sessio at a time, we could use permaet user ids as ame space prefixes. This would also address the problem of fidig idepedet isertio positios for ew objects. If we preped the user id to the persistet object id ad if we use lexical order based o the persistet object id, each user id gets its ow isertio compartmet. Objects created by differet users (i differet sessios) would be iserted ito the text dump at differet positios, thus avoidig uecessary textual merge coflicts. However, they still have to take care that cocurretly created ew user compartmets are iserted at differet text positios. Dumpig ad readig the object structure Due to the discussio above, built-i serializatio mechaisms provided by moder programmig laguages are usually ot appropriate as a basis for textual mergig mechaisms. Thus, a ew textual persistece mechaism has to be build. A stadard way to implemet such a textual persistecy cocept is to employ a base class that provides appropriate read ad write methods for all attributes of that class. All classes that shall become persistet iherit from this base class ad exted the read ad write methods i order to cover the attributes itroduced i that class. The persistet base class should itroduce a attribute for the persistet object id of the objects ad perhaps static attributes to store the sessio id ad a couter used to create ew uique persistet object ids. Dumpig a object structure just starts with a root object. Referece attributes are dumped usig the persistet object id of the target object ad later o the target object is visited recursively. Some kid of marker or a object table may be used to avoid multiple dumps of a sigle object. The read procedure eeds the type of the persistet objects i order to create ew istaces of the correct class. The, the read method is used to restore the attribute values. I case of referece attributes, a look-up table is employed to tur the persistet object id ito a referece to the correspodig object. Due to our experieces the read/write method approach creates serious maiteace problems. Each time a ew attribute is iserted ito a persistet class, it has be exteded to the correspodig read ad write methods, accordigly. This is easily forgotte. Aother problem are library classes like Color or Poit. It is ot allowed to modify such library classes i order to make them persistet. I Java, the additioal problem that multiple iheritace is restricted to iterface classes is faced. Thus the iheritace of persistecy properties may become complicate. We overcome these problems by usig a geeric, table drive persistecy mechaism. Implemetig i Java allows us to exploit Java rutime type iformatio to ispect istaces of persistet classes ad to store ad recover their attributes.

3 The classes are marked as persistet either by iheritig from a certai base class or by addig it to a persistet class table. The latter mechaism allows to cover library classes, too. To exclude certai attributes from the persistecy mechaism, the Java keyword trasiet may be used. Similar iformatio may be provided by the persistecy table. This geeric persistecy mechaism is easily adapted for ew programs. I additio, the mechaism solves the maiteace problem caused by the itroductio of ew attributes. Remaiig merge coflict problems The persistecy ad mergig mechaism described so far works already fie for may situatios. However, some priciple problems remai. Cosider for example a cutout of the abstract sytax graph of a UML CASE tool. The base versio may just cosist of a a empty class diagram. User maroc may ow eter a class Customer ad user zuedorf a class Car. These idepedet chages should ot create a merge coflict. If we have prepared differet text compartmets for differet users, the additio of the ew UMLClass objects to the text dump will ot create a problem. However, i our meta model the class diagram holds a set of refereces to all cotaied classes i its attribute items, cf. Figure 1. The additio of a UMLDiagram items classes Figure 1 UML meta model (cut out) UMLClass class to a class diagram adds a referece to the items attribute, too. Thus, after the additio of oe class to the class diagram, the textual dump of the class diagram object will cotai oe lie for the items attribute describig the referece to the added class. Ufortuately, for both users this lie is added at exactly the same positio i the text dump, cf. lies 3 to 5 i Figure 2. Thus, a textual mergig mechaism will report a merge-coflict, which actually does ot exist. 1) /* text dump from user maroc */ 2)... // i class UMLDiagram 3) <attribute> <id>2.3</id> <type>attr</type> 4) <ame>items</ame> <value>customer</value> 5) </attribute>... 1) /* text dump from user zuedorf */ 2)... // i class UMLDiagram 3) <attribute> <id>1.3</id> <type>attr</type> 4) <ame>items</ame> <value>car</value> 5) </attribute> Figure 2 Positio coflict Let us ow assume, that we are able to overcome this problem by some reorgaizatio of the text dump. Thus, user zuedorf ad user maroc may have successfully merged their two classes Car ad Customer. They both take this commo versio ad cocurretly add a class Cotract. If we are able to work aroud the isertio problem to the items attribute of the UMLDiagram object, a textual mergig mechaism would probably merge these cocurret chages without ay problems. However, this would create the problem that the merged class diagram cotais two idepedetly created classes with the same ame. I Figure 3 the merged class diagram is show as (XML-) text dump, i lies 5-7 ad a class Cotract is declared. I our meta model (cf. Figure 1), class UMLDiagram employs a qualified associatio items to hold the cotaied classes. The correspodig cardiality costrait guaratees uique qualifiers. This meas, our data model does ot allow to store two classes with the same ame withi oe class diagram. Thus, i our example the reader would have a problem to restore a object structure where a successful textual merge has added two classes with the same ame. This is show i Figure 4 for classes Cotract. 1)... // i class UMLDiagram 2) <attribute> <id>2.3</id> <type>attr</type> 3) <ame>items</ame> <value>customer</value> 4) </attribute> 5) <attribute> <id>2.14</id> <type>attr</type> 6) <ame>items</ame> <value>cotract</value> 7) </attribute> 8) <attribute> <id>1.3</id> <type>attr</type> 9) <ame>items</ame> <value>car</value> 10) </attribute> 11) <attribute> <id>1.16</id> <type>attr</type> 12) <ame>items</ame> <value>cotract</value> 13) </attribute> Figure 3 Merged class diagram Customer Car To summarize, a text based mergig mechaism has o kowledge about the sematic costraits itroduced by the meta model of our object structure. Thus, the textual mergig mechaisms is ot able to deal with a umber of merge problems related to such costraits. Cosequetly, we have developed a object structure based mergig mechaism, described i the ext chapter. 3 OBJECT STRUCTURE BASED MERGING Our object structure based mergig mechaism is based o a simple meta model providig objects, labeled liks, ad Object id: strig type: strig ame: strig value: strig liks sigs belogs_to attributes, cf. Figure 5. The elemetary chage operatios of this meta model are create / delete a object create / delete a lik chage a attribute value Cotract Cotract Figure 4 Namig coflict attrs Figure 5 Text dumpig meta model Lik id: strig type: strig ame: strig label: strig Attributes amig coflict id: strig type: strig ame: strig value: strig

4 algorithm delta(a, B) 1) iput A,B : set of object structures 2) output D : delta of the object structures 3) local variables OA, OB, ON, OD: object 4) local variables LA, LB, LN, LD: lik 5) begi 6) for all (OA,OB) = pairwithsameid (A,B) 7) if OA.attrs OB.attrs 8) the D.addChageAttributeEtries (OA,OB) 9) fi 10) for all LB = (OB.lik - OA.lik) 11) D.addCreateLikEtry(LB) 12) for all LA = (OA.lik - OB.lik) 13) D.addRemoveLikEtry (LA) 14) for all ON = (B - A) 15) D.addCreateObjectEtry (ON) 16) D.addChageAttributeEtry (ON.attrs) 17) for all LN = (ON.lik) 18) D.addCreateLikEtry (LN) 19) for all OD = (A - B) 20) D.addDeleteObjectEtry (OD) 21) D.addChageAttributeEtry (OD.attrs) 22) for all LD = (OD.lik) 23) D.addRemoveLikEtry (LD) 24) ed Figure 6 The delta algorithm Computig Object Structure Deltas We first describe a algorithm computig a delta betwee two object structures i terms of these elemetary chage operatios, cf. algorithm delta i Figure 6. The delta algorithm employs two sets of kow objects for object structures A (old) ad B (ew) that are to be compared. Our algorithm iterates through the sets of kow objects of the two object structures ad retrieves pairs of objects with the same persistet object ids. For each such pair of objects OA ad OB we compare the set of basic attributes, cf. lie 7. If the attribute values differ we add a appropriate chageattribute (lie 8) etry to the computed delta. The we cosider all liks attached to the objects (lies 10 to 13). Two liks with the same label are cosidered equal if they target objects with the same persistet object id. If object OB has a lik with label L targetig ad object OX ad OA does ot have such a lik, the a appropriate createlik etry is added to the delta (lie 18). If a lik is removed we add a removelik etry to the delta (lie 13). Oce all pairs of objects with the same persistet object id have bee cosidered, our algorithm cosiders the remaiig objects (lie 14 to 18). Each object ON existig i object structure B but ot i object structure A has bee added to object structure B. Thus we create correspodig createobject ad chageattribute etries to the delta (lies 15 & 16). I additio, we add all liks attached to ON to our delta (lies 17 to 18). Objects cotaied i object structure A but ot i object structure B have bee removed i object structure B. For such objects OD we add deleteobject etries to the delta. I our approach we add chageattribute etries for deleted objects to the delta, too (lies 20 & 21). Although, this iformatio may ot be ecessary for the merge process, it allows to use the delta as a reverse delta, if required. This meas, the delta ca be used to recostruct object structure A from its successor object structure B. Accordigly, we add deleted liks attached to deleted objects to the delta (lie 22 & 23). zv deltabz bv deltabm mv apply deltabm cv Figure 7 Computig commo versio by applyig deltabm to zv 3-Way Mergig / Applyig a Object Structure Delta Let us assume, we have a base versio bv of a object structure ad users zuedorf ad maroc create two successor versios zv ad mv, cocurretly. We would ow like to merge these chages ito a commo versio cv, cf. Figure 7. Basically, the commo versio cv may be computed by applyig deltabm to versio zv. A delta is applied to a object structure by just executig the correspodig create/delete object, create/delete lik, ad chage attribute etries of the delta. Agai we eed a lookup table to tur persistet object ids from the delta ito refereces to actual objects. We use sessio or user id prefixes to the persistet object ids i order to avoid cocurretly created objects with equal persistet ids as described for textual mergig mechaisms. If o coflicts occur, this algorithm works straight forward ad creates a object structure cv that cotais the chages of both users. Most of the problems discussed for textual merge mechaisms do ot occur. For example addig a class created by user maroc to the class diagram does ot create a merge coflict, sice the items set has o dedicated isertio positio where a coflict could occur. However, there are still coflicts possible. Coflicts o object structure based mergig The simplest coflict occurs if both users have modified the same basic attribute, e.g. both users chage the ame of a existig class i differet ways. Similarly, createlik operatios may coflict if the correspodig associatio has cardiality to-oe. It may eve be cosidered as a coflict if oe user deletes a to-oe lik ad aother user replaces that lik by a lik to aother target. I additio, oe user may have deleted a object while the other user chages a attribute of that object or adds a lik to that object. A object structure based mergig mechaism must detect such situatios ad deal with them, somehow. A simple approach is to always prioritize the chages of oe of the users. Aother idea is to compute a kid of merged result. For strig based attributes oe could just cocateate the coflictig ames. I our CASE tool example this would result i a class with a cocateated ame. The user could idetify this problem withi the CASE tool ad resolve the coflict maually. Geerally, this is a very dagerous approach. Probably, a special table of attributes that shall be hadled this way should be used. However, coflicts related to to-oe liks ad coflicts related to deleted ad cocurretly modified objects ca ot be solved this way. I geeral, such merge coflicts require a user decisio. Ufortuately, our object structure based mergig mechaism may report merge coflicts o a object structure

5 level, oly. The user of a CASE tool may have some difficulties to resolve a coflict sayig coflictig assigmets to attribute age of object 2.33 of type XYZ. The user would probably like to deal with such coflicts via the GUI of his or her CASE tool. 4 CONCLUSIONS AND FUTURE WORK There have bee a umber of approaches tryig to improve merge mechaisms for software documets, [Wes91b, YHR92, LvO92, BHR95]. Most of these approaches tried to exploit higher level sematic kowledge i order to deal with merge coflicts more sophisticatedly. Like our approach, may of these approaches create a object structure based represetatio of the software documets i order to aalyse the chages more thoroughly. Our approach has bee heavily iflueced by the work of [Wes91a]. [Wes91a] itroduced the idea of uique persistet object ids as a basis for object structure based mergig. Somehow, we follow the idea of operatio based mergig of [LvO92]. However, [LvO92] requires the recordig of chage operatios while we employ a delta algorithm. We assume that explicit operatio recordig is hard to implemet. We thik that our approach improves the object structure mergig problem by itroducig a very geeric cocept that will be easily adapted to ew object structures ad tools. We pla to develop tool support, that allows to reverse egieer existig object structures ad to geerate a merge mechaism for such structures. We pla to deal with the merge coflict problem usig a table drive approach. A cofigurable coflict resolutio table shall allow to defie differet coflict hadlig strategies for differet kids of coflicts o differet types of objects, liks, ad attributes. Oe coflict hadlig method could be to add appropriate coflict marker objects to the object structure. The, the CASE tool could be exteded by a dialog presetig the merge coflicts i a appropriate way ad allowig the user to eter merge decisios o a logical level. I this way, a geeric merge mechaism may be itegrated with differet tools. We have implemeted the object structure based mergig mechaism i our Fujaba CASE tool. This implemetatio was ot as simple as described. First of all, our approach assumes a graph-like object structure. This meas, it must be possible to delete some object ad to determie all other objects referecig to this object ad to reset all these obsolete refereces i order to avoid daglig refereces. I our implemetatio, all refereces are implemeted as pairs of forward/backward poiters. This allows to determie all eighbors of a deleted object, easily. Secod, we assume that each object has a uique persistet umber eve across sessio boudaries. Especially, this does ot allow to compare idepedetly created object structures. Basically, this idea stems from [Wes91b] Third, we assume that some addig or deletig of objects or liks ad some attribute modificatios tur a valid object structure ito aother valid object structure. Theoretically, this holds, sice the resultig object structure respects all costraits imposed by the correspodig meta model. For example, o coordiately costraits of associatios are violated. However, usually tools impose other hidde cosistecy costraits o object structures. For example a explicit attribute, coutig the umber of existig classes may be employed. Addig ad removig class objects should chage this couter, too. This is ot kow to our merge mechaism. Due to our experieces, tools that are able to read a text based represetatio of their object structure are usually well prepared to deal with object structures that ca be represeted by such a textual descriptio. Thus, we pla to apply our mechaism to XML based object structure represetatios. We have miimized such costraits i our Fujaba eviromet. We have bee successful for class diagrams, but there are still some problems with some behavior diagrams. Similarly, we have a prelimiary versio of a merge dialog, oly. We would like to apply this approach to other tools that have a log trasactios problem, i order to validate its feasibility ad its geericity. For the Fujaba eviromet see REFERENCES [BHR95] D. Bikley, S. Horwitz, ad T. Reps. Program itegratio for laguages with procedure calls. ACM Trasactios o Software Egieerig ad Methodology, 4(1):3 35, Jauary [Ced93] P. Cederqvist. CVS Maual: Versio Maagemet with CVS. Sigum Support, [CVS] CVS. Cocurret Versios System - The ope stadard for versio cotrol. [LvO92] E. Lippe ad N. va Oosterom. Operatio-based Mergig. I Proc. of the 5th Symposium o Software Developmet Eviromets (SDE5), volume 17(5), pages 78 87, Tyso s Corer, Virgiia, December ACM SIGSOFT Software Egieerig Notes. [Roc75] M.J. Rochkid. The source code cotrol system. IEEE Trasactios o Software Egieerig, 1(4): , [Tic85] W.F. Tichy. RCS - a system for versio cotrol. Software Practice ad Experiece, 15(7): , July [Wes91a] B. Westfechtel. Revisio Cotrol i a Itegrated Software Developmet Eviromet. PhD thesis, Aache Uiversity of Techology, Aache, Germay, [Wes91b] B. Westfechtel. Structure-Orieted Mergig of Revisios of Software Documets. I P.H. Feiler, editor, Proc. of the 3rd Iteratioal Workshop o Software Cofiguratio Maagemet, Trodheim, Norway, Jue ACM Press. [YHR92] W. Yag, S. Horwitz, ad T. Reps. A program itegratio algorithm that accommodates sematics-preservig trasformatios. ACM Trasactios o Software Egieerig ad Methodology, 1(3): , July 1992.

Engineering Data Management

Engineering Data Management BaaERP 5.0c Maufacturig Egieerig Data Maagemet Module Procedure UP128A US Documetiformatio Documet Documet code : UP128A US Documet group : User Documetatio Documet title : Egieerig Data Maagemet Applicatio/Package

More information

Baan Service Master Data Management

Baan Service Master Data Management Baa Service Master Data Maagemet Module Procedure UP069A US Documetiformatio Documet Documet code : UP069A US Documet group : User Documetatio Documet title : Master Data Maagemet Applicatio/Package :

More information

ODBC. Getting Started With Sage Timberline Office ODBC

ODBC. Getting Started With Sage Timberline Office ODBC ODBC Gettig Started With Sage Timberlie Office ODBC NOTICE This documet ad the Sage Timberlie Office software may be used oly i accordace with the accompayig Sage Timberlie Office Ed User Licese Agreemet.

More information

Business Rules-Driven SOA. A Framework for Multi-Tenant Cloud Computing

Business Rules-Driven SOA. A Framework for Multi-Tenant Cloud Computing Lect. Phd. Liviu Gabriel CRETU / SPRERS evet Traiig o software services, Timisoara, Romaia, 6-10 dec 2010 www.feaa.uaic.ro Busiess Rules-Drive SOA. A Framework for Multi-Teat Cloud Computig Lect. Ph.D.

More information

Modified Line Search Method for Global Optimization

Modified Line Search Method for Global Optimization Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

More information

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

BaanERP. BaanERP Windows Client Installation Guide

BaanERP. BaanERP Windows Client Installation Guide BaaERP A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject to

More information

Domain 1: Designing a SQL Server Instance and a Database Solution

Domain 1: Designing a SQL Server Instance and a Database Solution Maual SQL Server 2008 Desig, Optimize ad Maitai (70-450) 1-800-418-6789 Domai 1: Desigig a SQL Server Istace ad a Database Solutio Desigig for CPU, Memory ad Storage Capacity Requiremets Whe desigig a

More information

(VCP-310) 1-800-418-6789

(VCP-310) 1-800-418-6789 Maual VMware Lesso 1: Uderstadig the VMware Product Lie I this lesso, you will first lear what virtualizatio is. Next, you ll explore the products offered by VMware that provide virtualizatio services.

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

Configuring Additional Active Directory Server Roles

Configuring Additional Active Directory Server Roles Maual Upgradig your MCSE o Server 2003 to Server 2008 (70-649) 1-800-418-6789 Cofigurig Additioal Active Directory Server Roles Active Directory Lightweight Directory Services Backgroud ad Cofiguratio

More information

How to set up your GMC Online account

How to set up your GMC Online account How to set up your GMC Olie accout Mai title Itroductio GMC Olie is a secure part of our website that allows you to maage your registratio with us. Over 100,000 doctors already use GMC Olie. We wat every

More information

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee

More information

Message Exchange in the Utility Market Using SAP for Utilities. Point of View by Marc Metz and Maarten Vriesema

Message Exchange in the Utility Market Using SAP for Utilities. Point of View by Marc Metz and Maarten Vriesema Eergy, Utilities ad Chemicals the way we see it Message Exchage i the Utility Market Usig SAP for Utilities Poit of View by Marc Metz ad Maarte Vriesema Itroductio Liberalisatio of utility markets has

More information

Domain 1: Configuring Domain Name System (DNS) for Active Directory

Domain 1: Configuring Domain Name System (DNS) for Active Directory Maual Widows Domai 1: Cofigurig Domai Name System (DNS) for Active Directory Cofigure zoes I Domai Name System (DNS), a DNS amespace ca be divided ito zoes. The zoes store ame iformatio about oe or more

More information

ADAPTIVE NETWORKS SAFETY CONTROL ON FUZZY LOGIC

ADAPTIVE NETWORKS SAFETY CONTROL ON FUZZY LOGIC 8 th Iteratioal Coferece o DEVELOPMENT AND APPLICATION SYSTEMS S u c e a v a, R o m a i a, M a y 25 27, 2 6 ADAPTIVE NETWORKS SAFETY CONTROL ON FUZZY LOGIC Vadim MUKHIN 1, Elea PAVLENKO 2 Natioal Techical

More information

iprox sensors iprox inductive sensors iprox programming tools ProxView programming software iprox the world s most versatile proximity sensor

iprox sensors iprox inductive sensors iprox programming tools ProxView programming software iprox the world s most versatile proximity sensor iprox sesors iprox iductive sesors iprox programmig tools ProxView programmig software iprox the world s most versatile proximity sesor The world s most versatile proximity sesor Eato s iproxe is syoymous

More information

1. Introduction. Scheduling Theory

1. Introduction. Scheduling Theory . Itroductio. Itroductio As a idepedet brach of Operatioal Research, Schedulig Theory appeared i the begiig of the 50s. I additio to computer systems ad maufacturig, schedulig theory ca be applied to may

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

QUADRO tech. FSA Migrator 2.6. File Server Migrations - Made Easy

QUADRO tech. FSA Migrator 2.6. File Server Migrations - Made Easy QUADRO tech FSA Migrator 2.6 File Server Migratios - Made Easy FSA Migrator Cosolidate your archived ad o-archived File Server data - with ease! May orgaisatios struggle with the cotiuous growth of their

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

TruStore: The storage. system that grows with you. Machine Tools / Power Tools Laser Technology / Electronics Medical Technology

TruStore: The storage. system that grows with you. Machine Tools / Power Tools Laser Technology / Electronics Medical Technology TruStore: The storage system that grows with you Machie Tools / Power Tools Laser Techology / Electroics Medical Techology Everythig from a sigle source. Cotets Everythig from a sigle source. 2 TruStore

More information

Baan Finance Accounts Payable

Baan Finance Accounts Payable Baa Fiace Accouts Payable Module Procedure UP035A US Documetiformatio Documet Documet code : UP035A US Documet group : User Documetatio Documet title : Accouts Payable Applicatio/Package : Baa Fiace Editio

More information

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature. Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.

More information

RUT - development handbook 1.3 The Spiral Model v 4.0

RUT - development handbook 1.3 The Spiral Model v 4.0 2007-01-16 LiTH RUT - developmet hadbook 1.3 The Spiral Model v 4.0 Fredrik Herbertsso ABSTRACT The idea behid the spiral model is to do system developmet icremetally while usig aother developmet model,

More information

RUT - Development manual

RUT - Development manual 2005-01-18 LiTH RUT - Developmet maual 7.20 UML Case Study - Use case ad class diagrams v 1.1 Reée Lidkvist Johasso, 2005 Abstract This documet presets a case study of fudametals of UML otatio, i particular,

More information

DAME - Microsoft Excel add-in for solving multicriteria decision problems with scenarios Radomir Perzina 1, Jaroslav Ramik 2

DAME - Microsoft Excel add-in for solving multicriteria decision problems with scenarios Radomir Perzina 1, Jaroslav Ramik 2 Itroductio DAME - Microsoft Excel add-i for solvig multicriteria decisio problems with scearios Radomir Perzia, Jaroslav Ramik 2 Abstract. The mai goal of every ecoomic aget is to make a good decisio,

More information

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation HP 1C Statistics - average ad stadard deviatio Average ad stadard deviatio cocepts HP1C average ad stadard deviatio Practice calculatig averages ad stadard deviatios with oe or two variables HP 1C Statistics

More information

Security Functions and Purposes of Network Devices and Technologies (SY0-301) 1-800-418-6789. Firewalls. Audiobooks

Security Functions and Purposes of Network Devices and Technologies (SY0-301) 1-800-418-6789. Firewalls. Audiobooks Maual Security+ Domai 1 Network Security Every etwork is uique, ad architecturally defied physically by its equipmet ad coectios, ad logically through the applicatios, services, ad idustries it serves.

More information

CS100: Introduction to Computer Science

CS100: Introduction to Computer Science Review: History of Computers CS100: Itroductio to Computer Sciece Maiframes Miicomputers Lecture 2: Data Storage -- Bits, their storage ad mai memory Persoal Computers & Workstatios Review: The Role of

More information

Design and Implementation of a Publication Database for the Vienna University of Technology

Design and Implementation of a Publication Database for the Vienna University of Technology Desig ad Implemetatio of a Publicatio Database for the Viea Uiversity of Techology Karl Riedlig Istitute of Idustrial Electroics ad Material Sciece, TU Wie, A-040 Viea karl.riedlig@tuwie.ac.at Abstract:

More information

INVESTMENT PERFORMANCE COUNCIL (IPC) Guidance Statement on Calculation Methodology

INVESTMENT PERFORMANCE COUNCIL (IPC) Guidance Statement on Calculation Methodology Adoptio Date: 4 March 2004 Effective Date: 1 Jue 2004 Retroactive Applicatio: No Public Commet Period: Aug Nov 2002 INVESTMENT PERFORMANCE COUNCIL (IPC) Preface Guidace Statemet o Calculatio Methodology

More information

Shared Memory with Caching

Shared Memory with Caching Vorlesug Recherarchitektur 2 Seite 164 Cachig i MIMD-Architectures ] MIMD-Architekture Programmiermodell Behadlug der Kommuikatioslatez Nachrichteorietiert globaler Adressraum Latez miimiere Latez verstecke

More information

A Flexible Web-Based Publication Database

A Flexible Web-Based Publication Database A Flexible Web-Based Publicatio Database Karl Riedlig ad Siegfried Selberherr 2 Istitute of Sesor ad Actuator Systems 2 Istitute for Microelectroics Techische Uiversität Wie Gusshausstrasse 27-29 A-040

More information

Unicenter TCPaccess FTP Server

Unicenter TCPaccess FTP Server Uiceter TCPaccess FTP Server Release Summary r6.1 SP2 K02213-2E This documetatio ad related computer software program (hereiafter referred to as the Documetatio ) is for the ed user s iformatioal purposes

More information

Research Article Sign Data Derivative Recovery

Research Article Sign Data Derivative Recovery Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov

More information

Document Control Solutions

Document Control Solutions Documet Cotrol Solutios State of the art software The beefits of Assai Assai Software Services provides leadig edge Documet Cotrol ad Maagemet System software for oil ad gas, egieerig ad costructio. AssaiDCMS

More information

A Balanced Scorecard

A Balanced Scorecard A Balaced Scorecard with VISION A Visio Iteratioal White Paper Visio Iteratioal A/S Aarhusgade 88, DK-2100 Copehage, Demark Phoe +45 35430086 Fax +45 35434646 www.balaced-scorecard.com 1 1. Itroductio

More information

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL. Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

More information

INVESTMENT PERFORMANCE COUNCIL (IPC)

INVESTMENT PERFORMANCE COUNCIL (IPC) INVESTMENT PEFOMANCE COUNCIL (IPC) INVITATION TO COMMENT: Global Ivestmet Performace Stadards (GIPS ) Guidace Statemet o Calculatio Methodology The Associatio for Ivestmet Maagemet ad esearch (AIM) seeks

More information

A Secure Implementation of Java Inner Classes

A Secure Implementation of Java Inner Classes A Secure Implemetatio of Java Ier Classes By Aasua Bhowmik ad William Pugh Departmet of Computer Sciece Uiversity of Marylad More ifo at: http://www.cs.umd.edu/~pugh/java Motivatio ad Overview Preset implemetatio

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

Systems Design Project: Indoor Location of Wireless Devices

Systems Design Project: Indoor Location of Wireless Devices Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 698-5295 Email: bcm1@cec.wustl.edu Supervised

More information

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The

More information

CHAPTER 3 DIGITAL CODING OF SIGNALS

CHAPTER 3 DIGITAL CODING OF SIGNALS CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity

More information

The Forgotten Middle. research readiness results. Executive Summary

The Forgotten Middle. research readiness results. Executive Summary The Forgotte Middle Esurig that All Studets Are o Target for College ad Career Readiess before High School Executive Summary Today, college readiess also meas career readiess. While ot every high school

More information

E-Plex Enterprise Access Control System

E-Plex Enterprise Access Control System Eterprise Access Cotrol System Egieered for Flexibility Modular Solutio The Eterprise Access Cotrol System is a modular solutio for maagig access poits. Employig a variety of hardware optios, system maagemet

More information

Desktop Management. Desktop Management Tools

Desktop Management. Desktop Management Tools Desktop Maagemet 9 Desktop Maagemet Tools Mac OS X icludes three desktop maagemet tools that you might fid helpful to work more efficietly ad productively: u Stacks puts expadable folders i the Dock. Clickig

More information

Hypergeometric Distributions

Hypergeometric Distributions 7.4 Hypergeometric Distributios Whe choosig the startig lie-up for a game, a coach obviously has to choose a differet player for each positio. Similarly, whe a uio elects delegates for a covetio or you

More information

Amendments to employer debt Regulations

Amendments to employer debt Regulations March 2008 Pesios Legal Alert Amedmets to employer debt Regulatios The Govermet has at last issued Regulatios which will amed the law as to employer debts uder s75 Pesios Act 1995. The amedig Regulatios

More information

Making training work for your business

Making training work for your business Makig traiig work for your busiess Itegratig core skills of laguage, literacy ad umeracy ito geeral workplace traiig makes sese. The iformatio i this pamphlet will help you pla for ad build a successful

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

Chatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com

Chatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com SOLVING THE OIL DELIVERY TRUCKS ROUTING PROBLEM WITH MODIFY MULTI-TRAVELING SALESMAN PROBLEM APPROACH CASE STUDY: THE SME'S OIL LOGISTIC COMPANY IN BANGKOK THAILAND Chatpu Khamyat Departmet of Idustrial

More information

IT Support. 020 8269 6878 n www.premierchoiceinternet.com n support@premierchoiceinternet.com. 30 Day FREE Trial. IT Support from 8p/user

IT Support. 020 8269 6878 n www.premierchoiceinternet.com n support@premierchoiceinternet.com. 30 Day FREE Trial. IT Support from 8p/user IT Support IT Support Premier Choice Iteret has bee providig reliable, proactive & affordable IT Support solutios to compaies based i Lodo ad the South East of Eglad sice 2002. Our goal is to provide our

More information

June 3, 1999. Voice over IP

June 3, 1999. Voice over IP Jue 3, 1999 Voice over IP This applicatio ote discusses the Hypercom solutio for providig ed-to-ed Iteret protocol (IP) coectivity i a ew or existig Hypercom Hybrid Trasport Mechaism (HTM) etwork, reducig

More information

Two-Phased Mapping & Identifier/Locator Network Protocol (ILNP) Youn-Hee Han, Hyon-Young Choi

Two-Phased Mapping & Identifier/Locator Network Protocol (ILNP) Youn-Hee Han, Hyon-Young Choi Two-Phased Mappig & Idetifier/Locator Network Protocol (ILNP) You-Hee Ha, Hyo-Youg Choi Two-Phased Mappig Prefix:ETR à Prefix:AS# (Phase I) ad AS#:ETRs (Phase II) Phase II mappig iformatio ca be distributed

More information

How to use what you OWN to reduce what you OWE

How to use what you OWN to reduce what you OWE How to use what you OWN to reduce what you OWE Maulife Oe A Overview Most Caadias maage their fiaces by doig two thigs: 1. Depositig their icome ad other short-term assets ito chequig ad savigs accouts.

More information

Total Program Management for High-Tech

Total Program Management for High-Tech Total Program Maagemet for High-Tech ORGANIZE Makig Order Out of Chaos Sortig the requiremets, fidig the right resources, aligig the capabilities, ad creatig a cohesive Team Maagemet Effort are dautig

More information

auction a guide to selling at Residential

auction a guide to selling at Residential Residetial a guide to sellig at auctio Allsop is the market leader for residetial ad commercial auctios i the UK Aually sells up to 700 millio of property at auctio Holds at least seve residetial ad six

More information

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please

More information

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5

More information

Lecture 2: Karger s Min Cut Algorithm

Lecture 2: Karger s Min Cut Algorithm priceto uiv. F 3 cos 5: Advaced Algorithm Desig Lecture : Karger s Mi Cut Algorithm Lecturer: Sajeev Arora Scribe:Sajeev Today s topic is simple but gorgeous: Karger s mi cut algorithm ad its extesio.

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

Domain 1: Identifying Cause of and Resolving Desktop Application Issues Identifying and Resolving New Software Installation Issues

Domain 1: Identifying Cause of and Resolving Desktop Application Issues Identifying and Resolving New Software Installation Issues Maual Widows 7 Eterprise Desktop Support Techicia (70-685) 1-800-418-6789 Domai 1: Idetifyig Cause of ad Resolvig Desktop Applicatio Issues Idetifyig ad Resolvig New Software Istallatio Issues This sectio

More information

Information for Programs Seeking Initial Accreditation

Information for Programs Seeking Initial Accreditation Iformatio for Programs Seekig Iitial Accreditatio Aswers to Frequetly- Asked-Questios (from www.abet.org/ew-to-accreditatio/) Assurig Quality l Stimulatig Iovatio This documet iteds to aswer may of the

More information

MTO-MTS Production Systems in Supply Chains

MTO-MTS Production Systems in Supply Chains NSF GRANT #0092854 NSF PROGRAM NAME: MES/OR MTO-MTS Productio Systems i Supply Chais Philip M. Kamisky Uiversity of Califoria, Berkeley Our Kaya Uiversity of Califoria, Berkeley Abstract: Icreasig cost

More information

The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection

The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection The aalysis of the Courot oligopoly model cosiderig the subjective motive i the strategy selectio Shigehito Furuyama Teruhisa Nakai Departmet of Systems Maagemet Egieerig Faculty of Egieerig Kasai Uiversity

More information

CHAPTER 3 THE TIME VALUE OF MONEY

CHAPTER 3 THE TIME VALUE OF MONEY CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all

More information

CREATIVE MARKETING PROJECT 2016

CREATIVE MARKETING PROJECT 2016 CREATIVE MARKETING PROJECT 2016 The Creative Marketig Project is a chapter project that develops i chapter members a aalytical ad creative approach to the marketig process, actively egages chapter members

More information

How to read A Mutual Fund shareholder report

How to read A Mutual Fund shareholder report Ivestor BulletI How to read A Mutual Fud shareholder report The SEC s Office of Ivestor Educatio ad Advocacy is issuig this Ivestor Bulleti to educate idividual ivestors about mutual fud shareholder reports.

More information

Agenda. Outsourcing and Globalization in Software Development. Outsourcing. Outsourcing here to stay. Outsourcing Alternatives

Agenda. Outsourcing and Globalization in Software Development. Outsourcing. Outsourcing here to stay. Outsourcing Alternatives Outsourcig ad Globalizatio i Software Developmet Jacques Crocker UW CSE Alumi 2003 jc@cs.washigto.edu Ageda Itroductio The Outsourcig Pheomeo Leadig Offshore Projects Maagig Customers Offshore Developmet

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

BaanERP 5.0c. EDI User Guide

BaanERP 5.0c. EDI User Guide BaaERP 5.0c A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

The Stable Marriage Problem

The Stable Marriage Problem The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,

More information

Flood Emergency Response Plan

Flood Emergency Response Plan Flood Emergecy Respose Pla This reprit is made available for iformatioal purposes oly i support of the isurace relatioship betwee FM Global ad its cliets. This iformatio does ot chage or supplemet policy

More information

Floating Codes for Joint Information Storage in Write Asymmetric Memories

Floating Codes for Joint Information Storage in Write Asymmetric Memories Floatig Codes for Joit Iformatio Storage i Write Asymmetric Memories Axiao (Adrew Jiag Computer Sciece Departmet Texas A&M Uiversity College Statio, TX 77843-311 ajiag@cs.tamu.edu Vaske Bohossia Electrical

More information

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights Ceter, Spread, ad Shape i Iferece: Claims, Caveats, ad Isights Dr. Nacy Pfeig (Uiversity of Pittsburgh) AMATYC November 2008 Prelimiary Activities 1. I would like to produce a iterval estimate for the

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

Domain 1 - Describe Cisco VoIP Implementations

Domain 1 - Describe Cisco VoIP Implementations Maual ONT (642-8) 1-800-418-6789 Domai 1 - Describe Cisco VoIP Implemetatios Advatages of VoIP Over Traditioal Switches Voice over IP etworks have may advatages over traditioal circuit switched voice etworks.

More information

Bio-Plex Manager Software

Bio-Plex Manager Software Multiplex Suspesio Array Bio-Plex Maager Software Extract Kowledge Faster Move Your Research Forward Bio-Rad cotiues to iovate where it matters most. With Bio-Plex Maager 5.0 software, we offer valuable

More information

Theorems About Power Series

Theorems About Power Series Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

More information

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics

More information

Agency Relationship Optimizer

Agency Relationship Optimizer Decideware Developmet Agecy Relatioship Optimizer The Leadig Software Solutio for Cliet-Agecy Relatioship Maagemet supplier performace experts scorecards.deploymet.service decide ware Sa Fracisco Sydey

More information

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number. GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea - add up all

More information

Conversion Instructions:

Conversion Instructions: Coversio Istructios: QMS magicolor 2 DeskLaser to QMS magicolor 2 CX 1800502-001A Trademarks QMS, the QMS logo, ad magicolor are registered trademarks of QMS, Ic., registered i the Uited States Patet ad

More information

Silver Lining of Cloud Computing

Silver Lining of Cloud Computing White Paper Silver Liig of Cloud Computig - Key Priciples ad Best Practices CXOs eed to evaluate differet deploymet models, service models ad key characteristics of the cloud to implemet the precise spectrum

More information

GOOD PRACTICE CHECKLIST FOR INTERPRETERS WORKING WITH DOMESTIC VIOLENCE SITUATIONS

GOOD PRACTICE CHECKLIST FOR INTERPRETERS WORKING WITH DOMESTIC VIOLENCE SITUATIONS GOOD PRACTICE CHECKLIST FOR INTERPRETERS WORKING WITH DOMESTIC VIOLENCE SITUATIONS I the sprig of 2008, Stadig Together agaist Domestic Violece carried out a piece of collaborative work o domestic violece

More information

Optimize your Network. In the Courier, Express and Parcel market ADDING CREDIBILITY

Optimize your Network. In the Courier, Express and Parcel market ADDING CREDIBILITY Optimize your Network I the Courier, Express ad Parcel market ADDING CREDIBILITY Meetig today s challeges ad tomorrow s demads Aswers to your key etwork challeges ORTEC kows the highly competitive Courier,

More information

Determining the sample size

Determining the sample size Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

Safety Requirements engineering and Proof of implementation

Safety Requirements engineering and Proof of implementation Presetatio to DVClub commuity October 20 th 2015 Safety Requiremets egieerig ad Proof of implemetatio Test ad Verificatio Solutios Deliverig Tailored Solutios for Hardware Verificatio ad Software Testig

More information

Static revisited. Odds and ends. Static methods. Static methods 5/2/16. Some features of Java we haven t discussed

Static revisited. Odds and ends. Static methods. Static methods 5/2/16. Some features of Java we haven t discussed Odds ad eds Static revisited Some features of Java we have t discussed Static methods // Example: // Java's built i Math class public class Math { public static it abs(it a) { if (a >= 0) { retur a; else

More information

France caters to innovative companies and offers the best research tax credit in Europe

France caters to innovative companies and offers the best research tax credit in Europe 1/5 The Frech Govermet has three objectives : > improve Frace s fiscal competitiveess > cosolidate R&D activities > make Frace a attractive coutry for iovatio Tax icetives have become a key elemet of public

More information

Enhancing Oracle Business Intelligence with cubus EV How users of Oracle BI on Essbase cubes can benefit from cubus outperform EV Analytics (cubus EV)

Enhancing Oracle Business Intelligence with cubus EV How users of Oracle BI on Essbase cubes can benefit from cubus outperform EV Analytics (cubus EV) Ehacig Oracle Busiess Itelligece with cubus EV How users of Oracle BI o Essbase cubes ca beefit from cubus outperform EV Aalytics (cubus EV) CONTENT 01 cubus EV as a ehacemet to Oracle BI o Essbase 02

More information

! encor e networks TM

! encor e networks TM ! ecor e etworks TM Copyright 2003 Ecore Networks, Ic. All rights reserved. SigalPath 201 (SP201 ) Istallatio Guide Versio C, July 2004 Part Number 15469.1000 SigalPath Software Versio 1100 This Istallatio

More information

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1, Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-1559 Berli,

More information