The norm Package. November 15, Title Analysis of multivariate normal datasets with missing values

Size: px
Start display at page:

Download "The norm Package. November 15, Title Analysis of multivariate normal datasets with missing values"

Transcription

1 The norm Package November 15, 2003 Verion Date 2002/05/06 Title Analyi of multivariate normal dataet with miing value Author Ported to R by Alvaro A. Novo <alvaro@novo-online.net>. Original by Joeph L. Schafer <jl@tat.pu.edu>. Maintainer Alvaro A. Novo <alvaro@novo-online.net> Analyi of multivariate normal dataet with miing value Licene The oftware may be ditributed free of charge and ued by anyone if credit i given. It ha been teted URL jl/mioftwa.html#aut R topic documented:.code.to.na da.norm em.norm getparam.norm imp.norm loglik.norm logpot.norm makeparam.norm mda.norm mdata mi.inference na.to.nglcode ninvwih prelim.norm rngeed Index 16 1

2 2 da.norm.code.to.na Change miing value code to NA Change miing value code to NA. It called from prelim.norm..code.to.na(x, mvcode) x mvcode data object. internal input of prelim.norm. Initial data object with miing value code changed to NA. prelim.norm da.norm Data augmentation for incomplete multivariate normal data Data augmentation under a normal-inverted Wihart prior. If no prior i pecified by the uer, the uual noninformative prior for the multivariate normal ditribution i ued. Thi function imulate one or more iteration of a ingle Markov chain. Each iteration conit of a random imputation of the miing data given the oberved data and the current parameter value (I-tep), followed by a draw from the poterior ditribution of the parameter given the oberved data and the imputed data (P-tep). da.norm(, tart, prior, tep=1, howit=false, return.ymi=false) tart ummary lit of an incomplete normal data matrix produced by the function tarting value of the parameter. Thi i a parameter vector in packed torage, uch a one created by the function makeparam.norm. One obviou choice for a tarting value i an ML etimate or poterior mode produced by em.norm.

3 da.norm 3 prior tep howit return.ymi optional prior ditribution. Thi i a lit containing the hyperparameter of a normal-inverted Wihart ditribution. In order, the element of the lit are: tau (a calar), m (a calar), mu0 (a vector of length ncol(x), where x i the original matrix of incomplete data), and lambdainv (a matrix of dimenion c(ncol(x),ncol(x))). The element of mu0 and lambdainv apply to the data after tranformation, i.e. after the column have been centered and caled to have mean zero and variance one. If no prior i upplied, the default i the uual noninformative prior for a multivariate normal model: tau=0, m=-1, mu0=arbitrary, and lambdainv = matrix of zero. number of data augmentation iteration to be imulated. if TRUE, report the iteration o the uer can monitor the progre of the algorithm. if TRUE, return the output of the lat I-tep (imputed value of miing data) in addition to the output of the lat P-tep. Thee imputed value are ueful for forming Rao-Blackwellized etimate of poterior ummarie. if return.ymi=false, return a parameter vector, the reult of the lat P-tep. If the value of tep wa large enough to guarantee approximate tationarity, then thi parameter can be regarded a a proper draw from the oberved-data poterior, independent of tart. If return.ymi=true, then thi function return a lit of the following two component: parameter a parameter vector, the reult of the lat P-tep ymi a vector of miing value, the reult of the lat I-tep. The length of thi vector i um(i.na(x)), where x i the original data matrix. The torage order i the ame a that of x[i.na(x)]. WARNING Before thi function may be ued, the random number generator eed mut be initialized with rngeed at leat once in the current S eion. See Chapter 5 of Schafer (1996). rngeed, em.norm, prelim.norm, and getparam.norm. <- prelim.norm(mdata) thetahat <- em.norm() #find the MLE for a tarting value rngeed( ) #et random number generator eed theta <- da.norm(,thetahat,tep=20,howit=true) # take 20 tep getparam.norm(,theta) # look at reult

4 4 em.norm em.norm EM algorithm for incomplete normal data Perform maximum-likelihood etimation on the matrix of incomplete data uing the EM algorithm. Can alo be ued to find a poterior mode under a normal-inverted Wihart prior upplied by the uer. em.norm(, tart, howit=true, maxit=1000, criterion=0.0001, prior) tart howit maxit criterion prior ummary lit of an incomplete normal data matrix produced by the function optional tarting value of the parameter. Thi i a parameter vector in packed torage, uch a one created by the function makeparam.norm. If no tarting value i upplied, em.norm chooe it own tarting value. if TRUE, report the iteration of EM o the uer can monitor the progre of the algorithm. maximum number of iteration performed. The algorithm will top if the parameter till ha not converged after thi many iteration. convergence criterion. The algorithm top when the maximum relative difference in all of the etimated mean, variance, or covariance from one iteration to the next i le than or equal to thi value. optional prior ditribution. Thi i a lit containing the hyperparameter of a normal-inverted Wihart ditribution. In order, the element of the lit are: tau (a calar), m (a calar), mu0 (a vector of length ncol(x)), and lambdainv (a matrix of dimenion c(ncol(x),ncol(x))). The element of mu0 an lambdainv apply to the data after tranformation, i.e. after the column have been centered and caled to have mean zero and variance one. If no prior i upplied, the default i a uniform prior, which reult in maximum-likelihood etimation. Detail The default tarting value take all mean on the tranformed cale to be equal to zero, and covariance matrix on the tranformed cale equal to the identity. All important computation are carried out in double preciion, uing the weep operator. a vector repreenting the maximum-likelihood etimate of the normal parameter. Thi vector contain mean, variance, and covariance on the tranformed cale in packed torage. The parameter can be tranformed back to the original cale and put into a more undertandable format by the function getparam.norm.

5 getparam.norm 5 See Section 5.3 of Schafer (1994). prelim.norm, getparam.norm, and makeparam.norm. <- prelim.norm(mdata) #do preliminary manipulation thetahat <- em.norm() #compute mle getparam.norm(,thetahat,corr=true)$r #look at etimated correlation getparam.norm Extract normal parameter from packed torage Take a parameter vector, uch a one produced by em.norm or da.norm, and return a lit of parameter on the original cale. getparam.norm(, theta, corr=false) theta corr ummary lit of an incomplete normal data matrix created by the function vector of normal parameter expreed on tranformed cale in packed torage, uch a one produced by the function em.norm. if TRUE, compute mean, tandard deviation, and a correlation matrix. If FALSE, compute mean and a covariance matrix. if corr=false, a lit containing the component mu and igma; if corr=true, a lit containing the component mu, dv, and r. The component are: mu igma dv r vector of mean. Element are in the ame order and on the ame cale a the column of the original data matrix, and with name correponding to the column name of the original data matrix. matrix of variance and covariance. vector of tandard deviation. matrix of correlation. prelim.norm and makeparam.norm.

6 6 imp.norm <- prelim.norm(mdata) #do preliminary manipulation thetahat <- em.norm() #compute MLE getparam.norm(,thetahat,corr=true)$r #look at etimated correlation imp.norm Impute miing multivariate normal data Draw miing element of a data matrix under the multivariate normal model and a uerupplied parameter imp.norm(, theta, x) theta x ummary lit of an incomplete normal data matrix x created by the function value of the normal parameter under which the miing data are to be randomly imputed. Thi i a parameter vector in packed torage, uch a one created by em.norm or da.norm. the original data matrix ued to create the ummary lit. If thi argument i not upplied, then the data matrix returned by thi function may diagree lightly with the oberved value in x due to rounding error. Detail Thi function imply perform one I-tep of data augmentation. a matrix of the ame form a x, but with all miing value filled in with imulated value drawn from their predictive ditribution given the oberved data and the pecified parameter. WARNING Before thi function may be ued, the random number generator eed mut be initialized with rngeed at leat once in the current S eion. See Section of Schafer (1996). prelim.norm, makeparam.norm, and rngeed.

7 loglik.norm 7 <- prelim.norm(mdata) #do preliminary manipulation thetahat <- em.norm() #find the mle rngeed( ) #et random number generator eed ximp <- imp.norm(,thetahat,mdata) #impute miing data under the MLE loglik.norm Oberved-data loglikelihood for normal data Evaluate the oberved-data loglikelihood function at a uer-upplied value of the parameter. Thi function i ueful for monitoring the progre of EM and data augmentation. loglik.norm(, theta) theta ummary lit of an incomplete normal data matrix created by the function vector of normal parameter expreed on tranformed cale in packed torage, uch a one produced by the function em.norm. value of the oberved-data loglikelihood See Section of Schafer (1996) prelim.norm and logpot.norm <- prelim.norm(mdata) thetahat <- em.norm() loglik.norm(,thetahat) #do preliminary manipulation #compute MLE #loglikelihood at the MLE

8 8 logpot.norm logpot.norm Oberved-data log-poterior for normal data Evaluate the log of the oberved-data poterior denity at a uer-upplied value of the parameter. Aume a normal-inverted Wihart prior. Thi function i ueful for monitoring the progre of EM and data augmentation. logpot.norm(, theta, prior) theta prior ummary lit of an incomplete normal data matrix created by the function vector of normal parameter expreed on tranformed cale in packed torage, uch a one produced by the function em.norm. optional prior ditribution. Thi i a lit containing the hyperparameter of a normal-inverted Wihart ditribution. In order, the element of the lit are: tau (a calar), m (a calar), mu0 (a vector of length ncol(x), where x i the original matrix of incomplete data), and lambdainv (a matrix of dimenion c(ncol(x),ncol(x))). The element of mu0 and lambdainv apply to the data after tranformation, i.e. after the column have been centered and caled to have mean zero and variance one. If no prior i upplied, the default i the uual noninformative prior for a multivariate normal model: tau=0, m=-1, mu0=arbitrary, and lambdainv = matrix of zero. value of the oberved-data log-poterior denity See Section of Schafer (1996) prelim.norm and loglik.norm <- prelim.norm(mdata) #do preliminary manipulation prior <- lit(0,.5,rep(0,ncol(mdata)),.5*diag(rep(1,ncol(mdata)))) #ridge prior with.5 df thetahat <- em.norm(,prior=prior) #compute poterior mode logpot.norm(,thetahat,prior) #log-poterior at mode

9 makeparam.norm 9 makeparam.norm Convert normal parameter to packed torage Doe the oppoite of getparam.norm. Convert a lit of uer-pecified parameter to a parameter vector uitable for input to function uch a da.norm and em.norm. makeparam.norm(, thetalit) thetalit ummary lit of an incomplete normal data matrix created by the function lit of normal parameter of the ame form a one produced by getparam.norm. If the lit ha two component, the firt mut be the vector of mean and the econd mut be the covariance matrix, where mean and covariance are expreed on the cale of the original data. If the lit ha three component, the firt mut be the vector of mean, the econd mut be the vector of tandard deviation, and the third mut be the correlation matrix. normal parameter in packed torage, uitable for ue a a tarting value for em.norm, mda.norm, or mdamet.norm. prelim.norm and getparam.norm. <- prelim.norm(mdata) #do preliminary manipulation thetahat <- em.norm() #compute mle thetahat <- getparam.norm(,thetahat,corr=true) #extract parameter thetahat$r #look at mle correlation thetahat$r[1,2] <-.5 #tweak a parameter thetahat <- makeparam.norm(,thetahat) #convert to packed torage thetahat <- em.norm(,thetahat) #run EM again from new tarting value

10 10 mda.norm mda.norm Monotone data augmentation for incomplete multivariate normal data Monotone data augmentation under the uual noninformative prior, a decribed in Chapter 6 of Schafer (1996). Thi function imulate one or more iteration of a ingle Markov chain. One iteration conit of a random imputation of the miing data given the oberved data and the current parameter value (I-tep), followed by a draw from the poterior ditribution of the parameter given the oberved data and the imputed data (P-tep). The I-tep impute only enough data to complete a monotone pattern, which typically make thi algorithm converge more quickly than da.norm, particularly when the oberved data are nearly monotone. The order of the variable in the original data matrix determine the monotone pattern to be completed. For fat convergence, it help to order the variable according to their rate of miingne, with the mot oberved (leat miing) variable on the left and the leat oberved variable on the right. mda.norm(, theta, tep=1, howit=false) theta tep howit ummary lit of an incomplete normal data matrix produced by the function tarting value of the parameter. Thi i a parameter vector in packed torage, uch a one created by the function makeparam.norm. One obviou choice for a tarting value i an ML etimate or poterior mode produced by em.norm. number of monotone data augmentation iteration to be imulated. if TRUE, report the iteration o the uer can monitor the progre of the algorithm. Return a parameter vector, the reult of the lat P-tep. If the value of tep wa large enough to guarantee approximate tationarity, then thi parameter can be regarded a a proper draw from the oberved-data poterior, independent of tart. WARNING Before thi function may be ued, the random number generator eed mut be initialized with rngeed at leat once in the current S eion. Chapter 6 of Schafer (1996). rngeed, em.norm, prelim.norm, and getparam.norm.

11 mdata 11 <- prelim.norm(mdata) thetahat <- em.norm() #find the MLE for a tarting value rngeed( ) #et random number generator eed theta <- mda.norm(,thetahat,tep=20,howit=true) # take 20 tep getparam.norm(,theta) # look at reult mdata Dataet with miing value to illutrate ue of package norm Houehold urvey with miing value. See Schafer (1997). Schafer, J.L.(1997) Analyi of Incomplete Multivariate Data, Chapman & Hall, London. ISBN: mi.inference Multiple imputation inference Combine etimate and tandard error from m complete-data analye performed on m imputed dataet to produce a ingle inference. Ue the technique decribed by Rubin (1987) for multiple imputation inference for a calar etimand. mi.inference(et, td.err, confidence=0.95) et td.err confidence a lit of m (at leat 2) vector repreenting etimate (e.g., vector of etimated regreion coefficient) from complete-data analye performed on m imputed dataet. a lit of m vector containing tandard error from the complete-data analye correponding to the etimate in et. deired coverage of interval etimate.

12 12.na.to.nglcode a lit with the following component, each of which i a vector of the ame length a the component of et and td.err: et td.err df ignif lower upper r fminf the average of the complete-data etimate. tandard error incorporating both the between and the within-imputation uncertainty (the quare root of the total variance ). degree of freedom aociated with the t reference ditribution ued for interval etimate. P-value for the two-tailed hypothei tet that the etimated quantitie are equal to zero. lower limit of the (100*confidence)% interval etimate. upper limit of the (100*confidence)% interval etimate. etimated relative increae in variance due to nonrepone. etimated fraction of miing information. METHOD Ue the method decribed on pp of Rubin (1987) for combining the complete-data etimate from m imputed dataet for a calar etimand. Significance level and interval etimate are approximately valid for each one-dimenional etimand, not for all of them jointly. See Rubin (1987) or Schafer (1996), Chapter 4..na.to.nglcode Change NA to ingle preciion miing value code Change NA to ingle preciion miing value code It called internally by other function in the package, e.g., prelim.norm..code.to.na(x, mvcode) x mvcode data object. internal input of prelim.norm. Initial data object with miing value code preciion changed to inlge. prelim.norm

13 ninvwih 13 ninvwih Random normal-inverted Wihart variate Simulate a value from a normal-inverted Wihart ditribution. Thi function may be ueful for obtaining tarting value of the parameter of a multivariate normal ditribution for multiple chain of data augmentation. ninvwih(, param) param ummary lit of an incomplete normal data matrix produced by the function lit of parameter of a normal-inverted Wihart ditribution. In order, the element of the lit are: tau (a calar), m (a calar), mu0 (a vector of length ncol(x)), and lambdainv (a matrix of dimenion c(ncol(x),ncol(x))). When uing thi function to create tarting value for data augmentation, mu0 and lambdainv hould be choen in relation to the data matrix after the column have been centered and caled to have mean zero and variance one. a vector in packed torage repreenting the imulated normal-inverted Wihart variate. Thi vector ha the ame form a parameter vector produced by function uch a em.norm and da.norm, and may be ued directly a a tarting value for thee function. Thi vector can alo be put into a more undertandable format by getparam.norm. WARNING Before thi function may be ued, the random number generator eed mut be initialized with rngeed at leat once in the current S eion. See Section of Schafer (1996). rngeed, getparam.norm, em.norm and da.norm. <- prelim.norm(mdata) #do preliminary manipulation param <- lit(1,.5,rep(0,ncol(mdata)),.5*diag(rep(1,ncol(mdata)))) # give widely dipered value rngeed( ) tart <- ninvwih(,param) # draw a variate thetahat <- em.norm(,tart=tart) # run EM from thi tarting value

14 14 prelim.norm prelim.norm Preliminary manipulation for a matrix of incomplete continuou data. Sort row of x by miingne pattern, and center/cale column of x. Calculate variou bookkeeping quantitie needed for input to other function, uch a em.norm and da.norm. prelim.norm(x) x data matrix containing miing value. The row of x correpond to obervational unit, and the column to variable. Miing value are denoted by NA. a lit of thirteen component that ummarize variou feature of x after the data have been centered, caled, and orted by miingne pattern. Component that might be of interet to the uer include: nmi a vector of length ncol(x) containing the number of miing value for each variable in x. Thi vector ha name that correpond to the column name of x, if any. r matrix of repone indicator howing the miing data pattern in x. Dimenion i (S,p) where S i the number of ditinct miingne pattern in the row of x, and p i the number of column in x. Oberved value are indicated by 1 and miing value by 0. The row name give the number of obervation in each pattern, and the column name correpond to the column name of x. See Section of Schafer (1996). <- prelim.norm(mdata) #do preliminary manipulation $nmi[$co] #look at nmi $r #look at miing data pattern

15 rngeed 15 rngeed Initialize random number generator eed Initialize the eed value for the internal random-number generator ued in miing-data program rngeed(eed) eed a poitive number > = 1, preferably a large integer. NULL. NOTE The random number generator eed mut be et at leat once by thi function before the imulation or imputation function in thi package (da.norm, etc.) can be ued.

16 Index Topic NA.code.to.na, 1.na.to.nglcode, 11 Topic dataet mdata, 10 Topic ditribution da.norm, 2 rngeed, 14 Topic htet mi.inference, 10 Topic multivariate loglik.norm, 6 logpot.norm, 7 mda.norm, 9 ninvwih, 12 prelim.norm, 13 Topic regreion em.norm, 3 getparam.norm, 4 imp.norm, 5 makeparam.norm, 8.code.to.na, 1.na.to.nglcode, 11 da.norm, 2, 12 em.norm, 3, 3, 9, 12 getparam.norm, 3, 4, 4, 8, 9, 12 imp.norm, 5 loglik.norm, 6, 8 logpot.norm, 7, 7 makeparam.norm, 4 6, 8 mda.norm, 9 mdata, 10 mi.inference, 10 ninvwih, 12 prelim.norm, 1, 3 9, 11, 13 rngeed, 3, 6, 9, 12, 14 16

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic

More information

3D SMAP Algorithm. April 11, 2012

3D SMAP Algorithm. April 11, 2012 3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative

More information

Advanced Encryption Standard and Modes of Operation

Advanced Encryption Standard and Modes of Operation Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES

More information

Lecture 14: Minimum Spanning Tree I

Lecture 14: Minimum Spanning Tree I COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce

More information

1 The secretary problem

1 The secretary problem Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.

More information

Representations and Transformations. Objectives

Representations and Transformations. Objectives Repreentation and Tranformation Objective Derive homogeneou coordinate tranformation matrice Introduce tandard tranformation - Rotation - Tranlation - Scaling - Shear Scalar, Point, Vector Three baic element

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two

More information

The LLAhclust Package

The LLAhclust Package Verion 0.2-1 Date 2007-31-08 The LLAhclut Package September 1, 2007 Title Hierarchical clutering of variable or object baed on the likelihood linkage analyi method Author Ivan Kojadinovic, Iraël-Céar Lerman,

More information

Drawing Lines in 2 Dimensions

Drawing Lines in 2 Dimensions Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional

More information

Package norm2. May 11, 2016

Package norm2. May 11, 2016 Type Package Package norm2 May 11, 2016 Title Analysis of Incomplete Multivariate Data under a Normal Model Version 2.0.1 Date 2016-05-10 Author Joseph L. Schafer Maintainer

More information

Shortest Paths Problem. CS 362, Lecture 20. Today s Outline. Negative Weights

Shortest Paths Problem. CS 362, Lecture 20. Today s Outline. Negative Weights Shortet Path Problem CS 6, Lecture Jared Saia Univerity of New Mexico Another intereting problem for graph i that of finding hortet path Aume we are given a weighted directed graph G = (V, E) with two

More information

Multi-Target Tracking In Clutter

Multi-Target Tracking In Clutter Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and

More information

Chapter 13 Non Sampling Errors

Chapter 13 Non Sampling Errors Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog

More information

Today s Outline. CS 561, Lecture 23. Negative Weights. Shortest Paths Problem. The presence of a negative cycle might mean that there is

Today s Outline. CS 561, Lecture 23. Negative Weights. Shortest Paths Problem. The presence of a negative cycle might mean that there is Today Outline CS 56, Lecture Jared Saia Univerity of New Mexico The path that can be trodden i not the enduring and unchanging Path. The name that can be named i not the enduring and unchanging Name. -

More information

KS3 Maths Assessment Objectives

KS3 Maths Assessment Objectives KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage

More information

xy-monotone path existence queries in a rectilinear environment

xy-monotone path existence queries in a rectilinear environment CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of

More information

Edits in Xylia Validity Preserving Editing of XML Documents

Edits in Xylia Validity Preserving Editing of XML Documents dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,

More information

Performance Evaluation of an Advanced Local Search Evolutionary Algorithm

Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation

More information

Generic Traverse. CS 362, Lecture 19. DFS and BFS. Today s Outline

Generic Traverse. CS 362, Lecture 19. DFS and BFS. Today s Outline Generic Travere CS 62, Lecture 9 Jared Saia Univerity of New Mexico Travere(){ put (nil,) in bag; while (the bag i not empty){ take ome edge (p,v) from the bag if (v i unmarked) mark v; parent(v) = p;

More information

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.

More information

IMPLEMENTATION OF CHORD LENGTH SAMPLING FOR TRANSPORT THROUGH A BINARY STOCHASTIC MIXTURE

IMPLEMENTATION OF CHORD LENGTH SAMPLING FOR TRANSPORT THROUGH A BINARY STOCHASTIC MIXTURE Nuclear Mathematical and Computational Science: A Century in Review, A Century Anew Gatlinburg, Tenneee, April 6-, 003, on CD-ROM, American Nuclear Society, LaGrange Park, IL (003) IMPLEMENTATION OF CHORD

More information

Trainable Context Model for Multiscale Segmentation

Trainable Context Model for Multiscale Segmentation Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu

More information

On combining Learning Vector Quantization and the Bayesian classifiers for natural textured images

On combining Learning Vector Quantization and the Bayesian classifiers for natural textured images On combining Learning Vector Quantization and the Bayeian claifier for natural textured image María Guiarro Dept. Ingeniería del Software e Inteligencia Artificial Facultad Informática Univeridad Complutene

More information

Modeling of underwater vehicle s dynamics

Modeling of underwater vehicle s dynamics Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation

More information

Computer Graphics. Transformation

Computer Graphics. Transformation (SBE 36) Dr. Aman Eldeib Spring 2 SBE 36 i a fundamental corner tone of computer graphic and i a central to OpenGL a well a mot other graphic tem.(2d and 3D ) Given an object, tranformation i to change

More information

ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION

ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa

More information

Topics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X

Topics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term

More information

Analysis of Incomplete Multivariate Data

Analysis of Incomplete Multivariate Data Analysis of Incomplete Multivariate Data J. L. Schafer Department of Statistics The Pennsylvania State University USA CHAPMAN & HALL/CRC A CR.C Press Company Boca Raton London New York Washington, D.C.

More information

Operational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz

Operational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,

More information

An Intro to LP and the Simplex Algorithm. Primal Simplex

An Intro to LP and the Simplex Algorithm. Primal Simplex An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n

More information

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity

More information

CSE 250B Assignment 4 Report

CSE 250B Assignment 4 Report CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed

More information

/06/$ IEEE 364

/06/$ IEEE 364 006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;

More information

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu

More information

A SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS

A SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt

More information

Shortest Path Routing in Arbitrary Networks

Shortest Path Routing in Arbitrary Networks Journal of Algorithm, Vol 31(1), 1999 Shortet Path Routing in Arbitrary Network Friedhelm Meyer auf der Heide and Berthold Vöcking Department of Mathematic and Computer Science and Heinz Nixdorf Intitute,

More information

Lecture Outline. Global flow analysis. Global Optimization. Global constant propagation. Liveness analysis. Local Optimization. Global Optimization

Lecture Outline. Global flow analysis. Global Optimization. Global constant propagation. Liveness analysis. Local Optimization. Global Optimization Lecture Outline Global flow analyi Global Optimization Global contant propagation Livene analyi Adapted from Lecture by Prof. Alex Aiken and George Necula (UCB) CS781(Praad) L27OP 1 CS781(Praad) L27OP

More information

Quadrilaterals. Learning Objectives. Pre-Activity

Quadrilaterals. Learning Objectives. Pre-Activity Section 3.4 Pre-Activity Preparation Quadrilateral Intereting geometric hape and pattern are all around u when we tart looking for them. Examine a row of fencing or the tiling deign at the wimming pool.

More information

SIMIT 7. Profinet IO Gateway. User Manual

SIMIT 7. Profinet IO Gateway. User Manual SIMIT 7 Profinet IO Gateway Uer Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult are only non-binding uggetion

More information

Service and Network Management Interworking in Future Wireless Systems

Service and Network Management Interworking in Future Wireless Systems Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering

More information

Markov Random Fields in Image Segmentation

Markov Random Fields in Image Segmentation Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image

More information

SIMIT 7. What's New In SIMIT V7.1? Manual

SIMIT 7. What's New In SIMIT V7.1? Manual SIMIT 7 What' New In SIMIT V7.1? Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimization-reult are only non-binding uggetion

More information

Minimum congestion spanning trees in bipartite and random graphs

Minimum congestion spanning trees in bipartite and random graphs Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu

More information

COLLAGEN ORIENTATION AND WAVINESS WITHIN THE VEIN WALL

COLLAGEN ORIENTATION AND WAVINESS WITHIN THE VEIN WALL XI International Conference on Computational Platicity. Fundamental and Application COMPLAS XI E. Oñate, D.R.J. Owen, D. Peric and B. Suárez (Ed) COLLAGEN ORIENTATION AND WAVINESS WITHIN THE VEIN WALL

More information

Domain-Specific Modeling for Rapid System-Wide Energy Estimation of Reconfigurable Architectures

Domain-Specific Modeling for Rapid System-Wide Energy Estimation of Reconfigurable Architectures Domain-Specific Modeling for Rapid Sytem-Wide Energy Etimation of Reconfigurable Architecture Seonil Choi 1,Ju-wookJang 2, Sumit Mohanty 1, Viktor K. Praanna 1 1 Dept. of Electrical Engg. 2 Dept. of Electronic

More information

arxiv: v1 [cs.ms] 20 Dec 2017

arxiv: v1 [cs.ms] 20 Dec 2017 CameraTranform: a Scientific Python Package for Perpective Camera Correction Richard Gerum, Sebatian Richter, Alexander Winterl, Ben Fabry, and Daniel Zitterbart,2 arxiv:72.07438v [c.ms] 20 Dec 207 Department

More information

A System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems

A System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem

More information

Delaunay Triangulation: Incremental Construction

Delaunay Triangulation: Incremental Construction Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )

More information

SIMIT 7. Component Type Editor (CTE) User manual. Siemens Industrial

SIMIT 7. Component Type Editor (CTE) User manual. Siemens Industrial SIMIT 7 Component Type Editor (CTE) Uer manual Siemen Indutrial Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult

More information

USING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL

USING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL USING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL Robert A. Kilmer Department of Sytem Engineering Unite State Military Acaemy Wet Point, NY 1996 Alice E. Smith

More information

Computer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder

Computer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal

More information

Cutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.

Cutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck. Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization

More information

Introduction to PET Image Reconstruction. Tomographic Imaging. Projection Imaging. PET Image Reconstruction 11/6/07

Introduction to PET Image Reconstruction. Tomographic Imaging. Projection Imaging. PET Image Reconstruction 11/6/07 Introduction to PET Image Recontruction Adam Aleio Nuclear Medicine Lecture Imaging Reearch Laboratory Diviion of Nuclear Medicine Univerity of Wahington Fall 2007 http://dept.wahington.edu/nucmed/irl/education.html

More information

Gray-level histogram. Intensity (grey-level) transformation, or mapping. Use of intensity transformations:

Gray-level histogram. Intensity (grey-level) transformation, or mapping. Use of intensity transformations: Faculty of Informatic Eötvö Loránd Univerity Budapet, Hungary Lecture : Intenity Tranformation Image enhancement by point proceing Spatial domain and frequency domain method Baic Algorithm for Digital

More information

The Association of System Performance Professionals

The Association of System Performance Professionals The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and

More information

Course Project: Adders, Subtractors, and Multipliers a

Course Project: Adders, Subtractors, and Multipliers a In the name Allah Department of Computer Engineering 215 Spring emeter Computer Architecture Coure Intructor: Dr. Mahdi Abbai Coure Project: Adder, Subtractor, and Multiplier a a The purpoe of thi p roject

More information

Analyzing Hydra Historical Statistics Part 2

Analyzing Hydra Historical Statistics Part 2 Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the

More information

Maneuverable Relays to Improve Energy Efficiency in Sensor Networks

Maneuverable Relays to Improve Energy Efficiency in Sensor Networks Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov

More information

Algorithmic Discrete Mathematics 4. Exercise Sheet

Algorithmic Discrete Mathematics 4. Exercise Sheet Algorithmic Dicrete Mathematic. Exercie Sheet Department of Mathematic SS 0 PD Dr. Ulf Lorenz 0. and. May 0 Dipl.-Math. David Meffert Verion of May, 0 Groupwork Exercie G (Shortet path I) (a) Calculate

More information

Using Mouse Feedback in Computer Assisted Transcription of Handwritten Text Images

Using Mouse Feedback in Computer Assisted Transcription of Handwritten Text Images 2009 10th International Conference on Document Analyi and Recognition Uing Moue Feedback in Computer Aited Trancription of Handwritten Text Image Verónica Romero, Alejandro H. Toelli, Enrique Vidal Intituto

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented

More information

See chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM

See chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive

More information

Routing Definition 4.1

Routing Definition 4.1 4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing

More information

( ) subject to m. e (2) L are 2L+1. = s SEG SEG Las Vegas 2012 Annual Meeting Page 1

( ) subject to m. e (2) L are 2L+1. = s SEG SEG Las Vegas 2012 Annual Meeting Page 1 A new imultaneou ource eparation algorithm uing frequency-divere filtering Ying Ji*, Ed Kragh, and Phil Chritie, Schlumberger Cambridge Reearch Summary We decribe a new imultaneou ource eparation algorithm

More information

How to. write a paper. The basics writing a solid paper Different communities/different standards Common errors

How to. write a paper. The basics writing a solid paper Different communities/different standards Common errors How to write a paper The baic writing a olid paper Different communitie/different tandard Common error Reource Raibert eay My grammar point Article on a v. the Bug in writing Clarity Goal Conciene Calling

More information

Parallel MATLAB at FSU: Task Computing

Parallel MATLAB at FSU: Task Computing Parallel MATLAB at FSU: Tak John Burkardt Department of Scientific Florida State Univerity... 1:30-2:30 Thurday, 07 April 2011 499 Dirac Science Library... http://people.c.fu.edu/ jburkardt/preentation/...

More information

Contents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course:

Contents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course: Content Shortet path Algorithm and Network 21/211 The hortet path problem: Statement Verion Application Algorithm (for ingle ource p problem) Reminder: relaxation, Dijktra, Variant of Dijktra, Bellman-Ford,

More information

Increasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment

Increasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in

More information

Package princurve. R topics documented: June 12, Version 2.0.2

Package princurve. R topics documented: June 12, Version 2.0.2 Verion 2.0.2 Package princurve June 12, 2018 Title Fit a Principal Curve in Arbitrary Dimenion Decription Fitting a principal curve to a data matri in arbitrary dimenion. Licene GPL-2 Depend R (>= 3.0)

More information

Hassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,

Hassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem, COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)

More information

Shortest-Path Routing in Arbitrary Networks

Shortest-Path Routing in Arbitrary Networks Ž. Journal of Algorithm 31, 105131 1999 Article ID jagm.1998.0980, available online at http:www.idealibrary.com on Shortet-Path Routing in Arbitrary Network Friedhelm Meyer auf der Heide and Berthold Vocking

More information

Reporting Checklist for Nature Neuroscience

Reporting Checklist for Nature Neuroscience Correponding Author: Manucript Number: Manucript Type: Jeremy Elman NNBC48172A Brief Communication Reporting Checklit for Nature Neurocience # Figure: 2 # Figure: 5 # Table: 6 # Video: 0 Thi checklit i

More information

A Boyer-Moore Approach for. Two-Dimensional Matching. Jorma Tarhio. University of California. Berkeley, CA Abstract

A Boyer-Moore Approach for. Two-Dimensional Matching. Jorma Tarhio. University of California. Berkeley, CA Abstract A Boyer-Moore Approach for Two-Dimenional Matching Jorma Tarhio Computer Science Diviion Univerity of California Berkeley, CA 94720 Abtract An imple ublinear algorithm i preented for two-dimenional tring

More information

A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED

A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,

More information

Policy-based Injection of Private Traffic into a Public SDN Testbed

Policy-based Injection of Private Traffic into a Public SDN Testbed Intitut für Techniche Informatik und Kommunikationnetze Adrian Friedli Policy-baed Injection of Private Traffic into a Public SDN Tetbed Mater Thei MA-2013-12 Advior: Dr. Bernhard Ager, Vaileio Kotroni

More information

else end while End References

else end while End References 621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized

More information

3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES

3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,

More information

NUMERICAL MODELING ON THE DAMPING CONTROL OF TLD STRUCTURE

NUMERICAL MODELING ON THE DAMPING CONTROL OF TLD STRUCTURE 4th International Conference on Earthquake Engineering Taipei, Taiwan October 12-13, 2006 Paper No. 183 NUMERICAL MODELING ON THE DAMPING CONTROL OF TLD STRUCTURE Han jun 1, Li Yingmin 2, Liu Liping 3,

More information

How to Select Measurement Points in Access Point Localization

How to Select Measurement Points in Access Point Localization Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,

More information

A New Approach to Pipeline FFT Processor

A New Approach to Pipeline FFT Processor A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture

More information

Stress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling

Stress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Stre-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Menter F.R. ANSYS Germany GmbH Introduction It i oberved in many CFD imulation that RANS model how inherent technology limitation

More information

Load Estimation of Social Networking Web Sites Using Clustering Technique

Load Estimation of Social Networking Web Sites Using Clustering Technique International Journal of Electronic and Electrical Engineering Vol. 4, No. 6, December 216 Load Etimation of Social Networking Web Site Uing Clutering Technique Deepti Bhagwani and Setu Kumar Chaturvedi

More information

Frequency Table Computation on Dataflow Architecture

Frequency Table Computation on Dataflow Architecture Frequency Table Computation on Dataflow Architecture P. Škoda *, V. Sruk **, and B. Medved Rogina * * Ruđer Bošković Intitute, Zagreb, Croatia ** Faculty of Electrical Engineering and Computing, Univerity

More information

Image authentication and tamper detection using fragile watermarking in spatial domain

Image authentication and tamper detection using fragile watermarking in spatial domain International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking

More information

Comparison of Methods for Horizon Line Detection in Sea Images

Comparison of Methods for Horizon Line Detection in Sea Images Comparion of Method for Horizon Line Detection in Sea Image Tzvika Libe Evgeny Gerhikov and Samuel Koolapov Department of Electrical Engineering Braude Academic College of Engineering Karmiel 2982 Irael

More information

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart. Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut

More information

A TOPSIS based Method for Gene Selection for Cancer Classification

A TOPSIS based Method for Gene Selection for Cancer Classification Volume 67 No17, April 2013 A TOPSIS baed Method for Gene Selection for Cancer Claification IMAbd-El Fattah,WIKhedr, KMSallam, 1 Department of Statitic, 3 Department of Deciion upport, 2 Department of information

More information

Refining SIRAP with a Dedicated Resource Ceiling for Self-Blocking

Refining SIRAP with a Dedicated Resource Ceiling for Self-Blocking Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT

More information

Today s Outline. CS 362, Lecture 19. DFS and BFS. Generic Traverse. BFS and DFS Wrapup Shortest Paths. Jared Saia University of New Mexico

Today s Outline. CS 362, Lecture 19. DFS and BFS. Generic Traverse. BFS and DFS Wrapup Shortest Paths. Jared Saia University of New Mexico Today Outline CS 362, Lecture 9 Jared Saia Univerity of New Mexico BFS and DFS Wrapup Shortet Path Generic Travere DFS and BFS Travere(){ put (nil,) in bag; while (the bag i not empty){ take ome edge (p,v)

More information

CENTER-POINT MODEL OF DEFORMABLE SURFACE

CENTER-POINT MODEL OF DEFORMABLE SURFACE CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D

More information

Package sound. R topics documented: November 10, Version Date Title A Sound Interface for R

Package sound. R topics documented: November 10, Version Date Title A Sound Interface for R Verion 1.4.5 Date 2017-11-10 Title A Sound Interface for R Package ound November 10, 2017 Author Matthia Heymann Maintainer Stefan Langenberg Depend R

More information

CERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu

CERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu CERIAS Tech Report 2003-15 EFFICIENT PARALLEL ALGORITHMS FOR PLANAR t-graphs by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daecu Center for Education and Reearch in Information Aurance and Security,

More information

Handling missing data for indicators, Susanne Rässler 1

Handling missing data for indicators, Susanne Rässler 1 Handling Missing Data for Indicators Susanne Rässler Institute for Employment Research & Federal Employment Agency Nürnberg, Germany First Workshop on Indicators in the Knowledge Economy, Tübingen, 3-4

More information

SLA Adaptation for Service Overlay Networks

SLA Adaptation for Service Overlay Networks SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada

More information

Research on Star Image Noise Filtering Based on Diffusion Model of Regularization Influence Function

Research on Star Image Noise Filtering Based on Diffusion Model of Regularization Influence Function 016 Sith International Conference on Intrumentation & Meaurement Computer Communication and Control Reearch on Star Image Noie Filtering Baed on Diffuion Model of Regularization Influence Function SunJianming

More information

Modeling the Effect of Mobile Handoffs on TCP and TFRC Throughput

Modeling the Effect of Mobile Handoffs on TCP and TFRC Throughput Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,

More information

A Multi-objective Genetic Algorithm for Reliability Optimization Problem

A Multi-objective Genetic Algorithm for Reliability Optimization Problem International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR

More information

Floating Point CORDIC Based Power Operation

Floating Point CORDIC Based Power Operation Floating Point CORDIC Baed Power Operation Kazumi Malhan, Padmaja AVL Electrical and Computer Engineering Department School of Engineering and Computer Science Oakland Univerity, Rocheter, MI e-mail: kmalhan@oakland.edu,

More information