Taming the Matthew Effect in Online Markets with Social Influence

Size: px
Start display at page:

Download "Taming the Matthew Effect in Online Markets with Social Influence"

Transcription

1 Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence AAAI-17 Taing the Matthew Effect in Online Markets with Social Influence Franco Berbeglia Carnegie Mellon University Pascal Van Hentenryck University of Michigan Abstract Social influence has been shown to create a Matthew effect in online arkets, increasing inequalities and leading to winner-take-all phenoena Matthew effects have been observed for nuerous arket policies, including when the products are presented to consuers by popularity or quality This paper studies how to reduce Matthew effects, while keeping arkets efficient and predictable when social influence is used It presents a arket strategy based on randoization and segentation, that ensures that the best products, if they are close in quality, will have reasonably close arket shares The benefits of this arket strategy is justified both theoretically and epirically and the loss in arket efficiency is shown to be acceptable Introduction Salganik, Dodds, and Watts 2006 wrote a seinal paper on the negative influence of social influence in cultural arkets They created an experiental virtual arket, called the MU- SICLAB, in which participants can listen to songs and then download the if they like the The songs are organized in a list or atrix for, giving different visibilities to the various songs, as is typically the case in online advertiseent, online stores, or physical retail stores eg, Craswell et al 2008; Li, Rodrigues, and Zhang 2004 Each song was also associated with a popularity signal eg, Engstro and Forsell 2014; Viglia, Furlan, and Ladrón-de Guevara 2014, ie, the nuber of downloads of the song by earlier arket participants In addition, all the songs were ranked by popularity, which eans that the song with the ost downloads received the ost visible position ie, the top of the list, the second ost popular song the second ost visible position, and so on Salganik, Dodds, and Watts 2006 showed that social influence creates unpredictable arkets, as well as significant Matthew effects Rigney 2010 Indeed, ultiple realizations of the MUSICLAB with various sets of participants show significantly different outcoes and strong inequalities in arket shares between the songs Those results have been reproduced by any authors in subsequent experients or siulations eg, Hu, Milner, and Wu 2016; Leran and Hogg 2014; Muchnik, Aral, and Taylor 2013; van de Rijt et al 2014 The MUSICLAB is an exaple of Copyright c 2017, Association for the Advanceent of Artificial Intelligence wwwaaaiorg All rights reserved trial and offer arkets which are particularly relevant in online settings The popularity ranking is also widely used by firs running such arkets in practice In recent years, soe authors have started revisiting soe of the assuptions in the MUSICLAB experient and, in particular, the ranking policy which is the ain controllable action of the fir running such a arket Van Hentenryck et al 2016 showed that, when the products are ranked by quality instead of popularity, the arket becoes asuyptotically predictable and optial: It leads a onopoly for the product of highest quality Abeliuk et al 2016 also proved that the dynaic ranking that optiizes the nuber of downloads at each step, which they called the perforance ranking Abeliuk et al 2015, leads to the sae outcoe These two ranking policies address the unpredictability and inefficiency of the arket under social influence identified by Salganik, Dodds, and Watts 2006 However, they fail to address the arket inequalities created by social influence: Two products of siilar appeals and qualities will have fundaentally different outcoes with one becoing a onopoly in the long run This winner-takes-all phenoena, although optial fro an efficiency standpoint, is typically considered undesirable This paper proposes a novel strategy that ais at addressing the three probles identified by Salganik, Dodds, and Watts 2006 siultaneously: unpredictability, inefficiencies, and inequalities The strategy is a randoized segentation protocol and is siple to deploy in online settings The paper also analyzes its properties both theoretically and experientally and shows that the protocol draatically reduces inequalities aong the best products in the arket, while preserving high predictability and efficiency The rest of the paper briefly reviews trial and offer arkets, presents the new randoized segentation protocol, and analyzes its properties both theoretically and experientally Trial and Offer Markets Following Krue et al 2012, this paper considers trial and offer arkets odeled with an extended ultinoial logit that includes product visibilities and social influence In these arkets, an incoing consuer observes n products in a list and a social influence vector d t, where d t i is the nuber of purchases of product i at tie t She can then saple one product eg, listening to a song and then de- 10

2 cides whether she wants to purchase it Each position j in the list is associated with a visibility v j that represents the inherent probability of sapling a product in position j or, intuitively, how uch custoers are attracted by a given position in the list Each product i is characterized by two values: an appeal a i which represents the probability of sapling product i and a quality q i which captures the probability of purchasing product i after it has been sapled Note that the appeals can capture soe for of externalities such as arketing capaigns The fir running the arket controls how to present the products to consuers, ie, where the products are positioned in the list In particular, the fir ust choose a ranking θ that assigns a position θi to each product i Asaresult, the probability that a custoer saples product i given ranking θ and social signal d is given by p i θ, d v θi a i + d i n j1 v θja j + d j The probability that a custoer purchases product i is then given by p i θ, d q i The fir is interested in axiizing the total nuber of purchases over tie, ie, n p i θ t,d t q i t i1 where θ t and d t are the ranking and social signals at tie t Prior work by Van Hentenryck et al 2016 has shown that the quality ranking, a static ranking which ranks the products of highest quality to the highest visibilities ie, q i >q j v θi v θj, leads to arkets where the product of highest quality becoes a onopoly asyptotically 1 The sae outcoe holds for the so-called perforance ranking that deterines the optial ranking θ at each step t, ie, θ arg-ax θ n i1 p iθ, d t q i These two ranking policies are optial and predictable asyptotically but they obviously create ajor Matthew effects: A sall difference in quality leads to a product losing its entire arket share in the long run Randoized Segentation We now propose a Randoized Segentation Protocol RSP to address the Matthew effect, while preserving predictability and efficiency The RSP is presented in Figure 1: It uses two key ideas to tae the Matthew effect First, it segents the arket in subarkets that we call worlds These worlds evolve independently with their own social influence signals and ranking policies This segentation itself has no ipact on the Matthew effect if the quality or perforance ranking is used, since the best-quality product will still obtain a onopoly in each world asyptotically and a large arket share over a finite horizon To counteract the Matthew effect, the RSP perturbs the product qualities slightly with soe rando noise of zero eans and then applies the quality ranking on these perturbed qualities 1 If several products have the sae highest product v θi q i, then the arket becoes a beta distribution aong the Overview of The Randoized Segentation Protocol 1 The arket is organized in sub-arkets called worlds 2 In each world, the product qualities are perturbed with a rando noise of zero ean The products are displayed using the quality ranking over the perturbed qualities 3 Each world aintains social influence signals independently of the other world 4 When a custoer enters the arket, she is randoly assigned to a world and presented with the ranking and the social signals of that world 5 If the custoer buys the product she sapled, the social signal of that product in that world is increased Figure 1: The Randoized Segentation Protocol RSP The qualities obviously reain the sae for the purpose of downloading the products As a result, each world ay now use a different ranking and a different product ay now take a substantial arket share Indeed, if the product with the second highest quality is placed in first position, it ay becoe the ost attractive product through the position visibilities, ie, v 1 q 2 >v 2 q 1 As a consequence, the RSP will balance the arket shares across the different worlds, ensuring a fairer distribution of the arket shares Theoretical Analysis This section foralizes the RSP ore precisely and presents a theoretical analysis of its behavior both in ters of inequalities, efficiency, and predictability Given the coplexity of the forulas, the analysis is only carried out for the perturbations of the first three products, but it generalizes naturally to ore products For siplicity, assue that the product qualities sastify q 1 q n and that the qualities of the top three products are reasonably close, ie, q 2 q 1 ɛ 2 1 q 3 q 1 ɛ 3 2 where ɛ 3 ɛ 2 0 More precisely, we assue that ɛ 2 and ɛ 3 are sall enough such that v 1 q 3 >v 2 q 1 As a result, a ranking 3, 1, 2 ensures that product 3 has the best noralized quality ie, its inherent quality ties the visibility of its position and the arket will go to a onopoly for product 3 asyptically Our proposed randoized segentation protocol partitions the arket in worlds and defines pertubed qualities ˆq i,w for each product i and world w as ˆq i,w q i + η i,w where η i,w is a norally distributed noise with zero ean and standard deviation σ In other words, η i,w is a rando variable distributed under the noral distribution f σ x 1 σ 2π exp x2 2σ

3 whose CDF F σ x is given by F σ x 1 [ ] x 1+erf 2 σ 2 Cobining this with the fact that the highest qualities are close, the perturbed qualities can thus be rewritten as ˆq 1,w q 1 + η 1,w, ˆq 2,w q 1 ɛ 2 + η 2,w, ˆq 3,w q 1 ɛ 3 + η 3,w In each world w, the products are ranked in ters of their perturbed qualities ˆq i,w instead of their intrinsic quality q i Hence, depending on the outcoes of the rando variables η 1,w, η 2,w and η 3,w, the products ay be ranked in the sequences 1,2,3, 1,3,2, 2,1,3, 2,3,1, 3,1,2, or 3,2,1 As a result, asyptically, the different worlds will converge to different onopolies: In soe of the, the arket will becoe a onopoly for product 1 while, in other worlds, the arket will becoe a onopoly for product 2 or product 3 To derive the theoretical results, we will use the following notations: η i,w η + i,w x + i x i x + ɛ i, x ɛ i, η i,w + ɛ i and η i,w ɛ i for i {2, 3} Theore 1 When the perturbed quality ranking is perfored in different worlds, the nuber of worlds in which products 1, 2 and 3 are ranked first denoted by s 1,, s 2, and s 3, respectively are given by the following binoial distributions Ps 1, k P k 1 k P 2 + P 3 k Ps 2, k P k 2 k P 1 + P 3 k Ps 3, k P k 3 k P 1 + P 2 k where P 1 P 2 P 3 f σ xf σ x + 2 F σx + 3 dx 4 f σ x + 2 F σxf σ x + 3 dx 5 f σ x + 3 F σxf σ x + 2 dx 6 Proof Let P 1 be the probability that ˆq 1,w be greater than axˆq 2,w, ˆq 3,w, ie, P 1 Pˆq 1,w > axˆq 2,w, ˆq 3,w P η 1,w > axη 2,w,η 3,w f σ xpx >η 2,w Px >η 3,w dx f σ xf σ x + 2 F σx + 3 dx Now let P 2 be the probabilty that ˆq 2,w be greater than axˆq 1,w, ˆq 3,w, ie, P 2 Pˆq 2,w > axˆq 1,w, ˆq 3,w P η 2,w > axη 1,w,η 3,w f σ x + 2 Px >η 1,wPx >η 3,w dx f σ x + 2 F σxf σ x + 3 dx Finally, let P 3 be the probability that ˆq 3,w be greater than axˆq 1,w, ˆq 2,w P 3 Pˆq 3,w > axˆq 1,w, ˆq 2,w P η 2,w > axη 1,w,η 3,w f σ x + 3 Px >η 1,wPx >η 2,w dx f σ x + 3 F σxf σ x + 2 dx Now the nuber of ties s 1, that product i is ranked first aong worlds is binoially distributed since, in each world, there is a probability P i that product i is ranked first Ps 1, k P k 1 k P 2 + P 3 k Ps 1, k P k 2 k P 1 + P 3 k Ps 1, k P k 3 k P 1 + P 2 k Corollary 2 The expectation and variance of s i, for i {1, 2, 3}, is given by E[s i, ]P i Var[s i, ]P i 1 P i Furtherore, the probabilities that the s i, s fall between their expected value ±X% are given by: P s 1, E[s 1, ] X 100 E[s 1,] 1+ X 100 E[s1,] k P 1 X 100 E[s1,] k P k 1 P 2 + P 3 k, s 2, E[s 2, ] X 100 E[s 2,] 1+ X 100 E[s2,] k P 1 X 100 E[s2,] 7 k P k2 P 1 + P 3 k 8 s 3, E[s 3, ] X 100 E[s 3,] 1+ X 100 E[s2,] k 1 X 100 E[s3,] k P k 3 P 1 + P 2 k 9 12

4 Figure 2: Probabilities that the nuber of worlds in which products 1, 2 and 3 becoe a onopoly fall in the expected value ± X % of the total nuber of worlds, as a function of the nuber of worlds Figure 3: Probabilities that products 1, 2, and 3 becoe a onopoly as a function of ɛ 2 where ɛ 3 2ɛ 2 and σ 01 We now quantify the loss ratio in purchases induced by the RSP copared to the asyptotically optial quality ranking, ie, d t q d t rsp l t d t, 10 q where d t q is the total nuber of purchases under the quality ranking at tie t and d t rsp is the total nuber of purchases of the RSP at t Expression 10 can be approxiated asyptotically with d t q q 1 t 11 and d t rsp q 1 P 1 + q 2 P 2 + q 3 P 3 t, 12 Equations 11 and 12 together with definition 10 can be used to characterize the asyptotic loss ratio, ie, l t ɛ 2P 2 + ɛ 3 P 3 q 1 13 Observe that, when q 2 and q 3 are equal to q 1, the RSP is optial but has no Matthew effect contrary to the quality and perforance ranking We now investigate the consequences of these results Figure 2 plots the probability that the nuber of worlds in which product i becoes a onopoly falls in between its expected value ± X % as a function of the nuber of worlds The plots are obtained fro Equations 7 9 for various values of paraeters ɛ 2 and ɛ 3 given σ 01 The figure also reports the forula for the expected arket shares that show a nice distribution of the purchases aong the products The plots also show a rapid convergence around the ean as the nuber of worlds increases Figure 3 depicts the probabilities that a given product becoes a onopoly as a function of ɛ 2 assuing that ɛ 3 2ɛ 2 and σ 01 The results show that, as the distance in quality increases, the arket shares also grow apart Figure 4: Probability that product 1,2 and 3 becoe a onopoly as a function of σ where ɛ 3 2ɛ but they reain nicely distributed aong the products as desired Figure 4 depicts the probabilities that a given product becoes a onopoly as a function of the standard deviation σ 01 given ɛ and ɛ 3 2ɛ 2 The figure shows how to use the standard deviation to balance the arket shares between the products It shows that sall standard deviations already balance the arket shares well, opening significant opportunities for controling the arket towards a desired outcoe Figures 5 plots the loss ratio as a function of ɛ 2 The ratio initially increases as ɛ 2 increases, since a lower quality product ay becoe a onopoly in soe worlds Once ɛ 2 approaches the standard deviation, the loss ratio starts to decrease since this sub-optial behavior is increasingly less likely to occur Experiental Results We now describe experiental results on the MusicLab settings Salganik, Dodds, and Watts 2006 Like previous stud- 13

5 Figure 7: Nuber of Purchases of the First 3 Products Figure 5: The Loss Ratio 13 as a Function of ɛ 2 When ɛ 3 2ɛ 2 and σ 01 Figure 8: Nuber of Purchases For the First 3 Products Figure 6: The Inequality Measure 14 over 50 Experients The largest possible Matthew effect is 2 ies, the experients use the setting in Krue et al 2012 which gives specific values for appeals, qualities, and visibilities The qualities of the second and third best products are odified to obtain a setting in which ɛ and ɛ the quality of the best product is q 1 08 This akes the Matthew effect particularly draatic, since a sall difference in quality induces large arket inequalities The experients ai at confiring the theoretical results within a finite horizon and at balancing the arket shares between the top three products The experients also use a standard deviation of σ 01 The presentation discusses the effectiveness of the RSP to tae the Matthew effect and the cost involved in doing so We also present soe results obtained on the original MUSICLAB data for copleteness Taing the Matthew Effect Figure 6 depicts the effectiveness of the RSP to tae the Matthew effect It reports the inequality easure d t 1 d t 2 2 +d t 1 dt 3 2 +d t 3 dt 2 2 d t 1 + dt dt 3 for the quality ranking and the RSP as the nuber of custoers increases The plot reports the ean solid and the ean ± the variance dashed lines for 50 siulations The largest possible Matthew effect with this easure is 2 The figure shows that the quality ranking converges towards 1 in average, while the RSP converges towards a value around 045 This represents a draatic reduction in inequalities aong the best products Figure 7 presents box plots for the total purchases of the top three products and clearly explains why there is such a reduction in the Matthew effect The figures suarize 50 experients, each with 2 illion custoers They show that the quality ranking ay produce significant Matthew effects since the third quartile exhibits purchases up to the order of and for the first two products This severe Matthew effect arises despite the fact that the products have alost the sae quality, showing the strong need of taing this effect in practice to obtain reasonably fair arkets In contrast, the RSP has a third quartile in the order of and for the sae products Observe also the higher edians and the saller variances in the RSP Figure 8 depicts the total nuber of purchases for the first three products in the quality ranking and in the RSP The plots show that the quality ranking has ore aggregate purchases We will coe back to this when we discuss the cost of fairness, ie, the cost of taing the Matthew effect Note also that the variance also increases in the RSP when aggregating the purchases of the three products, which is due to the added Gaussian noise and the weaker social influence since the arket is split in several words Of course, the variance for each product independently decreases in a substantial way, as discussed earlier 14

6 Figure 10: Purchase Loss Ratio 10 Worlds Figure 9: Purchase distribution for 500 experients with 2 illion custoers for the quality ranking and the RSP with 10 worlds right Figure 11: Purchase Loss Ratio 10 Worlds on the Actual MusicLab Data Figure 9 describes an interesting side-effect of the RSP: a significant decrease in outliers and variances for the total purchases of all products Observe how the top three products left side of the botto plot now have very siilar distributions and how the products in the range 4 15 have uch saller variances The segentation of the arket has strong benefits on the predictability of the arket as well that the loss slowly increases with the nuber of worlds Conclusion This paper presented a randoized segentation protocol RMS to jointly address the unpredictability, inefficiency, and inequalities created by social influence in trial and offer arkets The RMS was shown, both through theoretical analysis and siulations, to reove the Matthew effect aong the best products, balancing the arket shares as a function of product qualities The RMS also leads to predictable and efficient arkets as the loss in efficiency is shown to be very sall and tends to zero as the product qualities tend to the sae values As a result, the RMS sees to be a appealing, easy to deploy arketing strategy to leverage social influence in trial and offer arkets The Cost of Fairness Intuitively, the RSP has two net effects that ake the arket less efficient First, it reduces the ipact of social influence which is spread over any worlds, increasing the randoness in the early stage of the arket Second, it allows the arket to achieve onopolies that are not optial ie, onopolies of products whose quality is not the best aong all products Figure 10 quantifies this loss of efficiency: It depicts the average loss in purchases when using the RSP with 10 worlds As can be seen, the loss is sall and decreases significantly as the nuber of custoers increases, atching the theoretical predictions Figure 12 depicts the loss for the actual M USIC L AB data for various values of σ and the noise added to all songs Figure 12 shows how the loss varies at the nuber of worlds increases for different nuber of custoers The figure shows References Abeliuk, A; Berbeglia, G; Cebrian, M; and Van Hentenryck, P 2015 The benefits of social influence in optiized cultural arkets PLoS ONE

7 Abeliuk, A; Berbeglia, G; Maldonado, F; and Hentenryck, P V 2016 Asyptotic optiality of yopic optiization in trial-offer arkets with social influence In Kabhapati, S, ed, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, IJCAI/AAAI Press Craswell, N; Zoeter, O; Taylor, M; and Rasey, B 2008 An experiental coparison of click position-bias odels In Proceedings of the 2008 International Conference on Web Search and Data Mining, ACM Engstro, P, and Forsell, E 2014 Deand effects of consuers stated and revealed preferences Available at SSRN Hu, M; Milner, J; and Wu, J 2016 Liking and following and the newsvendor: Operations and arketing policies under social influence Manageent Science 623: Krue, C; Cebrian, M; Pickard, G; and Pentland, S 2012 Quantifying social influence in an online cultural arket PloS one 75:e33785 Leran, K, and Hogg, T 2014 Leveraging position bias to iprove peer recoendation PloS one 96:e98914 Li, A; Rodrigues, B; and Zhang, X 2004 Metaheuristics with local search techniques for retail shelf-space optiization Manageent Science 501: Muchnik, L; Aral, S; and Taylor, S J 2013 Social influence bias: A randoized experient Science : Rigney, D 2010 The Matthew Effect Colubia University Press Salganik, M J; Dodds, P S; and Watts, D J 2006 Experiental study of inequality and unpredictability in an artificial cultural arket Science : van de Rijt, A; Kang, S M; Restivo, M; and Patil, A 2014 Field experients of success-breeds-success dynaics Proceedings of the National Acadey of Sciences 11119: Van Hentenryck, P; Abeliuk, A; Berbeglia, F; Maldonado, F; and Berbeglia, G 2016 Aligning popularity and quality in online cultural arkets Tenth International AAAI Conference on Web and Social Media ICWSM-16 Viglia, G; Furlan, R; and Ladrón-de Guevara, A 2014 Please, talk about it! when hotel popularity boosts preferences International Journal of Hospitality Manageent 42: Figure 12: Purchase loss ratio as a function of the nuber of worlds for several nuber of trials The plot shows the average of 100 experients and the variance is shown with the error bars The paraeters chosen where σ 01, ɛ 3 2ɛ

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

More information

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna

More information

3.3 Variational Characterization of Singular Values

3.3 Variational Characterization of Singular Values 3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and

More information

Equilibria on the Day-Ahead Electricity Market

Equilibria on the Day-Ahead Electricity Market Equilibria on the Day-Ahead Electricity Market Margarida Carvalho INESC Porto, Portugal Faculdade de Ciências, Universidade do Porto, Portugal argarida.carvalho@dcc.fc.up.pt João Pedro Pedroso INESC Porto,

More information

Ensemble Based on Data Envelopment Analysis

Ensemble Based on Data Envelopment Analysis Enseble Based on Data Envelopent Analysis So Young Sohn & Hong Choi Departent of Coputer Science & Industrial Systes Engineering, Yonsei University, Seoul, Korea Tel) 82-2-223-404, Fax) 82-2- 364-7807

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

Sharp Time Data Tradeoffs for Linear Inverse Problems

Sharp Time Data Tradeoffs for Linear Inverse Problems Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used

More information

Interactive Markov Models of Evolutionary Algorithms

Interactive Markov Models of Evolutionary Algorithms Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary

More information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub

More information

OBJECTIVES INTRODUCTION

OBJECTIVES INTRODUCTION M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and

More information

A Smoothed Boosting Algorithm Using Probabilistic Output Codes

A Smoothed Boosting Algorithm Using Probabilistic Output Codes A Soothed Boosting Algorith Using Probabilistic Output Codes Rong Jin rongjin@cse.su.edu Dept. of Coputer Science and Engineering, Michigan State University, MI 48824, USA Jian Zhang jian.zhang@cs.cu.edu

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October

More information

arxiv: v1 [cs.ds] 3 Feb 2014

arxiv: v1 [cs.ds] 3 Feb 2014 arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

When Short Runs Beat Long Runs

When Short Runs Beat Long Runs When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long

More information

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest

More information

An improved self-adaptive harmony search algorithm for joint replenishment problems

An improved self-adaptive harmony search algorithm for joint replenishment problems An iproved self-adaptive harony search algorith for joint replenishent probles Lin Wang School of Manageent, Huazhong University of Science & Technology zhoulearner@gail.co Xiaojian Zhou School of Manageent,

More information

In this chapter, we consider several graph-theoretic and probabilistic models

In this chapter, we consider several graph-theoretic and probabilistic models THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions

More information

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer

More information

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t. CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a ournal published by Elsevier. The attached copy is furnished to the author for internal non-coercial research and education use, including for instruction at the authors institution

More information

Probability Distributions

Probability Distributions Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples

More information

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory Revealed Preference and Stochastic Deand Correspondence: A Unified Theory Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk

More information

Inference in the Presence of Likelihood Monotonicity for Polytomous and Logistic Regression

Inference in the Presence of Likelihood Monotonicity for Polytomous and Logistic Regression Advances in Pure Matheatics, 206, 6, 33-34 Published Online April 206 in SciRes. http://www.scirp.org/journal/ap http://dx.doi.org/0.4236/ap.206.65024 Inference in the Presence of Likelihood Monotonicity

More information

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter

More information

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

More information

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with

More information

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL

More information

Device-to-Device Collaboration through Distributed Storage

Device-to-Device Collaboration through Distributed Storage Device-to-Device Collaboration through Distributed Storage Negin Golrezaei, Student Meber, IEEE, Alexandros G Diakis, Meber, IEEE, Andreas F Molisch, Fellow, IEEE Dept of Electrical Eng University of Southern

More information

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

Combining Classifiers

Combining Classifiers Cobining Classifiers Generic ethods of generating and cobining ultiple classifiers Bagging Boosting References: Duda, Hart & Stork, pg 475-480. Hastie, Tibsharini, Friedan, pg 246-256 and Chapter 10. http://www.boosting.org/

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem 36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined

More information

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co

More information

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either

More information

Keywords: Estimator, Bias, Mean-squared error, normality, generalized Pareto distribution

Keywords: Estimator, Bias, Mean-squared error, normality, generalized Pareto distribution Testing approxiate norality of an estiator using the estiated MSE and bias with an application to the shape paraeter of the generalized Pareto distribution J. Martin van Zyl Abstract In this work the norality

More information

MULTIAGENT Resource Allocation (MARA) is the

MULTIAGENT Resource Allocation (MARA) is the EDIC RESEARCH PROPOSAL 1 Designing Negotiation Protocols for Utility Maxiization in Multiagent Resource Allocation Tri Kurniawan Wijaya LSIR, I&C, EPFL Abstract Resource allocation is one of the ain concerns

More information

Measures of average are called measures of central tendency and include the mean, median, mode, and midrange.

Measures of average are called measures of central tendency and include the mean, median, mode, and midrange. CHAPTER 3 Data Description Objectives Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance,

More information

W-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS

W-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS W-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS. Introduction When it coes to applying econoetric odels to analyze georeferenced data, researchers are well

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

Approximation in Stochastic Scheduling: The Power of LP-Based Priority Policies

Approximation in Stochastic Scheduling: The Power of LP-Based Priority Policies Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing

More information

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy Storage Capacity and Dynaics of Nononotonic Networks Bruno Crespi a and Ignazio Lazzizzera b a. IRST, I-38050 Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I-38050 Povo (Trento) Italy INFN Gruppo

More information

On Constant Power Water-filling

On Constant Power Water-filling On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives

More information

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique

More information

Sexually Transmitted Diseases VMED 5180 September 27, 2016

Sexually Transmitted Diseases VMED 5180 September 27, 2016 Sexually Transitted Diseases VMED 518 Septeber 27, 216 Introduction Two sexually-transitted disease (STD) odels are presented below. The irst is a susceptibleinectious-susceptible (SIS) odel (Figure 1)

More information

Scheduling Contract Algorithms on Multiple Processors

Scheduling Contract Algorithms on Multiple Processors Fro: AAAI Technical Report FS-0-04. Copilation copyright 200, AAAI (www.aaai.org). All rights reserved. Scheduling Contract Algoriths on Multiple Processors Daniel S. Bernstein, Theodore. Perkins, Shloo

More information

Testing equality of variances for multiple univariate normal populations

Testing equality of variances for multiple univariate normal populations University of Wollongong Research Online Centre for Statistical & Survey Methodology Working Paper Series Faculty of Engineering and Inforation Sciences 0 esting equality of variances for ultiple univariate

More information

A Note on the Applied Use of MDL Approximations

A Note on the Applied Use of MDL Approximations A Note on the Applied Use of MDL Approxiations Daniel J. Navarro Departent of Psychology Ohio State University Abstract An applied proble is discussed in which two nested psychological odels of retention

More information

Optimal Jamming Over Additive Noise: Vector Source-Channel Case

Optimal Jamming Over Additive Noise: Vector Source-Channel Case Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper

More information

LogLog-Beta and More: A New Algorithm for Cardinality Estimation Based on LogLog Counting

LogLog-Beta and More: A New Algorithm for Cardinality Estimation Based on LogLog Counting LogLog-Beta and More: A New Algorith for Cardinality Estiation Based on LogLog Counting Jason Qin, Denys Ki, Yuei Tung The AOLP Core Data Service, AOL, 22000 AOL Way Dulles, VA 20163 E-ail: jasonqin@teaaolco

More information

Testing Properties of Collections of Distributions

Testing Properties of Collections of Distributions Testing Properties of Collections of Distributions Reut Levi Dana Ron Ronitt Rubinfeld April 9, 0 Abstract We propose a fraework for studying property testing of collections of distributions, where the

More information

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence Best Ar Identification: A Unified Approach to Fixed Budget and Fixed Confidence Victor Gabillon Mohaad Ghavazadeh Alessandro Lazaric INRIA Lille - Nord Europe, Tea SequeL {victor.gabillon,ohaad.ghavazadeh,alessandro.lazaric}@inria.fr

More information

Biostatistics Department Technical Report

Biostatistics Department Technical Report Biostatistics Departent Technical Report BST006-00 Estiation of Prevalence by Pool Screening With Equal Sized Pools and a egative Binoial Sapling Model Charles R. Katholi, Ph.D. Eeritus Professor Departent

More information

Lower Bounds for Quantized Matrix Completion

Lower Bounds for Quantized Matrix Completion Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &

More information

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES

More information

Collaborative Filtering using Associative Neural Memory

Collaborative Filtering using Associative Neural Memory Collaborative Filtering using Associative Neural Meory Chuck P. La Electrical Engineering Departent Stanford University Stanford, CA chuckla@stanford.edu Abstract There are two types of collaborative filtering

More information

Hybrid System Identification: An SDP Approach

Hybrid System Identification: An SDP Approach 49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The

More information

Boosting with log-loss

Boosting with log-loss Boosting with log-loss Marco Cusuano-Towner Septeber 2, 202 The proble Suppose we have data exaples {x i, y i ) i =... } for a two-class proble with y i {, }. Let F x) be the predictor function with the

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE7C (Spring 018: Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee7c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee7c@berkeley.edu October 15,

More information

Revealed Preference with Stochastic Demand Correspondence

Revealed Preference with Stochastic Demand Correspondence Revealed Preference with Stochastic Deand Correspondence Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk Prasanta K. Pattanaik

More information

CS Lecture 13. More Maximum Likelihood

CS Lecture 13. More Maximum Likelihood CS 6347 Lecture 13 More Maxiu Likelihood Recap Last tie: Introduction to axiu likelihood estiation MLE for Bayesian networks Optial CPTs correspond to epirical counts Today: MLE for CRFs 2 Maxiu Likelihood

More information

arxiv: v3 [cs.ds] 22 Mar 2016

arxiv: v3 [cs.ds] 22 Mar 2016 A Shifting Bloo Filter Fraewor for Set Queries arxiv:1510.03019v3 [cs.ds] Mar 01 ABSTRACT Tong Yang Peing University, China yangtongeail@gail.co Yuanun Zhong Nanjing University, China un@sail.nju.edu.cn

More information

Ch 12: Variations on Backpropagation

Ch 12: Variations on Backpropagation Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith

More information

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax:

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax: A general forulation of the cross-nested logit odel Michel Bierlaire, EPFL Conference paper STRC 2001 Session: Choices A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics,

More information

A DESIGN GUIDE OF DOUBLE-LAYER CELLULAR CLADDINGS FOR BLAST ALLEVIATION

A DESIGN GUIDE OF DOUBLE-LAYER CELLULAR CLADDINGS FOR BLAST ALLEVIATION International Journal of Aerospace and Lightweight Structures Vol. 3, No. 1 (2013) 109 133 c Research Publishing Services DOI: 10.3850/S201042862013000550 A DESIGN GUIDE OF DOUBLE-LAYER CELLULAR CLADDINGS

More information

Synchronization in large directed networks of coupled phase oscillators

Synchronization in large directed networks of coupled phase oscillators CHAOS 16, 015107 2005 Synchronization in large directed networks of coupled phase oscillators Juan G. Restrepo a Institute for Research in Electronics and Applied Physics, University of Maryland, College

More information

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points

More information

Detection and Estimation Theory

Detection and Estimation Theory ESE 54 Detection and Estiation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electronic Systes and Signals Research Laboratory Electrical and Systes Engineering Washington University 11 Urbauer

More information

Use of PSO in Parameter Estimation of Robot Dynamics; Part One: No Need for Parameterization

Use of PSO in Parameter Estimation of Robot Dynamics; Part One: No Need for Parameterization Use of PSO in Paraeter Estiation of Robot Dynaics; Part One: No Need for Paraeterization Hossein Jahandideh, Mehrzad Navar Abstract Offline procedures for estiating paraeters of robot dynaics are practically

More information

Generalized Augmentation for Control of the k-familywise Error Rate

Generalized Augmentation for Control of the k-familywise Error Rate International Journal of Statistics in Medical Research, 2012, 1, 113-119 113 Generalized Augentation for Control of the k-failywise Error Rate Alessio Farcoeni* Departent of Public Health and Infectious

More information

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence Best Ar Identification: A Unified Approach to Fixed Budget and Fixed Confidence Victor Gabillon, Mohaad Ghavazadeh, Alessandro Lazaric To cite this version: Victor Gabillon, Mohaad Ghavazadeh, Alessandro

More information

PULSE-TRAIN BASED TIME-DELAY ESTIMATION IMPROVES RESILIENCY TO NOISE

PULSE-TRAIN BASED TIME-DELAY ESTIMATION IMPROVES RESILIENCY TO NOISE PULSE-TRAIN BASED TIME-DELAY ESTIMATION IMPROVES RESILIENCY TO NOISE 1 Nicola Neretti, 1 Nathan Intrator and 1,2 Leon N Cooper 1 Institute for Brain and Neural Systes, Brown University, Providence RI 02912.

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

Randomized Recovery for Boolean Compressed Sensing

Randomized Recovery for Boolean Compressed Sensing Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch

More information

SPECTRUM sensing is a core concept of cognitive radio

SPECTRUM sensing is a core concept of cognitive radio World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile

More information

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving

More information

Meta-Analytic Interval Estimation for Bivariate Correlations

Meta-Analytic Interval Estimation for Bivariate Correlations Psychological Methods 2008, Vol. 13, No. 3, 173 181 Copyright 2008 by the Aerican Psychological Association 1082-989X/08/$12.00 DOI: 10.1037/a0012868 Meta-Analytic Interval Estiation for Bivariate Correlations

More information

arxiv: v3 [cs.lg] 7 Jan 2016

arxiv: v3 [cs.lg] 7 Jan 2016 Efficient and Parsionious Agnostic Active Learning Tzu-Kuo Huang Alekh Agarwal Daniel J. Hsu tkhuang@icrosoft.co alekha@icrosoft.co djhsu@cs.colubia.edu John Langford Robert E. Schapire jcl@icrosoft.co

More information

RAFIA(MBA) TUTOR S UPLOADED FILE Course STA301: Statistics and Probability Lecture No 1 to 5

RAFIA(MBA) TUTOR S UPLOADED FILE Course STA301: Statistics and Probability Lecture No 1 to 5 Course STA0: Statistics and Probability Lecture No to 5 Multiple Choice Questions:. Statistics deals with: a) Observations b) Aggregates of facts*** c) Individuals d) Isolated ites. A nuber of students

More information

General Properties of Radiation Detectors Supplements

General Properties of Radiation Detectors Supplements Phys. 649: Nuclear Techniques Physics Departent Yarouk University Chapter 4: General Properties of Radiation Detectors Suppleents Dr. Nidal M. Ershaidat Overview Phys. 649: Nuclear Techniques Physics Departent

More information

IN modern society that various systems have become more

IN modern society that various systems have become more Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

1 Bounding the Margin

1 Bounding the Margin COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost

More information

ANALYSIS ON RESPONSE OF DYNAMIC SYSTEMS TO PULSE SEQUENCES EXCITATION

ANALYSIS ON RESPONSE OF DYNAMIC SYSTEMS TO PULSE SEQUENCES EXCITATION The 4 th World Conference on Earthquake Engineering October -7, 8, Beijing, China ANALYSIS ON RESPONSE OF DYNAMIC SYSTEMS TO PULSE SEQUENCES EXCITATION S. Li C.H. Zhai L.L. Xie Ph. D. Student, School of

More information

A LOSS FUNCTION APPROACH TO GROUP PREFERENCE AGGREGATION IN THE AHP

A LOSS FUNCTION APPROACH TO GROUP PREFERENCE AGGREGATION IN THE AHP ISAHP 003, Bali, Indonesia, August 7-9, 003 A OSS FUNCTION APPROACH TO GROUP PREFERENCE AGGREGATION IN THE AHP Keun-Tae Cho and Yong-Gon Cho School of Systes Engineering Manageent, Sungkyunkwan University

More information

arxiv: v1 [cs.ds] 17 Mar 2016

arxiv: v1 [cs.ds] 17 Mar 2016 Tight Bounds for Single-Pass Streaing Coplexity of the Set Cover Proble Sepehr Assadi Sanjeev Khanna Yang Li Abstract arxiv:1603.05715v1 [cs.ds] 17 Mar 2016 We resolve the space coplexity of single-pass

More information

Randomized Accuracy-Aware Program Transformations For Efficient Approximate Computations

Randomized Accuracy-Aware Program Transformations For Efficient Approximate Computations Randoized Accuracy-Aware Progra Transforations For Efficient Approxiate Coputations Zeyuan Allen Zhu Sasa Misailovic Jonathan A. Kelner Martin Rinard MIT CSAIL zeyuan@csail.it.edu isailo@it.edu kelner@it.edu

More information

C na (1) a=l. c = CO + Clm + CZ TWO-STAGE SAMPLE DESIGN WITH SMALL CLUSTERS. 1. Introduction

C na (1) a=l. c = CO + Clm + CZ TWO-STAGE SAMPLE DESIGN WITH SMALL CLUSTERS. 1. Introduction TWO-STGE SMPLE DESIGN WITH SMLL CLUSTERS Robert G. Clark and David G. Steel School of Matheatics and pplied Statistics, University of Wollongong, NSW 5 ustralia. (robert.clark@abs.gov.au) Key Words: saple

More information

Bayesian Approach for Fatigue Life Prediction from Field Inspection

Bayesian Approach for Fatigue Life Prediction from Field Inspection Bayesian Approach for Fatigue Life Prediction fro Field Inspection Dawn An and Jooho Choi School of Aerospace & Mechanical Engineering, Korea Aerospace University, Goyang, Seoul, Korea Srira Pattabhiraan

More information

Birthday Paradox Calculations and Approximation

Birthday Paradox Calculations and Approximation Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays

More information

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,

More information

Bipartite subgraphs and the smallest eigenvalue

Bipartite subgraphs and the smallest eigenvalue Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.

More information

Handwriting Detection Model Based on Four-Dimensional Vector Space Model

Handwriting Detection Model Based on Four-Dimensional Vector Space Model Journal of Matheatics Research; Vol. 10, No. 4; August 2018 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Handwriting Detection Model Based on Four-Diensional Vector

More information

An Introduction to Meta-Analysis

An Introduction to Meta-Analysis An Introduction to Meta-Analysis Douglas G. Bonett University of California, Santa Cruz How to cite this work: Bonett, D.G. (2016) An Introduction to Meta-analysis. Retrieved fro http://people.ucsc.edu/~dgbonett/eta.htl

More information

Optimal Pigouvian Taxation when Externalities Affect Demand

Optimal Pigouvian Taxation when Externalities Affect Demand Optial Pigouvian Taxation when Externalities Affect Deand Enda Patrick Hargaden Departent of Econoics University of Michigan enda@uich.edu Version of August 2, 2015 Abstract Purchasing a network good such

More information

Statistical Logic Cell Delay Analysis Using a Current-based Model

Statistical Logic Cell Delay Analysis Using a Current-based Model Statistical Logic Cell Delay Analysis Using a Current-based Model Hanif Fatei Shahin Nazarian Massoud Pedra Dept. of EE-Systes, University of Southern California, Los Angeles, CA 90089 {fatei, shahin,

More information

Adapting the Pheromone Evaporation Rate in Dynamic Routing Problems

Adapting the Pheromone Evaporation Rate in Dynamic Routing Problems Adapting the Pheroone Evaporation Rate in Dynaic Routing Probles Michalis Mavrovouniotis and Shengxiang Yang School of Coputer Science and Inforatics, De Montfort University The Gateway, Leicester LE1

More information