SOFTWARE usually does not work alone. It must have

Size: px
Start display at page:

Download "SOFTWARE usually does not work alone. It must have"

Transcription

1 Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad Techology, Cracow, Polad Abstract Moder software is developed to work with multiple software ad hardware architectures, to cooperate with various peer compoets ad ca be istalled i may differet cofiguratios. I order to test it, all possible workig eviromets eeds to be created. This requires software ad hardware resources like servers, etworks ad software liceses ad most importat: ma-hours of qualified egieers that will have to cofigure ad maitai them. Because resources are usually limited we have to choose a set of cofiguratios with highest impact o quality of software uder test. I this paper we preset a method of measurig effectiveess of give software eviromet for discoverig defects i software by itroducig eviromet sesitivity measure. We also show how it ca be used i simple algorithm used to select best cofiguratios by usig oly a selected subset of them ad progressively modifyig it thougout software developmet process. I. INTRODUCTION AND PROBLEM DESCRIPTION SOFTWARE usually does ot work aloe. It must have a eviromet that it works i. This eviromet ca be composed from may compoets like: servers, operatig systems, databases, remote services etc. Those compoets ca also have other compoets that they rely o. Eg. database might eed a operatig system to work o. Those depedecies create a Compoet Depedecy Graph (CDG) that describes a eviromet for Software uder Test (SUT). Example of such graph is give o Figure. This graph shows oly geeral structure of eviromet. Each compoet may also have a set of properties like type, versio umber, architecture type, permissios, locales etc. Database A Computer A AppServer Middleware B Computer B Cliet istalled o coected to Fig. : Example of Compoet Depedecy Graph (CDG) that shows depedecies betwee resources. Tree A represets eviromet for server applicatio. Tree B is eviromet for cliet applicatio. Lets take a simple use case: a applicatio workig o two operatig systems, with three database servers ad two applicatio servers. It will give about 2 3 2=2 differet eviromets to test. If we add aother variable: 32-bit or 64-bit architecture, it will double possible eviromet cofiguratios to at most 24. Addig ew cofigurable elemet to eviromet teds to icrease the umber of possible setups expoetially. Not all cofiguratios may be possible to create (for example some middle-ware may ot be available for all operatig systems), but it still is sigificat umber of variats to test. Problems of geeratig test eviromets ad possible solutios were metioed i our other article []. There has bee efforts to automate the process of creatig those eviromets based o sematic descriptio of CDG i [2] ad [3]. Authors of those articles proposed to use virtualizatio to costruct eviromets ad the use sapshots to cloe ad the modify them to build other eviromets. This techique ad additioal simplificatios allowed to reduce umber of separate cofiguratios from about 200 to 60. However this is still to may eviromets to be build ad maitaied for everyday regressios tests or cotiuous builds. I dissertatio [4] same author came also to this coclusio ad proposed a maual way to select subset of cofiguratios based o testers prefereces. Decisio o which cofiguratios test software is i that case solely based o testers expert kowledge, without support of ay aalytical tools. I our research we tried to establish a method to measure how good is give cofiguratio for testig ad a algorithm to choose the best of them. II. SELECTING BEST ENVIRONMENTS FOR TESTING As show above umber of possible eviromets ca be quite high. This meas that with limited resources we ca oly choose subset of them. Oe of the most popular methods is to use cofiguratios that are most widely used by customers. However whe umber of software users is high, diversity of cofiguratios may also be too high o ad must also be limited. We have to defie what meas that oe cofiguratio is better for testig purposes tha the other ad the create a algorithm for choosig the best of them. I our research we followed a commo pheomea observed by testers: some of the software eviromets are causig more problems tha the others - basically they fail more tests (or fail them more ofte). If cofiguratio A is more problematic tha cofiguratio B that usually meas that if we ru tests o cofiguratio A ad /$25.00 c 203, IEEE 343

2 344 PROCEEDINGS OF THE FEDCSIS. KRAKÓW, 203 they will pass, so they will pass also o cofiguratio B (with high probability). This meas that we do ot eed to coducts tests o cofiguratio B so frequetly as o cofiguratio A. Coclusio is that cofiguratio A is better for testig tha cofiguratio B, because it allows to detect more eviromet related defects. I order to compare eviromets it is good to have a umerical metric that will allow to evaluate effectiveess of give cofiguratio. It is also a requiremet for may optimizig algorithms (especially evolutioary) to provide a fitess fuctio to compare solutios. A. Measure of eviromet sesitivity I order to compare two eviromets for software testig we eed to establish metric that would tell which cofiguratio is better. Let a T be a set of tests (test suite) cosistig sigle tests t i. Let T k be a vector of test results executed i k iteratio. Test ca be either (pass) or 0 (fail). T k = (t,t 2,t 3...t ),t i = 0 () E j is a eviromet j. Testig fuctio F T is a fuctio that assigs for each k iteratio a vector of tests results T k to eviromet C j. F T (k,e j ) = (t,t 2,t 3,...,t ) (2) We ca describe F for sigle iteratio k i more coveiet way as a matrix, where colums are tests ad rows are eviromets (lets ote umber of cofiguratios as m). t ji is a result of test t i o eviromet C j. F T (k) = t t 2 t 3 t 2 t 22 t 23 t 3 t 32 t 33 First step i calculatig sesitivity is to remove those tests that does ot brig ay iformatio about eviromet differeces. We remove those colums that satisfy coditio: (3) p [,m] x [,] y [,] : t xp = t yp (4) This meas that removed are oly those tests that passed or failed i all cofiguratios (remove colums of all or all 0). The for each row vector we calculate how may times give test failed ad ormalize it by umber of tests i vector (after removig some of them i first step). ( t jx ) x= Ses(C j ) = (5) Ses(C j ) [0,] (6) Sesitivity value close to 0 meas that give eviromet is ot good for fidig defects because all tests here pass. Whe sesitivity is meas that cofiguratio is a good cadidate for fidig software errors because all tests fail o it whereas o at least oe other cofiguratio they pass. Of course, if all tests fail o give cofiguratio we have to check if the problem is ot with tests itself - for example there is a defect i testig code. B. Properties of eviromet sesitivity Let s defie eviromet domiatio: eviromet A domiates eviromet B if: x : t Ax < t Bx y x : t Ay t By (7) I other word: there is at least oe test that failed o cofiguratio A but passed o cofiguratio B. This would mea that cofiguratio A foud a defect that was ot discovered by cofiguratio B. Eviromet sesitivity has this property that: A domiates B Ses(C A ) > Ses(C B ) (8) This property is result of eviromet sesitivity defiitio. Let sum iequalities i secod part of domiatio defiitio: k i t Ak k i t Bk (9) If we add t Ai < t Bi, weak iequality will become strog iequality: t Ak < t Bk (0) Note that sesivity calculatio requires removig tests that i every cofiguratio failed or passed. This will also covert weak iequality ito strog oe. If we multiply both sides by ad add : t Ak > t Bk () Because = the we ca rewrite equatio as: t Ak > ( t Ak ) > Now divide both sides by : ( t Ak ) > t Bk (2) ( t Bk ) (3) ( t Bk ) Ad ow usig eviromet sesitivity defiitio: (4) Ses(C A ) > Ses(C B ) (5) Itroductio of eviromet domiatio allows to us to use existig multi-criteria optimizatio techiques to fid Paretoefficiet solutios. This proof ca also be used to quickly compare results of tests ru o two cofiguratios without calculatig sesitivity itself. Of course it will oly itroduce order to the set of cofiguratios but would ot give ay idea how much they differ.

3 UKASZ POBERENIK: A METHOD FOR SELECTING ENVIRONMENTS 345 C. Algorithm to geerate cofiguratios Algorithm that will geerate ad evaluate eviromets must have several importat properties: ) Works o discrete solutio spaces. 2) A ability to search ukow solutio space (we have o additioal iformatio about local optima). 3) Iterative schema of work, similar to iterative test executio. Geeratig ew eviromet ad maitaiig it is a costly operatio. This meas that algorithm must work with small data sets - typically 8-2 cofiguratios. Tests should be ru frequetly, every code chage or at least daily. This meas that we may have eough iteratios util we reach optimal solutio. However we have to remember that each iteratio meas addig ew cofiguratio ad this is a costly operatio. Algorithm Simple algorithm for selectig most sesitive eviromets. E GeerateAvailableEviromets() {iitial cofiguratio pool} P RadomSubset(E, ) {P represets curret workig set} P {P represets ext set} repeat P P {P is set from previous iteratio} E E P R RuTests(P) S CalculateSesivity(R) S SortBySesivity(S) P for i = 0 to k do P P S[i] ed for P P RadomSubset(E, k) util E ot empty ad P P GeerateAvailableEviromets() creates a set of all possible eviromets we wat to execute tests o. Fuctio RadomSubset(X, ) geerates a radom subset from set X of size. Summarizig algorithm above: i each iteratio we ru test suite o selected eviromets (workig set). Usig test results we calculate sesitivity for each of them. After that we select k best of them. From iitial pool of eviromets we choose radom oes to fill up workig set so it will have cofiguratios agai. Procedure is repeated util all cofiguratios are used (iitial pool is empty) or i ext two cosecutive iteratios k best cofiguratios is the same. This algorithm teds to go though differet solutios util it coverge to optimal oe. For eviromet compatibility testig this meas that before we reach optimal set of cofiguratios we will test much more of them ad there is a possibility that we will fid eve more software defects, tha usig optimal set from the begiig. III. EXPERIMENTS A. Direct applicatio of eviromet sesitivity measure To verify properties of eviromet sesitivity a experimet was coducted. We used a simple cofiguratio with oe operatig system ad a web browser istalled o it. Operatig systems used were Liux, Widows ad Mac OS X. Browsers uder test were Iteret Explorer, Firefox, Chrome, Safari, Opera. Each browser was available i several differet versios (depedig o browser type). System used for experimet was built usig small web server (Jetty) that was ruig a static web page. This web page was based o a popular HTML5 compatibility test site ( ad server both as test suite ad applicatio uder test. Existig scripts were modified to sed test results to data collectio servlet ruig o the same web server (origially they were displayed o the scree). Schematic diagram of system used for experimet is show o Figure 2. Whe the test page was loaded it executed 242 true/false tests ad set results usig JSON format back to server where they were stored i file alog with iformatio about browser ad operatig system type. The same page was ru o each eviromet ad test results were set usig separate script back to server that stored them for further aalysis. Differet cofiguratios were provided by web browser compatibility testig cloud service (browsershots.org). We collected results for 46 differet cofiguratios. Expected umber of eviromets should be higher, because some of the cofiguratios has bee ot executed at all by the cloud (which is a defect i cloud service). However umber of collected data is eough for aalysis. I real life testig setups there are usually o more tha several eviromets i costat use. Sesitivity measure by defiitio is calculated relatively to other eviromets i tested cofiguratio set. I most cases there is ot eough resources (computig power, time, machies) to perform tests (ad calculate sesitivity) for every eviromet i give cofiguratio space. We wated to check how much sesitivity measure will differ whe it is calculated for small subset of cofiguratio space agaist full cofiguratio space. From all 46 eviromets we chose radomly subsets of 5, 8 ad 0 eviromets ad calculated sesitivity for each cofiguratio i it. We observed that sesitivity measure does ot chage more tha 2 percet whe it is calculated for a reasoable subset of iitial test results (see Table I). If we use more tha 8 eviromets it seems that average differece is less tha 0 percet. We suppose that this behavior of measure is possible because the way eviromet reacts to tests is ot depedet o other eviromets. This makes this sesitivity measure good cadidate for fitess fuctio i evolutioary programmig. B. Sesitivity measure as a fitess fuctio As stated before sesitivity measure ca be used as fitess fuctio so the ext step was to check if proposed algorithm allows to quickly fid best eviromets. Populatios of sizes 8, 0 ad 2 were tested. Each time algorithm was ru 000

4 346 PROCEEDINGS OF THE FEDCSIS. KRAKÓW, 203 WEB SERVER TEST PAGE WEB PAGE WITH TESTS WEB TESTING CLOUD WEB BROWSER WEB BROWSER 2 RESULTS DATA COLLECTION SCRIPT TEST RESULTS WEB BROWSER Fig. 2: Architecture of the system used for eviromet compatibility experimet. TABLE I: Stadard deviatio of eviromet sesitivity calculated from radom subsets from iitial data. 5 eviromets 8 eviromets 0 eviromets 00 radom subsets radom subsets radom subsets TABLE II: Averaged results after 000 executio of eviromet selectio algorithm. Differece is calculated agaist sesitivity calculated for all cofiguratios together. Eviromet sesivity Populatio size Max differece Max iteratios = 8, k = 4 5% 4.32 iteratios = 0, k = 5 4.5% 4.09 iteratios = 2, k = 6 3.8% 3.3 iteratios times ad results were averaged. They are preseted i Table II. For populatio size of 0 algorithm delivered a stable set of eviromets i less tha 5 iteratios. I Table III we ca see browsers selected by algorithm i more tha 0% of cases alog with their average sesitivity. Colums Operatig system, Browser type ad Browser Versio defie eviromet. Frequecy shows percetage of times give cofiguratio was chose i top k results i 000 rus of algorithm (eg. 75% meas that is was chose i 750 times). Average sesitivity is arithmetic mea of sesitivity value calculated for eviromet i all rus. If we compare this table with sesitivity calculated for all eviromets i Appedix A Table IV they basically match each other. C. Strategies for selectig eviromets for tests Results also proved commo sese that better to test o older versios of software because ewer versios have lot of compatibility problems already fixed. This ca be see o Figure 3 ad 4 where sesitivity of eviromet is preseted versus browser versio. We had to ormalize versio umberig to [0, ] because of differet umberig schemes Oldest Normalized browser versio Newest Fig. 3: Sesitivity of eviromet by browser versio for Mozilla Firefox. Versio umbers were ormalized to be from 0 (oldest) to (latest). You ca see sudde improvemet i HTML5 compatibility after third cosecutive versio. used by browser vedors. We ca cosider several strategies to reduce umber of eviromets used for tests. Simplest oe is to establish a cut off poit below that every eviromet is discarded. O Figure 3 we see that good cut off poit will be sesitivity with value 0.5 because it clearly separates set. However other good strategy will be to discard those some eviromets that have similar sesitivity value. From Figure 3 ad Table IV we see that Firefox from versio 6 to 5 have sesitivity betwee 0.3 ad 0.4. This meas that we ca choose oe or several of them based o ow preferece (or radom choice) because they behave more or less similarly durig tests. Other importat aspect is that eviromet sesitivity ca provide a order of tests. If we start with eviromets with highest sesitivity ad some tests will fail, we ca stop, fix defect ad start over agai. I our test case, testig complicated web pages o latest browser versios will likely be successful,

5 UKASZ POBERENIK: A METHOD FOR SELECTING ENVIRONMENTS 347 TABLE III: Average sesitivity for eviromets usig proposed algorithm (averaged after 000 rus) for cofiguratio set of size 0. Frequecy show how may times give eviromet was chose by algorithm i top k best. Oly those cofiguratios with frequecy more tha 0% are show. Operatig system Browser type Browser versio Frequecy Average sesitivity LINUX FIREFOX % LINUX KONQUEROR % MAC OS X CAMINO % LINUX FIREFOX % WINDOWS FIREFOX % MAC OS X SAFARI % WINDOWS CHROME % WINDOWS CHROME % WINDOWS OPERA % LINUX FIREFOX % LINUX FIREFOX % Eviromet sesivity Oldest Normalized browser versio Newest Fig. 4: Sesitivity of eviromet by browser versio for Chrome. Versio umbers were ormalized to be from 0 (oldest) to (latest). You ca see improvemet i HTML5 compatibility i latest versios. However it is ot as steep as i Firefox browser. because they are more HTML5 compatible. So better strategy will be to test o older versios ad if they pass tests, the check o latest versios. IV. CONCLUSIONS AND FUTURE WORK It seems that itroduced eviromet sesitivity measure is a good way of measurig usefuless of eviromet for testig purposes. It provides aalytical way to compare cofiguratios ad allows to use existig optimizatio techiques. For more complicated eviromets (that have several odes i their CDG) we pla to use evolutioary algorithms. For preseted browser testig case, cross-over ad mutatio operatios were ot feasible because they produced cofiguratios that were ot available i testig cloud. Itroductio of eviromet domiatio (i Pareto sese) will allow to use existig methods used i multi-criteria optimizatio. Automated tests are usually ru frequetly i order to fid out regressio defects itroduced durig developmet. This causes tests to repeatedly oscillate betwee pass ad fail states. We are ow extedig sesitivity model by itroducig time lie to take those chages ito cosideratio ad utilize historical iformatio for more precise results. We are also ivestigatig possibility of usig machie learig to correlate chages i applicatio code base with historical test results to predict the best cofiguratio ad tests order to test o. This way whe a ew chage is beig itroduced to software we ca decide i which eviromet it should be tested i first place. I our research we are plaig to used multi-aget systems (See [5] ad [6]) that will automatically deploy eviromets ad optimize them for most efficiet testig i terms of quality ad resource cosumptio. Sesitivity is a useful measure to be used i algorithms that detect uusual behaviors like those metioed i [7] ad [8]. We are also cosiderig itroducig secod measure based o probability that will cooperate with eviromet sesitivity that will allow us to better describe eviromet behavior ad compare them i more tha oe category. REFERENCES [] L. Poberezik, Automatic geeratio ad cofiguratio of test eviromets, i Iformatio Systems Architecture ad Techology - Web Iformatio Systems Egieerig, Kowledge Discovery ad Hybrid Computig. Oficya Wydawicza Politechiki WrocÅĆawskiej, WrocÅĆaw, 20, p [2] I.-C. Yoo, A. Sussma, A. Memo, ad A. Porter, Direct-depedecybased software compatibility testig, i Proceedigs of the twety-secod IEEE/ACM iteratioal coferece o Automated software egieerig, ser. ASE 07. New York, NY, USA: ACM, 2007, pp [Olie]. Available: [3] I.-C. Yoo, A. Sussma, A. Memo, ad A. Porter, Effective ad scalable software compatibility testig, i Proceedigs of the 2008 iteratioal symposium o Software testig ad aalysis, ser. ISSTA 08. New York, NY, USA: ACM, 2008, pp [Olie]. Available: [4] I. Yoo, Compatibility testig for compoet-based systems, Ph.D. dissertatio, Uiversity of Marylad, 200, hdl.hadle.et/903/294.

6 348 PROCEEDINGS OF THE FEDCSIS. KRAKÓW, 203 [5] K. Cetarowicz ad V. Gruer, P. af Hilare, A formal specificatio of m- aget architecture, i Proc. Multi-Aget Systems CEEMAS 200, L. N. i. A. I. v.. S.-V. Keplicz B., Nawarecki E., Ed., Berli, Heidelberg, 2002, pp [6] K. Cetarowicz, From algorithm to aget, i Computatioal Sciece ICCS 2009, LNCS 5545 Spriger Verlag, 2009, pp [7] K. Cetarowicz ad G. Rojek, Behavior based detectio of ufavorable resources, i Proc. Computatioal Sciece - ICCS 2004, G. S. P. e. a. L. N. i. C. S. v.. S.-V. Bubak, M; VaAlbada, Ed., Berli, Heidelberg, 2004, pp [8] K. Cetarowicz ad G. Rojek, Behavior evaluatio with actios samplig i multi-aget system, i Proc. Multi-Aget Systems ad Applicatios CEEMAS 2005, P. V. L. N. i. C. S. v.. S.-V. Pechoucek, M; Petta, Ed., Berli, Heidelberg, 2005, pp APPENDIX I this sectio we preset a table with sesitivity values calculated for differet versios of popular browsers ruig o various operatig systems. Sesitivity was calculated at oce based o all test results from all available cofiguratios.. I productio it is usually ot possible to keep so may testig eviromets, so oly a small subset of them is used for daily testig ad more of them are added whe eeded (for example before product release). You ca compare results from this table with values from Table III. TABLE IV: Sesitivity values calculated for all cofiguratios (oly o-zero values are show). I this case sesitivity was calculated for all eviromets at oce. System Browser Browser versio Sesitivity LINUX FIREFOX LINUX FIREFOX WINDOWS FIREFOX LINUX KONQUEROR MAC OS X CAMINO MAC OS X SAFARI WINDOWS CHROME WINDOWS CHROME WINDOWS OPERA LINUX FIREFOX LINUX FIREFOX MAC OS X FIREFOX MAC OS X FIREFOX MAC OS X FIREFOX MAC OS X FIREFOX MAC OS X FIREFOX WINDOWS FIREFOX WINDOWS FIREFOX LINUX SAFARI WINDOWS CHROME WINDOWS CHROME LINUX CHROME MAC OS X SAFARI WINDOWS CHROME LINUX CHROME LINUX CHROME MAC OS X CHROME WINDOWS SAFARI WINDOWS OPERA

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

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Avid Interplay Bundle

Avid Interplay Bundle Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers

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

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

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

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

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

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

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

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

LU Decomposition Method

LU Decomposition Method SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

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

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

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

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

ISSN (Print) Research Article. *Corresponding author Nengfa Hu Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com

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

BAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8

BAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8 BAAN IVc/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

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting the Number of Minimum Roman Dominating Functions of a Graph Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

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

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

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

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

Normal Distributions

Normal Distributions Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,

More information

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

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

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

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

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite

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

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

Heuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)

Heuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP) Heuristic Approaches for Solvig the Multidimesioal Kapsack Problem (MKP) R. PARRA-HERNANDEZ N. DIMOPOULOS Departmet of Electrical ad Computer Eg. Uiversity of Victoria Victoria, B.C. CANADA Abstract: -

More information

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

More information

BGP Attributes and Path Selection. ISP Training Workshops

BGP Attributes and Path Selection. ISP Training Workshops BGP Attributes ad Path Selectio ISP Traiig Workshops 1 BGP Attributes The tools available for the job 2 What Is a Attribute?... Next Hop AS Path MED...... p Part of a BGP Update p Describes the characteristics

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

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

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued

More information

Customer Portal Quick Reference User Guide

Customer Portal Quick Reference User Guide Customer Portal Quick Referece User Guide Overview This user guide is iteded for FM Approvals customers usig the Approval Iformatio Maagemet (AIM) customer portal to track their active projects. AIM is

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

Analysis of Documents Clustering Using Sampled Agglomerative Technique

Analysis of Documents Clustering Using Sampled Agglomerative Technique Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

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

Random Graphs and Complex Networks T

Random Graphs and Complex Networks T Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities

More information

Image based Cats and Possums Identification for Intelligent Trapping Systems

Image based Cats and Possums Identification for Intelligent Trapping Systems Volume 159 No, February 017 Image based Cats ad Possums Idetificatio for Itelliget Trappig Systems T. A. S. Achala Perera School of Egieerig Aucklad Uiversity of Techology New Zealad Joh Collis School

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

Arithmetic Sequences

Arithmetic Sequences . Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered

More information

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

Our second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.

Our second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees. Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for

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

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

n Explore virtualization concepts n Become familiar with cloud concepts

n Explore virtualization concepts n Become familiar with cloud concepts Chapter Objectives Explore virtualizatio cocepts Become familiar with cloud cocepts Chapter #15: Architecture ad Desig 2 Hypervisor Virtualizatio ad cloud services are becomig commo eterprise tools to

More information

CMPT 125 Assignment 2 Solutions

CMPT 125 Assignment 2 Solutions CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address

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

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

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

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS) CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

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 ad Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-10559 Berli,

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

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

MAC Throughput Improvement Using Adaptive Contention Window

MAC Throughput Improvement Using Adaptive Contention Window Joural of Computer ad Commuicatios, 2015, 3, 1 14 Published Olie Jauary 2015 i SciRes. http://www.scirp.org/joural/jcc http://dx.doi.org/10.4236/jcc.2015.31001 MAC Throughput Improvemet Usig Adaptive Cotetio

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

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

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

Transitioning to BGP

Transitioning to BGP Trasitioig to BGP ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 24 th April

More information

Designing a learning system

Designing a learning system CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please

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

Evaluation of Support Vector Machine Kernels for Detecting Network Anomalies

Evaluation of Support Vector Machine Kernels for Detecting Network Anomalies Evaluatio of Support Vector Machie Kerels for Detectig Network Aomalies Prera Batta, Maider Sigh, Zhida Li, Qigye Dig, ad Ljiljaa Trajković Commuicatio Networks Laboratory http://www.esc.sfu.ca/~ljilja/cl/

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

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

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

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

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is

More information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

Bayesian Network Structure Learning from Attribute Uncertain Data

Bayesian Network Structure Learning from Attribute Uncertain Data Bayesia Network Structure Learig from Attribute Ucertai Data Wetig Sog 1,2, Jeffrey Xu Yu 3, Hog Cheg 3, Hogya Liu 4, Ju He 1,2,*, ad Xiaoyog Du 1,2 1 Key Labs of Data Egieerig ad Kowledge Egieerig, Miistry

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

An Improvement of the Basic El-Gamal Public Key Cryptosystem

An Improvement of the Basic El-Gamal Public Key Cryptosystem Iteratioal Joural of Computer Applicatios Techology ad Research A Improvemet of the Basic El-Gamal Public Key Cryptosystem W.D.M.G.M. Dissaayake (PG/MPhil/2015/09 Departmet of Computer Egieerig Faculty

More information

Floristic Quality Assessment (FQA) Calculator for Colorado User s Guide

Floristic Quality Assessment (FQA) Calculator for Colorado User s Guide Floristic Quality Assessmet (FQA) Calculator for Colorado User s Guide Created by the Colorado atural Heritage Program Last Updated April 2012 The FQA Calculator was created by Michelle Fik ad Joaa Lemly

More information

Tutorial on Packet Time Metrics

Tutorial on Packet Time Metrics Power Matters. Tutorial o Packet Time Metrics Lee Cosart lee.cosart@microsemi.com ITS 204 204 Microsemi Corporatio. COMPANY POPIETAY Itroductio requecy trasport Oe-way: forward & reverse packet streams

More information

An Estimation of Distribution Algorithm for solving the Knapsack problem

An Estimation of Distribution Algorithm for solving the Knapsack problem Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,

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

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

Performance Comparisons of PSO based Clustering

Performance Comparisons of PSO based Clustering Performace Comparisos of PSO based Clusterig Suresh Chadra Satapathy, 2 Guaidhi Pradha, 3 Sabyasachi Pattai, 4 JVR Murthy, 5 PVGD Prasad Reddy Ail Neeruoda Istitute of Techology ad Scieces, Sagivalas,Vishaapatam

More information

Homework 1 Solutions MA 522 Fall 2017

Homework 1 Solutions MA 522 Fall 2017 Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear

More information

NON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE

NON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE 14thNew Zealad Workshop 1992 NON-LNEAR MODELLNG OF A GEOTHERMAL STEAM PPE Y. Huag ad D. H. Freesto Geothermal stitute, Uiversity of Aucklad SUMMARY Recet work o developig a o-liear model for a geothermal

More information

Civil Engineering Computation

Civil Engineering Computation Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso

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