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

Similar documents
Departure Process from a M/M/m/ Queue

Priority Queuing with Finite Buffer Size and Randomized Push-out Mechanism

Hidden Markov Model Cheat Sheet

Multi-dimensional Central Limit Theorem

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

Fuzzy approach to solve multi-objective capacitated transportation problem

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

Non-Ideality Through Fugacity and Activity

9 Characteristic classes

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation

Algorithms for factoring

Department of Mathematics, La Jolla, California Abstract

Approximation of Optimal Interface Boundary Conditions for Two-Lagrange Multiplier FETI Method

Bayesian Decision Theory

Complete Variance Decomposition Methods. Cédric J. Sallaberry

Machine Learning. Classification. Theory of Classification and Nonparametric Classifier. Representing data: Hypothesis (classifier) Eric Xing

A total variation approach

Continuous Time Markov Chain

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities

Comparing two Quantiles: the Burr Type X and Weibull Cases

Not-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up

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

Zeros and Zero Dynamics for Linear, Time-delay System

An application of generalized Tsalli s-havrda-charvat entropy in coding theory through a generalization of Kraft inequality

EP523 Introduction to QFT I

Google PageRank with Stochastic Matrix

Mechanics Physics 151

MIMA Group. Chapter 2 Bayesian Decision Theory. School of Computer Science and Technology, Shandong University. Xin-Shun SDU

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

EVALUATION OF THE VISCO-ELASTIC PROPERTIES IN ASPHALT RUBBER AND CONVENTIONAL MIXES

COMPUTING RELIABILITY FOR CLOSED-CYCLE COOLING SYSTEM IN THERMO-ELECTRIC POWER PLANTS BY MODELLING TO CIRCULAR CONSECUTIVE-2-OUT-OF-n:F SYSTEM

Analysis of Discrete Time Queues (Section 4.6)

Multi-dimensional Central Limit Argument

U-Pb Geochronology Practical: Background

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

ME 440 Aerospace Engineering Fundamentals

Research Journal of Pure Algebra -2(12), 2012, Page: Available online through ISSN

Linear system of the Schrödinger equation Notes on Quantum Mechanics

However, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values

Confidence intervals for weighted polynomial calibrations

Grover s Algorithm + Quantum Zeno Effect + Vaidman

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

Differential Polynomials

Dimension Reduction and Visualization of the Histogram Data

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor

UNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours

Random Walks on Digraphs

Timing-Driven Placement. Outline

Short running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI

THERMODYNAMICS. Temperature

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

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity

Derivatives of Value at Risk and Expected Shortfall

Quadratic speedup for unstructured search - Grover s Al-

Advanced Topics in Optimization. Piecewise Linear Approximation of a Nonlinear Function

Lecture Space-Bounded Derandomization

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

Kinematics of Fluids. Lecture 16. (Refer the text book CONTINUUM MECHANICS by GEORGE E. MASE, Schaum s Outlines) 17/02/2017

PATH INTEGRALS FOR QUADRATIC LAGRANGIANS IN TWO AND MORE DIMENSIONS

Gravitation and Spatial Interaction

Bayesian networks for scenario analysis of nuclear waste repositories

AN ASYMMETRIC GENERALIZED FGM COPULA AND ITS PROPERTIES

U.C. Berkeley CS278: Computational Complexity Professor Luca Trevisan 2/21/2008. Notes for Lecture 8

Lecture 3: Probability Distributions

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

7. Products and matrix elements

Pattern Classification

Lab session: numerical simulations of sponateous polarization

Professor Terje Haukaas University of British Columbia, Vancouver The Q4 Element

Randomness and Computation

Topology optimization of plate structures subject to initial excitations for minimum dynamic performance index

Using Genetic Algorithms in System Identification

EXCESS FUNCTIONS MATHEMATICAL EXPLANATION

A Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach

Turbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH

Pattern Classification

Solutions for Tutorial 1

Comparison of Outlier Detection Methods in Crossover Design Bioequivalence Studies

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

Lecture 8: S-modular Games and Power Control

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models

A NOTE ON THE DISCRETE FOURIER RESTRICTION PROBLEM

An Accurate Heave Signal Prediction Using Artificial Neural Network

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

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

Linear Approximation with Regularization and Moving Least Squares

A new algorithm for computing distance matrix and Wiener index of zig-zag polyhex nanotubes

PID Controller Design Based on Second Order Model Approximation by Using Stability Boundary Locus Fitting

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

The Robustness of a Nash Equilibrium Simulation Model

Genericity of Critical Types

Michael Batty. Alan Wilson Plenary Session Entropy, Complexity, & Information in Spatial Analysis

New Kronecker product decompositions and its applications

Logistic regression with one predictor. STK4900/ Lecture 7. Program

Trees and Order Conditions

1.72, Groundwater Hydrology Prof. Charles Harvey Lecture Packet #3: Hydraulic Head and Fluid Potential. p o. p o + p

ECEN 5005 Crystals, Nanocrystals and Device Applications Class 19 Group Theory For Crystals

A family of multivariate distributions with prefixed marginals

Transcription:

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 3 Centro d Rcerca su stem Elettronc er l Ingegnera dell Informazone e delle Telecomuncazon Ercole De Castro (ARCE) Unverstà d Bologna cuola d Dottorato Ingegnera dell Informazone -5 ettembre 3 Unversty of Bologna Unversty of Ferrara

How far wll we clmb? reroducton of networ traffc self-smlar rocesses generalzed tensor aroach countable PWAM

= a > a > a > M [ ] [ ] :,, lm a = x a+ a + ( a a) f x ] a+, a] a a+ M( x) = x a f x ] a, a] a a A Ma, a roblem Good news: X [, ] = s a Marov artton a a Bad news: the roecton of the Perron-Frobenus oerator onto the sace of functons does not yeld a fnte-dmensonal oerator 3

A roblem, a (artal) soluton = [,] ' = '' = = M ( ) M = = = certan certan X X 3 3 3 x ', x'' ϕ( x') = ϕ( x'') 4

The Proect-and-Factor method = < < < m [ ],, m P ρ ξ sequence of observaton nstants ont densty of the vector when ξ s dstrbuted accordng to M m ( ) ξ M ξ ξ ρ roecton Pr = H =,,,,,,, m m m m m m P [ ] ρ ξ dξ,,, m corresondng vsted macro-states 5

The Proect-and-Factor method + = + + a transton between two macro-states Under sutable assumtons ξ{ } =, ( ξx ξ xy x+ ξy) factorzaton m P,, m [ ] ρ ξ dξ = ρ ξ ξ ρ ξ ξ { } µ ( ) [ ] { } { } [ ] { },,, +,, m P d P d,,, m, m Pr + m m m 6 Pr + m Pr m +

Gven the observables only transtons between macro-states matters 7 + = + =,, s Pr +,, P m = m m [ ] ρ ξ dξ = d, {, } [ ] { },, P ρ ξ ξ Pr s,,, P s Pr = µ = + + + + + +, s +,, s m s P µ ( ) Pr m s s+ s s + s m s s s+ m s The Proect-and-Factor method 3 + + [ ] { m} d, {, } s [ ] { } ρ ξ ξ L, d, {, m} ρ ξ ξ s = s + + ( ) ( ) + + M, s m ( ) m s

The Proect-and-Factor method 4 H,,,,, m = m ( ) s L, M m = + +, s m s factors are tme-deendent matrces Probablty of beng n u to t= and then leave at t=, stayng there, L, M Probablty of stayng n for tme stes and then leave, gven that we were n mmedately before Probablty of stayng n for at least tme stes, gven that we were n mmedately before L, ( ) = M, ( ) = 8

M L ( l) =,, l= = µ ( ) L () l l= + = µ + ( ) = µ ( ) ( ) = ( ) M ( ) ( ) M L s enough for a comlete characterzaton Proertes of the factors t = t = () L l L M H 9

Characterstc quanttes Macro-state asymtotc nvarant robabltes µ ( ) = = Observable average [ x ] = E, ϕ ϕ = Average macro-state soourn tme T ( ) µ = µ ( )

H ', '' = l= l l > l + l = ' () l I ' '' ( l ) ( l ) + M l l, l3> l + l + l = 3 ' ' '' ( l ) ( l ) ( l ) + L M l, l, l3, l4> l + l + l + l = 3 4 ' ' '' 3 s = t = t = ' = '' ( l ) ( l ) ( l ) ( l ) + L L M + ' ' 3 '' 4 t = t = l ' What f we do not now s? s = l '' s = t = l t = l l 3 ' '' s = 3 t = l t = l l 3 l 4 ' ''

( l) = l= A B = A l B l = A l B l H = ', '' l= l l> l + l = ' '' ' '' ' '' l l l ' () l I ' '' ( l ) ( l ) + M l l, l3> l + l + l = 3 ' ' '' = + = ( l ) ( l ) ( l ) + L M l, l, l3, l4> l + l + l + l = 3 4 A = I A = I A ' ' '' 3 ( l ) ( l ) ( l ) ( l ) + L L M ' ' 3 '' 4 H = Whac the ndexes! I + I M + I L M + I L L M

A very comact form H = I + I M + I L M I L L M H = I + I L M ( s ) s= Z-transform of a generc matrx deendng on tme + + [ A] A A Z z = z = z = z [ A B] = [ A] [ B] Z z Z z Z z H = I + I L M s ( z) ( z) ( z) ( z) ( z) s= 3 ( z) = ( z) + ( z) ( z) ( z) H I I I L M

M ( ) = + M L( l) l= = Proertes of the factors n the z-doman ( ) = ( ) M L s enough for a comlete characterzaton L M ( ) H ( z) L L M( z) = z M = L () () ( z) z( ) = L ( z) L( ) z 4

Hgher-order ont robabltes H,, m Any number of macro-state transtons must be consdered between any two observaton nstants s =,,, =,,, m 5 uch a combnatoral exloson cannot be tamed but only coed wth by means of a systematc constructon rocedure

A monster-mang rece am and buldng blocs 6 a A (,, ) = ( ) ( z ) + z a z z z (,, ) = ( ) m m = m τ = τ = = H z, z,, z,, z τ H( τ τ ) = = ( z z) = + A ( z ) z z z ( z) = ( z) J I L = = ( z z) = m a can be ether or A can be ether L or M

A monster-mang rece let t wor! 7

An examle wth two macro-states L ( τ ) ( τ ) = ( τ ) ( τ ) = robablty of stayng n exactly τ tme stes a a = l= + () l = l= + () l 8

L ( z) = ( z) ( z) ( z) ( τ ) = τ = z τ + + z ( z) ( z ) U ( z ) = T z + U z α The factors α α ], ] J ( z) = ( z) ( z) ( z) ( z) M ( z) = z ( z) ( z) z z = z z ( z)( T + T ) ( ) 9 z z = z + T z z + T z ( z) ( T + T ) ( ( ) ( ))

The observables E ( ),, [ ϕ x ] = ϕ = ϕ () = lm z = lm z z = T T z ( ) ( ) z T + T z T+ T [ ] E ϕ( x ) = Tϕ + Tϕ = ϕ = ω T ϕ = ω T T + T T + T

Exonentally dstrbuted soourn tmes τ ( τ) ( π ) π = a a a = l= + () l = l= + () l a a + a + a + a a a + = = a a + π + π π π π

Exonentally dstrbuted soourn tmes τ ( τ) ( π ) π = π = π z ( z) C [ x x ] τ = E ϕ ϕ = ϕ ϕ, H τ τ, H ( z) C z = ϕ ϕ = ω ( π )( π ) ( π + π ) z π + π z C ( π )( π ) ( ) ( π + π ) = + τ ω π π τ π π π + π > + π = + π < low-ass whte hgh-ass

nd-order elf-smlarty y () = y y y ( A) A = A l= y A+ l ( 5) y ( A ) ( A) ( A) C τ E y y τ = 3 ( A C ) ( τ ) C C C C ( xa ) ( ) ( A ) ( ) ( A ) ( τ ) ( A ) ( ) τ τ β x β ],[ x > β τ A τ f the Central Lmt Theorem holds for y C C ( xa ) ( ) ( A ) ( ) () ( σ ) xa () ( σ ) A C C ( xa ) ( ) ( A ) ( ) x

Polynomally decayng correlatons A A ( A ) ( A) ( A) C ( τ ) = E y yτ = E y yaτ+ A = = A A C C A ( A ) ( ) = ( ) = = A C = + A A = ( m ) C A C + ( m ) C d A A ( τ) C = Kτ β β ( ) K ( β) + ( β) K + A A ( β)( β) ( β)( β) C A A A β 4 C C ( xa ) ( ) ( A ) ( ) x β

5 A A Polynomally decayng correlatons τ = τ + τ ( A ) C C A A, A = = A A = = A A = + A ( Aτ ) A A A / A/ A ( A β βc ) ( τ ) β A ( τ + ξ η) dξdη τ A K A β β Aτ + dd ξ = η = ( + ) β β τ ξ η dξdη ( ) β ( τ + ξ η) β ( τ + η) ( τ η) = A dξ = A β ( β)( β) ( β)( β) β η= β η= β η= { β } β β τ + τ + ( τ ) C η= η= η= β β β A A τ = β β β β

Polynomal decay and z-transform Tauberan roertes C ( z) = C( τ ) z τ τ = Rate of decay of C(τ) behavour of ts z-transform for z C ( τ) τ β ff C ( z) features an algebrac sngularty n z= wth W ( z ) β β ],[ C z A.M.Odlyzo, asymtotc enumeraton methods n Handboo of Combnatorcs MIT Press 6 H.. Wlf, Generatngfunctonology, Academc Press

Polynomal decay and soourn tmes bac to two-states systems C z = ω ( π )( π ) ( π + π ) z π + π z ngularty only n the degenerate case but t would be a smle ole! π + π = π = π = ystems wth exonentally dstrbuted soourn tmes are not self-smlar 7

( z) T ( z ) U ( z ) α + α ], ] Polynomal decay and soourn tmes bac to two-states systems For exonentally dstrbuted soourn tme General exanson n a neghborhood of z= U α = = () = z ( π ) Ths s what we need ω α α 3 ( ) + ( ) C z T U z T U z ( T + T ) W z ( ) { α α } mn, { α α } mn, ],[ 8

Polynomal decay and soourn tmes bac to two-states systems 3 ( z) T ( z ) U ( z ) α + Hence, ( z) U α ( α )( z) z α α ], [ ( z) z dverges z τ ( z) z τ ( τ ) ( τ) z τ ( τ) τ= τ= must dverge α τ τ α ], [ 9

elf-smlarty/polynomal correlaton decay/oourn tmes α ( τ) τ α ], [ α β β ( ) = τ( ) τ C z W z W z α = β + β ],[ C ( τ) τ β 3 C C C C ( xa ) ( ) ( A ) ( ) ( A ) ( τ ) ( A ) ( ) β x β ],[ x > τ β A τ

A thrd alcaton: modelng/synthess of LAN traffc sgnals wth tunable statstcal features Chaos-based Performance modelng/synthess Otmzaton of networ traffc ON erformance ndex n terms of statstcal features of sgnals OFF 3

Networ traffc s self-smlar At any gven tme ste (slot) a acet may be resent (ON=) or not (OFF=). The ON-OFF rocess s nd-order self-smlar and s characterzed by the Hurst arameters H β = H ] /,[ ON and OFF states may have dfferent Hurs arameters The average of the rocess s called actvty or P ON W.E. Leland, D.V. Wlson, Hgh tme-resoluton measurement and analyss of LAN traffc: mlcaton for LAN nterconnectons, INFOCOM 99 3 K.Par, W. Wllnger, elf-smlar Networ Traffc and Performance Evaluaton, Wley,

ettng both H and P ON self-smlarty τ τ 4 H actvty =ON =OFF P ON T = = T = + T + = = P + P = ON ON = = 33

a b = = A B 4 H 4 H x y = = ( ) ettng both H and P ON = = ON x y mn + = a b s.t. P x + P y = s.t. x = s.t. y = s.t. x, y ON = = 34

An teratve and fnte soluton = = ON x y mn + = a b s.t. P x + P y = s.t. x = s.t. y = ON = = λ ( P ) + λ x ' = a + a λpon + λ3 y' = b + a ON s.t. x, y x' < x = y' < y = a non-trval Lemma 35

Have a loo at the solutons 36