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

Size: px
Start display at page:

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

Transcription

1 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

2 oyo Insttute of echnology Fujta Laboratory Outlne oyo Insttute of echnology Introducton roblem Formulaton erodc System Results Concluson & Future Wors

3 oyo Insttute of echnology Fujta Laboratory lant Introducton. lant oyo Insttute of echnology Enc Dec Enc Dec Controller Networ Controller Challenges : Band-lmted channels me delay acet loss QoS (Qualty of Servce) control: -Wred networs use low pacet loss channel s epensve n term of networ costs -Wreless networs use hgh power s epensve n term of energy consumpton

4 oyo Insttute of echnology Fujta Laboratory Introducton oyo Insttute of echnology o Deal wth ths trade off : Introduce networ model wth many channels and dfferent pacet loss probabltes Introduce a perodc sequencng control scheme. Desgned offlne smplcty of the desgn Can be easly mplemented

5 oyo Insttute of echnology Fujta Laboratory roblem Formulaton oyo Insttute of echnology z H w u q θ Comm. Channel v u Q q y K Bw B Q Θ v y C D w v System (H ) : q : [ ] R p Swtchng pattern Only one channel can be used at one tme Θ θ M θ p q p θ { } : prob θ acet loss ndcator acet loss probablty

6 oyo Insttute of echnology roblem Formulaton ssume that there s p channels wth pacet loss probabltes {... p} ssume the perodc sequencng q {. p p} each channel s used n tmes n one perod. Goal : Necessary condton on for the stablzaton of the plant. (note: apply state-feedbac controller) For system θ ( ) whch s N-perodc the orgn s sad to be : Mean-square stable f for every ntal state [ ] θ lm E ( ) θ Stochastcally stable f for every ntal state E [ ] θ < ( ) θ oyo Insttute of echnology Fujta Laboratory

7 oyo Insttute of echnology Fujta Laboratory erodc System oyo Insttute of echnology erodc System : ( ) Where s a perodc matr of perod N.e N Lemma : he followng statements are equvalent each other. ( ) s stable. here ests a N-perodc postve defnte soluton of the Lyapunov nequalty ( ) < S. Bttant and. Colaner IFC erodc control systems

8 oyo Insttute of echnology Fujta Laboratory Results oyo Insttute of echnology roposton : For the system H the orgn s mean square stable (stochastcally stable) ff there ests an N- n n perodc matr such that l l > and l R l l l l l < for l IN () (roof) Defne the Lyapunov functon as : V Where s tme varyng and he system s stochastcally stable ff l l l l l N If < for l I holds for l then t also holds for ln E V θ <

9 Fujta Laboratory oyo Insttute of echnology oyo Insttute of echnology roof System H can be wrtten as : pplyng lemma and compute the epected value of the dfference : [ ] [ ] [ ] [ ] [ ] ( ) ) ( < E E E V E V V E θ θ θ θ ( ) B w K B Q D I C K B Q B w ) ( Θ Θ

10 oyo Insttute of echnology Fujta Laboratory Results oyo Insttute of echnology roposton : he necessary condton on the pacet loss probabltes so that there ests a controller that stablzes the plant s gven by p n N ma λ( ) < Where denotes an egenvalue λ () (roof) By proposton he system s stable ff there ests an N-perodc > such that N nequaltes n () hold. If the uncontrolled system s stable we also can guarantee that the controlled system s also stable. Straghtforward calculaton leads to the nequalty :

11 oyo Insttute of echnology Fujta Laboratory roof oyo Insttute of echnology n n n p ( ) N N < > p... p he soluton of ests ff s a stable matr.e. p n ma λ < N ( ) n n... n p N

12 oyo Insttute of echnology Fujta Laboratory erformance-guaranteed Decay Rate ssume there are two channels : and Fnd the largest perodc N such that : sup (for any pacet loss realzaton) he mamum perodc N s gven by : ( ) c c oyo Insttute of echnology N log log c ( c )

13 Results for Scalar Case oyo Insttute of echnology By pplyng the same computaton as n proposton the necessary and suffcent condton for the system to be stable s gven by ssume that we have two channels ( and ) whch are used n and n tmes respectvely. he relaton between n and n s gven by ssume that we have two channels ( and ) whch are swtched every tme step. he necessary & suffcent condton for the stablty s gven by oyo Insttute of echnology n p ( ) ( ) a ac n < < log n < ( a ( ) a ) log( a ( ) c a ac ac c ) a c Fujta Laboratory

14 oyo Insttute of echnology Fujta Laboratory Conclusons & Future Wor oyo Insttute of echnology he necessary condton for the stablty of perodc sequencng system and also the performance measure are ntroduced. Net step consder schedulng scheme and apply the model to mult-agent or sensor networs problems

Portfolios with Trading Constraints and Payout Restrictions

Portfolios 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 information

Controller Design of High Order Nonholonomic System with Nonlinear Drifts

Controller Design of High Order Nonholonomic System with Nonlinear Drifts Internatonal Journal of Automaton and Computng 6(3, August 9, 4-44 DOI:.7/s633-9-4- Controller Desgn of Hgh Order Nonholonomc System wth Nonlnear Drfts Xu-Yun Zheng Yu-Qang Wu Research Insttute of Automaton,

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.

THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan. THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY Wllam A. Pearlman 2002 References: S. Armoto - IEEE Trans. Inform. Thy., Jan. 1972 R. Blahut - IEEE Trans. Inform. Thy., July 1972 Recall

More information

Dynamic Systems on Graphs

Dynamic 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 information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Continuous Time Markov Chain

Continuous Time Markov Chain Contnuous Tme Markov Chan Hu Jn Department of Electroncs and Communcaton Engneerng Hanyang Unversty ERICA Campus Contents Contnuous tme Markov Chan (CTMC) Propertes of sojourn tme Relatons Transton probablty

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Stabilization and Performance Analysis for Networked Flight Control System with Random Time Delays via a LMI Gridding Approach

Stabilization and Performance Analysis for Networked Flight Control System with Random Time Delays via a LMI Gridding Approach Sensors & ransducers ol. 58 Issue November 23 pp. 32-38 Sensors & ransducers 23 by IFSA http://www.sensorsportal.com Stablzaton and Performance Analyss for Networed Flght Control System wth Random me Delays

More information

Changing Topology and Communication Delays

Changing Topology and Communication Delays Prepared by F.L. Lews Updated: Saturday, February 3, 00 Changng Topology and Communcaton Delays Changng Topology The graph connectvty or topology may change over tme. Let G { G, G,, G M } wth M fnte be

More information

ECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)

ECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006) ECE 534: Elements of Informaton Theory Solutons to Mdterm Eam (Sprng 6) Problem [ pts.] A dscrete memoryless source has an alphabet of three letters,, =,, 3, wth probabltes.4,.4, and., respectvely. (a)

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 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 information

Outline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]

Outline. 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 information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource 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 information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

Flexible Quantization

Flexible Quantization wb 06/02/21 1 Flexble Quantzaton Bastaan Klejn KTH School of Electrcal Engneerng Stocholm wb 06/02/21 2 Overvew Motvaton for codng technologes Basc quantzaton and codng Hgh-rate quantzaton theory wb 06/02/21

More information

Solution 1 for USTC class Physics of Quantum Information

Solution 1 for USTC class Physics of Quantum Information Soluton 1 for 018 019 USTC class Physcs of Quantum Informaton Shua Zhao, Xn-Yu Xu and Ka Chen Natonal Laboratory for Physcal Scences at Mcroscale and Department of Modern Physcs, Unversty of Scence and

More information

Stability and Stabilization for Discrete Systems with Time-varying Delays Based on the Average Dwell-time Method

Stability and Stabilization for Discrete Systems with Time-varying Delays Based on the Average Dwell-time Method Proceedngs of the 29 IEEE Internatonal Conference on Systems, an, and Cybernetcs San Antono, TX, USA - October 29 Stablty and Stablzaton for Dscrete Systems wth Tme-varyng Delays Based on the Average Dwell-tme

More information

Marginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients

Marginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients ECON 5 -- NOE 15 Margnal Effects n Probt Models: Interpretaton and estng hs note ntroduces you to the two types of margnal effects n probt models: margnal ndex effects, and margnal probablty effects. It

More information

A new Approach for Solving Linear Ordinary Differential Equations

A new Approach for Solving Linear Ordinary Differential Equations , ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum 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 Mamum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models for

More information

Limit Cycle Generation for Multi-Modal and 2-Dimensional Piecewise Affine Control Systems

Limit Cycle Generation for Multi-Modal and 2-Dimensional Piecewise Affine Control Systems Lmt Cycle Generaton for Mult-Modal and 2-Dmensonal Pecewse Affne Control Systems atsuya Ka Department of Appled Electroncs Faculty of Industral Scence and echnology okyo Unversty of Scence 6-3- Njuku Katsushka-ku

More information

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

CIS526: 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 information

Solving Fractional Nonlinear Fredholm Integro-differential Equations via Hybrid of Rationalized Haar Functions

Solving Fractional Nonlinear Fredholm Integro-differential Equations via Hybrid of Rationalized Haar Functions ISSN 746-7659 England UK Journal of Informaton and Computng Scence Vol. 9 No. 3 4 pp. 69-8 Solvng Fractonal Nonlnear Fredholm Integro-dfferental Equatons va Hybrd of Ratonalzed Haar Functons Yadollah Ordokhan

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 note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng

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

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

More information

Curvature and isoperimetric inequality

Curvature and isoperimetric inequality urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence

More information

Quality of Routing Congestion Games in Wireless Sensor Networks

Quality of Routing Congestion Games in Wireless Sensor Networks Qualty of Routng ongeston Gaes n Wreless Sensor Networs ostas Busch Lousana State Unversty Rajgoal Kannan Lousana State Unversty Athanasos Vaslaos Unv. of Western Macedona 1 Outlne of Tal Introducton Prce

More information

Improved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays

Improved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays Avalable onlne at www.scencedrect.com Proceda Engneerng 5 ( 4456 446 Improved delay-dependent stablty crtera for dscrete-tme stochastc neural networs wth tme-varyng delays Meng-zhuo Luo a Shou-mng Zhong

More information

A generalization of a trace inequality for positive definite matrices

A generalization of a trace inequality for positive definite matrices A generalzaton of a trace nequalty for postve defnte matrces Elena Veronca Belmega, Marc Jungers, Samson Lasaulce To cte ths verson: Elena Veronca Belmega, Marc Jungers, Samson Lasaulce. A generalzaton

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

Transition Probability Bounds for the Stochastic Stability Robustness of Continuous- and Discrete-Time Markovian Jump Linear Systems

Transition Probability Bounds for the Stochastic Stability Robustness of Continuous- and Discrete-Time Markovian Jump Linear Systems Transton Probablty Bounds for the Stochastc Stablty Robustness of Contnuous- and Dscrete-Tme Markovan Jump Lnear Systems Mehmet Karan, Peng Sh, and C Yalçın Kaya June 17, 2006 Abstract Ths paper consders

More information

Economics 8105 Macroeconomic Theory Recitation 1

Economics 8105 Macroeconomic Theory Recitation 1 Economcs 8105 Macroeconomc Theory Rectaton 1 Outlne: Conor Ryan September 6th, 2016 Adapted From Anh Thu (Monca) Tran Xuan s Notes Last Updated September 20th, 2016 Dynamc Economc Envronment Arrow-Debreu

More information

6. Stochastic processes (2)

6. Stochastic processes (2) 6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process

More information

Output Feedback Stabilization of Networked Control Systems With Packet Dropouts

Output Feedback Stabilization of Networked Control Systems With Packet Dropouts IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 52, NO. 9, SEPTEMBER 2007 705 Output Feedback Stablzaton of Networked Control Systems Wth Packet Dropouts Wen-An Zhang and L Yu Abstract In ths paper, we dscuss

More information

The non-negativity of probabilities and the collapse of state

The non-negativity of probabilities and the collapse of state The non-negatvty of probabltes and the collapse of state Slobodan Prvanovć Insttute of Physcs, P.O. Box 57, 11080 Belgrade, Serba Abstract The dynamcal equaton, beng the combnaton of Schrödnger and Louvlle

More information

Solution 1 for USTC class Physics of Quantum Information

Solution 1 for USTC class Physics of Quantum Information Soluton 1 for 017 018 USTC class Physcs of Quantum Informaton Shua Zhao, Xn-Yu Xu and Ka Chen Natonal Laboratory for Physcal Scences at Mcroscale and Department of Modern Physcs, Unversty of Scence and

More information

6. Stochastic processes (2)

6. Stochastic processes (2) Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space

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

Google PageRank with Stochastic Matrix

Google PageRank with Stochastic Matrix Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d

More information

Stabilization and Performance Analysis for a Class of Switched Systems

Stabilization and Performance Analysis for a Class of Switched Systems 43rd IEEE Conference on Decson and Control December 14-17, 2004 Atlants, Paradse Island, Bahamas ThB02.6 Stablzaton and Performance Analyss for a Class of Swtched Systems Le Fang, Ha Ln, and Panos J. Antsakls

More information

Finding Dense Subgraphs in G(n, 1/2)

Finding Dense Subgraphs in G(n, 1/2) Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

More information

On the correction of the h-index for career length

On the correction of the h-index for career length 1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat

More information

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,

More information

Adaptive Consensus Control of Multi-Agent Systems with Large Uncertainty and Time Delays *

Adaptive Consensus Control of Multi-Agent Systems with Large Uncertainty and Time Delays * Journal of Robotcs, etworkng and Artfcal Lfe, Vol., o. (September 04), 5-9 Adaptve Consensus Control of Mult-Agent Systems wth Large Uncertanty and me Delays * L Lu School of Mechancal Engneerng Unversty

More information

The optimal delay of the second test is therefore approximately 210 hours earlier than =2.

The optimal delay of the second test is therefore approximately 210 hours earlier than =2. THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple

More information

Lecture 3: Probability Distributions

Lecture 3: Probability Distributions Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

Output-Based Event-Triggered Control with. Guaranteed L -gain and Improved and Decentralised Event-Triggering

Output-Based Event-Triggered Control with. Guaranteed L -gain and Improved and Decentralised Event-Triggering Output-Based Event-Trggered Control wth 1 Guaranteed L -gan and Improved and Decentralsed Event-Trggerng M.C.F. Donkers and W.P.M.H. Heemels Abstract Most event-trggered controllers avalable nowadays are

More information

Controller Design for Networked Control Systems in Multiple-packet Transmission with Random Delays

Controller Design for Networked Control Systems in Multiple-packet Transmission with Random Delays Appled Mehans and Materals Onlne: 03-0- ISSN: 66-748, Vols. 78-80, pp 60-604 do:0.408/www.sentf.net/amm.78-80.60 03 rans eh Publatons, Swtzerland H Controller Desgn for Networed Control Systems n Multple-paet

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

Event-predictive Control. for Energy Saving of Wireless Networked Control System

Event-predictive Control. for Energy Saving of Wireless Networked Control System 9 Amercan Control Conference Hyatt Regency Rverfront, St. ous, MO, USA June -, 9 ha8.4 Event-predctve Control for Energy Savng of Wreless Networed Control System Yutaa Ino, aesh Hatanaa, Masayu Fujta Abstract

More information

Lyapunov-Razumikhin and Lyapunov-Krasovskii theorems for interconnected ISS time-delay systems

Lyapunov-Razumikhin and Lyapunov-Krasovskii theorems for interconnected ISS time-delay systems Proceedngs of the 19th Internatonal Symposum on Mathematcal Theory of Networks and Systems MTNS 2010 5 9 July 2010 Budapest Hungary Lyapunov-Razumkhn and Lyapunov-Krasovsk theorems for nterconnected ISS

More information

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE School of Computer and Communcaton Scences Handout 0 Prncples of Dgtal Communcatons Solutons to Problem Set 4 Mar. 6, 08 Soluton. If H = 0, we have Y = Z Z = Y

More information

Stability analysis for class of switched nonlinear systems

Stability analysis for class of switched nonlinear systems Stablty analyss for class of swtched nonlnear systems The MIT Faculty has made ths artcle openly avalable. Please share how ths access benefts you. Your story matters. Ctaton As Publshed Publsher Shaker,

More information

Entropy of Markov Information Sources and Capacity of Discrete Input Constrained Channels (from Immink, Coding Techniques for Digital Recorders)

Entropy of Markov Information Sources and Capacity of Discrete Input Constrained Channels (from Immink, Coding Techniques for Digital Recorders) Entropy of Marov Informaton Sources and Capacty of Dscrete Input Constraned Channels (from Immn, Codng Technques for Dgtal Recorders). Entropy of Marov Chans We have already ntroduced the noton of entropy

More information

Joint Scheduling of Rate-guaranteed and Best-effort Services over a Wireless Channel

Joint Scheduling of Rate-guaranteed and Best-effort Services over a Wireless Channel Jont Schedulng of Rate-guaranteed and Best-effort Servces over a Wreless Channel Murtaza Zafer and Eytan Modano Abstract We consder mult-user schedulng over the downln channel n wreless data systems. Specfcally,

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Complex Numbers, Signals, and Circuits

Complex Numbers, Signals, and Circuits Complex Numbers, Sgnals, and Crcuts 3 August, 009 Complex Numbers: a Revew Suppose we have a complex number z = x jy. To convert to polar form, we need to know the magntude of z and the phase of z. z =

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

General viscosity iterative method for a sequence of quasi-nonexpansive mappings Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,

More information

Off-policy Reinforcement Learning for Robust Control of Discrete-time Uncertain Linear Systems

Off-policy Reinforcement Learning for Robust Control of Discrete-time Uncertain Linear Systems Off-polcy Renforcement Learnng for Robust Control of Dscrete-tme Uncertan Lnear Systems Yonglang Yang 1 Zhshan Guo 2 Donald Wunsch 3 Yxn Yn 1 1 School of Automatc and Electrcal Engneerng Unversty of Scence

More information

TAIL PROBABILITIES OF RANDOMLY WEIGHTED SUMS OF RANDOM VARIABLES WITH DOMINATED VARIATION

TAIL PROBABILITIES OF RANDOMLY WEIGHTED SUMS OF RANDOM VARIABLES WITH DOMINATED VARIATION Stochastc Models, :53 7, 006 Copyrght Taylor & Francs Group, LLC ISSN: 153-6349 prnt/153-414 onlne DOI: 10.1080/153634060064909 TAIL PROBABILITIES OF RANDOMLY WEIGHTED SUMS OF RANDOM VARIABLES WITH DOMINATED

More information

DO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED.

DO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED. EE 539 Homeworks Sprng 08 Updated: Tuesday, Aprl 7, 08 DO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED. For full credt, show all work. Some problems requre hand calculatons.

More information

Power law and dimension of the maximum value for belief distribution with the max Deng entropy

Power law and dimension of the maximum value for belief distribution with the max Deng entropy Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng

More information

Consistency & Convergence

Consistency & Convergence /9/007 CHE 374 Computatonal Methods n Engneerng Ordnary Dfferental Equatons Consstency, Convergence, Stablty, Stffness and Adaptve and Implct Methods ODE s n MATLAB, etc Consstency & Convergence Consstency

More information

Sliding Mode Control Based on Delay Estimation Online for Networked Control System with Model Uncertainties and Stochastic Less Delay

Sliding Mode Control Based on Delay Estimation Online for Networked Control System with Model Uncertainties and Stochastic Less Delay Sldng Mode Control Based on Delay Estmaton Onlne for Networed Control System wth Model Uncertantes and Stochastc Less Delay Yu chunla X an Research Inst. of H-ech, Hongqng own, X an, Chna e-mal: y_chunla@63.com

More information

THE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS

THE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS Copyrght 22 IFAC 5th rennal World Congress, Barcelona, Span HE GUARANEED COS CONROL FOR UNCERAIN LARGE SCALE INERCONNECED SYSEMS Hroak Mukadan Yasuyuk akato Yoshyuk anaka Koch Mzukam Faculty of Informaton

More information

Digital Modems. Lecture 2

Digital Modems. Lecture 2 Dgtal Modems Lecture Revew We have shown that both Bayes and eyman/pearson crtera are based on the Lkelhood Rato Test (LRT) Λ ( r ) < > η Λ r s called observaton transformaton or suffcent statstc The crtera

More information

Topics in Probability Theory and Stochastic Processes Steven R. Dunbar. Classes of States and Stationary Distributions

Topics in Probability Theory and Stochastic Processes Steven R. Dunbar. Classes of States and Stationary Distributions Steven R. Dunbar Department of Mathematcs 203 Avery Hall Unversty of Nebraska-Lncoln Lncoln, NE 68588-0130 http://www.math.unl.edu Voce: 402-472-3731 Fax: 402-472-8466 Topcs n Probablty Theory and Stochastc

More information

Event-Triggering in Distributed Networked Systems with Data Dropouts and Delays

Event-Triggering in Distributed Networked Systems with Data Dropouts and Delays Event-Trggerng n Dstrbuted Networked Systems wth Data Dropouts and Delays Xaofeng Wang and Mchael D. Lemmon Unversty of Notre Dame, Department of Electrcal Engneerng, Notre Dame, IN, 46556, USA, xwang13,lemmon@nd.edu

More information

FINITE-TIME BOUNDEDNESS AND STABILIZATION OF SWITCHED LINEAR SYSTEMS

FINITE-TIME BOUNDEDNESS AND STABILIZATION OF SWITCHED LINEAR SYSTEMS K Y BERNETIKA VOLUM E 46 21, NUMBER 5, P AGES 87 889 FINITE-TIME BOUNDEDNESS AND STABILIZATION OF SWITCHED LINEAR SYSTEMS Habo Du, Xangze Ln and Shhua L In ths paper, fnte-tme boundedness and stablzaton

More information

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Modelli Clamfim Equazioni differenziali 7 ottobre 2013 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 7 ottobre 2013 professor Danele Rtell danele.rtell@unbo.t 1/18? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

Aging model for a 40 V Nch MOS, based on an innovative approach F. Alagi, R. Stella, E. Viganò

Aging model for a 40 V Nch MOS, based on an innovative approach F. Alagi, R. Stella, E. Viganò Agng model for a 4 V Nch MOS, based on an nnovatve approach F. Alag, R. Stella, E. Vganò ST Mcroelectroncs Cornaredo (Mlan) - Italy Agng modelng WHAT IS AGING MODELING: Agng modelng s a tool to smulate

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

Lecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2

Lecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2 P470 Lecture 6/7 (February 10/1, 014) DIRAC EQUATION The non-relatvstc Schrödnger equaton was obtaned by notng that the Hamltonan H = P (1) m can be transformed nto an operator form wth the substtutons

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum 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 information

Distributed Optimal TXOP Control for Throughput Requirements in IEEE e Wireless LAN

Distributed Optimal TXOP Control for Throughput Requirements in IEEE e Wireless LAN Dstrbuted Optmal TXOP Control for Throughput Requrements n IEEE 80.e Wreless LAN Ju Yong Lee, Ho Young Hwang, Jtae Shn, and Shahrokh Valaee KAIST Insttute for Informaton Technology Convergence, KAIST,

More information

CHAPTER III Neural Networks as Associative Memory

CHAPTER III Neural Networks as Associative Memory CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people

More information

CONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE. Jovanka Nikić

CONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE. Jovanka Nikić 147 Kragujevac J. Math. 25 (2003) 147 154. CONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE Jovanka Nkć Faculty of Techncal Scences, Unversty of Nov Sad, Trg Dosteja Obradovća

More information

Hila Etzion. Min-Seok Pang

Hila Etzion. Min-Seok Pang RESERCH RTICLE COPLEENTRY ONLINE SERVICES IN COPETITIVE RKETS: INTINING PROFITILITY IN THE PRESENCE OF NETWORK EFFECTS Hla Etzon Department of Technology and Operatons, Stephen. Ross School of usness,

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

Joint Scheduling and Power-Allocation for Interference Management in Wireless Networks

Joint Scheduling and Power-Allocation for Interference Management in Wireless Networks Jont Schedulng and Power-Allocaton for Interference Management n Wreless Networks Xn Lu *, Edwn K. P. Chong, and Ness B. Shroff * * School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,

More information

Chapter Newton s Method

Chapter 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 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

Econometrics of Panel Data

Econometrics of Panel Data Econometrcs of Panel Data Jakub Mućk Meetng # 8 Jakub Mućk Econometrcs of Panel Data Meetng # 8 1 / 17 Outlne 1 Heterogenety n the slope coeffcents 2 Seemngly Unrelated Regresson (SUR) 3 Swamy s random

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16 STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus

More information

Modelli Clamfim Equazioni differenziali 22 settembre 2016

Modelli Clamfim Equazioni differenziali 22 settembre 2016 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 22 settembre 2016 professor Danele Rtell danele.rtell@unbo.t 1/22? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

SELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.

SELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d. SELECTED SOLUTIONS, SECTION 4.3 1. Weak dualty Prove that the prmal and dual values p and d defned by equatons 4.3. and 4.3.3 satsfy p d. We consder an optmzaton problem of the form The Lagrangan for ths

More information

High resolution entropy stable scheme for shallow water equations

High 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 information

A Note on Bound for Jensen-Shannon Divergence by Jeffreys

A Note on Bound for Jensen-Shannon Divergence by Jeffreys OPEN ACCESS Conference Proceedngs Paper Entropy www.scforum.net/conference/ecea- A Note on Bound for Jensen-Shannon Dvergence by Jeffreys Takuya Yamano, * Department of Mathematcs and Physcs, Faculty of

More information