Hidden Order in Chaos: The Network-Analysis Approach To Dynamical Systems
|
|
- Jessie Collins
- 7 years ago
- Views:
Transcription
1 769 Hidden Order in Chaos: The Network-Analysis Approach To Dynamical Systems Takashi Iba Faculty of Policy Management Keio University In this paper, I present a technique for understanding a whole behavior of chaotic dynamical system, where state-transition networks of the systems are built and analyzed. With using this technique, I show that there is an order undetected yet, where state-transition networks in several chaotic dynamical systems are scale-free network, binary-tree network and so on. I anticipate that this study marks a step toward seeing well-known chaos in a new light. 1 Introduction Chaotic phenomena that are intrinsically complex and unpredictable exist everywhere in natural, technological, and social world. Deterministic chaos exhibits highly complex behavior, even though it is governed by a simple rule. In many cases, unfortunately, it is impossible to solve the systems analytically due to their nonlinearity; therefore a numerical simulation is commonly used as a powerful tool to explore the systems evolution in time. However, the nature of the system as a whole
2 770 is still unrevealed, since a numerical simulation shows only an instance of possible evolutions generated from a certain initial condition. In this paper, I will present a technique, building and analyzing state-transition networks for chaotic dynamical system, for understanding a whole behavior of the system. Also, I will show state-transition networks in several chaotic dynamical systems. 2 Method 2.1 How to build state-transition networks The technique I introduce in this paper follows a three-step procedure (Figure 1) [1]: First, a continuous unit interval of variables of the target system is subdivided into a finite number of subintervals, discrete states. In the term of numerical operation, it is carried out by rounding the value of the variables to d decimal places with round-off, round-up, or round-down function. Second, for each state, mapping from the state to its next state is carried out with using the map function. Third, a network is built, combining the all relation between two states together. Figure. 1: Building the state-transition network of a dynamical system. A unit interval is subdivided into subintervals, states. Then, for each state, mapping is carried out. Finally, a network is built with these states, combining the all relation between two states together. 2.2 Terminology Connecting different fields of the science of complexity [2-4] and network science [5-7], I here denote the correspondence of terminology in the figure 2-5. A node in state-transition networks represents a state of a variable in a one-dimensional dynamical system, or a composite state of all variables in a dynamical system whose dimension is greater than one (Figure 2). A link represents a transition from a state to another state in a dynamical system. Each link has a direction; therefore state-transition networks are directed networks.
3 771 Figure. 2: Elements of state-transition network and their correspondence with the terminology for dynamical systems: node and link. In-degree, which means the number of incoming links to a node, represents the number of possible previous states for mapping (Figure 3). On the other hand, out-degree, which means the number of outgoing links from a certain node, represents the number of possible next states for mapping. In deterministic systems, out-degree must be equal to 1, by definition. It means that the successor state for each state is uniquely determined. An authority, which is a node whose in-degree of an authority is very large, represents a state that yields many possible previous states. Figure. 3: Degree of nodes in state-transition network and their correspondence with the terminology for dynamical systems: in-degree, out-degree, and authority. A loop represents a fixed point, where the system repeats the same states (Figure 4). A cycle represents a periodic cycle, where the system oscillates between two or more states. The cycle that has two nodes is called period-2 cycle; the cycle that has four nodes is called period-4 cycle; and so forth. Both fixed point and periodic cycle is a kind of attractor, where the system eventually falls into after a long enough period of time.
4 772 Figure. 4: Cyclic structure in state-transition network and their correspondence with the terminology for dynamical systems: loop and cycle. Connected component represents a basin of attraction, a set of states that eventually flow into an attractor (Figure 5). Each basin of attraction, by definition, must have only one attractor, namely either fixed point or periodic cycle. Therefore, each connected component will have only one attractor, which is either a loop or a cycle. For building a state-transition network of a chaotic dynamical system, the whole behavior is often mapped into more than one connected components. Figure. 5: Component in state-transition network and their correspondence with the terminology for dynamical systems: connected component. 2.3 Drawing a Map of System s Behavior Building state-transition networks is analogous to draw a map of the whole behavior of a dynamical system. With the state-transition networks as a map, we can overview the landscape of behavior from bird s-eye view. Thus, the method is much different from numerical simulations, which is often used for understanding the behavior of dynamical systems. To clarify this difference, it may be helpful to use a metaphor of river. In the metaphor, a node represents a geographical point in the river, and a link represents a
5 773 connection from a point to another. The direction of a flow in the river is fixed. While there are no branches of the flow, however you can find confluences of two or more tributaries everywhere. To be exact, the network is not a usual river but dried-up river, where there are no flows on the riverbed. On the other hand, exploring a dynamical system with a numerical simulation of system s evolution in time means to observe an instance of flow starting from a point of the river. Determining a starting point and discharging water, you will see that the water flow downstream on the river network (Figure 6), and typical techniques of drawing a trajectory on phase space and bifurcation diagram are just to sketch out the instances. This type of study, building and analyzing state-transition networks, has been carried out for understanding the nature of cellular automata and random Boolean networks [8-12]. In the study for chaos, there are some pioneering studies [13-16], however the network analyses of chaotic dynamical systems have not been studied in much detail so far. Figure. 6: What a run of numerical simulation does in representation of state-transition networks. A run of numerical simulation traces an instance of flow on the state-transition network of the system. 3 State-Transition Networks of Chaotic Dynamical Systems I will show state-transition networks of several types of chaotic dynamical systems: one-dimensional maps, two-dimensional dissipative maps, and two-dimensional conservative maps. In this paper, round-up function is used for rounding the value; and the values of variables are rounded up to d decimal places. Note that the all following networks are visualized with the circular layout of yfiles [17] on the Cytoscape environment [18]. 3.1 One-dimensional maps For one-dimensional maps, the following maps are visualized and analyzed: the logistic map [19, 20], the sine map, the cubic map, the Gaussian map, the sine-circle map [21], the tent map, the binary shift map, and the cusp map. As a result, these maps can be categorized into four types.
6 774 First type is the state-transition network that is always a scale-free network [22, 23] independent of the control parameter. The maps belonging to this type are the logistic map, the sine map, and the cubic map. Figure 7-9 show state-transition networks in the logistic map x n +1 = 4µx n (1 x n ), sine map x n +1 = µ sin(πx n ), and the cubic map x n +1 = 27µx 2 n (1 x n ) 4 respectively with µ = 1.0 and d = 3 ; and figure 10 shows state-transition networks of the sine-circle map x n +1 = x n + Ω (K 2π )sin(2πx n ) (mod 1) with K = 2, Ω = 0.5 and d = 3. All of them are scale-free networks whose degree distribution follows a power. It means that there are quite many nodes having few links but also a few hubs that have an extraordinarily large number of links. Note that the detail mechanism why these networks are scale-free networks is discussed in my previous paper [1]. Figure. 7: Scale-free state-transition network in the logistic map. (A) Graph of the logistic mapping from x n with µ = 1.0, where the gray line is an orbit starting from the initial condition x 0 = 0.2. (B) State-transition network in the logistic map with µ = 1.0 and d = 3, which is a scale-free network.
7 775 Figure. 8: Scale-free state-transition network in the sine map. (A) Graph of the sine mapping from x n with µ = 1.0, where the gray line is an orbit starting from the initial condition x 0 = 0.2. (B) State-transition network in the sine map with µ = 1.0 and d = 3, which is a scale-free network. Figure. 9: Scale-free state-transition network in the cubic map. (A) Graph of the cubic mapping from x n with µ = 1.0, where the gray line is an orbit starting from the initial condition x 0 = 0.2. (B) State-transition network in the cubic map with µ = 1.0 and d = 3, which is a scale-free network. Figure. 10: Scale-free state-transition network in the sine-circle map. (A) Graph of the sine-circle mapping from x n with K = 2 and Ω = 0.5, where the gray line is an orbit starting from the initial condition x 0 = 0.2. (B) State-transition network in the sine-circle map with K = 2, Ω = 0.5 and d = 3, which is a scale-free network. Second type is the state-transition network that is a scale-free network only when the control parameter is set in a certain range. Figure 11 shows a state-transition network in the Gaussian map x n +1 = e bx n 2 + c with b = 3.0, c = 0.3, and d = 3,
8 776 which is a scale-free network. Figure 12, then, shows the cumulative in-degree distribution of the networks in the Gaussian map with the value of b varying from 1.0 to 15.0 by 2.0 and c = 0.3. The distribution follows a power law when b is small (e.g. 1.0 and 3.0) and when b is much larger; however it does not when b is intermediate value (e.g. 7.0 and 9.0), where no nodes have an exceptional in-degree. Figure. 11: Scale-free state-transition network in the Gaussian map. (A) Graph of the Gaussian mappings from x n with c = 0.3 and b = 3.0, where the gray line is an orbit starting from the initial condition x 0 = 0.2. (B) State-transition network in the Gaussian map with c = 0.3, b = 3.0, d = 3, which is a scale-free network. Figure. 12: Structural change of the state-transition networks in the Gaussian map. (A) The plot of the Gaussian map obtained by varying the value of b from 1.0 to 15.0 by 2.0 with c = 0.3 and d = 3. (B) The cumulative in-degree distribution of the Gaussian map with the same settings. Third type is the state-transition network that is a binary-tree-typed network, where each branch splits into two, then into two again, and so forth. Figure 13 shows the state-transition network in the tent map x n +1 = µ ( 1 2 x n 1 2)with µ = 1.0 and d = 3; and figure 14 shows the state-transition network in the binary shift map x n +1 = 2x (mod 1) with d = 3. The state-transition network in the piecewise linear
9 777 map tend to be this type of network, since all states of x have exactly the same in-degree due to the constant slope. Figure. 13: Binary-tree-typed state-transition network in the tent map. (A) Graph of the tent mappings from x n with µ = 1.0, where the gray line is an orbit starting from the initial condition x 0 = 0.2. (B) State-transition network in the tent map with µ = 1.0 and d = 3, where binary-tree sub-networks branch from the cycle. Figure. 14: Binary-tree-typed state-transition network in the binary shift map. (A) Graph of the binary shift mappings from x n with µ = 1.0, where the gray line is an orbit starting from the initial condition x 0 = 0.2. (B) State-transition network in the binary shift map with µ = 1.0 and d = 3, where binary-tree sub-networks branch from the cycle. Forth type is the state-transition network that is an irregular-tree-typed network. Figure 15 shows state-transition networks in the cusp map x n +1 = 1 4µ x n with µ = 1.0 and d = 3, where tree sub-networks consisting the node whose in-degree exhibits several values branch from the cycle.
10 778 Figure. 15: Irregular-State-transition network in the cusp map. (A) Graph of the cusp mappings from x n with a = 2.0, where the gray line is an orbit starting from the initial condition x 0 = 0.2. (B) State-transition network in the cusp map with a = 2.0 and d = 4, where tree sub-networks consisting the node whose in-degree exhibits several values branch from the cycle. 3.2 Two-dimensional dissipative maps For two-dimensional dissipative maps, which contract areas in phase space, the following maps are visualized and analyzed here: the delayed logistic map [24], Hénon map [25], and Lozi map [26]. Figure 16 shows state-transition networks in the delayed logistic map x n +1 = 4µx n (1 y n ) and y n +1 = x n with µ = and d = 2, which is a scale-free network. Figure 17 shows state-transition networks in the Hénon map x n +1 = 1 ax 2 n + y n and y n +1 = bx n with a = 1.4, b = 0.3, and d = 2. Figure 18 shows state-transition networks in the Lozi map x n +1 = 1 a x n + y n and y n +1 = bx n with a = 1.7, b = 0.5, and d = 2.
11 779 Figure. 16: Scale-free state-transition network in the delayed logistic map. (A) Attractor drawn by plotting successive points obtained by the delayed logistic mapping with µ = (B) State-transition network in the delayed logistic map with µ = and d = 2, which is a scale-free network. Figure. 17: State-transition network in the Hénon map. (A) Attractor drawn by plotting successive points obtained from Hénon mapping with a = 1.4 and b = 0.3. (B) State-transition network in the Hénon map with a = 1.4, b = 0.3, and d = 2. Figure. 18: State-transition network in the Lozi map. (A) Attractor drawn by plotting successive points obtained from Lozi mapping with a = 1.7 and b = 0.5. (B) State-transition network in the Lozi map with a = 1.7, b = 0.5, and d = Two-dimensional conservative maps For two-dimensional conservative maps, the following maps are visualized and analyzed: Hénon s area-preserving map [27], Chirikov standard map [28], the
12 780 Arnold s cat map [29], and the gingerbreadman map [30]. Figure 19 shows state-transition networks in the Hénon s area-preserving map x n +1 = x n cosα (y n x 2 n )sinα and y n +1 = x n sinα + (y n x 2 n ) cosα with cosα = 0.24 and d = 2. Figure 20 shows state-transition networks in the Chirikov standard map x n +1 = x n + y n +1 (mod 1) and y n +1 = y n (K 2π )sin 2πx n (mod 1) with K = 1.0 and d = 2. Figure 21 shows state-transition networks in the gingerbreadman map x n +1 = 1+ x n y n and y n +1 = x n with d = 2. Figure. 19: State-transition network in the Hénon area-preserving map. (A) The orbit drawn by plotting successive points obtained from Hénon area-preserving mapping with cosα = 0.24, starting from the point x 0 = 40π 25, y 0 = 40π 25. (B) State-transition network in the Hénon area-preserving map with cosα = 0.24 and d = 2. Figure. 20: State-transition network in the Chirikov standard map. (A) The orbit drawn by plotting successive points obtained from Chirikov standard mapping with K = 1, starting from the point x 0 = 0.57, y 0 = (B) State-transition network in the Chirikov standard map with K = 1 and d = 2.
13 781 Figure. 21: Regular state-transition network in the Arnold s cat map. (A) The orbit drawn by plotting successive points obtained from Arnold s cat mapping with k = 1, starting from the point x 0 = 0.2, y 0 = 0.2. (B) State-transition network in the Arnold s cat map with k = 1 and d = 2, which is a regular network where all nodes have just one incoming link. Figure. 22: Regular state-transition network in the gingerbreadman map. (A) The orbit drawn by plotting successive points obtained from gingerbreadman mapping, starting from the point x 0 = 0.1, y 0 = 0. (B) State-transition network in the gingerbreadman map with d = 2, which is a regular network where all nodes have just one incoming link. 4 Conclusion In this paper, a technique was introduced to grasp the whole behavior of chaotic dynamical systems and the state-transition networks of several systems demonstrated the hidden order in chaos. This implies that our technique of mapping the transitions between states is useful to capture the nature of the system. Thanks to the recent development of computer power, it become to be easy to draw a map of a dynamical system as a whole with higher resolution, and the
14 782 development of the network science enables us to understand the nature of state transition in light of new concept of complex networks, like scale-free network. Thus we anticipate that my study opens up a new way for the network-analysis approach to dynamical systems, where one can understand complex systems with methods and tools developed in the network science. On the other hand, this study also provides a demonstration of analyzing a network embedded in temporal behavior, where more than one node cannot exist together at the same time, which have not been studied in much detail in the network science. Acknowledgement I would like to thank to K. Shimonishi for collaborating on the exploration for new ways of studying chaos, T. Malone and P. Gloor for providing a research environment at MIT Center for Collective Intelligence, and also the Cytoscape project for providing the useful tool for network analysis and visualization. Bibliography [1] Iba, T., 2010, Scale-Free Networks Hidden in Chaotic Dynamical Systems, arxiv: v1 [nlin.cd] [2] Strogatz, S. H., 1994, Nonlinear Dynamics and Chaos, Westview Press (Cambridge, MA) [3] Hilborn, R. C., 2000, Chaos and Nonlinear Dynamics, 2 nd ed., Oxford University Press (Oxford) [4] Sprott, J. C., 2003, Chaos and Time-Series Analysis, Oxford University Press (New York, NY) [5] Newman, M., Barabasi, A. -L. and Watts, D. J., 2006, The Structure and Dynamics of Networks, Princeton University Press (Princeton, NJ) [6] Caldarelli, G., 2007, Scale-Free Networks, Oxford University Press (Oxford) [7] Newman, M. E. J., 2010, Networks, Oxford University Press (Oxford). [8] Wuensche, A. and Lesser, M., 1992, The Global Dynamics of Cellular Automata, Addison-Wesley (Reading, MA) [9] Wolfram, S., 1994, Cellular Automata and Complexity, Addison-Wesley (Reading, MA) [10] Wolfram, S., 2002, A New Kind of Science, Wolfram Media (Champaign, IL) [11] Kauffman, S. A., 1993, The Origins of Order, Oxford University Press (New York) [12] Kauffman, S. A., 1995, At Home in the Universe, Oxford University Press (New York) [13] Binder, P. -M. and Okamoto, N. H., 2003, Phys. Rev. E 68, [14] Grebogi, C., Ott,, E., and Yorke, J. A., 1988, Phys. Rev. A 38, 3688
15 783 [15] Sauer, T., Grebogi, C., and Yorke, J. A., 1997, Phys. Rev. Lett. 79 (1), [16] Peitgen, H. -O., Jurgens, H., and Saupe, D., 2004, Chaos and Fractals, 2 nd ed., Springer-Verlag (New York) [17] Wiese, R., Eiglsperger, M., & Kaufmann, M., 2002, yfiles: Visualization and Automatic Layout of Graphs, in Graph Drawing Software, eds. by Junger, M. & Mutzel, P., Springer (Berlin). [18] Smoot, M., et. al., 2010, Cytoscape 2.8: new features for data integration and network visualization, Bioinformatics 27 (3): [19] Ulam, S. M. and von Neumann, J., 1947, Bull. Amer. Math. Soc. 53, 1120 [20] May, R., 1976, Nature 261, [21] Arnold, V. I., 1965, American Mathematical Society Translation Series 2 46, [22] Barabasi, A. -L., and Albert, R., 1999, Science 286, [23] Barabasi, A. -L., 2009, Science 325, [24] Aronson, D. G., Chory, M. A., Hall, G. R., and McGehee, R. P., 1982, Comm. Math. Phys. 83 (3) [25] Hénon, M., 1976, A Two-Dimensional Mapping with a Strange Attractor, Comm. Math. Phys. 50, [26] Lozi, R. 1978, Un attracteur étrange du type attracteur de Hénon, J. Phys. (Paris) 39 (C5), 9 [27] Hénon, M., 1969, Numerical study of quadratic area-preserving mappings, Quart. Appl. Math. 27, 291 [28] Chirikov, B. V., 1979, A Universal Instability of Many Dimensional Oscillator Systems, Physics Reports 52, [29] Arnold, V. I., & Avez, A., 1968, Ergodic Problems of Classical Mechanics, Benjamin (New York) [30] Devaney, R. L., 1989, A piecewise linear model for the zones of instability of an area-preserving map, Physica D 10,
Computing the Fractal Dimension of Stock Market Indices
Computing the Fractal Dimension of Stock Market Indices Melina Kompella, COSMOS 2014 Chaos is an ancient idea that only recently was developed into a field of mathematics. Before the development of scientific
More informationEuropäisches Forum Alpbach 15 August, 2003. Lecture 1. What is Chaos?
Europäisches Forum Alpbach 15 August, 2003 Lecture 1 What is Chaos? Chaos James Gleick Edward Lorenz The discoverer of Chaos Chaos in Dynamical Systems Edward Ott The Scientific Method Observe natural
More informationarxiv:cond-mat/9811359v1 [cond-mat.dis-nn] 25 Nov 1998
arxiv:cond-mat/9811359v1 [cond-mat.dis-nn] 25 Nov 1998 Energy Levels of Quasiperiodic Hamiltonians, Spectral Unfolding, and Random Matrix Theory M. Schreiber 1, U. Grimm, 1 R. A. Römer, 1 and J. X. Zhong
More informationGraphs over Time Densification Laws, Shrinking Diameters and Possible Explanations
Graphs over Time Densification Laws, Shrinking Diameters and Possible Explanations Jurij Leskovec, CMU Jon Kleinberg, Cornell Christos Faloutsos, CMU 1 Introduction What can we do with graphs? What patterns
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationRepresenting Reversible Cellular Automata with Reversible Block Cellular Automata
Discrete Mathematics and Theoretical Computer Science Proceedings AA (DM-CCG), 2001, 145 154 Representing Reversible Cellular Automata with Reversible Block Cellular Automata Jérôme Durand-Lose Laboratoire
More informationBoolean Network Models
Boolean Network Models 2/5/03 History Kaufmann, 1970s Studied organization and dynamics properties of (N,k) Boolean Networks Found out that highly connected networks behave differently than lowly connected
More informationUSING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS
USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS Natarajan Meghanathan Jackson State University, 1400 Lynch St, Jackson, MS, USA natarajan.meghanathan@jsums.edu
More informationCurrent Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary
Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:
More informationSpatio-Temporal Map for Time-Series Data Visualization
Spatio-Temporal Map for Time-Series Data Visualization Hiroko Nakamura Miyamura, Yoshio Suzuki, and Hiroshi Takemiya Center for Computational Science and E-system Japan Atomic Energy Research Agency 6-9-3
More informationEffects of node buffer and capacity on network traffic
Chin. Phys. B Vol. 21, No. 9 (212) 9892 Effects of node buffer and capacity on network traffic Ling Xiang( 凌 翔 ) a), Hu Mao-Bin( 胡 茂 彬 ) b), and Ding Jian-Xun( 丁 建 勋 ) a) a) School of Transportation Engineering,
More informationModelingandSimulationofthe OpenSourceSoftware Community
ModelingandSimulationofthe OpenSourceSoftware Community Yongqin Gao, GregMadey Departmentof ComputerScience and Engineering University ofnotre Dame ygao,gmadey@nd.edu Vince Freeh Department of ComputerScience
More informationNotes on Complexity Theory Last updated: August, 2011. Lecture 1
Notes on Complexity Theory Last updated: August, 2011 Jonathan Katz Lecture 1 1 Turing Machines I assume that most students have encountered Turing machines before. (Students who have not may want to look
More informationGENERATING AN ASSORTATIVE NETWORK WITH A GIVEN DEGREE DISTRIBUTION
International Journal of Bifurcation and Chaos, Vol. 18, o. 11 (2008) 3495 3502 c World Scientific Publishing Company GEERATIG A ASSORTATIVE ETWORK WITH A GIVE DEGREE DISTRIBUTIO JI ZHOU, XIAOKE XU, JIE
More informationGenetic Algorithm Evolution of Cellular Automata Rules for Complex Binary Sequence Prediction
Brill Academic Publishers P.O. Box 9000, 2300 PA Leiden, The Netherlands Lecture Series on Computer and Computational Sciences Volume 1, 2005, pp. 1-6 Genetic Algorithm Evolution of Cellular Automata Rules
More informationPUBLIC TRANSPORT SYSTEMS IN POLAND: FROM BIAŁYSTOK TO ZIELONA GÓRA BY BUS AND TRAM USING UNIVERSAL STATISTICS OF COMPLEX NETWORKS
Vol. 36 (2005) ACTA PHYSICA POLONICA B No 5 PUBLIC TRANSPORT SYSTEMS IN POLAND: FROM BIAŁYSTOK TO ZIELONA GÓRA BY BUS AND TRAM USING UNIVERSAL STATISTICS OF COMPLEX NETWORKS Julian Sienkiewicz and Janusz
More informationQuantitative vs. Categorical Data: A Difference Worth Knowing Stephen Few April 2005
Quantitative vs. Categorical Data: A Difference Worth Knowing Stephen Few April 2005 When you create a graph, you step through a series of choices, including which type of graph you should use and several
More informationAlgorithms for representing network centrality, groups and density and clustered graph representation
COSIN IST 2001 33555 COevolution and Self-organization In dynamical Networks Algorithms for representing network centrality, groups and density and clustered graph representation Deliverable Number: D06
More informationCellular Automaton: The Roulette Wheel and the Landscape Effect
Cellular Automaton: The Roulette Wheel and the Landscape Effect Ioan Hălălae Faculty of Engineering, Eftimie Murgu University, Traian Vuia Square 1-4, 385 Reşiţa, Romania Phone: +40 255 210227, Fax: +40
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding
More informationDynamical order in chaotic Hamiltonian system with many degrees of freedom
1 Dynamical order in chaotic Hamiltonian system with many degrees of freedom Tetsuro KONISHI Dept. of Phys., Nagoya University, Japan tkonishi@r.phys.nagoya-u.ac.jp Sep. 22, 2006 at SM& FT 2006, Bari (Italy),
More informationEDEXCEL FUNCTIONAL SKILLS PILOT TEACHER S NOTES. Maths Level 2. Chapter 5. Shape and space
Shape and space 5 EDEXCEL FUNCTIONAL SKILLS PILOT TEACHER S NOTES Maths Level 2 Chapter 5 Shape and space SECTION H 1 Perimeter 2 Area 3 Volume 4 2-D Representations of 3-D Objects 5 Remember what you
More informationCHARACTERISTICS IN FLIGHT DATA ESTIMATION WITH LOGISTIC REGRESSION AND SUPPORT VECTOR MACHINES
CHARACTERISTICS IN FLIGHT DATA ESTIMATION WITH LOGISTIC REGRESSION AND SUPPORT VECTOR MACHINES Claus Gwiggner, Ecole Polytechnique, LIX, Palaiseau, France Gert Lanckriet, University of Berkeley, EECS,
More informationMathematics B (2008) Sample assessment instrument and student responses
Mathematics B (2008) Sample assessment instrument and student responses Extended modelling and problem solving June 2010 Purposes of assessment 1 The purposes of assessment are to: promote, assist and
More informationSIMULATION OF A Business Firm
SIMULATION OF A BUSINESS FIRM Malcolm Brady Dublin City University Business School Dublin 9 Ireland Tel. +353 1 7045188 Fax +353 1 7045446 Email malcolm.brady@dcu.ie Presented at YOR11: Young Operations
More informationCHAPTER 5 Round-off errors
CHAPTER 5 Round-off errors In the two previous chapters we have seen how numbers can be represented in the binary numeral system and how this is the basis for representing numbers in computers. Since any
More informationChapter 14 Managing Operational Risks with Bayesian Networks
Chapter 14 Managing Operational Risks with Bayesian Networks Carol Alexander This chapter introduces Bayesian belief and decision networks as quantitative management tools for operational risks. Bayesian
More informationApplications to Data Smoothing and Image Processing I
Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) is
More informationBOOLEAN CONSENSUS FOR SOCIETIES OF ROBOTS
Workshop on New frontiers of Robotics - Interdep. Research Center E. Piaggio June 2-22, 22 - Pisa (Italy) BOOLEAN CONSENSUS FOR SOCIETIES OF ROBOTS Adriano Fagiolini DIEETCAM, College of Engineering, University
More informationBig Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network
, pp.273-284 http://dx.doi.org/10.14257/ijdta.2015.8.5.24 Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network Gengxin Sun 1, Sheng Bin 2 and
More informationContinued Fractions. Darren C. Collins
Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history
More informationNatural cubic splines
Natural cubic splines Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology October 21 2008 Motivation We are given a large dataset, i.e. a function sampled
More informationA box-covering algorithm for fractal scaling in scale-free networks
CHAOS 17, 026116 2007 A box-covering algorithm for fractal scaling in scale-free networks J. S. Kim CTP & FPRD, School of Physics and Astronomy, Seoul National University, NS50, Seoul 151-747, Korea K.-I.
More informationBIFURCATION PHENOMENA IN THE 1:1 RESONANT HORN FOR THE FORCED VAN DER POL - DUFFING EQUATION
International Journal of Bifurcation and Chaos, Vol. 2, No.1 (1992) 93-100 World Scientific Publishing Company BIFURCATION PHENOMENA IN THE 1:1 RESONANT HORN FOR THE FORCED VAN DER POL - DUFFING EQUATION
More informationChapter 9. Systems of Linear Equations
Chapter 9. Systems of Linear Equations 9.1. Solve Systems of Linear Equations by Graphing KYOTE Standards: CR 21; CA 13 In this section we discuss how to solve systems of two linear equations in two variables
More informationChapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks
Chapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks Imre Varga Abstract In this paper I propose a novel method to model real online social networks where the growing
More informationNONLINEAR TIME SERIES ANALYSIS
NONLINEAR TIME SERIES ANALYSIS HOLGER KANTZ AND THOMAS SCHREIBER Max Planck Institute for the Physics of Complex Sy stems, Dresden I CAMBRIDGE UNIVERSITY PRESS Preface to the first edition pug e xi Preface
More informationAn Alternative Web Search Strategy? Abstract
An Alternative Web Search Strategy? V.-H. Winterer, Rechenzentrum Universität Freiburg (Dated: November 2007) Abstract We propose an alternative Web search strategy taking advantage of the knowledge on
More informationCURVE FITTING LEAST SQUARES APPROXIMATION
CURVE FITTING LEAST SQUARES APPROXIMATION Data analysis and curve fitting: Imagine that we are studying a physical system involving two quantities: x and y Also suppose that we expect a linear relationship
More informationThe Systematic Descent from Order to Chaos
The Systematic Descent from Order to Chaos COURTNEY DARVILLE The Quadratic Iterator Final State Diagrams A method for examining the long-term behaviour of a system 1. Choose an initial value at random
More informationMATHEMATICS: PAPER I. 5. You may use an approved non-programmable and non-graphical calculator, unless otherwise stated.
NATIONAL SENIOR CERTIFICATE EXAMINATION NOVEMBER 015 MATHEMATICS: PAPER I Time: 3 hours 150 marks PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY 1. This question paper consists of 1 pages and an Information
More informationMicroeconomics Sept. 16, 2010 NOTES ON CALCULUS AND UTILITY FUNCTIONS
DUSP 11.203 Frank Levy Microeconomics Sept. 16, 2010 NOTES ON CALCULUS AND UTILITY FUNCTIONS These notes have three purposes: 1) To explain why some simple calculus formulae are useful in understanding
More informationCreating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities
Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned
More informationFatigue Analysis of an Inline Skate Axel
FATIGUE ANALYSIS OF AN INLINE SKATE AXEL 57 Fatigue Analysis of an Inline Skate Axel Authors: Faculty Sponsor: Department: Garrett Hansen, Mike Woizeschke Dr. Shanzhong (Shawn) Duan Mechanical Engineering
More informationCumulative Diagrams: An Example
Cumulative Diagrams: An Example Consider Figure 1 in which the functions (t) and (t) denote, respectively, the demand rate and the service rate (or capacity ) over time at the runway system of an airport
More informationQuestion 2 Naïve Bayes (16 points)
Question 2 Naïve Bayes (16 points) About 2/3 of your email is spam so you downloaded an open source spam filter based on word occurrences that uses the Naive Bayes classifier. Assume you collected the
More informationMathematics programmes of study: key stage 4. National curriculum in England
Mathematics programmes of study: key stage 4 National curriculum in England July 2014 Contents Purpose of study 3 Aims 3 Information and communication technology (ICT) 4 Spoken language 4 Working mathematically
More informationCovariance and Correlation
Covariance and Correlation ( c Robert J. Serfling Not for reproduction or distribution) We have seen how to summarize a data-based relative frequency distribution by measures of location and spread, such
More informationSet operations and Venn Diagrams. COPYRIGHT 2006 by LAVON B. PAGE
Set operations and Venn Diagrams Set operations and Venn diagrams! = { x x " and x " } This is the intersection of and. # = { x x " or x " } This is the union of and. n element of! belongs to both and,
More informationComputing Cubic Fields in Quasi-Linear Time
Computing Cubic Fields in Quasi-Linear Time K. Belabas Département de mathématiques (A2X) Université Bordeaux I 351, cours de la Libération, 33405 Talence (France) belabas@math.u-bordeaux.fr Cubic fields
More informationRegular Expressions and Automata using Haskell
Regular Expressions and Automata using Haskell Simon Thompson Computing Laboratory University of Kent at Canterbury January 2000 Contents 1 Introduction 2 2 Regular Expressions 2 3 Matching regular expressions
More informationwith functions, expressions and equations which follow in units 3 and 4.
Grade 8 Overview View unit yearlong overview here The unit design was created in line with the areas of focus for grade 8 Mathematics as identified by the Common Core State Standards and the PARCC Model
More informationINTRODUCTION. Logistic[r ]ªFunction[x, rx(1 x)]; (Received 27 April 1997; accepted 27 July 1998)
Mathematica package for analysis and control of chaos in nonlinear systems José Manuel Gutiérrez a and Andrés Iglesias b Department of Applied Mathematics, University of Cantabria, Santander 39005, Spain
More informationThe Effects of Start Prices on the Performance of the Certainty Equivalent Pricing Policy
BMI Paper The Effects of Start Prices on the Performance of the Certainty Equivalent Pricing Policy Faculty of Sciences VU University Amsterdam De Boelelaan 1081 1081 HV Amsterdam Netherlands Author: R.D.R.
More informationFluctuations in airport arrival and departure traffic: A network analysis
Fluctuations in airport arrival and departure traffic: A network analysis Li Shan-Mei( 李 善 梅 ) a), Xu Xiao-Hao( 徐 肖 豪 ) b), and Meng Ling-Hang( 孟 令 航 ) a) a) School of Computer Science and Technology,
More informationPHILOSOPHY OF THE MATHEMATICS DEPARTMENT
PHILOSOPHY OF THE MATHEMATICS DEPARTMENT The Lemont High School Mathematics Department believes that students should develop the following characteristics: Understanding of concepts and procedures Building
More informationSURVEY ON DYNAMICAL YANG-BAXTER MAPS. Y. Shibukawa
SURVEY ON DYNAMICAL YANG-BAXTER MAPS Y. Shibukawa Department of Mathematics, Faculty of Science, Hokkaido University, Sapporo 060-0810, Japan e-mail: shibu@math.sci.hokudai.ac.jp Abstract In this survey,
More informationThe QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion
The QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion Daniel Marbach January 31th, 2005 Swiss Federal Institute of Technology at Lausanne Daniel.Marbach@epfl.ch
More informationExamples of Functions
Examples of Functions In this document is provided examples of a variety of functions. The purpose is to convince the beginning student that functions are something quite different than polynomial equations.
More informationBase Conversion written by Cathy Saxton
Base Conversion written by Cathy Saxton 1. Base 10 In base 10, the digits, from right to left, specify the 1 s, 10 s, 100 s, 1000 s, etc. These are powers of 10 (10 x ): 10 0 = 1, 10 1 = 10, 10 2 = 100,
More informationChaotic Turing Patterns displaying the beauty of chaos
Chaotic Turing Patterns displaying the beauty of chaos Jinghua Xiao 1, 2 2 3,1*, Junzhong Yang, Gang Hu 1 Department of Physics, Beijing Normal University, Beijing 100875, China 2 School of Science, Beijing
More informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
More informationImplications of an inverse branching aftershock sequence model
Implications of an inverse branching aftershock sequence model D. L. Turcotte* and S. G. Abaimov Department of Geology, University of California, Davis, California 95616, USA I. Dobson Electrical and Computer
More informationWESTMORELAND COUNTY PUBLIC SCHOOLS 2011 2012 Integrated Instructional Pacing Guide and Checklist Computer Math
Textbook Correlation WESTMORELAND COUNTY PUBLIC SCHOOLS 2011 2012 Integrated Instructional Pacing Guide and Checklist Computer Math Following Directions Unit FIRST QUARTER AND SECOND QUARTER Logic Unit
More informationHomological Algebra Workshop 02-03-15/06-03-15
Homological Algebra Workshop 02-03-15/06-03-15 Monday: Tuesday: 9:45 10:00 Registration 10:00 11:15 Conchita Martínez (I) 10:00 11:15 Conchita Martínez (II) 11:15 11:45 Coffee Break 11:15 11:45 Coffee
More informationLet s consider a homogeneous medium characterized by the extinction coefficient β ext, single scattering albedo ω 0 and phase function P(µ, µ').
Lecture 22. Methods for solving the radiative transfer equation with multiple scattering. Part 4: Monte Carlo method. Radiative transfer methods for inhomogeneous ouds. Objectives: 1. Monte Carlo method.
More informationThe Government of the Russian Federation
The Government of the Russian Federation The Federal State Autonomous Institution of Higher Education "National Research University - Higher School of Economics" Faculty of Business Informatics Department
More informationThe Method of Least Squares
The Method of Least Squares Steven J. Miller Mathematics Department Brown University Providence, RI 0292 Abstract The Method of Least Squares is a procedure to determine the best fit line to data; the
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More information1 One Dimensional Horizontal Motion Position vs. time Velocity vs. time
PHY132 Experiment 1 One Dimensional Horizontal Motion Position vs. time Velocity vs. time One of the most effective methods of describing motion is to plot graphs of distance, velocity, and acceleration
More informationTesting LTL Formula Translation into Büchi Automata
Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN-02015 HUT, Finland
More information8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension.
8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension. 8.1 Definitions Definition If every point in a set S has arbitrarily small neighborhoods whose boundaries do not intersect
More informationQualitative modeling of biological systems
Qualitative modeling of biological systems The functional form of regulatory relationships and kinetic parameters are often unknown Increasing evidence for robustness to changes in kinetic parameters.
More informationTime Series and Forecasting
Chapter 22 Page 1 Time Series and Forecasting A time series is a sequence of observations of a random variable. Hence, it is a stochastic process. Examples include the monthly demand for a product, the
More informationCkmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming
CONTRIBUTED RESEARCH ARTICLES 29 C.d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming by Haizhou Wang and Mingzhou Song Abstract The heuristic k-means algorithm, widely used for cluster
More informationHigher Education Math Placement
Higher Education Math Placement Placement Assessment Problem Types 1. Whole Numbers, Fractions, and Decimals 1.1 Operations with Whole Numbers Addition with carry Subtraction with borrowing Multiplication
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More informationThe Network Structure of Hard Combinatorial Landscapes
The Network Structure of Hard Combinatorial Landscapes Marco Tomassini 1, Sebastien Verel 2, Gabriela Ochoa 3 1 University of Lausanne, Lausanne, Switzerland 2 University of Nice Sophia-Antipolis, France
More informationTime-Dependent Complex Networks:
Time-Dependent Complex Networks: Dynamic Centrality, Dynamic Motifs, and Cycles of Social Interaction* Dan Braha 1, 2 and Yaneer Bar-Yam 2 1 University of Massachusetts Dartmouth, MA 02747, USA http://necsi.edu/affiliates/braha/dan_braha-description.htm
More informationData Mining mit der JMSL Numerical Library for Java Applications
Data Mining mit der JMSL Numerical Library for Java Applications Stefan Sineux 8. Java Forum Stuttgart 07.07.2005 Agenda Visual Numerics JMSL TM Numerical Library Neuronale Netze (Hintergrund) Demos Neuronale
More informationCHAOS LIMITATION OR EVEN END OF SUPPLY CHAIN MANAGEMENT
CHAOS LIMITATION OR EVEN END OF SUPPLY CHAIN MANAGEMENT Michael Grabinski 1 Abstract Proven in the early 196s, weather forecast is not possible for an arbitrarily long period of time for principle reasons.
More informationCELLULAR AUTOMATA AND APPLICATIONS. 1. Introduction. This paper is a study of cellular automata as computational programs
CELLULAR AUTOMATA AND APPLICATIONS GAVIN ANDREWS 1. Introduction This paper is a study of cellular automata as computational programs and their remarkable ability to create complex behavior from simple
More informationECE 842 Report Implementation of Elliptic Curve Cryptography
ECE 842 Report Implementation of Elliptic Curve Cryptography Wei-Yang Lin December 15, 2004 Abstract The aim of this report is to illustrate the issues in implementing a practical elliptic curve cryptographic
More informationComputation of Explicit Preimages in One-Dimensional Cellular Automata Applying the De Bruijn Diagram
Computation of Explicit Preimages in One-Dimensional Cellular Automata Applying the De Bruijn Diagram José Manuel Gomez Soto SFI WORKING PAPER: 2006-02-005 SFI Working Papers contain accounts of scientific
More informationarxiv:physics/0601033 v1 6 Jan 2006
Analysis of telephone network traffic based on a complex user network Yongxiang Xia, Chi K. Tse, Francis C. M. Lau, Wai Man Tam, Michael Small arxiv:physics/0601033 v1 6 Jan 2006 Department of Electronic
More informationWhat Is Mathematical Modeling?
1 What Is Mathematical Modeling? We begin this book with a dictionary definition of the word model: model (n): a miniature representation of something; a pattern of something to be made; an example for
More informationChapter 4 One Dimensional Kinematics
Chapter 4 One Dimensional Kinematics 41 Introduction 1 4 Position, Time Interval, Displacement 41 Position 4 Time Interval 43 Displacement 43 Velocity 3 431 Average Velocity 3 433 Instantaneous Velocity
More informationLecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
More informationRivista ISI 2007 SCOPUS SCIMAGOJR Mathscinet Zentralblatt Econlit
Rivista ISI 2007 SCOPUS SCIMAGOJR Mathscinet Zentralblatt Econlit Advances in Applied Mathematics 0,718 NO 0,061 SI SI NO Advances in Applied Probability 0,991 SI 0,069 SI SI NO Advances in Difference
More informationSpatio-Temporal Mapping -A Technique for Overview Visualization of Time-Series Datasets-
Progress in NUCLEAR SCIENCE and TECHNOLOGY, Vol. 2, pp.603-608 (2011) ARTICLE Spatio-Temporal Mapping -A Technique for Overview Visualization of Time-Series Datasets- Hiroko Nakamura MIYAMURA 1,*, Sachiko
More informationThe Graphical Method: An Example
The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,
More informationSYLLABUS. OFFICE AND HOURS: Karnoutsos 536 (Access through K506) M 12, T 1, R 10, 12, 2 or by appointment. I am available by e-mail at all times.
SYLLABUS COURSE TITLE: PreCalculus COURSE NUMBER: MATH0165 REFERENCE NUMBER: 1980 PREREQUISITE: MATH0112 Intermediate Algebra or equivalent INSTRUCTOR: Dr. Riggs OFFICE AND HOURS: Karnoutsos 536 (Access
More informationTrigonometric Functions: The Unit Circle
Trigonometric Functions: The Unit Circle This chapter deals with the subject of trigonometry, which likely had its origins in the study of distances and angles by the ancient Greeks. The word trigonometry
More informationSemidefinite characterisation of invariant measures for one-dimensional discrete dynamical systems
Semidefinite characterisation of invariant measures for one-dimensional discrete dynamical systems Didier Henrion 1,2,3 April 24, 2012 Abstract Using recent results on measure theory and algebraic geometry,
More informationMODELING OF SYN FLOODING ATTACKS Simona Ramanauskaitė Šiauliai University Tel. +370 61437184, e-mail: simram@it.su.lt
MODELING OF SYN FLOODING ATTACKS Simona Ramanauskaitė Šiauliai University Tel. +370 61437184, e-mail: simram@it.su.lt A great proportion of essential services are moving into internet space making the
More informationNEUROMATHEMATICS: DEVELOPMENT TENDENCIES. 1. Which tasks are adequate of neurocomputers?
Appl. Comput. Math. 2 (2003), no. 1, pp. 57-64 NEUROMATHEMATICS: DEVELOPMENT TENDENCIES GALUSHKIN A.I., KOROBKOVA. S.V., KAZANTSEV P.A. Abstract. This article is the summary of a set of Russian scientists
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationLecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization
Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization 2.1. Introduction Suppose that an economic relationship can be described by a real-valued
More informationISAT Mathematics Performance Definitions Grade 4
ISAT Mathematics Performance Definitions Grade 4 EXCEEDS STANDARDS Fourth-grade students whose measured performance exceeds standards are able to identify, read, write, represent, and model whole numbers
More informationMinistry of Education. The Ontario Curriculum. Mathematics. Mathematics Transfer Course, Grade 9, Applied to Academic
Ministry of Education The Ontario Curriculum Mathematics Mathematics Transfer Course, Grade 9, Applied to Academic 2 0 0 6 Contents Introduction....................................................... 2
More information