: not H. S i. max and. min. Paper ## P911

Size: px
Start display at page:

Download ": not H. S i. max and. min. Paper ## P911"

Transcription

1 Paper ## P9 Usng A to Perform Robust -ample Analyss of Means Type Randomzaton Tests for Varances Peter Wludyka, Unversty of North Florda, Jacksonvlle, FL ABTRACT A A macro for performng Analyss of Means (ANOM) type randomzaton tests for testng the equalty of varances s presented. Randomzaton technques for testng statstcal hypotheses can be used when parametrc tests are napproprate. uppose that ndependent samples have been collected. Randomzaton tests are based on shuffles or rearrangements of the (combned) sample. Puttng each of the samples n a bowl forms the combned sample. Drawng samples from the bowl forms a shuffle. huffles can be made wth replacement (bootstrap shufflng) or wthout replacement (permutaton shufflng). The tests that are presented offer two advantages. They are robust to non-normalty and they allow the user to graphcally present the results va a decson chart smlar to a hewhart control chart. The decson chart facltates easy assessment of both statstcal and practcal sgnfcance. elected results from a Monte Carlo study used to dentfy robust randomzaton tests that exhbt excellent power when compared to other robust tests wll be presented. NTRODUCTON Often t s useful to test whether each of populatons have the same varance. Ths homogenety of varance (HOV) hypothess may be wrtten H 0 : σ σ () th where σ s the varance of the populaton. The alternatve hypothess s H A : not H 0. Ths paper s concerned wth s > the case where ; that s, where three or more populatons are beng compared. The focus wll be on one-way balanced desgns, but the dscussons extend to unbalanced and more complex desgns. RANDOMZATON TET There are two types of randomzaton tests: exact randomzaton tests and approxmate randomzaton tests. Randomzaton tests are based on shuffles (resamplngs or rearrangements) of the (combned) sample. uppose that samples of sze n have been selected. The combned sample s formed by puttng each of the samples n a bowl. Let X denote the combned sample. Drawng from the bowl forms shuffles. The shuffles can be made wth replacement (called a bootstrap shuffle) or wthout replacement (called a permutaton shuffle). ANALY OF MEAN TYPE RANDOMZATON TET FOR VARANCE Four ANOM type randomzaton tests for varances have been proposed by Bernard and Wludyka (to appear). They are randomzaton versons of the Analyss of Means for Varances (ANOMV), the normal based test proposed by Wludyka and Nelson (997A). These tests can be used when normalty cannot be safely assumed. Each test can be performed by plottng the sample varances (or standard devatons) on a decson chart or equvalently by evaluatng an emprcal p-value. Usng the decson chart, the HOV hypothess s rejected f any sample varance plots outsde the decson lnes. Ether permutaton shuffles or bootstrappng shuffles can be used. The tests are RANDANOMV-D, RANDANOMV-DD, RANDANOMV-R and RANDANOMV-RD. Each test can be classfed as ether a dfference test or a rato test. The dfference tests are RANDANOMV-D and RANDANOMV-DD, and the rato tests are RANDANOMV-R and RANDANOMV-RD. n the DD and RD tests, devatons from the sample mean are shuffled nstead of the orgnal observatons. ee Bernard (999) for Monte Carlo results whch show that randomzaton tests are as powerful and robust as typcal robust alternatves, such as Levene s test. n ths paper only RANDANOMV-R wll be consdered. For a thorough treatment of the other approaches see Bernard (999). Ths test can be used when there are k samples (populatons) of sze n. Ths test should not be used when the populatons have markedly dfferent means. ee Bernard and Wludyka (to appear) or Bernard (999) for alternatves. Note that f the means are known, the mean of each populaton can be subtracted from each value pror to applyng RANDANOMV-R. RANDANOMV-R RANDANOMV-R, whch s based on the rato of each sample varance to the sum of the sample varances, s the randomzaton verson of the Analyss of Means for Varances (ANOMV), presented by Wludyka and Nelson (997A). ANOMV s a test that s sutable when the populatons can safely be assumed to be normal. For a A macro to perform ths test see Wludyka (999). There are two equvalent methods for performng ths test. The p- value method and the decson chart method. Each requres that the followng steps be performed. The A program n ths paper uses permutaton shufflng. Ether that or bootstrap shufflng can be used. A Monte Carlo study has shown that, n general, permutaton shufflng produces a more powerful test.. Calculate the mean of each sample, x. Calculate zj xj x n zj j 3. Calculate and ( n ) 4. For the ntal sample, calculate and mn mn 5. Randomly shuffle the orgnal data x j some number of tmes, N

2 j ( n ) 6. After each shuffle, calculate the current shuffle. 7. Calculate q mn mn, where x and n z j and zj xj x are based on q and To use the p-value method: 8. f q > then ngmx ngmx + q < then ngmn ngmn + 9. f mn mn ngmx + < α 0. f p-value-hgh ( N + ) ngmn + < α or p-value-low ( N + ) hypothess () s rejected., then Note that ngmx and ngmn are used to count the number of tmes that the shuffled values are more extreme those from the ntal sample (the unshuffled data). To use the decson chart method: For level of sgnfcance α, the sample varances are plotted wth decson lnes α UDL () CL LDL α mn α α where the quantles and mn are found usng equatons (6) - (9). The equal varance hypothess s rejected whenever at least one sample varance plots outsde the decson lnes. ( α ) (3) (4) can be found by orderng the set { q N} q,..., Α. Denote the r th largest value ( [] r n A by α th ). Let be the N ( N ) + α largest value n set Α, where [ X ] s the greatest nteger n X. (5) That s ( ) [ M ] α (6) where ( N + ) α M N (7) ( α ) mn can be found by orderng the set Β { q N} q mn,...,. Denote the r th smallest value ( α ) [] r n B by mn. Let mn be the α N ( N + ) [ ] X s the smallest nteger n X. That s, ( α ) [ M ] mn mn th smallest value n set Β, where where α M N ( N + ) (9) THE %RANOMV MACRO The %RANOMV macro can be used to perform the RANOMV- R test for the equalty of k varances. The varable ns s used dentfy the number of shuffles --- typcally 000. Data Preparaton The nput data fle must be contan two varables: a classfcaton varable that dentfes each of the k populatons and a measurement varable. The basc dea s that ns permutaton shuffles of the data wll be made. Ths s easly acheved by readng the data set ns tmes and assgnng a shuffle varable (,,ns) and a unform random (pseudo) varable (n the data step n the program ths varable s denoted shufno) to each data pont. The data set s then sorted by the random number (shufno) wthn shuffle, so that there are then ns random permutaton samples. These samples are used to gauge how unusual the orgnal sample s wth regard to the rato of smallest varance to the sum of the varances and the rato of the largest varance to the sum of the varances. ee the NPUT DATA comment n the source code. %RANOMV Output The decson table can be used to decde the hypothess: f any of the TD0 (sample standard devatons) plot outsde the UDL (upper decson lne) or LDL (lower decson lne) then reject at pre-specfed alpha. ee Tables below. (8)

3 Table : Decson Table RANDANOMV decson table for equalty of 5 varances OB TOOL UDL CL LDL TD A decson chart s also qute easy to nterpret: snce the standard devaton for tool plots below the LDL the equal varance hypothess s rejected. ********************************/ %macro ranomv( k, /* the number of populatons beng compared */ n, /* the sample sze */ alpha, /* level of sgnfcance */ ds, /* the data set contanng the observatons */ varname, /* the varable name for the observatons */ classvar, /* the varable name for the populatons */ ns, /* the number of shufles */ tops); /* randanomv-r */ /*************************** Prnt Data et ***************************/ Fgure : Decson Chart One may also use the p-value method. The output n Table llustrates the dea. The key pont s that the HOV (homogenety of varance) hypothess s rejected whenever ether p-value s less than alpha/. nce PVALLOW (the lower p-value) s less than 0.05/ 0.05 the hypothess s rejected. Table : P-values Emprcal p-values should be compared to alpha/ OB PVALLOW PVALH %RANOMV OURCE CODE /* RANOMV A TET FOR THE EQUALTY OF K VARANCE BAED ON K NDEPENDENT AMPLE OF ZE N */ /******************************* NPUT DATA ********************************/ data data ; pops 7; samp 0; ns 000; do tool to pops; do j to samp; dam tool*rannor(-) + 00; do shuf to ns; shufno unform(-); output ; end; end; end; drop j ; data basedat; set data; f shuf > then delete; ttle 'basedat: orgnal data set'; proc prnt; var &classvar &varname; /******************************** DETERMNE RANOMV CRTCAL VALUE ********************************/ ttle 'ntal data set'; /* proc prnt data &ds;*/ data shufdat; set &ds; proc sort; by shuf shufno; ttle 'shuffled data'; /* proc prnt;*/ data shufdat; set shufdat; drop &classvar; ttle 'shuffled data wthout tool'; /*proc prnt;*/ data orgdat0; set data; proc sort; by shuf; ttle 'orgnal data wth dam'; /*proc prnt;*/ /******************************* DEFNE MACRO

4 data orgdat; set data; drop &varname; proc sort; by shuf; ttle 'orgnal data wthout dam'; /* proc prnt; */ ranks rmnrat; /* proc prnt data rkadmn; */ data shufdat3; merge shufdat orgdat; ttle 'merged data'; /* proc prnt;*/ proc means data shufdat3 noprnt; by shuf &classvar; var &varname ; output out stats var varx; ttle 'varance of each shuffled sample'; /*proc prnt data stats;*/ proc means datastats noprnt; by shuf; var varx; output out stats sum sumvarx; /*proc prnt data stats;*/ data vardat; merge stats stats; by shuf; varrat varx/sumvarx; ttle 'vardat: varances of shuffled samples along wth sums and ratos'; /* proc prnt data vardat; */ data crtlow; set rkadmn; ranklow &ns-floor((&ns+)*(- &alpha/)-)-; f rmnrat > ranklow then delete; f rmnrat < ranklow then delete; lowcrt mnrat; ttle 'crt low'; /*proc prnt data crtlow;*/ proc rank dataad outrkad; var rat ; ranks rrat; ttle 'rkad: ranked ad'; /*proc prnt data rkad; */ data crth; set rkad; rankh &nsfloor((&ns+)*(&alpha/)-); f rrat > rankh then delete; f rrat < rankh then delete; hcrt rat; ttle 'crth: crt hgh'; /*proc prnt;*/ data adwk; set vardat; proc means noprnt; by shuf; var varrat; output out ad rat; /* proc sort data ad ; by rat;*/ ttle 'ad: ad dstrbuton'; /* proc prnt data ad;*/ data admnwk; set vardat; proc means noprnt; by shuf; var varrat; output out admn mn mnrat; ttle 'admn: admn dstrbuton'; /* proc sort data admn; by mnrat; */ /*proc prnt data admn;*/ data crtdum; merge crth crtlow; codex ; ttle 'crtdum: crtcal values'; /*proc prnt;*/ data c;set crtdum;codex; data c3;set crtdum;codex3; data c4;set crtdum;codex4; data c5;set crtdum;codex5; data c6;set crtdum;codex6; data c7;set crtdum;codex7; data c8;set crtdum;codex8; data c9;set crtdum;codex9; data c0;set crtdum;codex0; data c;set crtdum;codex; data c;set crtdum;codex; data c3;set crtdum;codex3; data c4;set crtdum;codex4; data c5;set crtdum;codex5; data c6;set crtdum;codex6; data c7;set crtdum;codex7; data c8;set crtdum;codex8; data c9;set crtdum;codex9; data c0;set crtdum;codex0; proc rank dataadmn var mnrat; outrkadmn; data crtvals; set crtdum c c3 c4 c5 c6 c7 c8 c9

5 c0 c c c3 c4 c5 c6 c7 c8 c9 c0; f codex > &k then delete; ttle 'crtvals: crtcal values'; proc prnt datacrtvals; var rankh hcrt ranklow lowcrt ; /******************************** DETERMNE DECON LNE *********************************/ data basedat; set orgdat0; proc means data basedat noprnt; by shuf &classvar; var &varname ; output out stats4a var var0 std std0; ttle ' varances and standard devatons of orgnal data shuf replcated '; /*proc prnt data stats4a; */ proc means datastats4a noprnt; by shuf; var var0; output out stats5a sum sumvar0; /* proc prnt data stats5a; */ data vardat0; merge stats4a stats5a; by shuf; varrat0 var0/sumvar0; ttle 'varances of orgnal data shuf repl samples along wth sums and ratos'; /* proc prnt data vardat0;*/ data vardat0; set vardat0; f shuf > then delete; avgvar sumvar0/&k; ttle 'vardat0: varance data for ntal sample'; /* proc prnt data vardat0;*/ data vardat; merge vardat vardat0; by shuf &classvar; ttle 'varances of orgnal data + shuf data repl samples along wth sums and ratos'; /* proc prnt data vardat;*/ data admnwk0; set vardat; proc means noprnt; by shuf; var varrat0; output out admn0 mn mnrat0; data adwk0; set vardat; proc means noprnt; by shuf; var varrat0; output out ad0 rat0; data dldat; merge crtvals vardat0; UDLVAR sumvar0*hcrt; CLVAR avgvar; LDLVAR sumvar0*lowcrt; UDL sqrt(udlvar); CL sqrt(clvar); LDL sqrt(ldlvar); namet &classvar; ttle 'dldat: data to determne decson lnes'; /*proc prnt;*/ ttle "RANDANOMV decson table for equalty of &k varances"; proc prnt data dldat; var &classvar UDL CL LDL std0 ; /******************************** OUTPUT ANOMV DECON CHART *********************************/ proc gplot datadldat ; plot std0*&classvar4 ldl*&classvar cl*&classvar udl*&classvar3 /overlay haxsaxs /* annotatebars */ legend; symbol cblue,jon, l4, vnone; symbol cblue, jon, l, vnone; symbol3 cblue, jon, l vnone; symbol4 cblack, none, vstar; axs order( to &k by ) offset() label(h.5); ttle "RANDANOMV Decson Chart for &varname"; ttle "Alpha &alpha and &ns Permutaton huffles"; ttle3 "tandard Devaton Plotted"; /********************* Calculate p-values **********************/ data pvaldat; merge ad admn admn0 ad0; f rat > rat0 then sgh ; else sgh 0; f mnrat < mnrat0 then sglo ; else sglo 0; sg mn(sgh+sglo,); ttle 'pvalue data'; /*proc prnt datapvaldat; */ proc means data pvaldat noprnt; var sg; output out pvaldat mean emppval; /*ttle "p-value for test for equalty of &k varances"; ttle "&n observatons per group and &ns shuffles";*/ /*proc prnt data pvaldat; var emppval; */ proc means data pvaldat noprnt; var sgh; output out pvaldat mean pvalh; /*ttle "p-value for test for equalty of &k varances"; ttle "&n observatons per group and &ns shuffles";*/

6 /*proc prnt data pvaldat; var pvalh; */ proc means data pvaldat noprnt; var sglo; output out pvaldat3 mean pvallow; /*ttle "p-value for test for equalty of &k varances"; ttle "&n observatons per group and &ns shuffles";*/ /*proc prnt data pvaldat3; var pvallow;*/ data pvalout; merge pvaldat pvaldat3; ttle 'Emprcal p-values should should be compared to alpha/'; proc prnt datapvalout; var pvallow pvalh; %mend ranomv; %ranomv(k7,n0,alpha0.0,dsdata,varname dam,classvartool,ns000,tops); DOWNLONG A PROGRAM The source code can be downloaded from the Unversty of North Florda Center for Research and Consultng n tatstcs web page ( as techncal report # REFERENCE A. J. Bernard and P.. Wludyka, Robust -ample Analyss of Means Type Tests for Varances, Journal of tatstcal Computaton and mulaton, to appear. P.. Wludyka, Usng A to Perform the Analyss of Means for Varances Test, Conference Proceedngs outheast A Users Group, 999. P.. Wludyka and P. R. Nelson, An Analyss of Means Type Test for Varances from Normal Populatons, Technometrcs, 997. CONTACT NFORMATON Your comments and questons are valued and encouraged. Contact the author at: Peter Wludyka Unversty of North Florda Jacksonvlle, Florda Work Phone: Fax: Emal: pwludyka@unf.edu Web:

Statistics and Data Analysis. Paper

Statistics and Data Analysis. Paper Paper 264-27 Using SAS to Perform Robust I-Sample Analysis of Means Type Randomization Tests for Variances for Unbalanced Designs Peter Wludyka, University of North Florida, Jacksonville, FL Ping Sa, University

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

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

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

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

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

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

C2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis

C2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis C2 Tranng: June 8 9, 2010 Introducton to meta-analyss The Campbell Collaboraton www.campbellcollaboraton.org Combnng effect szes across studes Compute effect szes wthn each study Create a set of ndependent

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

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

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

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

Machine Learning. Topic 6: Clustering

Machine Learning. Topic 6: Clustering Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess

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

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

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

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

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

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

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Pass by Reference vs. Pass by Value

Pass by Reference vs. Pass by Value Pass by Reference vs. Pass by Value Most methods are passed arguments when they are called. An argument may be a constant or a varable. For example, n the expresson Math.sqrt(33) the constant 33 s passed

More information

Why visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information

Why visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information Why vsualsaton? IRDS: Vsualzaton Charles Sutton Unversty of Ednburgh Goal : Have a data set that I want to understand. Ths s called exploratory data analyss. Today s lecture. Goal II: Want to dsplay data

More information

A Statistical Model Selection Strategy Applied to Neural Networks

A Statistical Model Selection Strategy Applied to Neural Networks A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos

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

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

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

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Hierarchical agglomerative. Cluster Analysis. Christine Siedle Clustering 1

Hierarchical agglomerative. Cluster Analysis. Christine Siedle Clustering 1 Herarchcal agglomeratve Cluster Analyss Chrstne Sedle 19-3-2004 Clusterng 1 Classfcaton Basc (unconscous & conscous) human strategy to reduce complexty Always based Cluster analyss to fnd or confrm types

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

Random Variables and Probability Distributions

Random Variables and Probability Distributions Random Varables and Probablty Dstrbutons Some Prelmnary Informaton Scales on Measurement IE231 - Lecture Notes 5 Mar 14, 2017 Nomnal scale: These are categorcal values that has no relatonshp of order or

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

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

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

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

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

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6) Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

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

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

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

Estimating Regression Coefficients using Weighted Bootstrap with Probability

Estimating Regression Coefficients using Weighted Bootstrap with Probability Norazan M R, Habshah Md, A H M R Imon Estmatng Regresson Coeffcents usng Weghted Bootstrap wth Probablty NORAZAN M R, HABSHAH MIDI AND A H M R IMON Faculty of Computer and Mathematcal Scences, Unversty

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

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

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

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

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

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

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

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

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered

More information

5.0 Quality Assurance

5.0 Quality Assurance 5.0 Dr. Fred Omega Garces Analytcal Chemstry 25 Natural Scence, Mramar College Bascs of s what we do to get the rght answer for our purpose QA s planned and refers to planned and systematc producton processes

More information

The calculation of real-time PCR ratios by means of Monte Carlo Simulation or high-order Taylor expansion

The calculation of real-time PCR ratios by means of Monte Carlo Simulation or high-order Taylor expansion The calculaton o real-tme PCR ratos by means o Monte Carlo Smulaton or hgh-order Taylor expanson Andrej-Nkola Spess Department o Andrology, Unversty Hosptal Hamburg-Eppendor Do we need error propagaton

More information

A fault tree analysis strategy using binary decision diagrams

A fault tree analysis strategy using binary decision diagrams Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Brave New World Pseudocode Reference

Brave New World Pseudocode Reference Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be

More information

NGPM -- A NSGA-II Program in Matlab

NGPM -- A NSGA-II Program in Matlab Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...

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

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information

Lecture 5: Probability Distributions. Random Variables

Lecture 5: Probability Distributions. Random Variables Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Insertion Sort. Divide and Conquer Sorting. Divide and Conquer. Mergesort. Mergesort Example. Auxiliary Array

Insertion Sort. Divide and Conquer Sorting. Divide and Conquer. Mergesort. Mergesort Example. Auxiliary Array Inserton Sort Dvde and Conquer Sortng CSE 6 Data Structures Lecture 18 What f frst k elements of array are already sorted? 4, 7, 1, 5, 1, 16 We can shft the tal of the sorted elements lst down and then

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

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

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

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

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

CSE 326: Data Structures Quicksort Comparison Sorting Bound

CSE 326: Data Structures Quicksort Comparison Sorting Bound CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the

More information

Cell Count Method on a Network with SANET

Cell Count Method on a Network with SANET CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan

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

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

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

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

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

A Multivariate Analysis of Static Code Attributes for Defect Prediction

A Multivariate Analysis of Static Code Attributes for Defect Prediction Research Paper) A Multvarate Analyss of Statc Code Attrbutes for Defect Predcton Burak Turhan, Ayşe Bener Department of Computer Engneerng, Bogazc Unversty 3434, Bebek, Istanbul, Turkey {turhanb, bener}@boun.edu.tr

More information

CSE 326: Data Structures Quicksort Comparison Sorting Bound

CSE 326: Data Structures Quicksort Comparison Sorting Bound CSE 326: Data Structures Qucksort Comparson Sortng Bound Bran Curless Sprng 2008 Announcements (5/14/08) Homework due at begnnng of class on Frday. Secton tomorrow: Graded homeworks returned More dscusson

More information

Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization

Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization Problem efntons and Evaluaton Crtera for the CEC 2005 Specal Sesson on Real-Parameter Optmzaton P. N. Suganthan, N. Hansen 2, J. J. Lang, K. eb 3, Y. -P. Chen 4, A. Auger 2, S. Twar 3 School of EEE, Nanyang

More information

Intro. Iterators. 1. Access

Intro. Iterators. 1. Access Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE

More information

TESTING AND IMPROVING LOCAL ADAPTIVE IMPORTANCE SAMPLING IN LJF LOCAL-JT IN MULTIPLY SECTIONED BAYESIAN NETWORKS

TESTING AND IMPROVING LOCAL ADAPTIVE IMPORTANCE SAMPLING IN LJF LOCAL-JT IN MULTIPLY SECTIONED BAYESIAN NETWORKS TESTING AND IMPROVING LOCAL ADAPTIVE IMPORTANCE SAMPLING IN LJF LOCAL-JT IN MULTIPLY SECTIONED BAYESIAN NETWORKS Dan Wu 1 and Sona Bhatt 2 1 School of Computer Scence Unversty of Wndsor, Wndsor, Ontaro

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

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS Davd Belton Cooperatve Research Centre for Spatal Informaton (CRC-SI) The Insttute for

More information

A Bootstrap Approach to Robust Regression

A Bootstrap Approach to Robust Regression Internatonal Journal of Appled Scence and Technology Vol. No. 9; November A Bootstrap Approach to Robust Regresson Dr. Hamadu Dallah Department of Actuaral Scence and Insurance Unversty of Lagos Akoka,

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

Distribution Analysis

Distribution Analysis Chapter II Dstrbuton Analyss D... (Absolute and Relatve Frequences) Let X be a characterstc possessng the attrbutesa, =,,..., k. The absolute frequency of the attrbutea, =,,..., k s defned as follows:

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

Statistics and Data Analysis. Use of the ROC Curve and the Bootstrap in Comparing Weighted Logistic Regression Models

Statistics and Data Analysis. Use of the ROC Curve and the Bootstrap in Comparing Weighted Logistic Regression Models Paper 248-27 Use of the ROC Curve and the Bootstrap n Comparng Weghted Logstc Regresson Models Davd Izrael, Annabella A. Battagla, Davd C. Hoagln, and Mchael P. Battagla, Abt Assocates Inc., Cambrdge,

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

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

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

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

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information