Forecasting Financial Indices: The Baltic Dry Indices

Size: px
Start display at page:

Download "Forecasting Financial Indices: The Baltic Dry Indices"

Transcription

1 International Journal of Maritie, Trade & Econoic Issues pp Volue I, Issue (1), 2013 Forecasting Financial Indices: The Baltic Dry Indices Eleftherios I. Thalassinos 1, Mike P. Hanias 2, Panayiotis G. Curtis 3, John E. Thalassinos 4 Abstract: The ain ai of this paper is to use chaos ethodology in an attept to predict the Baltic Dry Indices (BDI, BCI, BPI) using the invariant paraeters of the reconstructed strange attractor that governs the syste s evolution. This is the result of the new eerging field in econo-physics which ainly consists of autonoous physic-atheatical odels that have been already applied to financial analysis. The proposed ethodology is estiating the optial delay tie and the iniu ebedding diension with the ethod of False Nearest Neighbors (FNN). Monitoring the trajectories of the corresponding strange attractor we achieved a 30, 60, 90 and 120 tie steps out of saple prediction. Key Words: Chaos ethodology, False Nearest Neighbors, Baltic Dry Indices JEL Classification: C02, C14, C22 1 Corresponding Author: Professor, University of Piraeus. Departent of Maritie Studies, e-ail: thalassi@unipi.gr, thalassinos@ersj.eu. 2 TEI Chalkidas, Athens,Greece, e-ail: hanias@teihal.gr 3 TEI Chalkidas, Athens, Greece, e-ail: pcurtis@teihal.gr 4 PhD University of Piraeus, Piraeus, Greece

2 110 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos 1. Introduction Predicting Baltic Dry Indices is possible applying algoriths used in physical sciences. This article cobines finance and non linear ethods fro chaos theory to exaine the predictability of the Baltic Dry Indices. The proposed ethodology applies non linear tie series analysis for the BCI, BDI and BPI indices covering the period fro until In particular the ethod of the False Nearest Neighbor (FNN) is used in the first step to evaluate the invariant paraeter of the syste as the iniu ebedding diension. In a second stage using the reconstructed state space the article achieves an out of saple ulti step tie series prediction. The ethodology is very dynaic copared to traditional ones (Thalassinos et al., 2009). The ost iportant property of the proposed ethodology is the fact that there is no need to know fro trial to error soe constants to fit and extrapolate the tie series. The ethodology calculates the invariant paraeters of the syste itself. The fact that shipping indices are sensitive in irregular shocks and crises which are innate eleents in chaotic systes, their predictability is uch easier using chaotic ethodology than any other forecasting ethod. Other benefits as they are pointed out in Thalassinos et al., (2009) are: The possibility to extract inforation about a coplex dynaic syste, which generates several observed tie series by using only one of the. To analyze the iage-syste with the sae topology that preserves the ain characteristics of the genuine syste. The article cobines aritie tie series daily data for the period of to (total nuber of observations 2000) with chaos ethodology to exaine the predictability of the three Baltic Dry Indices as the ost characteristic indices in the aritie industry naely the BCI, BDI and BPI. 2. BCI Tie Series According to the theory of observed chaotic data (Abarbanel, 1996; Sprott, 2003; Hanias et al., 2007a, 2007b; Thalassinos et al., 2009) any non-linear tie series can be presented as a set of signals x=x(t) as it shown at Figure 1. The sapling rate is Δt=1 day and the nuber of data N=2000. As it is presented in Figure 1 the corresponding index had a significant nuber of structural shifts in the period under study with a ax of 16,000 and a in of 1,000 points. Fro the tie series plots of the BCI in Figure 1, 1700 data points has been selected as the training data set, in other words the data that are used for the state space reconstruction and the other 300 data points as the test data set for out of saple period prediction.

3 Forecasting Financial Indices: The Baltic Dry Indices 111 Figure 1: Tie Series plots of the BCI BCI State space reconstruction Tie units (days) 3.1 Tie delay τ X r Fro the given data a vector i, i=1, 2, N, where N=1700, in the order diensional phase space given by the following relation (Kantz et al., 1997; Takens, 1981; Hanias et al., 2007a, 2007b; Thalassinos et al., 2009) is constructed as shown in equation (1): X r i = {xi, xi-τ, xi-2τ,., xi+(-1)τ} (1) X r where i represents a point in the diensional phase space in which the attractor is ebedded each tie, where τ is the tie delay τ = iδt. The eleent xi represents a value of the exained scalar tie series in tie, corresponding to the i-th coponent of the tie series. By using this ethod the phase space reconstruction to the proble of proper deterining suitable values of values of and τ is constructed. The next step is to find the tie delay (τ) and the ebedding diension () without using any other inforation apart fro the historical values of the indices. Equation (2) is used to calculate the tie delay by using the tie-delayed utual inforation proposed by Fraser et al., 1986 and Abarbanel, p( xi, xi+ τ ) I( τ ) = p( x ) i, xi+ τ log 2 ( ) ( ) x x p x + τ i p x i, i i+ τ (2) In equation (2), p(xi) is the probability of value xi and p(xi, xi+τ) denotes joint probability. I(τ) shows the inforation (in bits) being extracted fro the value in tie xi about the value in tie xi+ττ. The function I can be thought of as a nonlinear generalization of the autocorrelation function. For a rando process x(t) the I(t), is a

4 I 112 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos easure of the inforation about x(t+τ) contained in x(t). The first nadir of I(τ) gives the delay, tau0, such that x(t+tau0) adds axial inforation to that already known fro x(t). This tau0 is returned as an estiate of the proper tie lag for a delay ebedding of the given tie series. The tie delay is calculated as the first iniu of the utual inforation (Kantz et al., 1997; Fraser et al., 1986; Casdagli et al., 1991). Mutual inforation against the tie delays (with a iniu at 54 tie steps) for our tie series is presented in Figure 2. Figure 2: Mutual inforation I vs. tie delay τ Ebedding diension After obtaining the satisfactory value of τ, the ebedding diension is to be deterined in order to finish the phase space reconstruction. For this purpose the ethod of False Nearest Neighbors (Kantz et al., 1997 Kennel et al., 1992) is used. More specifically, the ethod is based on a fact that when ebedding diension is too low, the trajectory in the phase space will cross itself. If we are able to detect these crossings, we ay decide whether the used is large enough for correct reconstruction of the original phase space, when no intersections occur or not. When intersections are present for a given, the ebedding diension is too low and we have to increase it at least by one. Then, we test the eventual presence of selfcrossings again (Kennel et al., 1992; Abarbanel 1996). The practical realization of the described ethod is based on testing of the neighboring points in the - diensional phase space. Typically, we take a certain aount of points in the phase space and find the nearest neighbor to each of the. Then we copute distances for all these pairs and also their distances in the (+1) diensional phase space. The rate of these distances is given by equation (3) as follows: y i ( + 1) y n( i) ( + 1) P = y i ( ) y n( i) ( ) (3) where yi() represents the reconstructed vector, belonging to the i-th point in the - diensional phase space and index the n(i) denotes the nearest neighbour to the i-th point. If P is greater than soe value Pax, we call this pair of points False Nearest Neighbors (i.e. neighbors, which arise fro trajectory self-intersection and not fro τ

5 Forecasting Financial Indices: The Baltic Dry Indices 113 the closeness in the original phase space). In the ideal case, when the nuber of false neighbors falls to zero, then the value of is found. For this purpose we copute the rate of false nearest neighbours in the reconstructed phase space using the forula in equation (4): xi+ τ xn( i) + τ RA (4) where RA is the radius of the attractor, N 1 R A = x i x ( 5 ) N i = 1 and N 1 x = xi N i= 1 (6) is the average value of tie series. P P When the following criterion ax, (7) is satisfied then it can be used to distinguish between true and false neighbours (Kennel et al., 1992). The diension is found when the percent of false nearest neighbors decreases below soe liit, (Kugiutzis et al., 1994), so we choose Pax=10 as used typically. Before we apply the above procedure, we ust deterine the Theiler window for out tie series and exclude all pairs of points in the original series which are teporally correlated and are closer than this value of Theiler window. For this purpose we produce space tie separation plots (Kantz et al., 1997) as shown in Figure 3(a). Figure 3: Space tie separation plot Spatial Separation p = 1 p = 0.8 p = 0.6 p = 0.4 p = 0.2 Density Median Spatial Separation Median Spatial Separation olag = 53 to Orbital Lag Orbital Lag (a) (b) (a) Density function estiate of the edian contour (upper graph) in addition to a suggested range of suitable orbital lags. (b) The ost populous values of the edian contour are highlighted by a cross-hatched area that covers a plot of the edian curve (lower).

6 114 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos The space tie separation plots where produced with a desired ebedding diension 5, τ=54, and the probability associated with the first contour equal to 0.2 In Figure 3 we had plot a suary of the space-tie contours including a density function estiate of the edian contour in addition to a suggested range of suitable orbital lags. In the latter case, the ost populous values of the edian contour are highlighted by a cross-hatched area that covers a plot of the edian curve. The suggested range for a suitable orbital lag is based on the range of values that first escape this cross-hatched region, so we can choose a Theiler window fro 53 to 117. In our case we choose the Theiler window to be 65. Then we used atlab code to calculate the quantity P. The rate of false neighbors that is under the above liit Pax=10 is achieved for = 4, thus this value should be suitable for the purpose of phase space reconstruction. This is shown in Figure 4 for our tie series. Figure 4: Percent of False Nearest Neighbors nuber vs FNN% Tie Series Prediction of BCI The next step is to predict the evolution of BCI by coputing weighted average of evolution of close neighbors of the predicted state in the reconstructed phase space (Miksovsky et al., 2007; Sta et al., 1998). The reconstructed -diensional signal projected into the state space can exhibit a range of trajectories, soe of which have structures or patterns that can be used for syste prediction and odeling. Essentially, in order to predict k steps into the future fro the last -diensional vector point } N }, we have to find all the nearest neighbors NN in the B ( ε-neighborhood of this point. To be ore specific, let s set ε xn ) to be the set of points within ε of } N B ( ) (i.e. the ε-ball). Thus any point in ε xn is closer to

7 Forecasting Financial Indices: The Baltic Dry Indices 115 the } N than ε. All these points NN } coe fro the previous trajectories of the syste and hence we can follow their evolution k-steps into the future NN + k}. The final prediction for the point } N is obtained by averaging over all neighbors projections k-steps into the future. The algorith can be written as in equation (8) as follows: 1 N + k } = x NN + k B ( x ) NN X NN B ( xnn ) (8) B ( x NN ) where denotes the nuber of nearest neighbors in the neighborhood of the point } N ( Kantz et al., 1997). As an exaple we suppose that we want tο predict k=2 steps ahead. The basic principle of the prediction odel is visualized in Figure 5. The blue dot N} represents the last known saple, fro which we want to predict one and two steps into the future. The blue circles represent ε- neighborhoods in which three nearest neighbors were found. Figure 5: Basic prediction principle of the siple deterinistic odel } N N + 2 } N 2 } 1} N N } { } 1 x N + The next step in the algorith is to check that the projections, one and two steps into the past, of the points in NN } are also nearest neighbors of the two previous

8 116 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos { readings } xn 1 and N 2} respectively. This criterion excludes unrelated trajectories that enter and leave the ε-neighborhood of N} but do not track back to ε- neighborhoods of } N 1 and N 2}, thus aking the unsuitable for prediction. Assuing that any nearest neighbors have been found and checked using the criterion detailed previously, we project their trajectories into the future and average the to get results for } N + 1 and N + 2}. We used the values of τ and fro our previous analysis so the appropriate tie delay τ was chosen to be τ=54. We use as ebedding diension the 2* = 8 (Sprott J. C) and for the optiu nuber of nearest neighbors we used the value of ebedding diension = 4. These values of ebedding diension and nuber of nearest neighbors gave the better results for k=30 tie steps ahead. We apply the procedure for in saple forecasting until data point 1700 as shown at Figure 6 then we applied the procedure for out of saple prediction fro data point 1700 to data point 1730 as shown in Figure 7. Figure 6: and in saple predicted tie series for k=30 days ahead Predicted k=30 days ahead 6000 BCI Tie steps (days)

9 Forecasting Financial Indices: The Baltic Dry Indices 117 Figure7: and out of saple predicted tie series for k=30 days ahead Predicted k=30 days ahead BCI Tie steps (days) and predicted tie series for k=60, 90, 120 tie steps ahead are presented in Figures 8, 9, 10 respectively for out of saple period. Figure 8: and out of saple predicted tie series for k=60 days ahead Predicted k=60 days ahead BCI Tie steps (days)

10 118 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Figure 9: and out of saple predicted tie series for k=90 tie steps ahead Predicted k=90 days ahead BCI Tie steps (days) Figure 10: and out of saple predicted tie series for k=120 tie steps ahead BCI Predicted k=120 days ahead Tie Index (days)

11 Forecasting Financial Indices: The Baltic Dry Indices 119 The prediction error for establishing the quality of the fit was chosen to be the classical root ean square error (RMSE) and found to be 8.99x10-2, 9.54x10-2, 2.17x10-1, 2.26x10-1 for k=30, 60, 90, 120 respectively. 5. Tie Series Prediction of BDI The BDI tie series is presented as a signal x=x(t) as it shown in Figure 11. It covers data fro to The sapling rate was Δt=1 day and the nuber of data are N=2000. Figure 11: BDI Tie Series BDI Tie units (days) Fro this tie series we have choose 1700 data as the training data set, in other words the data that we used for the state space reconstruction and the other 300 data as the test data set for our out of saple prediction. We used the sae procedure as before and we had estiated the delay tie, Theiler window and ebedding diension. Mutual inforation against the tie delays (with a iniu at 55 tie steps) for BDI tie series is presented in Figure 12.

12 I 120 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Figure 12: Mutual inforation I vs. tie delay τ The space tie separation plot and the density function estiation plots are shown in Figure 13. Fro this plot we estiate the Theiler window to be 100. Figure 13: Space tie separation plot τ Spatial Separation p = 1 p = 0.8 p = 0.6 p = 0.4 p = 0.2 Density Median Spatial Separation Median Spatial Separation olag = 48 to Orbital Lag Orbital Lag (a) (b) (a) Density function estiate of the edian contour (upper graph) in addition to a suggested range of suitable orbital lags. (b) The ost populous values of the edian contour are highlighted by a cross-hatched area that covers a plot of the edian curve (lower). The percent of false nearest neighbors nuber FNN vs. is shown in Figure 14. Fro this it is clear that the ebedding diension is 4.

13 Forecasting Financial Indices: The Baltic Dry Indices 121 Figure 14: Percent of false nearest neighbors nuber FNN vs FNN% The next step is to predict 30, 60, 90 and 120 tie steps ahead. Figures 15, 16, 17, 18 and 19 are shown the in saple and out of saple period predictions. Figure 15: and in saple predicted tie series for k=30 days ahead Predicted k=30 days ahead 8000 BDI Tie units (days)

14 122 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Figure 16: and out of saple predicted tie series for k=30 days ahead Predicted k=30 days ahead BDI Tie units (days) Figure 17: and out of saple predicted tie series for k=60 days ahead Predicted k=60 days ahead BDI Tie units (days)

15 Forecasting Financial Indices: The Baltic Dry Indices 123 Figure 18: and out of saple predicted tie series for k=90 tie steps ahead Predicted k=90 days ahead BDI Tie units (days) Figure 19: and out of saple predicted tie series for k=120 tie steps ahead Predicted k=120 days ahead BDI Tie units(days) The prediction error for establishing the quality of the fit was chosen to be the classical root ean square error (RMSE) and found to be 5.68x10-2, 5.99x10-2, 6.53x10-2, 6.80x10-2 for k=30, 60, 90 and 120 respectively.

16 124 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos 5. Tie Series Prediction of BPI The BPI tie series is presented as a signal x=x(t) as it shown in Figure 20. It covers data fro to The sapling rate was Δt=1 day and the nuber of data are N=2000. Figure 20: BPI tie series BPI Tie units (days) Fro this tie series we have choose 1700 data as the training data set, in other words the data that we used for the state space reconstruction and the other 300 data as the test data set for our out of saple prediction. We used the sae procedure as before and we have estiated the delay tie, Theiler window and ebedding diension. Mutual inforation against the tie delays (with a iniu at 55 tie steps) for BDI tie series is presented in Figure 21.

17 I Forecasting Financial Indices: The Baltic Dry Indices 125 Figure 21: Mutual inforation I vs. tie delay τ The space tie separation plot and density function estiation plots are shown in Figure 22. Fro this plot we estiate the Theiler window to be 100. Figure 22: Space tie separation plot τ Spatial Separation p = 1 p = 0.8 p = 0.6 p = 0.4 p = 0.2 Density Median Spatial Separation Median Spatial Separation olag = 59 to Orbital Lag Orbital Lag (a) (b) (a) Density function estiate of the edian contour (upper graph) in addition to a suggested range of suitable orbital lags. (b) The ost populous values of the edian contour are highlighted by a cross-hatched area that covers a plot of the edian curve (lower). The percent of false nearest neighbors nuber FNN vs. is shown in Figure 23. Fro this fig it s clear that the ebedding diension is 4.

18 126 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Figure 23: Percent of false nearest neighbors nuber FNN vs FNN% The next step is to predict 30, 60, 90 and 120 tie steps ahead. Figures 24, 25, 26, 27 and 28 are shown the in saple and out of saple period predictions. Figure 24: and in saple predicted tie series for k=30 days ahead Predicted k=30 days ahead 6000 BPI Tie units (days)

19 Forecasting Financial Indices: The Baltic Dry Indices 127 Figure 25: and out of saple predicted tie series for k=30 days ahead Predicted k=30 days ahead BPI Tie units (days) Figure 26: and out of saple predicted tie series for k=60 days ahead Predicted k=60 days ahead BPI Tie units (days)

20 128 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Figure 27: and out of saple predicted tie series for k=90 days ahead Predicted k=90 days ahead BPI Tie units (days) Figure 28: and out of saple predicted tie series for k=120 days ahead. BPI Predicted k=120 days ahead Tie units (days)

21 Forecasting Financial Indices: The Baltic Dry Indices 129 The prediction error for establishing the quality of the fit was chosen to be the classical root ean square error (RMSE) and found to be 7.10x10-2, 7.56x10-2, 1.24x10-1, 2.36x10-1 for k=30, 60, 90 and 120 respectively. 6. Conclusion In this paper chaotic analysis has been used to predict Baltic Dry Indices tie series. After estiating the iniu ebedding diension, the proposed ethodology has pointed out that the syste is characterized as a high diension chaotic. Fro reconstruction of the systes strange attractors, it has been achieved a 30, 60, 90 and 120 out of saple tie steps prediction. In Table 1 the RMS values of the corresponding prediction are shown. Table 1: RMS values RMS 30 DAYS 60 DAYS 90 DAYS 120 DAYS BDI 5.68x x x x10-2 BCI 8.99x x x x10-1 BPI 7.10x x x x10-1 It is clear that the BDI has the iniu error and gives the best prediction copared to the other two indices. The prediction power of the suggested ethod is liited by the properties of the original syste and the series alone. Because the series represents the only source of inforation for the syste it is iportant to be as long as possible. Too short tie series will not worsen the prediction only but it ay also ake the proper reconstruction of the phase space ipossible. Another iportant liitation factor is the eventual containation by noise evidently, the ore noise is included in the series, the less accurate result can be gained. However the prediction horizon of 120 days would be useful for econoical analysis as it can reveal the trend in a very good anner. References Abarbanel, H.D.I. (1996), Analysis of Observed Chaotic Data, Springer, New York. Casdagli, M., Eubank, S., Farer, J.D. and Gibson, J. (1991), State Space Reconstruction in the Presence of Noise, Physica D, 51, pp Fraser, A.M., Swinney, H.L. (1986), Independent coordinates for strange attractors fro utual inforation, Physics Review A, pp. 33, Hanias, M.P., Curtis, G.P. and Thalassinos, E.J. (2007), Non-Linear Dynaics and Chaos: The Case of the Price Indicator at the Athens Stock Exchange, International Research Journal of Finance and Econoics, Issue 11, pp Hanias, M.P., Curtis, G.P. and Thalassinos, E.J. (2007), Prediction with Neural Networks: The Athens Stock Exchange Price Indicator, European Journal of Econoics, Finance And Adinistrative Sciences, Issue 9.

22 130 International Journal of Maritie, Trade & Econoic Issues, I (1) 2013 Eleftherios Thalassinos Mike Hanias Panayiotis Curtis John Thalassinos Hanias, M.P., Karras, A.D. (2007), Efficient Non Linear Tie Series Prediction Using Non Linear Signal Analysis and Neural Networks in Chaotic Diode Resonator Circuits, Springer Berlin/Heidelberg, Lecture Notes in Coputer Science, Advances in Data Mining. Theoretical Aspects and Applications, Vol. 4597, pp Kantz, H., Schreiber, T. (1997), Nonlinear Tie Series Analysis, Cabridge University Press, Cabridge. Kennel, M.B., Brown, R., Abarbanel, H.D.I. (1992). Deterining ebedding diension for phase-space reconstruction using a geoetrical construction, Physics Review A, 45, Kugiutzis, D., Lillekjendlie, B., Christophersen, N. (1994) Chaotic Tie Series, Modelling Identification and Control, 15, 205. Miksovsky, J., Raidl, A. (2007), On Soe Nonlinear Methods of Meteorological Tie Series Analysis, Proceedings of WDS Conference. Sta, C.J., Pijn, J.P.N., Pritchard, W.S. (1998), Reliable Detection of Nonlinearity in Experiental Tie Series with Strong Periodic Coponent, Physica D, Vol Sprott, J.C. (2003), Chaos and Tie series Analysis, Oxford University Press. Takens, F. (1981), Detecting Strange Attractors in Turbulence, Lecture notes in Matheatics, Vol. 898, Springer, New York. Thalassinos, I.E., Hanias M.P., Curtis, G.P., and Thalassinos, E.J. (2009), Chaos Theory: Forecasting the Freight Rate of an Oil Tanker, International Journal of Coputational Econoics and Econoetrics, Vol. X, Issue 1.

Application of Physics Model in prediction of the Hellas Euro election results

Application of Physics Model in prediction of the Hellas Euro election results Journal of Engineering Science and Technology Review 2 (1) (2009) 104-111 Research Article JOURNAL OF Engineering Science and Technology Review www.jestr.org Application of Physics Model in prediction

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Estimation of ADC Nonlinearities from the Measurement in Input Voltage Intervals

Estimation of ADC Nonlinearities from the Measurement in Input Voltage Intervals Estiation of ADC Nonlinearities fro the Measureent in Input Voltage Intervals M. Godla, L. Michaeli, 3 J. Šaliga, 4 R. Palenčár,,3 Deptartent of Electronics and Multiedia Counications, FEI TU of Košice,

More information

Mathematical Models to Determine Stable Behavior of Complex Systems

Mathematical Models to Determine Stable Behavior of Complex Systems Journal of Physics: Conference Series PAPER OPEN ACCESS Matheatical Models to Deterine Stable Behavior of Coplex Systes To cite this article: V I Suin et al 08 J. Phys.: Conf. Ser. 05 0336 View the article

More information

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x)

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x) 7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

Qualitative Modelling of Time Series Using Self-Organizing Maps: Application to Animal Science

Qualitative Modelling of Time Series Using Self-Organizing Maps: Application to Animal Science Proceedings of the 6th WSEAS International Conference on Applied Coputer Science, Tenerife, Canary Islands, Spain, Deceber 16-18, 2006 183 Qualitative Modelling of Tie Series Using Self-Organizing Maps:

More information

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

ma x = -bv x + F rod.

ma x = -bv x + F rod. Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

Pattern Recognition and Machine Learning. Artificial Neural networks

Pattern Recognition and Machine Learning. Artificial Neural networks Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial

More information

Bayes Decision Rule and Naïve Bayes Classifier

Bayes Decision Rule and Naïve Bayes Classifier Bayes Decision Rule and Naïve Bayes Classifier Le Song Machine Learning I CSE 6740, Fall 2013 Gaussian Mixture odel A density odel p(x) ay be ulti-odal: odel it as a ixture of uni-odal distributions (e.g.

More information

Intelligent Systems: Reasoning and Recognition. Artificial Neural Networks

Intelligent Systems: Reasoning and Recognition. Artificial Neural Networks Intelligent Systes: Reasoning and Recognition Jaes L. Crowley MOSIG M1 Winter Seester 2018 Lesson 7 1 March 2018 Outline Artificial Neural Networks Notation...2 Introduction...3 Key Equations... 3 Artificial

More information

Pattern Recognition and Machine Learning. Artificial Neural networks

Pattern Recognition and Machine Learning. Artificial Neural networks Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016/2017 Lessons 9 11 Jan 2017 Outline Artificial Neural networks Notation...2 Convolutional Neural Networks...3

More information

Multiscale Entropy Analysis: A New Method to Detect Determinism in a Time. Series. A. Sarkar and P. Barat. Variable Energy Cyclotron Centre

Multiscale Entropy Analysis: A New Method to Detect Determinism in a Time. Series. A. Sarkar and P. Barat. Variable Energy Cyclotron Centre Multiscale Entropy Analysis: A New Method to Detect Deterinis in a Tie Series A. Sarkar and P. Barat Variable Energy Cyclotron Centre /AF Bidhan Nagar, Kolkata 700064, India PACS nubers: 05.45.Tp, 89.75.-k,

More information

Predicting FTSE 100 Close Price Using Hybrid Model

Predicting FTSE 100 Close Price Using Hybrid Model SAI Intelligent Systes Conference 2015 Noveber 10-11, 2015 London, UK Predicting FTSE 100 Close Price Using Hybrid Model Bashar Al-hnaity, Departent of Electronic and Coputer Engineering, Brunel University

More information

Kinematics and dynamics, a computational approach

Kinematics and dynamics, a computational approach Kineatics and dynaics, a coputational approach We begin the discussion of nuerical approaches to echanics with the definition for the velocity r r ( t t) r ( t) v( t) li li or r( t t) r( t) v( t) t for

More information

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna

More information

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

Optimum Value of Poverty Measure Using Inverse Optimization Programming Problem

Optimum Value of Poverty Measure Using Inverse Optimization Programming Problem International Journal of Conteporary Matheatical Sciences Vol. 14, 2019, no. 1, 31-42 HIKARI Ltd, www.-hikari.co https://doi.org/10.12988/ijcs.2019.914 Optiu Value of Poverty Measure Using Inverse Optiization

More information

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Journal of Marine Science and Technology, Vol 19, No 5, pp 509-513 (2011) 509 LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Ming-Tao Chou* Key words: fuzzy tie series, fuzzy forecasting,

More information

Machine Learning Basics: Estimators, Bias and Variance

Machine Learning Basics: Estimators, Bias and Variance Machine Learning Basics: Estiators, Bias and Variance Sargur N. srihari@cedar.buffalo.edu This is part of lecture slides on Deep Learning: http://www.cedar.buffalo.edu/~srihari/cse676 1 Topics in Basics

More information

Multi-Scale/Multi-Resolution: Wavelet Transform

Multi-Scale/Multi-Resolution: Wavelet Transform Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

More information

Phase-Space Reconstruction. Gerrit Ansmann

Phase-Space Reconstruction. Gerrit Ansmann Phase-Space Reconstruction Gerrit Ansmann Reprise: The Need for Non-Linear Methods. Lorenz oscillator x = 1(y x), y = x(28 z) y, z = xy 8z 3 Autoregressive process measured with non-linearity: y t =.8y

More information

Department of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China

Department of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China 6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith

More information

OPTIMIZATION OF SPECIFIC FACTORS TO PRODUCE SPECIAL ALLOYS

OPTIMIZATION OF SPECIFIC FACTORS TO PRODUCE SPECIAL ALLOYS 5 th International Conference Coputational Mechanics and Virtual Engineering COMEC 2013 24-25 October 2013, Braşov, Roania OPTIMIZATION OF SPECIFIC FACTORS TO PRODUCE SPECIAL ALLOYS I. Milosan 1 1 Transilvania

More information

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

Figure 1: Equivalent electric (RC) circuit of a neurons membrane

Figure 1: Equivalent electric (RC) circuit of a neurons membrane Exercise: Leaky integrate and fire odel of neural spike generation This exercise investigates a siplified odel of how neurons spike in response to current inputs, one of the ost fundaental properties of

More information

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. IX Uncertainty Models For Robustness Analysis - A. Garulli, A. Tesi and A. Vicino

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. IX Uncertainty Models For Robustness Analysis - A. Garulli, A. Tesi and A. Vicino UNCERTAINTY MODELS FOR ROBUSTNESS ANALYSIS A. Garulli Dipartiento di Ingegneria dell Inforazione, Università di Siena, Italy A. Tesi Dipartiento di Sistei e Inforatica, Università di Firenze, Italy A.

More information

Tracking using CONDENSATION: Conditional Density Propagation

Tracking using CONDENSATION: Conditional Density Propagation Tracking using CONDENSATION: Conditional Density Propagation Goal Model-based visual tracking in dense clutter at near video frae rates M. Isard and A. Blake, CONDENSATION Conditional density propagation

More information

An Inverse Interpolation Method Utilizing In-Flight Strain Measurements for Determining Loads and Structural Response of Aerospace Vehicles

An Inverse Interpolation Method Utilizing In-Flight Strain Measurements for Determining Loads and Structural Response of Aerospace Vehicles An Inverse Interpolation Method Utilizing In-Flight Strain Measureents for Deterining Loads and Structural Response of Aerospace Vehicles S. Shkarayev and R. Krashantisa University of Arizona, Tucson,

More information

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,

More information

Analyzing Simulation Results

Analyzing Simulation Results Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient

More information

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words) 1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu

More information

Understanding Machine Learning Solution Manual

Understanding Machine Learning Solution Manual Understanding Machine Learning Solution Manual Written by Alon Gonen Edited by Dana Rubinstein Noveber 17, 2014 2 Gentle Start 1. Given S = ((x i, y i )), define the ultivariate polynoial p S (x) = i []:y

More information

REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION

REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION ISSN 139 14X INFORMATION TECHNOLOGY AND CONTROL, 008, Vol.37, No.3 REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION Riantas Barauskas, Vidantas Riavičius Departent of Syste Analysis, Kaunas

More information

Topic 5a Introduction to Curve Fitting & Linear Regression

Topic 5a Introduction to Curve Fitting & Linear Regression /7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline

More information

The Transactional Nature of Quantum Information

The Transactional Nature of Quantum Information The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.

More information

Warning System of Dangerous Chemical Gas in Factory Based on Wireless Sensor Network

Warning System of Dangerous Chemical Gas in Factory Based on Wireless Sensor Network 565 A publication of CHEMICAL ENGINEERING TRANSACTIONS VOL. 59, 07 Guest Editors: Zhuo Yang, Junie Ba, Jing Pan Copyright 07, AIDIC Servizi S.r.l. ISBN 978-88-95608-49-5; ISSN 83-96 The Italian Association

More information

Bootstrapping Dependent Data

Bootstrapping Dependent Data Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly

More information

Deflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007

Deflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007 Deflation of the I-O Series 1959-2. Soe Technical Aspects Giorgio Rapa University of Genoa g.rapa@unige.it April 27 1. Introduction The nuber of sectors is 42 for the period 1965-2 and 38 for the initial

More information

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period An Approxiate Model for the Theoretical Prediction of the Velocity... 77 Central European Journal of Energetic Materials, 205, 2(), 77-88 ISSN 2353-843 An Approxiate Model for the Theoretical Prediction

More information

OBJECTIVES INTRODUCTION

OBJECTIVES INTRODUCTION M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and

More information

SPECTRUM sensing is a core concept of cognitive radio

SPECTRUM sensing is a core concept of cognitive radio World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile

More information

INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN

INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN V.A. Koarov 1, S.A. Piyavskiy 2 1 Saara National Research University, Saara, Russia 2 Saara State Architectural University, Saara, Russia Abstract. This article

More information

1 Proof of learning bounds

1 Proof of learning bounds COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a

More information

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation

More information

Ufuk Demirci* and Feza Kerestecioglu**

Ufuk Demirci* and Feza Kerestecioglu** 1 INDIRECT ADAPTIVE CONTROL OF MISSILES Ufuk Deirci* and Feza Kerestecioglu** *Turkish Navy Guided Missile Test Station, Beykoz, Istanbul, TURKEY **Departent of Electrical and Electronics Engineering,

More information

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

More information

Optimal nonlinear Bayesian experimental design: an application to amplitude versus offset experiments

Optimal nonlinear Bayesian experimental design: an application to amplitude versus offset experiments Geophys. J. Int. (23) 155, 411 421 Optial nonlinear Bayesian experiental design: an application to aplitude versus offset experients Jojanneke van den Berg, 1, Andrew Curtis 2,3 and Jeannot Trapert 1 1

More information

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co

More information

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points

More information

GREY FORECASTING AND NEURAL NETWORK MODEL OF SPORT PERFORMANCE

GREY FORECASTING AND NEURAL NETWORK MODEL OF SPORT PERFORMANCE Journal of heoretical and Applied Inforation echnology 3 st March 03 Vol 49 No3 005-03 JAI & LLS All rights reserved ISSN: 99-8645 wwwatitorg E-ISSN: 87-395 GREY FORECASING AND NEURAL NEWORK MODEL OF SPOR

More information

Spine Fin Efficiency A Three Sided Pyramidal Fin of Equilateral Triangular Cross-Sectional Area

Spine Fin Efficiency A Three Sided Pyramidal Fin of Equilateral Triangular Cross-Sectional Area Proceedings of the 006 WSEAS/IASME International Conference on Heat and Mass Transfer, Miai, Florida, USA, January 18-0, 006 (pp13-18) Spine Fin Efficiency A Three Sided Pyraidal Fin of Equilateral Triangular

More information

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t. CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

More information

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL

More information

In this chapter, we consider several graph-theoretic and probabilistic models

In this chapter, we consider several graph-theoretic and probabilistic models THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions

More information

The Algorithms Optimization of Artificial Neural Network Based on Particle Swarm

The Algorithms Optimization of Artificial Neural Network Based on Particle Swarm Send Orders for Reprints to reprints@benthascience.ae The Open Cybernetics & Systeics Journal, 04, 8, 59-54 59 Open Access The Algoriths Optiization of Artificial Neural Network Based on Particle Swar

More information

Comparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations

Comparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations International Journal of Applied Science and Technology Vol. 7, No. 3, Septeber 217 Coparison of Stability of Selected Nuerical Methods for Solving Stiff Sei- Linear Differential Equations Kwaku Darkwah

More information

Recursive Algebraic Frisch Scheme: a Particle-Based Approach

Recursive Algebraic Frisch Scheme: a Particle-Based Approach Recursive Algebraic Frisch Schee: a Particle-Based Approach Stefano Massaroli Renato Myagusuku Federico Califano Claudio Melchiorri Atsushi Yaashita Hajie Asaa Departent of Precision Engineering, The University

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

A LOSS FUNCTION APPROACH TO GROUP PREFERENCE AGGREGATION IN THE AHP

A LOSS FUNCTION APPROACH TO GROUP PREFERENCE AGGREGATION IN THE AHP ISAHP 003, Bali, Indonesia, August 7-9, 003 A OSS FUNCTION APPROACH TO GROUP PREFERENCE AGGREGATION IN THE AHP Keun-Tae Cho and Yong-Gon Cho School of Systes Engineering Manageent, Sungkyunkwan University

More information

Research in Area of Longevity of Sylphon Scraies

Research in Area of Longevity of Sylphon Scraies IOP Conference Series: Earth and Environental Science PAPER OPEN ACCESS Research in Area of Longevity of Sylphon Scraies To cite this article: Natalia Y Golovina and Svetlana Y Krivosheeva 2018 IOP Conf.

More information

Nonlinear Prediction for Top and Bottom Values of Time Series

Nonlinear Prediction for Top and Bottom Values of Time Series Vol. 2 No. 1 123 132 (Feb. 2009) 1 1 Nonlinear Prediction for Top and Bottom Values of Time Series Tomoya Suzuki 1 and Masaki Ota 1 To predict time-series data depending on temporal trends, as stock price

More information

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with

More information

When Short Runs Beat Long Runs

When Short Runs Beat Long Runs When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long

More information

MATHEMATICAL MODEL OF THE ENERGETIC CONSUMPTION FOR SOIL DIGGING MACHINES IN GREENHOUSES

MATHEMATICAL MODEL OF THE ENERGETIC CONSUMPTION FOR SOIL DIGGING MACHINES IN GREENHOUSES Bulletin of the Transilvania University of Braşov Vol. 3 (5) - 00 Series II: Forestry Wood Industry Agricultural Food Engineering MATHEMATICAL MODEL OF THE ENERGETIC CONSUMPTION FOR SOIL DIGGING MACHINES

More information

ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER

ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER IEPC 003-0034 ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER A. Bober, M. Guelan Asher Space Research Institute, Technion-Israel Institute of Technology, 3000 Haifa, Israel

More information

C na (1) a=l. c = CO + Clm + CZ TWO-STAGE SAMPLE DESIGN WITH SMALL CLUSTERS. 1. Introduction

C na (1) a=l. c = CO + Clm + CZ TWO-STAGE SAMPLE DESIGN WITH SMALL CLUSTERS. 1. Introduction TWO-STGE SMPLE DESIGN WITH SMLL CLUSTERS Robert G. Clark and David G. Steel School of Matheatics and pplied Statistics, University of Wollongong, NSW 5 ustralia. (robert.clark@abs.gov.au) Key Words: saple

More information

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry About the definition of paraeters and regies of active two-port networks with variable loads on the basis of projective geoetry PENN ALEXANDR nstitute of Electronic Engineering and Nanotechnologies "D

More information

ZISC Neural Network Base Indicator for Classification Complexity Estimation

ZISC Neural Network Base Indicator for Classification Complexity Estimation ZISC Neural Network Base Indicator for Classification Coplexity Estiation Ivan Budnyk, Abdennasser Сhebira and Kurosh Madani Iages, Signals and Intelligent Systes Laboratory (LISSI / EA 3956) PARIS XII

More information

Hybrid System Identification: An SDP Approach

Hybrid System Identification: An SDP Approach 49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The

More information

Pattern Classification using Simplified Neural Networks with Pruning Algorithm

Pattern Classification using Simplified Neural Networks with Pruning Algorithm Pattern Classification using Siplified Neural Networks with Pruning Algorith S. M. Karuzzaan 1 Ahed Ryadh Hasan 2 Abstract: In recent years, any neural network odels have been proposed for pattern classification,

More information

Detection and Estimation Theory

Detection and Estimation Theory ESE 54 Detection and Estiation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electronic Systes and Signals Research Laboratory Electrical and Systes Engineering Washington University 11 Urbauer

More information

Ensemble Based on Data Envelopment Analysis

Ensemble Based on Data Envelopment Analysis Enseble Based on Data Envelopent Analysis So Young Sohn & Hong Choi Departent of Coputer Science & Industrial Systes Engineering, Yonsei University, Seoul, Korea Tel) 82-2-223-404, Fax) 82-2- 364-7807

More information

Tactics Box 2.1 Interpreting Position-versus-Time Graphs

Tactics Box 2.1 Interpreting Position-versus-Time Graphs 1D kineatic Retake Assignent Due: 4:32p on Friday, October 31, 2014 You will receive no credit for ites you coplete after the assignent is due. Grading Policy Tactics Box 2.1 Interpreting Position-versus-Tie

More information

An Improved Particle Filter with Applications in Ballistic Target Tracking

An Improved Particle Filter with Applications in Ballistic Target Tracking Sensors & ransducers Vol. 72 Issue 6 June 204 pp. 96-20 Sensors & ransducers 204 by IFSA Publishing S. L. http://www.sensorsportal.co An Iproved Particle Filter with Applications in Ballistic arget racing

More information

Optimization of Flywheel Weight using Genetic Algorithm

Optimization of Flywheel Weight using Genetic Algorithm IN: 78 7798 International Journal o cience, Engineering and Technology esearch (IJET) Volue, Issue, March 0 Optiization o Flywheel Weight using Genetic Algorith A. G. Appala Naidu*, B. T.N. Charyulu, C..C.V.aanaurthy

More information

DISSIMILARITY MEASURES FOR ICA-BASED SOURCE NUMBER ESTIMATION. Seungchul Lee 2 2. University of Michigan. Ann Arbor, MI, USA.

DISSIMILARITY MEASURES FOR ICA-BASED SOURCE NUMBER ESTIMATION. Seungchul Lee 2 2. University of Michigan. Ann Arbor, MI, USA. Proceedings of the ASME International Manufacturing Science and Engineering Conference MSEC June -8,, Notre Dae, Indiana, USA MSEC-7 DISSIMILARIY MEASURES FOR ICA-BASED SOURCE NUMBER ESIMAION Wei Cheng,

More information

On Rough Interval Three Level Large Scale Quadratic Integer Programming Problem

On Rough Interval Three Level Large Scale Quadratic Integer Programming Problem J. Stat. Appl. Pro. 6, No. 2, 305-318 2017) 305 Journal of Statistics Applications & Probability An International Journal http://dx.doi.org/10.18576/jsap/060206 On Rough Interval Three evel arge Scale

More information

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns

More information

A New Approach to Solving Dynamic Traveling Salesman Problems

A New Approach to Solving Dynamic Traveling Salesman Problems A New Approach to Solving Dynaic Traveling Salesan Probles Changhe Li 1 Ming Yang 1 Lishan Kang 1 1 China University of Geosciences(Wuhan) School of Coputer 4374 Wuhan,P.R.China lchwfx@yahoo.co,yanging72@gail.co,ang_whu@yahoo.co

More information

Probability Distributions

Probability Distributions Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples

More information

W-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS

W-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS W-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS. Introduction When it coes to applying econoetric odels to analyze georeferenced data, researchers are well

More information

The linear sampling method and the MUSIC algorithm

The linear sampling method and the MUSIC algorithm INSTITUTE OF PHYSICS PUBLISHING INVERSE PROBLEMS Inverse Probles 17 (2001) 591 595 www.iop.org/journals/ip PII: S0266-5611(01)16989-3 The linear sapling ethod and the MUSIC algorith Margaret Cheney Departent

More information

State Estimation Problem for the Action Potential Modeling in Purkinje Fibers

State Estimation Problem for the Action Potential Modeling in Purkinje Fibers APCOM & ISCM -4 th Deceber, 203, Singapore State Estiation Proble for the Action Potential Modeling in Purinje Fibers *D. C. Estuano¹, H. R. B.Orlande and M. J.Colaço Federal University of Rio de Janeiro

More information

Principal Components Analysis

Principal Components Analysis Principal Coponents Analysis Cheng Li, Bingyu Wang Noveber 3, 204 What s PCA Principal coponent analysis (PCA) is a statistical procedure that uses an orthogonal transforation to convert a set of observations

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

PULSE-TRAIN BASED TIME-DELAY ESTIMATION IMPROVES RESILIENCY TO NOISE

PULSE-TRAIN BASED TIME-DELAY ESTIMATION IMPROVES RESILIENCY TO NOISE PULSE-TRAIN BASED TIME-DELAY ESTIMATION IMPROVES RESILIENCY TO NOISE 1 Nicola Neretti, 1 Nathan Intrator and 1,2 Leon N Cooper 1 Institute for Brain and Neural Systes, Brown University, Providence RI 02912.

More information

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109

More information

Chapter 2 General Properties of Radiation Detectors

Chapter 2 General Properties of Radiation Detectors Med Phys 4RA3, 4RB3/6R3 Radioisotopes and Radiation Methodology -1 Chapter General Properties of Radiation Detectors Ionizing radiation is ost coonly detected by the charge created when radiation interacts

More information

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS Jochen Till, Sebastian Engell, Sebastian Panek, and Olaf Stursberg Process Control Lab (CT-AST), University of Dortund,

More information

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy Storage Capacity and Dynaics of Nononotonic Networks Bruno Crespi a and Ignazio Lazzizzera b a. IRST, I-38050 Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I-38050 Povo (Trento) Italy INFN Gruppo

More information