Joint Energy Management and Resource Allocation in Rechargable Sensor Networks
|
|
- Alicia Cannon
- 6 years ago
- Views:
Transcription
1 Jont Energy Management and Resource Allocaton n Rechargable Sensor Networks Ren-Shou Lu, Prasun Snha and C. Emre Koksal Department of CSE and ECE The Oho State Unversty
2 Envronmental Energy Harvestng Many technologes avalable for harvestng energy n dfferent forms, etc.
3 Energy Management - Dfferent Paradgm Classcal data Wth replenshment data P n = (t) P out transcever P =ρ (t) n P out (t) transcever B(t) B(t) sensor nfo sensor nfo lfetme: < purpose: max R lfetme utlty(t) dt lm T max 1 T utlty(t) dt undesrable: empty battery empty or full battery challenge: extend lfetme perpetual operaton wth varable P n R T Q: Energy management a straghtforward extenson or fundamentally dfferent? A: Close to the latter.
4 Network Utlty Maxmzaton r k f j f j j s P n =ρ ( t) (t) B node P out (t) Σj f j Σ j transcever f j +r sensor r max r,f j P log r P subject to j f j P j f j + r, s flow balance P n X λ (tx) j f j + X λ (rx) j f j +λ (sn) r energy conservaton j j {z } f Π fxed xmt and recv power achevable rate regon But P n s nether a constant nor perfectly known Battery s fnte
5 Dynamc Problem τ ρ (t) π ( e) π long term tme Opton E n Issue (1) ρ (t) complexty/convergence overhead (2) π long-term fnte battery extended (3) ˆπ(e) = 1 τ P eτ t=(e 1)τ+1 ˆρ (t) perods of dscharge fndng optmal tradeoff between overhead and dscharge probablty
6 Overhead and Dscharge Rate -5-1 Computed utlty QuckFx Standard dual-based algorthm Iteratons Too slow a convergence n general networks. Need to choose τ 1 Hgh battery dscharge rate Need to sacrfce performance for perpetual operaton Convergence: Assume/generate DAGs Dscharge rate: SnapIt
7 Resource Allocaton over DAGs w j : fracton of node traffc over lnk j z k (w): fracton of node traffc over node k z k (w) = w j w jk w j z k j k s rewrte problem n terms of z and w The structure of the DAG enables effcent solutons QuckFx Algorthm Dual decomposton subgradent-based dstrbuted soluton Effcent jont updates explotng DAG structure
8 QuckFx - Dual Decomposton Approach Notes: MWM scheduler: weght s a combned battery/data queue state
9 QuckFx - Dual Decomposton Approach Notes: Two phases of QuckFx teratons: 1. Aggregate prces: parents chldren, update r 2. Aggregate traffc: chldren parents, update prces
10 QuckFx - Dual Decomposton Approach Notes: -5-1 Computed utlty QuckFx Standard dual-based algorthm Iteratons
11 SnapIt - Localzed Energy Management π (e+1) π (e+2) Cumulatve energy msmatch: P e π ( e) e τ ( e+1)τ ( e+2)τ h Peτ tme t=(e 1)τ+1 ρ (t) ˆπ (e) Issue - fnte battery sze causes: Unbased estmator battery drft hgh dscharge rate Based estmator very hgh dscharge rate or neffcent replenshment Soluton: Adaptvely control drft
12 SnapIt - Localzed Energy Management B(t) M/2 r δ B(t) > M/2 r + δ δ M M/2 B (t) δ u u u d utlty δ r* δ r Q1: What performance s lost due to r δ? Q2: How much s dscharge probablty reduced wth δ drft? Theorem: If the varance, σ 2 ρ var 1 Pτ Q τ Q t=1 ρ (t) s bounded and the utlty functon s the log functon, U( ) = log( ), then, gven any β 1, SnapIt acheves p SnapIt and Ū Ū SnapIt log M = Θ M wth the choce of δ = βσ2 ρ log M λ (sn) M. Optmal utlty & low dscharge rate possble smultaneously. (M ) = O(M β )
13 Smulatons - Parameters A 67-node testbed wth topology created based on an actual local testbed Rechargng profles based on real solar radaton measurements from NREL λ (sn) = 15µW, λ (tx) = 63µW, λ (rx) = 69µW, α =.1, δ =.1r τ = 1 hour and 1 teraton every 5 mnutes
14 Smulatons - Sum Rate and Network Utlty Sum rate Network utlty Cumulatve full/empty tme Intal battery - hgh Sum of data rates at snk [pkt/s] QuckFx w/o SnapIt QUckFx w/ SnapIt Instantaneous opt 6: 1: 14: 18: Tme Network utlty QuckFx w/o SnapIt QuckFx w/ SnapIt Instantaneous opt -3 6: 1: 14: 18: Tme Cumulatve battery full tme [s] Node 1 w/o SnapIt Node 1 w/ SnapIt Node 2 w/o SnapIt Node 2 w/ SnapIt 6: 1: 14: 18: Tme Intal battery - low Sum of data rates at snk [pkt/s] QuckFx w/o SnapIt QUckFx w/ SnapIt Instantaneous opt 6: 1: 14: 18: Tme Network utlty QuckFx w/o SnapIt QUckFx w/ SnapIt Instantaneous opt -3 6: 1: 14: 18: Tme Cumulatve down tme [s] Node 1 w/o SnapIt Node 1 w/ SnapIt Node 2 w/o SnapIt Node 2 w/ SnapIt 6: 1: 14: 18: Tme
15 Smulatons - Sunny/Cloudy Day vs. IFRC Sum rate Network utlty Sunny day Sum of data rates at snk QuckFx w/ SnapIt IFRC Network utlty QuckFx w/ SnapIt IFRC 6: 1: 14: 18: Tme -4 6: 1: 14: 18: Tme Cloudy day Sum of data rates at snk QuckFx w/ SnapIt IFRC Network utlty QuckFx w/ SnapIt IFRC 6: 1: 14: 18: Tme -4 6: 1: 14: 18: Tme
16 Summary and Future Work QuckFx + SnapIt to acheve optmal network utlty Addressed convergence ssue assocated wth varable replenshment Addressed (fnte) battery dscharge rate due to varable replenshment Can we mprove the convergence ssue wthout the DAG assumpton/constructon? Can we combne battery control wth data queue control to acheve low dscharge and data buffer overflow rates?
Towards Achieving Perpetual Operation in Rechargeable Sensor Networks
Towards Achevng Perpetual Operaton n Rechargeable Sensor Networks Ren-Shou Lu, Student member, IEEE, Prasun Snha, Member, IEEE, Can Emre Koksal, Member, IEEE Abstract Energy harvestng sensor platforms
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationStat 543 Exam 2 Spring 2016
Stat 543 Exam 2 Sprng 206 I have nether gven nor receved unauthorzed assstance on ths exam. Name Sgned Date Name Prnted Ths Exam conssts of questons. Do at least 0 of the parts of the man exam. I wll score
More informationConcepts for Wireless Ad Hoc
Bandwdth and Avalable Bandwdth oncepts for Wreless Ad Hoc Networks Marco A. Alzate Unversdad Dstrtal, Bogotá Néstor M. Peña Unversdad de los Andes, Bogotá Mguel A. abrador Unversty of South Florda, Tampa
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationEquilibrium with Complete Markets. Instructor: Dmytro Hryshko
Equlbrum wth Complete Markets Instructor: Dmytro Hryshko 1 / 33 Readngs Ljungqvst and Sargent. Recursve Macroeconomc Theory. MIT Press. Chapter 8. 2 / 33 Equlbrum n pure exchange, nfnte horzon economes,
More informationStat 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 informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationLecture Randomized Load Balancing strategies and their analysis. Probability concepts include, counting, the union bound, and Chernoff bounds.
U.C. Berkeley CS273: Parallel and Dstrbuted Theory Lecture 1 Professor Satsh Rao August 26, 2010 Lecturer: Satsh Rao Last revsed September 2, 2010 Lecture 1 1 Course Outlne We wll cover a samplng of the
More information( ) ( ) ( ) ( ) STOCHASTIC SIMULATION FOR BLOCKED DATA. Monte Carlo simulation Rejection sampling Importance sampling Markov chain Monte Carlo
SOCHASIC SIMULAIO FOR BLOCKED DAA Stochastc System Analyss and Bayesan Model Updatng Monte Carlo smulaton Rejecton samplng Importance samplng Markov chan Monte Carlo Monte Carlo smulaton Introducton: If
More informationCIE4801 Transportation and spatial modelling Trip distribution
CIE4801 ransportaton and spatal modellng rp dstrbuton Rob van Nes, ransport & Plannng 17/4/13 Delft Unversty of echnology Challenge the future Content What s t about hree methods Wth specal attenton for
More informationPrimer on High-Order Moment Estimators
Prmer on Hgh-Order Moment Estmators Ton M. Whted July 2007 The Errors-n-Varables Model We wll start wth the classcal EIV for one msmeasured regressor. The general case s n Erckson and Whted Econometrc
More informationLab session: numerical simulations of sponateous polarization
Lab sesson: numercal smulatons of sponateous polarzaton Emerc Boun & Vncent Calvez CNRS, ENS Lyon, France CIMPA, Hammamet, March 2012 Spontaneous cell polarzaton: the 1D case The Hawkns-Voturez model for
More informationZhongping Jiang Tengfei Liu
Zhongpng Jang Tengfe Lu 4 F.L. Lews, NAI Moncref-O Donnell Char, UTA Research Insttute (UTARI) The Unversty of Texas at Arlngton, USA and Qan Ren Consultng Professor, State Key Laboratory of Synthetcal
More informationLecture 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 informationPortfolios with Trading Constraints and Payout Restrictions
Portfolos wth Tradng Constrants and Payout Restrctons John R. Brge Northwestern Unversty (ont wor wth Chrs Donohue Xaodong Xu and Gongyun Zhao) 1 General Problem (Very) long-term nvestor (eample: unversty
More informationOPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau
OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION Chrstophe De Lug and Erc Moreau Unversty of Toulon LSEET UMR CNRS 607 av. G. Pompdou BP56 F-8362 La Valette du Var Cedex
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationA Computational Viewpoint on Classical Density Functional Theory
A Computatonal Vewpont on Classcal Densty Functonal Theory Matthew Knepley and Drk Gllespe Computaton Insttute Unversty of Chcago Department of Molecular Bology and Physology Rush Unversty Medcal Center
More informationBasically, if you have a dummy dependent variable you will be estimating a probability.
ECON 497: Lecture Notes 13 Page 1 of 1 Metropoltan State Unversty ECON 497: Research and Forecastng Lecture Notes 13 Dummy Dependent Varable Technques Studenmund Chapter 13 Bascally, f you have a dummy
More informationIN THE. C. G. Cassandras
IN THE OF C. G. Cassandras Boston Unversty cgc@bu.edu, http://vta.bu.edu/cgc OUTLINE COMPLEXITY FUNDAMENTAL LIMITS BARGAIN HUNTING IDEAS AND PITFALLS - SAMPLE PATH ANALYSIS - DECOMPOSITION - ABSTRACTION
More informationAn Experiment/Some Intuition (Fall 2006): Lecture 18 The EM Algorithm heads coin 1 tails coin 2 Overview Maximum Likelihood Estimation
An Experment/Some Intuton I have three cons n my pocket, 6.864 (Fall 2006): Lecture 18 The EM Algorthm Con 0 has probablty λ of heads; Con 1 has probablty p 1 of heads; Con 2 has probablty p 2 of heads
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationDOWNLINK CELL ASSOCIATION OPTIMIZATION FOR HETEROGENEOUS NETWORKS VIA DUAL COORDINATE DESCENT. Kaiming Shen and Wei Yu
DOWNLIN CELL ASSOCIATION OPTIMIZATION FOR HETEROGENEOUS NETWORS VIA DUAL COORDINATE DESCENT amng Shen and We Yu Electrcal and Computer Engneerng Dept. Unversty of Toronto, Toronto, Ontaro, Canada M5S 3G4
More informationPricing and Resource Allocation Game Theoretic Models
Prcng and Resource Allocaton Game Theoretc Models Zhy Huang Changbn Lu Q Zhang Computer and Informaton Scence December 8, 2009 Z. Huang, C. Lu, and Q. Zhang (CIS) Game Theoretc Models December 8, 2009
More informationPriority Queuing with Finite Buffer Size and Randomized Push-out Mechanism
ICN 00 Prorty Queung wth Fnte Buffer Sze and Randomzed Push-out Mechansm Vladmr Zaborovsy, Oleg Zayats, Vladmr Muluha Polytechncal Unversty, Sant-Petersburg, Russa Arl 4, 00 Content I. Introducton II.
More informationEM and Structure Learning
EM and Structure Learnng Le Song Machne Learnng II: Advanced Topcs CSE 8803ML, Sprng 2012 Partally observed graphcal models Mxture Models N(μ 1, Σ 1 ) Z X N N(μ 2, Σ 2 ) 2 Gaussan mxture model Consder
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationSuggested solutions for the exam in SF2863 Systems Engineering. June 12,
Suggested solutons for the exam n SF2863 Systems Engneerng. June 12, 2012 14.00 19.00 Examner: Per Enqvst, phone: 790 62 98 1. We can thnk of the farm as a Jackson network. The strawberry feld s modelled
More informationrisk and uncertainty assessment
Optmal forecastng of atmospherc qualty n ndustral regons: rsk and uncertanty assessment Vladmr Penenko Insttute of Computatonal Mathematcs and Mathematcal Geophyscs SD RAS Goal Development of theoretcal
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationChecking Pairwise Relationships. Lecture 19 Biostatistics 666
Checkng Parwse Relatonshps Lecture 19 Bostatstcs 666 Last Lecture: Markov Model for Multpont Analyss X X X 1 3 X M P X 1 I P X I P X 3 I P X M I 1 3 M I 1 I I 3 I M P I I P I 3 I P... 1 IBD states along
More informationAmplification and Relaxation of Electron Spin Polarization in Semiconductor Devices
Amplfcaton and Relaxaton of Electron Spn Polarzaton n Semconductor Devces Yury V. Pershn and Vladmr Prvman Center for Quantum Devce Technology, Clarkson Unversty, Potsdam, New York 13699-570, USA Spn Relaxaton
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationRELIABILITY ASSESSMENT
CHAPTER Rsk Analyss n Engneerng and Economcs RELIABILITY ASSESSMENT A. J. Clark School of Engneerng Department of Cvl and Envronmental Engneerng 4a CHAPMAN HALL/CRC Rsk Analyss for Engneerng Department
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More informationVariability-Driven Module Selection with Joint Design Time Optimization and Post-Silicon Tuning
Asa and South Pacfc Desgn Automaton Conference 2008 Varablty-Drven Module Selecton wth Jont Desgn Tme Optmzaton and Post-Slcon Tunng Feng Wang, Xaoxa Wu, Yuan Xe The Pennsylvana State Unversty Department
More informationChapter 3. Two-Variable Regression Model: The Problem of Estimation
Chapter 3. Two-Varable Regresson Model: The Problem of Estmaton Ordnary Least Squares Method (OLS) Recall that, PRF: Y = β 1 + β X + u Thus, snce PRF s not drectly observable, t s estmated by SRF; that
More informationEn Route Traffic Optimization to Reduce Environmental Impact
En Route Traffc Optmzaton to Reduce Envronmental Impact John-Paul Clarke Assocate Professor of Aerospace Engneerng Drector of the Ar Transportaton Laboratory Georga Insttute of Technology Outlne 1. Introducton
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationCross-layer Optimization of Correlated Data Gathering in Wireless Sensor Networks
IEEE TRANSACTIONS ON MOBILE COMPUTING Cross-layer Optmzaton of Correlated Data Gatherng n Wreless Sensor Networks Shbo He, Student Member, IEEE, Jmng Chen, Senor Member, IEEE, Davd K.Y. Yau, Member, IEEE,
More informationDynamic Programming. Lecture 13 (5/31/2017)
Dynamc Programmng Lecture 13 (5/31/2017) - A Forest Thnnng Example - Projected yeld (m3/ha) at age 20 as functon of acton taken at age 10 Age 10 Begnnng Volume Resdual Ten-year Volume volume thnned volume
More informationpower systems eehlaboratory
power systems eehlaboratory c b c s D e f h l p q r T u u x N { 1,..., N } t q (t) t e (t) q (t) = 1 t (e (t) e (t 1)), t q mn e mn q (t) q max e (t) e max. c b (t) c s (t) p (t) := l (t) r (t) +
More informationCS 798: Homework Assignment 2 (Probability)
0 Sample space Assgned: September 30, 2009 In the IEEE 802 protocol, the congeston wndow (CW) parameter s used as follows: ntally, a termnal wats for a random tme perod (called backoff) chosen n the range
More informationA Link Transmission Model for Air Traffic Flow Prediction and Optimization
School of Aeronautcs and Astronautcs A Ln Transmsson Model for Ar Traffc Flow Predcton and Optmzaton Y Cao and Dengfeng Sun School of Aeronautcs and Astronautcs Purdue Unversty cao20@purdue.edu Aerospace
More informationMotion Perception Under Uncertainty. Hongjing Lu Department of Psychology University of Hong Kong
Moton Percepton Under Uncertanty Hongjng Lu Department of Psychology Unversty of Hong Kong Outlne Uncertanty n moton stmulus Correspondence problem Qualtatve fttng usng deal observer models Based on sgnal
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationEfficient Optimal Control for a Unitary Operation under Dissipative Evolution
Effcent Optmal Control for a Untary Operaton under Dsspatve Evoluton Mchael Goerz, Danel Rech, Chrstane P. Koch Unverstät Kassel March 20, 2014 DPG Frühjahrstagung 2014, Berln Sesson Q 43 Mchael Goerz
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationNewton s Method for One - Dimensional Optimization - Theory
Numercal Methods Newton s Method for One - Dmensonal Optmzaton - Theory For more detals on ths topc Go to Clck on Keyword Clck on Newton s Method for One- Dmensonal Optmzaton You are free to Share to copy,
More informationA Simple Inventory System
A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017
More informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationFast Multi-Channel Gibbs-Sampling for Low-Overhead Distributed Resource Allocation in OFDMA Cellular Networks
Fast Mult-Channel Gbbs-Samplng for Low-Overhead Dstrbuted Resource Allocaton n OFDMA Cellular Networks Po-Ka Huang 1, Xaojun Ln 1, Ness B. Shroff 2, and Davd J. Love 1 Abstract A major challenge n OFDMA
More informationPlanning and Scheduling to Minimize Makespan & Tardiness. John Hooker Carnegie Mellon University September 2006
Plannng and Schedulng to Mnmze Makespan & ardness John Hooker Carnege Mellon Unversty September 2006 he Problem Gven a set of tasks, each wth a deadlne 2 he Problem Gven a set of tasks, each wth a deadlne
More informationOutline for today. Markov chain Monte Carlo. Example: spatial statistics (Christensen and Waagepetersen 2001)
Markov chan Monte Carlo Rasmus Waagepetersen Department of Mathematcs Aalborg Unversty Denmark November, / Outlne for today MCMC / Condtonal smulaton for hgh-dmensonal U: Markov chan Monte Carlo Consder
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 7 (20) 537 555 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. ournal homepage: www.elsever.com/locate/pdc Game-theoretc statc load balancng for dstrbuted systems
More informationRandom Partitions of Samples
Random Parttons of Samples Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract In the present paper we construct a decomposton of a sample nto a fnte number of subsamples
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationPROBLEM 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 informationCognitive Access Algorithms For Multiple Access Channels
203 IEEE 4th Workshop on Sgnal Processng Advances n Wreless Communcatons SPAWC) Cogntve Access Algorthms For Multple Access Channels Ychuan Hu and Alejandro Rbero, Department of Electrcal and Systems Engneerng,
More informationSIO 224. m(r) =(ρ(r),k s (r),µ(r))
SIO 224 1. A bref look at resoluton analyss Here s some background for the Masters and Gubbns resoluton paper. Global Earth models are usually found teratvely by assumng a startng model and fndng small
More informationClustering through Mixture Models
lusterng through Mxture Models General referenes: Lndsay B.G. 995 Mxture models: theory geometry and applatons FS- BMS Regonal onferene Seres n Probablty and Statsts. MLahlan G.J. Basford K.E. 988 Mxture
More informationI + HH H N 0 M T H = UΣV H = [U 1 U 2 ] 0 0 E S. X if X 0 0 if X < 0 (X) + = = M T 1 + N 0. r p + 1
Homework 4 Problem Capacty wth CSI only at Recever: C = log det I + E )) s HH H N M T R SS = I) SVD of the Channel Matrx: H = UΣV H = [U 1 U ] [ Σr ] [V 1 V ] H Capacty wth CSI at both transmtter and
More informationRobust mixture modeling using multivariate skew t distributions
Robust mxture modelng usng multvarate skew t dstrbutons Tsung-I Ln Department of Appled Mathematcs and Insttute of Statstcs Natonal Chung Hsng Unversty, Tawan August, 1 T.I. Ln (NCHU Natonal Chung Hsng
More informationLecture 4. Instructor: Haipeng Luo
Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would
More informationDr. 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 informationOnline Appendix. t=1 (p t w)q t. Then the first order condition shows that
Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate
More informationComputational issues surrounding the management of an ecological food web
Computatonal ssues surroundng the management of an ecologcal food web Wllam J M Probert, Eve McDonald-Madden, Nathale Peyrard, Régs Sabbadn AIGM 12, ECAI2012 Montpeller, France Ratonale Ecology has many
More informationSpace of ML Problems. CSE 473: Artificial Intelligence. Parameter Estimation and Bayesian Networks. Learning Topics
/7/7 CSE 73: Artfcal Intellgence Bayesan - Learnng Deter Fox Sldes adapted from Dan Weld, Jack Breese, Dan Klen, Daphne Koller, Stuart Russell, Andrew Moore & Luke Zettlemoyer What s Beng Learned? Space
More informationDurban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications
Durban Watson for Testng the Lack-of-Ft of Polynomal Regresson Models wthout Replcatons Ruba A. Alyaf, Maha A. Omar, Abdullah A. Al-Shha ralyaf@ksu.edu.sa, maomar@ksu.edu.sa, aalshha@ksu.edu.sa Department
More informationTesting for seasonal unit roots in heterogeneous panels
Testng for seasonal unt roots n heterogeneous panels Jesus Otero * Facultad de Economía Unversdad del Rosaro, Colomba Jeremy Smth Department of Economcs Unversty of arwck Monca Gulett Aston Busness School
More informationAn Integrated Asset Allocation and Path Planning Method to to Search for a Moving Target in in a Dynamic Environment
An Integrated Asset Allocaton and Path Plannng Method to to Search for a Movng Target n n a Dynamc Envronment Woosun An Mansha Mshra Chulwoo Park Prof. Krshna R. Pattpat Dept. of Electrcal and Computer
More informationEfficient, General Point Cloud Registration with Kernel Feature Maps
Effcent, General Pont Cloud Regstraton wth Kernel Feature Maps Hanchen Xong, Sandor Szedmak, Justus Pater Insttute of Computer Scence Unversty of Innsbruck 30 May 2013 Hanchen Xong (Un.Innsbruck) 3D Regstraton
More information1 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 informationDepartment of Computer Science Artificial Intelligence Research Laboratory. Iowa State University MACHINE LEARNING
MACHINE LEANING Vasant Honavar Bonformatcs and Computatonal Bology rogram Center for Computatonal Intellgence, Learnng, & Dscovery Iowa State Unversty honavar@cs.astate.edu www.cs.astate.edu/~honavar/
More informationStatistical tables are provided Two Hours UNIVERSITY OF MANCHESTER. Date: Wednesday 4 th June 2008 Time: 1400 to 1600
Statstcal tables are provded Two Hours UNIVERSITY OF MNCHESTER Medcal Statstcs Date: Wednesday 4 th June 008 Tme: 1400 to 1600 MT3807 Electronc calculators may be used provded that they conform to Unversty
More informationGlobal Optimization of Truss. Structure Design INFORMS J. N. Hooker. Tallys Yunes. Slide 1
Slde 1 Global Optmzaton of Truss Structure Desgn J. N. Hooker Tallys Yunes INFORMS 2010 Truss Structure Desgn Select sze of each bar (possbly zero) to support the load whle mnmzng weght. Bar szes are dscrete.
More informationStatistical Evaluation of WATFLOOD
tatstcal Evaluaton of WATFLD By: Angela MacLean, Dept. of Cvl & Envronmental Engneerng, Unversty of Waterloo, n. ctober, 005 The statstcs program assocated wth WATFLD uses spl.csv fle that s produced wth
More informationHashing. Alexandra Stefan
Hashng Alexandra Stefan 1 Hash tables Tables Drect access table (or key-ndex table): key => ndex Hash table: key => hash value => ndex Man components Hash functon Collson resoluton Dfferent keys mapped
More informationProbabilistic Graphical Models
School of Computer Scence robablstc Graphcal Models Appromate Inference: Markov Chan Monte Carlo 05 07 Erc Xng Lecture 7 March 9 04 X X 075 05 05 03 X 3 Erc Xng @ CMU 005-04 Recap of Monte Carlo Monte
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationECTRI FEHRL FERSI Young Researchers Seminar 2015
DLR.de Chart 1 ECTRI FEHRL FERSI Young Researchers Semnar 2015 TRANSPORT USER BENEFITS MEASURE FOR TRAVEL DEMAND MODELS WITH CONSTRAINTS Chrstan Wnkler Insttute of Transport Research German Aerospace Center
More informationNotes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology
Inverse transformatons Generaton of random observatons from gven dstrbutons Assume that random numbers,,, are readly avalable, where each tself s a random varable whch s unformly dstrbuted over the range(,).
More informationBIO Lab 2: TWO-LEVEL NORMAL MODELS with school children popularity data
Lab : TWO-LEVEL NORMAL MODELS wth school chldren popularty data Purpose: Introduce basc two-level models for normally dstrbuted responses usng STATA. In partcular, we dscuss Random ntercept models wthout
More informationFinite Mixture Models and Expectation Maximization. Most slides are from: Dr. Mario Figueiredo, Dr. Anil Jain and Dr. Rong Jin
Fnte Mxture Models and Expectaton Maxmzaton Most sldes are from: Dr. Maro Fgueredo, Dr. Anl Jan and Dr. Rong Jn Recall: The Supervsed Learnng Problem Gven a set of n samples X {(x, y )},,,n Chapter 3 of
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 33, NO. 3, MARCH
IEEE JOURAL O SELECTED AREAS I COMMUICATIOS, VOL. 33, O. 3, MARCH 205 467 Optmum Polces for an Energy Harvestng Transmtter Under Energy Storage Losses Kaya Tutuncuoglu, Student Member, IEEE, Ayln Yener,
More informationExternalities in wireless communication: A public goods solution approach to power allocation. by Shrutivandana Sharma
Externaltes n wreless communcaton: A publc goods soluton approach to power allocaton by Shrutvandana Sharma SI 786 Tuesday, Feb 2, 2006 Outlne Externaltes: Introducton Plannng wth externaltes Power allocaton:
More informationContinuous vs. Discrete Goods
CE 651 Transportaton Economcs Charsma Choudhury Lecture 3-4 Analyss of Demand Contnuous vs. Dscrete Goods Contnuous Goods Dscrete Goods x auto 1 Indfference u curves 3 u u 1 x 1 0 1 bus Outlne Data Modelng
More informationEnsemble 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 informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationDynamic Systems on Graphs
Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,
More informationQueuing system theory
Elements of queung system: Queung system theory Every queung system conssts of three elements: An arrval process: s characterzed by the dstrbuton of tme between the arrval of successve customers, the mean
More informationChapter 4: Root Finding
Chapter 4: Root Fndng Startng values Closed nterval methods (roots are search wthn an nterval o Bsecton Open methods (no nterval o Fxed Pont o Newton-Raphson o Secant Method Repeated roots Zeros of Hgher-Dmensonal
More information