EXPERIMENTAL COMPARISONS OF ENTITY-RELATIONSHIP AND OBJECT-ORIENTED DATA MODELS ABSTRACT INTRODUCTION

Size: px
Start display at page:

Download "EXPERIMENTAL COMPARISONS OF ENTITY-RELATIONSHIP AND OBJECT-ORIENTED DATA MODELS ABSTRACT INTRODUCTION"

Transcription

1 EXPERIMENTAL COMPARISONS OF ENTITY-RELATIONSHIP AND OBJECT-ORIENTED DATA MODELS Peretz Shoval Iformatio Systems Program, Departmet of Idustrial Egieerig ad Maagemet Be-Gurio Uiversity of the Negev, Beer-Sheva ISRAEL ( fax: ) ABSTRACT The exteded etity-relatioship () model is beig "threateed" by the object-orieted () approach, which peetrates ito the areas of system aalysis ad data modelig. The issue of which of the two data models is better for data modelig is still a ope questio. We address the questio by coductig experimetal comparisos betwee the models. The results of our experimets reveal that: a) schema comprehesio: terary relatioships are sigificatly easier to comprehed i the model tha i the model; b) the model supasses the model for desigig uary ad terary relatioships; c) time: it takes less time to desig schemas; d) prefereces: the model is preferred by desigers. We coclude that eve if the objective is to implemet a database schema, the followig procedure is still recommeded: 1) create a coceptual schema, 2) map it to a schema, ad c) augmet the schema with behavioral costructs that are uique to the approach. INTRODUCTION The object orieted () approach has spread ito various areas of computig that iclude ot oly programmig, but also systems aalysis ad desig, database maagemet, amog others. There is o doubts about the advatages of the 00 approach for programmig, i that it supports software reuse ad iformatio hidig,. However, the superiority of approach i earlier stages of software developmet, i.e., system aalysis ad data modelig, has ot as yet bee prove. I cocetrate o data modelig (or coceptual desig), a activity aimed at creatig a coceptual schema. This schema is usually represeted i a diagrammatic form, as it serves as a commuicatio tool betwee developers ad users. Oce approved by users, it is coverted ito a specific database schema, depedig o the data model ad DBMS used for implemetatio. This coversio is cosidered simple, beig a algorithmic, automatic process. The major problem, however, is to create a good coceptual schema that is sematically correct ad comprehesible. For may years, Etity-Relatioship, with its may extesios, geerally termed, has bee the most widely used model for coceptual desig. Recetly, the model has bee threateig to replace the model. I additio to static (structural) costructs of the model whose represetatio of data structure is somewhat equivalet to represetatio (e.g., object classes cosidered equivalet to etity ad relatioship types) - the approach models system behavior through "methods" that are attached to the object classes, with messages passig amog them. While this extra capability, ulike, provides more tha just a data structure model, it does ot ecessarily mea that should be replaced by, sice may ideed be "better" tha 00 for modelig the data structure. Takig ito cosideratio that a schema ca easily be mapped to a schema (Gogola et al 1993, Koratzky & Shoval 1994, Nachouki et al 1992, Narasimha et al 1993), it may be worthwhile to begi the process of data modelig with the desig of a coceptual schema, the covert it to a schema (if the objective is to implemet a DBMS), ad fially add the behavioral costructs. Such a "idirect" strategy for creatig a schema could be cosidered whe the model is regarded a "better" tha the model. "Better" ca be judged from various perspectives. I address this issue from four perspectives: a) comprehesio: uderstadability of schemas; b) desig quality: correctess of schemas; c) time to complete desig tasks; ad d) desigers' preferece of models. We have coducted two experimetal comparisos which compare the two models o these dimesios. The ext sectio discusses related studies, the followig two sectios overview the uderlyig models, the I describe the experimets ad their results, ad the fial sectio summarizes the results ad coclusios. RELATED STUDIES Various studies o the evaluatio ad compariso of data models have bee coducted. The earlier studies maily compared record-based models (hierarchical, etwork ad relatioal). Later o, became the most frequetly studied model. has bee compared with relatioal ad other recordbased models, as well as with other sematic models (e.g. Batra et al 1990, Juh & Nauma 1985). Some studies compared the data models from a desiger perspective i a attempt to fid out which yields more accurate ad precise schemas. Other studies compared the query laguages of the data models i order to determie the laguages by which the desigers compose queries with greater accuracy ad speed. Yet, other studies took a user perspective, attemptig to determie ease of 74

2 comprehesio. A survey of earlier studies ca be foud i Batra & Sriivasa (1992). Although the results of these studies are ot always clear-cut or cosistet, there is a tedecy to agree that HER is superior to other, record-based ad coceptual models. Oe of their geeral coclusios was that usability of data models should be evaluated by their ability to model relatioships, a poit that is stressed i our experimets Recetly we have begu to fid studies which evaluate the model o the basis of cotrolled experimets. For example, Agrawal ad Siha (1992) examied the ifluece of desigers' experiece i fuctioal aalysis ad task characteristics o quality of 00 schema desig. They foud out that the model does ot always lead to good results; the quality of result depeds o task characteristics. Palvia et al. (1992) compared, ER ad DSD models from a ed-user perspective, to see which schema is more comprehesible. Their subjects were MIS studets, ad their database schemas were trivial i terms of size ad complexity. Each subject received a versio of a database correspodig to oe data model, alog with 30 questios that evaluate comprehesio of the database. The total score o correct aswers was used as a measure of comprehesio. They cocluded that users of the model showed a sigificatly better uderstadig of the data tha users of the other two models. They admit, however, that their coclusio is weak, because comprehesio was measured o overall terms oly, ad suggest that future research be directed to studyig specific aspects of comprehesio, e.g., differet types of relatioships. Bock ad Rya (1993) reported o a compariso of ad models from a desiger perspective. They examied correctess of desig of eight types of costructs, ad measured correctess accordig to a gradig scheme developed by Batra et al. (1990). Their results idicated that is better for represetig attribute idetifiers, uary 1:1 ad biary m: relatioships, while there are o sigificat differeces for other dimesios. Also, they foud o differece i time to complete the tasks. Although these results are iterestig, i our opiio they have limited exteral validity, maily because the model they used (as i Kroeke 1992) represets relatioships oly by referece attributes i such a way that does ot eable to distiguish betwee a object that represets a biary relatioship from a object that represets a terary relatioship. THE UNDERLYING AND MODELS The objective of this sectio is to overview ad exemplify the models we use for experimetatio. Sice each of the models has may variats, we cofie ourselves to two specific types, that are sufficietly geeral to validate the results of the compariso. The model: As is more "stadard" tha, we oly preset a example (Figure 1) usig a diagrammatic otatio as i Elmasri ad Navathe (1994) ad Teorey et al. (1986). The model The model is still evolvig ad as yet o stadard has bee defied. The model that we use is based o O 2 (Deux et al 1991) ad ODE (Agrawal & Gehai 1989). By extedig the model we are able to show all the details of the schema o diagram, as would be expected at the coceptual desig stage. (Sice we focus o modelig data structure ad ot system behavior, methods are ot icluded.) A example of the schema is show i Figure 2, represetig the same reality as the diagram i Figure 1. 75

3 ar Sport Tru Figure 1: Diagram A object has attributes. (For brevity, we omit "class" ad simply say "object".) A attribute may be atomic or multi-valued, i which case the attribute ame is preceded by "set". A idetifier attribute of a object is uderlied. A attribute may refer to aother object, i which case the refereced object ame i writte i [ ] brackets ext to the respective attribute ame. This actually implies a bidirectioal relatioship betwee the objects, which is sigified i two complemetary ways: a) referece-attributes are icluded i each of the ivolved objects; b) a lik coects the two objects, with a idicatio of the relatioship cardiality. I the case of a 1 : relatioship betwee two objects, the object i the "1" side has a set referece attribute to the other object, ad i case of a m: relatioship both objects have set referece attributes. A attribute may be a tuple cosistig of multiple (value or referece) attributes, ad sigified by { } brackets. For example, the set producers {[Producer], umber of plats} of City. A m: relatioship ca also be represeted as a separate object, with referece attributes to the related objects. A terary or higher order relatioships is represeted as a separate object, liked to the other objects ivolved i the relatioship. The referece attributes i all objects are icluded. I the example, we have store facts about agets sellig vehicles to persos. Therefore, we used the objects Perso, Aget ad Vehicle, ad for the relatioship we created the object Sales. Each of the three origial objects has a set referece attribute to Sales, while Sales has a tuple cosistig of three referece attributes to those objects. The use of tuple of referece attributes i a object that represets a relatioship eables to determie the degree of the relatioship represeted by that object (e.g., whether it is biary or terary). Fially, object hierarchies are sigified by liks from the subtypes to the supertypes, similar to the otatio. 76

4 Producer ame address set wtiere_producig {[City], umber of plats) set vehicles_produced [Vehicle] 1 Aget ame address set vehicles_sold [Sales] City ame state set producers ([Producer], umber of plats) set ihabitats [Perso] mayor [Perso] 1 N Vehicle licece o. model set sold_by/to [Sales] produced_by [Producer] Sales sale ([Aget],(Perso], [Vehicle]) price ($) date_ol_sale Perso ss ame birth_date set tetephoe.umbers lives_i [City] mayor_of [City] set vehicles_bought [Sales] Car oilcosumptio (Ipm) Sport max_speed (mph) Truck capacity (tos) Figure 2: Diagram THE USER COMPREHENSION EXPERIMENT AND RESULTS This sectio provides a summary of the user-comprehesio experimet ad its results. For more details (see Shoval & Frumerma 1994). The experimet We examied user comprehesio as follows: two groups of users, each studyig a differet model, were give a diagram of the model they studied, ad a set of idetical questios (statemets) about facts i the schema. The users were studets of behavioral sciece ad maagemet, havig similar backgrouds ad experiece. They all took the same three computer related courses; therefore, they may be cosidered as "sophisticated users", i.e., users who ca iteract with professioal aalysts, express iformatio eeds ad approve their products. The subjects were radomly divided ito two groups, each studyig oe model. The studies emphasized comprehesio of the schema diagrams (rather tha desig of diagrams). The same istructor taught both models (to avoid bias i teachig quality), ad the same amout of time hours - was allocated to teach each model. I order to motivate the studets, they were told that their performace i the experimet would be cosidered as part of the fial course grade. We prepared a questioaire that cosisted of 48 "true" ad "false" statemets about facts i the coceptual schemas. The purpose was to fid out ot oly if there is a differece i overall comprehesio betwee the two schema diagrams, but also if there is a differece i the specific costruct types. Therefore, we classified the statemets accordig to differet costruct types: a) attributes of etities/objects, b) biary-relatioships, c) two biary relatioships, d) teraryrelatioships, ad e) other facts - with o direct relatioships. We prepared two equivalet schema diagrams, oe for each model. The diagrams icluded exactly the same facts. The HER diagram icluded 12 etities, 7 biary-relatioships, 2 terary-relatioships ad various attributes. I the diagram there were 14 objects - some of which represetig biary ad terary relatioships - each with various types of attributes: atomic, multi-valued, referece-attributes ad tuples. Each participat was give a schema diagram, accordig to the model s(he) studied, ad a questioaire. Each user was expected to review the diagram ad to mark each statemet "true" or 77

5 "false". The level of comprehesio was measured by coutig the umber of correct aswers withi each group for each of the categories of statemets, ad for all statemets together. Aalysis of results The results of the experimet are summarized i Table 1. For each category (icludig "All") ad model it shows the mea grade i absolute values ad i percets, ad the stadard deviatio. The last two colums idicate the sigificace of differece betwee mea grades, determied accordig to twotail Z tests at 0=0.05. As it shows, we caot reject the ull hypothesis that overall, there is o differece of comprehesio betwee the two models, although there is a slight differece i favor of the HER model. There is, however, a sigificat differece i favor of HER for "terary-relatioships": a average of 91.1% for vs. oly 67.8% for. O the other had, there is a advatage to for "other facts": 83.5% to vs. 74.1%to. Type of Costruct Attributes Biary Relatioships Two Relatioships Terary Relatioships Other Facts All Table 1; Summary of the Results for Comprehesio of Model STDS Questios Mea Score Mea i % Z-Value which? (a=0.05) The isigificat differeces betwee the models with respect to "attributes", "biary-relatioships" ad "two relatioships" ca be explaied by the similarity i diagrammatic represetatio. As would be expected, i both models statemets ivolvig two biary-relatioships are more difficult to comprehed tha those ivolvig just attributes or sigle relatioships - average scores were oly 74.78% for ad 77.22% for 00. Sice we foud a sigificat differece betwee the models i the case of terary-relatioships, we further examied these results by distiguishig betwee m::l relatioships ad m:: relatioships. I both cases we foud a sigificat differece i favor of the model. For m::l, the average score of was 93.33, compared to a average score of oly for. For m::, the average scores were ad 62.17, respectively. The advatage of o terary relatioships ca be explaied by the lucidity of the diamod symbol which coects the three etities. It seems that this symbol is clearer ad more visible tha the "ormal" object rectagle which is used i for ay type of object. Moreover, i, a terary-object icludes sets of tuple attributes, which seem to be more complicated to comprehed compared to, where the diamod represetig the terary-relatioship has oly its ow attributes. With respect to "other facts", tured out to be superior. This is actually ot a specific category as it icludes differet statemets which deal with etities or objects that exist i the diagram but have o direct relatioships. may be easier to comprehed for this category because here most of the iformatio is ecapsulated withi the objects, as opposed to where it is "spread-out" amog the etities ad relatioships. THE DESIGN QUALITY EXPERIMENT This sectio provides a summary of the desig-quality experimet ad its results. For more details )see Shoval & Shira 1996). The experimet I this experimet we compared the models from a desiger perspective, addressig three dimesios: a) desig quality, i.e., correctess of schemas; b) time to complete desig tasks, ad c) desiger 78

6 prefereces of the models. With respect to desig quality we defied ull hypotheses that there is o differece i correctess of modelig these costructs types: 1) etities/objects, 2) attributes of etities/objects, 3) iheritace relatioships, 4) uary 1:1 relatioships, 5) biary 1:1 relatioships, 6) biary l: relatioships, 7) biary m: relatioships, 8) terary m::l relatioships, ad 9) terary m::p relatioships. With respect to time ad preferece, we hypotheses that: 10) there is o differece i time to complete desig tasks, ad 11) there is o differece i desiger prefereces of the models. We defied two desig tasks, both similar i size ad complexity (ivolvig the same types ad umbers of various costructs). We created a arrative descriptio for each task, o which basis each subject was asked to desig a coceptual schema diagram usig oe of the two models. The subjects icluded 44 studets, all majorig i Iformatio Systems, with a similar backgroud ad course of studies. All subjects were traied to use the two models. The same amout of time (six hours) was devoted to study each model, ad the same istructor taught all the studets. I order to motivate the subjects, they were told that their performace i the experimet would be part of the fial grade. The subjects were radomly divided ito two groups: subjects i oe group desiged the first task with ad the secod task with HER; subjects i the other group switched models ad tasks. The startig ad edig times of each task were recorded. At the ed, each subject was give a short questioaire, usig 7-poit scales, to express a opiio o the ability of each model to desig a coceptual schema, ad to idicate the relative preferece of the models. Correctess of each schema was measured accordig to the evaluatio scheme described i Batra et al. (1990). Each costruct type, i each model, was scored separately by subtractig a certai umber of poits for each error type (distiguishig betwee mior, medium ad major errors). The we averaged the scores of all subjects o each costruct type for each of the two models. Aalysis of results The results are summarized i Table 2 ad discussed herei Table 2: Summary of Results for desig Quality, Time ad Preferece Hypotheses model model Sigificace Average STDV Average STDV T-value P-value Etity/Class Attributes Iheritace Uary 1 : Biary 1: Biary l: Biary m: which? 8 9 Terary m::l Terary m::p [Time (miutes) I <.0001 tfl, lla How good is model (1-7)?* <.0001 lib Relative preferece ** , 4 II * The is based o the Wilcoxo test; 3.45 is Z-value of the test. ** 7 = absolute preferece of ; 1 = absolute preferece of.--.* A. Correctess of desig (hypotheses 1-9): We used the T-test to measure the differece of mea scores for each of the ie types of costructs. The last colums idicate the sigificace of the results. The "which?" colum idicates if the results are sigificat (at o=0.05) ad which model is favored. We foud o sigificat differece for six of the costructs, amely etity types or object classes (1), attributes (2), iheritace, or supertype-subtype hierarchies (3), ad the three types of biary relatioships (5-7). These results are explaied by the similarity of the models whe dealig with these 79

7 costructs. The slight differeces i the symbols that represet etities or objects, as well as iheritace liks, tured out to be isigificat for desig quality. This is evideced by the high scores o those costructs - above or close to 90. Iterestigly, i both models the scores for 1:1 relatioships were higher tha those for l: relatioships, which, i tur were higher tha those for m: relatioships. These cosistet results stregthe their validity. Cotrary to the above, we foud sigificat differeces for uary (4) ad terary (8 ad 9) relatioships; all favored the model, as explaied herei: Uary 1:1 relatioships: Represetatio of uary relatioships may be complicated, especially i the model, because there are differet optios by which to represet them. For example, the 1:1 uary "marriage" relatioship, which appeared i the experimet, ca be represeted i model as a referece attribute i Employee, or as a separate object (Marriage) related to Employee. As it tured out, i both models may errors occurred, but i we foud more errors i cases where the desigers chose to represet the relatioship as a separate object. Terary m::p relatioships: There were oly a few errors i modelig m::p relatioships with the model, but may errors with model. Typical errors i occurred whe istead of a separate object, the relatioship was represeted as (complex) attributes of other objects. For example, to represet a terary relatioship betwee Worker, Project ad Skill, some desigers defied a tuple of referece attributes {[Skill], [Project], work_hours} i the object Worker. Terary m::l relatioships: Here too, the model was, ideed, better. The results idicate that i both models m::l relatioships are more difficult to model tha m::p relatioships, but desigers made more errors. A typical error was represetatio of a terary as two biary relatioships (e.g., a terary relatioship betwee Worker, Project ad City was represeted by some desigers as two biary relatioships: oe betwee Worker ad Project, aother betwee Project ad City). Whe we ote the similarities ad differeces betwee our results ad the results obtaied i (Bock & Rya 1993), we see that the model was ot superior for ay dimesio. I both studies was better tha for uary 1:1 relatioships; but i (Bock & Rya 1993) was better for biary m: relatioships, whereas i our study was better for terary relatioships. B. Time for completig the desig task (hypothesis 10): As see i Table 2, it takes sigificatly less time to desig schemas. Although the time factor i itself is of mior importace, the fact that this result is cosistet with the results o correctess of desig, stregthes the validity of the experimet. C. Preferece of models by desigers (hypothesis 11): For this dimesio as well, tured out to be sigificatly better. This is evideced both by the scores give to each model idepedetly (row 1 la), ad the relative preferece of the two models (row 1 Ib). The average of 2.82 o a 7-poit scale idicated a sigificat preferece of the model. Eve if we agree that preferece is ot importat as performace, the cosistet results further validate the experimet. SUMMARY AND CONCLUSIONS I summary, we foud that the model is superior to the model for the followig reasos: 1. Comprehesio of schemas: terary relatioships are easier to uderstad, whereas for, oly o-specific ("other") facts are easier to uderstad, with o sigificat differece for the other costructs. 2. Desig quality: Complex (uary ad terary) relatioships are desiged more correctly i, whereas there is o sigificat differeces whe desigig other modelig costructs. 3. Time: it takes less time to desig a schema. 4. Prefereces: desigers prefer to use the model. Therefore, we coclude that eve if the objective is to desig ad implemet a schema, the followig strategy is recommeded: a) desig a schema ad validate it by users/ maagemet; b) 80

8 map it to a equivalet 00 schema (usig a appropriate mappig algorithm or tool; ad c) augmet the schema with the behavioral costructs ("methods" ad "messages"). REFERENCES Agrawal, R. ad Gehai, N. (1989) ODE (object database ad eviromet): The laguage ad the data model, ACM SIGMOD Itl. Cof. o Maagemet of Data, pp Agrawal, R. ad Siha, A. (1992) A empirical study of the effects of experiece ad task characteristics o object-orieted modelig, i: WITS'92 Workshop o Iformatio Techology ad Systems, pp Batra, D. (1993) A framework for studyig huma error behavior i coceptual database modelig, Iformatio & Maagemet, Vol. 25,pp Batra, D., Hoffer, J. ad Bostrom, R. (1990) Comparig represetatios with relatioal ad models, Comm. of the ACM, Vol. 33 (2), pp Batra, D. ad Sriivasa, A. (1992) A review ad aalysis of the usability of data maagemet eviromets, It'l J. of Ma-Machie Studies, Vol. 36, pp Bock, D. ad Rya, T. (1993) Accuracy i modelig with exteded etity relatioship ad object orieted data models, J. of Database Maagemet, Vol. 4 (4), pp Deux, O. et al. (1991) The O2 system, Commuicatios of the ACM, 34 (10), pp Elmasri, R. ad Navathe, S. (1994) Fudametals of Database Systems, 2d Ed., Bejami/ Cummigs,. Gogola, M., Herzig, R., Corad, S., Deker, G. ad Vlachatois, N. (1993) Itegratig the ER approach i a eviromet, It'l Coferece o ER Approach, pp Juh, S. ad Nauma, J. (1985) The effectiveess of data represetatio characteristics o user validatio, I: Proceedigs of the Sixth It. Cof. o Iformatio Systems, pp Kerliger, F. (1973) Foudatios of Behavioral Research, Holt, Rihart ad Wisto. Koratzky, Y. ad Shoval, P. (1994) Coceptual desig of object-orieted schemas usig the biaryrelatioship model, Data & Kowledge Egieerig, Vol. 14, pp Kroekc, D. (1992) Database Processig, 4th Ed., Macmilla Publishig. Nachouki, L., Chastag, M. ad Briad, H. (1992) From etity-relatioship diagram to a objectorieted database, It'l. Coferece o Etity-Relatioship Approach, pp Narasimha, B., Navathe, S. ad Jayarama, S. (1993) O mappig ER ad relatioal models oto schemas, It'l Coferece o ER Approach, pp Palvia, P., Lio, C. ad To, P. (1992) The impact of coceptual data models o ed-user performace, J. of Database Maagemet, Vol. 3 (4), pp Shoval, p. ad Frumerma, I (1994) ad coceptual schemas: a compariso of user comprehesio, J. of Database maagemet, Vol. 5 (4), pp Shoval, P. ad Shira, S. (1996) Etity-Relatioship ad Object-Orieted data modelig - a experimetal compariso of desig quality, Data & Kowledge Egieerig, forthcomig. Teorey, T., Yag, D. ad Fry, J. (1986) A logical desig methodology for relatioal database usig exteded etity-relatioship model, ACM Computig Surveys, Vol. 18, pp

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

Τεχνολογία Λογισμικού

Τεχνολογία Λογισμικού ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic. Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

One advantage that SONAR has over any other music-sequencing product I ve worked

One advantage that SONAR has over any other music-sequencing product I ve worked *gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

1 Enterprise Modeler

1 Enterprise Modeler 1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio

More information

EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS

EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Iteratioal Joural o Natural Laguage Computig (IJNLC) Vol. 2, No., February 203 EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Raj Kishor Bisht ad Ila Pat Bisht 2 Departmet of Computer Sciece &

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

More information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation 6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08

More information

The Magma Database file formats

The Magma Database file formats The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,

More information

GE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III

GE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III GE2112 - FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III PROBLEM SOLVING AND OFFICE APPLICATION SOFTWARE Plaig the Computer Program Purpose Algorithm Flow Charts Pseudocode -Applicatio Software Packages-

More information

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig

More information

Modern Systems Analysis and Design Seventh Edition

Modern Systems Analysis and Design Seventh Edition Moder Systems Aalysis ad Desig Seveth Editio Jeffrey A. Hoffer Joey F. George Joseph S. Valacich Desigig Databases Learig Objectives ü Cocisely defie each of the followig key database desig terms: relatio,

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

Computers and Scientific Thinking

Computers and Scientific Thinking Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput

More information

Lecture 28: Data Link Layer

Lecture 28: Data Link Layer Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig

More information

Extending The Sleuth Kit and its Underlying Model for Pooled Storage File System Forensic Analysis

Extending The Sleuth Kit and its Underlying Model for Pooled Storage File System Forensic Analysis Extedig The Sleuth Kit ad its Uderlyig Model for Pooled File System Foresic Aalysis Frauhofer Istitute for Commuicatio, Iformatio Processig ad Ergoomics Ja-Niclas Hilgert* Marti Lambertz Daiel Plohma ja-iclas.hilgert@fkie.frauhofer.de

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

More information

Goals of the Lecture UML Implementation Diagrams

Goals of the Lecture UML Implementation Diagrams Goals of the Lecture UML Implemetatio Diagrams Object-Orieted Aalysis ad Desig - Fall 1998 Preset UML Diagrams useful for implemetatio Provide examples Next Lecture Ð A variety of topics o mappig from

More information

Ontology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection

Ontology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection 2017 Asia-Pacific Egieerig ad Techology Coferece (APETC 2017) ISBN: 978-1-60595-443-1 Otology-based Decisio Support System with Aalytic Hierarchy Process for Tour Pacage Selectio Tie-We Sug, Chia-Jug Lee,

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Today s objectives. CSE401: Introduction to Compiler Construction. What is a compiler? Administrative Details. Why study compilers?

Today s objectives. CSE401: Introduction to Compiler Construction. What is a compiler? Administrative Details. Why study compilers? CSE401: Itroductio to Compiler Costructio Larry Ruzzo Sprig 2004 Today s objectives Admiistrative details Defie compilers ad why we study them Defie the high-level structure of compilers Associate specific

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

Intermediate Statistics

Intermediate Statistics Gait Learig Guides Itermediate Statistics Data processig & display, Cetral tedecy Author: Raghu M.D. STATISTICS DATA PROCESSING AND DISPLAY Statistics is the study of data or umerical facts of differet

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

Analysis of Class Design Coupling Based on Information Entropy Di Jiang 1,2, a, Hua Zhou 1,2,b and Xingping Sun 1,2,c

Analysis of Class Design Coupling Based on Information Entropy Di Jiang 1,2, a, Hua Zhou 1,2,b and Xingping Sun 1,2,c Advaced Materials Research Olie: 2013-01-25 IN: 1662-8985, Vol. 659, pp 196-201 doi:10.4028/www.scietific.et/amr.659.196 2013 Tras Tech Publicatios, witzerlad Aalysis of Class Desig Couplig Based o Iformatio

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

Data Warehousing. Paper

Data Warehousing. Paper Data Warehousig Paper 28-25 Implemetig a fiacial balace scorecard o top of SAP R/3, usig CFO Visio as iterface. Ida Carapelle & Sophie De Baets, SOLID Parters, Brussels, Belgium (EUROPE) ABSTRACT Fiacial

More information

Goals of this Lecture Activity Diagram Example

Goals of this Lecture Activity Diagram Example Goals of this Lecture Activity Diagram Example Object-Orieted Aalysis ad Desig - Fall 998 Preset a example activity diagram Ð Relate to requiremets, use cases, ad class diagrams Also, respod to a questio

More information

Chapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,

More information

Stone Images Retrieval Based on Color Histogram

Stone Images Retrieval Based on Color Histogram Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose

More information

FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS

FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS SIAM J. SCI. COMPUT. Vol. 22, No. 6, pp. 2113 2134 c 21 Society for Idustrial ad Applied Mathematics FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS ZHAO ZHANG AND XIAODONG ZHANG

More information

Computer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.

Computer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria. Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must

More information

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work 200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval

More information

Module 8-7: Pascal s Triangle and the Binomial Theorem

Module 8-7: Pascal s Triangle and the Binomial Theorem Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

Panel for Adobe Premiere Pro CC Partner Solution

Panel for Adobe Premiere Pro CC Partner Solution Pael for Adobe Premiere Pro CC Itegratio for more efficiecy The makes video editig simple, fast ad coveiet. The itegrated pael gives users immediate access to all medialoopster features iside Adobe Premiere

More information

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1 COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

n Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis

n Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis Overview Chapter 6 Writig a Program Bjare Stroustrup Some thoughts o software developmet The idea of a calculator Usig a grammar Expressio evaluatio Program orgaizatio www.stroustrup.com/programmig 3 Buildig

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 26 Ehaced Data Models: Itroductio to Active, Temporal, Spatial, Multimedia, ad Deductive Databases Copyright 2016 Ramez Elmasri ad Shamkat B.

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures Uiversity of Waterloo Departmet of Electrical ad Computer Egieerig ECE 250 Algorithms ad Data Structures Midterm Examiatio ( pages) Istructor: Douglas Harder February 7, 2004 7:30-9:00 Name (last, first)

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5 Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:

More information

Keywords Software Architecture, Object-oriented metrics, Reliability, Reusability, Coupling evaluator, Cohesion, efficiency

Keywords Software Architecture, Object-oriented metrics, Reliability, Reusability, Coupling evaluator, Cohesion, efficiency Volume 3, Issue 9, September 2013 ISSN: 2277 128X Iteratioal Joural of Advaced Research i Computer Sciece ad Software Egieerig Research Paper Available olie at: www.ijarcsse.com Couplig Evaluator to Ehace

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies

More information

Enhancing Efficiency of Software Fault Tolerance Techniques in Satellite Motion System

Enhancing Efficiency of Software Fault Tolerance Techniques in Satellite Motion System Joural of Iformatio Systems ad Telecommuicatio, Vol. 2, No. 3, July-September 2014 173 Ehacig Efficiecy of Software Fault Tolerace Techiques i Satellite Motio System Hoda Baki Departmet of Electrical ad

More information

Cache-Optimal Methods for Bit-Reversals

Cache-Optimal Methods for Bit-Reversals Proceedigs of the ACM/IEEE Supercomputig Coferece, November 1999, Portlad, Orego, U.S.A. Cache-Optimal Methods for Bit-Reversals Zhao Zhag ad Xiaodog Zhag Departmet of Computer Sciece College of William

More information

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics

More information

EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL

EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL Iteratioal Joural of Iformatio Techology ad Kowledge Maagemet July-December 2012, Volume 5, No. 2, pp. 371-375 EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

VISUALSLX AN OPEN USER SHELL FOR HIGH-PERFORMANCE MODELING AND SIMULATION. Thomas Wiedemann

VISUALSLX AN OPEN USER SHELL FOR HIGH-PERFORMANCE MODELING AND SIMULATION. Thomas Wiedemann Proceedigs of the 2000 Witer Simulatio Coferece J. A. Joies, R. R. Barto, K. Kag, ad P. A. Fishwick, eds. VISUALSLX AN OPEN USER SHELL FOR HIGH-PERFORMANCE MODELING AND SIMULATION Thomas Wiedema Techical

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

In this chapter, you learn the concepts and terminology of databases and

In this chapter, you learn the concepts and terminology of databases and A Itroductio to Database Developmet I this chapter, you lear the cocepts ad termiology of databases ad how to desig the tables that your forms ad reports will use. Fially, you build the actual tables used

More information

Appendix D. Controller Implementation

Appendix D. Controller Implementation COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);

More information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Copyright 1982, by the author(s). All rights reserved.

Copyright 1982, by the author(s). All rights reserved. Copyright 1982, by the author(s). All rights reserved. Permissio to make digital or hard copies of all or part of this work for persoal or classroom use is grated without fee provided that copies are ot

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs Dyamic Aalysis ad Desig Patter Detectio i Java Programs Outlie Lei Hu Kamra Sartipi {hul4, sartipi}@mcmasterca Departmet of Computig ad Software McMaster Uiversity Caada Motivatio Research Problem Defiitio

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

More information

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y

More information

Weston Anniversary Fund

Weston Anniversary Fund Westo Olie Applicatio Guide 2018 1 This guide is desiged to help charities applyig to the Westo to use our olie applicatio form. The Westo is ope to applicatios from 5th Jauary 2018 ad closes o 30th Jue

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

More information

EE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering

EE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering EE 4363 1 Uiversity of Miesota Midterm Exam #1 Prof. Matthew O'Keefe TA: Eric Seppae Departmet of Electrical ad Computer Egieerig Uiversity of Miesota Twi Cities Campus EE 4363 Itroductio to Microprocessors

More information

Lower Bounds for Sorting

Lower Bounds for Sorting Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig

More information

IncorporatingCluster-BasedRelationshipsin Web Rule Language

IncorporatingCluster-BasedRelationshipsin Web Rule Language IcorporatigCluster-BasedRelatioshipsi Web Rule Laguage Mala Mehrotra Pragati Syergetic ResearchIc. Cupertio. CA mm@pragati-ic.com http://www.pragati-ic.com 1 Itroductio The Sematic Web visio requires rule-based

More information

15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015

15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015 15-859E: Advaced Algorithms CMU, Sprig 2015 Lecture #2: Radomized MST ad MST Verificatio Jauary 14, 2015 Lecturer: Aupam Gupta Scribe: Yu Zhao 1 Prelimiaries I this lecture we are talkig about two cotets:

More information

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research

More information

Computer Systems - HS

Computer Systems - HS What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, 2017-18 Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic

More information

Ch 9.3 Geometric Sequences and Series Lessons

Ch 9.3 Geometric Sequences and Series Lessons Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric

More information

Neural Networks A Model of Boolean Functions

Neural Networks A Model of Boolean Functions Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de

More information

c-dominating Sets for Families of Graphs

c-dominating Sets for Families of Graphs c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

A PREDICTION MODEL FOR USER S SHARE ANALYSIS IN DUAL- SIM ENVIRONMENT

A PREDICTION MODEL FOR USER S SHARE ANALYSIS IN DUAL- SIM ENVIRONMENT GSJ: Computer Sciece ad Telecommuicatios 03 No.3(39) ISSN 5-3 A PRDICTION MODL FOR USR S SHAR ANALYSIS IN DUAL- SIM NVIRONMNT Thakur Sajay, Jai Parag Orietal Uiversity, Idore, Idia sajaymca00@yahoo.com

More information

Combination Labelings Of Graphs

Combination Labelings Of Graphs Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information