Comparison of the Efficiency of the Various Algorithms in Stratified Sampling when the Initial Solutions are Determined with Geometric Method
|
|
- Raymond Brown
- 5 years ago
- Views:
Transcription
1 International Journal of Statistics and Applications 0, (): -0 DOI: 0.9/j.statistics Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined wit Geometric Metod Şebnem Er Quantitative Metods Department, Istanbul University, Istanbul, 0, Turkey Abstract Te main aim of tis paper is to examine te efficiency of Genetic Algoritm (GA) of Keskintürk and Er (007)[], Kozak s (00) Random Searc[] and Lavallée and Hidiroglou s (9) Iterative Algoritm metod[] on determination of te stratum boundaries tat minimize te variance of te estimate. Initial starting boundaries of te mentioned algoritms are obtained randomly. Here, it is aimed to reac better results in a sorter period of time by utilizing te initial boundaries obtained from Gunning and Horgan s (00) geometric metod[] compared to te random initial boundaries. Tree algoritms are applied on various populations wit bot random and geometric initial boundaries and teir performances are compared. Wit te stratification of eterogenous populations tat ave different properties, iger variance of te estimates or infeasible solutions can be observed once te initial boundaries are obtained wit geometric metod. Keywords Stratified sampling, Stratum boundaries, Genetic algoritm, Random searc, Iterative metod. Introduction In stratified sampling,in order to gain more precision tan oter metods of sampling, a eterogeneous population is divided into subpopulations, eac of wic is internally omogeneous. As a result te main problem arising in stratified sampling is to obtain te optimum boundaries. Several numerical and computational metods ave been developed for tis purpose. Some apply to igly skewed populations and some apply to any kind of populations. An early and very simple metod is te cumulative square root of te frequency metod (cum f) of Dalenius & Hodges in 99[]. More recently Lavallée & Hidiroglou algoritm[] and Gunning & Horgan's (00) geometric metod[] ave been proposed for igly skewed populations wereas Kozak's (00) random searc metod[] and Keskinturk & Er's (007) genetic algoritm (GA) metod[] ave been proposed for even non-skewed populations. Very recently, Brito et.all[] proposed an exact algoritm for te stratification problem wit only proportional allocation based on te concept of minimum pat in graps and tey called teir metod StratPat. Moreover, developed an iterated local searc metod to solve te stratification problem of variables wit any distribution wit eyman allocation[7].all * Corresponding autor: er.sebnem@gmail.com (Şebnem Er) Publised online at ttp://journal.sapub.org/statistics Copyrigt 0 Scientific & Academic Publising. All Rigts Reserved tese metods aim to acieve te optimum boundaries tat maximise te level of precision or equivalently minimise te variance of te estimate or te sample size required to reac a level of precision and some of tem are available in te stratification package stratification for use wit te statistical programming environment R[]; freely available on te Compreensive R Arcive etwork (CRA) at ttp://cra.r-project.org/package=stratification. Te main aim of tis researc is to compare te efficiency ratios of te Lavallée ve Hidiroglou iterative metod, Kozak s random searc metod and Keskinturk and Er s genetic algoritm approac wen te initial boundaries are obtained eiter randomly or from te geometric metod of Gunning and Horgan, and to examine te performances of te tree metods. Te predetermined total sample size (n) is allocated using eyman[9] optimum allocation metod. Te paper is structured as follows: In te second section te exact solution of Dalenius[0] and te metods tat are developed in order to approximately solve te Dalenius equations are briefly explained. In te tird section, te results obtained wit Lavallée and Hidiroglou s iterative metod, Kozak s random searc metod and Keskintürk and Er s genetic algoritm are given wen te initial boundaries are obtained randomly or from te geometric metod of Gunning and Horgan and te performance of te algoritms are compared.. Dalenius (90) Exact Solution
2 Şebnem Er: Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined wit Geometric Metod Dalenius (90)[0] considers a density f ( x ) wit mean + µ = tf t dt () Te range (X max -X min ) of te stratification variable x is divided into L parts at points b <b <...<b L-, eac part corresponding to a stratum. Wen a sample of n= n observations is selected from f ( x ), te true mean L µ = W µ () = is estimated by Cocran as [] x L st = W µ () = were for te t stratum W, as follows[]: b ( ) µ, xst and are calculated W = f () t dt = () b x i i µ = n x i i x n = xst as a variance of = () =. () Te estimate of te mean σ n σ (7) L ( x ) st = W = n were te true variance is ( ) x i i µ = σ =. () If te sampling fractions n are negligible ten te variance could be written in sort, L σ σ ( x ) st = W (9) n = It is well-known tat tis variance of te estimate is minimum σ min L = ( x ) st = W n σ (0) wen total sample size n is allocated using eyman s optimum allocation metod [9]: σ =. () n n L σ = Terefore te variance of te estimate is a function of te boundaries b. As a result, it is very difficult to find te boundaries tat minimise te variance of te estimate. Dalenius (90)[0] as sown tat te variance of te estimate obtained wit eyman s optimum allocation metod is optimum or in oter words minimum, wen te stratum boundaries satisfy te following equations: σ + ( b µ ) σ + + ( b µ + ) = () σ σ+ It is very difficult to find te stratum boundaries b tat satisfy tese equations remembered as Dalenius equations since tese equations include σ and µ tat bot vary wit b stratum boundaries. As a result, tere ave been many approximations and algoritms proposed for solving Dalenius equations. Te widely known simple metod among te proposals is te cumulative square root frequency metod of Dalenius and Hodges (99) ( cum f ) []. Ten, in 9 Lavallée and Hidiroglou s iterative approac[], in 00 Gunning and Horgan s geometric metod [] and Kozak s random searc metod[], in 007 Keskintürk and Er s genetic algoritm metod[] are developed in order to find te stratum boundaries. Among tese metods, geometric metod is te simplest metod tat does not include any complex algoritms. Terefore, te main aim of tis researc paper is to set te initial boundaries of te proposed algoritms wit geometric metod and compare te efficiencies of te algoritms wen te boundaries are obtained wit or witout geometric metod since it is believed tat tese algoritms would reac te solution in a sorter period once tey start searcing te entire space at a reasonable point. Te details of te approaces and algoritms of tese metods could be obtained from te original papers of Dalenius and Hodges (99)[], Gunning and Horgan (00)[], Kozak (00)[] and Keskintürk and Er s (007)[]. All of tese metods could be applied in R statistical environment using stratification[] and GAstratification[] packages but te GA results given in tis studyare obtained in Matlab 7.0 since in te package tere is no option for setting te initial boundaries wit non-random results.. Application.. Populations for Stratification In tis paper, many populations are used for stratification wit different skewness, kurtosis, mean, standard deviation and size properties.tose populations tat are available in te R stratification[] and GAStratification[] packages are used for stratification. Eac of te populations are divided into,, and strata and te boundaries are obtained using Lavallée and Hidiroglou, Kozak and GA metods wit random and geometric initial boundaries. Pop: An accounting population of debtors in an Iris firm (Debtors). Pop: Te population in tousands of US cities in 90 (UScities). Pop: Te number of students in four-year US colleges in 9-9 (UScolleges). Pop: Te resources in millions of dollars of large commercial US banks (USbanks). Pop: umber of municipal employees of municipalities in Sweden in 9 (ME). Pop: Population in tousands of municipalities in Sweden in 97 (P7). Pop7: Real estate values in millions of kronor according to 9 assessment of municipalities in Sweden in 9 (REV) Pop: Simulated Data from te Montly Retail Trade
3 International Journal of Statistics and Applications 0, (): -0 Survey of Statistics Canada (MRTS) Pop9: Houseold income before taxes from te 00 Survey of Houseold Spending carried out by Statistics Canada (HHICTOT) Pop0: et sales data of 7 Turkis manufacturing firms among te largest 00 firms in 00 by Istanbul Camber of Industry (ICI) (iso00) Pop: et sales data of Turkis manufacturing firms among te largest 00 firms in 00 by Istanbul Camber of Industry (ICI) (iso00) Te boxplots of te populations are displayed between Figures and, and te summary statistics of te populations are given in Table. Referring te descriptive statistics in Table and boxplots in Figures -, we see tat te populations to be stratified are igly eterogenous wic makes stratified sampling efficient to use. For comparison, te initial boundaries are obtained wit bot random initial boundaries and wit geometric metod. Te populations are divided into,, and strata and te total sample size is determined as 00 for Pop-Pop. For genetic algoritm, te number of iterations is set to 0000, te GA population size to, te crossover rate to 0.99 and te mutation rate to 0.. For efficiency (efficiency eff) comparisons of te ratio of variance of te estimates or te ratios of squares of coefficient of variations (CV) are calculated and given in Appendix. Since Lavallée and Hidiroglou s (LH) metod is based on sampling all of te elements in te last stratum (take-all top stratum), te following efficiency ratios are calculated if GA and Kozak s metods provide a take-all top stratum solution: σ GA ( xst ) ( CVGA µ xst ) CV GA effga / Kozak = = = () σ x st CV µ CV Kozak ( ) ( st ) Kozak Kozak x CV GA effga / LH CV LH CV Kozak effkozak/ LH CV LH = () = () For tose situtations were some of te last stratum is sampled, only te efficiency ratio between GA and Kozak s metod ( eff GA/ Kozak ) is calculated. From te efficiency and te coefficient of variation ratios given in Table in Appendix and from te strata and sample sizes given in Table in Appendix, it can be seen tat te algoritms compared in tis paper provide very close results and tat te stratum boundaries are very close to eac oter wen te initial boundaries are set randomly.wen we look at te summary of te results given in Table, we see tat te number of cases were GA or Kozak is better tan te oter one does not differ muc and te gains in efficiencies are close to eac oter. Table. umber of Cases were te Cosen Algoritm Gives Better Results and te Range of te Efficiency Gain (Random Initials) H Better results wit GA Better Results wit Kozak Bot Same Total ( 0.-0.) none 7 ( 0.-7.) (.) ( 0.-%) (.-%7) ( 0.-%) ( 7.-%7) none On te oter and, te results are different wit iger coefficient of variations wen te initial boundaries are obtained wit geometric metod (Table ).Moreover, wen te initial boundaries are set to be found wit geometric metod, many infeasible or nonconverged results are obtained. For example, wen we look at Table were te initial boundaries are obtained wit geometric metod, we see tat te coefficient of variations for GA increases in cases among cases. Yet some of tese increases in te CVs result from a nonconverged or an infeasible solution. Only in cases tere is a gain in efficiency ranging in between 0.0 (CV falling from 0.07 to 0.0 for H= for Pop-UScolleges) and %0. (falling from 0.0 to for H= for Pop-MRTS), wic could be counted as a very minor gain. Te results for L&H and Kozak s are more or less te same wit te results obtained for GA. Wen te initial boundaries are obtained wit geometric metod, wit eac of Kozak s and L&H s metods tere is an efficiency gain in only cases, wic are again minor. For tese reasons, Lavallée and Hidiroglou s iterative metod, Kozak s random searc metod and Keskintürk and Er s genetic algoritms give more efficient results wen te initial boundaries are set randomly due to teir nature. As a result, it can be concluded tat starting wit geometric initial boundaries does not ave muc contribution on te efficiency ratios or on te stratum boundaries for te computational metods. As proposed by Horgan (0) [], in order to obtain feasible solutions in some data sets,some modifications sould be applied before utilising te geometric metod. Horgan (0) [] suggests tat te data sould be analysed before applying te stratified sampling sceme if tere are extreme outliers. In tis paper te revitised version of te geometric metod is not applied since te algoritms examined ere already give good results wit random initials. Furtermore, if any researcer wants to use te geometric initial boundaries for data sets wit extreme outliers, modified version of te geometric metod sould be used.
4 Şebnem Er: Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined wit Geometric Metod Figure. Boxplots of Pop-Pop Figure. Boxplots of Pop-Pop9 Figure. Boxplots of Pop0-Pop
5 International Journal of Statistics and Applications 0, (): -0 Table. Summary Statistics of te Populations Pop ame Range Skewness Kurtosis Mean StdDev. Pop Debtors Pop Uscities Pop UScolleges Pop USbanks Pop ME Pop P Pop 7 REV Pop MRTS Pop 9 HHICTOT i Pop 0 iso Pop iso Conclusions Stratified sampling is a sampling metodology used for eterogeneous populations in order to gain more precision tan oter metods of sampling. Tis paper examines te improvement in te efficiency ratios and stratum boundaries obtained wit Lavallée and Hidiroglou [], Kozak [] and Keskintürk and Er s (007) [] metods once te initial boundaries are obtained wit geometric metod. Wit te stratification of eterogenous populations tat ave different properties, iger variance of te estimates or infeasible solutions can be observed. As a result, researcers sould be muc more rigorous wen using geometric metod for te initial boundaries in algoritmic metods or else use te modified version of geometric metod once te data as very extreme values. ACKOWLEDGEMETS I would like to tank te reviewer of tis article wose comments and suggestions ave elped improve te paper. REFERECES [] Keskintürk, T., Er, Ş., A Genetic Algoritm Approac to Determine Stratum Boundaries and Sample Sizes of Eac Stratum in Stratified Sampling. Computational Statistics & Data Analysis,,, pp.-7, 007. [] Kozak, M., Optimal Stratification Using Random Searc Metod in Agricultural Surveys. Statistics in Transition,,, pp.797-0, 00. [] Gunning, P., Horgan, J.M., A ew Algoritm for te Construction of Stratum Boundaries in Skewed Populations. Survey Metodology, 0,, 00. [] Dalenius, Tore, Hodges, Josep L.Jr., Minimum Variance Stratification, Journal of te American Statistical Association, (), pp.-0, 99. [] Brito, J., Maculan,. Lila, M., Montenegro, F. An Exact Algoritm for te Stratication Problem wit Proportional Allocation. Optimization Letters,,, pp.-9, 00. [7] Brito, J., Oci, L., Montenegro, F., Maculan,. An Iterative Local Searc Approac Applied to te Optimal StratificationProblem. International Transactions in Operational Researc. 7,, pp.7-7, 00. [] R Development Core Team. R: A language and Environment for Statistical Computing, R Foundation for Statistical Computing, Vienna, Austria, (URL) ttp:// 00. [9] eyman, Jerzy. On te Two Different Aspects of te Representative Metod: Te Metod of Stratified Sampling and te Metod of Purposive Selection, Journal of te Royal Statistical Society, 97 (), pp.-, 9. [0] Dalenius, T. Te problem of optimum stratification, Skandinavisk Aktuarietidskrift, pp. 0-, 90. [] Cocran, W. G., Sampling Tecniques, rd ed., Jon Wiley & Sons, Inc. USA., 977. [] R: stratification. ttp://cra.r-project.org/package=stratification [] R: GAStratification.ttp://CRA.R-project.org/package=G Astratification [] Horgan, J.M., Geometric Stratification Revitised. ISI World Congress 0 Proceedings, 0. [] Lavallée, P., Hidiroglou, M., On te Stratication of Skewed Populations, Survey Metodology,,, pp.-, 9.
6 Şebnem Er: Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined wit Geometric Metod APPEDIX Table. Te efficiency and coefficient of variation ratios of LH, GA and Kozak s metods wen te initial boundaries are obtained randomly H CVLH CVGA CVKozak effga/kozak effga/lh effkozak/lh Pop: Debtors 0.090* * * * Pop: Uscities 0.07* * * * n= Pop: Uscolleges 0.00* * * * Pop: USbanks 0.09* * 0.070* 0.070* * 0.00* 0.00* * * 0.007* Pop: ME 0.09* 0.09* 0.09* * * * * 0.00* 0.00* * * 0.00* Pop: P7 0.0* 0.09* 0.09* * 0.009* 0.009* * 0.00* 0.007* * 0.00* 0.00* Pop7: REV 0.0* 0.007* 0.007* * 0.00* 0.00* * 0.00* 0.007* * 0.00* 0.007* Pop: MRTS 0.09* * * * 0.0* 0.0* Pop9: HHICTOT 0.00* * * * Pop0: iso * 0.09* 0.09* * 0.00* 0.00* * * 0.009* * * 0.00* Pop: iso00 0.0* 0.0* 0.0* * 0.0* 0.0* * * * * * 0.000* * Were tere is a take-all top stratum
7 International Journal of Statistics and Applications 0, (): -0 7 Table. Te coefficient of variation ratios of LH, GA and Kozak s metods wen te initial boundaries are obtained wit geometric metod H CVLH CVGA CVKozak Pop: Debtors Same Same Same Same Same Same Same Same Pop: UScities Same Same Same (n=00) Same Pop: UScolleges Same Same Same Same Same Same Pop: USbanks Same Same Same Same Same Pop: ME C. Same Same C C I.F C C.I.F C I.F. Pop: P C Same C I.F C., I.F I.F I.F. Pop7: REV Same C C., I.F I.F C., I.F Pop: MRTS Same Same Same Same Same Same Same Same Same Pop9: HHICTOT Same Same Same Same Same Same Same Same Pop0: iso C. Same Same C,.I.F I.F C., I.F I.F I.F C., I.F I.F Pop: iso Same Same C., I.F I.F I.F C., I.F I.F I.F C., I.F. OE I.F. : Infeasible;.C. : Algoritm did not converge; - : a decrease in CV; + : an increase in CV.
8 Şebnem Er: Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined wit Geometric Metod APPEDIX Table. Size of te strata () and te sample sizes (n) obtained fromlh, GA and Kozak s metods wen te initial boundaries are obtained randomly H LH GA Kozak Pop: Debtors n n n n Pop: Uscities n n n n Pop: UScolleges n n n n Pop: USbanks 0 n n n n Pop: ME n n n n Pop: P n n n n
9 International Journal of Statistics and Applications 0, (): -0 9 Table. Continues: Size of te strata () and te sample sizes (n) obtained fromlh, GA and Kozak s metods wen te initial boundaries are obtained randomly H LH GA Kozak Pop7: REV 9 n n n n Pop: MRTS n n n n Pop9: HHICTOT n n n n Pop0: iso n n n n Pop: iso n n
10 0 Şebnem Er: Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined wit Geometric Metod n n i Observations wit values of zero are excluded from te data since geometric metod could not be applied wit dataset including zeros as a minimum value.
Computational methods for optimum stratification: A review
Int Statistical Inst: Proc 58th World Statistical Congress, 2011, Dublin (Session STS058) p3304 Computational methods for optimum stratification: A review Er, Sebnem Istanbul University, Quantitative Methods
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More informationOur Calibrated Model has No Predictive Value: An Example from the Petroleum Industry
Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationComputing Optimal Strata Bounds Using Dynamic Programming
Computing Optimal Strata Bounds Using Dynamic Programming Eric Miller Summit Consulting, LLC 7/27/2012 1 / 19 Motivation Sampling can be costly. Sample size is often chosen so that point estimates achieve
More informationBounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More informationSTRATIFICATION IN BUSINESS AND AGRICULTURE SURVEYS WITH
4 Th International Conference New Challenges for Statistical Software - The Use of R in Official Statistics Bucharest, 7-8 April 2016 STRATIFICATION IN BUSINESS AND AGRICULTURE SURVEYS WITH Marco Ballin
More informationMinimizing Memory Access By Improving Register Usage Through High-level Transformations
Minimizing Memory Access By Improving Register Usage Troug Hig-level Transformations San Li Scool of Computer Engineering anyang Tecnological University anyang Avenue, SIGAPORE 639798 Email: p144102711@ntu.edu.sg
More information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More informationThe Euler and trapezoidal stencils to solve d d x y x = f x, y x
restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More informationDesign of PSO-based Fuzzy Classification Systems
Tamkang Journal of Science and Engineering, Vol. 9, No 1, pp. 6370 (006) 63 Design of PSO-based Fuzzy Classification Systems Cia-Cong Cen Department of Electronics Engineering, Wufeng Institute of Tecnology,
More informationMulti-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art
Multi-Objective Particle Swarm Optimizers: A Survey of te State-of-te-Art Margarita Reyes-Sierra and Carlos A. Coello Coello CINVESTAV-IPN (Evolutionary Computation Group) Electrical Engineering Department,
More informationarxiv: v1 [cs.lg] 18 Feb 2009
An Exact Algorithm for the Stratification Problem with Proportional Allocation José Brito arxiv:0902.3223v1 [cs.lg] 18 Feb 2009 IBGE, Instituto Brasileiro de Geografia e Estatística.Comeq, 20031-170, Rio
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More informationA Cost Model for Distributed Shared Memory. Using Competitive Update. Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science
A Cost Model for Distributed Sared Memory Using Competitive Update Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, Texas, 77843-3112, USA E-mail: fjkim,vaidyag@cs.tamu.edu
More informationUnsupervised Learning for Hierarchical Clustering Using Statistical Information
Unsupervised Learning for Hierarcical Clustering Using Statistical Information Masaru Okamoto, Nan Bu, and Tosio Tsuji Department of Artificial Complex System Engineering Hirosima University Kagamiyama
More informationAn Evaluation of Alternative Continuous Media Replication Techniques in Wireless Peer-to-Peer Networks
An Evaluation of Alternative Continuous Media eplication Tecniques in Wireless Peer-to-Peer Networks Saram Gandearizade and Tooraj Helmi Department of Computer Science University of Soutern California
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More informationNetwork Coding to Enhance Standard Routing Protocols in Wireless Mesh Networks
Downloaded from vbn.aau.dk on: April 7, 09 Aalborg Universitet etwork Coding to Enance Standard Routing Protocols in Wireless Mes etworks Palevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank;
More informationAn Effective Sensor Deployment Strategy by Linear Density Control in Wireless Sensor Networks Chiming Huang and Rei-Heng Cheng
An ffective Sensor Deployment Strategy by Linear Density Control in Wireless Sensor Networks Ciming Huang and ei-heng Ceng 5 De c e mbe r0 International Journal of Advanced Information Tecnologies (IJAIT),
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More informationCHAPTER The elevation can be determined as. The partial derivatives can be evaluated,
1 CHAPTER 14 14.1 Te elevation can be determined as (.8,1. (.81. 1.5(1. 1.5(.8 Te partial derivatives can be evaluated,.5 (1..5(.8.4 1.5 4 (.8 1.5 4(1. 1.7 (1. 5 5.4 wic can be used to determine te gradient
More informationNotes: Dimensional Analysis / Conversions
Wat is a unit system? A unit system is a metod of taking a measurement. Simple as tat. We ave units for distance, time, temperature, pressure, energy, mass, and many more. Wy is it important to ave a standard?
More information12.2 TECHNIQUES FOR EVALUATING LIMITS
Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of
More informationEconomic design of x control charts considering process shift distributions
J Ind Eng Int (2014) 10:163 171 DOI 10.1007/s40092-014-0086-2 ORIGINAL RESEARCH Economic design of x control carts considering process sift distributions Vijayababu Vommi Rukmini V. Kasarapu Received:
More informationCS 234. Module 6. October 25, CS 234 Module 6 ADT Dictionary 1 / 22
CS 234 Module 6 October 25, 2016 CS 234 Module 6 ADT Dictionary 1 / 22 Case study Problem: Find a way to store student records for a course, wit unique IDs for eac student, were records can be accessed,
More informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Fall
Has-Based Indexes Capter 11 Comp 521 Files and Databases Fall 2012 1 Introduction Hasing maps a searc key directly to te pid of te containing page/page-overflow cain Doesn t require intermediate page fetces
More informationCommunicator for Mac Quick Start Guide
Communicator for Mac Quick Start Guide 503-968-8908 sterling.net training@sterling.net Pone Support 503.968.8908, option 2 pone-support@sterling.net For te most effective support, please provide your main
More informationOptimal In-Network Packet Aggregation Policy for Maximum Information Freshness
1 Optimal In-etwork Packet Aggregation Policy for Maimum Information Fresness Alper Sinan Akyurek, Tajana Simunic Rosing Electrical and Computer Engineering, University of California, San Diego aakyurek@ucsd.edu,
More informationTuning MAX MIN Ant System with off-line and on-line methods
Université Libre de Bruxelles Institut de Recerces Interdisciplinaires et de Développements en Intelligence Artificielle Tuning MAX MIN Ant System wit off-line and on-line metods Paola Pellegrini, Tomas
More informationDensity Estimation Over Data Stream
Density Estimation Over Data Stream Aoying Zou Dept. of Computer Science, Fudan University 22 Handan Rd. Sangai, 2433, P.R. Cina ayzou@fudan.edu.cn Ziyuan Cai Dept. of Computer Science, Fudan University
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More informationTwo Modifications of Weight Calculation of the Non-Local Means Denoising Method
Engineering, 2013, 5, 522-526 ttp://dx.doi.org/10.4236/eng.2013.510b107 Publised Online October 2013 (ttp://www.scirp.org/journal/eng) Two Modifications of Weigt Calculation of te Non-Local Means Denoising
More informationCS 234. Module 6. October 16, CS 234 Module 6 ADT Dictionary 1 / 33
CS 234 Module 6 October 16, 2018 CS 234 Module 6 ADT Dictionary 1 / 33 Idea for an ADT Te ADT Dictionary stores pairs (key, element), were keys are distinct and elements can be any data. Notes: Tis is
More informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Spring
Has-Based Indexes Capter 11 Comp 521 Files and Databases Spring 2010 1 Introduction As for any index, 3 alternatives for data entries k*: Data record wit key value k
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More information12.2 Techniques for Evaluating Limits
335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
More informationSymmetric Tree Replication Protocol for Efficient Distributed Storage System*
ymmetric Tree Replication Protocol for Efficient Distributed torage ystem* ung Cune Coi 1, Hee Yong Youn 1, and Joong up Coi 2 1 cool of Information and Communications Engineering ungkyunkwan University
More information, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result
RT. Complex Fractions Wen working wit algebraic expressions, sometimes we come across needing to simplify expressions like tese: xx 9 xx +, xx + xx + xx, yy xx + xx + +, aa Simplifying Complex Fractions
More informationCHAPTER 7: TRANSCENDENTAL FUNCTIONS
7.0 Introduction and One to one Functions Contemporary Calculus 1 CHAPTER 7: TRANSCENDENTAL FUNCTIONS Introduction In te previous capters we saw ow to calculate and use te derivatives and integrals of
More informationExcel based finite difference modeling of ground water flow
Journal of Himalaan Eart Sciences 39(006) 49-53 Ecel based finite difference modeling of ground water flow M. Gulraiz Akter 1, Zulfiqar Amad 1 and Kalid Amin Kan 1 Department of Eart Sciences, Quaid-i-Azam
More informationThe impact of simplified UNBab mapping function on GPS tropospheric delay
Te impact of simplified UNBab mapping function on GPS troposperic delay Hamza Sakidin, Tay Coo Cuan, and Asmala Amad Citation: AIP Conference Proceedings 1621, 363 (2014); doi: 10.1063/1.4898493 View online:
More informationAn Overview of New Features in
6. LS-DYNA Anwenderforum, Frankental 2007 Optimierung An Overview of New Features in LS-OPT Version 3.3 Nielen Stander*, Tusar Goel*, David Björkevik** *Livermore Software Tecnology Corporation, Livermore,
More informationAsynchronous Power Flow on Graphic Processing Units
1 Asyncronous Power Flow on Grapic Processing Units Manuel Marin, Student Member, IEEE, David Defour, and Federico Milano, Senior Member, IEEE Abstract Asyncronous iterations can be used to implement fixed-point
More informationClassification of Osteoporosis using Fractal Texture Features
Classification of Osteoporosis using Fractal Texture Features V.Srikant, C.Dines Kumar and A.Tobin Department of Electronics and Communication Engineering Panimalar Engineering College Cennai, Tamil Nadu,
More informationAn Algorithm for Loopless Deflection in Photonic Packet-Switched Networks
An Algoritm for Loopless Deflection in Potonic Packet-Switced Networks Jason P. Jue Center for Advanced Telecommunications Systems and Services Te University of Texas at Dallas Ricardson, TX 75083-0688
More informationSection 1.2 The Slope of a Tangent
Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt
More informationVector Processing Contours
Vector Processing Contours Andrey Kirsanov Department of Automation and Control Processes MAMI Moscow State Tecnical University Moscow, Russia AndKirsanov@yandex.ru A.Vavilin and K-H. Jo Department of
More informationAlternating Direction Implicit Methods for FDTD Using the Dey-Mittra Embedded Boundary Method
Te Open Plasma Pysics Journal, 2010, 3, 29-35 29 Open Access Alternating Direction Implicit Metods for FDTD Using te Dey-Mittra Embedded Boundary Metod T.M. Austin *, J.R. Cary, D.N. Smite C. Nieter Tec-X
More informationIntra- and Inter-Session Network Coding in Wireless Networks
Intra- and Inter-Session Network Coding in Wireless Networks Hulya Seferoglu, Member, IEEE, Atina Markopoulou, Member, IEEE, K K Ramakrisnan, Fellow, IEEE arxiv:857v [csni] 3 Feb Abstract In tis paper,
More informationAn Interactive X-Ray Image Segmentation Technique for Bone Extraction
An Interactive X-Ray Image Segmentation Tecnique for Bone Extraction Cristina Stolojescu-Crisan and Stefan Holban Politenica University of Timisoara V. Parvan 2, 300223 Timisoara, Romania {cristina.stolojescu@etc.upt.ro
More informationCoarticulation: An Approach for Generating Concurrent Plans in Markov Decision Processes
Coarticulation: An Approac for Generating Concurrent Plans in Markov Decision Processes Kasayar Roanimanes kas@cs.umass.edu Sridar Maadevan maadeva@cs.umass.edu Department of Computer Science, University
More informationSearch-aware Conditions for Probably Approximately Correct Heuristic Search
Searc-aware Conditions for Probably Approximately Correct Heuristic Searc Roni Stern Ariel Felner Information Systems Engineering Ben Gurion University Beer-Seva, Israel 85104 roni.stern@gmail.com, felner@bgu.ac.il
More informationLecture 7. Binary Search Trees / AVL Trees
Lecture 7. Binary Searc Trees / AVL Trees T. H. Cormen, C. E. Leiserson and R. L. Rivest Introduction to Algoritms, 3rd Edition, MIT Press, 2009 Sungkyunkwan University Hyunseung Coo coo@skku.edu Copyrigt
More informationDeveloping an Efficient Algorithm for Image Fusion Using Dual Tree- Complex Wavelet Transform
ISSN(Online): 30-980 ISSN (Print): 30-9798 (An ISO 397: 007 Certified Organization) Vol. 3, Issue 4, April 05 Developing an Efficient Algoritm for Image Fusion Using Dual Tree- Complex Wavelet Transform
More informationPYRAMID FILTERS BASED ON BILINEAR INTERPOLATION
PYRAMID FILTERS BASED ON BILINEAR INTERPOLATION Martin Kraus Computer Grapics and Visualization Group, Tecnisce Universität Müncen, Germany krausma@in.tum.de Magnus Strengert Visualization and Interactive
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More informationA Novel QC-LDPC Code with Flexible Construction and Low Error Floor
A Novel QC-LDPC Code wit Flexile Construction and Low Error Floor Hanxin WANG,2, Saoping CHEN,2,CuitaoZHU,2 and Kaiyou SU Department of Electronics and Information Engineering, Sout-Central University
More informationSome Handwritten Signature Parameters in Biometric Recognition Process
Some Handwritten Signature Parameters in Biometric Recognition Process Piotr Porwik Institute of Informatics, Silesian Uniersity, Bdziska 39, 41- Sosnowiec, Poland porwik@us.edu.pl Tomasz Para Institute
More informationMaterials: Whiteboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector.
Adam Clinc Lesson: Deriving te Derivative Grade Level: 12 t grade, Calculus I class Materials: Witeboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector. Goals/Objectives:
More informationREVERSIBLE DATA HIDING USING IMPROVED INTERPOLATION TECHNIQUE
International Researc Journal of Engineering and Tecnology (IRJET) e-issn: 2395-0056 REVERSIBLE DATA HIDING USING IMPROVED INTERPOLATION TECHNIQUE Devendra Kumar 1, Dr. Krisna Raj 2 (Professor in ECE Department
More information16th European Signal Processing Conference (EUSIPCO 2008), Lausanne, Switzerland, August 25-29, 2008, copyright by EURASIP
16t European Signal Processing Conference (EUSIPCO 008), Lausanne, Switzerland, August 5-9, 008, copyrigt by EURASIP ADAPTIVE WINDOW FOR LOCAL POLYNOMIAL REGRESSION FROM NOISY NONUNIFORM SAMPLES A. Sreenivasa
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More informationAsynchronous Power Flow on Graphic Processing Units
Asyncronous Power Flow on Grapic Processing Units Manuel Marin, David Defour, Federico Milano To cite tis version: Manuel Marin, David Defour, Federico Milano. Asyncronous Power Flow on Grapic Processing
More informationA signature analysis based method for elliptical shape
A signature analysis based metod for elliptical sape Ivana Guarneri, Mirko Guarnera, Giuseppe Messina and Valeria Tomaselli STMicroelectronics - AST Imaging Lab, Stradale rimosole 50, Catania, Italy ABSTRACT
More informationMAPI Computer Vision
MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -
More informationWhen a BST becomes badly unbalanced, the search behavior can degenerate to that of a sorted linked list, O(N).
Balanced Binary Trees Binary searc trees provide O(log N) searc times provided tat te nodes are distributed in a reasonably balanced manner. Unfortunately, tat is not always te case and performing a sequence
More informationTHE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM
THE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM SAMUEL OLU OLAGUNJU Adeyemi College of Education NIGERIA Email: lagsam04@aceondo.edu.ng ABSTRACT
More informationAVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic
1 AVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic AVL Trees 2 Binary Searc Trees better tan linear dictionaries; owever, te worst case performance
More informationProceedings of the 8th WSEAS International Conference on Neural Networks, Vancouver, British Columbia, Canada, June 19-21,
Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, 2007 3 Neural Network Structures wit Constant Weigts to Implement Dis-Jointly Removed
More information8/6/2010 Assignment Previewer
Week 4 Friday Homework (1321979) Question 1234567891011121314151617181920 1. Question DetailsSCalcET6 2.7.003. [1287988] Consider te parabola y 7x - x 2. (a) Find te slope of te tangent line to te parabola
More informationComputing geodesic paths on manifolds
Proc. Natl. Acad. Sci. USA Vol. 95, pp. 8431 8435, July 1998 Applied Matematics Computing geodesic pats on manifolds R. Kimmel* and J. A. Setian Department of Matematics and Lawrence Berkeley National
More informationRedundancy Awareness in SQL Queries
Redundancy Awareness in QL Queries Bin ao and Antonio Badia omputer Engineering and omputer cience Department University of Louisville bin.cao,abadia @louisville.edu Abstract In tis paper, we study QL
More informationSoftware Fault Prediction using Machine Learning Algorithm Pooja Garg 1 Mr. Bhushan Dua 2
IJSRD - International Journal for Scientific Researc & Development Vol. 3, Issue 04, 2015 ISSN (online): 2321-0613 Software Fault Prediction using Macine Learning Algoritm Pooja Garg 1 Mr. Busan Dua 2
More informationTraffic Pattern-based Adaptive Routing for Intra-group Communication in Dragonfly Networks
Traffic Pattern-based Adaptive Routing for Intra-group Communication in Dragonfly Networks Peyman Faizian, Md Safayat Raman, Md Atiqul Molla, Xin Yuan Department of Computer Science Florida State University
More informationThe (, D) and (, N) problems in double-step digraphs with unilateral distance
Electronic Journal of Grap Teory and Applications () (), Te (, D) and (, N) problems in double-step digraps wit unilateral distance C Dalfó, MA Fiol Departament de Matemàtica Aplicada IV Universitat Politècnica
More informationSlidesGen: Automatic Generation of Presentation Slides for a Technical Paper Using Summarization
Proceedings of te Twenty-Second International FLAIRS Conference (2009) SlidesGen: Automatic Generation of Presentation Slides for a Tecnical Paper Using Summarization M. Sravanti, C. Ravindranat Cowdary
More informationOn the Use of Radio Resource Tests in Wireless ad hoc Networks
Tecnical Report RT/29/2009 On te Use of Radio Resource Tests in Wireless ad oc Networks Diogo Mónica diogo.monica@gsd.inesc-id.pt João Leitão jleitao@gsd.inesc-id.pt Luis Rodrigues ler@ist.utl.pt Carlos
More informationEfficient Content-Based Indexing of Large Image Databases
Efficient Content-Based Indexing of Large Image Databases ESSAM A. EL-KWAE University of Nort Carolina at Carlotte and MANSUR R. KABUKA University of Miami Large image databases ave emerged in various
More informationCSE 332: Data Structures & Parallelism Lecture 8: AVL Trees. Ruth Anderson Winter 2019
CSE 2: Data Structures & Parallelism Lecture 8: AVL Trees Rut Anderson Winter 29 Today Dictionaries AVL Trees /25/29 2 Te AVL Balance Condition: Left and rigt subtrees of every node ave eigts differing
More informationYou should be able to visually approximate the slope of a graph. The slope m of the graph of f at the point x, f x is given by
Section. Te Tangent Line Problem 89 87. r 5 sin, e, 88. r sin sin Parabola 9 9 Hperbola e 9 9 9 89. 7,,,, 5 7 8 5 ortogonal 9. 5, 5,, 5, 5. Not multiples of eac oter; neiter parallel nor ortogonal 9.,,,
More informationeach node in the tree, the difference in height of its two subtrees is at the most p. AVL tree is a BST that is height-balanced-1-tree.
Data Structures CSC212 1 AVL Trees A binary tree is a eigt-balanced-p-tree if for eac node in te tree, te difference in eigt of its two subtrees is at te most p. AVL tree is a BST tat is eigt-balanced-tree.
More informationAuthor's personal copy
Autor's personal copy Information Processing Letters 09 (009) 868 875 Contents lists available at ScienceDirect Information Processing Letters www.elsevier.com/locate/ipl Elastic tresold-based admission
More informationUtilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks
Utilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks Okan Yilmaz and Ing-Ray Cen Computer Science Department Virginia Tec {oyilmaz, ircen}@vt.edu
More informationMULTIPLE TOKEN DISTRIBUTED LOOP LOCAL AREA NETWORKS: ANALYSIS
ULTIPLE TOKEN DISTRIBUTED LOOP LOCAL AREA NETWORKS: ANALYSIS Nimmagadda Calamaia æ Dept. of CSE JNTU College of Engineering Kakinada, India 533 003. calm@cse.iitkgp.ernet.in Badrinat Ramamurty y Dept.
More informationDistributed and Optimal Rate Allocation in Application-Layer Multicast
Distributed and Optimal Rate Allocation in Application-Layer Multicast Jinyao Yan, Martin May, Bernard Plattner, Wolfgang Mülbauer Computer Engineering and Networks Laboratory, ETH Zuric, CH-8092, Switzerland
More information15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes
15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes William Lovas (wlovas@cs) Karl Naden Out: Tuesday, Friday, June 10, 2011 Due: Monday, June 13, 2011 (Written
More informationEfficient Classification of Data Using Decision Tree
Bonfring International Journal of Data Mining, Vol. 2, No. 1, Marc 2012 6 Efficient Classification of Data Using Decision Tree Baskar N. Patel, Satis G. Prajapati and Dr. Kamaljit I. Laktaria Abstract---
More informationNonprehensile Manipulation for Orienting Parts in the Plane
Nonpreensile Manipulation for Orienting Parts in te Plane Nina B. Zumel Robotics Institute Carnegie Mellon University zumel@ri.cmu.edu Micael A. Erdmann Robotics Institute and Scool of Computer Science
More informationA UPnP-based Decentralized Service Discovery Improved Algorithm
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol.1, No.1, Marc 2013, pp. 21~26 ISSN: 2089-3272 21 A UPnP-based Decentralized Service Discovery Improved Algoritm Yu Si-cai*, Wu Yan-zi,
More informationTHANK YOU FOR YOUR PURCHASE!
THANK YOU FOR YOUR PURCHASE! Te resources included in tis purcase were designed and created by me. I ope tat you find tis resource elpful in your classroom. Please feel free to contact me wit any questions
More informationNumerical Derivatives
Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten
More information