Chaotic Coupled Map Lattices
|
|
- Jasmin Casey
- 5 years ago
- Views:
Transcription
1 Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each other s state, there is a possibility that they ay synchronize. Each individual ap ay still be chaotic but has exactly the sae state as its synchronized partner. An entire network of aps ay be arranged in such a anner as to allow for not only the possible synchronization of all ebers, but also ore coplicated odes of quasi-synchronization, where each eber is synchronized with at least one partner but not necessarily all partners. Soe possible ethods of coupling include diffusive (or nearest neighbor) coupling, and one-way coupling, but it is easy to conceive of uch ore coplicated networks. One-way coupling involves choosing a direction along the lattice for each eber to counicate, an anology is the gae Telephone where a person whispers a essage to the person on his right and the essage is transitted down a line of people until the last person tells it to the person who created the essage, usually sounding little if anything like the original essage (in which case the network would be closed, but this need not be the case). Diffusive coupling is the sae concept except that instead of going one way, the essage is told to everyone in the iediate vicinity. Think of breaking news spreading in a tightly packed crowd. In the case of these networks we ay control the coupling strength, which is soething like how tightly packed the crowd is (without changing the nuber of people). It is interesting to look at the behavior of the syste as this coupling paraeter changes. Theory So far we have studied the circle lattice of logistic aps under diffusive coupling. The ap corresponding to this can be written as x (i) n+1 = f((1 )x(i) n + (x(i+1) n + x (i 1) n )) which says that the n + 1 state of the ith location on the lattice is a weighted ean of its own state and the i+1 and the i 1 locations, where is the coupling paraeter. In our case the function is the logistic ap x n+1 = ax n (1 x n ) We ay also represent the lattice as a vector where each diension is a lattice eber: x n+1 = F ((1 )I x n + (R x n + L x n )) where R and L are shift operators (corresponding respectively to Up and Down shifts on the vector, which are Right and Left shifts on the lattice), I the identity atrix, and it is understood that the function F acts on the vector eleentwise. 1
2 Then we ay represent the coupling as one atrix, C, which acts on the vector, x n. C = (1 )I + (R + L) So that in the case of a diffusively coupled circle lattice with 4 ebers (1 ) C = (1 ) (1 ) (1 ) This type of atrix is called a circulant atrix and it ay be diagonalized by perforing a discrete fourier transfor (DFT) on the atrix. This will be convenient in the derivation of the synchronization condition given below. Conditions for Stable Synchronization If we consider a phase space with each diension corresponding to one lattice eber s state, then there is a subspace which corresponds to synchronization: the diagonal x (1) = x () =... = x (). We wish to consider the behavior of the syste in the vicinity of the diagonal. Do trajectories on the diagonal stay on the diagonal? Of course, since we are dealing with copies of the sae deterinistic ap, a trajectory on the diagonal just corresponds to the siulatenous iteration of the sae ap with the exact sae values, and there is nothing to knock the syste out of synchronization. Is the diagonal linearly stable, i.e do trajectories close to the diagonal end up on the diagonal? That is a uch ore coplicated question. Rewording it slightly we can ask: for what values of the coupling paraeter, does the iteration of the lattice contract every direction in phase space except along the diagonal? Singular values give us a way to look at the directions which an operator stretches or contracts. For exaple if a atrix is applied to the unit circle transforing it into an arbitrary ellipse, the largest singular value is length of the sei-ajor axis, and the second singular value is the length of the sei-inor axis. So to see if the diagonal is linearly stable we can look at the singular values of the Jacobian, which are just the absolute value of the eigenvalues in decreasing order. In our case we can analytically approxiate the singular values in the vicinity of the diagonal. The jacobian for a circle lattice looks like J = f ( x)c 1, where C is the circulant atrix and is a f ( x) is the derivative of the ean of entries of the state vector x. The eigenvectors of C are the coluns of the DFT atrix which have the for: w k = 1 ζ k ζ ḳ. ζ 1 k where is the size of the lattice ζ k = e πik. Applying J to this vector J w k = f (y) (1 ) w k + ] (R w k + L w k ) 1 the reason we consider the ean is addressed in the notes
3 But shifting w right or left is the sae as ultiplying by ζ k and ζ 1 k respectively. J w k = f (y) (1 ) + ] (ζ k + ζ 1 k ) w k J w k = f (y) (1 ) + ] πki πki (e + e ) w k ( ( ))] πk J w k = f (y) (1 ) + cos w k Having found an expression for the eigenvalues, we see that the singular values, s k, have the for ( )] s k = πk f (y) (1 ) + (cos A sufficient condition for linear stability would be if for all iterations, all the singular values except to the one corresponding to stretching along the diagonal are less then one. In the case of the logistic ap we ay bound the derivative by the logistic paraeter f (y) < a. So the sufficient condition for synchronization becoes ( ) a πk (cos 1 + 1) < 1 ( ) πk (cos 1 + 1) < 1/a ( ( ) ) πk 1/a < 1 + cos 1 < 1/a (1 + 1/a) < ( cos ( πk ) 1 1 1/a 1 cos ( ) < < πk ) < 1/a /a 1 cos ( πk However this is a very weak condition in the sense that though it guaruntees synchronization, it only applies to a sall subset of what is observed to actually synchronize. The axiu value of a for which equation (1) ay be satisfied is a = 3 which in the case of the logistic ap is not even large enough to be chaotic, though the condition is irrespective of the exact ap. With that in ind the following analysis provides ore realistic bounds. Stronger Condition for Synchronization ) (1) We ust first describe a synchronized solution, y = f( x n ) 1, where 1 represents a vector of 1 s. The difference between the actual state of the lattice and the synchronized state is δ n = x n y n so that δ n+1 = F (C x n ) y n+1 It is convenient to rewrite this equation as see Notes y n+1 + δ n+1 = F ( y n + C δ n ) 3
4 By substituting y n + C δ n = x n so that the arguent of F becoes (1 )( y n + δ n ) + (1 )I + ] (R + L) ( y n + δ n = (1 + ) y n + (1 )I + ] (R + L) δn = y n + C δ n Recall that y n is a constant vector and therefore unaffected by the shift operators. We linearize around synchronization where δ n = y n+1 + δ n+1 F ( y n ) + F ( y n ) δ n +... where F ( y n ) is the Jacobian. Since y n+1 = F ( y n ), we ay cancel the two leaving δn+1 F ( y n )C δ n Now as the ap δ n is iterated N ties the factor F ( y n )C becoes the product N j=1 F (y j )C j, and we wish to see if on average δ n+1 is growing or shrinking. We know how to diagonalize C, call the diagonalized atrix D. iterations we take the Nth root, i.e. the geoetric ean N F (y j )D j j=1 N D F (y j ) j=1 1/N 1/N So for N In the liit as N, the geoetric ean of the product of the derivatives just becoes the lyapunov nuber for the logistic ap, e λ. This gives the equation δn+1 e λ D δ n We know the eigenvalues of D and this gives us an equation for the singular values ( ( )) πk s k = e λ 1 cos where k =, 1,..., 1. For synchronization we need all the singular values except s to be less than one. ( ) πk e λ (1 ) + cos < 1 Which gives the following condition for synchronization ( ) ) πk (cos < e λ The different odes correspond to frequencies of quasi-synchronization along the lattice. It is an observation that the total synchronization ode has never been blocked out, but another ode ay becoe ore proinent. 4
5 For the 3-lattice we get the condition 3 (1 e λ ) < < 3 (1 + e λ ) For aps larger than = 3 the expression can be refined by first letting k = 1 and then k = / if the lattice-size is even or k = ( ± 1)/ if it is odd. These are key odes to supress. For a general even size lattice we find for which 1 e λ 1 cos( π ) < < 1 + e λ 3 cos ( ) π λ ax = ln 1 + cos ( ) π The condition for odd lattice size just substitutes ± 1 for. An illustrative exaple is the case of the 4-lattice, where we find that and respectively. Solving for we get 1 < e λ 1 < e λ 1 e λ < < 1 + e λ 1 e λ < < 1 + e λ Taking the strictest conditions fro both equations we have 1 e λ < < 1 + e λ Fro this expression we ay solve for the axiu value of λ for which a lattice, 4, ay reliably synchronize: λ ax = ln 3. This does not apply to the 3-lattice which ay synchronize for all λ, however the range of decays exponentially with respect to increasing λ. If r is the length of the interval of then r = 4 3 e λ. Intuitively, it akes sense that if a ap is less chaotic, having a saller λ, then it should be easier to synchronize. Indeed for larger aps, synchronization ay only be stable for very sall λ. It is iportant to ake explicit what this condition actually says. All the condition can say is that if synchronization happens and satisfies these conditions then synchronization will be stable. However the data sees to relate very well to these bounds with the noted exception of the circle ap, which eans that there is still ore to be understood. There could be a fault in the progra or an unforseen phenoenon. 3 Data Matlab was used to odel a few lattices for a wide range of paraeters. The logistic ap and a torus ap x n+1 = ax n od 1 5
6 was used to test the synchronization conditions on the 4-lattice. In order to test for synchronization the standard deviation, σ, was taken of all the lattice points and then averaged over all iterations. Clearly if this σ avg is zero than the syste is fully synchronized. If we were interested in observing other synchronization odes, we can take the discrete fourier transfor over all the lattice ebers. Figure (1) shows a typical situation of a synchronizing lattice, in this case the lattice is a 4-lattice of logistic aps with logistic paraeter a = 3.9, corresponding to a lyapunov exponent of λ.516. Notice that in figure (1) there is an.4 Average STD vs. ε, n=4, a= σ avg λ Figure 1: Average Standard Deviation vs. Coupling Paraeter for the circle lattice of logistic aps, n=4 a=3.9 interval for which the standard deviation drops to zero. This is the range of the synchronization paraeter predicted by the theory to give stable synchronization. Figure () shows an exaple of a lattice which was outside the theoretical bounds for synchronization, the 4-lattice of logistic aps with a = 4. In both cases shown there are regions in which the standard deviation fors a sooth curve. If the lattice were copletely out of synchronization there would be no correlation at all in this region of the plot. Therefore these probably represent regions of quasi-synchronization and other ore coplicated behavior such as the eergence of fixed points. If we consider 4-lattices of varying chaoticness we can test the bounds of our theory. Figure (3) shows the synchronizing values of the coupling paraeter versus the lyapunov exponent for the logistic and torus aps. It wasn t until we considered a faily of circle aps x n+1 = x + a sin (πx) 6
7 .45 Average STD vs. ε, n=6, a= σ avg λ Figure : Average Standard Deviation vs. Coupling Paraeter for the circle lattice of logistic aps, n=6 a=4 od 1 that we found a counterexaple to the theoretical bounds, shown in figure (4). An interesting observation is that the there is a definite range of synchronizing paraeters which fit the theory and then there are outliers which don t. One ight be led to conclude that these ay be have an average standard deviation of zero but not be linearly stable and therefore the theory still stands, but in fact these were generated with initial conditions slightly perturbed fro synchronization so they are linearly stable points. 4 Conclusion Three different types of aps were looked at, two of which perfectly fit the bounds of synchronization. The third ap we looked at had an interval which fit the theory and outliers which didn t. Clearly there is ore to be understood here. 5 Future Plans For the next stage of the project we hope to answer soe of the questions which were raised in this report. Furtherore, we will look at the role that syetry plays in the synchronization of lattices. We have only looked at 7
8 ε sync vs λ Logistic Theoretical Bounds Circle Map Perturbed Logistic.7.6 ε λ ax λ Figure 3: Synchronizing Coupling Paraeter Values vs. Lyapunov Exponent circular lattices under diffusive which have rotational syetry and this allowed us to diagonalize the jacobian to find explicit equations for the singular values. So it is natural to consider other cases where we can diagonalize the jacobian, and aybe be able to ake a general stateent about synchronization in such lattices. However, the ain focus will be to study the flow of inforation in general coupled ap lattices. 6 Notes Consider soe arbitrary state vector x, and decopose it into a vector on the diagonal, x x y =. x and one perpendicular to the diagonal, δ, where x is the ean of the entries of the state vector. If we consider our lattice ap, F, which acts on the state vector x giving another vector F ( x) we ust know if F ( x) F ( y) is also perpendicular to the diagonal. This is because the following analysis depends on the existence of a synchronized solution which is the orbit of y and in order for the state 8
9 1..9 ε sync vs λ Theoretical Bounds Circle Map ε λ Figure 4: Synchronizing Coupling Paraeter Values vs. Lyapunov Exponent for the ap x n+1 = x + a sin (πx) od 1 with a =.16π solution to converge to the synchronized solution, δ n+1 = F ( x n ) F ( y n ) ust go to zero. If the singular values in every direction perpendicular to the diagonal are less than 1, and δ is perpendicular to the diagonal then it will go zero. To see that it is, consider F ( x) = F ( y + δ). Taylor expanding we find: which eans that F ( y + δ) = F ( y) + F ( y) δ +... F ( y + δ) F ( y) F ( y) δ And if this is perpendicular to the diagonal then the su of its eleents is zero, given that δ is already perpendicular. Observe F ( y) δ = f ( x)c δ (1 ) = f ( x) (1 ) (1 ) (1 ) δ δ 1 δ δ 3 = (1 )δ + δ 1 + δ 3 (1 )δ 1 + δ + δ (1 )δ + δ 1 + δ 3 (1 )δ 3 + δ + δ All factors cancel out and we are left with 3 k= δ k =, which eans that the new vector is perpendicular to the diagonal as required. With that in ind the preceding analysis applies. 9
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 informationModel 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 information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationChapter 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 informationVariations on Backpropagation
2 Variations on Backpropagation 2 Variations Heuristic Modifications Moentu Variable Learning Rate Standard Nuerical Optiization Conjugate Gradient Newton s Method (Levenberg-Marquardt) 2 2 Perforance
More informationBlock 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 informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationLecture #8-3 Oscillations, Simple Harmonic Motion
Lecture #8-3 Oscillations Siple Haronic Motion So far we have considered two basic types of otion: translation and rotation. But these are not the only two types of otion we can observe in every day life.
More informationPrincipal 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 information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationOBJECTIVES 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 informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationCOS 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 informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationOcean 420 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers
Ocean 40 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers 1. Hydrostatic Balance a) Set all of the levels on one of the coluns to the lowest possible density.
More informationIntelligent 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 informationPage 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011
Page Lab Eleentary Matri and Linear Algebra Spring 0 Nae Due /03/0 Score /5 Probles through 4 are each worth 4 points.. Go to the Linear Algebra oolkit site ransforing a atri to reduced row echelon for
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationCS Lecture 13. More Maximum Likelihood
CS 6347 Lecture 13 More Maxiu Likelihood Recap Last tie: Introduction to axiu likelihood estiation MLE for Bayesian networks Optial CPTs correspond to epirical counts Today: MLE for CRFs 2 Maxiu Likelihood
More informationThis 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 informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More informationPattern 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 informationTopic 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 informationE0 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 informationSome Perspective. Forces and Newton s Laws
Soe Perspective The language of Kineatics provides us with an efficient ethod for describing the otion of aterial objects, and we ll continue to ake refineents to it as we introduce additional types of
More informationReed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product.
Coding Theory Massoud Malek Reed-Muller Codes An iportant class of linear block codes rich in algebraic and geoetric structure is the class of Reed-Muller codes, which includes the Extended Haing code.
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationOn 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 informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationSupport 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 informationLean Walsh Transform
Lean Walsh Transfor Edo Liberty 5th March 007 inforal intro We show an orthogonal atrix A of size d log 4 3 d (α = log 4 3) which is applicable in tie O(d). By applying a rando sign change atrix S to the
More informationKernel 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 informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationSupport Vector Machines MIT Course Notes Cynthia Rudin
Support Vector Machines MIT 5.097 Course Notes Cynthia Rudin Credit: Ng, Hastie, Tibshirani, Friedan Thanks: Şeyda Ertekin Let s start with soe intuition about argins. The argin of an exaple x i = distance
More information16 Independence Definitions Potential Pitfall Alternative Formulation. mcs-ftl 2010/9/8 0:40 page 431 #437
cs-ftl 010/9/8 0:40 page 431 #437 16 Independence 16.1 efinitions Suppose that we flip two fair coins siultaneously on opposite sides of a roo. Intuitively, the way one coin lands does not affect the way
More informationLinear Transformations
Linear Transforations Hopfield Network Questions Initial Condition Recurrent Layer p S x W S x S b n(t + ) a(t + ) S x S x D a(t) S x S S x S a(0) p a(t + ) satlins (Wa(t) + b) The network output is repeatedly
More informationPhysics 139B Solutions to Homework Set 3 Fall 2009
Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about
More informationApproximation in Stochastic Scheduling: The Power of LP-Based Priority Policies
Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing
More informationThe 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 informationi ij j ( ) sin cos x y z x x x interchangeably.)
Tensor Operators Michael Fowler,2/3/12 Introduction: Cartesian Vectors and Tensors Physics is full of vectors: x, L, S and so on Classically, a (three-diensional) vector is defined by its properties under
More informationQualitative 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 informationNUMERICAL MODELLING OF THE TYRE/ROAD CONTACT
NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT PACS REFERENCE: 43.5.LJ Krister Larsson Departent of Applied Acoustics Chalers University of Technology SE-412 96 Sweden Tel: +46 ()31 772 22 Fax: +46 ()31
More informationProc. 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 informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationDERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS
DERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS N. van Erp and P. van Gelder Structural Hydraulic and Probabilistic Design, TU Delft Delft, The Netherlands Abstract. In probles of odel coparison
More informationANALYSIS 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 informationDonald Fussell. October 28, Computer Science Department The University of Texas at Austin. Point Masses and Force Fields.
s Vector Moving s and Coputer Science Departent The University of Texas at Austin October 28, 2014 s Vector Moving s Siple classical dynaics - point asses oved by forces Point asses can odel particles
More informationNow multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get:
Equal Area Criterion.0 Developent of equal area criterion As in previous notes, all powers are in per-unit. I want to show you the equal area criterion a little differently than the book does it. Let s
More informationUNCERTAINTIES IN THE APPLICATION OF ATMOSPHERIC AND ALTITUDE CORRECTIONS AS RECOMMENDED IN IEC STANDARDS
Paper Published on the16th International Syposiu on High Voltage Engineering, Cape Town, South Africa, 2009 UNCERTAINTIES IN THE APPLICATION OF ATMOSPHERIC AND ALTITUDE CORRECTIONS AS RECOMMENDED IN IEC
More informationlecture 36: Linear Multistep Mehods: Zero Stability
95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,
More informationFinding Rightmost Eigenvalues of Large Sparse. Non-symmetric Parameterized Eigenvalue Problems. Abstract. Introduction
Finding Rightost Eigenvalues of Large Sparse Non-syetric Paraeterized Eigenvalue Probles Applied Matheatics and Scientific Coputation Progra Departent of Matheatics University of Maryland, College Par,
More informationKinetic Theory of Gases: Elementary Ideas
Kinetic Theory of Gases: Eleentary Ideas 17th February 2010 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion
More informationIII.H Zeroth Order Hydrodynamics
III.H Zeroth Order Hydrodynaics As a first approxiation, we shall assue that in local equilibriu, the density f 1 at each point in space can be represented as in eq.iii.56, i.e. f 0 1 p, q, t = n q, t
More informationAbout 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 informationarxiv: v1 [cs.ds] 29 Jan 2012
A parallel approxiation algorith for ixed packing covering seidefinite progras arxiv:1201.6090v1 [cs.ds] 29 Jan 2012 Rahul Jain National U. Singapore January 28, 2012 Abstract Penghui Yao National U. Singapore
More informationThe Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters
journal of ultivariate analysis 58, 96106 (1996) article no. 0041 The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Paraeters H. S. Steyn
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationDeflation 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 informationma 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 informationENGI 3424 Engineering Mathematics Problem Set 1 Solutions (Sections 1.1 and 1.2)
ENGI 344 Engineering Matheatics Proble Set 1 Solutions (Sections 1.1 and 1.) 1. Find the general solution of the ordinary differential equation y 0 This ODE is not linear (due to the product y ). However,
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationA remark on a success rate model for DPA and CPA
A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance
More informationSupplementary Information for Design of Bending Multi-Layer Electroactive Polymer Actuators
Suppleentary Inforation for Design of Bending Multi-Layer Electroactive Polyer Actuators Bavani Balakrisnan, Alek Nacev, and Elisabeth Sela University of Maryland, College Park, Maryland 074 1 Analytical
More information#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES
#A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE7C (Spring 018: Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee7c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee7c@berkeley.edu October 15,
More informationKinetic Theory of Gases: Elementary Ideas
Kinetic Theory of Gases: Eleentary Ideas 9th February 011 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion of
More informationKinematics 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 informationThe Wilson Model of Cortical Neurons Richard B. Wells
The Wilson Model of Cortical Neurons Richard B. Wells I. Refineents on the odgkin-uxley Model The years since odgkin s and uxley s pioneering work have produced a nuber of derivative odgkin-uxley-like
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More information13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization
3 Haronic oscillator revisited: Dirac s approach and introduction to Second Quantization. Dirac cae up with a ore elegant way to solve the haronic oscillator proble. We will now study this approach. The
More informationLectures 8 & 9: The Z-transform.
Lectures 8 & 9: The Z-transfor. 1. Definitions. The Z-transfor is defined as a function series (a series in which each ter is a function of one or ore variables: Z[] where is a C valued function f : N
More informationFigure 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 informationSupporting Information for Supression of Auger Processes in Confined Structures
Supporting Inforation for Supression of Auger Processes in Confined Structures George E. Cragg and Alexander. Efros Naval Research aboratory, Washington, DC 20375, USA 1 Solution of the Coupled, Two-band
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationDistributed Subgradient Methods for Multi-agent Optimization
1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions
More informationGeneralized r-modes of the Maclaurin spheroids
PHYSICAL REVIEW D, VOLUME 59, 044009 Generalized r-odes of the Maclaurin spheroids Lee Lindblo Theoretical Astrophysics 130-33, California Institute of Technology, Pasadena, California 9115 Jaes R. Ipser
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationMA304 Differential Geometry
MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question
More information26 Impulse and Momentum
6 Ipulse and Moentu First, a Few More Words on Work and Energy, for Coparison Purposes Iagine a gigantic air hockey table with a whole bunch of pucks of various asses, none of which experiences any friction
More informationName Class Date. two objects depends on the masses of the objects.
CHAPTER 12 2 Gravity SECTION Forces KEY IDEAS As you read this section keep these questions in ind: What is free fall? How are weight and ass related? How does gravity affect the otion of objects? What
More informationA 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 informationlecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 38: Linear Multistep Methods: Absolute Stability, Part II
lecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 3: Linear Multistep Methods: Absolute Stability, Part II 5.7 Linear ultistep ethods: absolute stability At this point, it ay well
More informationReversibility of Turing Machine Computations
Reversiility of Turing Machine Coputations Zvi M. Kede NYU CS Technical Report TR-2013-956 May 13, 2013 Astract Since Bennett s 1973 seinal paper, there has een a growing interest in general-purpose, reversile
More informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More informationPattern 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 informationIn 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 informationGraphical 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 informationNote-A-Rific: Mechanical
Note-A-Rific: Mechanical Kinetic You ve probably heard of inetic energy in previous courses using the following definition and forula Any object that is oving has inetic energy. E ½ v 2 E inetic energy
More informationBloom Filters. filters: A survey, Internet Mathematics, vol. 1 no. 4, pp , 2004.
Bloo Filters References A. Broder and M. Mitzenacher, Network applications of Bloo filters: A survey, Internet Matheatics, vol. 1 no. 4, pp. 485-509, 2004. Li Fan, Pei Cao, Jussara Aleida, Andrei Broder,
More informationNB1140: Physics 1A - Classical mechanics and Thermodynamics Problem set 2 - Forces and energy Week 2: November 2016
NB1140: Physics 1A - Classical echanics and Therodynaics Proble set 2 - Forces and energy Week 2: 21-25 Noveber 2016 Proble 1. Why force is transitted uniforly through a assless string, a assless spring,
More informationMulti-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 informationDepartment of Physics Preliminary Exam January 3 6, 2006
Departent of Physics Preliinary Exa January 3 6, 2006 Day 1: Classical Mechanics Tuesday, January 3, 2006 9:00 a.. 12:00 p.. Instructions: 1. Write the answer to each question on a separate sheet of paper.
More informationPhysically Based Modeling CS Notes Spring 1997 Particle Collision and Contact
Physically Based Modeling CS 15-863 Notes Spring 1997 Particle Collision and Contact 1 Collisions with Springs Suppose we wanted to ipleent a particle siulator with a floor : a solid horizontal plane which
More informationNumerical Studies of a Nonlinear Heat Equation with Square Root Reaction Term
Nuerical Studies of a Nonlinear Heat Equation with Square Root Reaction Ter Ron Bucire, 1 Karl McMurtry, 1 Ronald E. Micens 2 1 Matheatics Departent, Occidental College, Los Angeles, California 90041 2
More informationAnalysis of Impulsive Natural Phenomena through Finite Difference Methods A MATLAB Computational Project-Based Learning
Analysis of Ipulsive Natural Phenoena through Finite Difference Methods A MATLAB Coputational Project-Based Learning Nicholas Kuia, Christopher Chariah, Mechatronics Engineering, Vaughn College of Aeronautics
More information