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

Size: px
Start display at page:

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

Transcription

1 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 71, D Kassel GERMANY j.boercsoek@ui-kassel.de schaefer@ui-kassel.de Abstract: The testig of safety-critical software systems yields ofte a small amout of errors. The reliability aalysis is therefore subject to restrictios, e.g. because of high variaces. The use of Bayesia statistics icorporates additioal data ito the reliability aalysis to overcome these restrictios. A model is developed that ca be used for a aalysis of software with low demad mode. The model is discussed ad evaluated. Key-Words: software reliability, bayesia reliability, reliability model, static aalysis, PFD 1 Itroductio 1.1 Motivatio I a ormal software-developmet process it is ecessary to calculate reliability metrics like failure rate, failure itesity, reliability or availability. For safety-related or safety-critical software it is madatory to calculate these parameters. Otherwise the software caot be released due to regulatios. These calculatios require data from the softwaredevelopmet process. The required data is obtaied i the test process as failure data, i.e. the failure occurreces ad times are recorded. The failure data is the used to compute the failure rate ad the depedet reliability parameters usig differet models. For safety-related software these parameters are based o scarce data, because the testig of safetyrelated software yields very few failures if the developmet process was carried out accordig to the safety stadards. Therefore the calculated reliability parameters ca have a high variace ad are ot trustworthy eough to be take ito accout. 1.2 Requirig additioal iformatio Cosequetly it is ecessary to acquire additioal iformatio, to reduce the statistical variace ad to make the reliability parameters more trustworthy. Extra data ca come from differet areas ad phases of the software developmet process. This ca iclude experiece ad parameters from past or similar projects or additioal iformatio directly gaied from the source code of the software, e.g. through formal methods a correctess proof ca be made. This is usually ot practicable for whole software systems, because the proof methods work oly uder certai circumstaces or with special restrictios [3]. The use of extra data from past or similar projects is also problematic, because small chages i the project ca lead to a very differet behaviour regardig reliability. The additioal iformatio that is used i this paper is derived from static aalysis. It is a procedure that ca automatically aalyse the sourcecode of the software, without actual executio, i regard to certai properties, e.g. security issues, deadlocks, memory leaks or value aalysis. Failures are the result of oe or more errors i a program state. A error is usual geerated from a variable that has a out of rage value, e.g. the Ariae V lauch failure was caused by a overflow of a program variable [5]. Value aalysis tries to detect the possibility of these kids of errors, so that variables ca be made safe, i.e. a overflow is made impossible through programmig techiques [1]. Not all program variables ca be made safe i this regard, either because of performace issues, additioal checks cost processig time, or because of the high costs of time ad moey. The extra data that is used is therefore umber of variables i the program that are safe, i.e. these variables ca ifer o errors ad therefore o failures, ad the umber of variables that are usafe, ISBN:

2 i.e. these variables ca potetially be the cause of a failure. 2 Reliability parameter The reliability parameters that are regarded i this paper are depedet o discrete probability parameters. Oe of the most importat reliability parameter accordig to the IEC stadard [4] is the so called probability of failure o demad (PFD). It is defied as the mea probability to perform a desiged fuctio o demad. The PFD is used for compoets with a low demad mode. A fuctio has a low demad mode, whe it is used oly scarce iside a system, i.e. it is executed for oly a fractio of the time compared to the surroudig system. Therefore it is appropriate to model this parameter as the result of a discrete radom process, i which the calculated parameter describes the probability the success or the failure of the fuctio with low demad mode. Safety Itegrity Level PFD SIL SIL SIL SIL Table 1: SILevel with their accordig PFD values 3 Bayesia reliability 3.1 Basics Addig extra iformatio or a-priori iformatio ito a model is usually doe with the use of Bayesia statistics. I reliability aalysis this is called Bayesia reliability. The classic approach to reliability aalysis produces parameters of a probability fuctio with its expected values ad its variace. A cofidece iterval has to be estimated for these parameters, i.e. the probability that the iterval boudaries are trustworthy i regard to the parameters. The advatage of the Bayesia approach is that it gives the credible iterval, i.e. the probability that the calculated reliability parameter lies i the iterval. This gives additioal certaity i the calculated values for the reliability parameters. Bayesia reliability uses two sets of iformatio: λ describes the reliability parameters that have to be calculated. This is for example the failure rate, failure itesity or the probability of failure o demad. The set D is the data that is available after testig. It cosists usually of failure occurreces ad times. These sets are used i the followig relatio: f ( D ) ) g ( D) (1) 0 f ( D ) ) d The reliability parameters for the model are calculated i the posteriori distributio λ D). It calculates the parameters with the highest probability give the recorded failure times. The additioal iformatio that is gaied from the value aalysis is icorporated ito the model through the prior distributio λ). The prior distributio is the iitial estimate of the parameters before ay failure times are collected. The probability that the give iitial estimate of the reliability parameters ca produce the collected data is calculated i the likelihood fuctio f(d λ). The deomiator of equatio (1) is called the margial distributio ad it represets a ormalizig factor for the posteriori distributio. A complete theoretical backgroud of Bayesia reliability is give i [2]. 4 Bayesia modellig I Bayesia statistics it is ecessary to specify a probability model. Oly the the posterior distributio ca be calculated. The model has the to be evaluated to cofirm that the Bayesia model yields usable results. The model is based o the chose likelihood fuctio ad the chose prior fuctio. The form of the prior distributio ca be derived from the chose likelihood, so that the resultig posterior distributio is i the same family of probability distributios. The model is the mathematical more coveiet, if the model is producig soud results. 4.1 Modellig of PFD For a PFD calculatio software is aalysed that has oly discrete rus. A fuctio that performs safety measures, e.g. emergecy shutdow, is i low demad mode ad therefore a PFD calculatio ca be applied. This is iterpreted as the probability that this software fuctio will fail if a safety measure has to be performed. Each demad to the software fuctio ca be see as Beroulli trial. A sum of rus is performed by the software fuctio ad the iterestig parameter is the umber of usuccessful rus, i.e. the umber of failures k. The Bayesia parameter λ i equatio (1) ca the be iterpreted as parameter of these Beroulli trials. It is iterpreted as the probability that a evet occurs. I this case the evet is defied as the iability to perform the iteded fuctio, i.e. a failure. The ISBN:

3 umber of evets k that occur ad the umber of trials represet the collected data D. A umber of idepedet ad idetical Beroulli trials are called a biomial distributio. The umber of trials is the amout of rus. The collectio of data D is doe by testig or simulatio of the software fuctio times. It will result i k failures of the software ad -k successful rus of the software. This gives a likelihood fuctio i the form of a biomial distributio, with a ukow parameter λ: k k f ( k ) (1 ) (2) k Figure 1 shows two biomial distributios with differet estimatios for λ. Fig. 1: Two examples of a biomial distributio The ukow parameter λ ca be estimated with the use of a prior distributio. The prior is chose because of mathematical cosideratios ad because it has to fit the uderlyig model. The model should also be useful whe o prior iformatio is available. The prior distributio should reflect that. For easy iterpretatio of the posterior parameters the prior distributio is chose so that it belogs to the same family as the posterior distributio, it is the called a cojugate prior i respect to the likelihood. The beta distributio ca be used as a cojugate prior for the biomial distributed likelihood fuctio i equatio (3): ( a a1 b1 ) Be( a, (1 ) (3) ( a) ( The parameters a ad b are both shape parameters. The beta distributio is defied for 0 <= λ <= 1, which makes sese because the PFD is a probability. The beta distributio ca take very differet forms ad is therefore very flexible ad powerful i modellig. Figure 2 shows four beta distributios with differet shape parameters. Fig. 2: Four examples of a beta distributio The most iterestig cases are the first ad the last forms, i relatio to the leged, of the example figure. The first form has the parameters a=1 ad b=1. It is a special case i which the beta distributio reduces to the uiform distributio. It ca be iterpreted as the complete absece of ay prior iformatio. The probability for every λ betwee zero ad oe is therefore equal, before ay data is collected. The example with the parameters a=2 ad b=10 is useful because it has the desired form for the PFD, it is cocetrated aroud small values for the PFD. If there is extra iformatio before the data collectio which ca give the prior distributio this form, the the posterior distributio has a similar form. It is absolute ecessary to check if the form of the prior distributio is soud i regard to the collected data. Buildig the posterior distributio from the biomial likelihood ad the beta prior yields a probability distributio of the followig form: k k (1 ) Be( a, k a, b, k, ) 1 (4) k k (1 ) Be( a, dp 0 k This is a beta distributed probability of the form: ( a k a1 bk 1 a, b, k, ) (1 ) ( k a) ( b k)) a, b, k, ) Be(( k a),( b k)) The PFD depeds o the two parameters of the prior distributio a ad b, ad o the umber of evets k (5) ISBN:

4 ad trials, i.e. failures that are collected through the testig or simulatio phase Parameter iterpretatio The iterpretatio of the parameter a ad b of the prior distributio is as follows. If the beta distributio is used as cojugate prior, with the biomial likelihood, the parameter a ad b describe the umber of evets of the Beroulli trial. I this case a is the umber of failures o demad ad b is the umber of successes o demad. The prior data is collected through static value aalysis ad is comprised of the umber of overall variables i the software code ad the umber of safe or usafe variables. The basic reasoig is, if there is o prior iformatio, i.e. the umber of safe variables is ot kow ad all variables have to be regarded as usafe variables, the the prior distributio has to reflect that absece of iformatio i the form of a uiform distributio. The beta distributio is flexible eough to support this (see form oe i figure 2) with the parameters a=1 ad b=1. The argumet for choosig the parameters is that with o prior iformatio ad with o data from actual rus o iformatio about the successful performace of the software is possible. The successful ru of a software demad has the the same probability as the failure of a software demad. This is reflected i the values of the parameters a ad b, which represet the umber of failures ad the umber of successes. The values of a ad b is 1, so that for every successful ru there is a usuccessful ru. The prior data has o iformatio about the umber of rus, because it is derived from static aalysis, which is performed without actual ruig the software. Istead the relatio of usafe ad safe variables is iterpreted as relatio of usuccessful ad successful rus. The parameter a ca the be iterpreted as the umber of usuccessful rus ormalised to 1 ad b is the umber of successful rus i relatio to a. This relatio is a result of the relatio of usafe variables to overall variables, i.e. if half of the variables are cosidered safe this gives a relatio of 1:2 ad the values of the parameters of the prior distributio are a=1 ad b=2. This model makes a costrait i regard to the actual umber of uses of the variables withi the software. Differet variables are used a differet umber of times. Some variables are used i every ru ad some are used ot oce i a actual ru. Because of the metioed costrait every variable has the same probability of beig used. I a actual ru of the software the umber of variables that are executed are i direct relatio to the umber of usafe ad safe variables, if this relatio is 1:2 the oly half as much usafe variables are used tha safe variables. Therefore the prior probability for a failure o demad has the same relatio ad ca be used i the prior distributio. This model has several advatages. It is easy to use. The prior distributio is easy to calculate. The form of the prior distributio fits the actual data. I the special case of absece of iformatio the results the results of the posterior distributio differ very little from the result if oly the likelihood distributio is used to calculate the reliability parameter. 5 Evaluatio of the model The model has to be checked to test that the delivered results of the model have reasoable meaig. I the followig sectio differet case are assumed ad the results are calculated ad their fitess iterpreted. The cases do ot use real world data. Istead oly sythetic data is used to check if the model theoretically produces meaigful results. Before the model is used i real world applicatios the model testig has to be exteded with real world data Applicatio I this case it is assumed the aalysed software is used i a eviromet that has a requiremet for the safety itegrity level (SIL) 2. It ca be see i table 1 that SIL2 requires a PFD reliability parameter betwee 10-2 ad It is assumed that the testig of the software is doe 1000 times (=1000) ad that 5 failure are couted (k=5). If a biomial distributio for the PFD parameter is assumed that parameter ca be calculated with a maximum likelihood estimatio L(λ). The maximum likelihood estimatio (MLE) maximises the fuctio L(λ) i regard to the parameter λ ad gives thereby the most likely value for λ give the recorded data: L( ) xi L( ) (1 ) xi ˆ i1 x i1 i f ( x ) k i xi (6) ISBN:

5 Fig. 3: Plot of the MLE of the test data Figure 3 shows the resultig ML estimatio, with a maximum at λ=0.005 which correspods to the expected mode for this data k/= By addig differet prior iformatio it is evaluated, if the model yields meaigful results. The first examied case is the absece of additioal iformatio, which gives a prior beta distributio of the form Be 1_prior (1,1). The a value aalysis is performed ad the result gives relatio of 1:20 of usafe variables to overall variables. This relatio is further improved with two additioal cases with the relatios of 1:50 ad 1:100. The resultig prior distributios are therefore Be 1_prior (1,1), Be 2_prior (1,20), Be 3_prior (1,50) ad Be 4_prior (1,100). The posterior distributio for these priors ca easily be calculated with equatio (5) ad the give data k=5 ad =1000. The resultig posterior distributios are Be 1_post (6,996), Be 2_post (6,1015), Be 3_post (6,1045) ad Be 4_post (6,1095) ad are show i figure Discussio These posteriori distributios have the same form as the uderlyig likelihood fuctio of figure 3. This should be the case, because the mai source of the parameter estimatio is still the collected data, which is represeted by the likelihood fuctio. The prior iformatio should therefore ot alter the form of the likelihood. It also should ot skew or shift the likelihood too much. I that sese all of the above posterior distributios are suitable for the collected data. The advatage that the Bayesia model gives is that from the posterior distributio credible itervals ca easily be obtaied. The credible iterval describes the probability that a calculated parameter lies i a certai iterval. The example distributios have 95% credible itervals of CI 1_post (0.0022,0.0116), CI 2_post (0.0022,0.0114), CI 3_post (0.0021,0.011) ad CI 4_post (0.002,0.0106). The parameter that was estimated directly from the likelihood fuctio has a aalogous iterval the cofidece iterval, which has the problem that there are differet methods to calculate the iterval ad the meaig of the iterval is slightly differet, compared to the credible iterval. The cofidece iterval describes the probability of the iterval boudaries i cotrast to the probability of the reliability parameter. The 95% cofidece iterval of the example i figure 3 is CI LF (0.0006,0.0094). Here the extra iformatio makes a differece. The itervals for the posterior distributio are smaller tha the iterval i the likelihood fuctio, which meas the actual parameter is more trustworthy. The reliability parameter itself is ot much chaged. This makes sese as the mai source of iformatio is the test data, ad the prior iformatio should ot shift that parameter much. I compariso the calculated modes, the value with the highest probability, are Mo 1_post (0.005), Mo 2_post (0.0049), Mo 3_post (0.0048) ad Mo 4_post (0.0045). For the posterior distributio without prior iformatio the mode is the same as the mode of the likelihood fuctio. Fig. 4: Plot of the posterior distributios Special case The developmet of safety critical software is doe very thorough ad accordig to a set of rules ad stadards. Therefore the software is ofte i a very mature state, whe the data collectio, the testig process, begis ad it is possible that o failures occur. But the software caot be regarded as free of errors, because that is a assumptio that is too optimistic. The resultig distributio for the likelihood fuctio has the followig form: ISBN:

6 mathematical results, e.g. the cofidece or credible itervals. A improvemet is achieved for the special case that o data is collected. The traditioal models fail to produce meaigful results i this case. The model used i this paper ca be used to overcome this deficit. Fig. 5: Plot of the MLE with k=0 The importat statistical characteristics for the biomial distributio with the calculated parameter λ=0 are the mode ad the expected mea, which are both 0. The software has tha to be iterpreted as free of errors, which caot be used i real projects. The posterior distributio for that case, with the same prior distributios as above, yield similar distributio forms: 6 Future Work Additioal models ca be developed ad evaluated, both for discrete data ad for cotiuous data. It has to be examied if differet prior distributios or likelihood fuctios yield better results. Data from real software projects has to be collected ad applied to the model, to see if the promisig results hold uder real world coditios. The umber of uses of safe ad usafe variables has to be collected ad has to be icorporated ito the model to get a more accurate relatio for the prior distributio. It has to be examied if additioal prior iformatio is easy to obtai ad ca icorporated ito this model to icrease the usefuless of this model, especially for the special case, whe o failure data could be collected. Fig. 5: Plot of the posterior distributios with k=0 The modes of all four distributios are also 0 ad therefore ot helpful. But for the expected meas of all these distributios applies λ!=0. These distributios regard the software as ot free of errors ad are there more usable. Refereces [1] Blachet B. et al A static aalyzer for large safety-critical software, Proceedigs of the ACM SIGPLAN 2003 coferece o Programmig laguage desig ad implemetatio, Jue 09-11, 2003, Sa Diego: ACM [2] Hamada, M.S. et. Al Bayesia Reliability, New York: Spriger [3] Heziger, T.A. et al Software verificatio with Blast. I SPIN'03, Workshop o Model Checkig Software, 2003 [4] Fuctioal Safety of Electrical / Electroic / Programmable Electroic Safety-related Systems (IEC 61508), Iteratioal Electrotechical Commissio: Iteratioal Electrotechical Commissio, 2010 [5] Lios, J.L Flight 501 Failure, Report by the Iquiry Board 6 Coclusio The described model demostrates good prospects. The calculatios give meaigful results that ca be easily iterpreted ad used. The use of additioal iformatio icreases the trust i the reliability calculatios, which is also displayed i the ISBN:

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

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

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

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR

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

The Extended Weibull Geometric Family

The Extended Weibull Geometric Family The Exteded Weibull Geometric Family Giovaa Oliveira Silva 1 Gauss M. Cordeiro 2 Edwi M. M. Ortega 3 1 Itroductio The literature o Weibull models is vast, disjoited, ad scattered across may differet jourals.

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

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

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

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

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

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

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

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

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

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

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

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

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

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

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

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

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

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

SOFTWARE usually does not work alone. It must have

SOFTWARE usually does not work alone. It must have Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp. 343 348 A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad

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

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

Chapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 4 Procedural Abstractio ad Fuctios That Retur a Value Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 4.1 Top-Dow Desig 4.2 Predefied Fuctios 4.3 Programmer-Defied Fuctios 4.4

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

Algorithm. Counting Sort Analysis of Algorithms

Algorithm. Counting Sort Analysis of Algorithms Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will

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

SECURITY PROOF FOR SHENGBAO WANG S IDENTITY-BASED ENCRYPTION SCHEME

SECURITY PROOF FOR SHENGBAO WANG S IDENTITY-BASED ENCRYPTION SCHEME SCURITY PROOF FOR SNGBAO WANG S IDNTITY-BASD NCRYPTION SCM Suder Lal ad Priyam Sharma Derpartmet of Mathematics, Dr. B.R.A.(Agra), Uiversity, Agra-800(UP), Idia. -mail- suder_lal@rediffmail.com, priyam_sharma.ibs@rediffmail.com

More information

DATA MINING II - 1DL460

DATA MINING II - 1DL460 DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,

More information

Recursive Estimation

Recursive Estimation Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short

More information

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering 0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy

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

Improved Random Graph Isomorphism

Improved Random Graph Isomorphism Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

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

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

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

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

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

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

Probability of collisions in Soft Input Decryption

Probability of collisions in Soft Input Decryption Issue 1, Volume 1, 007 1 Probability of collisios i Soft Iput Decryptio Nataša Živić, Christoph Rulad Abstract I this work, probability of collisio i Soft Iput Decryptio has bee aalyzed ad calculated.

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

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme

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

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

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

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

Toward a Method of Selecting Among Computational Models of Cognition

Toward a Method of Selecting Among Computational Models of Cognition Psychological Review Copyright 2002 by the America Psychological Associatio, Ic. 2002, Vol. 109, No. 3, 472 491 0033-295X/02/$5.00 DOI: 10.1037//0033-295X.109.3.472 Toward a Method of Selectig Amog Computatioal

More information

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural

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

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag

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

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

COP4020 Programming Languages. Compilers and Interpreters Prof. Robert van Engelen

COP4020 Programming Languages. Compilers and Interpreters Prof. Robert van Engelen COP4020 mig Laguages Compilers ad Iterpreters Prof. Robert va Egele Overview Commo compiler ad iterpreter cofiguratios Virtual machies Itegrated developmet eviromets Compiler phases Lexical aalysis Sytax

More information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

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

Kernel Smoothing Function and Choosing Bandwidth for Non-Parametric Regression Methods 1

Kernel Smoothing Function and Choosing Bandwidth for Non-Parametric Regression Methods 1 Ozea Joural of Applied Scieces (), 009 Ozea Joural of Applied Scieces (), 009 ISSN 943-49 009 Ozea Publicatio Kerel Smoothig Fuctio ad Choosig Badwidth for No-Parametric Regressio Methods Murat Kayri ad

More information

Revisiting the performance of mixtures of software reliability growth models

Revisiting the performance of mixtures of software reliability growth models Revisitig the performace of mixtures of software reliability growth models Peter A. Keiller 1, Charles J. Kim 1, Joh Trimble 1, ad Marlo Mejias 2 1 Departmet of Systems ad Computer Sciece 2 Departmet of

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

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager. CS2310 Fial Project Loghao Li Term Project Report Itroductio I this project, I worked o expadig exercise 4. What I focused o is makig the real gesture recogizig sesor ad desig proper gestures ad recogizig

More information

Behavioral Modeling in Verilog

Behavioral Modeling in Verilog Behavioral Modelig i Verilog COE 202 Digital Logic Desig Dr. Muhamed Mudawar Kig Fahd Uiversity of Petroleum ad Mierals Presetatio Outlie Itroductio to Dataflow ad Behavioral Modelig Verilog Operators

More information

Evaluating Top-k Selection Queries

Evaluating Top-k Selection Queries Evaluatig Top-k Selectio Queries Surajit Chaudhuri Microsoft Research surajitc@microsoft.com Luis Gravao Columbia Uiversity gravao@cs.columbia.edu Abstract I may applicatios, users specify target values

More information

World Scientific Research Journal (WSRJ) ISSN: Research on Fresnel Lens Optical Receiving Antenna in Indoor Visible

World Scientific Research Journal (WSRJ) ISSN: Research on Fresnel Lens Optical Receiving Antenna in Indoor Visible World Scietific Research Joural (WSRJ) ISSN: 2472-3703 www.wsr-j.org Research o Fresel Les Optical Receivig Atea i Idoor Visible Light Commuicatio Zhihua Du College of Electroics Egieerig, Chogqig Uiversity

More information

Convergence results for conditional expectations

Convergence results for conditional expectations Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,

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

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein 068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig

More information

Fuzzy Linear Regression Analysis

Fuzzy Linear Regression Analysis 12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical

More information

l-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word

l-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word A New Method of N-gram Statistics for Large Number of ad Automatic Extractio of Words ad Phrases from Large Text Data of Japaese Makoto Nagao, Shisuke Mori Departmet of Electrical Egieerig Kyoto Uiversity

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

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

Algorithms Chapter 3 Growth of Functions

Algorithms Chapter 3 Growth of Functions Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios

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

UNIVERSITY OF MORATUWA

UNIVERSITY OF MORATUWA UNIVERSITY OF MORATUWA FACULTY OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING B.Sc. Egieerig 2010 Itake Semester 7 Examiatio CS4532 CONCURRENT PROGRAMMING Time allowed: 2 Hours September 2014

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

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods.

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods. Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

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

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

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

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

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

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

More information

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka O-lie cursive letter recogitio usig sequeces of local miima/maxima Summary Robert Powalka 19 th August 1993 This report presets the desig ad implemetatio of a o-lie cursive letter recogizer usig sequeces

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

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

Data-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps

Data-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps Data-Drive Noliear Hebbia Learig Method for Fuzzy Cogitive Maps Wociech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy Cogitive Maps (FCMs) are a coveiet tool for modelig of dyamic systems by meas

More information

Baan Tools User Management

Baan Tools User Management Baa Tools User Maagemet Module Procedure UP008A US Documetiformatio Documet Documet code : UP008A US Documet group : User Documetatio Documet title : User Maagemet Applicatio/Package : Baa Tools Editio

More information

Enhancing Cloud Computing Scheduling based on Queuing Models

Enhancing Cloud Computing Scheduling based on Queuing Models Ehacig Cloud Computig Schedulig based o Queuig Models Mohamed Eisa Computer Sciece Departmet, Port Said Uiversity, 42526 Port Said, Egypt E. I. Esedimy Computer Sciece Departmet, Masoura Uiversity, Masoura,

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

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

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

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

Analysis of Algorithms

Analysis of Algorithms Presetatio for use with the textbook, Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Aalysis of Algorithms Iput 2015 Goodrich ad Tamassia Algorithm Aalysis of Algorithms

More information