Lecture 8: S-modular Games and Power Control

Size: px
Start display at page:

Download "Lecture 8: S-modular Games and Power Control"

Transcription

1 CDS270: Otmzaton Game and Layerng n Commncaton Networ Lectre 8: S-modlar Game and Power Control Ln Chen /22/2006

2 Otlne S-modlar game Sermodlar game Sbmodlar game Power control Power control va rcng A general framewor for dtrbted ower control 2

3 Sermodlar game Characterzed by trategc comlementarte Sermodlar game are remarable Pre trategy Nah eqlbrm ext The eqlbrm et ha an order trctre wth extreme element Many olton concet yeld the ame redcton Behave well nder varo learnng or adatve algorthm Encoma many aled model 3

4 Monotone comaratve tatc Def: oe X R and T ome artally ordered et. A fncton f : X T R ha ncreang dfference ermodlar n x t f for all x x and t t f x t f x t f x t f x t. The ncremental gan to chooe a hgher x greater when t hgher. The ncreang dfference ymmetrc.e. f t t then f x t f x t nondecreang n x. 4

5 Lemma: f f twce contnoly dfferentable f ha ncreang dfference ff t t mle f x t x f x t for all x x or alternatvely that f x t 0 for all x xt t. 5

6 A central qeton: when x t arg max f x t x X wll be ncreang n t? Theorem To: Let X R be comact and T a artally ordered et. Soe f : X T R ha ncreang dfference n x t and er emcontno n x. Then For all t xt ext and ha a greatet and leat element xt and xt. xt and xt are ncreang n. t 6

7 Proof: Extence: X comact and f er emcontno Tae a eqence { x } n xt. From comactne there ext a lmt ont x lm x. Then for all x f x t f x t f x t f x t. Th x xt and xt therefore cloed. It follow that xt ha a greatet and leat element. Let x xt and x xt. Then f x t f mn x x t 0 whch mle f max x x t f x t 0. By the ncreang dfference f max x x t f x t 0. Th max x x maxmze f t. Now c x xt and x xt t follow that x x. A mlar argment ale to xt. 7

8 Sermodlar game Def: the game G { N S N N } a ermodlar game f for all a comact bet of er emcontno n ha ncreang dfference n Corollary: oe G { N S N N } a ermodlar game. Defne the bet reone fncton B arg max. Then S B S ha greatet and leat element and B and are ncreang n R B B B 8

9 Examle: Bertrand game Two frm: form and frm 2 wth rce Payoff 2 + It a ermodlar game nce > 0. Solve by terated trct domnance Let S [0] then [ / 4 / 2]. 0 If < / 4 then If > / 2 then S Let S [ ] then /3 /3 the only Nah eqlbrm. 2 > < 4 < > trctly trctly / 4 + / 4 / 4 + /6 + /6 / / 4 + / / 4 + / 4 / 4 + /6 + /6 L / 4 + L + / 4 + / 4 L L [0] domnated. domnated. 9

10 Theorem: let G { N S N N } be a ermodlar game. Then the et of tratege rvvng terated trct domnance ISD ha greatet and leat element and whch are re trategy Nah eqlbra. Corollary: Pre Nah eqlbrm ext. The larget and mallet tratege comatble wth ISD ratonalzablty correlated eqlbrm and Nah eqlbrm are the ame. If a ermodlar game ha a nqe Nah Eqlbrm t domnance olvable. 0

11 Proof: let and be the larget element of. Let and. If.e. then t domnated by. By ncreang dfference Alo note that Iterate and defne and. Now f then. So a decreang eqence and ha a lmt denoted by. Only the tratege are ndomnated. S S N L S 0 B } : { 0 S S S > < B } : { S S 0 B B + { }

12 2 Smlarly tart wth the mallet element of and dentfy. Show and are Nah eqlbra. For all and Tae the lmt a. Smlarly rove a Nah eqlbrm N L S +

13 Illtratve dagram mallet element Bet reone larget element Bet reone Bet reone 3

14 Sbmodlar game Def: oe X R and T ome artally ordered et. A fncton f : X T R ha decreang dfference bmodlar n x t f for all x x and t t A game a bmodlar game f the ayoff fncton are bmodlar. We ll foc on taton where layer mnmze the ayoff fncton. More generalzaton f x t f x t f x t f x t. 4

15 Monotoncty Def: let A and B are two et. We ay A B f for any a A and b B mn a b A and max a b B. For contrant et S S f S S then the et S oe the decendng roerty. The acendng roerty can be defned when the relaton revered. 5

16 Theorem: for a bmodlar game wth decendng S An Nah eqlbrm ext. The bet reone trategy B mn{arg max S monotoncally converge to an eqlbrm. Proof: Follow monotoncty of the bet reone. Smlar to the roof of former theorem. Smlar relt ext for a ermodlar game wth acendng. S } 6

17 Power control An mortant comonent of rado reorce management Meet target BER or SIR whle lmtng nterference Increae caacty by mnmzng nterference Extend battery lfe Uer agned tlte that are fncton of the ower they conme and the gnal-tonterference rato SIR they attan Try to fnd a good balance between hgh SIR or meetng target SIR and low ower conmton 7

18 Power control va rcng Conder a ngle-cell networ wth a et N of er at ln Each er can chooe a ower The SIR for er mn max [ ] γ h h + σ where h the channel gan from MS to BS and the noe varance. BS 2 2 σ h h h 2 N h N MS MS 2 MS N- MS N 8

19 9 Conder ayoff amed to be ncreang When the tlte are ermodlar? Reqre Examle: ome concave fncton f α γ f f f h h c f γ γ γ γ γ γ 0 < + f f γ γ γ

20 Power control algorthm mn At tme t 0 let 0. At each tme t et er ower mn{arg max } The above algorthm converge to a Nah eqlbrm that the mallet eqlbrm. 20

21 A general framewor for dtrbted ower control Conder a et N of er and a et of M bae taton Uer e ower Denote by the gan of er at bae taton h The SIR of er at bae taton µ wth µ h h + σ 2 2

22 Dfferent ower control cheme Fxed agnment: the er agned to BS wth a SIR reqrement γ. The contrant I FA Mnmm ower agnment Macro dverty lmted dverty and mltle receton are have the contrant of the ame form µ a γ I a 22

23 Standard nterference fncton The tandard nterference fncton atfe the followng roerte Potvty: I > 0 Monotoncty: f Scalablty: for > I I a ai I a I 23

24 Defne a bmodlar game Payoff Contrant et wth a feable olton to S { : I 0 } I Theorem: f a feable olton ext then There a fxed ont to eqaton I The bet reone trategy converge to an eqlbrm. 24

25 Hay Thangvng! 25

Additional File 1 - Detailed explanation of the expression level CPD

Additional File 1 - Detailed explanation of the expression level CPD Addtonal Fle - Detaled explanaton of the expreon level CPD A mentoned n the man text, the man CPD for the uterng model cont of two ndvdual factor: P( level gen P( level gen P ( level gen 2 (.).. CPD factor

More information

Distributed Control for the Parallel DC Linked Modular Shunt Active Power Filters under Distorted Utility Voltage Condition

Distributed Control for the Parallel DC Linked Modular Shunt Active Power Filters under Distorted Utility Voltage Condition Dtrbted Control for the Parallel DC Lnked Modlar Shnt Actve Power Flter nder Dtorted Utlty Voltage Condton Reearch Stdent: Adl Salman Spervor: Dr. Malabka Ba School of Electrcal and Electronc Engneerng

More information

Predictors Using Partially Conditional 2 Stage Response Error Ed Stanek

Predictors Using Partially Conditional 2 Stage Response Error Ed Stanek Predctor ng Partally Condtonal Stage Repone Error Ed Stane TRODCTO We explore the predctor that wll relt n a mple random ample wth repone error when a dfferent model potlated The model we decrbe here cloely

More information

Power-sum problem, Bernoulli Numbers and Bernoulli Polynomials.

Power-sum problem, Bernoulli Numbers and Bernoulli Polynomials. Power-sum roblem, Bernoull Numbers and Bernoull Polynomals. Arady M. Alt Defnton 1 Power um Problem Fnd the sum n : 1... n where, n N or, usng sum notaton, n n n closed form. Recurrence for n Exercse Usng

More information

Information Acquisition in Global Games of Regime Change (Online Appendix)

Information Acquisition in Global Games of Regime Change (Online Appendix) Informaton Acquton n Global Game of Regme Change (Onlne Appendx) Mchal Szkup and Iabel Trevno Augut 4, 05 Introducton Th appendx contan the proof of all the ntermedate reult that have been omtted from

More information

Numerical Solutions of Parabolic Constrained Control Problems

Numerical Solutions of Parabolic Constrained Control Problems Global Jornal of Pre and Appled Matematc. I 973-768 Volme mber 6 pp. 965-979 Reearc Inda Pblcaton ttp://www.rpblcaton.com mercal olton of Parabolc Contraned Control Problem M. H. Farag Mat & tattc Dept.

More information

Chapter 6 The Effect of the GPS Systematic Errors on Deformation Parameters

Chapter 6 The Effect of the GPS Systematic Errors on Deformation Parameters Chapter 6 The Effect of the GPS Sytematc Error on Deformaton Parameter 6.. General Beutler et al., (988) dd the frt comprehenve tudy on the GPS ytematc error. Baed on a geometrc approach and aumng a unform

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

Managing Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration

Managing Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration Managng Caacty Through eward Programs on-lne comanon age Byung-Do Km Seoul Natonal Unversty College of Busness Admnstraton Mengze Sh Unversty of Toronto otman School of Management Toronto ON M5S E6 Canada

More information

Design of Recursive Digital Filters IIR

Design of Recursive Digital Filters IIR Degn of Recurve Dgtal Flter IIR The outut from a recurve dgtal flter deend on one or more revou outut value, a well a on nut t nvolve feedbac. A recurve flter ha an nfnte mule reone (IIR). The mulve reone

More information

Improvements on Waring s Problem

Improvements on Waring s Problem Imrovement on Warng Problem L An-Png Bejng 85, PR Chna al@nacom Abtract By a new recurve algorthm for the auxlary equaton, n th aer, we wll gve ome mrovement for Warng roblem Keyword: Warng Problem, Hardy-Lttlewood

More information

Tokyo Institute of Technology Periodic Sequencing Control over Multi Communication Channels with Packet Losses

Tokyo Institute of Technology Periodic Sequencing Control over Multi Communication Channels with Packet Losses oyo Insttute of echnology Fujta Laboratory oyo Insttute of echnology erodc Sequencng Control over Mult Communcaton Channels wth acet Losses FL6-7- /8/6 zwrman Gusrald oyo Insttute of echnology Fujta Laboratory

More information

Solutions to selected problems from homework 1.

Solutions to selected problems from homework 1. Jan Hagemejer 1 Soltons to selected problems from homeork 1. Qeston 1 Let be a tlty fncton hch generates demand fncton xp, ) and ndrect tlty fncton vp, ). Let F : R R be a strctly ncreasng fncton. If the

More information

Problem Set 3: Model Solutions

Problem Set 3: Model Solutions Ecoomc 73 Adaced Mcroecoomc Problem et 3: Model oluto. Coder a -bdder aucto wth aluato deedetly ad detcally dtrbuted accordg to F( ) o uort [,]. Let the hghet bdder ay the rce ( - k)b f + kb to the eller,

More information

Bayesian epistemology II: Arguments for Probabilism

Bayesian epistemology II: Arguments for Probabilism Bayesan epstemology II: Arguments for Probablsm Rchard Pettgrew May 9, 2012 1 The model Represent an agent s credal state at a gven tme t by a credence functon c t : F [0, 1]. where F s the algebra of

More information

This appendix presents the derivations and proofs omitted from the main text.

This appendix presents the derivations and proofs omitted from the main text. Onlne Appendx A Appendx: Omtted Dervaton and Proof Th appendx preent the dervaton and proof omtted from the man text A Omtted dervaton n Secton Mot of the analy provded n the man text Here, we formally

More information

The multivariate Gaussian probability density function for random vector X (X 1,,X ) T. diagonal term of, denoted

The multivariate Gaussian probability density function for random vector X (X 1,,X ) T. diagonal term of, denoted Appendx Proof of heorem he multvarate Gauan probablty denty functon for random vector X (X,,X ) px exp / / x x mean and varance equal to the th dagonal term of, denoted he margnal dtrbuton of X Gauan wth

More information

Ensemble Methods: Boosting

Ensemble Methods: Boosting Ensemble Methods: Boostng Ncholas Ruozz Unversty of Texas at Dallas Based on the sldes of Vbhav Gogate and Rob Schapre Last Tme Varance reducton va baggng Generate new tranng data sets by samplng wth replacement

More information

Harmonic oscillator approximation

Harmonic oscillator approximation armonc ocllator approxmaton armonc ocllator approxmaton Euaton to be olved We are fndng a mnmum of the functon under the retrcton where W P, P,..., P, Q, Q,..., Q P, P,..., P, Q, Q,..., Q lnwgner functon

More information

The Bellman Equation

The Bellman Equation The Bellman Eqaton Reza Shadmehr In ths docment I wll rovde an elanaton of the Bellman eqaton, whch s a method for otmzng a cost fncton and arrvng at a control olcy.. Eamle of a game Sose that or states

More information

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1 Problem Set 4 Suggested Solutons Problem (A) The market demand functon s the soluton to the followng utlty-maxmzaton roblem (UMP): The Lagrangean: ( x, x, x ) = + max U x, x, x x x x st.. x + x + x y x,

More information

Pythagorean triples. Leen Noordzij.

Pythagorean triples. Leen Noordzij. Pythagorean trple. Leen Noordz Dr.l.noordz@leennoordz.nl www.leennoordz.me Content A Roadmap for generatng Pythagorean Trple.... Pythagorean Trple.... 3 Dcuon Concluon.... 5 A Roadmap for generatng Pythagorean

More information

Root Locus Techniques

Root Locus Techniques Root Locu Technque ELEC 32 Cloed-Loop Control The control nput u t ynthezed baed on the a pror knowledge of the ytem plant, the reference nput r t, and the error gnal, e t The control ytem meaure the output,

More information

CS 3750 Machine Learning Lecture 6. Monte Carlo methods. CS 3750 Advanced Machine Learning. Markov chain Monte Carlo

CS 3750 Machine Learning Lecture 6. Monte Carlo methods. CS 3750 Advanced Machine Learning. Markov chain Monte Carlo CS 3750 Machne Learnng Lectre 6 Monte Carlo methods Mlos Haskrecht mlos@cs.ptt.ed 5329 Sennott Sqare Markov chan Monte Carlo Importance samplng: samples are generated accordng to Q and every sample from

More information

is the calculated value of the dependent variable at point i. The best parameters have values that minimize the squares of the errors

is the calculated value of the dependent variable at point i. The best parameters have values that minimize the squares of the errors Multple Lnear and Polynomal Regresson wth Statstcal Analyss Gven a set of data of measured (or observed) values of a dependent varable: y versus n ndependent varables x 1, x, x n, multple lnear regresson

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

COS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture # 15 Scribe: Jieming Mao April 1, 2013

COS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture # 15 Scribe: Jieming Mao April 1, 2013 COS 511: heoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 15 Scrbe: Jemng Mao Aprl 1, 013 1 Bref revew 1.1 Learnng wth expert advce Last tme, we started to talk about learnng wth expert advce.

More information

Learning Theory: Lecture Notes

Learning Theory: Lecture Notes Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be

More information

Fuzzy approach to solve multi-objective capacitated transportation problem

Fuzzy approach to solve multi-objective capacitated transportation problem Internatonal Journal of Bonformatcs Research, ISSN: 0975 087, Volume, Issue, 00, -0-4 Fuzzy aroach to solve mult-objectve caactated transortaton roblem Lohgaonkar M. H. and Bajaj V. H.* * Deartment of

More information

Differentiating Gaussian Processes

Differentiating Gaussian Processes Dfferentatng Gaussan Processes Andrew McHutchon Aprl 17, 013 1 Frst Order Dervatve of the Posteror Mean The posteror mean of a GP s gven by, f = x, X KX, X 1 y x, X α 1 Only the x, X term depends on the

More information

Specification -- Assumptions of the Simple Classical Linear Regression Model (CLRM) 1. Introduction

Specification -- Assumptions of the Simple Classical Linear Regression Model (CLRM) 1. Introduction ECONOMICS 35* -- NOTE ECON 35* -- NOTE Specfcaton -- Aumpton of the Smple Clacal Lnear Regreon Model (CLRM). Introducton CLRM tand for the Clacal Lnear Regreon Model. The CLRM alo known a the tandard lnear

More information

Supplementary Material for Spectral Clustering based on the graph p-laplacian

Supplementary Material for Spectral Clustering based on the graph p-laplacian Sulementary Materal for Sectral Clusterng based on the grah -Lalacan Thomas Bühler and Matthas Hen Saarland Unversty, Saarbrücken, Germany {tb,hen}@csun-sbde May 009 Corrected verson, June 00 Abstract

More information

A Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control

A Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control A ower Bound on SIR Threshold for Call Admsson Control n Multple-Class CDMA Systems w Imperfect ower-control Mohamed H. Ahmed Faculty of Engneerng and Appled Scence Memoral Unversty of ewfoundland St.

More information

A A Non-Constructible Equilibrium 1

A A Non-Constructible Equilibrium 1 A A Non-Contructbe Equbrum 1 The eampe depct a eparabe contet wth three payer and one prze of common vaue 1 (o v ( ) =1 c ( )). I contruct an equbrum (C, G, G) of the contet, n whch payer 1 bet-repone

More information

On the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1

On the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1 Journal of Mathematcal Analyss and Alcatons 260, 15 2001 do:10.1006jmaa.2000.7389, avalable onlne at htt:.dealbrary.com on On the Connectedness of the Soluton Set for the Weak Vector Varatonal Inequalty

More information

Two Approaches to Proving. Goldbach s Conjecture

Two Approaches to Proving. Goldbach s Conjecture Two Approache to Provng Goldbach Conecture By Bernard Farley Adved By Charle Parry May 3 rd 5 A Bref Introducton to Goldbach Conecture In 74 Goldbach made h mot famou contrbuton n mathematc wth the conecture

More information

Approccio Statistico all'analisi di Sistemi Caotici e Applicazioni all'ingegneria dell'informazione

Approccio Statistico all'analisi di Sistemi Caotici e Applicazioni all'ingegneria dell'informazione Arocco tatstco all'anals d stem Caotc e Alcazon all'ingegnera dell'informazone Ganluca ett 3 Rccardo Rovatt 3 D. d Ingegnera Unverstà d Ferrara D. d Elettronca, Informatca e stemstca - Unverstà d Bologna

More information

2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period

2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period -Adc Comlexty of a Seuence Obtaned from a Perodc Bnary Seuence by Ether Insertng or Deletng Symbols wthn One Perod ZHAO Lu, WEN Qao-yan (State Key Laboratory of Networng and Swtchng echnology, Bejng Unversty

More information

a new crytoytem baed on the dea of Shmuley and roved t rovably ecure baed on ntractablty of factorng [Mc88] After that n 999 El Bham, Dan Boneh and Om

a new crytoytem baed on the dea of Shmuley and roved t rovably ecure baed on ntractablty of factorng [Mc88] After that n 999 El Bham, Dan Boneh and Om Weak Comote Dffe-Hellman not Weaker than Factorng Koohar Azman, azman@ceharfedu Javad Mohajer mohajer@harfedu Mahmoud Salmazadeh alma@harfedu Electronc Reearch Centre, Sharf Unverty of Technology Deartment

More information

PROBLEM SET 7 GENERAL EQUILIBRIUM

PROBLEM SET 7 GENERAL EQUILIBRIUM PROBLEM SET 7 GENERAL EQUILIBRIUM Queston a Defnton: An Arrow-Debreu Compettve Equlbrum s a vector of prces {p t } and allocatons {c t, c 2 t } whch satsfes ( Gven {p t }, c t maxmzes βt ln c t subject

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

The Price of Anarchy in a Network Pricing Game

The Price of Anarchy in a Network Pricing Game The Prce of Anarchy n a Network Prcng Game John Muaccho and Shuang Wu Abtract We analyze a game theoretc model of competng network ervce provder that trategcally prce ther ervce n the preence of elatc

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

Is it enough? WSCoL is too limited for some interes1ng quality dimensions and cannot predicate on sequences of interac1ons

Is it enough? WSCoL is too limited for some interes1ng quality dimensions and cannot predicate on sequences of interac1ons I t enouh? WSCoL too lmted for ome nteren qualty dmenon and cannot predcate on equence of nteracon Th lmt affect alo propoonal loc n eneral Addn me to propoonal loc the repone to the need of decrbn propere

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Lecture 9: Converse of Shannon s Capacity Theorem

Lecture 9: Converse of Shannon s Capacity Theorem Error Correctng Codes: Combnatorcs, Algorthms and Alcatons (Fall 2007) Lecture 9: Converse of Shannon s Caacty Theorem Setember 17, 2007 Lecturer: Atr Rudra Scrbe: Thanh-Nhan Nguyen & Atr Rudra In the

More information

CHAPTER IV RESEARCH FINDING AND ANALYSIS

CHAPTER IV RESEARCH FINDING AND ANALYSIS CHAPTER IV REEARCH FINDING AND ANALYI A. Descrpton of Research Fndngs To fnd out the dfference between the students who were taught by usng Mme Game and the students who were not taught by usng Mme Game

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

Risk-aware Cooperative Spectrum Access for Multi-Channel Cognitive Radio Networks

Risk-aware Cooperative Spectrum Access for Multi-Channel Cognitive Radio Networks 1 Rk-aware Cooperatve Spectrum Acce for Mult-Channel Cogntve Rado Network Nng Zhang, Student Member, IEEE, Nan Cheng, Student Member, IEEE, Nng Lu, Student Member, IEEE, Habo Zhou, Student Member, IEEE,

More information

Improvements on Waring s Problem

Improvements on Waring s Problem Improvement on Warng Problem L An-Png Bejng, PR Chna apl@nacom Abtract By a new recurve algorthm for the auxlary equaton, n th paper, we wll gve ome mprovement for Warng problem Keyword: Warng Problem,

More information

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution Department of Statstcs Unversty of Toronto STA35HS / HS Desgn and Analyss of Experments Term Test - Wnter - Soluton February, Last Name: Frst Name: Student Number: Instructons: Tme: hours. Ads: a non-programmable

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

1 The Mistake Bound Model

1 The Mistake Bound Model 5-850: Advanced Algorthms CMU, Sprng 07 Lecture #: Onlne Learnng and Multplcatve Weghts February 7, 07 Lecturer: Anupam Gupta Scrbe: Bryan Lee,Albert Gu, Eugene Cho he Mstake Bound Model Suppose there

More information

An Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control

An Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com

More information

A 2D Bounded Linear Program (H,c) 2D Linear Programming

A 2D Bounded Linear Program (H,c) 2D Linear Programming A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded

More information

arxiv: v2 [cs.it] 20 Jun 2018

arxiv: v2 [cs.it] 20 Jun 2018 Vrtal ealty over Wrele Network: Qalty-of-Servce Moel an Learnng-Bae eorce Management Mngzhe Chen, Wal Saa, an Changchan Yn Beng Laboratory of Avance Informaton Network, Beng Unverty of Pot an Telecommncaton,

More information

University of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D.

University of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D. Unversty of Calforna, Davs Date: June 22, 29 Department of Agrcultural and Resource Economcs Department of Economcs Tme: 5 hours Mcroeconomcs Readng Tme: 2 mnutes PRELIMIARY EXAMIATIO FOR THE Ph.D. DEGREE

More information

SELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:

SELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table: SELECTED PROOFS DeMorgan s formulas: The frst one s clear from Venn dagram, or the followng truth table: A B A B A B Ā B Ā B T T T F F F F T F T F F T F F T T F T F F F F F T T T T The second one can be

More information

Economics 101. Lecture 4 - Equilibrium and Efficiency

Economics 101. Lecture 4 - Equilibrium and Efficiency Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of

More information

A Mathematical Theory of Communication. Claude Shannon s paper presented by Kate Jenkins 2/19/00

A Mathematical Theory of Communication. Claude Shannon s paper presented by Kate Jenkins 2/19/00 A Mathematcal Theory of Communcaton Claude hannon s aer resented by Kate Jenkns 2/19/00 Publshed n two arts, July 1948 and October 1948 n the Bell ystem Techncal Journal Foundng aer of Informaton Theory

More information

Modeling curves. Graphs: y = ax+b, y = sin(x) Implicit ax + by + c = 0, x 2 +y 2 =r 2 Parametric:

Modeling curves. Graphs: y = ax+b, y = sin(x) Implicit ax + by + c = 0, x 2 +y 2 =r 2 Parametric: Modelng curves Types of Curves Graphs: y = ax+b, y = sn(x) Implct ax + by + c = 0, x 2 +y 2 =r 2 Parametrc: x = ax + bxt x = cos t y = ay + byt y = snt Parametrc are the most common mplct are also used,

More information

Mixture of Gaussians Expectation Maximization (EM) Part 2

Mixture of Gaussians Expectation Maximization (EM) Part 2 Mture of Gaussans Eectaton Mamaton EM Part 2 Most of the sldes are due to Chrstoher Bsho BCS Summer School Eeter 2003. The rest of the sldes are based on lecture notes by A. Ng Lmtatons of K-means Hard

More information

Comparing two Quantiles: the Burr Type X and Weibull Cases

Comparing two Quantiles: the Burr Type X and Weibull Cases IOSR Journal of Mathematcs (IOSR-JM) e-issn: 78-578, -ISSN: 39-765X. Volume, Issue 5 Ver. VII (Se. - Oct.06), PP 8-40 www.osrjournals.org Comarng two Quantles: the Burr Tye X and Webull Cases Mohammed

More information

Problem 1: To prove that under the assumptions at hand, the group velocity of an EM wave is less than c, I am going to show that

Problem 1: To prove that under the assumptions at hand, the group velocity of an EM wave is less than c, I am going to show that PHY 387 K. Solutons for problem set #7. Problem 1: To prove that under the assumptons at hand, the group velocty of an EM wave s less than c, I am gong to show that (a) v group < v phase, and (b) v group

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Randomness and Computation

Randomness and Computation Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually

More information

Resource Allocation Algorithm Based on Bandwidth Demands for OFDMA Systems with Imperfect Channel Quality Information

Resource Allocation Algorithm Based on Bandwidth Demands for OFDMA Systems with Imperfect Channel Quality Information Senor & Trandcer Vol 67 Ie 3 March 4 pp 5-6 Senor & Trandcer 4 by IFSA Pblhng S L http://wwwenorportalcom Reorce Allocaton Algorthm Baed on Bandwdth Demand for OFDMA Sytem wth Imperfect Channel Qalty Informaton

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

ESS 265 Spring Quarter 2005 Time Series Analysis: Error Analysis

ESS 265 Spring Quarter 2005 Time Series Analysis: Error Analysis ESS 65 Sprng Qarter 005 Tme Seres Analyss: Error Analyss Lectre 9 May 3, 005 Some omenclatre Systematc errors Reprodcbly errors that reslt from calbraton errors or bas on the part of the obserer. Sometmes

More information

Lecture 4: November 17, Part 1 Single Buffer Management

Lecture 4: November 17, Part 1 Single Buffer Management Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input

More information

The Study of Teaching-learning-based Optimization Algorithm

The Study of Teaching-learning-based Optimization Algorithm Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute

More information

where I = (n x n) diagonal identity matrix with diagonal elements = 1 and off-diagonal elements = 0; and σ 2 e = variance of (Y X).

where I = (n x n) diagonal identity matrix with diagonal elements = 1 and off-diagonal elements = 0; and σ 2 e = variance of (Y X). 11.4.1 Estmaton of Multple Regresson Coeffcents In multple lnear regresson, we essentally solve n equatons for the p unnown parameters. hus n must e equal to or greater than p and n practce n should e

More information

INTEGRAL p-adic HODGE THEORY, TALK 14 (COMPARISON WITH THE DE RHAMWITT COMPLEX)

INTEGRAL p-adic HODGE THEORY, TALK 14 (COMPARISON WITH THE DE RHAMWITT COMPLEX) INTEGRAL -ADIC HODGE THEORY, TALK 4 (COMPARISON WITH THE DE RHAMWITT COMPLEX) JOAQUIN RODRIGUES JACINTO (NOTES BY JAMES NEWTON). Recollectons and statement of theorem Let K be a erfectod eld of characterstc

More information

What would be a reasonable choice of the quantization step Δ?

What would be a reasonable choice of the quantization step Δ? CE 108 HOMEWORK 4 EXERCISE 1. Suppose you are samplng the output of a sensor at 10 KHz and quantze t wth a unform quantzer at 10 ts per sample. Assume that the margnal pdf of the sgnal s Gaussan wth mean

More information

A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,

A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) , A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare

More information

Neryškioji dichotominių testo klausimų ir socialinių rodiklių diferencijavimo savybių klasifikacija

Neryškioji dichotominių testo klausimų ir socialinių rodiklių diferencijavimo savybių klasifikacija Neryškoj dchotomnų testo klausmų r socalnų rodklų dferencjavmo savybų klasfkacja Aleksandras KRYLOVAS, Natalja KOSAREVA, Julja KARALIŪNAITĖ Technologcal and Economc Development of Economy Receved 9 May

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models

More information

p 1 c 2 + p 2 c 2 + p 3 c p m c 2

p 1 c 2 + p 2 c 2 + p 3 c p m c 2 Where to put a faclty? Gven locatons p 1,..., p m n R n of m houses, want to choose a locaton c n R n for the fre staton. Want c to be as close as possble to all the house. We know how to measure dstance

More information

Notes on Strategic Substitutes and Complements in Global Games

Notes on Strategic Substitutes and Complements in Global Games Note on Strategic Subtitute an Complement in Global Game Stephen Morri Cowle Founation, Yale Univerity, POBox 208281, New Haven CT 06520, U S A tephenmorri@yaleeu Hyun Song Shin Lonon School of Economic,

More information

Review of Taylor Series. Read Section 1.2

Review of Taylor Series. Read Section 1.2 Revew of Taylor Seres Read Secton 1.2 1 Power Seres A power seres about c s an nfnte seres of the form k = 0 k a ( x c) = a + a ( x c) + a ( x c) + a ( x c) k 2 3 0 1 2 3 + In many cases, c = 0, and the

More information

(1 ) (1 ) 0 (1 ) (1 ) 0

(1 ) (1 ) 0 (1 ) (1 ) 0 Appendx A Appendx A contans proofs for resubmsson "Contractng Informaton Securty n the Presence of Double oral Hazard" Proof of Lemma 1: Assume that, to the contrary, BS efforts are achevable under a blateral

More information

AE/ME 339. K. M. Isaac. 8/31/2004 topic4: Implicit method, Stability, ADI method. Computational Fluid Dynamics (AE/ME 339) MAEEM Dept.

AE/ME 339. K. M. Isaac. 8/31/2004 topic4: Implicit method, Stability, ADI method. Computational Fluid Dynamics (AE/ME 339) MAEEM Dept. AE/ME 339 Comptatonal Fld Dynamcs (CFD) Comptatonal Fld Dynamcs (AE/ME 339) Implct form of dfference eqaton In the prevos explct method, the solton at tme level n,,n, depended only on the known vales of,

More information

The Effects of Monopolistic Pricing in a Network Resource Allocation Game. Danielle Hinton 6.454: Graduate Seminar in Area 1 November 3, 2004

The Effects of Monopolistic Pricing in a Network Resource Allocation Game. Danielle Hinton 6.454: Graduate Seminar in Area 1 November 3, 2004 The Effects of Monoolstc Prcng n a Network Resource Allocaton Game Danelle Hnton : Graduate Semnar n Area November 3, 2004 Introducton There s a recent body of lterature that seeks to quantfy the erformance

More information

EECE 301 Signals & Systems Prof. Mark Fowler

EECE 301 Signals & Systems Prof. Mark Fowler -T Sytem: Ung Bode Plot EEE 30 Sgnal & Sytem Pro. Mark Fowler Note Set #37 /3 Bode Plot Idea an Help Vualze What rcut Do Lowpa Flter Break Pont = / H ( ) j /3 Hghpa Flter c = / L Bandpa Flter n nn ( a)

More information

Designing Service Competitions among Heterogeneous Suppliers

Designing Service Competitions among Heterogeneous Suppliers Degnng Servce Competton among Heterogeneou Suppler Ehan Elah and Saf Benaafar Graduate Program n Indutral & Sytem Engneerng Department of Mechancal Engneerng Unverty of Mnneota, Mnneapol, M 55455 elah@me.umn.edu

More information

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several

More information

Solution Methods for Time-indexed MIP Models for Chemical Production Scheduling

Solution Methods for Time-indexed MIP Models for Chemical Production Scheduling Ian Davd Lockhart Bogle and Mchael Farweather (Edtor), Proceedng of the 22nd European Sympoum on Computer Aded Proce Engneerng, 17-2 June 212, London. 212 Elever B.V. All rght reerved. Soluton Method for

More information

18.1 Introduction and Recap

18.1 Introduction and Recap CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng

More information

Departure Process from a M/M/m/ Queue

Departure Process from a M/M/m/ Queue Dearture rocess fro a M/M// Queue Q - (-) Q Q3 Q4 (-) Knowledge of the nature of the dearture rocess fro a queue would be useful as we can then use t to analyze sle cases of queueng networs as shown. The

More information

Synchronization Protocols. Task Allocation Bin-Packing Heuristics: First-Fit Subtasks assigned in arbitrary order To allocate a new subtask T i,j

Synchronization Protocols. Task Allocation Bin-Packing Heuristics: First-Fit Subtasks assigned in arbitrary order To allocate a new subtask T i,j End-to-End Schedulng Framework 1. Tak allocaton: bnd tak to proceor 2. Synchronzaton protocol: enforce precedence contrant 3. Subdeadlne agnment 4. Schedulablty analy Tak Allocaton Bn-Packng eurtc: Frt-Ft

More information

LECTURE 13. Transition Crossing in Proton synchrotrons. Transition Crossing in Proton synchrotrons. Synchrotron radiation: transverse effects

LECTURE 13. Transition Crossing in Proton synchrotrons. Transition Crossing in Proton synchrotrons. Synchrotron radiation: transverse effects LETURE 3 Tranton rong n Proton nchrotron Snchrotron radaton: tranvere effect Vertcal dampng orzontal dampng and qantm ectaton Eqlbrm horzontal emttance Tranton rong n Proton nchrotron When γ pae throgh

More information

Geometric Modeling

Geometric Modeling Geometrc Modelng 9.580.0 Notes on Crve and Srface Contnty Parts of Mortenson, Farn, Angel, Hll and others From Prevos Lectres Contnty at Jon Ponts (from Lectre ) Dscontnos: hyscal searaton Parametrc Contnty

More information

Stat 543 Exam 2 Spring 2016

Stat 543 Exam 2 Spring 2016 Stat 543 Exam 2 Sprng 2016 I have nether gven nor receved unauthorzed assstance on ths exam. Name Sgned Date Name Prnted Ths Exam conssts of 11 questons. Do at least 10 of the 11 parts of the man exam.

More information

A total variation approach

A total variation approach Denosng n dgtal radograhy: A total varaton aroach I. Froso M. Lucchese. A. Borghese htt://as-lab.ds.unm.t / 46 I. Froso, M. Lucchese,. A. Borghese Images are corruted by nose ) When measurement of some

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

I. Decision trees II. Ensamble methods: Mixtures of experts

I. Decision trees II. Ensamble methods: Mixtures of experts CS 75 Machne Learnn Lectre 4 I. Decson trees II. Ensamble methods: Mtres of eperts Mlos Hasrecht mlos@cs.ptt.ed 539 Sennott Sqare CS 75 Machne Learnn Eam: Aprl 8 7 Schedle Term proects & proect presentatons:

More information

Study on Demand Response of Residential Power Customer

Study on Demand Response of Residential Power Customer Journal of Power and Energy Engneerng 06 4-7 Publshed Onlne July 06 n ScRes. htt://www.scr.org/journal/jee htt://dx.do.org/0.46/jee.06.4700 Study on Demand Resonse of Resdental Power Customer Xu Cao Hayong

More information

Which Separator? Spring 1

Which Separator? Spring 1 Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal

More information