TrueSkill Through Time: Revisiting the History of Chess


 Lilian McDowell
 1 years ago
 Views:
Transcription
1 TrueSkll Through Tme: Revstng the Hstory of Chess Perre Dangauther INRIA Rhone Alpes Grenoble, France Ralf Herbrch Mcrosoft Research Ltd. Cambrdge, UK Tom Mnka Mcrosoft Research Ltd. Cambrdge, UK Thore Graepel Mcrosoft Research Ltd. Cambrdge, UK Abstract We extend the Bayesan skll ratng system TrueSkll to nfer entre tme seres of sklls of players by smoothng through tme nstead of flterng. The skll of each partcpatng player, say, every year s represented by a latent skll varable whch s affected by the relevant game outcomes that year, and coupled wth the skll varables of the prevous and subsequent year. Inference n the resultng factor graph s carred out by approxmate message passng (EP) along the tme seres of sklls. As before the system tracks the uncertanty about player sklls, explctly models draws, can deal wth any number of competng enttes and can nfer ndvdual sklls from team results. We extend the system to estmate playerspecfc draw margns. Based on these models we present an analyss of the skll curves of mportant players n the hstory of chess over the past 150 years. Results nclude plots of players lfetme skll development as well as the ablty to compare the sklls of dfferent players across tme. Our results ndcate that a) the overall playng strength has ncreased over the past 150 years, and b) that modellng a player s ablty to force a draw provdes sgnfcantly better predctve power. 1 Introducton Compettve games and sports can beneft from statstcal skll ratngs for use n matchmakng as well as for provdng crtera for the admsson to tournaments. From a hstorcal perspectve, skll ratngs also provde nformaton about the general development of skll wthn the dscplne or for a partcular group of nterest. Also, they can gve a fascnatng narratve about the key players n a gven dscplne, allowng a glmpse at ther rse and fall or ther struggle aganst ther contemporares. In order to provde good estmates of the current skll level of players skll ratng systems have tradtonally been desgned as flters that combne a new game outcome wth knowledge about a player s skll from the past to obtan a new estmate. In contrast, when takng a hstorcal vew we would lke to nfer the skll of a player at a gven pont n the past when both ther past as well as ther future achevements are known. The best known such skll flter based ratng system s the Elo system [3] developed by Arpad Elo n 1959 and adopted by the World Chess Federaton FIDE n 1970 [4]. Elo models the 1
2 s probablty of the game outcome as P (1 wns over 2 s 1, s 2 ) := Φ 2 1 s 2 where s 1 and s 2 are the skll ratngs of each player, Φ denotes the cumulatve densty of a zeromean untvarance Gaussan and s the assumed varablty of performance around skll. Denote the game outcomes by y = +1 f player 1 wns, y = 1 f player 2 wns and y = 0 f a draw occurs. Then the resultng (lnearsed) Elo update s gven by s 1 s 1 + y, s 2 s 2 y and = α y + 1 π P (1 wns over 2 s } {{ } 1, s 2 ), 2 K Factor where 0 < α < 1 determnes how much the flter weghs the new evdence versus the old estmate. The TrueSkll ratng system [6] mproves on the Elo system n a number of ways. TrueSkll s current belef about a player s skll s represented by a Gaussan dstrbuton wth mean µ and varance σ 2. As a consequence, TrueSkll does not requre a provsonal ratng perod and converges to the true sklls of players very quckly. Also, n contrast to Elo, TrueSkll explctly models the probablty of draws. Crucally for ts applcaton n the Xbox Lve onlne gamng system (see [6] for detals) t can also nfer sklls from games wth more than two partcpatng enttes and nfers ndvdual players sklls from the outcomes of team games. As a skll ratng and matchmakng system TrueSkll operates as a flter as dscussed above. However, due to ts fully probablstc formulaton t s possble to extend Trueskll to perform smoothng on a tme seres of player sklls. In ths paper we extend TrueSkll to provde accurate estmates of the past skll levels of players at any pont n tme takng nto account both ther past and ther future achevements. We carry out a largescale analyss of about 3.5 mllon games of chess played over the last 150 years. The paper s structured as follows. In Secton 2 we revew prevous work on hstorcal chess ratngs. In Secton 3 we present two models for hstorcal ratngs through tme, one assumng a fxed draw margn and one estmatng the draw margn per player per year. We ndcate how large scale approxmate message passng (EP) can be used to effcently perform nference n these huge models. In Secton 4 we present expermental results on a huge data set from ChessBase wth over 3.5 mllon games and gan some fascnatng chess specfc nsghts from the data. 2 Prevous Work on Hstorcal Chess Ratngs Estmatng players sklls n retrospectve allows one to take nto account more nformaton and hence can be expected to lead to more precse estmates. The poneer n ths feld was Arpad Elo hmself, when he encountered the necessty of ntalzng the skll values of the Elo system when t was frst deployed. To that end he ftted a smooth curve to skll estmates from fveyear perods; however lttle s known about the detals of hs method [3]. Probably best known n the chess communty s the Chessmetrcs system [8], whch ams at mprovng the Elo scores by attemptng to obtan a better ft wth the observed data. Although constructed n a very thoughtful manner, Chessmetrcs s not a statstcally wellfounded method and s a flterng algorthm that dsregards nformaton from future games. The frst approach to the hstorcal ratng problem wth a sold statstcal foundaton was developed by Mark Glckman, charman of the USCF Ratng Commttee. Glcko 1 & 2 [5] are Bayesan ratng systems that address a number of drawbacks of the Elo system whle stll beng based on the BradleyTerry paredcomparson method [1] used by modern Elo. Glckman models sklls as Gaussan varables whose varances ndcate the relablty of the skll estmate, an dea later adopted n the TrueSkll model as well. Glcko 2 adds volatlty measures, ndcatng the degree of expected fluctuaton n a player s ratng. After an ntal estmate past estmatons are smoothed by propagatng nformaton back n tme. The second statstcally well founded approach are Rod Edwards s Edo Hstorcal Chess Ratngs [2], whch are also based on the BradleyTerry model but have been appled only to hstorcal games from the 19th century. In order to model skll dynamcs Edwards consders 2
3 the same player at dfferent tmes as several dstnct players, whose sklls are lnked together by a set of vrtual games whch are assumed to end n draws. Whle Edo ncorporates a dynamcs model va vrtual games and returns uncertanty measures n terms of the estmator s varance t s not a full Bayesan model and provdes nether posteror dstrbutons over sklls, nor does t explctly model draws. In lght of the above prevous work on hstorcal chess ratngs the goal of ths paper s to ntroduce a fully probablstc model of chess ratngs through tme whch explctly accounts for draws and provdes posteror dstrbutons of sklls that reflect the relablty of the estmate at every pont n tme. 3 Models for Rankng through Tme Ths paper strongly bulds on the orgnal TrueSkll paper [6]. Although TrueSkll s applcable to the case of multple team games, we wll only consder the two player case for ths applcaton to chess. It should be clear, however, that the methods presented can equally well be used for games wth any number of teams competng. Consder a game such as chess n whch a number of, say, N players {1,..., N} are competng over a perod of T tme steps, say, years. Denote the seres of game outcomes between two players and j n year t by y t j (k) {+1, 1, 0} where k { 1,..., K t j} denotes the number of game outcomes avalable for that par of players n that year. Furthermore, let y = +1 f player wns, y = 1 f player j wns and y = 0 n case of a draw. 3.1 Vanlla TrueSkll In the Vanlla TrueSkll system, each player s assumed to have an unknown skll s t R at tme t. We assume that a game outcome yt j (k) s generated as follows. For each of the two players and j performances p t j (k) and pt j (k) are drawn accordng to p ( p t j (k) ( ) st = N p t j (k) ; s t, 2). The outcome yj t (k) of the game between players and j s then determned as +1 f p t yj t j (k) > pt j (k) + ε (k) := 1 f p t j (k) > pt j (k) + ε, 0 f p t j (k) p t j (k) ε where the parameter ε > 0 s the draw margn. In order to nfer the unknown sklls s t the TrueSkll model assumes a factorsng Gaussan pror p ( s 0 = N s 0 ; µ 0, σ0) 2 over sklls and a Gaussan drft of sklls between tme steps gven by p ( s t s = N s t ; s, 2). The model can be well descrbed as a factor graph (see Fgure 1, left) whch clarfes the factorsaton assumptons of the model and allows to develop effcent (approxmate) nference algorthms based on message passng (for detals see [6]) In the Vanlla TrueSkll algorthm denotng the wnnng player by W and the losng player by L and droppng the tme ndex for now, approxmate Bayesan nference (Gaussan densty flterng [7]) leads to the followng update equatons for µ W, µ L, σ W and σ L. µ W µ W + σ2 W µw µ L ε v, and σ W σ W 1 σ2 W µw µ L ε c j c j c j c 2 w, j c j c j µ L µ L σ2 L µw µ L ε v, and σ L σ L 1 σ2 L µw µ L ε c j c j c j c 2 w,. j c j c j The overall varance s c 2 j = 22 + σw 2 + σ2 L and the two functons v and w are gven by N (t α; 0, 1) v (t, α) := and w (t, α) := v (t, α) (v (t, α) + (t α)). Φ (t α) For the case of a draw we have the followng update equatons: µ µ + σ2 µ µ ε ṽ, and σ σ 1 σ2 µ µ ε c j c j c j c 2 w,, j c j c j 3
4 and smlarly for player j. Defnng d := α t and s := α + t then ṽ and w are gven by N ( s; 0, 1) N (d; 0, 1) ṽ (t, α) := Φ (d) Φ ( s) and w (t, α) := ṽ 2 (t, α) + (d) N (d; 0, 1) (s) N (s; 0, 1) Φ (d) Φ ( s) In order to approxmate the skll parameters µ t and σt for all players {1,..., N} at all tmes t {0,..., T } the Vanlla TrueSkll algorthm ntalses each skll belef wth µ 0 µ 0 and σ 0 σ 0. It then proceeds through the years t {1... T } n order, goes through the game outcomes yj t (k) n random order and updates the skll belefs accordng to the equatons above. 3.2 TrueSkll through Tme (TTT) The Vanlla TrueSkll algorthm suffers from two major dsadvantages: 1. Inference wthn a gven year t depends on the random order chosen for the updates. Snce no knowledge s assumed about game outcomes wthn a gven year, the results of nference should be ndependent of the order of games wthn a year. 2. Informaton across years s only propagated forward n tme. More concretely, f player A beats player B and player B later turns out to be very strong (.e., as evdenced by hm beatng very strong player C repeatedly), then Vanlla TrueSkll cannot propagate that nformaton backwards n tme to correct player A s skll estmate upwards. Both problems can be addressed by extendng the Gaussan densty flterng to runnng full expectaton propagaton (EP) untl convergence [7]. The basc dea s to update repeatedly on the same game outcomes but makng sure that the effect of the prevous update on that game outcome s removed before the new effect s added. Ths way, the model remans the same but the nferences are less approxmate. More specfcally, we go through the game outcomes yj t wthn a year t several tmes untl convergence. The update for a game outcome yj t (k) s performed n the same way as before but savng the upward messages m f(p t j (k),s (s t ) s t t ) whch descrbe the effect of the updated performance p t j (k) on the underlyng skll st. When game outcome yt j (k) comes up for ( update agan, the new downward message m f(p t j (k),s p t ) p t j (k) t j (k) ) can be calculated by m f(p t j (k),s t ) p t j (k) ( p t j (k) ) = f ( p t j (k), s t ) p (s t ) m f(p t j (k),s (s t ) s t t )dst, thus effectvely dvdng out the earler upward message to avod double countng. The ntegral above s easly evaluated snce the messages as well as the margnals p (s t ) have been assumed Gaussan. The new downward message serves as the effectve pror belef on the performance p t (k). At convergence, the dependency of the nferred sklls on the order of game outcomes vanshes. The second problem s addressed by performng nference for TrueSkll through tme (TTT),.e. by repeatedly smoothng forward and backward n tme. The frst forward pass of TTT s dentcal to the nference pass of Vanlla TrueSkll except that the forward messages m f(s,s (s t ) s t t ) are stored. They represent the nfluence of skll estmate s at tme t 1 on skll estmate s t at tme t. In the backward pass, ( these ) messages are then used to calculate the new backward messages m f(s,s s t ) s, whch effectvely serve as the new pror for tme step t 1, m f(s,s t ) s s = f ( s, s t ) p (s t ) m f(s,s (s t ) s t t )dst. Ths procedure s repeated forward and backward along the tme seres of sklls untl convergence. The backward passes make t possble to propagate nformaton from the future nto the past.. 4
5 s W s L s W s L ε L ε s s j ε j ς ς ς s t W s t L s t W s t L ε t L ε t s t s t j ε t j p W p L p W p L + + p p j + u L u u j d d d d j <0 Fgure 1: Factor graphs of sngle game outcomes for TTT (left) and TTTD. In the left graph there are three types of varables: sklls s, performances p, performance dfferences d. In the TTTD graphs there are two addtonal types: draw margns ε and wnnng thresholds u. The graphs only requre three dfferent types of factors: factor takes the form N ( ;, 2), factor > 0 takes the form I ( > 0) and factor ± takes the form I ( ± = ). 3.3 TTT wth Indvdual Draw Margns (TTTD) From explorng the data t s known that the probablty of draw not only ncreases markedly through the hstory of chess, but s also postvely correlated wth playng skll and even vares consderably across ndvdual players. We would thus lke to extend the TrueSkll model to ncorporate another playerspecfc parameter whch ndcates a player s ablty to force a draw. Suppose each player at every tmestep t s charactersed by an unknown skll s t R and a playerspecfc draw margn εt > 0. Agan, performances pt j (k) and pt j (k) are drawn accordng to p ( p t j (k) ( ) st = N p t j (k) ; s t, 2). In ths model a game outcome yj t (k) between players and j at tme t s generated as follows: +1 f p t yj t j (k) > pt j (k) + εt j (k) = 1 f p t j (k) > pt j (k) + εt 0 f ε t pt j (k) pt j (k) εt j. In addton to the Gaussan assumpton about player sklls as n the Vanlla TrueSkll model of Secton 3.1 we assume a factorsng Gaussan dstrbuton for the playerspecfc draw margns p ε 0 = N ε 0 ; ν 0, ς0 2 and a Gaussan drft of draw margns between tme steps gven by p ( ε t ε = N ε t ; ε, ς 2). The factor graph for the case of wn/loss s shown n Fgure 1 (centre) and for the case of a draw n Fgure 1 (rght). Note, that the postvty of the playerspecfc draw margns at each tme step t s enforced by a factor > 0. Inference n the TTTD model s agan performed by expectaton propagaton, both wthn a gven year t as well as across years n a forward backward manner. Note that n ths model the current belef about the skll of a player s represented by four numbers: µ t and σ t for the skll and νt and ςt for the playerspecfc draw margn. Players wth a hgh value of ν t can be thought of as havng the ablty to acheve a draw aganst strong players, whle players wth a hgh value of µ t have the ablty to acheve a wn. 5
6 x Frequency Year Fgure 2: (Left) Dstrbuton over number of recorded match outcomes played per year n the ChessBase database. (Rght) The logevdence P (y, ) for the TTT model as a functon of the varaton of player performance,, and skll dynamcs,. The maxmzng parameter settngs are ndcated by a black dot. 4 Experments and Results Our experments are based on a dataset of chess match outcomes collected by ChessBase 1. Ths database s the largest topclass annotated database n the world and covers more than 3.5 mllon chess games from 1560 to 2006 played between 200,000 unque players. From ths database, we selected all the matches between 1850 (the brth of modern Chess) and Ths results n 3,505,366 games between 206,059 unque players. Note that a large proporton of games was collected between 1987 and 2006 (see Fgure 2 (left)). Our mplementaton of the TrueSkll through Tme algorthms was done n F# 2 and bulds a factor graph wth approxmately 11,700,000 varables and 15,200,000 factors (TTT) or 18,500,000 varables and 27,600,000 factors (TTTD). The whole schedule allocates no more than 6 GB (TTT) or 11 GB (TTTD) and converges n less than 10 mnutes (TTT)/20 mnutes (TTTD) of CPU tme on a standard Pentum 4 machne. The code for ths analyss wll be made publcly avalable. In the frst experment, we bult the TTT model for the above mentoned collecton of Chess games. The draw margn was chosen such that the apror probablty of draw between two equally sklled players matches the overall draw probablty of 30.3%. Moreover, the model has a translatonal nvarance n the sklls and a scale nvarance n /σ 0 and /σ 0. Thus, we fxed µ 0 = 1200, σ 0 = 400 and computed the logevdence L := P (y, ) for varyng values of and (see Fgure 2 (rght)). The plots show that the model s very robust to settng these two parameters except f s chosen too small. Interestngly, the logevdence s nether largest for 0 (complete decouplng) nor for 0 (constant skll over lfetme) ndcatng that t s mportant to model the dynamcs of Chess players. Note that the logevdence s L TTT = 3, 953, 997, larger than that of the nave model (L nave = 4, 228, 005) whch always predcts 30.3% for a draw and correspondngly for wn/loss 3. In a second experment, we pcked the optmal values (, ) = (480, 60) for TTT and optmsed the remanng pror and dynamcs parameters of TTTD to arrve at a model wth a logevdence of L TTT D = 3, 661, 813. In Fgure 3 we have plotted the skll evoluton for some well known players of the last 150 years when fttng the TTT model (µ t, σ t are shown). In Fgure 4 the skll evoluton of the same players s plotted when fttng the TTTD model; the dashed lnes show µ t + ε t 1 For more nformaton, see 2 For more detals, see 3 Leakage due to approxmate nference. 6
7 Fgure 3: Skll evoluton of top Chess players wth TTT; see text for detals. whereas the sold lnes dsplay µ t ; for comparsons we added the µ t of the TTT model as dotted lnes. As a frst observaton, the uncertantes always grow towards the begnnng and end of a career snce they are not constraned by past/future years. In fact, for Bobby Fscher the uncertanty grows very large n hs 20 years of nactvty ( ). Moreover, there seems to be a notceable ncrease n overall skll snce the 1980 s. Lookng at Fgure 4 we see that players have dfferent abltes to force a draw; the strongest player to do so s Bors Spassky (1937 ). Ths ablty got stronger after 1975 whch explans why the model wth a fxed draw margn estmates Spassky s skll larger. Lookng at ndvdual players we see that Paul Morphy ( ), The Prde and Sorrow of Chess, s partcularly strong when comparng hs skll to those of hs contemporares n the next 80 years. He s consdered to have been the greatest chess master of hs tme, and ths s well supported by our analyss. Bobby Fscher (1943 ) ted wth Bors Spassky at the age of 17 and later defeated Spassky n the Match of the Century n Agan, ths s well supported by our model. Note how the uncertanty grows durng the 20 years of nactvty ( ) but starts to shrnk agan n lght of the (future) rematch of Spassky and Fscher n 1992 (whch Fscher won). Also, Fscher s the only one of these players whose ε t decreased over tme when he was actve, he was known for the large margn by whch he won! Fnally, Garry Kasparov (1963 ) s consdered the strongest Chess player of all tme. Ths s well supported by our analyss. In fact, based on our analyss Kasparov s stll consderably stronger than Vladmr Kramnk (1975 ) but a contender for the crown of strongest player n the world s Vswanathan Anand (1969 ), a former FIDE world champon. 5 Concluson We have extended the Bayesan ratng system TrueSkll to provde player ratngs through tme on a unfed scale. In addton, we ntroduced a new model that tracks playerspecfc draw margns and thus models the game outcomes even more precsely. The resultng factor graph model for our large ChessBase database of game outcomes has 18.5 mllon nodes and 27.6 mllon factors, thus consttutng one of the largest nontrval Bayesan models ever 7
8 Skll (Varable Draw Margn) Skll + Draw Margn Skll (Fxed Draw Margn) 3500 Anand; Vswanathan Kasparov; Garry 3000 Fscher; Robert James Skll estmate 2500 Echborn; Lous Botvnnk; Mkhal Kramnk; Vladmr Karpov; Anatoly Morphy; Paul Stentz; Wllam Spassky; Bors V 2000 Lasker; Emanuel Capablanca; Jose Raul Anderssen; Adolf Year Fgure 4: Skll evoluton of top Chess players wth TTTD; see text for detals. tackled. Full approxmate nference takes a mere 20 mnutes n our F# mplementaton and thus demonstrates the effcency of EP n approprately structured factor graphs. One of the key questons provoked by ths work concerns the comparablty of skll estmates across dfferent eras of chess hstory. Can we drectly compare Fscher s ratng n 1972 wth Kasparov s n 1991? Edwards [2] ponts out that we would not be able to detect any skll mprovement f two players of equal skll were to learn about a skllmprovng breakthrough n chess theory at the same tme but would only play aganst each other. However, ths argument does not rule out the possblty that wth more players and chess knowledge flowng less perfectly the mprovement may be detectable. After all, we do see a marked mprovement n the average skll of the top players. In future work, we would lke to address the ssue of skll calbraton across years further, e.g., by ntroducng a latent varable for each year that serves as the pror for new players jonng the pool. Also, t would be nterestng to model the effect of playng whte rather than black. References [1] H. A. Davd. The method of pared comparsons. Oxford Unversty Press, New York, [2] R. Edwards. Edo hstorcal chess ratngs. [3] A. E. Elo. The ratng of chess players: Past and present. Arco Publshng, New York, [4] M. E. Glckman. A comprehensve gude to chess ratngs. Amer. Chess Journal, 3:59 102, [5] M. E. Glckman. Parameter estmaton n large dynamc pared comparson experments. Appled Statstcs, 48: , [6] R. Herbrch, T. Mnka, and T. Graepel. TrueSkll(TM): A Bayesan skll ratng system. In Advances n Neural Informaton Processng Systems 20, [7] T. Mnka. A famly of algorthms for approxmate Bayesan nference. PhD thess, MIT, [8] J. Sonas. Chessmetrcs. 8
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 informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationAn 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 informationRequIn, a tool for fast web traffic inference
RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@ntevry.fr, JeanEtenne.Kba@ntevry.fr Abstract As networked
More informationAnalysis 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 informationForecasting 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 informationbenefit 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 informationModule 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 informationThe Current Employment Statistics (CES) survey,
Busness Brths and Deaths Impact of busness brths and deaths n the payroll survey The CES probabltybased sample redesgn accounts for most busness brth employment through the mputaton of busness deaths,
More informationMultiplePeriod Attribution: Residuals and Compounding
MultplePerod Attrbuton: Resduals and Compoundng Our revewer gave these authors full marks for dealng wth an ssue that performance measurers and vendors often regard as propretary nformaton. In 1994, Dens
More informationInequality and The Accounting Period. Quentin Wodon and Shlomo Yitzhaki. World Bank and Hebrew University. September 2001.
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 informationWhat 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 informationANALYZING 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, 6105194390,
More informationVision 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 informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationThe Application of Fractional Brownian Motion in Option Pricing
Vol. 0, No. (05), pp. 738 http://dx.do.org/0.457/jmue.05.0..6 The Applcaton of Fractonal Brownan Moton n Opton Prcng Qngxn Zhou School of Basc Scence,arbn Unversty of Commerce,arbn zhouqngxn98@6.com
More informationSection 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 informationAn InterestOriented Network Evolution Mechanism for Online Communities
An InterestOrented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationPSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 12
14 The Chsquared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304C) 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) of the Cell class is created containing information about events associated with the cell. Events are added to the Cell instance
Calbraton Method Instances of the Cell class (one nstance for each FMS cell) contan ADC raw data and methods assocated wth each partcular FMS cell. The calbraton method ncludes event selecton (Class Cell
More information7.5. Present Value of an Annuity. Investigate
7.5 Present Value of an Annuty Owen and Anna are approachng retrement and are puttng ther fnances n order. They have worked hard and nvested ther earnngs so that they now have a large amount of money on
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationEfficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
More informationCS 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 informationStatistical 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 informationLuby 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 informationLatent Class Regression. Statistics for Psychosocial Research II: Structural Models December 4 and 6, 2006
Latent Class Regresson Statstcs for Psychosocal Research II: Structural Models December 4 and 6, 2006 Latent Class Regresson (LCR) What s t and when do we use t? Recall the standard latent class model
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More informationRecurrence. 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 informationCalculation 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 twostage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationStaff Paper. Farm Savings Accounts: Examining Income Variability, Eligibility, and Benefits. Brent Gloy, Eddy LaDue, and Charles Cuykendall
SP 200502 August 2005 Staff Paper Department of Appled Economcs and Management Cornell Unversty, Ithaca, New York 148537801 USA Farm Savngs Accounts: Examnng Income Varablty, Elgblty, and Benefts Brent
More informationA Secure PasswordAuthenticated Key Agreement Using Smart Cards
A Secure PasswordAuthentcated Key Agreement Usng Smart Cards Ka Chan 1, WenChung Kuo 2 and JnChou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationProceedings of the Annual Meeting of the American Statistical Association, August 59, 2001
Proceedngs of the Annual Meetng of the Amercan Statstcal Assocaton, August 59, 2001 LISTASSISTED SAMPLING: THE EFFECT OF TELEPHONE SYSTEM CHANGES ON DESIGN 1 Clyde Tucker, Bureau of Labor Statstcs James
More informationPrediction of Disability Frequencies in Life Insurance
Predcton of Dsablty Frequences n Lfe Insurance Bernhard Köng Fran Weber Maro V. Wüthrch October 28, 2011 Abstract For the predcton of dsablty frequences, not only the observed, but also the ncurred but
More informationNONCONSTANT SUM REDANDBLACK GAMES WITH BETDEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 OCOSTAT SUM REDADBLACK GAMES WITH BETDEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
More informationAn 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, Hsnyng Wu b a Professor (Management Scence), Natonal Chao
More informationThe 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 informationThe Analysis of Covariance. ERSH 8310 Keppel and Wickens Chapter 15
The Analyss of Covarance ERSH 830 Keppel and Wckens Chapter 5 Today s Class Intal Consderatons Covarance and Lnear Regresson The Lnear Regresson Equaton TheAnalyss of Covarance Assumptons Underlyng the
More informationPrediction of Disability Frequencies in Life Insurance
1 Predcton of Dsablty Frequences n Lfe Insurance Bernhard Köng 1, Fran Weber 1, Maro V. Wüthrch 2 Abstract: For the predcton of dsablty frequences, not only the observed, but also the ncurred but not yet
More informationTo manage leave, meeting institutional requirements and treating individual staff members fairly and consistently.
Corporate Polces & Procedures Human Resources  Document CPP216 Leave Management Frst Produced: Current Verson: Past Revsons: Revew Cycle: Apples From: 09/09/09 26/10/12 09/09/09 3 years Immedately Authorsaton:
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMAHDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationUnderwriting Risk. Glenn Meyers. Insurance Services Office, Inc.
Underwrtng Rsk By Glenn Meyers Insurance Servces Offce, Inc. Abstract In a compettve nsurance market, nsurers have lmted nfluence on the premum charged for an nsurance contract. hey must decde whether
More informationStudent Performance in Online Quizzes as a Function of Time in Undergraduate Financial Management Courses
Student Performance n Onlne Quzzes as a Functon of Tme n Undergraduate Fnancal Management Courses Olver Schnusenberg The Unversty of North Florda ABSTRACT An nterestng research queston n lght of recent
More informationMAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPPATBDClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationCourse outline. Financial Time Series Analysis. Overview. Data analysis. Predictive signal. Trading strategy
Fnancal Tme Seres Analyss Patrck McSharry patrck@mcsharry.net www.mcsharry.net Trnty Term 2014 Mathematcal Insttute Unversty of Oxford Course outlne 1. Data analyss, probablty, correlatons, vsualsaton
More informationOptimal Customized Pricing in Competitive Settings
Optmal Customzed Prcng n Compettve Settngs Vshal Agrawal Industral & Systems Engneerng, Georga Insttute of Technology, Atlanta, Georga 30332 vshalagrawal@gatech.edu Mark Ferguson College of Management,
More informationOnline Inference of Topics with Latent Dirichlet Allocation
Onlne Inference of Topcs wth Latent Drchlet Allocaton Kevn R. Cann Computer Scence Dvson Unversty of Calforna Berkeley, CA 94720 kevn@cs.berkeley.edu Le Sh Helen Wlls Neuroscence Insttute Unversty of Calforna
More informationCausal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting
Causal, Explanatory Forecastng Assumes causeandeffect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of
More informationAnswer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 MultpleChoce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multplechoce questons. For each queston, only one of the answers s correct.
More informationFrequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters
Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,
More informationBrigid 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 informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σalgebra: a set
More informationRealistic Image Synthesis
Realstc Image Synthess  Combned Samplng and Path Tracng  Phlpp Slusallek Karol Myszkowsk Vncent Pegoraro Overvew: Today Combned Samplng (Multple Importance Samplng) Renderng and Measurng Equaton Random
More informationEnterprise Master Patient Index
Enterprse Master Patent Index Healthcare data are captured n many dfferent settngs such as hosptals, clncs, labs, and physcan offces. Accordng to a report by the CDC, patents n the Unted States made an
More informationInstitute 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 informationRiskbased Fatigue Estimate of Deep Water Risers  Course Project for EM388F: Fracture Mechanics, Spring 2008
Rskbased 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 informationThe Analysis of Outliers in Statistical Data
THALES Project No. xxxx The Analyss of Outlers n Statstcal Data Research Team Chrysses Caron, Assocate Professor (P.I.) Vaslk Karot, Doctoral canddate Polychrons Economou, Chrstna Perrakou, Postgraduate
More informationForecasting 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 informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme 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 informationOn the Optimal Control of a Cascade of HydroElectric Power Stations
On the Optmal Control of a Cascade of HydroElectrc 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 informationNPAR TESTS. OneSample ChiSquare Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6
PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has
More informationTransition Matrix Models of Consumer Credit Ratings
Transton Matrx Models of Consumer Credt Ratngs Abstract Although the corporate credt rsk lterature has many studes modellng the change n the credt rsk of corporate bonds over tme, there s far less analyss
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? ChuShu L Department of Internatonal Busness, Asa Unversty, Tawan ShengChang
More informationVoIP Playout Buffer Adjustment using Adaptive Estimation of Network Delays
VoIP Playout Buffer Adjustment usng Adaptve Estmaton of Network Delays Mroslaw Narbutt and Lam Murphy* Department of Computer Scence Unversty College Dubln, Belfeld, Dubln, IRELAND Abstract The poor qualty
More informationRobust 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 informationAPPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedocho
More informationRisk Model of LongTerm Production Scheduling in Open Pit Gold Mining
Rsk Model of LongTerm 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 informationL10: 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 informationOnLine Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features
OnLne 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 informationSimple Interest Loans (Section 5.1) :
Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part
More informationStress test for measuring insurance risks in nonlife insurance
PROMEMORIA Datum June 01 Fnansnspektonen Författare Bengt von Bahr, Younes Elonq and Erk Elvers Stress test for measurng nsurance rsks n nonlfe nsurance Summary Ths memo descrbes stress testng of nsurance
More informationFeature 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 information1.1 The University may award Higher Doctorate degrees as specified from timetotime in UPR AS11 1.
HIGHER DOCTORATE DEGREES SUMMARY OF PRINCIPAL CHANGES General changes None Secton 3.2 Refer to text (Amendments to verson 03.0, UPR AS02 are shown n talcs.) 1 INTRODUCTION 1.1 The Unversty may award Hgher
More information1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationBUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK. 0688, dskim@ssu.ac.kr
Proceedngs of the 41st Internatonal Conference on Computers & Industral Engneerng BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK Yeongbn Mn 1, Yongwoo Shn 2, Km Jeehong 1, Dongsoo
More informationAdaptive Clinical Trials Incorporating Treatment Selection and Evaluation: Methodology and Applications in Multiple Sclerosis
Adaptve Clncal Trals Incorporatng Treatment electon and Evaluaton: Methodology and Applcatons n Multple cleross usan Todd, Tm Frede, Ngel tallard, Ncholas Parsons, Elsa ValdésMárquez, Jeremy Chataway
More informationCHAPTER 14 MORE ABOUT REGRESSION
CHAPTER 14 MORE ABOUT REGRESSION We learned n Chapter 5 that often a straght lne descrbes the pattern of a relatonshp between two quanttatve varables. For nstance, n Example 5.1 we explored the relatonshp
More informationAn Empirical Study of Search Engine Advertising Effectiveness
An Emprcal Study of Search Engne Advertsng Effectveness Sanjog Msra, Smon School of Busness Unversty of Rochester Edeal Pnker, Smon School of Busness Unversty of Rochester Alan RmmKaufman, RmmKaufman
More informationCharacterization of Assembly. Variation Analysis Methods. A Thesis. Presented to the. Department of Mechanical Engineering. Brigham Young University
Characterzaton of Assembly Varaton Analyss Methods A Thess Presented to the Department of Mechancal Engneerng Brgham Young Unversty In Partal Fulfllment of the Requrements for the Degree Master of Scence
More informationStudy 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 informationWhen Talk is Free : The Effect of Tariff Structure on Usage under Two and ThreePart Tariffs
0 When Talk s Free : The Effect of Tarff Structure on Usage under Two and ThreePart Tarffs Eva Ascarza Ana Lambrecht Naufel Vlcassm July 2012 (Forthcomng at Journal of Marketng Research) Eva Ascarza
More informationCloudbased Social Application Deployment using Local Processing and Global Distribution
Cloudbased Socal Applcaton Deployment usng Local Processng and Global Dstrbuton Zh Wang *, Baochun L, Lfeng Sun *, and Shqang Yang * * Bejng Key Laboratory of Networked Multmeda Department of Computer
More informationExhaustive Regression. An Exploration of RegressionBased Data Mining Techniques Using Super Computation
Exhaustve Regresson An Exploraton of RegressonBased Data Mnng Technques Usng Super Computaton Antony Daves, Ph.D. Assocate Professor of Economcs Duquesne Unversty Pttsburgh, PA 58 Research Fellow The
More informationSketching 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 informationA 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 informationA Model of Private Equity Fund Compensation
A Model of Prvate Equty Fund Compensaton Wonho Wlson Cho Andrew Metrck Ayako Yasuda KAIST Yale School of Management Unversty of Calforna at Davs June 26, 2011 Abstract: Ths paper analyzes the economcs
More informationTime Series Analysis in Studies of AGN Variability. Bradley M. Peterson The Ohio State University
Tme Seres Analyss n Studes of AGN Varablty Bradley M. Peterson The Oho State Unversty 1 Lnear Correlaton Degree to whch two parameters are lnearly correlated can be expressed n terms of the lnear correlaton
More informationAssimilation of streamflow discharge into a continuous flood forecasting model
Rsk n Water Resources Management (Proceedngs of Symposum H03 held durng IUGG20 n Melbourne, Australa, July 20) (IAHS Publ. 347, 20). 07 Assmlaton of streamflow dscharge nto a contnuous flood forecastng
More information7 ANALYSIS OF VARIANCE (ANOVA)
7 ANALYSIS OF VARIANCE (ANOVA) Chapter 7 Analyss of Varance (Anova) Objectves After studyng ths chapter you should apprecate the need for analysng data from more than two samples; understand the underlyng
More informationJoint Optimization of Bid and Budget Allocation in Sponsored Search
Jont Optmzaton of Bd and Budget Allocaton n Sponsored Search Wenan Zhang Shangha Jao Tong Unversty Shangha, 224, P. R. Chna wnzhang@apex.sjtu.edu.cn Yong Yu Shangha Jao Tong Unversty Shangha, 224, P. R.
More informationECONOMICS OF PLANT ENERGY SAVINGS PROJECTS IN A CHANGING MARKET Douglas C White Emerson Process Management
ECONOMICS OF PLANT ENERGY SAVINGS PROJECTS IN A CHANGING MARKET Douglas C Whte Emerson Process Management Abstract Energy prces have exhbted sgnfcant volatlty n recent years. For example, natural gas prces
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationFinite Math Chapter 10: Study Guide and Solution to Problems
Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount
More informationGRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 NORM
GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 NORM BARRIOT JeanPerre, SARRAILH Mchel BGI/CNES 18.av.E.Beln 31401 TOULOUSE Cedex 4 (France) Emal: jeanperre.barrot@cnes.fr 1/Introducton The
More informationBayesian Cluster Ensembles
Bayesan Cluster Ensembles Hongjun Wang 1, Hanhua Shan 2 and Arndam Banerjee 2 1 Informaton Research Insttute, Southwest Jaotong Unversty, Chengdu, Schuan, 610031, Chna 2 Department of Computer Scence &
More informationLearning the Best Kth Channel for QoS Provisioning in Cognitive Networks
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION. Michael E. Kuhl Radhamés A. TolentinoPeñ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 SIMULATIONBASED OPTIMIZATION
More informationAn Enhanced SuperResolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement
An Enhanced SuperResoluton System wth Improved Image Regstraton, Automatc Image Selecton, and Image Enhancement YuChuan Kuo ( ), ChenYu Chen ( ), and ChouShann Fuh ( ) Department of Computer Scence
More informationHot and easy in Florida: The case of economics professors
Research n Hgher Educaton Journal Abstract Hot and easy n Florda: The case of economcs professors Olver Schnusenberg The Unversty of North Florda Cheryl Froehlch The Unversty of North Florda We nvestgate
More information