It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );
|
|
- Georgiana Gregory
- 5 years ago
- Views:
Transcription
1 Mah 467 Homework Se : some soluions > wih(deools): wih(plos): Warning, he name changecoords has been redefined Problem :..7 Find he fixed poins, deermine heir sabiliy, for x( ) = cos x e x > plo(cos(x) - exp(x),x = -5*Pi..Pi,y=-..); y x I is easier o visualize ploing he curves of cos x and e x separaely: > plo({cos(x),exp(x)},x = -5*Pi..Pi,y = -.4..);.5 y x.5 The fixed poins are a he inersecions of hese wo curves. Le s find he firs few numerically, specifying he inervals for he numerical soluion, which we know from he behaviour of cos x: > x := fsolve(exp(x)-cos(x),x,-..); x := fsolve(exp(x)-cos(x),x,-pi..-);
2 x := fsolve(exp(x)-cos(x),x,-pi..-); x := fsolve(exp(x)-cos(x),x,-*pi..-pi); x3 := fsolve(exp(x)-cos(x),x,-3*pi..-*pi); x4 := fsolve(exp(x)-cos(x),x,-4*pi..-3*pi); x :=. x := x := x3 := x4 := We observe ha he roos xk for k are close o he zeros of cos x, since e x is small: > evalf(seq(-(k-/)*pi,k=..4)); , , From he sign of cos x, we can see ha he fixed poins xk are sable if k is odd, and unsable if k is even. We can deduce he qualiaive behaviour of he soluions from he fixed poins and heir sabiliy. Direc numerical inegraion using Maple gives: > eqp := diff(x(),) = exp(x()) - cos(x()); iniconds := [[x()=],[x()=],[x()=-],[x()=-],[x()=-4],[x()=x],[x() =-5],[x()=-7], [x()=-8]]: DEplo(eqp,x(),=..8,x=-9..,iniconds,linecolor=black,sepsi ze=.); > eqp := x( ) = e x( ) cos ( x( ) ) e x x() A closed-form analyical soluion is no available, since i would require he inegraion of e x cos x.
3 Problem :..8 We seek a dynamical sysem yielding he given flow. A possible answer is given by d x( ) = ( x + ) x( x ) d > eqp := diff(x(),) = (x()+)^ * x() * (x()-): iniconds := [[x()=-.5],[x()=-],[x()=-.8],[x()=],[x()=.], [x()=],[x()=.]]: DEplo(eqp,x(),=..5,x=-..3,iniconds,linecolor=black,seps ize=.); 3 x() This is one of many possible answers; ohers are obained by muliplying he vecor field by g( x ), where g is posiive excep possibly a one or more of he fixed poins. Problem 3:..3 - he Skydiver > m := m : g := g : k := k : eqp3 := diff(v(),) = g - k*v()^/m; k v( ) eqp3 := v( ) = g m The command odeadvisor indicaes he soluion mehod for his firs-order ODE. > odeadvisor(eqp3); [_quadraure] To find he soluion, we separae variables, and inegrae; he inegraion of ( a v ) (-) (where gm a = ) is bes performed using parial fracions. Maple can also solve his equaion k analyically: dsolve(eqp3);
4 v( ) = anh g m k ( + _C) m k g m k mg In fac, his soluion is only valid if m, g and k are all posiive, and if < v( ). I seems ha k Maple auomaically made hese assumpions; in his case hey are jusified, bu his example shows ha in general Maple s analyical soluions are no always reliable: do he calculaions by hand, and show your working! (you can use Maple o check, if you like). Tha is, he soluion produced by Maple is only he general soluion for a < v( ) (he problem is o ake care wih absolue value signs...). We can find he paricular soluion saisfying he iniial condiion v( ) = : > solp3 := rhs(dsolve({eqp3,v()=})); g m k anh g m k m solp3 := k Now we can use Maple o find he asympoic behaviour: > limi(solp3,=infiniy); g m k anh g m k m lim k Evidenly, now (finally!) Maple is concerned abou he sign of he variables. Le s ry specifying ha all variables are posiive: > limi(solp3,=infiniy) assuming (g>,m>,k>); g m k k This gives he correc erminal velociy. We can wrie he formula for v( ) in erms of he erminal velociy V: vsol := simplify(subs(m=k*v^/g,solp3)) assuming (k>,v>); vsol := anh g V V This answer is much more easily obained by he graphical mehod. We plo dv d agains v (choosing some values of he variables): g := : m :=.: k := : plo(g - k*v*v/m,v= ); m := m : g := g : k := k :
5 5 v Now le s use he numbers given: The average velociy is (in f/sec) Vavg := (34-)/6; evalf(vavg); 735 Vavg := ds The disance ravelled as a funcion of ime is s( ) saisfying = v and s( ) =. d s := in(vsol,) assuming (V>,g>); V ln anh g V ln anh g + V V s := g g This soluion doesn look oo correc: i is giving negaive argumens of he ln funcion (and is hus complex-valued). Le s ry o help Maple a bi, by performing he appropriae subsiuion by hand... s := In(vsol,) assuming (V>,g>); > s3 := value(suden[changevar](au=*g/v,s,au)); > s := subs(au=*g/v,s3); s := anh g d V V s3 := V ln ( cosh( τ) ) g V ln cosh g V s := g > g := 3.: := 6: s; dis := 34-;
6 > g := 3.: := 6: s; dis := 34-; solve(s=dis,v); V ln cosh V dis := In he command solve, Maple aemps an analyical soluion; in his case i ges i wrong (I m no sure why; bu he given value is he average velociy compued previously, which canno also be he erminal velociy). For a problem wih purely floaing-poin soluions, we should use fsolve (and look for he posiive soluion): Verm := fsolve(s=dis,v,v=..infiniy); Verm := From his value of he erminal velociy, we can compue he drag consan k. Noe ha he weigh (in pounds) is mg. weigh := 6.: kdrag := solve(sqr(weigh/k)=verm,k); kdrag := > m := m : g := g : k := k : s := s : := : Problem 4:.3. - Auocaalysis The fixed poins are readily found o be and k_ a k_ (-) > fp4 := k_*a*x - km_*x^; solve(fp4,x); fp4 := k_ a x km_ x, k_ a km_ x = is unsable, he oher fixed poin is sable. We can do a quick graphical analysis, and plo some ypical soluions, if we assume values for he consans: a := : k_ := : km_ := : plo(fp4,x= );. x > DEplo(diff(x(),)=a*k_*x()-km_*x()^,x(),=..5,x=-...,[[x()=-.],[x()=.],[x()=.7],[x()=.7]],linecolor=black)
7 ,[[x()=-.],[x()=.],[x()=.7],[x()=.7]],linecolor=black) ;.5 x() Problem 5: Tumour growh We plo he vecor field and some soluions for some values of a and b: > a :=.: b :=.75: plo(-a*n*ln(b*n),n=..);.5 N Clearly he fixed poin N = is unsable, and N = is sable. b > DEplo(diff(N(),)=-a*N()*ln(b*N()),N(),=..5,N=-...,[[N ()=.],[N()=.],[N()=.8]],linecolor=black);
8 .5 N() Problem 6: Pichfork bifurcaion > f6 := (x,a) -> a*x - x^3; f6 := ( x, a) a x x 3 We plo he hree vecor fields nex o each oher, using he array funcion: p6a := plo(f6(x,-),x= ,y=-..,ickmarks=[,]): p6b := plo(f6(x,),x= ,y=-..,ickmarks=[,]): p6c := plo(f6(x,),x= ,y=-..,ickmarks=[,]): > plos6 := array(..,..3): plos6[,]:=p6a: plos6[,]:=p6b: plos6[,3]:=p6c: display(plos6); y y y x x x
9 For a, here is a unique fixed poin a x =, which is sable; for a < his is found by linear sabiliy analysis (since f () = a < ), while for a =, linear sabiliy analysis does no prove sabiliy (decay owards he origin is slower han exponenial - see he nex problem), bu a look a he plo of x 3 shows ha he origin is sable. If < a, here are hree fixed poins, a x =, x = a and x = a. Now f () = a is posiive, so he origin is unsable, while he oher wo fixed poins are sable, wih f = a. This is also apparen from he graphs. > Problem 7: Criical slowing down Rese variables: x := x : > eqp7 := diff(x(),) = - x()^3; eqp7 := x( ) = x( ) 3 Find he analyical soluion wih arbirary iniial condiion: xsa := dsolve({eqp7,x()=x},x()) assuming x>; xsb := dsolve({eqp7,x()=x},x()) assuming x<; xsz := dsolve({eqp7,x()=},x()); xsa := x( ) = + x xsb := x( ) = + x xsz := x( ) = > limi(xsa,=infiniy); limi(xsb,=infiniy); lim x( ) = lim x( ) = So he soluions approach zero for arbirary iniial condiions; however, he decay is proporional o, no exponenial. dx We plo he soluions of his equaion and of = x on he same graph: d lineq := diff(x(),) = -x(): linsoln := dsolve({lineq,x()=},x()); crisoln := dsolve({eqp7,x()=},x()); linsoln := x( ) = e ( )
10 crisoln := x( ) = + > plo([rhs(linsoln),rhs(crisoln)],=..); dx Noe ha he soluion o = x 3 decays much more rapidly iniially, bu hen slows down once d x <. Problem 8:.5. - Reaching origin in finie ime The origin x = is a sable fixed poin for any real < c. We plo a few represenaive vecor fields: > plo(-x^(/),x=..,ickmarks=[,]); plo(-x^,x=..4,-4...5,ickmarks=[,]); plo(-x^,x=..,y=-4...5,ickmarks=[,]);
11 We know ha for c =, he decay owards he origin is exponenial, and x approaches asympoically. When < c, he decay is slower han exponenial, as we derived in Problem 7. So he only possibiliy for he soluion o decay o zero in finie ime is for c <. The ime aken from x = o x = is T = in(-/x^c,x=..); x ( c + ) T = lim x + c When < c, he limi diverges; when c =, T is also infinie ( T = lim ln x). When c <, he ime is finie: T = in(-/x^c,x=..) assuming c < ; Problem 9:.5. - Blow-up T = c dy We know ha soluions y( ) of = + y blow up in finie ime. Now for < x, he soluions x( ) d dx of = + x grow more rapidly han y( ), since x < x for < x. Thus he soluions x( ) mus d also blow up in finie ime. This is no ye a complee argumen, hough, since i is only valid for < x; bu since + x, we know ha soluions beginning a any iniial condiion x will reach x = a he laes a ime = x; and since we reach x = in finie ime, we can hen begin he comparison wih y( ). An alernaive argumen: suppose x( ) = x. The ime aken o diverge (reach x = ) is given by T = In(/(+x^),x=x..infiniy);
12 T = x d + x x If his is finie for all x, hen we have finie-ime blow-up. Bu we have T < In(/(+x^),x=-infiniy..infiniy): so In(/(+x^),x=-..) + *In(/(+x^),x=..infiniy): and inroducing appropriae comparisons, we find T < In(/,x=-..) + *In(/(+x^),x=..infiniy); T < dx + d - + x x Thus an esimae of he upper bound for he blow-up ime for any iniial condiion is > in(,x=-..) + *in(/(+x^),x=..infiniy); evalf(%); (clearly finie) π The acual upper bound is in(/(+x^),x=-infiniy..infiniy); evalf(%); 5 sin π We plo some numerical soluions: DEplo(diff(x(),)=+x()^(),x(),=..3,x=-3..5,[[x()=-.]],sepsize=.,linecolor=black); π 4 x()
Math 467 Homework Set 1: some solutions > with(detools): with(plots): Warning, the name changecoords has been redefined
Math 467 Homework Set : some solutions > with(detools): with(plots): Warning, the name changecoords has been redefined Problem : 2.2.7 Find the fixed points, determine their stability, for d x( t ) = cos
More informationNumerical Solution of ODE
Numerical Soluion of ODE Euler and Implici Euler resar; wih(deools): wih(plos): The package ploools conains more funcions for ploing, especially a funcion o draw a single line: wih(ploools): wih(linearalgebra):
More information1.4 Application Separable Equations and the Logistic Equation
1.4 Applicaion Separable Equaions and he Logisic Equaion If a separable differenial equaion is wrien in he form f ( y) dy= g( x) dx, hen is general soluion can be wrien in he form f ( y ) dy = g ( x )
More informationEngineering Mathematics 2018
Engineering Mahemaics 08 SUBJET NAME : Mahemaics II SUBJET ODE : MA65 MATERIAL NAME : Par A quesions REGULATION : R03 UPDATED ON : November 06 TEXTBOOK FOR REFERENE To buy he book visi : Sri Hariganesh
More informationGauss-Jordan Algorithm
Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried
More informationProject #1 Math 285 Name:
Projec #1 Mah 85 Name: Solving Orinary Differenial Equaions by Maple: Sep 1: Iniialize he program: wih(deools): wih(pdeools): Sep : Define an ODE: (There are several ways of efining equaions, we sar wih
More informationMATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008
MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o
More informationSam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.
8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged
More informationChapter Six Chapter Six
Chaper Si Chaper Si 0 CHAPTER SIX ConcepTess and Answers and Commens for Secion.. Which of he following graphs (a) (d) could represen an aniderivaive of he funcion shown in Figure.? Figure. (a) (b) (c)
More informationFill in the following table for the functions shown below.
By: Carl H. Durney and Neil E. Coer Example 1 EX: Fill in he following able for he funcions shown below. he funcion is odd he funcion is even he funcion has shif-flip symmery he funcion has quarer-wave
More informationQuantitative macro models feature an infinite number of periods A more realistic (?) view of time
INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many
More informationME 406 Assignment #1 Solutions
Assignmen#1Sol.nb 1 ME 406 Assignmen #1 Soluions PROBLEM 1 We define he funcion for Mahemaica. In[1]:= f@_d := Ep@D - 4 Sin@D (a) We use Plo o consruc he plo. In[2]:= Plo@f@D, 8, -5, 5
More informationImplementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)
Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,
More informationMotor Control. 5. Control. Motor Control. Motor Control
5. Conrol In his chaper we will do: Feedback Conrol On/Off Conroller PID Conroller Moor Conrol Why use conrol a all? Correc or wrong? Supplying a cerain volage / pulsewidh will make he moor spin a a cerain
More information4. Minimax and planning problems
CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems
More informationMass-Spring Systems and Resonance
Mass-Spring Sysems and Resonance Comparing he effecs of damping coefficiens An ineresing problem is o compare he he effec of differen values of he damping coefficien c on he resuling moion of he mass on
More informationChapter 3 MEDIA ACCESS CONTROL
Chaper 3 MEDIA ACCESS CONTROL Overview Moivaion SDMA, FDMA, TDMA Aloha Adapive Aloha Backoff proocols Reservaion schemes Polling Disribued Compuing Group Mobile Compuing Summer 2003 Disribued Compuing
More informationTHERMAL PHYSICS COMPUTER LAB #3 : Stability of Dry Air and Brunt-Vaisala Oscillations
THERMAL PHYSICS COMPUTER LAB #3 : Sabiliy of Dry Air and Brun-Vaisala Oscillaions Consider a parcel of dry air of volume V, emperaure T and densiy ρ. I displace he same volume V of surrounding air of emperaure
More informationDEFINITION OF THE LAPLACE TRANSFORM
74 CHAPER 7 HE LAPLACE RANSFORM 7 DEFINIION OF HE LAPLACE RANSFORM REVIEW MAERIAL Improper inegral wih infinie limi of inegraio Inegraion y par and parial fracion decompoiion INRODUCION In elemenary calculu
More informationMotion along a Line. Describing Motion along a Line
Moion along a Line Describing Moion: Displacemen Velociy Acceleraion Uniformly Acceleraed Moion Free Fall Describing Moion along a Line Wha is he posiion, elociy, and acceleraion of he blue do a each insan
More informationNEWTON S SECOND LAW OF MOTION
Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during
More informationCENG 477 Introduction to Computer Graphics. Modeling Transformations
CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World
More informationA Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.
Slide A Principled Approach o MILP Modeling John Hooer Carnegie Mellon Universiy Worshop on MIP Columbia Universiy, Augus 008 Proposal MILP modeling is an ar, bu i need no be unprincipled. Slide Proposal
More information4.1 3D GEOMETRIC TRANSFORMATIONS
MODULE IV MCA - 3 COMPUTER GRAPHICS ADMN 29- Dep. of Compuer Science And Applicaions, SJCET, Palai 94 4. 3D GEOMETRIC TRANSFORMATIONS Mehods for geomeric ransformaions and objec modeling in hree dimensions
More informationMatlab5 5.3 symbolisches Lösen von DGLn
C:\Si5\Ingmah\symbmalab\DGLn_N4_2.doc, Seie /5 Prof. Dr. R. Kessler, Homepage: hp://www.home.hs-karlsruhe.de/~kero/ Malab5 5.3 symbolisches Lösen von DGLn % Beispiele aus Malab 4.3 Suden Ediion Handbuch
More informationthe marginal product. Using the rule for differentiating a power function,
3 Augu 07 Chaper 3 Derivaive ha economi ue 3 Rule for differeniaion The chain rule Economi ofen work wih funcion of variable ha are hemelve funcion of oher variable For example, conider a monopoly elling
More informationShortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.
Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah
More informationScattering at an Interface: Normal Incidence
Course Insrucor Dr. Raymond C. Rumpf Office: A 337 Phone: (915) 747 6958 Mail: rcrumpf@uep.edu 4347 Applied lecromagneics Topic 3f Scaering a an Inerface: Normal Incidence Scaering These Normal noes Incidence
More informationEECS 487: Interactive Computer Graphics
EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified
More informationTraditional Rendering (Ray Tracing and Radiosity)
Tradiional Rendering (Ray Tracing and Radiosiy) CS 517 Fall 2002 Compuer Science Cornell Universiy Bidirecional Reflecance (BRDF) λ direcional diffuse specular θ uniform diffuse τ σ BRDF Bidirecional Reflecance
More informationAML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves
AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves
More informationREDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction.
BBM 0 - ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM REDUCTIONS May., 0 Bird s-eye view Desideraa. Classify problems according o compuaional requiremens. complexiy order of growh examples linear
More informationAnnouncements For The Logic of Boolean Connectives Truth Tables, Tautologies & Logical Truths. Outline. Introduction Truth Functions
Announcemens For 02.05.09 The Logic o Boolean Connecives Truh Tables, Tauologies & Logical Truhs 1 HW3 is due nex Tuesday William Sarr 02.05.09 William Sarr The Logic o Boolean Connecives (Phil 201.02)
More informationRULES OF DIFFERENTIATION LESSON PLAN. C2 Topic Overview CALCULUS
CALCULUS C Topic Overview C RULES OF DIFFERENTIATION In pracice we o no carry ou iffereniaion from fir principle (a ecribe in Topic C Inroucion o Differeniaion). Inea we ue a e of rule ha allow u o obain
More informationPART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR
. ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral
More informationFIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS
FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2
More informationMichiel Helder and Marielle C.T.A Geurts. Hoofdkantoor PTT Post / Dutch Postal Services Headquarters
SHORT TERM PREDICTIONS A MONITORING SYSTEM by Michiel Helder and Marielle C.T.A Geurs Hoofdkanoor PTT Pos / Duch Posal Services Headquarers Keywords macro ime series shor erm predicions ARIMA-models faciliy
More informationParametric equations 8A
Parameric equaions 8A a so () y () Susiue () ino (): y ( ) y 5, So he domain of f() is 6. y, So he range of f() is y 7. d so () y () Susiue () ino (): y y, 0 So he domain of f() is. 5 so 5 () y () Susiue
More informationA non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics
A non-saionary uniform ension conrolled inerpolaing 4-poin scheme reproducing conics C. Beccari a, G. Casciola b, L. Romani b, a Deparmen of Pure and Applied Mahemaics, Universiy of Padova, Via G. Belzoni
More informationNonparametric CUSUM Charts for Process Variability
Journal of Academia and Indusrial Research (JAIR) Volume 3, Issue June 4 53 REEARCH ARTICLE IN: 78-53 Nonparameric CUUM Chars for Process Variabiliy D.M. Zombade and V.B. Ghue * Dep. of aisics, Walchand
More information4 Error Control. 4.1 Issues with Reliable Protocols
4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can
More informationReal Time Integral-Based Structural Health Monitoring
Real Time Inegral-Based Srucural Healh Monioring The nd Inernaional Conference on Sensing Technology ICST 7 J. G. Chase, I. Singh-Leve, C. E. Hann, X. Chen Deparmen of Mechanical Engineering, Universiy
More informationMOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS
NME: TE: LOK: MOTION ETETORS GRPH MTHING L PRE-L QUESTIONS 1. Read he insrucions, and answer he following quesions. Make sure you resae he quesion so I don hae o read he quesion o undersand he answer..
More information7.2 Puiseux Expansions
7. Puiseux Expansions Given an algebraic funcion on an algebraic curve, we wish o compue is principle pars by locaing is poles and compuing series expansions here. Since he powers of y form a Cx basis
More informationSTEREO PLANE MATCHING TECHNIQUE
STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo
More informationY. Tsiatouhas. VLSI Systems and Computer Architecture Lab
CMOS INEGRAED CIRCUI DESIGN ECHNIQUES Universiy of Ioannina Clocking Schemes Dep. of Compuer Science and Engineering Y. siaouhas CMOS Inegraed Circui Design echniques Overview 1. Jier Skew hroughpu Laency
More informationFLOW VISUALIZATION USING MOVING TEXTURES * Nelson Max Lawrence Livermore National Laboratory Livermore, California
FLOW VISUALIZATION USING MOVING TEXTURES * Nelson Max Lawrence Livermore Naional Laboraor Livermore, California Barr Becker Lawrence Livermore Naional Laboraor Livermore, California SUMMARY We presen a
More informationDefinition and examples of time series
Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is
More informationAn Improved Square-Root Nyquist Shaping Filter
An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com
More informationEvaluation and Improvement of Region-based Motion Segmentation
Evaluaion and Improvemen of Region-based Moion Segmenaion Mark Ross Universiy Koblenz-Landau, Insiue of Compuaional Visualisics, Universiässraße 1, 56070 Koblenz, Germany Email: ross@uni-koblenz.de Absrac
More informationLearning in Games via Opponent Strategy Estimation and Policy Search
Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen
More informationAssignment 2. Due Monday Feb. 12, 10:00pm.
Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218, LEC11 ssignmen 2 Due Monday Feb. 12, 1:pm. 1 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how
More informationIntegro-differential splines and quadratic formulae
Inegro-differenial splines and quadraic formulae I.G. BUROVA, O. V. RODNIKOVA S. Peersburg Sae Universiy 7/9 Universiesaya nab., S.Persburg, 9934 Russia i.g.burova@spbu.ru, burovaig@mail.ru Absrac: This
More informationA Numerical Study on Impact Damage Assessment of PC Box Girder Bridge by Pounding Effect
A Numerical Sudy on Impac Damage Assessmen of PC Box Girder Bridge by Pounding Effec H. Tamai, Y. Sonoda, K. Goou and Y.Kajia Kyushu Universiy, Japan Absrac When a large earhquake occurs, displacemen response
More informationNetwork management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);
QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is
More informationData Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2
Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,
More information(Structural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS
(Srucural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS Himadri Ghosh, Prajneshu and Savia Wadhwa I.A.S.R.I., Library Avenue, New Delhi-110 01 him_adri@iasri.res.in, prajnesh@iasri.res.in,
More informationIn Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12].
In Proceedings of CVPR '96 Srucure and Moion of Curved 3D Objecs from Monocular Silhouees B Vijayakumar David J Kriegman Dep of Elecrical Engineering Yale Universiy New Haven, CT 652-8267 Jean Ponce Compuer
More informationCoded Caching with Multiple File Requests
Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a
More information! errors caused by signal attenuation, noise.!! receiver detects presence of errors:!
Daa Link Layer! The Daa Link layer can be furher subdivided ino:!.! Logical Link Conrol (LLC): error and flow conrol!.! Media Access Conrol (MAC): framing and media access! differen link proocols may provide
More informationFINITE DIFFERENCE SOLUTIONS TO THE TIME DEPENDENT HEAT CONDUCTION EQUATIONS. T T q 1 T + = (1)
Recall he ime depede hea coducio equaio FINIE DIFFERENCE SOLUIONS O HE IME DEPENDEN HEA CONDUCION EQUAIONS + q () We have already ee how o dicreize he paial variable ad approimae paial derivaive. he ame
More informationPiecewise Linear Models
6-6 Applied Operaions Research Piecewise Linear Models Deparmen of Mahemaics and Saisics The Universi of Melbourne This presenaion has been made in accordance wih he provisions of Par VB of he coprigh
More informationThe Beer Dock: Three and a Half Implementations of the Beer Distribution Game
The Beer Dock 2002-08-13 17:55:44-0700 The Beer Dock: Three and a Half Implemenaions of he Beer Disribuion Game Michael J. Norh[1] and Charles M. Macal Argonne Naional Laboraory, Argonne, Illinois Absrac
More informationScheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012
EDA421/DIT171 - Parallel and Disribued Real-Time Sysems, Chalmers/GU, 2011/2012 Lecure #4 Updaed March 16, 2012 Aemps o mee applicaion consrains should be done in a proacive way hrough scheduling. Schedule
More informationHyelim Oh. School of Computing, National University of Singapore, 13 Computing Drive, Singapore SINGAPORE
RESEARCH ARTICLE FREE VERSUS FOR-A-FEE: THE IMPACT OF A PAYWALL ON THE PATTERN AND EFFECTIVENESS OF WORD-OF-MOUTH VIA SOCIAL MEDIA Hyelim Oh School of Compuing, Naional Universiy of Singapore, 13 Compuing
More informationBoyce - DiPrima 8.4, Multistep Methods
Boyce - DiPrima 8., Mulisep Mehods Secion 8., p. 67: Iniializaion In[1]:= In[]:= Impor "ColorNames.m" DiffEqs` Runga-Kua Mehod Implemen one sep of he Runge-Kua Mehod. In[]:= Clear y,, h, f ; eqn : y' f,
More informationCOSC 3213: Computer Networks I Chapter 6 Handout # 7
COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:
More informationRay Casting. Outline. Outline in Code
Foundaions of ompuer Graphics Online Lecure 10: Ray Tracing 2 Nus and ols amera Ray asing Ravi Ramamoorhi Ouline amera Ray asing (choose ray direcions) Ray-objec inersecions Ray-racing ransformed objecs
More informationMOBILE COMPUTING. Wi-Fi 9/20/15. CSE 40814/60814 Fall Wi-Fi:
MOBILE COMPUTING CSE 40814/60814 Fall 2015 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically
More informationMOBILE COMPUTING 3/18/18. Wi-Fi IEEE. CSE 40814/60814 Spring 2018
MOBILE COMPUTING CSE 40814/60814 Spring 2018 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically
More informationDimmer time switch AlphaLux³ D / 27
Dimmer ime swich AlphaLux³ D2 426 26 / 27! Safey noes This produc should be insalled in line wih insallaion rules, preferably by a qualified elecrician. Incorrec insallaion and use can lead o risk of elecric
More informationImage segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding
Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same
More informationA Matching Algorithm for Content-Based Image Retrieval
A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using
More informationWhy not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems
Simulaion Wha is simulaion? Simple synonym: imiaion We are ineresed in sudying a Insead of experimening wih he iself we experimen wih a model of he Experimen wih he Acual Ways o sudy a Sysem Experimen
More informationFlow graph/networks MAX FLOW APPLICATIONS. Flow constraints. Max flow problem 4/26/12
4// low graph/nework MX LOW PPLIION 30, pring 0 avid Kauchak low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource V wih no incoming
More informationPrecise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves
Precise Voronoi Cell Exracion of Free-form Raional Planar Closed Curves Iddo Hanniel, Ramanahan Muhuganapahy, Gershon Elber Deparmen of Compuer Science Technion, Israel Insiue of Technology Haifa 32000,
More informationThe Laplace Transform
7 he Laplace ranform 7 Definiion of he Laplace ranform 7 Invere ranform and ranform of Derivaive 7 Invere ranform 7 ranform of Derivaive 73 Operaional Properie I 73 ranlaion on he -Axi 73 ranlaion on he
More informationReinforcement Learning by Policy Improvement. Making Use of Experiences of The Other Tasks. Hajime Kimura and Shigenobu Kobayashi
Reinforcemen Learning by Policy Improvemen Making Use of Experiences of The Oher Tasks Hajime Kimura and Shigenobu Kobayashi Tokyo Insiue of Technology, JAPAN genfe.dis.iech.ac.jp, kobayasidis.iech.ac.jp
More informationLess Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks
Less Pessimisic Wors-Case Delay Analysis for Packe-Swiched Neworks Maias Wecksén Cenre for Research on Embedded Sysems P O Box 823 SE-31 18 Halmsad maias.wecksen@hh.se Magnus Jonsson Cenre for Research
More informationAn Adaptive Spatial Depth Filter for 3D Rendering IP
JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod
More informationCAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL
CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz
More informationMORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES
MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image
More informationChapter 4 Sequential Instructions
Chaper 4 Sequenial Insrucions The sequenial insrucions of FBs-PLC shown in his chaper are also lised in secion 3.. Please refer o Chaper, "PLC Ladder diagram and he Coding rules of Mnemonic insrucion",
More informationProbabilistic Detection and Tracking of Motion Discontinuities
Probabilisic Deecion and Tracking of Moion Disconinuiies Michael J. Black David J. Flee Xerox Palo Alo Research Cener 3333 Coyoe Hill Road Palo Alo, CA 94304 fblack,fleeg@parc.xerox.com hp://www.parc.xerox.com/fblack,fleeg/
More informationModelling urban travel time variability with the Burr regression technique
Ausralasian Transpor Research Forum 2011 Proceedings 28-30 Sepember 2011, Adelaide, Ausralia Publicaion websie: hp://www.parec.org/arf.aspx Modelling urban ravel ime variabiliy wih he Burr regression echnique
More informationMARSS Reference Sheet
MARSS Reference Shee The defaul MARSS model (form="marxss") is wrien as follows: x = B x 1 + u + C c + w where w MVN( Q ) y = Z x + a + D d + v where v MVN( R ) x 1 MVN(π Λ) or x MVN(π Λ) c and d are inpus
More informationA Progressive-ILP Based Routing Algorithm for Cross-Referencing Biochips
16.3 A Progressive-ILP Based Rouing Algorihm for Cross-Referencing Biochips Ping-Hung Yuh 1, Sachin Sapanekar 2, Chia-Lin Yang 1, Yao-Wen Chang 3 1 Deparmen of Compuer Science and Informaion Engineering,
More informationAUTOMATIC 3D FACE REGISTRATION WITHOUT INITIALIZATION
Chaper 3 AUTOMATIC 3D FACE REGISTRATION WITHOUT INITIALIZATION A. Koschan, V. R. Ayyagari, F. Boughorbel, and M. A. Abidi Imaging, Roboics, and Inelligen Sysems Laboraory, The Universiy of Tennessee, 334
More informationUsing CANopen Slave Driver
CAN Bus User Manual Using CANopen Slave Driver V1. Table of Conens 1. SDO Communicaion... 1 2. PDO Communicaion... 1 3. TPDO Reading and RPDO Wriing... 2 4. RPDO Reading... 3 5. CANopen Communicaion Parameer
More informationOptimal Crane Scheduling
Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move
More informationOptics and Light. Presentation
Opics and Ligh Presenaion Opics and Ligh Wha comes o mind when you hear he words opics and ligh? Wha is an opical illusion? Opical illusions can use color, ligh and paerns o creae images ha can be
More informationTUTORING TEXTS IN MATHCAD
TUTORING TEXTS IN MATHCAD MIROSLAV DOLOZÍILEK and ANNA RYNDOVÁ Faculy of Mechanical Engineering, Brno Universiy of Technology Technická, 616 69 Brno, Czech Republic E-ail: irdo@fyzika.fe.vubr.cz Absrac
More informationDesign Alternatives for a Thin Lens Spatial Integrator Array
Egyp. J. Solids, Vol. (7), No. (), (004) 75 Design Alernaives for a Thin Lens Spaial Inegraor Array Hala Kamal *, Daniel V azquez and Javier Alda and E. Bernabeu Opics Deparmen. Universiy Compluense of
More informationIn fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps
In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magneic Field Maps A. D. Hahn 1, A. S. Nencka 1 and D. B. Rowe 2,1 1 Medical College of Wisconsin, Milwaukee, WI, Unied
More informationPROCESS AUTOMATION MANUAL TIMER RELAY KF**-DU-EX1.D ISO9001
PROCESS AUTOMATION MANUAL TIMER RELAY KF**-DU-EX1.D ISO9001 Wih regard o he supply of producs, he curren issue of he following documen is applicable: The general erms of delivery for producs and services
More informationA Formalization of Ray Casting Optimization Techniques
A Formalizaion of Ray Casing Opimizaion Techniques J. Revelles, C. Ureña Dp. Lenguajes y Sisemas Informáicos, E.T.S.I. Informáica, Universiy of Granada, Spain e-mail: [jrevelle,almagro]@ugr.es URL: hp://giig.ugr.es
More informationTest - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version
Tes - Accredied Configuraion Engineer (ACE) Exam - PAN-OS 6.0 Version ACE Exam Quesion 1 of 50. Which of he following saemens is NOT abou Palo Alo Neworks firewalls? Sysem defauls may be resored by performing
More informationLecture 18: Mix net Voting Systems
6.897: Advanced Topics in Crypography Apr 9, 2004 Lecure 18: Mix ne Voing Sysems Scribed by: Yael Tauman Kalai 1 Inroducion In he previous lecure, we defined he noion of an elecronic voing sysem, and specified
More informationComputer representations of piecewise
Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom
More informationA High Accuracy Volume Renderer for Unstructured Data
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. 4, NO. 1, JANUARY-MARCH 1998 37 A High Accuracy Volume Renderer for Unsrucured Daa Peer L. Williams, Member, IEEE Compuer Sociey, Nelson L.
More information