Using mixture covariance matrices to improve face and facial expression recognitions

Size: px
Start display at page:

Download "Using mixture covariance matrices to improve face and facial expression recognitions"

Transcription

1 Pattern Recognton Letters 24 (2003) Usng mxture covarance matrces to mprove face and facal expresson recogntons Carlos E. Thomaz a, *, Duncan F. Glles a, Raul Q. Fetosa b a Department of Computng, Imperal College London, 180 Queen s Gate, London SW7 2BZ, UK b Department of Electrcal Engneerng, Catholc Unversty of Ro de Janero, r. Marques de Sao Vcente 225, Ro de Janero , Brazl Abstract In several pattern recognton problems, partcularly n mage recognton ones, there are often a large number of features avalable, but the number of tranng examples for each pattern s sgnfcantly less than the dmenson of the feature space. Ths statement mples that the sample group covarance matrces often used n the Gaussan maxmum probablty classfer are sngular. A common soluton to ths problem s to assume that all groups have equal covarance matrces and to use as ther estmates the pooled covarance matrx calculated from the whole tranng set. Ths paper uses an alternatve estmate for the sample group covarance matrces, here called the mxture covarance, gven by an approprate lnear combnaton of the sample group and pooled covarance matrces. Experments were carred out to evaluate the performance of ths method n two bometrc classfcaton applcatons: face and facal expresson. The average recognton rates obtaned by usng the mxture covarance matrces were hgher than the usual estmates. Ó 2003 Elsever Scence B.V. All rghts reserved. Keywords: Face recognton; Facal expresson recognton; Gaussan maxmum probablty classfer; Mxture covarance matrx 1. Introducton A crtcal ssue for the Gaussan maxmum probablty classfer s the nverse of the sample group covarance matrces. Snce n practce these matrces are not known, estmates must be computed based on the observatons (pattern examples) avalable n a tranng set. In some applcatons, however, there are often a large * Correspondng author. E-mal addresses: cet@doc.c.ac.uk (C.E. Thomaz), dfg@ doc.c.ac.uk (D.F. Glles), raul@ele.puc-ro.br (R.Q. Fetosa). number of features avalable, but the number of tranng examples for each group s lmted and sgnfcantly less than the dmenson of the feature space. Ths mples that the sample group covarance matrces wll be sngular. Ths problem, whch s called a small sample sze problem (Fukunaga, 1990), s qute common n pattern recognton, partcularly n mage recognton where the number of features s very large. One way to overcome ths problem s to assume that all groups have equal covarance matrces and to use as ther estmates the weghtng average of each sample group covarance matrx, /03/$ - see front matter Ó 2003 Elsever Scence B.V. All rghts reserved. do: /s (03)

2 2160 C.E. Thomaz et al. / Pattern Recognton Letters 24 (2003) gven by the pooled covarance matrx calculated from the whole tranng set. The am of ths work s to nvestgate another estmate for the sample group covarance matrces, here called mxture covarance matrces, gven by a lnear combnaton of the sample group covarance matrx and the pooled covarance matrx. The mxture covarance matrces are based on the Hoffbeck and Landgrebe (1996) approach and have the property of havng the same rank as the pooled estmate, whle allowng a dfferent estmate for each group. Thus, the mxture estmate may result n hgher accuracy. In order to evaluate ths approach, two bometrc applcatons were consdered: face recognton and facal expresson recognton. The evaluaton used dfferent mage databases for each applcaton. A probablstc model was used to combne the well-known dmensonalty reducton technque called prncpal component analyss (PCA) and the Gaussan maxmum probablty classfer, and n ths way we could nvestgate the performance of the mxture covarance matrces on the recognton tasks referred to above. Experments carred out show that the mxture covarance estmates attaned the best performance n both applcatons. 2. Dmensonalty reducton In bometrc applcatons, the number of tranng samples s lmted and usually sgnfcantly less than the number of pxels of each mage. Thus the hgh-dmensonal space s very sparsely represented; makng the parameter estmaton qute dffcult a problem that s called the curse of dmensonalty (e.g., Bshop, 1997). One of the most successful approaches to the problem of creatng a low dmensonal mage representaton s based on PCA. PCA generates a set of orthonormal bass vectors, known as prncpal components, whch mnmzes the mean square reconstructon error and descrbes major varatons n the whole tranng set consdered. Instead of analysng the maxmum probablty classfer drectly on the face or facal expresson mages, PCA s appled frst to provde dmensonalty reducton. Many researchers have confrmed that the PCA representaton has good generalzaton ablty especally when the dstrbutons of each class are separated by the mean dfference (Krby and Srovch, 1990; Turk and Pentland, 1991; Zhao et al., 1998; Lu and Wechsler, 2000). However, even after reducton the feature space s stll often of hgher dmenson than the number of tranng samples. 3. Maxmum probablty classfer The basc problem n the decson theoretc methods for pattern recognton conssts of fndng a set of g dscrmnantfunctonsd 1 ðxþ; d 2 ðxþ;...; d g ðxþ, where g s the number of groups or classes, wth the decson rule such that f the p-dmensonal pattern vector x belongs to the class (1 6 6 g), then d ðxþ P d j ðxþ, for all 6¼ j and 1 6 j 6 g. The Bayes classfer desgned to maxmze the total probablty of correct classfcaton, where equal pror probabltes for all groups are assumed, corresponds to a set of dscrmnant functons equal to the correspondng probablty densty functons, that s, d ðxþ ¼f ðxþ for all classes (Johnson and Wchern, 1998). The most common probablty densty functon appled to pattern recognton systems s based on the Gaussan multvarate dstrbuton d ðxþ¼f ðxjl ;R Þ 1 ¼ exp 1 ð2pþ p=2 1=2 jr j 2 ðx l Þ T R 1 ðx l Þ ; ð1þ where l and R are the class populaton mean vector and covarance matrx respectvely. The notaton jj denotes the determnant of a matrx. In practce, however, the true values of the mean and the covarance matrx are seldom known and must be estmated from tranng samples. The mean s estmated by the usual sample mean l x ¼ 1 k X k x ;j ; ð2þ where x ;j s observaton j from class, and k s the number of tranng observatons from class. The

3 C.E. Thomaz et al. / Pattern Recognton Letters 24 (2003) covarance matrx s commonly estmated by the sample group covarance matrx defned as R S ¼ 1 X k ðx ;j x Þðx ;j x Þ T : ðk 1Þ ð3þ If we replace the true values of the mean and the covarance matrx n Eq. (1) by ther respectve estmates, the Bayes decson rule acheves optmal classfcaton accuracy only when the number of tranng samples ncreases toward nfnty (e.g., Hoffbeck and Landgrebe, 1996). In fact for p-dmensonal patterns the sample covarance matrx s sngular f less than p þ 1 ndependent tranng examples from each class are avalable, that s, the sample covarance matrx cannot be calculated f k s less than the dmenson of the feature space. One method routnely appled to solve ths problem s to assume that all classes have equal covarance matrces, and to use as ther estmates the pooled covarance matrx. Ths covarance matrx s a weghtng average of each sample group covarance matrx and, assumng that all classes have the same number of tranng observatons, s gven by S pooled ¼ 1 g X g ¼1 S : ð4þ Snce more observatons are taken to calculate the pooled covarance matrx S pooled, ths one wll potentally have a hgher rank than S and wll be eventually full rank. Although the pooled estmate does provde a soluton for the algebrac problem arsng from the nsuffcent number of tranng observatons n each group, S pooled s theoretcally a consstent estmator of the true covarance matrces only when R 1 ¼ R 2 ¼¼R g Defnton The mxture covarance matrx s a lnear combnaton between the pooled covarance matrx S pooled and the sample covarance matrx of one class S. It s gven by S mx ðw Þ¼w S pooled þð1 w ÞS ; ð5þ where the mxture parameter w takes on values 0 < w 6 1 and s dfferent for each class. Ths parameter controls the degree of shrnkage of the sample group covarance matrx estmates toward the pooled one. Fg. 1 llustrates the geometrc dea of the mxture covarance matrx on a two-dmensonal feature space contanng three hypothetcal classes. The constant probablty denstes contours of S and S pooled are represented by the dashed and dotted gray ellpses respectvely. The mxture covarance estmates assume that the ellpses correspondng to the true covarance matrces are placed somewhere n between S and S pooled contours, as shown by the sold black ellpses. Each S mx matrx has the mportant property of admttng an nverse f the pooled estmate S pooled does so (Magnus and Neudecker, 1999, pp ). Ths mples that f the pooled estmate s nonsngular and the mxture parameter takes on values w > 0, then the S mx wll be non-sngular. Therefore the remanng queston s: what s the value of the w that gves a relevant lnear mxture between the pooled and sample covarance x 2 4. Mxture covarance matrx The choce between the sample group covarance matrx and the pooled covarance one represents a lmted set of estmates for the true covarance matrx. A more flexble set can be obtaned usng the mxture covarance matrx. Fg. 1. Geometrc dea of the mxture covarance matrx. x 1

4 2162 C.E. Thomaz et al. / Pattern Recognton Letters 24 (2003) estmates? A method that determnes an approprate value of the mxture parameter s descrbed n the next secton The mxture parameter Accordng to Hoffbeck and Landgrebe (1996), the value of the mxture parameter w can be approprately selected so that a best ft to the tranng samples s acheved. Ther technque s based on the leave-one-out-lkelhood (L) parameter estmaton (Fukunaga, 1990). In the L method, one observaton of the class tranng set s removed and the mean and covarance matrx from the remanng k 1 examples s estmated. After that the lkelhood of the excluded sample s calculated gven the prevous mean and covarance matrx estmates. Ths operaton s repeated a further k 1 tmes and the average log lkelhood s computed over all the k observatons. The strategy s to evaluate several dfferent values of w n the range 0 < w 6 1, and then choose w that maxmzes the average log lkelhood. The mean of class wthout observaton r may be computed as x nr ¼ 1 ðk 1Þ " X k! x ;j x ;r #: ð6þ " L ðw Þ¼ 1 X k h # ln f x ;r jx nr ; S mx nr k ðw Þ ; ð9þ r¼1 where f ðx ;r jx nr ; Snr mxðw ÞÞ s the Gaussan probablty functon defned n Eq. (1) wth x nr mean vector and Snr mxðw Þ covarance matrx defned as S mx nr ðw Þ¼w S poolednr þð1 w ÞS nr : ð10þ As Hoffbeck and Landgrebe (1996) ponted out, ths approach, f mplemented n a straghtforward way, would requre computng the nverse and determnant of the Snr mxðw Þ for each tranng sample. Snce the Snr mxðw Þ s a p by p matrx and p s typcally a large number, ths computaton would be qute expensve. However, they showed that t s possble to sgnfcantly reduce the requred computaton by usng the Sherman Morrson Woodbury formula (Golub and Van Loan, 1989, p. 51) gven by ða þ uu T Þ 1 ¼ A 1 A 1 uu T A 1 1 þ u T A 1 u : ð11þ where A s a n by n matrx and u s a n by 1 vector. Ths allowed them to wrte the log lkelhood of the excluded samples n an analogous form as follows: h ln f x ;r jx nr ; S mx nr ðw Þ The notaton n r conforms to the Hoffbeck and Landgrebe (1996) work. It ndcates that the correspondng quantty s calculated wth the rth observaton from class removed. Followng the same dea, the sample covarance matrx and the pooled covarance matrx of class wthout observaton r are S nr ¼ S poolednr 1 ðk 2Þ " X k ðx ;j x nr Þðx ;j x nr Þ T! ðx ;r x nr Þðx ;r x nr Þ T #; ð7þ ¼ 1 g " X g! S j S þ S nr #: ð8þ Thus the average log lkelhood of the excluded observatons can be calculated as follows: ¼ p 2 lnð2pþ 1 ln jqjð1 2 ½ vdþš 1 2 k d 2 k 1 1 vd where Q ¼ ð1 w Þ ðk 1Þ ðk 2Þ þ w 1 gðk 2Þ ; ð12þ S þ w S pooled ; ð13þ k v ¼ ðk 1Þðk 2Þ 1 ðg 1Þ w ; ð14þ g d ¼ðx ;r x Þ T Q 1 ðx ;r x Þ: ð15þ Fnally, when the parameter w s selected, the mxture covarance matrx estmate defned n Eq. (5) s calculated usng all the tranng examples and replaced nto the maxmum probablty classfer.

5 C.E. Thomaz et al. / Pattern Recognton Letters 24 (2003) Experments Two bometrc experments wth two dfferent databases were performed. In the face recognton experment the olvett face database (ORL) contanng ten mages for each of 40 ndvduals, a total of 400 mages, were used. The Tohoku Unversty has provded the database for the facal expresson experment. Ths database s composed of 193 mages of expressons posed by nne Japanese females (Lyons et al., 1999). Each person posed three or four examples of each sx fundamental facal expresson: anger, dsgust, fear, happness, sadness and surprse. The database has at least 29 mages for each fundamental facal expresson. For mplementaton convenence all mages were frst reszed to pxels. The experments were carred out as follows. Frst PCA reduces the dmensonalty of the orgnal mages and secondly the Gaussan maxmum probablty classfer usng one out of the three covarance estmates S (or Sgroup), S pooled (or Spooled) and S mx (or Smx) was appled. Each experment was repeated 25 tmes usng several PCA dmensons. Dstnct tranng and test sets were randomly drawn, and the mean and standard devaton of the recognton rate were calculated. The face recognton classfcaton was computed usng for each ndvdual fve mages to tran and fve mages to test. In the facal expresson recognton, the tranng and test sets were respectvely composed of 20 and 9 mages. The sze of the mxture parameter (0 < w 6 1) optmsaton range was taken to be 20, that s w ¼½0:05; 0:10; 0:15;...; 1Š. 6. Results Tables 1 and 2 present the tranng and test average recognton rates (wth standard devatons) of the face and facal expresson databases, respectvely, over the dfferent PCA dmensons. Also the optmsed mxture parameters w over the common PCA components of both applcatons are shown n Table 3. Snce only fve mages of each ndvdual were used to form the face recognton tranng set, the results relatve to the sample group covarance estmate were lmted to four PCA components. Table 1 shows that n all but one experment the S mx (or Smx) estmate led to hgher accuracy than ether the pooled or the sample group covarance matrces. In terms of how senstve the mxture covarance results were to the choce of the tranng and test sets, t s far to say that the S mx standard devatons were smlar to the pooled estmate. Table 2 shows the results of the facal expresson recognton. For more than 20 components when the sample group covarance estmate became sngular, the mxture covarance estmate reached hgher recognton rates than the pooled covarance estmate. Agan, regardng the computed standard devatons, the S mx estmate showed to be as senstve to the choce of the tranng and test sets as the other two estmates. Table 1 Face recognton results PCA Sgroup Spooled Smx components Tranng Test Tranng Test Tranng Test (0.4) 51.6 (4.4) 73.3 (3.1) 59.5 (3.0) 90.1 (2.1) 70.8 (3.2) (1.2) 88.4 (1.4) 99.4 (0.5) 92.0 (1.5) (0.6) 91.8 (1.8) (0.1) 94.5 (1.7) (0.2) 94.7 (1.7) (0.0) 95.9 (1.5) (0.0) 95.4 (1.5) (0.0) 96.2 (1.6) (0.0) 95.7 (1.2) (0.0) 96.4 (1.5) (0.0) 95.0 (1.6) (0.0) 95.8 (1.6) (0.0) 94.9 (1.6) (0.0) 95.4 (1.6)

6 2164 C.E. Thomaz et al. / Pattern Recognton Letters 24 (2003) Table 2 Facal expresson recognton results PCA Sgroup Spooled Smx components Tranng Test Tranng Test Tranng Test (4.2) 20.6 (3.9) 32.3 (3.0) 21.6 (3.8) 34.9 (3.3) 21.3 (4.1) (3.6) 38.8 (5.6) 49.6 (3.9) 26.5 (6.8) 58.5 (3.7) 27.9 (5.6) (0.5) 64.3 (6.4) 69.1 (3.6) 44.4 (5.3) 82.9 (2.9) 49.7 (7.7) (2.6) 55.9 (7.7) 91.4 (2.8) 61.3 (7.1) (2.8) 64.9 (6.9) 94.8 (2.2) 68.3 (5.1) (1.7) 70.1 (7.8) 96.8 (1.3) 72.3 (6.2) (1.7) 72.0 (7.4) 97.7 (1.1) 75.6 (5.5) (1.4) 75.6 (7.1) 98.3 (1.1) 77.2 (5.7) (1.3) 78.4 (6.5) 98.6 (0.8) 79.1 (5.4) (1.0) 79.4 (5.8) 99.2 (0.7) 81.0 (6.6) (0.9) 81.6 (6.6) 99.5 (0.6) 82.8 (6.3) (0.8) 82.1 (5.9) 99.6 (0.6) 83.6 (7.2) (0.6) 83.3 (5.5) 99.8 (0.4) 84.5 (6.2) Table 3 The average (wth standard devatons) of the optmum mxture parameters PCA Lnear mxture parameter components Face Facal expresson (0.25) 0.76 (0.19) (0.21) 0.49 (0.15) (0.18) 0.56 (0.15) (0.16) 0.67 (0.15) (0.13) 0.77 (0.11) (0.11) 0.85 (0.09) Another result revealed by these experments s related to the optmum mxture parameters w. Table 3 shows the average (wth standard devatons) of the selected mxture parameter w over the common face and facal expresson PCA components. It can be seen that as the dmenson of the feature space ncreases, the average and standard devaton of the mxture parameter w n all but one experment ncreases and decreases respectvely, makng the mxture covarance of each class (S mx ) more smlar to the pooled covarance (S pooled ) than the sample group one (S ). Although ths behavour depends on the applcatons consdered, t suggests that n both pre-processed mage classfcaton tasks the sparseness of the sample group covarance matrx could nfluence ts lnear combnaton to the pooled covarance matrx. In other words, t seems that when the group sample szes are small compared wth the dmenson of the feature space, the pooled nformaton s more relable than that provded sparsely by each group. Research s currently beng done n order to understand and prove ths behavour under certan constrants (Thomaz et al., 2001, 2002). 7. Conclusons Ths paper used an estmate for the sample group covarance matrces, here called mxture covarance matrces, gven by an approprate lnear combnaton of the sample group covarance matrx and the pooled covarance one. The mxture covarance matrces have the same rank as the pooled estmate, whle allowng a dfferent estmate for each group. Extensve experments were carred out to evaluate ths approach on two bometrc recognton tasks: face recognton and facal expresson recognton. A Gaussan maxmum probablty classfer was bult usng the mxture estmate and the typcal sample group and pooled estmates. In both tasks the mxture covarance estmate acheved the hghest classfcaton performance. Regardng the senstvty to the choce of the tranng and test sets, the mxture covarance matrces gave a smlar performance to the other two usual estmates. The experments were carred out usng wellframed mages wthout normalsaton, n order to

7 C.E. Thomaz et al. / Pattern Recognton Letters 24 (2003) compare the performance of the dfferent covarance estmators. We would expect the smlar comparatve results, perhaps wth an overall mprovement n performance, would be obtaned by usng technques such as normalsaton or by ncorporatng other mage features. The results presented n ths work suggested that n both pre-processed mage classfcaton tasks the sparseness of the sample group covarance matrx could nfluence ts lnear combnaton to the pooled covarance matrx. Further work s beng undertaken to study ths relatonshp. Acknowledgements The authors would lke to thank the referees for ther constructve comments whch helped to mprove ths paper. The frst author was partally supported by the Brazlan Government Agency CAPES under the grant no. 1168/99-1. References Bshop, C.M., Neural Networks for Pattern Recognton. Oxford Unversty Press, New York. Fukunaga, K., Introducton to Statstcal Pattern Recognton. Academc Press, Boston. Golub, G.H., Van Loan, C.F., Matrx Computatons. Johns Hopkns Unversty Press, Baltmore. Hoffbeck, J.P., Landgrebe, D.A., Covarance matrx estmaton and classfcaton wth lmted tranng data. IEEE Trans. Pattern Anal. Machne Intell. 18 (7), Johnson, R.A., Wchern, D.W., Appled Multvarate Statstcal Analyss. Prentce Hall, New Jersey. Krby, M., Srovch, L., Applcaton of the Karhunen Loeve procedure for the characterzaton of human faces. IEEE Trans. Pattern Anal. Machne Intell. 12 (1), Lu, C., Wechsler, H., Learnng the face space representaton and recognton. In: Proc. 15th Internat. Conf. on Pattern Recognton, ICPRÕ2000. Lyons, M.J., Budynek, J., Akamatsu, S., Automatc classfcaton of sngle facal mages. IEEE Trans. Pattern Anal. Machne Intell. 21 (12), Magnus, J.R., Neudecker, H., Matrx Dfferental Calculus wth Applcatons n Statstcs and Econometrcs. John Wley & Sons Ltd., Chchester. Thomaz, C.E., Glles, D.F., Fetosa, R.Q., Small sample problem n bayes plug-n classfer for mage recognton. In: Proc. Internat. Conf. on Image and Vson Computng New Zealand. pp Thomaz, C.E., Glles, D.F., Fetosa, R.Q., A new quadratc classfer appled to bometrc recognton. In: Proc. Post-ECCV Workshop on Bometrc Authentcaton, Sprnger-Verlag LNCS 2359, Copenhagen, Denmark, pp Turk, M., Pentland, A., Egenfaces for recognton. J. Cogntve Neurosc. 3, Zhao, W., Chellappa, R., Krshnaswamy, A., Dscrmnant analyss of prncpal components for face recognton. In: Proc. 2nd Internat. Conf. on Automatc Face and Gesture Recognton. pp

L10: Linear discriminants analysis

L10: Linear discriminants analysis L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss

More information

Single and multiple stage classifiers implementing logistic discrimination

Single and multiple stage classifiers implementing logistic discrimination Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,

More information

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching) Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12 14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

CS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements

CS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

Logistic Regression. Steve Kroon

Logistic Regression. Steve Kroon Logstc Regresson Steve Kroon Course notes sectons: 24.3-24.4 Dsclamer: these notes do not explctly ndcate whether values are vectors or scalars, but expects the reader to dscern ths from the context. Scenaro

More information

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

v a 1 b 1 i, a 2 b 2 i,..., a n b n i. SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson

More information

How To Calculate The Accountng Perod Of Nequalty

How To Calculate The Accountng Perod Of Nequalty Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.

More information

Gender Classification for Real-Time Audience Analysis System

Gender Classification for Real-Time Audience Analysis System Gender Classfcaton for Real-Tme Audence Analyss System Vladmr Khryashchev, Lev Shmaglt, Andrey Shemyakov, Anton Lebedev Yaroslavl State Unversty Yaroslavl, Russa vhr@yandex.ru, shmaglt_lev@yahoo.com, andrey.shemakov@gmal.com,

More information

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL

More information

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble

More information

Hallucinating Multiple Occluded CCTV Face Images of Different Resolutions

Hallucinating Multiple Occluded CCTV Face Images of Different Resolutions In Proc. IEEE Internatonal Conference on Advanced Vdeo and Sgnal based Survellance (AVSS 05), September 2005 Hallucnatng Multple Occluded CCTV Face Images of Dfferent Resolutons Ku Ja Shaogang Gong Computer

More information

How To Know The Components Of Mean Squared Error Of Herarchcal Estmator S

How To Know The Components Of Mean Squared Error Of Herarchcal Estmator S S C H E D A E I N F O R M A T I C A E VOLUME 0 0 On Mean Squared Error of Herarchcal Estmator Stans law Brodowsk Faculty of Physcs, Astronomy, and Appled Computer Scence, Jagellonan Unversty, Reymonta

More information

Implementation of Deutsch's Algorithm Using Mathcad

Implementation of Deutsch's Algorithm Using Mathcad Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"

More information

Fault tolerance in cloud technologies presented as a service

Fault tolerance in cloud technologies presented as a service Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance

More information

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optimal Control of a Cascade of Hydro-Electric Power Stations On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

More information

Number of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35,000 100,000 2 2,200,000 60,000 350,000

Number of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35,000 100,000 2 2,200,000 60,000 350,000 Problem Set 5 Solutons 1 MIT s consderng buldng a new car park near Kendall Square. o unversty funds are avalable (overhead rates are under pressure and the new faclty would have to pay for tself from

More information

Modelling high-dimensional data by mixtures of factor analyzers

Modelling high-dimensional data by mixtures of factor analyzers Computatonal Statstcs & Data Analyss 41 (2003) 379 388 www.elsever.com/locate/csda Modellng hgh-dmensonal data by mxtures of factor analyzers G.J. McLachlan, D. Peel, R.W. Bean Department of Mathematcs,

More information

Statistical Methods to Develop Rating Models

Statistical Methods to Develop Rating Models Statstcal Methods to Develop Ratng Models [Evelyn Hayden and Danel Porath, Österrechsche Natonalbank and Unversty of Appled Scences at Manz] Source: The Basel II Rsk Parameters Estmaton, Valdaton, and

More information

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Research Note APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES * Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

1. Measuring association using correlation and regression

1. Measuring association using correlation and regression How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

Support vector domain description

Support vector domain description Pattern Recognton Letters 20 (1999) 1191±1199 www.elsever.nl/locate/patrec Support vector doman descrpton Davd M.J. Tax *,1, Robert P.W. Dun Pattern Recognton Group, Faculty of Appled Scence, Delft Unversty

More information

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features On-Lne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com

More information

Learning from Multiple Outlooks

Learning from Multiple Outlooks Learnng from Multple Outlooks Maayan Harel Department of Electrcal Engneerng, Technon, Hafa, Israel She Mannor Department of Electrcal Engneerng, Technon, Hafa, Israel maayanga@tx.technon.ac.l she@ee.technon.ac.l

More information

SIMPLE LINEAR CORRELATION

SIMPLE LINEAR CORRELATION SIMPLE LINEAR CORRELATION Smple lnear correlaton s a measure of the degree to whch two varables vary together, or a measure of the ntensty of the assocaton between two varables. Correlaton often s abused.

More information

Descriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications

Descriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications CMSC828G Prncples of Data Mnng Lecture #9 Today s Readng: HMS, chapter 9 Today s Lecture: Descrptve Modelng Clusterng Algorthms Descrptve Models model presents the man features of the data, a global summary

More information

Study on Model of Risks Assessment of Standard Operation in Rural Power Network

Study on Model of Risks Assessment of Standard Operation in Rural Power Network Study on Model of Rsks Assessment of Standard Operaton n Rural Power Network Qngj L 1, Tao Yang 2 1 Qngj L, College of Informaton and Electrcal Engneerng, Shenyang Agrculture Unversty, Shenyang 110866,

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

Section 5.4 Annuities, Present Value, and Amortization

Section 5.4 Annuities, Present Value, and Amortization Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

More information

Data Visualization by Pairwise Distortion Minimization

Data Visualization by Pairwise Distortion Minimization Communcatons n Statstcs, Theory and Methods 34 (6), 005 Data Vsualzaton by Parwse Dstorton Mnmzaton By Marc Sobel, and Longn Jan Lateck* Department of Statstcs and Department of Computer and Informaton

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network 700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School

More information

Risk Model of Long-Term Production Scheduling in Open Pit Gold Mining

Risk Model of Long-Term Production Scheduling in Open Pit Gold Mining Rsk Model of Long-Term Producton Schedulng n Open Pt Gold Mnng R Halatchev 1 and P Lever 2 ABSTRACT Open pt gold mnng s an mportant sector of the Australan mnng ndustry. It uses large amounts of nvestments,

More information

Staff Paper. Farm Savings Accounts: Examining Income Variability, Eligibility, and Benefits. Brent Gloy, Eddy LaDue, and Charles Cuykendall

Staff Paper. Farm Savings Accounts: Examining Income Variability, Eligibility, and Benefits. Brent Gloy, Eddy LaDue, and Charles Cuykendall SP 2005-02 August 2005 Staff Paper Department of Appled Economcs and Management Cornell Unversty, Ithaca, New York 14853-7801 USA Farm Savngs Accounts: Examnng Income Varablty, Elgblty, and Benefts Brent

More information

Performance Analysis and Coding Strategy of ECOC SVMs

Performance Analysis and Coding Strategy of ECOC SVMs Internatonal Journal of Grd and Dstrbuted Computng Vol.7, No. (04), pp.67-76 http://dx.do.org/0.457/jgdc.04.7..07 Performance Analyss and Codng Strategy of ECOC SVMs Zhgang Yan, and Yuanxuan Yang, School

More information

Brigid Mullany, Ph.D University of North Carolina, Charlotte

Brigid Mullany, Ph.D University of North Carolina, Charlotte Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte

More information

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput. J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n

More information

How To Create An Emoton Recognzer

How To Create An Emoton Recognzer Recognzng Low/Hgh Anger n Speech for Call Centers FU-MING LEE*, LI-HUA LI, RU-YI HUANG Department of Informaton Management Chaoyang Unversty of Technology 168 Jfong E. Rd., Wufong Townshp Tachung County,

More information

Fast Fuzzy Clustering of Web Page Collections

Fast Fuzzy Clustering of Web Page Collections Fast Fuzzy Clusterng of Web Page Collectons Chrstan Borgelt and Andreas Nürnberger Dept. of Knowledge Processng and Language Engneerng Otto-von-Guercke-Unversty of Magdeburg Unverstätsplatz, D-396 Magdeburg,

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008

Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008 Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn

More information

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EK-MUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan

More information

Learning from Large Distributed Data: A Scaling Down Sampling Scheme for Efficient Data Processing

Learning from Large Distributed Data: A Scaling Down Sampling Scheme for Efficient Data Processing Internatonal Journal of Machne Learnng and Computng, Vol. 4, No. 3, June 04 Learnng from Large Dstrbuted Data: A Scalng Down Samplng Scheme for Effcent Data Processng Che Ngufor and Janusz Wojtusak part

More information

Ring structure of splines on triangulations

Ring structure of splines on triangulations www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon

More information

Sketching Sampled Data Streams

Sketching Sampled Data Streams Sketchng Sampled Data Streams Florn Rusu, Aln Dobra CISE Department Unversty of Florda Ganesvlle, FL, USA frusu@cse.ufl.edu adobra@cse.ufl.edu Abstract Samplng s used as a unversal method to reduce the

More information

Imperial College London

Imperial College London F. Fang 1, C.C. Pan 1, I.M. Navon 2, M.D. Pggott 1, G.J. Gorman 1, P.A. Allson 1 and A.J.H. Goddard 1 1 Appled Modellng and Computaton Group Department of Earth Scence and Engneerng Imperal College London,

More information

PRIVATE SCHOOL CHOICE: THE EFFECTS OF RELIGIOUS AFFILIATION AND PARTICIPATION

PRIVATE SCHOOL CHOICE: THE EFFECTS OF RELIGIOUS AFFILIATION AND PARTICIPATION PRIVATE SCHOOL CHOICE: THE EFFECTS OF RELIIOUS AFFILIATION AND PARTICIPATION Danny Cohen-Zada Department of Economcs, Ben-uron Unversty, Beer-Sheva 84105, Israel Wllam Sander Department of Economcs, DePaul

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

Lecture 5,6 Linear Methods for Classification. Summary

Lecture 5,6 Linear Methods for Classification. Summary Lecture 5,6 Lnear Methods for Classfcaton Rce ELEC 697 Farnaz Koushanfar Fall 2006 Summary Bayes Classfers Lnear Classfers Lnear regresson of an ndcator matrx Lnear dscrmnant analyss (LDA) Logstc regresson

More information

Interpreting Patterns and Analysis of Acute Leukemia Gene Expression Data by Multivariate Statistical Analysis

Interpreting Patterns and Analysis of Acute Leukemia Gene Expression Data by Multivariate Statistical Analysis Interpretng Patterns and Analyss of Acute Leukema Gene Expresson Data by Multvarate Statstcal Analyss ChangKyoo Yoo * and Peter A. Vanrolleghem BIOMATH, Department of Appled Mathematcs, Bometrcs and Process

More information

Dynamic Pricing for Smart Grid with Reinforcement Learning

Dynamic Pricing for Smart Grid with Reinforcement Learning Dynamc Prcng for Smart Grd wth Renforcement Learnng Byung-Gook Km, Yu Zhang, Mhaela van der Schaar, and Jang-Won Lee Samsung Electroncs, Suwon, Korea Department of Electrcal Engneerng, UCLA, Los Angeles,

More information

Feasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid

Feasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid Feasblty of Usng Dscrmnate Prcng Schemes for Energy Tradng n Smart Grd Wayes Tushar, Chau Yuen, Bo Cha, Davd B. Smth, and H. Vncent Poor Sngapore Unversty of Technology and Desgn, Sngapore 138682. Emal:

More information

Mixtures of Factor Analyzers with Common Factor Loadings for the Clustering and Visualisation of High-Dimensional Data

Mixtures of Factor Analyzers with Common Factor Loadings for the Clustering and Visualisation of High-Dimensional Data Mxtures of Factor Analyzers wth Common Factor Loadngs for the Clusterng and Vsualsaton of Hgh-Dmensonal Data Jangsun Baek 1 and Geoffrey J. McLachlan 2 1 Department of Statstcs, Chonnam Natonal Unversty,

More information

Conversion between the vector and raster data structures using Fuzzy Geographical Entities

Conversion between the vector and raster data structures using Fuzzy Geographical Entities Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,

More information

An interactive system for structure-based ASCII art creation

An interactive system for structure-based ASCII art creation An nteractve system for structure-based ASCII art creaton Katsunor Myake Henry Johan Tomoyuk Nshta The Unversty of Tokyo Nanyang Technologcal Unversty Abstract Non-Photorealstc Renderng (NPR), whose am

More information

Design and Development of a Security Evaluation Platform Based on International Standards

Design and Development of a Security Evaluation Platform Based on International Standards Internatonal Journal of Informatcs Socety, VOL.5, NO.2 (203) 7-80 7 Desgn and Development of a Securty Evaluaton Platform Based on Internatonal Standards Yuj Takahash and Yoshm Teshgawara Graduate School

More information

Mining Feature Importance: Applying Evolutionary Algorithms within a Web-based Educational System

Mining Feature Importance: Applying Evolutionary Algorithms within a Web-based Educational System Mnng Feature Importance: Applyng Evolutonary Algorthms wthn a Web-based Educatonal System Behrouz MINAEI-BIDGOLI 1, and Gerd KORTEMEYER 2, and Wllam F. PUNCH 1 1 Genetc Algorthms Research and Applcatons

More information

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION

More information

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background: SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and

More information

Analysis of Premium Liabilities for Australian Lines of Business

Analysis of Premium Liabilities for Australian Lines of Business Summary of Analyss of Premum Labltes for Australan Lnes of Busness Emly Tao Honours Research Paper, The Unversty of Melbourne Emly Tao Acknowledgements I am grateful to the Australan Prudental Regulaton

More information

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management

More information

Software project management with GAs

Software project management with GAs Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de

More information

Person Re-identification by Probabilistic Relative Distance Comparison

Person Re-identification by Probabilistic Relative Distance Comparison Person Re-dentfcaton by Probablstc Relatve Dstance Comparson We-Sh Zheng 1,2, Shaogang Gong 2, and Tao Xang 2 1 School of Informaton Scence and Technology, Sun Yat-sen Unversty, Chna 2 School of Electronc

More information

Stochastic Protocol Modeling for Anomaly Based Network Intrusion Detection

Stochastic Protocol Modeling for Anomaly Based Network Intrusion Detection Stochastc Protocol Modelng for Anomaly Based Network Intruson Detecton Juan M. Estevez-Tapador, Pedro Garca-Teodoro, and Jesus E. Daz-Verdejo Department of Electroncs and Computer Technology Unversty of

More information

ONE of the most crucial problems that every image

ONE of the most crucial problems that every image IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 23, NO. 10, OCTOBER 2014 4413 Maxmum Margn Projecton Subspace Learnng for Vsual Data Analyss Symeon Nktds, Anastasos Tefas, Member, IEEE, and Ioanns Ptas, Fellow,

More information

Estimating the Number of Clusters in Genetics of Acute Lymphoblastic Leukemia Data

Estimating the Number of Clusters in Genetics of Acute Lymphoblastic Leukemia Data Journal of Al Azhar Unversty-Gaza (Natural Scences), 2011, 13 : 109-118 Estmatng the Number of Clusters n Genetcs of Acute Lymphoblastc Leukema Data Mahmoud K. Okasha, Khaled I.A. Almghar Department of

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,

More information

PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

More information

An Evaluation of the Extended Logistic, Simple Logistic, and Gompertz Models for Forecasting Short Lifecycle Products and Services

An Evaluation of the Extended Logistic, Simple Logistic, and Gompertz Models for Forecasting Short Lifecycle Products and Services An Evaluaton of the Extended Logstc, Smple Logstc, and Gompertz Models for Forecastng Short Lfecycle Products and Servces Charles V. Trappey a,1, Hsn-yng Wu b a Professor (Management Scence), Natonal Chao

More information

A Probabilistic Theory of Coherence

A Probabilistic Theory of Coherence A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

More information

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered

More information

NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING. Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582

NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING. Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582 NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582 7. Root Dynamcs 7.2 Intro to Root Dynamcs We now look at the forces requred to cause moton of the root.e. dynamcs!!

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

Exhaustive Regression. An Exploration of Regression-Based Data Mining Techniques Using Super Computation

Exhaustive Regression. An Exploration of Regression-Based Data Mining Techniques Using Super Computation Exhaustve Regresson An Exploraton of Regresson-Based Data Mnng Technques Usng Super Computaton Antony Daves, Ph.D. Assocate Professor of Economcs Duquesne Unversty Pttsburgh, PA 58 Research Fellow The

More information

ESTABLISHING TRADE-OFFS BETWEEN SUSTAINED AND MOMENTARY RELIABILITY INDICES IN ELECTRIC DISTRIBUTION PROTECTION DESIGN: A GOAL PROGRAMMING APPROACH

ESTABLISHING TRADE-OFFS BETWEEN SUSTAINED AND MOMENTARY RELIABILITY INDICES IN ELECTRIC DISTRIBUTION PROTECTION DESIGN: A GOAL PROGRAMMING APPROACH ESTABLISHIG TRADE-OFFS BETWEE SUSTAIED AD MOMETARY RELIABILITY IDICES I ELECTRIC DISTRIBUTIO PROTECTIO DESIG: A GOAL PROGRAMMIG APPROACH Gustavo D. Ferrera, Arturo S. Bretas, Maro O. Olvera Federal Unversty

More information

How To Understand The Results Of The German Meris Cloud And Water Vapour Product

How To Understand The Results Of The German Meris Cloud And Water Vapour Product Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

Sample Design in TIMSS and PIRLS

Sample Design in TIMSS and PIRLS Sample Desgn n TIMSS and PIRLS Introducton Marc Joncas Perre Foy TIMSS and PIRLS are desgned to provde vald and relable measurement of trends n student achevement n countres around the world, whle keepng

More information

A Fast Incremental Spectral Clustering for Large Data Sets

A Fast Incremental Spectral Clustering for Large Data Sets 2011 12th Internatonal Conference on Parallel and Dstrbuted Computng, Applcatons and Technologes A Fast Incremental Spectral Clusterng for Large Data Sets Tengteng Kong 1,YeTan 1, Hong Shen 1,2 1 School

More information

Abstract. Clustering ensembles have emerged as a powerful method for improving both the

Abstract. Clustering ensembles have emerged as a powerful method for improving both the Clusterng Ensembles: {topchyal, Models jan, of punch}@cse.msu.edu Consensus and Weak Parttons * Alexander Topchy, Anl K. Jan, and Wllam Punch Department of Computer Scence and Engneerng, Mchgan State Unversty

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

Marginal Benefit Incidence Analysis Using a Single Cross-section of Data. Mohamed Ihsan Ajwad and Quentin Wodon 1. World Bank.

Marginal Benefit Incidence Analysis Using a Single Cross-section of Data. Mohamed Ihsan Ajwad and Quentin Wodon 1. World Bank. Margnal Beneft Incdence Analyss Usng a Sngle Cross-secton of Data Mohamed Ihsan Ajwad and uentn Wodon World Bank August 200 Abstract In a recent paper, Lanjouw and Ravallon proposed an attractve and smple

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

A machine vision approach for detecting and inspecting circular parts

A machine vision approach for detecting and inspecting circular parts A machne vson approach for detectng and nspectng crcular parts Du-Mng Tsa Machne Vson Lab. Department of Industral Engneerng and Management Yuan-Ze Unversty, Chung-L, Tawan, R.O.C. E-mal: edmtsa@saturn.yzu.edu.tw

More information

The Mathematical Derivation of Least Squares

The Mathematical Derivation of Least Squares Pscholog 885 Prof. Federco The Mathematcal Dervaton of Least Squares Back when the powers that e forced ou to learn matr algera and calculus, I et ou all asked ourself the age-old queston: When the hell

More information