25.01.2015 Views

Download Full Issue in PDF - Academy Publisher

Download Full Issue in PDF - Academy Publisher

Download Full Issue in PDF - Academy Publisher

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

JOURNAL OF COMPUTERS, VOL. 8, NO. 6, JUNE 2013 1481<br />

For nonl<strong>in</strong>ear systems, discretization of the Volterra<br />

model is as follows:<br />

Where,<br />

∞<br />

∑∑<br />

yn ( ) = h( l, , l) xn ( −l) xn ( −l)<br />

(1)<br />

nl , i<br />

i l1<br />

, , li<br />

= 0<br />

i 1 i 1<br />

i<br />

∈ R, yn ( ) is the output of the nonl<strong>in</strong>ear<br />

system; x( n− l i<br />

) is the <strong>in</strong>put of the nonl<strong>in</strong>ear system and<br />

hi( l1, l2, , li)<br />

( i = 1, 2, , n ) is Volterra kernel function<br />

of order i .<br />

A. Model of Chaotic Time Series Prediction<br />

The chaotic time series prediction is based on the<br />

Takens' delay-coord<strong>in</strong>ate phase reconstruct theory. If the<br />

time series of one of the variables is available, based on<br />

the fact that the <strong>in</strong>teraction between the variables is such<br />

that every component conta<strong>in</strong>s <strong>in</strong>formation on the<br />

complex dynamics of the system, a smooth function can<br />

be found to model the portraits of time series. If the<br />

chaotic time series are{ x()<br />

t }, then the reconstruct state<br />

vector is x( t) = ( x( t), x( t+ τ ), , x( t+ ( m−1) τ )) , Where<br />

m ( m = 2,3, ) is called the embedd<strong>in</strong>g dimension<br />

( m = 2d<br />

+ 1, d is called the freedom of dynamics of the<br />

system), and τ is the delay time. The predictive<br />

reconstruct of chaotic series is a <strong>in</strong>verse problem to the<br />

dynamics of the system essentially. There exists a smooth<br />

m<br />

function def<strong>in</strong>ed on the reconstructed manifold <strong>in</strong> R to<br />

<strong>in</strong>terpret the dynamics x( t+ T) = F( x( t))<br />

,<br />

where T ( T > 0)<br />

is forward predictive step length, and<br />

F()<br />

⋅ is the reconstructed predictive model.<br />

B. The Determ<strong>in</strong>ation of the Truncation Order on Traffic<br />

Flow Chaotic Time Series Volterra Model<br />

Assume that the measured traffic flow chaotic time<br />

series is { xt ()( t= 1,2,3, )}, the traffic flow chaotic time<br />

series phase space reconstruction based on Takens<br />

Theorem, you can get the <strong>in</strong>put of the nonl<strong>in</strong>ear system is<br />

xt ( ), xt ( + τ ), xt ( + 2 τ), , xt ( + ( m−1) τ)<br />

, where, m is the<br />

embedd<strong>in</strong>g dimension, namely the reconstruction of<br />

phase space dimension, τ is the delay time. Here, m<br />

corresponds to the number of f<strong>in</strong>ite order <strong>in</strong> the<br />

discretization of the Volterra model, and to predict the<br />

traffic flow is predicted on the basis of the m item, then<br />

the traffic flow chaotic time series phase space<br />

reconstruction model with m-order truncation Volterra<br />

series model can be characterized as follows:<br />

x( t′ + T) = F( X( t)) = h + h ( l ) x( t−lτ<br />

)<br />

∞ ∞ ∞<br />

∑∑<br />

∞<br />

l1= 0l2= 0 lp<br />

= 0<br />

∞<br />

∑∑<br />

∞<br />

∑<br />

0 1 0 0<br />

l0<br />

= 0<br />

+ h ( l , l ) x( t−lτ) x( t− lτ)<br />

+ <br />

2 1 2 1 2<br />

l1= 0l2=<br />

0<br />

∑<br />

+ h ( l, l, , l ) xt ( −lτ ) xt ( −lτ) xt ( −lτ)<br />

m 1 2 m 1 2<br />

m<br />

(2)<br />

where, hm( l1, l2, , lm)<br />

is the m order Volterra kernel<br />

function, t′ = t+ ( m− 1) τ , T ( T > 0 ) is the forward<br />

prediction step. This <strong>in</strong>f<strong>in</strong>ite series, theoretically, can be<br />

very accurately predict<strong>in</strong>g traffic flow chaotic time series,<br />

but difficult to achieve <strong>in</strong> practical applications, it must<br />

be a f<strong>in</strong>ite order truncation and the f<strong>in</strong>ite sum <strong>in</strong> the form.<br />

Your goal is to simulate the usual appearance of papers<br />

<strong>in</strong> a Journal of the <strong>Academy</strong> <strong>Publisher</strong>. We are request<strong>in</strong>g<br />

that you follow these guidel<strong>in</strong>es as closely as possible.<br />

For traffic flow chaotic time series prediction from<br />

equation (2), it is the m-order truncated <strong>in</strong>f<strong>in</strong>ite item<br />

summation form. For example, when m = 3, it is a f<strong>in</strong>ite<br />

sum of the third order <strong>in</strong>tercept Volterra series model:<br />

N1<br />

−1<br />

∑<br />

x( t′ + T) = F( X( t)) = h + h ( l ) x( t−lτ<br />

)<br />

N2−1N2−1<br />

∑∑<br />

l1= 0 l2=<br />

0<br />

0 1 0 0<br />

l0<br />

= 0<br />

+ h ( l , l ) x( t−lτ<br />

) x( t−lτ<br />

)<br />

2 1 2 1 2<br />

N3−1N3−1N3−1<br />

∑∑∑ h2( l1, l2, l3) x( t l1τ ) x( t l2τ) x( t l3τ)<br />

(3)<br />

l1= 0 l2= 0 l3=<br />

0<br />

+ − − −<br />

so, actually want to calculate the total number of<br />

2 2<br />

coefficients is 1+ N1+ N2 + N3<br />

. Be seen with the<br />

<strong>in</strong>crease of m <strong>in</strong> the Volterra series, the number of items<br />

of Volterra Series will power rapid <strong>in</strong>crease; the<br />

correspond<strong>in</strong>g required number of calculations also<br />

showed exponential growth, which makes the actual<br />

traffic flow chaotic time series predicted to achieve more<br />

and more difficult. The total number of items of Volterra<br />

series number decreases exponentially growth. In practice,<br />

the truncation order is generally the second-order<br />

truncation or third order <strong>in</strong>tercept.<br />

C. The Determ<strong>in</strong>ation of the Truncation Items on<br />

Traffic Flow Chaotic Time Series Volterra Model<br />

In the form of the flow chaotic time series Volterra<br />

series model is (2), assume that the truncated form of<br />

limited items are as follows:<br />

N1<br />

−1<br />

∑<br />

x( t′ + T) = F( X( t)) = h + h ( l ) x( t−lτ<br />

)<br />

N2−1N2−1<br />

∑∑<br />

l1= 0 l2=<br />

0<br />

Nm−1Nm−1 Nm−1<br />

∑∑<br />

l1= 0 l2= 0 lp<br />

= 0<br />

0 1 0 0<br />

l0<br />

= 0<br />

+ h ( l , l ) x( t−lτ) x( t− lτ)<br />

+ <br />

∑<br />

2 1 2 1 2<br />

+ h ( l , l , , l ) x( t−lτ ) x( t−lτ) x( t−l<br />

τ)<br />

m 1 2 m 1 2<br />

m<br />

For traffic flow chaotic time series, it is assumed that<br />

x()<br />

t and yt () are the <strong>in</strong>put and output signals of the<br />

functional system f (, txt (′), t′ ≤ t)<br />

<strong>in</strong> the traffic flow, the<br />

<strong>in</strong>put signal of the functional system <strong>in</strong> the traffic flow to<br />

meet:<br />

1 Traffic flow <strong>in</strong>put signal is a causal relationship is<br />

met when t < 0 , then xt () = 0.<br />

2 Traffic flow functional system f (, txt (′), t′ ≤ t)<br />

is<br />

the limited memory, that is, for the t time <strong>in</strong> the system,<br />

(4)<br />

© 2013 ACADEMY PUBLISHER

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!