Technical Appendix for Voting, Speechmaking, and the Dimensions of Conflict in the US Senate

Size: px
Start display at page:

Download "Technical Appendix for Voting, Speechmaking, and the Dimensions of Conflict in the US Senate"

Transcription

1 Technica Appendix for Voting, Speechmaking, and the Dimensions of Confict in the US Senate In Song Kim John Londregan Marc Ratkovic Juy 6, 205 Abstract We incude here severa technica appendices. First, we formay derive the expressions for c vote and b vote p that appear in section two of the paper. The next contains some detais on the choice theoretic mode underying the standard topic mode. The remainder contain the detais for impementing the SFA mode. A The Legisator and Proposa Intercepts from the Voting Mode Let s start with the egisator s utiity from the aye : and nay aternatives: U ({r pd } D = 2 D a d (r pd x d 2 + ξ aye p ( U ({q pd } D = 2 D a d (q pd x d 2 + ξ nay p (2 Next, et s cacuate the difference between these expressions to get the egisator s preference intensity for the aye outcome. Substituting from expressions ( and (2 we have: Assistant Professor, Department of Poitica Science, Massachusetts Institute of Technoogy, Cambridge, MA, Emai: insong@mit.edu, URL: Professor of Poitics and Internationa Affairs, Woodrow Wison Schoo, Princeton University, Princeton NJ Phone: , Emai: jb@princeton.edu Assistant Professor, Department of Poitics, Princeton University, Princeton NJ Phone: , Emai: ratkovic@princeton.edu, URL: ratkovic

2 V p = U ({r pd } D U ({q pd } D = D a d (r pd x d 2 aye + ξ 2 p ( D a d (q pd x d = = D a d 2 (q2 pd r2 pd + D c vote a d +b vote p 2 2x pd (r pd q pd g vote pd + ξ aye p ( D a d D 2 (q2 pd r2 aye nay pd + E{ ξ p } E{ ξ p } + ( ξnay p ξ aye ξ nay p nay ξ p a d 2 2x pd (r pd q pd g vote pd p + E{ ξ aye nay p } E{ ξ p } (3 ɛ p Now et: E{ ξ aye p } = πaye + ϕ aye p and E{ ξ nay p } = πnay + ϕ nay p substituting this into our expression for c vote + b vote p we have: D a D d 2 (q2 pd r2 aye nay pd + E{ ξ p } E{ ξ p } = = π aye π nay c vote = c vote a d 2 (q2 pd r2 pd + (πaye + b vote p + + ϕ aye p (π nay + ϕ nay p D a d 2 (q2 pd r2 pd + ϕaye p ϕ nay p b vote p Now et s return to the ast ine of expression (3 and substitute:

3 Vp = U ({r pd } D U ({q pd } D = ( D a d D 2 (q2 pd r2 aye nay pd + E{ ξ p } E{ ξ p } + = c vote + b vote p + c vote +b vote ( ξnay p aye p ξ p D Expression (4 matches expression (4 in the text. + E{ ξ aye nay p } E{ ξ p } ɛ p a d 2 2x pd (r pd q pd g vote pd a d x pd g vote pd ɛ p (4 B Choice Theoretic Underpinnings of Topic Modes Whie we opt for SFA, it is usefu to consider the behavior that woud ead one to adopt a topic mode for egisative speech. One way to do this is to suppose that a egisator s speech is generated by the random arriva of opportunities to speak. At each opportunity the egisator must choose one word from a exicon, which we represent by a W vector ω, with each entry corresponding to a different word. Each word has a spatia ocation, which for the moment we pace on a singe dimension. Legisator j {... V } woud derive utiity u( w x j + η j,t from uttering word j {... W } at time t. Shoud the opportunity to speak at time t actuay arise, the egisator utters the word offering the greatest utiity. To keep things simpe we assume that η j,t and η r,s are independent if either j r or t s. Paraeing the deveopment in Maddaa (983, we operationaize our mode with a distributiona assumption for η j,t R, which we take to foow a type I extreme vaue distribution, with probabiity density: f(η = e (η+e η 2

4 and by concretizing the utiity function u( w x j : u( w x j = 2( w x j 2 (5 where x j is the preferred ideoogica signa that egisator j woud ike to convey, and w is the ideoogica connotation of word i. Again foowing Maddaa (983 we see that the probabiity that at a randomy chosen time t egisator j prefers word i to a other eements of the exicon is: q j = eu( w x j W e u( w k x j k= Let word correspond to a stop word. We can rewrite the probabiity j uses word i if she has the opportunity to speak at t as: q j = eu( w x j u( w x j W e u( w k x j u( w x j k= substituting from equation (5 into our expression for q j we have: e x jg +b q j (x, g, b = (6 + W e x jg k +b k k=2 where g k = w k w and b k = w k+ w 2 for k {2... W }. The probabiity of an observed W vector c of word counts is: W q j (x, g, b cw (7 w= With the right choice of Dirichet priors this turns into the atent Dirichet mode of Bei, Ng and Jordan (2003 if we set x j = g = 0 for a i and j. In the idea point setting, though, x j and 3

5 g i correspond with precisey the preferred outcomes and term ideoogies with which we are most interested. Estimation for these modes are not straightforward, requiring a Metropois agorithm or variationa approximations. We favor SFA on theoretica grounds, as it aows egisators to seect words as a function of their preferred outcomes. We aso favor it because it offers a tractabe Gibbs samping scheme for most of the parameters, which we address in the next section. C Estimation of SFA We now shift to a more condensed notation. Hereafter, we reindex the vote and term outcomes using a common index, j, which fas into two sets: J terms and J votes for whether the observed outcome (now a common Y j is a term outcome or vote outcome, and J = J terms + J votes. We wi aso supress the superscript for the θ terms w ikeihood is given by: and θ votes p whie changing to the joint subscript j. The L ( θ vote, θ term, τ T, L ( P Ṽ = = p= P r{v p = W +P Ṽp } 2P W w= P r{t w = T w } W +P 2W. (8 where: P r{t w = T Φ ( θ terms w τ 0 w } = ( ( Φ θw terms τ Tw Φ θw terms τ Tw P r{v p = Ṽp } = Φ ( (2Ṽp θp vote T w = 0 0 < T w (9 (0 and the prior structure is given by: 4

6 c, b w i.i.d. N (µ, µ N (0, g wd, x d og(β, og(β 2 i.i.d. N (0, 4 i.i.d. N (0, ( Pr(a d = 2λ e λ a d Pr(λ =.78e.78λ Combining the ikeihood and prior gives us the posterior: Pr(θ j, τ, β, β 2 Y = L j J { { } (j {jvotes} Φ (θ j Y j ( Φ (θ j Y j { Φ ( ( } (j {Jterms} τ Yj θ j Φ θj τ Yj } 2π e 2 µ2 d D L L 2π e 2 (c µ 2 2 2π e 8 (x d 2 d D L j J 2π e 2 (b j µ 2 2 2π e 8 (g jd 2 e 2 (og β 2 e 2 (og β 2 2 e.78λ β 2π β 2 2π d D 2λ e λ a d (2 We impement two forms of data augmentation. In the first, for each observation we introduce a norma random variabe Z j as is standard in atent probit modes (Abert and Chib, 993. This transforms the ikeihood into a east squares probem, as: Pr(Y j = k Z j, θ j, τ, β, β 2 = L j J 2π e 2 (Z j θ j 2 (3 The second form of augmentation invoves representing the doube exponentia prior for a d to maintain conjugacy. Foowing Park and Casea (2008, we introduce atent variabes τ, such that: 5

7 d τ 2 N (0 D, D τ (4 D τ = diag( τ 2, τ 2 2,, τ 2 D (5 τ 2, τ 2 2,..., τ 2 D d D λ 2 2 e λ2 τ 2 d /2 d τ 2 d (6 where, after integrating out τ 2, we are eft with the LASSO prior. The proposed method differs from the presentation in Park and Casea (2008 in that we know σ 2 =, by assumption. C. The Gibbs Samper Next, we outine the Gibbs samper. A conditiona posterior densities are conjugate normas except λ, τ 2, β, and β 2. For a derivation of the posterior densities of λ and τ 2, see Park and Casea (2008. We fit β and β 2, which determine τ, using a Hamitonian Monte Caro agorithm, but first we describe the Gibbs updates. The Gibbs updates occur in two steps. First, we pace a data on the atent z scae. Second, we update a of the remaining parameters. For the first step, we sampe as: T N (θ j,, 0, ; Y j =, j j votes T N (θ j,,, 0 ; Y j = 0, j j votes Zj (7 T N (θ j,, τ k, τ k ; Y j = k, j J terms N (θ j, ; Y j missing Note that we have ignored missing vaues up to this point. In the Bayesian framework used here, imputing is straightforward: the truncated norma is repaced with a standard norma, whether term or vote data. Next, we update a of θ j except for τ using a Gibbs samper, as: 6

8 µ N c N b j N ( L J = j= Z j, LJ + L 2 J 2 + ( J j= Z j J +, J 2 + ( L = Z j L +, L 2 + (8 (9 (20 Z j = Z j c b j + µ (2 Update x, w, v from SVD of Z (22 a N X = ( A X vec(z, A where [ ( ( ( ] vec x g : vec x 2 g 2 :... : vec x L g L A = X X + T with T = diag(τ 2 x d N where J j= Z j, da dg j J j= N g j d ( a 2 dg 2 j d + 4J L = Z j, d a dx d L =, J j= (a 2 dg 2 j d + 4J ( a 2 dx 2 d + 4L and, L = (a 2 dx 2 d + 4L (23 (24 (25 τ 2 InvGauss ( λ 2 Gamma Z = Z j, d j x dg jd a d d d ( λ 2 a 2 d L +,, λ 2 L τ 2 / = (26 (27 C.2 The Hamitonian Monte Caro Samper We have no cosed form estimates for the conditiona posterior densities of β and β 2. To estimate these, we impement a Hamitonian Monte Caro scheme adapted directy from Nea (20. We 7

9 adapt the agorithm in one important manner: rather than taking a negative gradient step, we cacuate the numerica Hessian and take a fraction (α of a Newton-Raphson step at each. We seect α so that the acceptance ratio of proposed (β, β 2 is about.4. Specificay, et dev(β, β 2 denote the estimate deviance at the point (β, β 2. Define the numerica gradients, dev(β, β 2 and 2 dev(β, β 2 as the estimated gradient at (β, β 2 and dev(β, β 2, 22 dev(β, β 2, and 2 dev(β, β 2 as the cross derivative. Next, define the empirica Hessian as: dev(β, β 2 2 dev(β, β 2 Ĥ(β, β 2 = (28 2 dev(β, β 2 22 dev(β, β 2 We impement the agorithm in Nea (20 exacty, except instead taking updates of the form: β β 2 we instead do updates of the form: + := β β 2 (β, β 2 α (29 2 (β, β 2 β β 2 + := β β 2 } (β, β 2 α {Ĥ(β, β 2 (30 2 (β, β 2 where the Hessian and gradients are updated every third update of the parameters. The step ength parameter α is adjust every 50 iterations to by a factor of 4/5 if the acceptance rate is beow 0%, 5/4 if the acceptance rate is above 90%, and eft the same otherwise. After the burn-in period, the acceptance rate eves off around 45%. We impement twenty steps in order to produce a proposa. 8

10 C.3 Numerica Approximation of the Deviance Cacuating the gradient and Hessian terms, and assessing the proposa, in the Hamitonian Monte Caro scheme requires evauating functions of the form (a, b = og(φ(a Φ(b. Unfortunatey, for vaues of a and b much arger in magnitude than 5.3 produces returns vaues of or 0, eaving it impossibe to evauate the ogarithm. Extrapoating from the observed vaues yieds the inear approximation: (a, b = a b a 2 b 2 og( a b {og( a b } 2 ab γ (3 where 9

11 γ = We derived the vaues for γ from fitting a mode over the range 4 b < a 8. (32 We get a mean absoute error of 0.065, or 0.08% error as a fraction of the vaue returned by R. We use this approximation in order to extrapoate to vaues where R returns vaues of NA or Inf for f(a, b. D How do Dimensions and Topics Differ? As we noted in the introduction, there is an apparent inconsistency between Congress voting across a broad array of topics (nationa defense, agricuture, socia insurance, etc. whie ro ca voting over this range of substantive topics arranges into a singe dimensiona ideoogica space. This seeming paradox is cosey tied to the distinction between topics, as estimated by topic modes, and dimensions, as estimated by SFA. There is no actua contradiction. Which rendition of Congress a researcher finds more usefu: a coection of substantive egisative topics subject to Congressiona dispensation, or a ow dimensiona radiography of the ideoogica space that organizes Congress, depends on the researcher s objectives. To differentiate topics from dimensions, consider the distinction between surface and source traits. Factor anaysis pioneer Raymond Catte characterized a surface trait as... an obvious going together of this and that whie he defined the source trait as the underying contributor or 0

12 Data Generating Process for Comparing SFA and Topic Modes: Likeihood of Voting Yes For Each Legisator by Vote Legisator Vote Vote 2 Vote 3 Vote 4 Vote 5 Vote 6 Legisator 2 Legisator 3 Legisator 4 Legisator 5 Legisator 6 Legisator 7 Legisator 8 Legisator 9 Legisator 0 Darker Coor Means More Likey to Vote Yay Figure : Simuated data setup. Legisators are arrayed across rows and votes across coumns. The darker the square, the more ikey the egisator to vote Aye on that particuar vote. determiner of the observed surface traits (?, p. 45. As an exampe, he offered common symptoms of schizophrenia as surface traits, whie the underying syndrome itsef is the source trait. We provide an exampe to iustrate the point. Assume ten egisators facing six votes. For simpicity, the true underying probabiity of voting Aye comes from an underying process with one ideoogica dimension, as presented in Figure. Legisators are arrayed across rows and votes across coumns. The darker the square, the more ikey the egisator to vote Aye on that particuar proposa. Legisators 5 are more ikey to vote Aye on the first 3 votes and more ikey to vote Nay on the ast 3. Legisators 6 0 are more ikey to vote Nay on the first 3 votes, and Aye on the ast 3. Legisators 5 and 6 are reative moderates, whie bis 3 and 4 are reativey noncontroversia. We fit both SFA and a topic mode to a draw of the vote data. In order to fit a topic mode, we assume each egisator uttered six terms representing their vote and the bi number. For exampe, Specificay, et s i = { 4.5, 3.5,..., 4.5} and w j = { 2.5,.5,..., 2.5}. We drew Y j Bern (Φ(s iw j/2.

13 SFA Resuts Topic Mode Resuts Dimension Most Preferred Bi Dispacements Outcomes Weights Topic Topic 2 Topic Nay on 2 Nay on 4 Aye on Nay on Nay on 6 Nay on Aye on 4 Aye on 2 Aye on Aye on 6 Aye on 3 Aye on Tabe : Resuts from SFA and a Topic Mode on the Simuated Dataset. if the egisator voted Nay on vote 4, we assume that they said Nay on 4, and enter that into a topic mode as a unique word. Each egisator then uttered six eements from the set { Aye on, Nay on, Aye on 2, Nay on 2,..., Aye on 6, Nay on 6 }, one of either Aye or Nay on votes -6. We impemented the EM version of SFA and aso gave the same data to the a Structura Topic Mode, as impemented in stm. We fit a three-topic mode to the data. Four-, five-, and six-topic modes returned quaitativey simiar resuts. The eft three coumns of Tabe contain the resuts from SFA. The first coumn contains the estimated posterior mode, and ony the first dimension has a non-zero mode. The next two coumns contain each egisator s idea points and the bi estimates. SFA returns estimates of the underying structure, correcty recovering the unidimensiona structure of the data generating process, and identifying egisators -4 and 7-0 as reative extremists at opposite ends of the spectrum. SFA aso successfuy identifies the reativey moderate egisators, 5 and 6, and correcty notes which proposas wi draw support from which egisators. The rightmost three coumns of Tabe report the topic mode estimates, presenting the first four terms of the three fitted topics. Consider the first topic. Legisators that vote Nay on votes and 2 are ikey to vote Aye on votes 4 and 6. Simiary, considering the second topic, egisators 2

14 who vote Nay on votes 4 and 6 are ikey to vote Aye on votes 2 and 3. The topic mode is returning surface traits symptoms of an underying ideoogica dimension, but not the dimension itsef. Topic modes provide an exceent too for summarizing word co-occurrence if the goa is primariy descriptive (e.g.,?. If, on the other hand, the researcher seeks to identify the underying structure of the source of the observed behavior, whether it is speech or voting, then SFA provides a cearer picture. 3

15 References Abert, James H. and Siddhartha Chib Bayesian Anaysis of Binary and Poychotomous Response Data. Journa of the American Statistica Association 88: Bei, David M., Andrew Y. Ng and Michae I. Jordan Latent dirichet aocation. J. Mach. Learn. Res. 3: Maddaa, Gangadharrao Soundayarao Limited Dependent and Quaitative Variabes in Econometrics. New York: Cambridge. Nea, Radford. 20. MCMC Using Hamitonian Dynamics. In Handbook of Markov Chain Monte Caro, ed. Steve Brooks, Andrew Geman, Gain Jones and Xiao-Li Meng. CRC Handbooks of Modern Statistica Method Chapman and Ha. Park, Trevor and George Casea The bayesian asso. Journa of the American Statistica Association 03(482:

CS229 Lecture notes. Andrew Ng

CS229 Lecture notes. Andrew Ng CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view

More information

STA 216 Project: Spline Approach to Discrete Survival Analysis

STA 216 Project: Spline Approach to Discrete Survival Analysis : Spine Approach to Discrete Surviva Anaysis November 4, 005 1 Introduction Athough continuous surviva anaysis differs much from the discrete surviva anaysis, there is certain ink between the two modeing

More information

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Brandon Maone Department of Computer Science University of Hesini February 18, 2014 Abstract This document derives, in excrutiating

More information

A. Distribution of the test statistic

A. Distribution of the test statistic A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch

More information

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7 6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17 Soution 7 Probem 1: Generating Random Variabes Each part of this probem requires impementation in MATLAB. For the

More information

(This is a sample cover image for this issue. The actual cover is not yet available at this time.)

(This is a sample cover image for this issue. The actual cover is not yet available at this time.) (This is a sampe cover image for this issue The actua cover is not yet avaiabe at this time) This artice appeared in a journa pubished by Esevier The attached copy is furnished to the author for interna

More information

AST 418/518 Instrumentation and Statistics

AST 418/518 Instrumentation and Statistics AST 418/518 Instrumentation and Statistics Cass Website: http://ircamera.as.arizona.edu/astr_518 Cass Texts: Practica Statistics for Astronomers, J.V. Wa, and C.R. Jenkins, Second Edition. Measuring the

More information

ASummaryofGaussianProcesses Coryn A.L. Bailer-Jones

ASummaryofGaussianProcesses Coryn A.L. Bailer-Jones ASummaryofGaussianProcesses Coryn A.L. Baier-Jones Cavendish Laboratory University of Cambridge caj@mrao.cam.ac.uk Introduction A genera prediction probem can be posed as foows. We consider that the variabe

More information

Automobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn

Automobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn Automobie Prices in Market Equiibrium Berry, Pakes and Levinsohn Empirica Anaysis of demand and suppy in a differentiated products market: equiibrium in the U.S. automobie market. Oigopoistic Differentiated

More information

AALBORG UNIVERSITY. The distribution of communication cost for a mobile service scenario. Jesper Møller and Man Lung Yiu. R June 2009

AALBORG UNIVERSITY. The distribution of communication cost for a mobile service scenario. Jesper Møller and Man Lung Yiu. R June 2009 AALBORG UNIVERSITY The distribution of communication cost for a mobie service scenario by Jesper Møer and Man Lung Yiu R-29-11 June 29 Department of Mathematica Sciences Aaborg University Fredrik Bajers

More information

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with? Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine

More information

Do Schools Matter for High Math Achievement? Evidence from the American Mathematics Competitions Glenn Ellison and Ashley Swanson Online Appendix

Do Schools Matter for High Math Achievement? Evidence from the American Mathematics Competitions Glenn Ellison and Ashley Swanson Online Appendix VOL. NO. DO SCHOOLS MATTER FOR HIGH MATH ACHIEVEMENT? 43 Do Schoos Matter for High Math Achievement? Evidence from the American Mathematics Competitions Genn Eison and Ashey Swanson Onine Appendix Appendix

More information

A Comparison Study of the Test for Right Censored and Grouped Data

A Comparison Study of the Test for Right Censored and Grouped Data Communications for Statistica Appications and Methods 2015, Vo. 22, No. 4, 313 320 DOI: http://dx.doi.org/10.5351/csam.2015.22.4.313 Print ISSN 2287-7843 / Onine ISSN 2383-4757 A Comparison Study of the

More information

Appendix for Stochastic Gradient Monomial Gamma Sampler

Appendix for Stochastic Gradient Monomial Gamma Sampler 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 3 3 33 34 35 36 37 38 39 4 4 4 43 44 45 46 47 48 49 5 5 5 53 54 Appendix for Stochastic Gradient Monomia Gamma Samper A The Main Theorem We provide the foowing

More information

The EM Algorithm applied to determining new limit points of Mahler measures

The EM Algorithm applied to determining new limit points of Mahler measures Contro and Cybernetics vo. 39 (2010) No. 4 The EM Agorithm appied to determining new imit points of Maher measures by Souad E Otmani, Georges Rhin and Jean-Marc Sac-Épée Université Pau Veraine-Metz, LMAM,

More information

A Brief Introduction to Markov Chains and Hidden Markov Models

A Brief Introduction to Markov Chains and Hidden Markov Models A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,

More information

A proposed nonparametric mixture density estimation using B-spline functions

A proposed nonparametric mixture density estimation using B-spline functions A proposed nonparametric mixture density estimation using B-spine functions Atizez Hadrich a,b, Mourad Zribi a, Afif Masmoudi b a Laboratoire d Informatique Signa et Image de a Côte d Opae (LISIC-EA 4491),

More information

Appendix for Stochastic Gradient Monomial Gamma Sampler

Appendix for Stochastic Gradient Monomial Gamma Sampler Appendix for Stochastic Gradient Monomia Gamma Samper A The Main Theorem We provide the foowing theorem to characterize the stationary distribution of the stochastic process with SDEs in (3) Theorem 3

More information

Testing for the Existence of Clusters

Testing for the Existence of Clusters Testing for the Existence of Custers Caudio Fuentes and George Casea University of Forida November 13, 2008 Abstract The detection and determination of custers has been of specia interest, among researchers

More information

MONTE CARLO SIMULATIONS

MONTE CARLO SIMULATIONS MONTE CARLO SIMULATIONS Current physics research 1) Theoretica 2) Experimenta 3) Computationa Monte Caro (MC) Method (1953) used to study 1) Discrete spin systems 2) Fuids 3) Poymers, membranes, soft matter

More information

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations Optimaity of Inference in Hierarchica Coding for Distributed Object-Based Representations Simon Brodeur, Jean Rouat NECOTIS, Département génie éectrique et génie informatique, Université de Sherbrooke,

More information

Separation of Variables and a Spherical Shell with Surface Charge

Separation of Variables and a Spherical Shell with Surface Charge Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation

More information

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After

More information

Efficiently Generating Random Bits from Finite State Markov Chains

Efficiently Generating Random Bits from Finite State Markov Chains 1 Efficienty Generating Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown

More information

Stat 155 Game theory, Yuval Peres Fall Lectures 4,5,6

Stat 155 Game theory, Yuval Peres Fall Lectures 4,5,6 Stat 155 Game theory, Yuva Peres Fa 2004 Lectures 4,5,6 In the ast ecture, we defined N and P positions for a combinatoria game. We wi now show more formay that each starting position in a combinatoria

More information

Problem set 6 The Perron Frobenius theorem.

Problem set 6 The Perron Frobenius theorem. Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator

More information

Statistical Learning Theory: A Primer

Statistical Learning Theory: A Primer Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO

More information

8 APPENDIX. E[m M] = (n S )(1 exp( exp(s min + c M))) (19) E[m M] n exp(s min + c M) (20) 8.1 EMPIRICAL EVALUATION OF SAMPLING

8 APPENDIX. E[m M] = (n S )(1 exp( exp(s min + c M))) (19) E[m M] n exp(s min + c M) (20) 8.1 EMPIRICAL EVALUATION OF SAMPLING 8 APPENDIX 8.1 EMPIRICAL EVALUATION OF SAMPLING We wish to evauate the empirica accuracy of our samping technique on concrete exampes. We do this in two ways. First, we can sort the eements by probabiity

More information

Stochastic Variational Inference with Gradient Linearization

Stochastic Variational Inference with Gradient Linearization Stochastic Variationa Inference with Gradient Linearization Suppementa Materia Tobias Pötz * Anne S Wannenwetsch Stefan Roth Department of Computer Science, TU Darmstadt Preface In this suppementa materia,

More information

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University Turbo Codes Coding and Communication Laboratory Dept. of Eectrica Engineering, Nationa Chung Hsing University Turbo codes 1 Chapter 12: Turbo Codes 1. Introduction 2. Turbo code encoder 3. Design of intereaver

More information

Target Location Estimation in Wireless Sensor Networks Using Binary Data

Target Location Estimation in Wireless Sensor Networks Using Binary Data Target Location stimation in Wireess Sensor Networks Using Binary Data Ruixin Niu and Pramod K. Varshney Department of ectrica ngineering and Computer Science Link Ha Syracuse University Syracuse, NY 344

More information

Research of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance

Research of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance Send Orders for Reprints to reprints@benthamscience.ae 340 The Open Cybernetics & Systemics Journa, 015, 9, 340-344 Open Access Research of Data Fusion Method of Muti-Sensor Based on Correation Coefficient

More information

Explicit overall risk minimization transductive bound

Explicit overall risk minimization transductive bound 1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,

More information

Traffic data collection

Traffic data collection Chapter 32 Traffic data coection 32.1 Overview Unike many other discipines of the engineering, the situations that are interesting to a traffic engineer cannot be reproduced in a aboratory. Even if road

More information

Math 124B January 31, 2012

Math 124B January 31, 2012 Math 124B January 31, 212 Viktor Grigoryan 7 Inhomogeneous boundary vaue probems Having studied the theory of Fourier series, with which we successfuy soved boundary vaue probems for the homogeneous heat

More information

Paragraph Topic Classification

Paragraph Topic Classification Paragraph Topic Cassification Eugene Nho Graduate Schoo of Business Stanford University Stanford, CA 94305 enho@stanford.edu Edward Ng Department of Eectrica Engineering Stanford University Stanford, CA

More information

arxiv: v1 [hep-lat] 21 Nov 2011

arxiv: v1 [hep-lat] 21 Nov 2011 Deta I=3/2 K to pi-pi decays with neary physica kinematics arxiv:1111.4889v1 [hep-at] 21 Nov 2011 University of Southampton, Schoo of Physics and Astronomy, Highfied, Southampton, SO17 1BJ, United Kingdom

More information

A Fully Nonparametric Modelling Approach to Binary Regression

A Fully Nonparametric Modelling Approach to Binary Regression A Fuy Nonparametric Modeing Approach to Binary Regression Maria DeYoreo and Athanasios Kottas Apri 16, 2014 Abstract We propose a genera nonparametric Bayesian framework for binary regression, which is

More information

SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS

SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia

More information

From Margins to Probabilities in Multiclass Learning Problems

From Margins to Probabilities in Multiclass Learning Problems From Margins to Probabiities in Muticass Learning Probems Andrea Passerini and Massimiiano Ponti 2 and Paoo Frasconi 3 Abstract. We study the probem of muticass cassification within the framework of error

More information

Stochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract

Stochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract Stochastic Compement Anaysis of Muti-Server Threshod Queues with Hysteresis John C.S. Lui The Dept. of Computer Science & Engineering The Chinese University of Hong Kong Leana Goubchik Dept. of Computer

More information

A Statistical Framework for Real-time Event Detection in Power Systems

A Statistical Framework for Real-time Event Detection in Power Systems 1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem

More information

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is

More information

arxiv:quant-ph/ v3 6 Jan 1995

arxiv:quant-ph/ v3 6 Jan 1995 arxiv:quant-ph/9501001v3 6 Jan 1995 Critique of proposed imit to space time measurement, based on Wigner s cocks and mirrors L. Diósi and B. Lukács KFKI Research Institute for Partice and Nucear Physics

More information

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c)

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c) A Simpe Efficient Agorithm of 3-D Singe-Source Locaization with Uniform Cross Array Bing Xue a * Guangyou Fang b Yicai Ji c Key Laboratory of Eectromagnetic Radiation Sensing Technoogy, Institute of Eectronics,

More information

BP neural network-based sports performance prediction model applied research

BP neural network-based sports performance prediction model applied research Avaiabe onine www.jocpr.com Journa of Chemica and Pharmaceutica Research, 204, 6(7:93-936 Research Artice ISSN : 0975-7384 CODEN(USA : JCPRC5 BP neura networ-based sports performance prediction mode appied

More information

Akaike Information Criterion for ANOVA Model with a Simple Order Restriction

Akaike Information Criterion for ANOVA Model with a Simple Order Restriction Akaike Information Criterion for ANOVA Mode with a Simpe Order Restriction Yu Inatsu * Department of Mathematics, Graduate Schoo of Science, Hiroshima University ABSTRACT In this paper, we consider Akaike

More information

An Information Geometrical View of Stationary Subspace Analysis

An Information Geometrical View of Stationary Subspace Analysis An Information Geometrica View of Stationary Subspace Anaysis Motoaki Kawanabe, Wojciech Samek, Pau von Bünau, and Frank C. Meinecke Fraunhofer Institute FIRST, Kekuéstr. 7, 12489 Berin, Germany Berin

More information

An explicit Jordan Decomposition of Companion matrices

An explicit Jordan Decomposition of Companion matrices An expicit Jordan Decomposition of Companion matrices Fermín S V Bazán Departamento de Matemática CFM UFSC 88040-900 Forianópois SC E-mai: fermin@mtmufscbr S Gratton CERFACS 42 Av Gaspard Coriois 31057

More information

Some Measures for Asymmetry of Distributions

Some Measures for Asymmetry of Distributions Some Measures for Asymmetry of Distributions Georgi N. Boshnakov First version: 31 January 2006 Research Report No. 5, 2006, Probabiity and Statistics Group Schoo of Mathematics, The University of Manchester

More information

FRIEZE GROUPS IN R 2

FRIEZE GROUPS IN R 2 FRIEZE GROUPS IN R 2 MAXWELL STOLARSKI Abstract. Focusing on the Eucidean pane under the Pythagorean Metric, our goa is to cassify the frieze groups, discrete subgroups of the set of isometries of the

More information

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION Hsiao-Chang Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA 904-635, U.S.A. Chun-Hung Chen

More information

Haar Decomposition and Reconstruction Algorithms

Haar Decomposition and Reconstruction Algorithms Jim Lambers MAT 773 Fa Semester 018-19 Lecture 15 and 16 Notes These notes correspond to Sections 4.3 and 4.4 in the text. Haar Decomposition and Reconstruction Agorithms Decomposition Suppose we approximate

More information

arxiv: v1 [physics.flu-dyn] 2 Nov 2007

arxiv: v1 [physics.flu-dyn] 2 Nov 2007 A theoretica anaysis of the resoution due to diffusion and size-dispersion of partices in deterministic atera dispacement devices arxiv:7.347v [physics.fu-dyn] 2 Nov 27 Martin Heer and Henrik Bruus MIC

More information

C. Fourier Sine Series Overview

C. Fourier Sine Series Overview 12 PHILIP D. LOEWEN C. Fourier Sine Series Overview Let some constant > be given. The symboic form of the FSS Eigenvaue probem combines an ordinary differentia equation (ODE) on the interva (, ) with a

More information

$, (2.1) n="# #. (2.2)

$, (2.1) n=# #. (2.2) Chapter. Eectrostatic II Notes: Most of the materia presented in this chapter is taken from Jackson, Chap.,, and 4, and Di Bartoo, Chap... Mathematica Considerations.. The Fourier series and the Fourier

More information

Partial permutation decoding for MacDonald codes

Partial permutation decoding for MacDonald codes Partia permutation decoding for MacDonad codes J.D. Key Department of Mathematics and Appied Mathematics University of the Western Cape 7535 Bevie, South Africa P. Seneviratne Department of Mathematics

More information

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische

More information

Probabilistic Graphical Models

Probabilistic Graphical Models Schoo of Computer Science Probabiistic Graphica Modes Gaussian graphica modes and Ising modes: modeing networks Eric Xing Lecture 0, February 0, 07 Reading: See cass website Eric Xing @ CMU, 005-07 Network

More information

Statistical Inference, Econometric Analysis and Matrix Algebra

Statistical Inference, Econometric Analysis and Matrix Algebra Statistica Inference, Econometric Anaysis and Matrix Agebra Bernhard Schipp Water Krämer Editors Statistica Inference, Econometric Anaysis and Matrix Agebra Festschrift in Honour of Götz Trenker Physica-Verag

More information

Torsion and shear stresses due to shear centre eccentricity in SCIA Engineer Delft University of Technology. Marijn Drillenburg

Torsion and shear stresses due to shear centre eccentricity in SCIA Engineer Delft University of Technology. Marijn Drillenburg Torsion and shear stresses due to shear centre eccentricity in SCIA Engineer Deft University of Technoogy Marijn Drienburg October 2017 Contents 1 Introduction 2 1.1 Hand Cacuation....................................

More information

Backward Monte Carlo Simulations in Radiative Heat Transfer

Backward Monte Carlo Simulations in Radiative Heat Transfer Backward Monte Caro Simuations in Radiative Heat Transfer Michae F. Modest Department of Mechanica and Nucear Engineering Penn State University University Park, PA 82 emai: mfm@psu.edu August 29, 2 Abstract

More information

The Binary Space Partitioning-Tree Process Supplementary Material

The Binary Space Partitioning-Tree Process Supplementary Material The inary Space Partitioning-Tree Process Suppementary Materia Xuhui Fan in Li Scott. Sisson Schoo of omputer Science Fudan University ibin@fudan.edu.cn Schoo of Mathematics and Statistics University of

More information

How the backpropagation algorithm works Srikumar Ramalingam School of Computing University of Utah

How the backpropagation algorithm works Srikumar Ramalingam School of Computing University of Utah How the backpropagation agorithm works Srikumar Ramaingam Schoo of Computing University of Utah Reference Most of the sides are taken from the second chapter of the onine book by Michae Nieson: neuranetworksanddeepearning.com

More information

17 Lecture 17: Recombination and Dark Matter Production

17 Lecture 17: Recombination and Dark Matter Production PYS 652: Astrophysics 88 17 Lecture 17: Recombination and Dark Matter Production New ideas pass through three periods: It can t be done. It probaby can be done, but it s not worth doing. I knew it was

More information

Asynchronous Control for Coupled Markov Decision Systems

Asynchronous Control for Coupled Markov Decision Systems INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of

More information

Statistical Learning Theory: a Primer

Statistical Learning Theory: a Primer ??,??, 1 6 (??) c?? Kuwer Academic Pubishers, Boston. Manufactured in The Netherands. Statistica Learning Theory: a Primer THEODOROS EVGENIOU AND MASSIMILIANO PONTIL Center for Bioogica and Computationa

More information

ACCELERATED BAYESIAN ADDITIVE REGRESSION TREES. By Jingyu He and Saar Yalov and P. Richard Hahn. University of Chicago and Arizona State University

ACCELERATED BAYESIAN ADDITIVE REGRESSION TREES. By Jingyu He and Saar Yalov and P. Richard Hahn. University of Chicago and Arizona State University ACCELERATED BAYESIAN ADDITIVE REGRESSION TREES By Jingyu He and Saar Yaov and P. Richard Hahn University of Chicago and Arizona State University Athough ess widey known than random forests or boosted regression

More information

8 Digifl'.11 Cth:uits and devices

8 Digifl'.11 Cth:uits and devices 8 Digif'. Cth:uits and devices 8. Introduction In anaog eectronics, votage is a continuous variabe. This is usefu because most physica quantities we encounter are continuous: sound eves, ight intensity,

More information

Width of Percolation Transition in Complex Networks

Width of Percolation Transition in Complex Networks APS/23-QED Width of Percoation Transition in Compex Networs Tomer Kaisy, and Reuven Cohen 2 Minerva Center and Department of Physics, Bar-Ian University, 52900 Ramat-Gan, Israe 2 Department of Computer

More information

In-plane shear stiffness of bare steel deck through shell finite element models. G. Bian, B.W. Schafer. June 2017

In-plane shear stiffness of bare steel deck through shell finite element models. G. Bian, B.W. Schafer. June 2017 In-pane shear stiffness of bare stee deck through she finite eement modes G. Bian, B.W. Schafer June 7 COLD-FORMED STEEL RESEARCH CONSORTIUM REPORT SERIES CFSRC R-7- SDII Stee Diaphragm Innovation Initiative

More information

Wavelet Galerkin Solution for Boundary Value Problems

Wavelet Galerkin Solution for Boundary Value Problems Internationa Journa of Engineering Research and Deveopment e-issn: 2278-67X, p-issn: 2278-8X, www.ijerd.com Voume, Issue 5 (May 24), PP.2-3 Waveet Gaerkin Soution for Boundary Vaue Probems D. Pate, M.K.

More information

2-loop additive mass renormalization with clover fermions and Symanzik improved gluons

2-loop additive mass renormalization with clover fermions and Symanzik improved gluons 2-oop additive mass renormaization with cover fermions and Symanzik improved guons Apostoos Skouroupathis Department of Physics, University of Cyprus, Nicosia, CY-1678, Cyprus E-mai: php4as01@ucy.ac.cy

More information

II. PROBLEM. A. Description. For the space of audio signals

II. PROBLEM. A. Description. For the space of audio signals CS229 - Fina Report Speech Recording based Language Recognition (Natura Language) Leopod Cambier - cambier; Matan Leibovich - matane; Cindy Orozco Bohorquez - orozcocc ABSTRACT We construct a rea time

More information

Paper presented at the Workshop on Space Charge Physics in High Intensity Hadron Rings, sponsored by Brookhaven National Laboratory, May 4-7,1998

Paper presented at the Workshop on Space Charge Physics in High Intensity Hadron Rings, sponsored by Brookhaven National Laboratory, May 4-7,1998 Paper presented at the Workshop on Space Charge Physics in High ntensity Hadron Rings, sponsored by Brookhaven Nationa Laboratory, May 4-7,998 Noninear Sef Consistent High Resoution Beam Hao Agorithm in

More information

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM MIKAEL NILSSON, MATTIAS DAHL AND INGVAR CLAESSON Bekinge Institute of Technoogy Department of Teecommunications and Signa Processing

More information

A Bayesian Randomized Clinical Trial: A Decision Theoretic Sequential Design

A Bayesian Randomized Clinical Trial: A Decision Theoretic Sequential Design A Bayesian Randomized Cinica Tria: A Decision Theoretic Sequentia Design J. Andrés Christen 1, Peter Müer 2, Kye Wathen 2 and Judith Wof 3 1 CIMAT, A.P. 402, Guanajuato, GTO, 36000, MEXICO, 2 Department

More information

Appendix of the Paper The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model

Appendix of the Paper The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model Appendix of the Paper The Roe of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Mode Caio Ameida cameida@fgv.br José Vicente jose.vaentim@bcb.gov.br June 008 1 Introduction In this

More information

Supervised i-vector Modeling - Theory and Applications

Supervised i-vector Modeling - Theory and Applications Supervised i-vector Modeing - Theory and Appications Shreyas Ramoji, Sriram Ganapathy Learning and Extraction of Acoustic Patterns LEAP) Lab, Eectrica Engineering, Indian Institute of Science, Bengauru,

More information

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai

More information

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient

More information

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization Scaabe Spectrum ocation for Large Networks ased on Sparse Optimization innan Zhuang Modem R&D Lab Samsung Semiconductor, Inc. San Diego, C Dongning Guo, Ermin Wei, and Michae L. Honig Department of Eectrica

More information

FORECASTING TELECOMMUNICATIONS DATA WITH AUTOREGRESSIVE INTEGRATED MOVING AVERAGE MODELS

FORECASTING TELECOMMUNICATIONS DATA WITH AUTOREGRESSIVE INTEGRATED MOVING AVERAGE MODELS FORECASTING TEECOMMUNICATIONS DATA WITH AUTOREGRESSIVE INTEGRATED MOVING AVERAGE MODES Niesh Subhash naawade a, Mrs. Meenakshi Pawar b a SVERI's Coege of Engineering, Pandharpur. nieshsubhash15@gmai.com

More information

c 2016 Georgios Rovatsos

c 2016 Georgios Rovatsos c 2016 Georgios Rovatsos QUICKEST CHANGE DETECTION WITH APPLICATIONS TO LINE OUTAGE DETECTION BY GEORGIOS ROVATSOS THESIS Submitted in partia fufiment of the requirements for the degree of Master of Science

More information

Chapter 4. Moving Observer Method. 4.1 Overview. 4.2 Theory

Chapter 4. Moving Observer Method. 4.1 Overview. 4.2 Theory Chapter 4 Moving Observer Method 4.1 Overview For a compete description of traffic stream modeing, one woud reuire fow, speed, and density. Obtaining these parameters simutaneousy is a difficut task if

More information

Active Learning & Experimental Design

Active Learning & Experimental Design Active Learning & Experimenta Design Danie Ting Heaviy modified, of course, by Lye Ungar Origina Sides by Barbara Engehardt and Aex Shyr Lye Ungar, University of Pennsyvania Motivation u Data coection

More information

THE ROLE OF ENERGY IMBALANCE MANAGEMENT ON POWER MARKET STABILITY

THE ROLE OF ENERGY IMBALANCE MANAGEMENT ON POWER MARKET STABILITY Proceedings of HICSS-31, Big Isand of Hawaii, January 6-9, 1998, Voume III, pp. 4-8. THE ROLE OF ENERGY IMBALANCE MANAGEMENT ON POWER MARKET STABILITY Fernando L. Avarado Department of Eectrica and C.

More information

New Efficiency Results for Makespan Cost Sharing

New Efficiency Results for Makespan Cost Sharing New Efficiency Resuts for Makespan Cost Sharing Yvonne Beischwitz a, Forian Schoppmann a, a University of Paderborn, Department of Computer Science Fürstenaee, 3302 Paderborn, Germany Abstract In the context

More information

Melodic contour estimation with B-spline models using a MDL criterion

Melodic contour estimation with B-spline models using a MDL criterion Meodic contour estimation with B-spine modes using a MDL criterion Damien Loive, Ney Barbot, Oivier Boeffard IRISA / University of Rennes 1 - ENSSAT 6 rue de Kerampont, B.P. 80518, F-305 Lannion Cedex

More information

CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION

CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION SAHAR KARIMI AND STEPHEN VAVASIS Abstract. In this paper we present a variant of the conjugate gradient (CG) agorithm in which we invoke a subspace minimization

More information

VI.G Exact free energy of the Square Lattice Ising model

VI.G Exact free energy of the Square Lattice Ising model VI.G Exact free energy of the Square Lattice Ising mode As indicated in eq.(vi.35), the Ising partition function is reated to a sum S, over coections of paths on the attice. The aowed graphs for a square

More information

Auxiliary Gibbs Sampling for Inference in Piecewise-Constant Conditional Intensity Models

Auxiliary Gibbs Sampling for Inference in Piecewise-Constant Conditional Intensity Models uxiiary Gibbs Samping for Inference in Piecewise-Constant Conditiona Intensity Modes Zhen Qin University of Caifornia, Riverside zqin001@cs.ucr.edu Christian R. Sheton University of Caifornia, Riverside

More information

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg yi}@it.uu.se Abstract Deciding the feasibiity

More information

<C 2 2. λ 2 l. λ 1 l 1 < C 1

<C 2 2. λ 2 l. λ 1 l 1 < C 1 Teecommunication Network Contro and Management (EE E694) Prof. A. A. Lazar Notes for the ecture of 7/Feb/95 by Huayan Wang (this document was ast LaT E X-ed on May 9,995) Queueing Primer for Muticass Optima

More information

THINKING IN PYRAMIDS

THINKING IN PYRAMIDS ECS 178 Course Notes THINKING IN PYRAMIDS Kenneth I. Joy Institute for Data Anaysis and Visuaization Department of Computer Science University of Caifornia, Davis Overview It is frequenty usefu to think

More information

arxiv: v2 [stat.ap] 28 Mar 2016

arxiv: v2 [stat.ap] 28 Mar 2016 Bayesian modeing of networks in compex business inteigence probems Daniee Durante, Say Paganin, Bruno Scarpa and David B. Dunson arxiv:0.00v [stat.ap] Mar 0 University of Padua, Department of Statistica

More information

Two-sample inference for normal mean vectors based on monotone missing data

Two-sample inference for normal mean vectors based on monotone missing data Journa of Mutivariate Anaysis 97 (006 6 76 wwweseviercom/ocate/jmva Two-sampe inference for norma mean vectors based on monotone missing data Jianqi Yu a, K Krishnamoorthy a,, Maruthy K Pannaa b a Department

More information

Improving the Accuracy of Boolean Tomography by Exploiting Path Congestion Degrees

Improving the Accuracy of Boolean Tomography by Exploiting Path Congestion Degrees Improving the Accuracy of Booean Tomography by Expoiting Path Congestion Degrees Zhiyong Zhang, Gaoei Fei, Fucai Yu, Guangmin Hu Schoo of Communication and Information Engineering, University of Eectronic

More information

Chapter 7 PRODUCTION FUNCTIONS. Copyright 2005 by South-Western, a division of Thomson Learning. All rights reserved.

Chapter 7 PRODUCTION FUNCTIONS. Copyright 2005 by South-Western, a division of Thomson Learning. All rights reserved. Chapter 7 PRODUCTION FUNCTIONS Copyright 2005 by South-Western, a division of Thomson Learning. A rights reserved. 1 Production Function The firm s production function for a particuar good (q) shows the

More information

1. Measurements and error calculus

1. Measurements and error calculus EV 1 Measurements and error cacuus 11 Introduction The goa of this aboratory course is to introduce the notions of carrying out an experiment, acquiring and writing up the data, and finay anayzing the

More information