Maximizing profit using recommender systems


 Julie Morrison
 3 years ago
 Views:
Transcription
1 Maxzng proft usng recoender systes Aparna Das Brown Unversty rovdence, RI Clare Matheu Brown Unversty rovdence, RI Danel Rcketts Brown Unversty rovdence, RI ABSTRACT Tradtonal recoendaton systes ake recoendatons based solely on the custoer s past purchases, product ratngs and deographc data wthout consderng the proftablty of the tes beng recoended. In ths work we consder the queston of how a vendor can drectly ncorporate the proftablty of tes nto ts recoendaton syste so as to axze expected proft whle stll provdng accurate recoendatons. Our approach uses the output of any tradtonal recoender syste and adjusts t accordng to te proftablty. Our approach s paraetrzed so the vendor can control the aount of devaton between the recoendaton ncorporatng profts and the tradtonal recoendaton. We study our approach under two settngs and show that t can acheve sgnfcantly ore proft than tradtonal recoendatons. Categores and Subject Descrptors H.3.5 [Inforaton Systes]: Inforaton storage and retreval Onlnenforaton servces, Coercal servces Keywords Recoender systes, roduct proftablty, Algorths, Electronc coerce. 1. INTRODUCTION Recoendaton Systes are portant tools for ajor copanes such as Aazon, Netflx and andora. Recoendaton Systes use a custoer s deographc data, past purchases and past product ratngs to predct how the custoer wll rate new products [1, 11, 9, 13]. They have been shown to help custoers becoe aware of new products, ncrease sales and encourage custoers to return to the busness for future purchases [6, 15]. Desgnng recoendaton systes that accurately predct custoer ratngs has generated uch research and nterest both n the acadec and busness countes. The Netflx prze was a anfestaton of ths nterest [12]. However, the ajorty of the work on recoender systes has not explctly consdered how the proftablty of products could be ncorporated Supported by NSF grant CCF Supported by NSF grant CCF Copyrght s held by the author/owner(s). WWW2010, Aprl 2630, 2010, Ralegh, North Carolna.. nto the recoendatons. An artcle publshed n clas that the actual Netflx recoendaton syste odfes ts ratngs to encourage consuers to order the ore obscure oves whch are presuably cheaper for Netflx to supply than ajor blockbusters[18]. Whle Netflx does not, publcly reveal whether t uses such ethods, t sees natural for a busness to ncorporate the proftablty of products nto ts recoendatons. Fro the vewpont of the custoer, recoendatons are helpful suggestons, but fro the vewpont of the vendor they are extreely targeted advertseents, and the explct goal of advertsng s to ncrease proft. In ths paper, we study the queston of how a vendor ght ncorporate the proftablty of tes nto ts recoendatons. A nave approach s to gve the ost proftable tes the hghest recoendatons. Then these tes would presuably be bought ore often and the busness would ake ore oney. However ths tactc has soe obvous flaws. Whle the custoer ay ntally follow the vendor s recoendaton, she ay fnd that she does not lke the tes as uch as the vendor predcted. After only a few such experences, she would realze that the vendor s recoendatons do not accurately reflect her tastes. In the best case for the vendor, the custoer would gnore the vendor s recoendatons and contnue her natural purchasng behavor whle n the worst case she would lose trust not only n the vendor s recoendatons but also n the vendor as a whole and take her busness elsewhere. Thus ncorporatng the proftablty of tes nto recoendatons ust be done carefully so that custoer s trust s not coprosed. A reasonable assupton s that as long as the vendor consstently presents recoendatons that are slar enough to the custoer s own ratngs, the custoer wll antan a hgh level of trust n the accuracy of the vendor s recoendatons. For ths reason, we use an establshed slarty easure as a easure of trust. We assue that the vendor has access to a vector c gvng the consuer s true ratngs for tes. The vendor s objectve s to present a recoendaton vector r to the custoer whch s wthn a certan threshold of slarty to c, and axzes the vendor s expected proft (by ncorporatng the proftablty of tes nto the recoendaton). Secton 2 gves detals of the odel. One queston that ght arse s how the vendor can deterne the custoer s true ratngs (.e c ) f the ratngs are for products that the consuer has not yet rated herself. There s a large aount of research and actvty n developng hghly accurate recoendaton systes that solve ths proble and we assue the predctons fro these systes
2 for well establshed custoers are good approxatons to the custoer s true ratngs. The dea that the custoer wll antan hgh trust as long as the vendor s recoendatons are slar to her own ratngs has eprcal support. Hll et al. showed that users asked to rate the sae te at dfferent tes supply dfferent ratngs [8]. Aatran et al. report slar fndngs n ther study whch evaluates nose n user ratngs of oves [2]. Thus there s soe natural varablty n the ratngs that users supply, and so slght dfferences between the predcted ratngs and the actual custoer ratngs should be nsgnfcant to the custoer. Chen et al. also consdered usng the proftablty of tes n recoender systes [5], but they do not explctly requre a level of accuracy n ther syste. The outlne of our paper s: secton 2 defnes our odel and proble, secton 3 descrbes the slarty easure and gves justfcaton for ts use as a easure of custoer trust and secton 4 descrbes our approach for axzng expected proft n dfferent scenaros. 2. MODEL Let n be the nuber of tes beng sold by the vendor. Let c and r be the vectors of length n where the th coponents denoted c and r gves a ratng for te. All tes are rated usng nubers between zero and soe axu ratng. We focus on the scenaro where the vendor s nteractng wth an establshed custoer who the vendor would lke to contnue to do busness wth n the long ter. We assue the vendor uses a recoendaton syste whch akes good predctons about how such a custoer rates tes and that vector c gves these predctons 1. The vendor presents the custoer wth recoendaton vector r to help her decde whch te to purchase. In any real applcatons, the vendor only wants to provde the custoer wth the top n recoended tes. In ths case the vendor would dsplay the n hghest rated tes n r. The custoer has a certan level of trust n the accuracy of the vendor s recoendaton whch she has developed fro experence wth the vendor s past recoendatons. When choosng an te to purchase, the custoer consders r based on how uch trust she has n the vendor s recoendatons. The exact nfluence that a custoer s level of trust n the vendor s recoendatons has on her purchasng behavor s too coplex to odel precsely. We ake the followng splfyng assuptons to allow for a odel of that behavor: Frst we assue that the consuer s trust s closely ted to how slar the vendor s recoendatons are to the ratngs she would gve tes. Second we assue that as long the slarty constrant s consstently et by the vendor, the consuer wll use the recoendatons when decdng what tes to purchase. Specfcally we assue there s a functon T ( r) that assgns a scalar value to the noton of slarty between r and c where hgher values ndcate greater slarty. Second, we assue that f for every r that the vendor presents to the custoer, T ( r) eets or exceeds soe threshold value, then the custoer s trust n the recoendaton syste wll rean at a constant, sgnfcantly hgh level. Fnally, we assue that f the cus 1 The custoer does not necessarly know all the entres of c herself as she has not purchased all tes. toer s trust reans at ths level, her purchasng decson wll be solely a functon of r. The custoer s level of trust and her subsequent purchasng behavor s unknown f the vendor presents r such that T ( r) <. The ntuton behnd these assuptons s that, as long as the vendor recoendaton consstently predcts ratngs that are slar enough to how the custoer would rate the tes, the custoer wll antan a certan level of trust n the accuracy of the recoendaton syste. As a result, she wll use the vendor s recoendaton as nforaton when decdng whch tes to purchase. However f r s too far fro c, the custoer loses trust the vendor s recoendatons and no longer consders the when decdng whch te to buy. In that case, her purchasng behavor s unclear. The vendor s an goal s to axze proft. However, to antan custoer trust he s requred to present vector r such that T ( r) for soe constant. Denote ϕ( r) be a vector valued functon whose th coponent gves the probablty that the custoer wll purchase te at a gven te step. The custoer, at any step, can purchase zero or ore tes, so the coponents of ϕ( r) need not su to one. Let p be the proft vector whose th coponent, p, gves the proft receved when te s purchased. The vendor s expected proft s gven by E p = p ϕ( r). Forally our proble s to axze the vendor s expected proft whle antanng a level of trust wth the custoer: Max p ϕ( r) s.t. T ( r) (1) 3. SIMILARITY MEASURES FOR TRUST In ths secton we argue that the Dce coeffcent, whch easures slarty between two vectors, s an approprate easure of consuer trust. We brefly dscuss why soe of the other coon sngularty easures are lackng. Dce coeffcent. We adopt the Dce coeffcent gven n equaton 2, to easure trust T ( r). The Dce coeffcent s a popular easure whch has prevously been used to easure recoendaton accuracy [5, 7, 14]. Dce( r) = 2 cr c2 + r2 = 2 c r c 2 + r 2 (2) Above x = p x2 denotes the length of vector x. Norally the Dce coeffcent s denoted as a functon of the two vectors whose slarty s beng easured but here we denote t as only a functon of r to ephasze the fact that c s constant known to the vendor. Let θ denote the angle between c and r. An equvalent defnton of the Dce coeffcent s, Dce( r) = cos(θ) 2 c r c 2 + r 2 (3) We now lst soe propertes of the Dce coeffcent that akes t a reasonable functon to easure trust. roperty 3.1. Dce( r) s always between zero and one. Dce( r) = 1, f and only f c = r for every te. Dce( r) = 0, f and only f r = 0 on all tes such that c > 0. Thus the Dce( r) s one only when r s n coplete agreeent wth c, and t s zero only when r dsagrees wth c on all relevant tes. roof. (roof of roperty 3.1)
3 Dce( r) 0 because no te s rated less than zero. Thus the nuerator of Equaton 2 s always postve. Now suppose that Dce( r) > 1. By Equaton 2, ths ples that 0 > c2 2r c + r 2 = (r c)2 whch s a contradcton. Thus Dce( r) 1. Suppose that r = c for every. Then usng Equaton 2 Dce( r) = 1. To prove the other drecton suppose that Dce( r) = 1. The forulaton of the Dce coeffcent gven n Equaton 3 can be used to show that r = c for all. Note that 0 cos(θ) 1 as no te s rated less than zero. The second ter of Equaton 3 s nonnegatve by defnton and the followng proof by contradcton shows t s at ost 1: suppose 2 c r /( c 2 + r 2 ) > 1 then 2 c r > c 2 + r 2 plyng that 0 > ( c r ) 2 whch s false. Thus f Dce( r) = 1 both ters of Equaton 3 ust be 1. As cos(θ) = 1 the angle between c and r s zero and the second ter beng 1 ples that ( c r ) = 0.e that r and c have equal length. Together ths ples that r = c for all. Fnally note that when Dce( r) = 0, the nuerator of Equaton 2 s zero whch ples that r ust be zero for each such that c > 0. Jaccard easure. The Jaccard slarty easure, gven below, behaves slarly to the Dce coeffcent and s used wdely n nforaton retreval and data nng [17, 10, 3]. Jac( r) = ( c r)/( c 2 + r 2 c r) It s another approprate easure of consuer trust and all results extend to the settng where T ( r) = Jac( r). Cosne easure. The cosne slarty easure, gven n equaton 4, s equal to the cosne of θ. It s always between zero and one as no te s rated less than zero. Cos( r) = cos(θ) = p r2 cr c2 The cosne easure s not nfluenced by dfference n the lengths of r and c and ths s the an reason t sees unsutable for easurng trust as deonstrated n the followng exaple. Exaple. Suppose the tes are rated between 0 and 5. Consder a pcky custoer who rates all tes soewhat low and a vendor that recoends all tes hgh,.e c = 1 and r = 5 for all. The cosne easure wll be to one because θ = 0 ndcatng that the pcky custoer has hgh trust for the vendor s recoendaton, whch s surely not the case. Mean squared error and dstance easures. The ean squared error (MSE) easures the average dsslarty between r and c. Let denote the axu possble ratng. To easure slarty we could use 1MSE, Equaton 5, whch s always between zero and one. MSE( r) = ((c/ r/))2 n The 1MSE easure gves equal credt for agreeents on tes the custoer dslkes as on agreeents on tes she prefers and ths akes t unsutable for easurng the trust as deonstrated by the exaple below. Ths exaple also apples to other dstance based slarty easures such as Eucldean dstance and Manhattan dstance. (4) (5) Exaple. Suppose the tes are rated between 0 and 5. Let c = [5, 5, 5, 1, 1, 1,..., 1] whch represents a custoer who rates a few tes very hghly but dslkes ost tes. Consder the followng recoendaton r = [1, 1, 1,..., 1, 5, 5, 5] where the vendor gves the hghest ratngs to a few tes that the custoer dslkes and gves the low ratngs to all other tes ncludng the tes the custoer prefers. MSE s Θ(1/n) so that 1MSE approaches 1 as the nuber of tes n gets large ndcatng that the custoer would have hgh trust such recoendatons whch s not the case. 4. ROFIT MAXIMIZATION Usng the Dce slarty coeffcent defned n Secton 3 as the trust functon the vendor s optzaton proble s, Max E p( r) = p ϕ( r) s.t. Dce( r) = 2 c r c2 + r2 (6) We outlne a general approach for solvng Equaton 6 and then apply our technque on two dfferent objectve functons obtaned by alternatve defntons of φ( r). We analyze how uch proft the vendor gans by presentng the custoer wth recoendaton r rather than c. 4.1 General Approach Calculus gves us a general approach for solvng the vendor s axzaton proble stated n Equaton 1. Addng 1/ to both sdes of the Dce constrant above and splfyng reveals that t s equvalent to, X r c «X c 2 (7) As c s a constant for our settng, the feasble r for our proble le n a regon enclosed by an nsphere wth radus q ( 1 2 1) c2 whch we refer to as the Dce sphere. The general approach to solvng axzaton proble of Equaton 6 nvolves two parts. The frst s to deterne f there are any local axa that le strctly nsde the Dce sphere.e. whch satsfy Dce( r, c) >. The second part s to fnd the vector r that axzes expected proft over all vectors on the surface of the Dce sphere,.e. whch satsfy Dce( r, c) =. The largest of the local axa n the sphere and the axu on the surface s the global axu. The gradent of the objectve functon s zero at each local axu nsde the Dce sphere. Thus all solutons to E p = 0 are canddate vectors. Let r 1, r 2,..., r k be the lst of all vectors that satsfy ths property. Whle these vectors could be local na or saddle ponts nstead of local axa, t s not necessary to dstngush between the. It s only necessary to fnd the greatest value of E p( r ) for all and copare t to the axu of all vectors on the surface of the sphere. Let r n denote the axa vector nsde the Dce sphere. The axu vector on the surface of the Dce sphere can be found usng the ethod of Lagrange ultplers. The axu valued vector r s wll satsfy Dce( r s, c) = λ E p( r s) and Dce( r s, c) =. The axu of r s and s the soluton to the optzaton proble [4, 16]. 4.2 Sple probablty functon Consder a scenaro where the custoer can purchase zero or ore tes at each te step where the probablty that r n
4 the custoer purchases te s ndependent of the vendor s ratngs for other tes. Here s a sple way to defne the probablty functon whch satsfes ths assupton, r1 ϕ( r) =, r2,..., rn (8) Recall that s the hghest possble ratng for an te. Wth ths defnton of ϕ, the probablty that a custoer purchases an te s lnearly proportonal to the vendor s ratng of that te and the vendor s expected proft s E p( r) = p ϕ( r) = 1 X p r (9) As prces are all greater than zero, E p = ( p 1,..., pn ) 0 so there are no local axa nsde the sphere. Thus we can proceed to fndng the axu be on the surface of the Dce sphere. Usng Equaton 7 we have Dce( r, c) = `2(r1 c 1 ),..., 2(r n cn ), so the axa on the Dce sphere surface ust satsfy the followng syste of equatons, and p = 2λ(r c/) (r c/)2 = ` 1 2 for all 1 c2 where the last equaton requres r to le wthn the Dce sphere. Solvng the frst set of equatons we obtan that r = p 2λ + c (10) Substtutng r n the value of r nto Equaton 7 we get λ = p2. The fnal soluton s obtaned by pluggng 1 2 ( 1 2 1) c2 λ nto Equaton 10. s ( 1 1) r = p 2 j c2 j + c j p2 j (11) roft Gans. By presentng the custoer wth recoendaton r derved n Equaton 11 the vendor earns expected proft E p( r) = 1 p2 q(1/ 2 1) j c2j / j p2j + pc/, whch s splfed va the CauchySchwarz nequalty to 2, r! 1 E p( r) pc 2. (12) The expected proft fro c s E p( c) = ( pc)/. The vendor s proft gan fro presentng r rather than c s, r E p( r) E p( c) 1 = E p( c) (1/ 1). 2 Exaple. If the vendor presents recoendaton vectors that are wthn slarty threshold =.9, allowng a 10% devaton to c, then n expectaton he earns at least 2(10/9 1) > 22% ore proft by presentng r rather than c. 4.3 Sple dstrbuton Now we consder the scenaro where at each te step the custoer purchases only one te but chooses whch te to purchase based on how ts ratng copares to ratngs of other tes. A sple way to odel ths s to set the 2 The CauchySchwarz nequalty s ( pc)2 p2 c2 purchase probablty of te to be r / j rj. «r1 r 2 r ϕ( r) =,,..., n r r r Thus the custoer scales each te by the su of the vendor s ratngs, and then chooses unforly aong all offered tes. Wth ths defnton of ϕ the expected proft s, E p( r) = p ϕ( r) = X p r j rj (13) The local axa nsde the Dce sphere occur where the gradent of the expected proft s zero. The gradent s * + p1 j rj r1p1 E p = 2,..., pn j rj rn pn 2 j rj j rj For E p = 0, t ust be the case that j rj = r for all. Thus f there are at least two tes wth dfferent ratngs then there are no local axa nsde the Dce sphere. We proceed to fndng local axa on the surface of the Dce sphere. Applyng the ethod of Lagrange Multplers as before we end up havng to solve the followng syste of equatons for varables λ and r for all : p j rj r p 2 = 2λ(r c ) for all and Dce( r) (14) j rj Unfortunately we do not know how to fnd a soluton for ths as the frst set of equatons nvolves r for all. Recall that n secton 4.2 the correspondng equatons for fndng the axa on the Dce surface were each a functon of only one r. Ths lead us to seek an alternatve approach. We wll reduce solvng the optzaton proble under the defnton of E p gven n Equaton 13 to solvng a seres of spler optzaton probles on whch we can effortlessly apply the ethod of Lagrange Multpler. To do so, frst consder the decson verson of our proble: Does there exst a r such that E p( r) V and Dce( r)? Under Equaton 13, havng E p( r) V s equvalent to havng (p V )r 0. Thus the decson verson of our proble s equvalent to solvng the followng axzaton proble and checkng that ts soluton has r 0 for all, Max E p( r) = X (p V )r s.t. Dce( r) (15) Equaton 15 can be solved usng the general approach outlned n Secton 4.1. The gradent E p( r) = 0 ff p V = 0 for all. Thus as long soe te s not prced V, there are no local axa for Equaton 15 nsde the Dce sphere 3. To fnd the axa on the surface of the sphere, we solve the followng syste of equatons, p V = 2λ(r c /) for all and Dce( r) (16) Note that Equaton 16 dffer fro Equaton 10 only by constants so the soluton derved n Secton 4.2 shfted by constants s a soluton for Equaton 16. We get that, r = p V 2λ + c where λ = 1 2 s (p V )2 (1/ 2 1) c2 3 If all te are prced V, all r yeld expected proft V and we could pck any r whch les nsde the Dce sphere.
5 If for all, r 0, we return a yes for the soluton of the decson proble and otherwse we return no. To fnd an a soluton for the orgnal optzaton proble whch s arbtrarly close to optal, we can do bnary search along a bounded nterval of possble values of E p, checkng the exstences of solutons usng decson verson algorth descrbed above. Let V ax = ax p. The ntal bnary search nterval can be set to [0, V ax] snce E p( r) V ax as the custoer purchases one te per te step. Each bnary search step reduces the search nterval by half and dong ore and ore bnary search steps brngs us closer and closer to the optal soluton for the optzaton proble. Let δ < 1. A soluton whch s wthn dstance V axδ of the optal can be found by perforng log( Vax ) bnary search steps. For exaple, let r δ denote the optal soluton. Wth δ = 1/V ax, we can obtan an approxate soluton r a such that E p( r a) + 1 E p( r ) n log( Vax ) = log(v 2 δ ax) = O(log V ax) bnary search steps. roft Gans. Thus we are able to fnd a near optal soluton to the optzaton proble wth E p( r) as defned n Equaton 13 by solvng a seres of optzaton probles of the knd solved n Secton 4.2. The proft gans analyss fro secton 4.2 extends to the last yes soluton obtaned for a decson proble. However as ths yes soluton s near optal for the orgnal optzaton proble, the proft gans wll be close to that fro secton CONCLUSIONS AND FUTURE WORK Tradtonal recoendaton systes do not drectly ncorporate the proftablty of tes nto ts recoendatons and n ths work we propose one of the frst drect ethods to do so. Our approach axzes vendor proft whle provdng trustworthy recoendatons for the custoer. Whle our approach s sple, ts splcty allows t to be used n conjuncton wth any tradtonal recoendaton syste. Our ethod s also tunable and allows the vendor to control how uch the proft based recoendaton should devate fro the tradtonal recoendaton. Our work s a startng pont and we hope t wll sulate new research on ncorporatng profts nto recoendaton systes. The an future drecton for ths work s conduct user studes to verfy our assupton that the Dce coeffcent s a sutable easure of custoer trust. It would also be useful to analyze how the custoer s trust s affected sall devatons fro tradtonal recoendatons systes. 6. REFERENCES [1] Adoavcus, G., and Tuzhln, A. Toward the next generaton of recoender systes: a survey of the stateoftheart and possble extensons. In IEEE Trans. Know. Data. Eng. (2005), IEEE, pp [2] Aatran, X., ujol, J., and Olver, N. I lke t... lke t not: Evaluatng user ratngs nose n recoender systes. In roceedngs of the Conference on User Modelng, Adaptaton, and ersonalzaton (2009). [3] Berry, M., and Browne, M. Lecture Notes n Data Mnng. World Scentfc, [4] Can, G., and Herod, J. Multvarable Calculus. can/notes/calculus.htl, [5] Chen, L., Hsu, F., Chen, M., and Y., H. Developng recoender systes wth the consderaton of product proftablty for sellers. In Inforaton Scences (2008), Elsever, pp [6] Chen,., and Wu, S. How does collaboratve flterng technology pact sales? eprcal evdence fro aazon.co. workng paper. Avalable at SSRN: [7] Cho, Y., and K, J. Applcatons of web usuage and product taxonoy to collaboratve recoendatons n ecoerce. In Expert systes wth Applcatons (2004), Elsever, pp [8] Hll, W., Stead, L., Rosensten, M., and Furnas, G. Recoendng and evaluatng choces n a vrtual county of use. In roceedngs of ACM CHI 95 Conference on Huan Factors n Coputng Systes (1995), ACM ress, pp [9] J.S., B., Heckeran, D., and C, K. Eprcal analyss of predctve algorths for collaboratve flterng. In roceedngs of the 14th Conference of Uncertanty n AI (1998), Morgan Kaufann ublshers, pp [10] Kaufan, L., and Rousseeuw,. Fndng Groups n Data, An Introducton to Cluster Analyss. Wley, New York, [11] Lnden, G., B., S., and York, J. Aazon.co recoendatons:tetote collaboratve flterng. In IEEE Internet Coputng (2003), IEEE, pp [12] Netflx, Inc. Netflx prze., Dec [13] Resnck,., and Varan, H. R. Recoender systes. In Councaton of ACM (1997), ACM ress, pp [14] Sarwar, B., Karyps, G., Konstan, J., and Redl, J. Analyss of recoendaton algorths for ecoerce. In roceedngs of the 3rd ACM Conference on Electronc Coerce (2000), ACM ress, pp [15] Schafer, J., Konstan, J., and Redl, J. Recoender systes n ecoerce. In roceedngs of the 2nd ACM Conference on Electronc Coerce (1999), ACM ress, pp [16] Stewart, J. Multvarable Calculus 5e (Ffth Edton). ThopsonBrooks/Cole, Canada, [17] Strehl, A., and Ghosh, J. Valuebased custoer groupng fro large retal datasets. In roceedngs of SIE Conference on Data Mnng and Knowledge Dscovery (2000), pp [18] Wharton. Renforcng the blockbuster nature of eda: The pact of onlne recoender, Dec 2008.
An Electricity Trade Model for Microgrid Communities in Smart Grid
An Electrcty Trade Model for Mcrogrd Countes n Sart Grd Tansong Cu, Yanzh Wang, Shahn Nazaran and Massoud Pedra Unversty of Southern Calforna Departent of Electrcal Engneerng Los Angeles, CA, USA {tcu,
More informationHow Much to Bet on Video Poker
How Much to Bet on Vdeo Poker Trstan Barnett A queston that arses whenever a gae s favorable to the player s how uch to wager on each event? Whle conservatve play (or nu bet nzes large fluctuatons, t lacks
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 19982016. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationNear Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
Near Optal Onlne Algorths and Fast Approxaton Algorths for Resource Allocaton Probles Nkhl R Devanur Kaal Jan Balasubraanan Svan Chrstopher A Wlkens Abstract We present algorths for a class of resource
More informationBANDWIDTH ALLOCATION AND PRICING PROBLEM FOR A DUOPOLY MARKET
Yugoslav Journal of Operatons Research (0), Nuber, 6578 DOI: 0.98/YJOR0065Y BANDWIDTH ALLOCATION AND PRICING PROBLEM FOR A DUOPOLY MARKET PengSheng YOU Graduate Insttute of Marketng and Logstcs/Transportaton,
More informationStochastic Models of Load Balancing and Scheduling in Cloud Computing Clusters
Stochastc Models of Load Balancng and Schedulng n Cloud Coputng Clusters Sva Theja Magulur and R. Srkant Departent of ECE and CSL Unversty of Illnos at UrbanaChapagn sva.theja@gal.co; rsrkant@llnos.edu
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 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 informationStochastic Models of Load Balancing and Scheduling in Cloud Computing Clusters
Stochastc Models of Load Balancng and Schedulng n Cloud Coputng Clusters Sva Theja Magulur and R. Srkant Departent of ECE and CSL Unversty of Illnos at UrbanaChapagn sva.theja@gal.co; rsrkant@llnos.edu
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 informationSupport 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 informationStochastic Models of Load Balancing and Scheduling in Cloud Computing Clusters
01 Proceedngs IEEE INFOCOM Stochastc Models of Load Balancng and Schedulng n Cloud Coputng Clusters Sva heja Magulur and R. Srkant Departent of ECE and CSL Unversty of Illnos at UrbanaChapagn sva.theja@gal.co;
More informationNasdaq Iceland Bond Indices 01 April 2015
Nasdaq Iceland Bond Indces 01 Aprl 2015 Fxed duraton Indces Introducton Nasdaq Iceland (the Exchange) began calculatng ts current bond ndces n the begnnng of 2005. They were a response to recent changes
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 informationEE201 Circuit Theory I 2015 Spring. Dr. Yılmaz KALKAN
EE201 Crcut Theory I 2015 Sprng Dr. Yılmaz KALKAN 1. Basc Concepts (Chapter 1 of Nlsson  3 Hrs.) Introducton, Current and Voltage, Power and Energy 2. Basc Laws (Chapter 2&3 of Nlsson  6 Hrs.) Voltage
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 information8.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 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 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 informationA Fuzzy Optimization Framework for COTS Products Selection of Modular Software Systems
Internatonal Journal of Fuy Systes, Vol. 5, No., June 0 9 A Fuy Optaton Fraework for COTS Products Selecton of Modular Software Systes Pankaj Gupta, Hoang Pha, Mukesh Kuar Mehlawat, and Shlp Vera Abstract
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 informationBERNSTEIN POLYNOMIALS
OnLne 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 informationII. THE QUALITY AND REGULATION OF THE DISTRIBUTION COMPANIES I. INTRODUCTION
Fronter Methodology to fx Qualty goals n Electrcal Energy Dstrbuton Copanes R. Rarez 1, A. Sudrà 2, A. Super 3, J.Bergas 4, R.Vllafáfla 5 12 345  CITCEA  UPC UPC., Unversdad Poltécnca de Cataluña,
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 informationGraph Theory and Cayley s Formula
Graph Theory and Cayley s Formula Chad Casarotto August 10, 2006 Contents 1 Introducton 1 2 Bascs and Defntons 1 Cayley s Formula 4 4 Prüfer Encodng A Forest of Trees 7 1 Introducton In ths paper, I wll
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 informationv 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 informationA Novel Dynamic RoleBased Access Control Scheme in User Hierarchy
Journal of Coputatonal Inforaton Systes 6:7(200) 24232430 Avalable at http://www.jofcs.co A Novel Dynac RoleBased Access Control Schee n User Herarchy Xuxa TIAN, Zhongqn BI, Janpng XU, Dang LIU School
More informationBasic Queueing Theory M/M/* Queues. Introduction
Basc Queueng Theory M/M/* Queues These sldes are created by Dr. Yh Huang of George Mason Unversty. Students regstered n Dr. Huang's courses at GMU can ake a sngle achnereadable copy and prnt a sngle copy
More information1 Example 1: Axisaligned 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 informationInternational Journal of Industrial Engineering Computations
Internatonal Journal of Industral ngneerng Coputatons 3 (2012) 393 402 Contents lsts avalable at GrowngScence Internatonal Journal of Industral ngneerng Coputatons hoepage: www.growngscence.co/jec Suppler
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 informationJ. 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 informationDescription of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t
Indeternate Analyss Force Method The force (flexblty) ethod expresses the relatonshps between dsplaceents and forces that exst n a structure. Prary objectve of the force ethod s to deterne the chosen set
More informationGanesh Subramaniam. American Solutions Inc., 100 Commerce Dr Suite # 103, Newark, DE 19713, USA
238 Int. J. Sulaton and Process Modellng, Vol. 3, No. 4, 2007 Sulatonbased optsaton for ateral dspatchng n VendorManaged Inventory systes Ganesh Subraana Aercan Solutons Inc., 100 Coerce Dr Sute # 103,
More informationA 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):18841889 Research Artcle ISSN : 09757384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationCommunication Networks II Contents
8 / 1  Communcaton Networs II (Görg)  www.comnets.unbremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP
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 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 informationNear Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
Near Optal Onlne Algorths and Fast Approxaton Algorths for Resource Allocaton Probles ABSTRACT Nhl R Devanur Mcrosoft Research Redond WA USA ndev@crosoftco Balasubraanan Svan Coputer Scences Dept Unv of
More informationInterIng 2007. INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 1516 November 2007.
InterIng 2007 INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 1516 November 2007. UNCERTAINTY REGION SIMULATION FOR A SERIAL ROBOT STRUCTURE MARIUS SEBASTIAN
More informationScan Detection in HighSpeed Networks Based on Optimal Dynamic Bit Sharing
Scan Detecton n HghSpeed Networks Based on Optal Dynac Bt Sharng Tao L Shgang Chen Wen Luo Mng Zhang Departent of Coputer & Inforaton Scence & Engneerng, Unversty of Florda Abstract Scan detecton s one
More informationQuality of Service Analysis and Control for Wireless Sensor Networks
Qualty of ervce Analyss and Control for Wreless ensor Networs Jaes Kay and Jeff Frol Unversty of Veront ay@uv.edu, frol@eba.uv.edu Abstract hs paper nvestgates wreless sensor networ spatal resoluton as
More informationUsing Series to Analyze Financial Situations: Present Value
2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated
More informationA Statistical Model for Detecting Abnormality in StaticPriority Scheduling Networks with Differentiated Services
A Statstcal odel for Detectng Abnoralty n StatcProrty Schedulng Networks wth Dfferentated Servces ng L 1 and We Zhao 1 School of Inforaton Scence & Technology, East Chna Noral Unversty, Shangha 0006,
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 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 informationCONSTRUCTION OF A COLLABORATIVE VALUE CHAIN IN CLOUD COMPUTING ENVIRONMENT
CONSTRUCTION OF A COLLAORATIVE VALUE CHAIN IN CLOUD COMPUTING ENVIRONMENT Png Wang, School of Econoy and Manageent, Jangsu Unversty of Scence and Technology, Zhenjang Jangsu Chna, sdwangp1975@163.co Zhyng
More informationRevenue Maximization Using Adaptive Resource Provisioning in Cloud Computing Environments
202 ACM/EEE 3th nternatonal Conference on Grd Coputng evenue Maxzaton sng Adaptve esource Provsonng n Cloud Coputng Envronents Guofu Feng School of nforaton Scence, Nanng Audt nversty, Nanng, Chna nufgf@gal.co
More informationOnline Learning from Experts: Minimax Regret
E0 370 tatstcal Learnng Theory Lecture 2 Nov 24, 20) Onlne Learnng from Experts: Mn Regret Lecturer: hvan garwal crbe: Nkhl Vdhan Introducton In the last three lectures we have been dscussng the onlne
More informationUnderstanding the Impact of Marketing Actions in Traditional Channels on the Internet: Evidence from a Large Scale Field Experiment
A research and educaton ntatve at the MT Sloan School of Management Understandng the mpact of Marketng Actons n Tradtonal Channels on the nternet: Evdence from a Large Scale Feld Experment Paper 216 Erc
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 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 informationMathematical Theory for Prioritizing Projects and Optimally Allocating Capital
Matheatcal Theory for Prortzng Projects and Optally Allocatng Captal Lee Merkhofer, Ph.D. Ths techncal paper ntroduces the basc atheatcs for prortzng projects and optally allocatng lted captal resources.
More informationA R T I C L E S DYNAMIC VEHICLE DISPATCHING: OPTIMAL HEAVY TRAFFIC PERFORMANCE AND PRACTICAL INSIGHTS
A R T I C L E S DYAMIC VEHICLE DISPATCHIG: OPTIMAL HEAVY TRAFFIC PERFORMACE AD PRACTICAL ISIGHTS OAH GAS OPIM Departent, The Wharton School, Unversty of Pennsylvana, Phladelpha, Pennsylvana 191046366
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 informationState function: eigenfunctions of hermitian operators> normalization, orthogonality completeness
Schroednger equaton Basc postulates of quantum mechancs. Operators: Hermtan operators, commutators State functon: egenfunctons of hermtan operators> normalzaton, orthogonalty completeness egenvalues and
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 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 informationInventory Control in a MultiSupplier System
3th Intl Workng Senar on Producton Econocs (WSPE), Igls, Autrche, pp.56 Inventory Control n a MultSuppler Syste Yasen Arda and JeanClaude Hennet LAASCRS, 7 Avenue du Colonel Roche, 3077 Toulouse Cedex
More informationLecture 3: Force of Interest, Real Interest Rate, Annuity
Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annutymmedate, and ts present value Study annutydue, and
More informationA Note on the Decomposition of a Random Sample Size
A Note on the Decomposton of a Random Sample Sze Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract Ths note addresses some results of Hess 2000) on the decomposton
More informationI. SCOPE, APPLICABILITY AND PARAMETERS Scope
D Executve Board Annex 9 Page A/R ethodologcal Tool alculaton of the number of sample plots for measurements wthn A/R D project actvtes (Verson 0) I. SOPE, PIABIITY AD PARAETERS Scope. Ths tool s applcable
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 informationELE427  Testing Linear Sensors. Linear Regression, Accuracy, and Resolution.
ELE47  Testng Lnear Sensors Lnear Regresson, Accurac, and Resoluton. Introducton: In the frst three la eperents we wll e concerned wth the characterstcs of lnear sensors. The asc functon of these sensors
More informationTrivial lump sum R5.0
Optons form Once you have flled n ths form, please return t wth your orgnal brth certfcate to: Premer PO Box 2067 Croydon CR90 9ND. Fll n ths form usng BLOCK CAPITALS and black nk. Mark all answers wth
More informationWeb Servicebased Business Process Automation Using Matching Algorithms
Web Servcebased Busness Process Autoaton Usng Matchng Algorths Yanggon K and Juhnyoung Lee 2 Coputer and Inforaton Scences, Towson Uversty, Towson, MD 2252, USA, yk@towson.edu 2 IBM T. J. Watson Research
More informationInternational Journal of Information Management
Internatonal Journal of Inforaton Manageent 32 (2012) 409 418 Contents lsts avalable at ScVerse ScenceDrect Internatonal Journal of Inforaton Manageent j our nal ho e p age: www.elsever.co/locate/jnfogt
More information1. 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 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 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 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 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 informationQuestions that we may have about the variables
Antono Olmos, 01 Multple Regresson Problem: we want to determne the effect of Desre for control, Famly support, Number of frends, and Score on the BDI test on Perceved Support of Latno women. Dependent
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 informationWeek 6 Market Failure due to Externalities
Week 6 Market Falure due to Externaltes 1. Externaltes n externalty exsts when the acton of one agent unavodably affects the welfare of another agent. The affected agent may be a consumer, gvng rse to
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 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 informationA Lyapunov Optimization Approach to Repeated Stochastic Games
PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://wwwbcf.usc.edu/
More informationINTRODUCTION TO MERGERS AND ACQUISITIONS: FIRM DIVERSIFICATION
XV. INTODUCTION TO MEGES AND ACQUISITIONS: FIM DIVESIFICATION In the ntroducton to Secton VII, t was noted that frs can acqure assets by ether undertakng nternallygenerated new projects or by acqurng
More informationgreatest common divisor
4. GCD 1 The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no
More informationEnabling P2P Oneview Multiparty Video Conferencing
Enablng P2P Onevew Multparty Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract MultParty Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More information2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet
2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B1348 LouvanlaNeuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 Emal: corestatlbrary@uclouvan.be
More informationIDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS
IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS Chrs Deeley* Last revsed: September 22, 200 * Chrs Deeley s a Senor Lecturer n the School of Accountng, Charles Sturt Unversty,
More informationAn Analytical Model of Web Server Load Distribution by Applying a Minimum Entropy Strategy
Internatonal Journal of Coputer and Councaton Engneerng, Vol. 2, No. 4, July 203 An Analytcal odel of Web Server Load Dstrbuton by Applyng a nu Entropy Strategy Teeranan Nandhakwang, Settapong alsuwan,
More informationTechnical Report, SFB 475: Komplexitätsreduktion in Multivariaten Datenstrukturen, Universität Dortmund, No. 1998,04
econstor www.econstor.eu Der OpenAccessPublkatonsserver der ZBW LebnzInforatonszentru Wrtschaft The Open Access Publcaton Server of the ZBW Lebnz Inforaton Centre for Econocs Becka, Mchael Workng Paper
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 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 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 informationn + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)
MATH 16T Exam 1 : Part I (InClass) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total
More informationA Computer Technique for Solving LP Problems with Bounded Variables
Dhaka Unv. J. Sc. 60(2): 163168, 2012 (July) A Computer Technque for Solvng LP Problems wth Bounded Varables S. M. Atqur Rahman Chowdhury * and Sanwar Uddn Ahmad Department of Mathematcs; Unversty of
More informationPRIOR ROBUST OPTIMIZATION. Balasubramanian Sivan. A dissertation submitted in partial fulfillment of the requirements for the degree of
PRIOR ROBUST OPTIMIZATION By Balasubraanan Svan A dssertaton subtted n partal fulfllent of the requreents for the degree of Doctor of Phlosophy (Coputer Scences) at the UNIVERSITY OF WISCONSIN MADISON
More informationThe covariance is the two variable analog to the variance. The formula for the covariance between two variables is
Regresson Lectures So far we have talked only about statstcs that descrbe one varable. What we are gong to be dscussng for much of the remander of the course s relatonshps between two or more varables.
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 informationChapter 6 ReedSolomon Codes
Chapter 6 Reedoloon Codes. Introducton The Reedoloon codes R codes are nonbnary cyclc codes wth code sybols fro a Galos feld. They were dscovered n 96 by I. Reed and G. oloon. The work was done when
More informationFeasibility 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 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 information6. EIGENVALUES AND EIGENVECTORS 3 = 3 2
EIGENVALUES AND EIGENVECTORS The Characterstc Polynomal If A s a square matrx and v s a nonzero vector such that Av v we say that v s an egenvector of A and s the correspondng egenvalue Av v Example :
More informationFinancial Mathemetics
Fnancal Mathemetcs 15 Mathematcs Grade 12 Teacher Gude Fnancal Maths Seres Overvew In ths seres we am to show how Mathematcs can be used to support personal fnancal decsons. In ths seres we jon Tebogo,
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 information