ME 406 Assignment #1 Solutions
|
|
- Kevin O’Brien’
- 5 years ago
- Views:
Transcription
1 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<, AesLabel Ø 8"", "fhl"<d fhl Ou[2]= (b) The graph shows ha here are wo posiive roos, one near 0.4 and he oher near 1.5. We use FindRoo o find hem. We check each roo afer we find i. In[3]:= FindRoo@f@D == 0, 8, 0.4<D Ou[3]= 8 Ø < In[4]:= f@d ê. % Ou[4]= 0. In[5]:= FindRoo@f@D == 0, 8, 1.5<D Ou[5]= 8 Ø <
2 Assignmen#1Sol.nb 2 In[6]:= f@d ê. % Ou[6]= 0. The checks show ha he roos are accurae. PROBLEM 2 A sandard parameric represenaion is given by := 2 Cos@D; y@_d := 3 Sin@D We use ParamericPlo o plo his. In[8]:= ParamericPlo@8@D, y@d<, 8, 0, 2 p<, AspecRaio Ø 1, PloRange Ø , 3.1<, 8-3.1, 3.1<<, AesLabel Ø 8"", "y"<d 3 y 2 1 Ou[8]= PROBLEM 3 We define he equaion for Mahemaica. We call i equa3. In[9]:= Clear@, m, c, k, a, bd;
3 Assignmen#1Sol.nb 3 In[10]:= equa3 := 8m ''@D + c '@D + == == a, '@0D == b<; We will use equa3 as an argumen of DSolve and NDSolve. Now we specify he parameer values. In[11]:= m = 2; c = 0.8; k = 8; a = 1; b = 2; (a) We solve wih DSolve. In[12]:= Ou[12]= ans3 = D 99@D Ø -0.2 H1. Cos@ D Sin@ DL== We conver he replacemen rule o a funcion named osc[]. In[13]:= Ou[13]= osc@_d ê. Flaen@ans3D -0.2 H1. Cos@ D Sin@ DL (b) We check firs he iniial condiions and hen he equaion. In[14]:= osc@0d Ou[14]= 1. In[15]:= osc'@0d Ou[15]= 2. In[16]:= m osc''@d + c osc'@d + k osc@d Ou[16]= H1. Cos@ D Sin@ DL I -0.2 H2.2 Cos@ D Sin@ DL H1. Cos@ D Sin@ DLM + 2 I -0.2 H-3.96 Cos@ D Sin@ DL H2.2 Cos@ D Sin@ DL H1. Cos@ D Sin@ DLM In[17]:= Simplify@%D Ou[17]= 0. Iniial condiions and equaion boh check. (c) We apply he plo command o osc[]. We name he graph so ha we can refer o i laer when we combine i wih anoher graph.
4 Assignmen#1Sol.nb 4 In[18]:= graph = Plo@osc@D, 8, 0, 8<, AesLabel Ø 8"", ""<D Ou[18]= (d) We now apply Plo o osc'[], again naming he graph. In[19]:= graphv = 8, 0, 8<, AesLabel Ø 8"", "v"<d 2 v 1 Ou[19]= -1-2 (e) We combine he graphs wih a Show command.
5 Assignmen#1Sol.nb 5 In[20]:= Show@graph, graphv, PloRange -> 8-2.5, 2.5<D 2 1 Ou[20]= -1-2 We can inser a more appropriae label on he verical ais. In[21]:= Show@graph, graphv, PloRange -> 8-2.5, 2.5<, AesLabel Ø 8"", " and v"<d and v 2 1 Ou[21]= -1-2 (f) Now we will use NDSolve o ge he soluion. We name he soluion (i.e., he inerpolaing funcion oupu) oscnum. In[22]:= oscnum = 8, 0, 8<D Ou[22]= 88@D Ø InerpolaingFuncion@880., 8.<<, <>D@D<< We conver his inerpolaing funcion oupu o an ordinary funcion, oscou[].
6 Assignmen#1Sol.nb 6 In[23]:= Ou[23]= osou@_d ê. Flaen@oscnumD InerpolaingFuncion@880., 8.<<, <>D@D Now we plo his funcion. In[24]:= graphnum = Plo@osou@D, 8, 0, 8<, AesLabel Ø 8"", ""<, PloLabel Ø "Numerical Soluion"D Numerical Soluion 1.0 Ou[24]= This is he same as our earlier graph, ecep for he newly added plo label. (g) We conver his equaion o a sysem of wo firs order equaions, by inroducing v = d/d. The resul is We define his equaion for Mahemaica. d d = v, dv d = - c m v - k m, wih H0L = a, v H0L = b. In[25]:= sysequa3 = 8'@D == v@d, v'@d == -Hc ê ml v@d - Hk == a, v@0d == b<; Now we use his as one of he argumens of NDSolve. In[26]:= sysnum = NDSolve@sysequa3, 8@D, v@d<, 8, 0, 8<D Ou[26]= 88@D Ø InerpolaingFuncion@880., 8.<<, <>D@D, v@d Ø InerpolaingFuncion@880., 8.<<, <>D@D<< We conver he inerpolaing funcion oupu o an ordinary funcion. We call he wo componens of he ordinary funcion osc[] and vosc[].
7 Assignmen#1Sol.nb 7 In[27]:= Ou[27]= 8osc@_D, vosc@_d< = 8@D, v@d< ê. Flaen@sysnumD 8InerpolaingFuncion@880., 8.<<, <>D@D, InerpolaingFuncion@880., 8.<<, <>D@D< We plo osc[]. In[28]:= graphsysosc = Plo@osc@D, 8, 0, 8<, AesLabel Ø 8"", ""<, PloLabel Ø "Numerical Soluion of Sysem"D Numerical Soluion of Sysem 1.0 Ou[28]= PROBLEM 4 We define he mari for Mahemaica, and display i using MariForm. In[29]:= A = 881, -2, 3, 0<, 8-2, 0, 3, 2<, 83, 3, 5, -6<, 80, 2, -6, 1<< Ou[29]= 881, -2, 3, 0<, 8-2, 0, 3, 2<, 83, 3, 5, -6<, 80, 2, -6, 1<< In[30]:= MariForm@AD Ou[30]//MariForm= (a) We calculae he inverse, calling i Ainv, and hen check i by muliplying A and Ainv. In[31]:= Ainv = Inverse@AD Ou[31]= :: , , , : , , 8 121, >, : , , , >, >, : , , 6 121, >>
8 Assignmen#1Sol.nb 8 In[32]:= MariForm@A.AinvD Ou[32]//MariForm= To solve he linear equaions AX = b, we firs define b for Mahemaica, and hen calculae he soluion as Ainv.b. In[33]:= b = 81, 0, 1, 0< Ou[33]= 81, 0, 1, 0< In[34]:= X = Ainv.b Ou[34]= : , , , > We can conver he eac raional numbers o numerical values wih he N command. In[35]:= N@XD Ou[35]= , , , < Now we check he soluion, sill using he eac raional values. In[36]:= A.X - b Ou[36]= 80, 0, 0, 0< Because he enries of A were all inegers, Mahemaica did eac calculaions. By using he N command o conver ineger o real resuls, we can do he calculaions in erms of reals raher han inegers. In[37]:= Ainv = Inverse@N@ADD Ou[37]= , , , <, , , , <, , , , <, , , , << In[38]:= X = Ainv.b Ou[38]= , , , < (b) Because all of he enries of A are eac inegers, Mahemaica will aemp an eac calculaion of he eigenvalues and eigenvecors. Le's look a jus he eigenvalues firs. In[39]:= Eigenvalues@AD Ou[39]= 9RooA Ò1-51 Ò1 2-7 Ò1 3 + Ò1 4 &, 4E, RooA Ò1-51 Ò1 2-7 Ò1 3 + Ò1 4 &, 1E, RooA Ò1-51 Ò1 2-7 Ò1 3 + Ò1 4 &, 3E, RooA Ò1-51 Ò1 2-7 Ò1 3 + Ò1 4 &, 2E= A small lesson here: "eac" isn' always useful. In principle eac soluions of a quaric equaion are possible. In pracice i is no worh our ime o unravel he above answer. We force a numerical approach by using he N funcion which convers eac values o numerical values.
9 Assignmen#1Sol.nb 9 In[40]:= Eigenvalues@N@ADD Ou[40]= , , , < Now he eigenvecors. In[41]:= eigvecs = Eigenvecors@N@ADD Ou[41]= , , , <, , , , <, , , , <, , , , << We check he pairwise orhogonaliy. Firs we erac he four vecors from he above lis. In[42]:= eig1 = eigvecs@@1dd Ou[42]= , , , < In[43]:= eig2 = eigvecs@@2dd Ou[43]= , , , < In[44]:= eig3 = eigvecs@@3dd Ou[44]= , , , < In[45]:= eig4 = eigvecs@@4dd Ou[45]= , , , < Now we check he orhogonaliy. In[46]:= eig1.eig2 Ou[46]= µ In[47]:= eig1.eig3 Ou[47]= µ In[48]:= eig1.eig4 Ou[48]= µ In[49]:= eig2.eig3 Ou[49]= µ In[50]:= eig2.eig4 Ou[50]= µ In[51]:= eig3.eig4 Ou[51]= µ Thus hey are orhogonal o wihin he numerical accuracy of he calculaion.
Sam 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 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 informationIt is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );
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)
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationM y. Image Warping. Targil 7 : Image Warping. Image Warping. 2D Geometric Transformations. image filtering: change range of image g(x) = T(f(x))
Hebrew Universi Image Processing - 6 Image Warping Hebrew Universi Image Processing - 6 argil 7 : Image Warping D Geomeric ransormaions hp://www.jere-marin.com Man slides rom Seve Seiz and Aleei Eros Image
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 informationCOMP26120: Algorithms and Imperative Programming
COMP26120 ecure C3 1/48 COMP26120: Algorihms and Imperaive Programming ecure C3: C - Recursive Daa Srucures Pee Jinks School of Compuer Science, Universiy of Mancheser Auumn 2011 COMP26120 ecure C3 2/48
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 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 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 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 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 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 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 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 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 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 informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state
Ouline EECS 5 - Componens and Design Techniques for Digial Sysems Lec 6 Using FSMs 9-3-7 Review FSMs Mapping o FPGAs Typical uses of FSMs Synchronous Seq. Circuis safe composiion Timing FSMs in verilog
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 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 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 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 informationPerformance Evaluation of Implementing Calls Prioritization with Different Queuing Disciplines in Mobile Wireless Networks
Journal of Compuer Science 2 (5): 466-472, 2006 ISSN 1549-3636 2006 Science Publicaions Performance Evaluaion of Implemening Calls Prioriizaion wih Differen Queuing Disciplines in Mobile Wireless Neworks
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 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 informationGeometry Transformation
Geomer Transformaion Januar 26 Prof. Gar Wang Dep. of Mechanical and Manufacuring Engineering Universi of Manioba Wh geomer ransformaion? Beer undersanding of he design Communicaion wih cusomers Generaing
More informationImage warping Li Zhang CS559
Wha is an image Image arping Li Zhang S559 We can hink of an image as a funcion, f: R 2 R: f(, ) gives he inensi a posiion (, ) defined over a recangle, ih a finie range: f: [a,b][c,d] [,] f Slides solen
More informationMidterm Exam Announcements
Miderm Exam Noe: This was a challenging exam. CSCI 4: Principles o Programming Languages Lecure 1: Excepions Insrucor: Dan Barowy Miderm Exam Scores 18 16 14 12 10 needs improvemen 8 6 4 2 0 0-49 50-59
More informationSTRING DESCRIPTIONS OF DATA FOR DISPLAY*
SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac
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 informationResearch Article Shape Preserving Interpolation Using C 2 Rational Cubic Spline
Applied Mahemaics Volume 1, Aricle ID 73, 1 pages hp://dx.doi.org/1.11/1/73 Research Aricle Shape Preserving Inerpolaion Using C Raional Cubic Spline Samsul Ariffin Abdul Karim 1 and Kong Voon Pang 1 Fundamenal
More informationProjection & Interaction
Projecion & Ineracion Algebra of projecion Canonical viewing volume rackball inerface ransform Hierarchies Preview of Assignmen #2 Lecure 8 Comp 236 Spring 25 Projecions Our lives are grealy simplified
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 informationCollision-Free and Curvature-Continuous Path Smoothing in Cluttered Environments
Collision-Free and Curvaure-Coninuous Pah Smoohing in Cluered Environmens Jia Pan 1 and Liangjun Zhang and Dinesh Manocha 3 1 panj@cs.unc.edu, 3 dm@cs.unc.edu, Dep. of Compuer Science, Universiy of Norh
More informationNURBS rendering in OpenSG Plus
NURS rering in OpenSG Plus F. Kahlesz Á. alázs R. Klein Universiy of onn Insiue of Compuer Science II Compuer Graphics Römersrasse 164. 53117 onn, Germany Absrac Mos of he indusrial pars are designed as
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 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 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 informationMB86297A Carmine Timing Analysis of the DDR Interface
Applicaion Noe MB86297A Carmine Timing Analysis of he DDR Inerface Fujisu Microelecronics Europe GmbH Hisory Dae Auhor Version Commen 05.02.2008 Anders Ramdahl 0.01 Firs draf 06.02.2008 Anders Ramdahl
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 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 informationNavigating in a Shape Space of Registered Models
Navigaing in a Shape Space of Regisered Models Randall C. Smih, Member, IEEE, Richard Pawlicki, Isván Kókai, Jörg Finger and Thomas Veer, Member, IEEE Absrac New produc developmen involves people wih differen
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 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 informationAutomatic Calculation of Coverage Profiles for Coverage-based Testing
Auomaic Calculaion of Coverage Profiles for Coverage-based Tesing Raimund Kirner 1 and Waler Haas 1 Vienna Universiy of Technology, Insiue of Compuer Engineering, Vienna, Ausria, raimund@vmars.uwien.ac.a
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 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 informationInformation technology MPEG audio technologies Part 3: Unified speech and audio coding
INTRNATIONAL STANDARD ISO/IC 23003-3:2012 TCHNICAL CORRIGNDUM 1 Published 2012-09-01 INTRNATIONAL ORGANIZATION FOR STANDARDIZATION МЕЖДУНАРОДНАЯ ОРГАНИЗАЦИЯ ПО СТАНДАРТИЗАЦИИ ORGANISATION INTRNATIONAL
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 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 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 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 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 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 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 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 informationHandling uncertainty in semantic information retrieval process
Handling uncerainy in semanic informaion rerieval process Chkiwa Mounira 1, Jedidi Anis 1 and Faiez Gargouri 1 1 Mulimedia, InfoRmaion sysems and Advanced Compuing Laboraory Sfax Universiy, Tunisia m.chkiwa@gmail.com,
More informationAn efficient approach to improve throughput for TCP vegas in ad hoc network
Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: 395-0056 Volume: 0 Issue: 03 June-05 www.irje.ne p-issn: 395-007 An efficien approach o improve hroughpu for TCP vegas in ad hoc
More informationImage warping/morphing
Image arping/morphing Image arping Digial Visual Effecs Yung-Yu Chuang ih slides b Richard Szeliski, Seve Seiz, Tom Funkhouser and leei Efros Image formaion Sampling and quanizaion B Wha is an image We
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 informationMIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch
CableCARD Power Swich General Descripion is designed o supply power o OpenCable sysems and CableCARD hoss. These CableCARDs are also known as Poin of Disribuion (POD) cards. suppors boh Single and Muliple
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 informationLast Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?
Las Time: Curves & Surfaces Expeced value and variance Mone-Carlo in graphics Imporance sampling Sraified sampling Pah Tracing Irradiance Cache Phoon Mapping Quesions? Today Moivaion Limiaions of Polygonal
More informationBI-TEMPORAL INDEXING
BI-TEMPORAL INDEXING Mirella M. Moro Uniersidade Federal do Rio Grande do Sul Poro Alegre, RS, Brazil hp://www.inf.ufrgs.br/~mirella/ Vassilis J. Tsoras Uniersiy of California, Rierside Rierside, CA 92521,
More informationRelevance Ranking using Kernels
Relevance Ranking using Kernels Jun Xu 1, Hang Li 1, and Chaoliang Zhong 2 1 Microsof Research Asia, 4F Sigma Cener, No. 49 Zhichun Road, Beijing, China 100190 2 Beijing Universiy of Poss and Telecommunicaions,
More informationA Fast Non-Uniform Knots Placement Method for B-Spline Fitting
2015 IEEE Inernaional Conference on Advanced Inelligen Mecharonics (AIM) July 7-11, 2015. Busan, Korea A Fas Non-Uniform Knos Placemen Mehod for B-Spline Fiing T. Tjahjowidodo, VT. Dung, and ML. Han Absrac
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 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 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 informationDifferential Geometry of Surfaces with Mathcad: A Virtual Learning Approach
The 4 h Inernaional Conference on Virual Learning Gheorghe Asachi Technical Universiy of Iaşi, Oc 30-Nov, 009 Differenial Geomery of Surfaces wih Mahca: A Virual Learning Approach Nicolae Dăneţ Technical
More informationStreamline Pathline Eulerian Lagrangian
Sreamline Pahline Eulerian Lagrangian Sagnaion Poin Flow V V V = + = + = + o V xi y j a V V xi y j o Pahline and Sreakline Insananeous Sreamlines Pahlines Sreaklines Maerial Derivaive Acceleraion
More informationEffects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012)
Foundaions of ompuer Graphics (Fall 2012) S 184, Lecure 16: Ray Tracing hp://ins.eecs.berkeley.edu/~cs184 Effecs needed for Realism (Sof) Shadows Reflecions (Mirrors and Glossy) Transparency (Waer, Glass)
More informationData Structures and Algorithms
Daa Srucures and Algorihms The maerial for his lecure is drawn, in ar, from The Pracice of Programming (Kernighan & Pike) Chaer 2 1 Goals of his Lecure Hel you learn (or refresh your memory) abou: Common
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 informationWiley Plus. Assignment 1 is online:
Wile Plus Assignmen 1 is online: 6 problems from chapers and 3 1D and D Kinemaics Due Monda Ocober 5 Before 11 pm! Chaper II: Kinemaics In One Dimension Displacemen Speed and Veloci Acceleraion Equaions
More informationtr_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Report no TR-22/88
r_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Repor no TR-22/88 Deparmen of Compuer Science and Sysems McMaser Universiy 1988 McESE-FranzLISP: McMASTER
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 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 informationVideo-Based Face Recognition Using Probabilistic Appearance Manifolds
Video-Based Face Recogniion Using Probabilisic Appearance Manifolds Kuang-Chih Lee Jeffrey Ho Ming-Hsuan Yang David Kriegman klee10@uiuc.edu jho@cs.ucsd.edu myang@honda-ri.com kriegman@cs.ucsd.edu Compuer
More informationSchedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.
Schedule Curves & Surfaces Sunday Ocober 5 h, * 3-5 PM *, Room TBA: Review Session for Quiz 1 Exra Office Hours on Monday (NE43 Graphics Lab) Tuesday Ocober 7 h : Quiz 1: In class 1 hand-wrien 8.5x11 shee
More informationSpline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification
Las Time? Adjacency Daa Srucures Spline Curves Geomeric & opologic informaion Dynamic allocaion Efficiency of access Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen
More informationarxiv: v1 [cs.na] 11 May 2017
Cache-oblivious Marix Muliplicaion for Exac Facorisaion arxiv:175.487v1 [cs.na] 11 May 217 Faima K. Abu Salem 1 Compuer Science Deparmen, American Universiy of Beiru, P. O. Box 11-236, Riad El Solh, Beiru
More informationPacket Scheduling in a Low-Latency Optical Interconnect with Electronic Buffers
Packe cheduling in a Low-Laency Opical Inerconnec wih Elecronic Buffers Lin Liu Zhenghao Zhang Yuanyuan Yang Dep Elecrical & Compuer Engineering Compuer cience Deparmen Dep Elecrical & Compuer Engineering
More information