AT2 PROBLEM SET #3. Problem 1
|
|
|
- Kristian McDaniel
- 10 years ago
- Views:
Transcription
1 AT2 PROBLEM SET #3 Problem 1 We want to simulate a neuron with autapse. To make this we use Euler method and we simulated system for different initial values. (a) Neuron s activation function f = [50*(1 + tanh(x)) for x in linspace(-5,5,1000)] # list of f for s in [-5,5] plot(linspace(-5,5,1000),f) titre = 'Neuron\'s activation function' ylabel('firing rate [Hz]') xlabel('current [na]') # print the curve [1]
2 We can see that activation of neuron increase with the current which is inject in it. But augmentation is not linear. For weak input (less than -3nA), the neuron doesn t create spiking. Then, the firing rate is increasing more rapidly with a highest augmentation of firing rate for current (the curve look like the hyperbolic tangent that we use to create the dynamic of neuron). We observe finally a saturation: for current upper than 3nA, the maximum firing rate is 100 Hz. (b) Plot of dx/dt w = 0.04 # strength of the synaptic connection I = -2 #na # input list = linspace(0,120,10000) # differents values of firing rate x def f(x): # value of the sigmoidal function return 50*(1 + tanh(x)) [2]
3 dx = [-x + f(w*x+i) for x in list] # list of dx with the list values plot(list,dx) titre = 'dx in function of the neuron\'s firing rate' ylabel('devivate') xlabel('firing rate [Hz]') On this plot, the zero-crossings indicate that the derivate of x, dt, is null. So it s a fixe point of the dynamic system because x+dt = x. (c) Simulation of system w = 0.04 I = -2 # strength of the synaptic connection # na #input [3]
4 dt = 0.01 # ms # time steps sim_time = 50 #simulation time def f(x): # value of the sigmoidal function return 50*(1 + tanh(x)) for x0 in [49,50,51]: # we make simulation for differents x0 x = [] # we initialize x.append(x0) dx = [] dx.append(0) for i in arange(dt,sim_time,dt): # we make simulation x.append(x[-1] + (-x[-1] + f(w*x[-1]+i))*dt) # we use euler method dx.append(dt*(-x[-1] + f(w*x[-1]+i))) # we capture dx to plot orbite plot(arange(0,sim_time,dt),x) titre = 'Simulation of x over time for x0 = ' + str(x0) ylabel('firing rate [Hz]') xlabel('time [s]') plot(x,dx,'o') titre = 'Trajectory of x for x0 = ' + str(x0) ylabel('x\'') xlabel('x') We simulate the system for three initial conditions: - x(0) = 49 Here we see that 49 is not a fixe point. The trajectory is repulse by 50 and come to the fixe point near to zero. We see on the orbite that dx is decrease more and more rapidly when the point is next to 50. Then, [4]
5 when it is next to zero, the convergence speed is slower. The speed of convergence have a pic next to 30. This particular change of velocity is due to the hyperbolic tangent function in the dt calcul. - x(0) = 50 Here 50 is a fix point. So the firing rate stay the same all long the simulation. There is no evolution of orbite in the trajectory plan. - x(0) = 51 When initial condition is 51Hz, firing rate change to the fix point near to 100Hz. Like for x(0) = 49, velocity is increasing and decreasing during the trajectory, due to hyperbolic tangent function. (d) Noise in the system! import random [5]
6 w = 0.04 # strength of the synaptic connection I = -2 # input dt = 0.01 # time steps sim_time = 50 #simulation time def f(x): # value of the sigmoidal function return 50*(1 + tanh(x)) for sigma in [5, 80]: #sigma value for the noise for x0 in [49,50,51]: # we make simulation for differents x0 x = [] # we initialize x.append(x0) for i in arange(dt,sim_time,dt): # we make simulation x.append(x[-1] + (-x[-1] + f(w*x[-1]+i) + sigma * random.gauss(0,1))*dt) # we use euler method and put the noise term with sigma times a gaussian aleatory value plot(arange(0,sim_time,dt),x) titre = 'Simulation of x over time for x0 = ' + str(x0) + ' with noise sigma = ' +str (sigma) ylabel('firing rate [Hz]') xlabel('time [s]') Sigma = 5 Sigma = [6]
7 50 51 For a noise with a weak sigma, variance is small so we have the same curves that question c, with little variation due to white noise. For variance equal to 80, we have big variation in the signal. The white noise is too strong and the signal seems converge to zero in the three case for this example but they could converge to 100 Hz too. It s depend of in which side of 50Hz the signal come to at the beginning (it s random because of the white noise). Problem 2 We want to simulate two neurons network. Each neuron inhibited the other and they discharge spontaneously. (a) Null-clines of system import random [7]
8 w = -0.1 # strength of the synaptic connection I = 5 # na # input dt = 0.1 # ms list = linspace(0.001,99.999,1000) # list of x1 values def f(x): # value of the sigmoidal function return 50*(1 + tanh(x)) x = [] # we initialize for i in list: # we make simulation x.append(f(w*i+i)) # the nullcline have the same calcul for x1 and x2 # the code below it's to have the direction vectors on the plot L = 100 Dt = 5 u = [] v = [] for i in range(0,l+1,dt): u.append([]) v.append([]) for j in range(0,l+1,dt): u[i/dt].append((-i + f(w*j+i))*dt) v[i/dt].append((-j + f(w*i+i))*dt) # plot(list,x,x,list,list,[50 for i in list],'k--') # titre = 'Nullclines of the system' ylabel('x2') xlabel('x1') axis([-0.5,100.5,-0.5,100.5]) t= range(0,l+1,dt) z = range(0,l+1,dt) quiver(array(t), array(z), array(v), array(u), angles='xy', scale_units='xy', scale=1.5) [8]
9 It seems that they are three fix point in this system: (0,100), (100,0) and (50,50). We note that the fix point (50,50) is attractive if trajectory is on the diagonal (X1=X2) but repulsive otherwise. (b) Simulation of system import random w = -0.1 # strength of the synaptic connection list = linspace(0.001,99.999,1000) # list of x1 values I = 5 # na # input dt = 0.1 # ms time = 10 #time of the simulation def f(x): # value of the sigmoidal function return 50*(1 + tanh(x)) x = [] # we initialize for i in list: # we make simulation x.append(f(w*i+i)) # the nullcline have the same calcul for x1 and x2 [9]
10 plot(list,x,'y',x,list,'y') #plot of the two null isoclines list_initial = [(60,80),(99,99),(20,5)]# list of initial values for x1 and x2 for a,b in list_initial: x = -20*ones(time/dt) # vector of solution x1_init = a x2_init = b x[x1_init] = x2_init for i in arange(dt, time, dt): x1 = x1_init + (-x1_init + f(w*x2_init+i))*dt #find the next step value of x1 x2 = x2_init + (-x2_init + f(w*x1_init+i))*dt x1_init = x1 x2_init = x2 x[x1_init] = x2_init #append the value of x2 in the x1 emplacment plot(linspace(0,100,time/dt),x,'o') # the code below it's to have the direction vectors on the plot L = 100 Dt = 5 u = [] v = [] for i in range(0,l+1,dt): u.append([]) v.append([]) for j in range(0,l+1,dt): u[i/dt].append((-i + f(w*j+i))*dt) v[i/dt].append((-j + f(w*i+i))*dt) # titre = 'Simulation of system' ylabel('x2') xlabel('x1') axis([-0.5,100.5,-0.5,100.5]) t= range(0,l+1,dt) z = range(0,l+1,dt) quiver(array(t), array(z), array(v), array(u), angles='xy', scale_units='xy', scale=1.5) [10]
11 Here the initial conditions are: x(0) = (60,80) (blue), x(0) = (99,99) (green), x(0) = (20,5) (red). We can see that if initial condition are below the diagonal were X1= X2, dynamical system converge to (100,0), this means that neuron X1 firing a lot when X2 stop firing. If initial condition is above diagonal, inverse event occur: X2 firing a lot (100 Hz) and X1 stop firing. Finally, if X1 = X2 at the beginning, system converge to (50,50) : the two neurons firing with the same rate. (c) Matrix version import random w = -0.1 # strength of the synaptic connection I1 = 5 #na# input I2 = 5 #na list = linspace(0.001,99.999,1000) # list of x1 values dt = 0.1 # ms [11]
12 time = 10 #time of the simulation def f(x): # value of the sigmoidal function return array([[50],[50]])*(array([[1],[1]]) + array([[tanh(x[0][0])],[tanh(x[1][0])]])) x = [] # initialisation of vector x W = array([[0,w],[w,0]]) # initialisation of matrix W I = array([[i1],[i2]]) # initialisation of vector I for i in list: # we make simulation x.append(array([[i],f(dot(w,[[i],[i]])+i)[1]])) # we can plot x1 in function of x2 with the inverse function plot(list,[b[0] for [a,b] in x],'y',[b[0] for [a,b] in x],list,'y') #plot of the two null isoclines list_initial = [(60,80),(99,99),(20,5)]# list of initial values for x1 and x2 for a,b in list_initial: x = [] # initialisation of vector x x.append(array([[a],[b]])) for i in arange(dt, time, dt): x.append(x[-1] + (-x[-1] + f(dot(w,x[-1])+i))*[[dt],[dt]]) plot([a[0] for [a,b] in x],[b[0] for [a,b] in x],'.') titre = 'Simulation of system' ylabel('x2') xlabel('x1') axis([-0.5,100.5,-0.5,100.5]) [12]
13 Problem 3 We construct a Hopfield network in which each neurons is connect with the other (in this case). With this type of network, we can save patterns and system could converge to them. (a) An example of pattern import random N = 64 p = array([-1 if random.randint(0,1) == 0 else 1 for i in range (N)]) #create a 64 point vector p = p.reshape((8,8)) # reshape as a 8*8 matrix figure = pcolor(p) [13]
14 cbar = fig.colorbar(figure, ticks=[-1, 0, 1]) cbar.ax.set_yticklabels(['-1', '0', '1'])# vertically oriented colorbar titre = 'Pattern matrix' A blue square correspond at a -1 weight between two neurons and red correspond to a positive weight. (b) Evolution with one pattern stored in weight matrix import random N = 64.0 Ns = sqrt(n) dt = 0.1 T = 3.0 [14]
15 p = sign(rand(1,ns)-0.5) centered values W = (1/N)*p.T*p # weight matrix sigma = 0.1 dt = 0.1 figure = pcolor(p.t*p) #create a 8 point vector with cbar = fig.colorbar(figure, ticks=[-1, 0, 1]) cbar.ax.set_yticklabels(['-1', '0', '1'])# vertically oriented colorbar titre = 'p pattern' x = p.t*p+2*rand(ns,ns)*rand(ns,ns) #create the initial condition by vector of 64 point vector x = reshape(x,n) figure = pcolor(reshape(x,(ns,-1))) cbar = fig.colorbar(figure, ticks=[min(x), 0, max(x)]) cbar.ax.set_yticklabels([str(round(min(x),2)), '0', str(round(max(x),2))])# vertically oriented colorbar titre = 'Evolution of x at beginning' for j in range(1,int(t/dt)+1): # we make simulation print j x += (-x + sign(reshape(dot(w,reshape(x,(ns,ns))),n)) + sigma*randn(size(x)))*dt # evolution of system if j%int(t/dt/10) == 0 : #permitted to plot only 10 graph for a simulation figure = pcolor(reshape(x,(ns,-1))) # plot the image cbar = fig.colorbar(figure, ticks=[min(x), 0, max(x)]) cbar.ax.set_yticklabels([str(round(min(x),2)), '0', str(round(max(x),2))])# vertically oriented colorbar titre = 'Evolution of x at time ' + str(j*dt) [15]
16 We see that the initial pattern (which is near to p.t*p) converge to p.t*p. (c) Evolution with two patterns stored in weight matrix import random N = 64.0 Ns = sqrt(n) dt = 0.1 T = 10.0 p = sign(rand(1,ns)-0.5) #create a 8 point vector with centered values q = sign(rand(1,ns)-0.5) #create a 8 point vector with centered values W = (1/N)*(q.T*q + p.t*p) # weight matrix sigma = 0.1 dt = 0.1 figure = pcolor(q.t*q) cbar = fig.colorbar(figure, ticks=[-1, 0, 1]) cbar.ax.set_yticklabels(['-1', '0', '1'])# vertically oriented colorbar titre = 'q Matrix' figure = pcolor(p.t*p) cbar = fig.colorbar(figure, ticks=[-1, 0, 1]) cbar.ax.set_yticklabels(['-1', '0', '1'])# vertically oriented colorbar titre = 'p Matrix' figure = pcolor(w) cbar = fig.colorbar(figure, ticks=[min(w[0]), 0, max(w[0])]) cbar.ax.set_yticklabels([str(round(min(w[0]),2)), '0', str(round(max(w[0]),2))])# vertically oriented colorbar titre = 'W Matrix' x = q.t*q + 2*rand(Ns,Ns)*rand(Ns,Ns) #create the initial condition by vector of 64 point vector x = reshape(x,n) figure = pcolor(reshape(x,(ns,-1))) cbar = fig.colorbar(figure, ticks=[min(x), 0, max(x)]) [16]
17 cbar.ax.set_yticklabels([str(round(min(x),2)), '0', str(round(max(x),2))])# vertically oriented colorbar titre = 'Evolution of x at the beginning' for j in range(1,int(t/dt)+1): # we make simulation x += (-x + sign(reshape(dot(w,reshape(x,(ns,ns))),n)) + sigma*randn(size(x)))*dt # evolution of system if j%int(t/dt/10) == 0 : #permited to plot only 10 graph for a simulation print j figure = pcolor(reshape(x,(ns,-1))) # plot the image cbar = fig.colorbar(figure, ticks=[min(x), 0, max(x)]) cbar.ax.set_yticklabels([str(round(min(x),2)), '0', str(round(max(x),2))])# vertically oriented colorbar titre = 'Evolution of x at time ' + str(j*dt) Matrix W seems to be the weight difference between patterns for each connections. If we start with a patterns near to the pattern that we want, system converge through it. [17]
18 (d) General rule In the article Hertz, John A., Anders S. Krogh, and Richard G. Palmer. Introduction to the theory of neural computation, researchers saw that for 1000 connections in the Hopfield network, we have 138 patterns can be storage. So here we have 64 connection: we can store 8 patterns! For the code, if I replace sign by tanh, my pattern converge with less precision and all the matrix converge to zero. import random N = 64.0 Ns = sqrt(n) dt = 0.1 T = 10.0 p = sign(rand(1,ns)-0.5) #create a 8 point vector with centered values q = sign(rand(1,ns)-0.5) #create a 8 point vector with centered values W = (1/N)*(q.T*q + p.t*p) # weight matrix sigma = 0.1 dt = 0.1 figure = pcolor(q.t*q) cbar = fig.colorbar(figure, ticks=[-1, 0, 1]) cbar.ax.set_yticklabels(['-1', '0', '1'])# vertically oriented colorbar titre = 'q Matrix' figure = pcolor(p.t*p) cbar = fig.colorbar(figure, ticks=[-1, 0, 1]) cbar.ax.set_yticklabels(['-1', '0', '1'])# vertically oriented colorbar [18]
19 titre = 'p Matrix' figure = pcolor(w) cbar = fig.colorbar(figure, ticks=[min(w[0]), 0, max(w[0])]) cbar.ax.set_yticklabels([str(round(min(w[0]),2)), '0', str(round(max(w[0]),2))])# vertically oriented colorbar titre = 'W Matrix' x = q.t*q + 2*rand(Ns,Ns)*rand(Ns,Ns) #create the initial condition by vector of 64 point vector x = reshape(x,n) figure = pcolor(reshape(x,(ns,-1))) cbar = fig.colorbar(figure, ticks=[min(x), 0, max(x)]) cbar.ax.set_yticklabels([str(round(min(x),2)), '0', str(round(max(x),2))])# vertically oriented colorbar titre = 'Evolution of x at the beginning' for j in range(1,int(t/dt)+1): # we make simulation I = reshape(dot(w,reshape(x,(ns,ns))),n) for i in I : i = tanh(i) x += (-x + I)*dt # evolution of system if j%int(t/dt/10) == 0 : #permited to plot only 10 graph for a simulation print j figure = pcolor(reshape(x,(ns,-1))) # plot the image cbar = fig.colorbar(figure, ticks=[min(x), 0, max(x)]) cbar.ax.set_yticklabels([str(round(min(x),2)), '0', str(round(max(x),2))])# vertically oriented colorbar titre = 'Evolution of x at time ' + str(j*dt) [19]
MatLab - Systems of Differential Equations
Fall 2015 Math 337 MatLab - Systems of Differential Equations This section examines systems of differential equations. It goes through the key steps of solving systems of differential equations through
Exam 1 Sample Question SOLUTIONS. y = 2x
Exam Sample Question SOLUTIONS. Eliminate the parameter to find a Cartesian equation for the curve: x e t, y e t. SOLUTION: You might look at the coordinates and notice that If you don t see it, we can
15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
Compensation Basics - Bagwell. Compensation Basics. C. Bruce Bagwell MD, Ph.D. Verity Software House, Inc.
Compensation Basics C. Bruce Bagwell MD, Ph.D. Verity Software House, Inc. 2003 1 Intrinsic or Autofluorescence p2 ac 1,2 c 1 ac 1,1 p1 In order to describe how the general process of signal cross-over
by the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
STA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Statistics! [email protected]! http://www.cs.toronto.edu/~rsalakhu/ Lecture 6 Three Approaches to Classification Construct
Self Organizing Maps: Fundamentals
Self Organizing Maps: Fundamentals Introduction to Neural Networks : Lecture 16 John A. Bullinaria, 2004 1. What is a Self Organizing Map? 2. Topographic Maps 3. Setting up a Self Organizing Map 4. Kohonen
correct-choice plot f(x) and draw an approximate tangent line at x = a and use geometry to estimate its slope comment The choices were:
Topic 1 2.1 mode MultipleSelection text How can we approximate the slope of the tangent line to f(x) at a point x = a? This is a Multiple selection question, so you need to check all of the answers that
WEEK #3, Lecture 1: Sparse Systems, MATLAB Graphics
WEEK #3, Lecture 1: Sparse Systems, MATLAB Graphics Visualization of Matrices Good visuals anchor any presentation. MATLAB has a wide variety of ways to display data and calculation results that can be
Component Ordering in Independent Component Analysis Based on Data Power
Component Ordering in Independent Component Analysis Based on Data Power Anne Hendrikse Raymond Veldhuis University of Twente University of Twente Fac. EEMCS, Signals and Systems Group Fac. EEMCS, Signals
NCSS Statistical Software Principal Components Regression. In ordinary least squares, the regression coefficients are estimated using the formula ( )
Chapter 340 Principal Components Regression Introduction is a technique for analyzing multiple regression data that suffer from multicollinearity. When multicollinearity occurs, least squares estimates
L 2 : x = s + 1, y = s, z = 4s + 4. 3. Suppose that C has coordinates (x, y, z). Then from the vector equality AC = BD, one has
The line L through the points A and B is parallel to the vector AB = 3, 2, and has parametric equations x = 3t + 2, y = 2t +, z = t Therefore, the intersection point of the line with the plane should satisfy:
How long is the vector? >> length(x) >> d=size(x) % What are the entries in the matrix d?
MATLAB : A TUTORIAL 1. Creating vectors..................................... 2 2. Evaluating functions y = f(x), manipulating vectors. 4 3. Plotting............................................ 5 4. Miscellaneous
Least Squares Estimation
Least Squares Estimation SARA A VAN DE GEER Volume 2, pp 1041 1045 in Encyclopedia of Statistics in Behavioral Science ISBN-13: 978-0-470-86080-9 ISBN-10: 0-470-86080-4 Editors Brian S Everitt & David
Scientic Computing 2013 Computer Classes: Worksheet 11: 1D FEM and boundary conditions
Scientic Computing 213 Computer Classes: Worksheet 11: 1D FEM and boundary conditions Oleg Batrashev November 14, 213 This material partially reiterates the material given on the lecture (see the slides)
2+2 Just type and press enter and the answer comes up ans = 4
Demonstration Red text = commands entered in the command window Black text = Matlab responses Blue text = comments 2+2 Just type and press enter and the answer comes up 4 sin(4)^2.5728 The elementary functions
Objectives. Electric Current
Objectives Define electrical current as a rate. Describe what is measured by ammeters and voltmeters. Explain how to connect an ammeter and a voltmeter in an electrical circuit. Explain why electrons travel
Enhancing the SNR of the Fiber Optic Rotation Sensor using the LMS Algorithm
1 Enhancing the SNR of the Fiber Optic Rotation Sensor using the LMS Algorithm Hani Mehrpouyan, Student Member, IEEE, Department of Electrical and Computer Engineering Queen s University, Kingston, Ontario,
Understanding and Applying Kalman Filtering
Understanding and Applying Kalman Filtering Lindsay Kleeman Department of Electrical and Computer Systems Engineering Monash University, Clayton 1 Introduction Objectives: 1. Provide a basic understanding
www.mathsbox.org.uk ab = c a If the coefficients a,b and c are real then either α and β are real or α and β are complex conjugates
Further Pure Summary Notes. Roots of Quadratic Equations For a quadratic equation ax + bx + c = 0 with roots α and β Sum of the roots Product of roots a + b = b a ab = c a If the coefficients a,b and c
Lecture 6. Artificial Neural Networks
Lecture 6 Artificial Neural Networks 1 1 Artificial Neural Networks In this note we provide an overview of the key concepts that have led to the emergence of Artificial Neural Networks as a major paradigm
Regression Analysis: A Complete Example
Regression Analysis: A Complete Example This section works out an example that includes all the topics we have discussed so far in this chapter. A complete example of regression analysis. PhotoDisc, Inc./Getty
PSTricks. pst-ode. A PSTricks package for solving initial value problems for sets of Ordinary Differential Equations (ODE), v0.7.
PSTricks pst-ode A PSTricks package for solving initial value problems for sets of Ordinary Differential Equations (ODE), v0.7 27th March 2014 Package author(s): Alexander Grahn Contents 2 Contents 1 Introduction
Gamma Distribution Fitting
Chapter 552 Gamma Distribution Fitting Introduction This module fits the gamma probability distributions to a complete or censored set of individual or grouped data values. It outputs various statistics
Computer exercise 2: Least Mean Square (LMS)
1 Computer exercise 2: Least Mean Square (LMS) This computer exercise deals with the LMS algorithm, which is derived from the method of steepest descent by replacing R = E{u(n)u H (n)} and p = E{u(n)d
/SOLUTIONS/ where a, b, c and d are positive constants. Study the stability of the equilibria of this system based on linearization.
echnische Universiteit Eindhoven Faculteit Elektrotechniek NIE-LINEAIRE SYSEMEN / NEURALE NEWERKEN (P6) gehouden op donderdag maart 7, van 9: tot : uur. Dit examenonderdeel bestaat uit 8 opgaven. /SOLUIONS/
Intro to scientific programming (with Python) Pietro Berkes, Brandeis University
Intro to scientific programming (with Python) Pietro Berkes, Brandeis University Next 4 lessons: Outline Scientific programming: best practices Classical learning (Hoepfield network) Probabilistic learning
Nonlinear Systems of Ordinary Differential Equations
Differential Equations Massoud Malek Nonlinear Systems of Ordinary Differential Equations Dynamical System. A dynamical system has a state determined by a collection of real numbers, or more generally
Example: Credit card default, we may be more interested in predicting the probabilty of a default than classifying individuals as default or not.
Statistical Learning: Chapter 4 Classification 4.1 Introduction Supervised learning with a categorical (Qualitative) response Notation: - Feature vector X, - qualitative response Y, taking values in C
PES INSTITUTE OF TECHNOLOGY B.E 5TH SEMESTER (AUTONOMOUS) - PROVISIONAL RESULTS JANUARY 2015 COMPUTER SCIENCE AND ENGINEERING BRANCH
1 1PI12CS002 A A A A A B A A NA S NA NA NA NA NA NA NA 25.0 25.0 9.04 2 1PI12CS004 B I B C B A A A NA NA NA S NA NA NA NA NA 21.0 21.0 8.14 3 1PI12CS005 B B C B B B A B A NA NA NA NA NA NA NA NA 25.0 25.0
How To Run Statistical Tests in Excel
How To Run Statistical Tests in Excel Microsoft Excel is your best tool for storing and manipulating data, calculating basic descriptive statistics such as means and standard deviations, and conducting
Template for parameter estimation with Matlab Optimization Toolbox; including dynamic systems
Template for parameter estimation with Matlab Optimization Toolbox; including dynamic systems 1. Curve fitting A weighted least squares fit for a model which is less complicated than the system that generated
Numerical Solution of Differential Equations
Numerical Solution of Differential Equations Dr. Alvaro Islas Applications of Calculus I Spring 2008 We live in a world in constant change We live in a world in constant change We live in a world in constant
Time Domain and Frequency Domain Techniques For Multi Shaker Time Waveform Replication
Time Domain and Frequency Domain Techniques For Multi Shaker Time Waveform Replication Thomas Reilly Data Physics Corporation 1741 Technology Drive, Suite 260 San Jose, CA 95110 (408) 216-8440 This paper
Variance Reduction. Pricing American Options. Monte Carlo Option Pricing. Delta and Common Random Numbers
Variance Reduction The statistical efficiency of Monte Carlo simulation can be measured by the variance of its output If this variance can be lowered without changing the expected value, fewer replications
1 Example of Time Series Analysis by SSA 1
1 Example of Time Series Analysis by SSA 1 Let us illustrate the 'Caterpillar'-SSA technique [1] by the example of time series analysis. Consider the time series FORT (monthly volumes of fortied wine sales
Server Load Prediction
Server Load Prediction Suthee Chaidaroon ([email protected]) Joon Yeong Kim ([email protected]) Jonghan Seo ([email protected]) Abstract Estimating server load average is one of the methods that
On Motion of Robot End-Effector using the Curvature Theory of Timelike Ruled Surfaces with Timelike Directrix
Malaysian Journal of Mathematical Sciences 8(2): 89-204 (204) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES Journal homepage: http://einspem.upm.edu.my/journal On Motion of Robot End-Effector using the Curvature
Tutorial on Markov Chain Monte Carlo
Tutorial on Markov Chain Monte Carlo Kenneth M. Hanson Los Alamos National Laboratory Presented at the 29 th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Technology,
Algebra I Vocabulary Cards
Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Absolute Value Order of Operations Expression
Chapter 3 RANDOM VARIATE GENERATION
Chapter 3 RANDOM VARIATE GENERATION In order to do a Monte Carlo simulation either by hand or by computer, techniques must be developed for generating values of random variables having known distributions.
Visualizing Differential Equations Slope Fields. by Lin McMullin
Visualizing Differential Equations Slope Fields by Lin McMullin The topic of slope fields is new to the AP Calculus AB Course Description for the 2004 exam. Where do slope fields come from? How should
Appendix 4 Simulation software for neuronal network models
Appendix 4 Simulation software for neuronal network models D.1 Introduction This Appendix describes the Matlab software that has been made available with Cerebral Cortex: Principles of Operation (Rolls
ANALYTICAL METHODS FOR ENGINEERS
UNIT 1: Unit code: QCF Level: 4 Credit value: 15 ANALYTICAL METHODS FOR ENGINEERS A/601/1401 OUTCOME - TRIGONOMETRIC METHODS TUTORIAL 1 SINUSOIDAL FUNCTION Be able to analyse and model engineering situations
Virtual Network Topology Control with Oja and APEX Learning
Virtual Network Topology Control with Oja and Learning Y. Sinan Hanay, Yuki Koizumi, Shin ichi Arakawa and Masayuki Murata Graduate School of Information Sciences and Technology Osaka University Suita,
Hedging Exotic Options
Kai Detlefsen Wolfgang Härdle Center for Applied Statistics and Economics Humboldt-Universität zu Berlin Germany introduction 1-1 Models The Black Scholes model has some shortcomings: - volatility is not
Index-Velocity Rating Development for Rapidly Changing Flows in an Irrigation Canal Using Broadband StreamPro ADCP and ChannelMaster H-ADCP
Index-Velocity Rating Development for Rapidly Changing Flows in an Irrigation Canal Using Broadband StreamPro ADCP and ChannelMaster H-ADCP HENING HUANG, RD Instruments, 9855 Businesspark Avenue, San Diego,
Comparing Neural Networks and ARMA Models in Artificial Stock Market
Comparing Neural Networks and ARMA Models in Artificial Stock Market Jiří Krtek Academy of Sciences of the Czech Republic, Institute of Information Theory and Automation. e-mail: [email protected]
ADVANCED APPLICATIONS OF ELECTRICAL ENGINEERING
Development of a Software Tool for Performance Evaluation of MIMO OFDM Alamouti using a didactical Approach as a Educational and Research support in Wireless Communications JOSE CORDOVA, REBECA ESTRADA
E190Q Lecture 5 Autonomous Robot Navigation
E190Q Lecture 5 Autonomous Robot Navigation Instructor: Chris Clark Semester: Spring 2014 1 Figures courtesy of Siegwart & Nourbakhsh Control Structures Planning Based Control Prior Knowledge Operator
Metrics on SO(3) and Inverse Kinematics
Mathematical Foundations of Computer Graphics and Vision Metrics on SO(3) and Inverse Kinematics Luca Ballan Institute of Visual Computing Optimization on Manifolds Descent approach d is a ascent direction
How to compute Random acceleration, velocity, and displacement values from a breakpoint table.
How to compute Random acceleration, velocity, and displacement values from a breakpoint table. A random spectrum is defined as a set of frequency and amplitude breakpoints, like these: 0.050 Acceleration
Motion Graphs. It is said that a picture is worth a thousand words. The same can be said for a graph.
Motion Graphs It is said that a picture is worth a thousand words. The same can be said for a graph. Once you learn to read the graphs of the motion of objects, you can tell at a glance if the object in
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
Evaluating System Suitability CE, GC, LC and A/D ChemStation Revisions: A.03.0x- A.08.0x
CE, GC, LC and A/D ChemStation Revisions: A.03.0x- A.08.0x This document is believed to be accurate and up-to-date. However, Agilent Technologies, Inc. cannot assume responsibility for the use of this
AP Calculus BC 2001 Free-Response Questions
AP Calculus BC 001 Free-Response Questions The materials included in these files are intended for use by AP teachers for course and exam preparation in the classroom; permission for any other use must
Cooling and Euler's Method
Lesson 2: Cooling and Euler's Method 2.1 Applied Problem. Heat transfer in a mass is very important for a number of objects such as cooling of electronic parts or the fabrication of large beams. Although
Two Topics in Parametric Integration Applied to Stochastic Simulation in Industrial Engineering
Two Topics in Parametric Integration Applied to Stochastic Simulation in Industrial Engineering Department of Industrial Engineering and Management Sciences Northwestern University September 15th, 2014
Making Accurate Voltage Noise and Current Noise Measurements on Operational Amplifiers Down to 0.1Hz
Author: Don LaFontaine Making Accurate Voltage Noise and Current Noise Measurements on Operational Amplifiers Down to 0.1Hz Abstract Making accurate voltage and current noise measurements on op amps in
2013 MBA Jump Start Program. Statistics Module Part 3
2013 MBA Jump Start Program Module 1: Statistics Thomas Gilbert Part 3 Statistics Module Part 3 Hypothesis Testing (Inference) Regressions 2 1 Making an Investment Decision A researcher in your firm just
POTENTIAL OF STATE-FEEDBACK CONTROL FOR MACHINE TOOLS DRIVES
POTENTIAL OF STATE-FEEDBACK CONTROL FOR MACHINE TOOLS DRIVES L. Novotny 1, P. Strakos 1, J. Vesely 1, A. Dietmair 2 1 Research Center of Manufacturing Technology, CTU in Prague, Czech Republic 2 SW, Universität
The Wondrous World of fmri statistics
Outline The Wondrous World of fmri statistics FMRI data and Statistics course, Leiden, 11-3-2008 The General Linear Model Overview of fmri data analysis steps fmri timeseries Modeling effects of interest
Multivariate Normal Distribution
Multivariate Normal Distribution Lecture 4 July 21, 2011 Advanced Multivariate Statistical Methods ICPSR Summer Session #2 Lecture #4-7/21/2011 Slide 1 of 41 Last Time Matrices and vectors Eigenvalues
A Simple Feature Extraction Technique of a Pattern By Hopfield Network
A Simple Feature Extraction Technique of a Pattern By Hopfield Network A.Nag!, S. Biswas *, D. Sarkar *, P.P. Sarkar *, B. Gupta **! Academy of Technology, Hoogly - 722 *USIC, University of Kalyani, Kalyani
a. all of the above b. none of the above c. B, C, D, and F d. C, D, F e. C only f. C and F
FINAL REVIEW WORKSHEET COLLEGE ALGEBRA Chapter 1. 1. Given the following equations, which are functions? (A) y 2 = 1 x 2 (B) y = 9 (C) y = x 3 5x (D) 5x + 2y = 10 (E) y = ± 1 2x (F) y = 3 x + 5 a. all
Data Mining and Visualization
Data Mining and Visualization Jeremy Walton NAG Ltd, Oxford Overview Data mining components Functionality Example application Quality control Visualization Use of 3D Example application Market research
TMA4213/4215 Matematikk 4M/N Vår 2013
Norges teknisk naturvitenskapelige universitet Institutt for matematiske fag TMA43/45 Matematikk 4M/N Vår 3 Løsningsforslag Øving a) The Fourier series of the signal is f(x) =.4 cos ( 4 L x) +cos ( 5 L
An Introduction to Neural Networks
An Introduction to Vincent Cheung Kevin Cannons Signal & Data Compression Laboratory Electrical & Computer Engineering University of Manitoba Winnipeg, Manitoba, Canada Advisor: Dr. W. Kinsner May 27,
AIMMS Function Reference - Arithmetic Functions
AIMMS Function Reference - Arithmetic Functions This file contains only one chapter of the book. For a free download of the complete book in pdf format, please visit www.aimms.com Aimms 3.13 Part I Function
Harmonic oscillations of spiral springs Springs linked in parallel and in series
.3.26 Related topics Spring constant, Hooke s Law, oscillations, limit of elasticity, parallel springs, serial springs, use of an interface. Principle and task The spring constant D is determined for different
Robot Perception Continued
Robot Perception Continued 1 Visual Perception Visual Odometry Reconstruction Recognition CS 685 11 Range Sensing strategies Active range sensors Ultrasound Laser range sensor Slides adopted from Siegwart
MIMO CHANNEL CAPACITY
MIMO CHANNEL CAPACITY Ochi Laboratory Nguyen Dang Khoa (D1) 1 Contents Introduction Review of information theory Fixed MIMO channel Fading MIMO channel Summary and Conclusions 2 1. Introduction The use
Chapter 2 The Research on Fault Diagnosis of Building Electrical System Based on RBF Neural Network
Chapter 2 The Research on Fault Diagnosis of Building Electrical System Based on RBF Neural Network Qian Wu, Yahui Wang, Long Zhang and Li Shen Abstract Building electrical system fault diagnosis is the
GeoGebra. 10 lessons. Gerrit Stols
GeoGebra in 10 lessons Gerrit Stols Acknowledgements GeoGebra is dynamic mathematics open source (free) software for learning and teaching mathematics in schools. It was developed by Markus Hohenwarter
Manufacturing Equipment Modeling
QUESTION 1 For a linear axis actuated by an electric motor complete the following: a. Derive a differential equation for the linear axis velocity assuming viscous friction acts on the DC motor shaft, leadscrew,
Estimating the Average Value of a Function
Estimating the Average Value of a Function Problem: Determine the average value of the function f(x) over the interval [a, b]. Strategy: Choose sample points a = x 0 < x 1 < x 2 < < x n 1 < x n = b and
System Identification for Acoustic Comms.:
System Identification for Acoustic Comms.: New Insights and Approaches for Tracking Sparse and Rapidly Fluctuating Channels Weichang Li and James Preisig Woods Hole Oceanographic Institution The demodulation
Lecture 3: Linear methods for classification
Lecture 3: Linear methods for classification Rafael A. Irizarry and Hector Corrada Bravo February, 2010 Today we describe four specific algorithms useful for classification problems: linear regression,
7 Time series analysis
7 Time series analysis In Chapters 16, 17, 33 36 in Zuur, Ieno and Smith (2007), various time series techniques are discussed. Applying these methods in Brodgar is straightforward, and most choices are
Multivariate Analysis of Variance (MANOVA)
Chapter 415 Multivariate Analysis of Variance (MANOVA) Introduction Multivariate analysis of variance (MANOVA) is an extension of common analysis of variance (ANOVA). In ANOVA, differences among various
Lecture 5 Least-squares
EE263 Autumn 2007-08 Stephen Boyd Lecture 5 Least-squares least-squares (approximate) solution of overdetermined equations projection and orthogonality principle least-squares estimation BLUE property
Classroom Tips and Techniques: The Student Precalculus Package - Commands and Tutors. Content of the Precalculus Subpackage
Classroom Tips and Techniques: The Student Precalculus Package - Commands and Tutors Robert J. Lopez Emeritus Professor of Mathematics and Maple Fellow Maplesoft This article provides a systematic exposition
Convolution. 1D Formula: 2D Formula: Example on the web: http://www.jhu.edu/~signals/convolve/
Basic Filters (7) Convolution/correlation/Linear filtering Gaussian filters Smoothing and noise reduction First derivatives of Gaussian Second derivative of Gaussian: Laplacian Oriented Gaussian filters
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
The Image Deblurring Problem
page 1 Chapter 1 The Image Deblurring Problem You cannot depend on your eyes when your imagination is out of focus. Mark Twain When we use a camera, we want the recorded image to be a faithful representation
Orbital Mechanics. Angular Momentum
Orbital Mechanics The objects that orbit earth have only a few forces acting on them, the largest being the gravitational pull from the earth. The trajectories that satellites or rockets follow are largely
the points are called control points approximating curve
Chapter 4 Spline Curves A spline curve is a mathematical representation for which it is easy to build an interface that will allow a user to design and control the shape of complex curves and surfaces.
Magruder Statistics & Data Analysis
Magruder Statistics & Data Analysis Caution: There will be Equations! Based Closely On: Program Model The International Harmonized Protocol for the Proficiency Testing of Analytical Laboratories, 2006
AP Calculus BC 2006 Free-Response Questions
AP Calculus BC 2006 Free-Response Questions The College Board: Connecting Students to College Success The College Board is a not-for-profit membership association whose mission is to connect students to
Advanced Microeconomics
Advanced Microeconomics Ordinal preference theory Harald Wiese University of Leipzig Harald Wiese (University of Leipzig) Advanced Microeconomics 1 / 68 Part A. Basic decision and preference theory 1 Decisions
Average rate of change of y = f(x) with respect to x as x changes from a to a + h:
L15-1 Lecture 15: Section 3.4 Definition of the Derivative Recall the following from Lecture 14: For function y = f(x), the average rate of change of y with respect to x as x changes from a to b (on [a,
Least-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
EDEXCEL NATIONAL CERTIFICATE/DIPLOMA UNIT 5 - ELECTRICAL AND ELECTRONIC PRINCIPLES NQF LEVEL 3 OUTCOME 4 - ALTERNATING CURRENT
EDEXCEL NATIONAL CERTIFICATE/DIPLOMA UNIT 5 - ELECTRICAL AND ELECTRONIC PRINCIPLES NQF LEVEL 3 OUTCOME 4 - ALTERNATING CURRENT 4 Understand single-phase alternating current (ac) theory Single phase AC
1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
Linear Algebra and TI 89
Linear Algebra and TI 89 Abdul Hassen and Jay Schiffman This short manual is a quick guide to the use of TI89 for Linear Algebra. We do this in two sections. In the first section, we will go over the editing
Fitting Subject-specific Curves to Grouped Longitudinal Data
Fitting Subject-specific Curves to Grouped Longitudinal Data Djeundje, Viani Heriot-Watt University, Department of Actuarial Mathematics & Statistics Edinburgh, EH14 4AS, UK E-mail: [email protected] Currie,
Mini-project in TSRT04: Cell Phone Coverage
Mini-project in TSRT04: Cell hone Coverage 19 August 2015 1 roblem Formulation According to the study Swedes and Internet 2013 (Stiftelsen för Internetinfrastruktur), 99% of all Swedes in the age 12-45
