A Coding Practice for Preparing Adaptive Multistage Testing Yung-chen Hsu, GED Testing Service, LLC, Washington, DC

Size: px
Start display at page:

Download "A Coding Practice for Preparing Adaptive Multistage Testing Yung-chen Hsu, GED Testing Service, LLC, Washington, DC"

Transcription

1 SESUG 011 Paper PO-3 A Codng Practce for Preparng Adaptve Multstage Testng Yung-chen Hsu, GED Testng Servce, LLC, Washngton, DC ABSTRACT The purpose of ths paper s to present a smulaton study of a codng practce for preparng adaptve multstage testng (MST) desgns for a credentalng testng program n the comng years MST s an adaptve test admnstraton method n whch a test form s talored as a sequence of pre-constructed modules at tem set level At each adaptaton pont a module s selected to match the profcency estmate of the examnee based on cumulatve performance on prevously admnstered modules For some testng programs, MST s consdered a better ft n ther future test development because the test delvery model offers a balanced tradeoff and a promsng ameloraton between the computerzed adaptve tests and the tradtonal lnear fxed-length tests In the smulaton, a macro s developed to estmate the profcency scores based on tem response theory The algorthm s mplemented wth PROC IML usng Newton-Raphson method To assess the classfcaton consstency and decson accuracy for examnees, kappa coeffcents from PROC FREQ and addtonal consstency measures are computed to more fully characterze the extent of the agreement Practcal polcy questons and test development consderatons are also dscussed INTRODUCTION For many credentalng testng programs, usng computers to admnster exams s a trend n the comng years There are good practcal reasons why adoptng a computer-based test admnstraton s preferred, whch nclude automated scorng and fast reportng, flexble exam schedules and locatons, and potentally hgher effcency and more precse profcency estmaton of examnees through computer-based or adaptve testng Several nnovatve test delvery models were consdered n practce, such as computerzed fxed testng (CFT), temlevel computer-adaptve testng (CAT), and multstage testng (MST) (Henrckson, 007; Jodon, Zensky, and Hambleton, 006) A CFT s analogous to the fxed-tem paper-and-pencl test (PPT) but wth more modern varetes that can be admnstered For example, dfferent examnees may take dfferent forms of the test or receve the tems n dfferent orders In contrast, CAT adapts the dffculty of the test and presents each new tem based on the profcency estmate of an examnee s performance on prevous tems CAT generally uses much fewer test tems than CFT does and has the advantage of offerng mproved effcency n estmatng examnee s profcency level However, there are potental psychometrc ssues and practcal shortcomngs found n the past CAT practces, such as tem exposure control and content balancng Besdes, data management effort and deployment cost are busness and fnancal concerns for admnsterng the test n operatonal envronment To balance the tradeoff between CFT and CAT, MST was proposed MST s a test admnstraton method closely related to CAT but has a test adaptaton at the tem set level nstead For some examnaton programs MST s consdered as a better delvery model n the test development MST may help amelorate the problems encountered n a tradtonal CAT yet stll offers better testng effcency than PPT or CFT Dependng on the test nature and practcal polcy of the testng program, there are practcal test development consderatons related to the desgn and mplementaton Ths study s a codng practce usng smulated data n preparng nformaton for decson makers of a credentalng testng program n the future ADAPTIVE MULTISTAGE TESTS Fgure 1 depcts the generalzed procedure of adaptve multstage test desgn A test form conssts of a seres of test modules and each test taker would potentally take a dfferent set of modules that s best targeted to the ndvdual s ablty MST starts wth an ntal test module for all examnees The ntal module commonly contans tems wth moderate dffculty at the medan profcency of the ntended group or a broad range of dffculty values Wth the examnee s performance on the ntal module, a profcency score can be estmated The profcency estmate s then used to select the next module that matches the examnee s profcency level Normally, the accumulated performance was used to estmate the profcency for decdng a module wth narrow and more focused dffculty n each round untl the test ends 1

2 SESUG 011 Select the frst stage test module Admnster test Estmate profcency End? Yes Report fnal profcency No Select the next stage test module Fgure 1 MST procedure SIMULATION A smulaton usng the two-stage test desgn was conducted to demonstrate the procedure for the preparaton work of the test development Rasch model s used n ths smulaton, whch s the smplest tem response theory (IRT) model for dchotomous tem havng only one parameter for the examnee and one for the tem that genercally referred to as a threshold Mathematcally, Rasch model can be expressed as P( u j 1 1) 1 exp( b ) representng the probablty of answerng a partcular dchotomously scored tem correctly gven the profcency level of a test taker, where b s the dffculty of tem whle s the ablty of person j The steps of conductng the smulaton study are outlned as follows: Data preparaton: Smulate true profcency scores ( t group ID, a sngle stage module, and both frst and second stage modules j j ), tem parameters ( b ), tem responses ( u ), true Profcency estmaton: Use u and b from the frst stage to estmate profcency score 1 Based on 1 to assgn second stage modules Combne data from both stages and estmate the fnal profcency score 1 Also estmate sngle stage profcency scores 0 for comparson Evaluaton: Calculate psychometrc propertes and related statstcs for evaluaton DATA PREPARATION To smulate true profcency scores for 3,000 test canddates, N(0,3) t are generated from a normal dstrbuton wth predefned upper and lower bounds We assume that the test wll be used to classfy the canddates nto three groups: A, B, and C (eg, pass advanced, pass, and fal) The canddates are dvded nto three groups Three sets of tem parameter b are also generated wth 1,000 each accordng to the true profcency scores t from a normal dstrbuton wth dfferent mean and bounds The three sets are combned form a pool of 60 tems and b usng Rasch model One frst stage module, whch contans Then, the responses u are generated from t 30 tems, and three second stage modules wth 0 tems each are assgned A 50-tem sngle-stage module s also assgned for comparson The frst stage module s desgned to contan a broad range of dffculty values whle the second stage modules has more tems wth dffculty located near the average profcency scores of the respectve group Fgures and 3 llustrate the test nformaton curves of the frst and second modules, respectvely The test nformaton s smply the sum over tems of the amount of tem nformaton Namely,

3 SESUG 011 The tem nformaton functon s defned as where Q 1 P, and ) P ( ) I ( ) I ( ) I ( ) P( ), P ( ) Q ( ) P ( For Rasch model, the expresson s smply I ( ) P ( ) Q ( ) t het a Fgure Test nformaton curve of the frst stage module t het a Fgure 3 Test nformaton curves of the second stage modules 3

4 SESUG 011 PROFICIENCY ESTIMATION The measure of the profcency or ablty of a gven examnee s the maxmum lkelhood estmate based on the responses to the tems and the values of the parameters of the tems For a test module wth N tem, u {0,1 } refers to a test taker s response to tem, whch s scored dchotomously Under the assumpton of local ndependence, the probablty of the vector of tem response U ( u1, u,, un ) s gven by the lkelhood functon U P u Q 1 u Pr( ), where P s the Rasch functon, Q 1 P, and s the ablty of the test taker The dervatves of the loglkelhood functon wth respect to the test taker s L 1 up 1 P Q ( 1 u ) Q, where L s the natural logarthm of the lkelhood functon Pr For Rasch model, we have Then P P Q L ( u P ) and and Q P L Q Usng a Taylor seres expanson to solve the lkelhood equatons, we have where 0 L( ) L( 0 ) L( 0 ) ( 0 ) 0 can be vewed as a tral value for the root of at the n th step The approxmate value of the next step n1 can be derved from (u P ) n1 n PQ wth second-order approxmaton The above teratve scheme s known as the Newton-Raphson method and the process must be repeated untl become suffcently small A SAS/IML module, whch mplemented the Newton-Raphson method, s used to smplfy the task The followng statements show a macro that calls the IML module to estmate the ablty for every test taker n an teraton loop The ntal tral values are all set to be zero n the macro To mprove the effcency, they can frst be replaced and estmated by usng the total score or other means %macro rbtrasch( /* Ablty estmaton */ dsr=, /* tem response */ dsp=, /* Item parameter */ dst= /* Ablty */ ); P Q proc ml; nmaxiter=30; mndelta=001; ubtheta=5; lbtheta=-5; *max teraton number; *theta upper bound; *theta lower bound; use &dsr; read all var _num_ nto r; use &dsp; read all var _num_ nto b; 4

5 SESUG 011 ntakers=nrow(r); nitems=ncol(r); nitems1=nrow(b); * Error check; f nitems^=nitems1 then do; prnt "ERROR: Inconsstent nputs"; stop; * Newton-Raphson equaton teraton loop; start rascht(t0,pb,r,mxt,ubt,lbt,mnd); t=t0; nt=1; n=nrow(pb); do whle(nt<=mxt); snum=00; sdem=00; do =1 to n; p=10/(10+exp(pb[]-t)); w=p*(10-p); v=r[]-p; snum=snum+v; sdem=sdem+w; dta=snum/sdem; * Check convergence and set bounds; f abs(dta)<mnd then nt=mxt; else f dta>ubt then delta=ubt; else f dta<lbt then delta=lbt; * Update; t=t+dta; nt=nt+1; return (t); fnsh rascht; * Intal estmate t0=j(ntakers,1,0); * Loop through every test taker; theta=j(ntakers,1,0); do j=1 to ntakers; theta[j]=rascht(t0[j],b,r[j,],nmaxiter,ubtheta,lbtheta,mndelta); create &dst from theta[colname='theta']; append from theta; close theta; qut; run; %mend rbtrasch; EVALUATION The correlaton matrx of the true profcency scores, estmated scores from the two-stage (30 and 0 tems) test and from the sngle stage test s provded n Table 1 by usng PROC CORR procedure The correlaton between the true score and the two-stage profcency estmates s hgher than the correcton between the true score and the snglestage profcency estmates Table 1 Correlaton matrx of true scores, two-stage, and sngle stage profcency estmates True score Two-stage Two-stage Sngle-stage

6 SESUG 011 For most credentalng testng programs the decson accuracy for classfyng canddates s crucal We assumed that both A and B groups are collapsed as Pass, and C group s Fal Then the Cohen s kappa coeffcent, whch provdes a measure of agreement, can be obtaned from PROC FREQ procedure wth TEST KAPPA opton as Po Pc 1 P where P o s observed agreement and P c s chance agreement The values of kappa range from -1 to +1 However, negatve kappa s unusual n practce as the observed agreement s less than change agreement A number of studes (Sm and Wrght, 005; Vera and Garrett, 005) show that there are other factors can nfluence the magntude of kappa and suggested reportng addtonal ndces for provdng a clear pcture, such as prevalence ndex and bas ndex Both of them are ncluded n Table although low kappa and hgh prevalence are very rare n most well desgned educatonal assessment program The decson accuracy of the two-stage case s slghtly hgher but not sgnfcant n the smulaton The mean and standard devaton of the dfference to the true score are also provded even though accurate profcency estmates are less crtcal for most credentalng tests The results show that two-stage desgn yelds more accurate estmates Table Cohen s kappa, Prevalence ndex, and Bas ndex Cohen kappa Prevalence ndex Bas ndex Mean Standard devaton True/Two-stage True/Sngle-stage CONCLUSION Ths smulaton study s a codng practce of prelmnary preparaton work for a credentalng testng program n the comng years MST s beng consdered and s expected to have some dstnct advantages over conventonal fxedlength testng In the test development, there are many ssues to resolve In order to provde nformaton for decson makng, parameters and data wll be adjusted accordngly when more nformaton, such as data collected from feld testng, tem characterstcs n the future tem bank, and data derved from prevous tests, become avalable Ths paper llustrates the procedure usng SAS n preparng nformaton for makng decson and outlnes some steps for use n the development REFERENCES Hendrckson, A (007) An NCME Instructonal model on multstage testng Educatonal Measurement: Issues and Practce, 6(), 44-5 Jodon, MG, Zensky, A, and Hambleton, RK (006) Comparson of the psychometrc propertes of several computer-based test desgns for credentalng exams wth multple purposes Appled Measurement n Educaton, 19(3), 03-0 Sm, J and Wrght, CC (005) The kappa statstc n relablty studes: Use, nterpretaton, and sample sze requrements Physcal therapy, 85(3), Vera, AJ and Garrett, J M (005) Understandng nterobserver agreement: The kappa statstc Famly Medcne, 37(5), CONTACT INFORMATION Your comments and questons are valued and encouraged Contact the author at: Yung-chen Hsu GED Testng Servce, LLC One Dupont Crcle NW Washngton, DC 0003 Work Phone: E-mal: yung-chenhsu@gedtestngservcecom Web: wwwgedtestngservcecom SAS and all other SAS Insttute Inc product or servce names are regstered trademarks or trademarks of SAS Insttute Inc n the USA and other countres ndcates USA regstraton Other brand and product names are trademarks of ther respectve companes c 6

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

Using SAS/OR for Automated Test Assembly from IRT-Based Item Banks

Using SAS/OR for Automated Test Assembly from IRT-Based Item Banks Usng SAS/OR for Automated Test Assembly from IRT-Based Item Bans Yung-chen Hsu, GED Testng Servce, LLC, Washngton, DC Tsung-hsun Tsa, Research League, LLC, Matawan, J ABSTRACT In recent years, advanced

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Paper 241. Generating Item Responses Based on Multidimensional Item Response Theory. Jeffrey D. Kromrey Cynthia G. Parshall Walter M.

Paper 241. Generating Item Responses Based on Multidimensional Item Response Theory. Jeffrey D. Kromrey Cynthia G. Parshall Walter M. Paper 241 Generatng Item Responses Based on Multdmensonal Item Response Theory Jeffrey D. Kromrey Cyntha G. Parshall Walter M. Chason Qng Y Unversty of South Florda ABSTRACT The purpose of ths paper s

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

More information

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Estimation of composite score classification accuracy using compound probability distributions

Estimation of composite score classification accuracy using compound probability distributions Psychologcal Test and Assessment Modelng, Volume 55, 2013 (2), 162-180 Estmaton of composte score classfcaton accuracy usng compound probablty dstrbutons Chrs Wheadon 1 & Ian Stockford 2 Abstract Presented

More information

Adaptive Regression in SAS/IML

Adaptive Regression in SAS/IML Adaptve Regresson n SAS/IML Davd Katz, Davd Katz Consultng, Ashland, Oregon ABSTRACT Adaptve Regresson algorthms allow the data to select the form of a model n addton to estmatng the parameters. Fredman

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

On the Virtues of Parameterized Uniform Crossover

On the Virtues of Parameterized Uniform Crossover On the Vrtues of Parameterzed Unform Crossover Wllam M. Spears Naval Research aboratory Washngton, D.C. 20375 USA spears@ac.nrl.navy.ml Kenneth A. De Jong George Mason Unversty Farfax, VA 22030 USA kdejong@ac.gmu.edu

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

Advanced Computer Networks

Advanced Computer Networks Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

The necessity and importance of cognitive diagnosis is being realized by more and

The necessity and importance of cognitive diagnosis is being realized by more and WANG, YING-CHEN, Ph.D. Factor Analytc Models and Cogntve Dagnostc Models: How Comparable Are They? A Comparson of R-RUM and Compensatory MIRT Model wth Respect to Cogntve Feedback. (2009) Drected by Dr.

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

A Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves

A Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves A Newton-Type Method for Constraned Least-Squares Data-Fttng wth Easy-to-Control Ratonal Curves G. Cascola a, L. Roman b, a Department of Mathematcs, Unversty of Bologna, P.zza d Porta San Donato 5, 4017

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Multilevel Analysis with Informative Weights

Multilevel Analysis with Informative Weights Secton on Survey Research Methods JSM 2008 Multlevel Analyss wth Informatve Weghts Frank Jenkns Westat, 650 Research Blvd., Rockvlle, MD 20850 Abstract Multlevel modelng has become common n large scale

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Econometrics 2. Panel Data Methods. Advanced Panel Data Methods I

Econometrics 2. Panel Data Methods. Advanced Panel Data Methods I Panel Data Methods Econometrcs 2 Advanced Panel Data Methods I Last tme: Panel data concepts and the two-perod case (13.3-4) Unobserved effects model: Tme-nvarant and dosyncratc effects Omted varables

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

Multi-view 3D Position Estimation of Sports Players

Multi-view 3D Position Estimation of Sports Players Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Petri Net Based Software Dependability Engineering

Petri Net Based Software Dependability Engineering Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

EXTENDED BIC CRITERION FOR MODEL SELECTION

EXTENDED BIC CRITERION FOR MODEL SELECTION IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7

More information

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling , pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute

More information

RADIX-10 PARALLEL DECIMAL MULTIPLIER

RADIX-10 PARALLEL DECIMAL MULTIPLIER RADIX-10 PARALLEL DECIMAL MULTIPLIER 1 MRUNALINI E. INGLE & 2 TEJASWINI PANSE 1&2 Electroncs Engneerng, Yeshwantrao Chavan College of Engneerng, Nagpur, Inda E-mal : mrunalngle@gmal.com, tejaswn.deshmukh@gmal.com

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL GROUP ANALYSIS Martn M. Mont UCLA Psychology NITP AGGREGATING MULTIPLE SUBJECTS When we conduct mult-subject analyss we are tryng to understand whether an effect s sgnfcant across a group of people. Whether

More information

The Man-hour Estimation Models & Its Comparison of Interim Products Assembly for Shipbuilding

The Man-hour Estimation Models & Its Comparison of Interim Products Assembly for Shipbuilding Internatonal Journal of Operatons Research Internatonal Journal of Operatons Research Vol., No., 9 4 (005) The Man-hour Estmaton Models & Its Comparson of Interm Products Assembly for Shpbuldng Bn Lu and

More information

A Robust Method for Estimating the Fundamental Matrix

A Robust Method for Estimating the Fundamental Matrix Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.

More information

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status Internatonal Journal of Appled Busness and Informaton Systems ISSN: 2597-8993 Vol 1, No 2, September 2017, pp. 6-12 6 Implementaton Naïve Bayes Algorthm for Student Classfcaton Based on Graduaton Status

More information

Object-Based Techniques for Image Retrieval

Object-Based Techniques for Image Retrieval 54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the

More information

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005 Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm

Design of a Real Time FPGA-based Three Dimensional Positioning Algorithm Desgn of a Real Tme FPGA-based Three Dmensonal Postonng Algorthm Nathan G. Johnson-Wllams, Student Member IEEE, Robert S. Myaoka, Member IEEE, Xaol L, Student Member IEEE, Tom K. Lewellen, Fellow IEEE,

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Bayesian Approach for Fatigue Life Prediction from Field Inspection

Bayesian Approach for Fatigue Life Prediction from Field Inspection Bayesan Approach for Fatgue Lfe Predcton from Feld Inspecton Dawn An, and Jooho Cho School of Aerospace & Mechancal Engneerng, Korea Aerospace Unversty skal@nate.com, jhcho@kau.ac.kr Nam H. Km, and Srram

More information

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

More information

End-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video

End-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video End-to-end Dstorton Estmaton for RD-based Robust Delvery of Pre-compressed Vdeo Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna, Santa

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

Air Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech.

Air Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech. Ar Transport Demand Ta-Hu Yang Assocate Professor Department of Logstcs Management Natonal Kaohsung Frst Unv. of Sc. & Tech. 1 Ar Transport Demand Demand for ar transport between two ctes or two regons

More information

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids) Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes

More information

Data Mining: Model Evaluation

Data Mining: Model Evaluation Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Testing Algorithms and Software. Software Support for Metrology Good Practice Guide No. 16. R M Barker, P M Harris and L Wright NPL REPORT DEM-ES 003

Testing Algorithms and Software. Software Support for Metrology Good Practice Guide No. 16. R M Barker, P M Harris and L Wright NPL REPORT DEM-ES 003 NPL REPORT DEM-ES 003 Software Support for Metrology Good Practce Gude No. 6 Testng Algorthms and Software R M Barker, P M Harrs and L Wrght Not Restrcted December 005 Verson.0 Natonal Physcal Laboratory

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Chapter 9. Model Calibration. John Hourdakis Center for Transportation Studies, U of Mn

Chapter 9. Model Calibration. John Hourdakis Center for Transportation Studies, U of Mn Chapter 9 Model Calbraton John Hourdaks Center for Transportaton Studes, U of Mn Hourd00@tc.umn.edu Why Calbrate? Computers Cannot Magcally Replcate Realty! Smulaton Models Are Desgned to be General Drver

More information

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL) Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,

More information

SVM-based Learning for Multiple Model Estimation

SVM-based Learning for Multiple Model Estimation SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:

More information

Fusion Performance Model for Distributed Tracking and Classification

Fusion Performance Model for Distributed Tracking and Classification Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.

More information