Mathematica(l) Roller Coasters
|
|
- Clifford Wood
- 6 years ago
- Views:
Transcription
1 Mathematica(l) Roller Coasters Selwyn Hollis Department of Mathematics Armstrong Atlantic State University Savannah, GA à Introdction Mathematica animations that simlate roller coasters provide an interesting and fn way of ptting basic ideas from mltivariable calcls and elementary physics to work. In this article we will describe how to create monorail roller coaster animations in which the track is a srface in Ñ 3 in the form of a narrow strip. The space crve comprising the center rail of the track may be specified either as a closed coordinate crve on a given parametric srface or as a closed space crve. In the first case, the orientation of the vehicle makes se of partial derivatives. In the second case, the orientation of the vehicle makes se of the crve s classical TNB frame, which consists of the tangent, normal, and binormal vectors. à The Physics The motion of or simlated roller coaster will be made to appear realistic by or se of the principle of conservation of energy. We will assme a frictionless track and that pward is the positive vertical direction. So at all times we have DH KE + PE L =, where KE = mv is kinetic energy, and PE = mg z is potential energy. Here m is mass, g is the gravitational acceleration constant, z is vertical displacement from any reference point, and v is speed. Since there is no force and conseqently no change in potential energy in any horizontal plane, we actally have KE = mv z + c where v z is the vertical component of the velocity and c is a constant. So from the conservation principle above, it follows easily that D Hv z L µ Dz. Sppose that at the highest point on the roller coaster s track we have v z = v top and z = z top. Then at any point on the track, v z - v top = kh z top - zl,
2 where k >. The reslt of all this is that if the position of or roller coaster as a fnction of time t is given by RHtL = HxHtL, y HtL, zhtll, then x HtL + y HtL is constant, and z HtL = v z = khz top - zhtll + v top. à Determining Position The center rail of the track will be a closed space crve with a given parametrization rhl = Hr 1 HL, r HL, r 3 HLL. This parameterization will only describe the path of the vehicle, not its position as a fnction of time. Since an animation will consist of a seqence of frames that show the roller coaster at eqally-spaced times, Dt, Dt,3Dt,, we need to determine the position of the vehicle at each of these times. This will be done by compting a corresponding seqence of vales of the parameter, which will entail recompting the parameter step D for each sccessive frame. The method for compting each sccessive D is developed as follows. Sppose that the actal position of the vehicle at time t is given by RHtL = HxHtL, y HtL, zhtll. Then, thinking of as a fnction of t, we have from which follows RHtL = rhhtll, R HtL = âr â â ât by the Chain Rle. We assme that â ât >, so it follows that â ât = R HtL ± âr â µ. Now, since x HtL + y HtL is constant and z HtL = v z = khz top - zhtll + v top, this becomes â ât = "################################ khz top - zhtll + c ± âr â µ, where c is a constant. Ths, the variable parameter step corresponding to the fixed time step D t can be estimated as D» "################ khz #################### top -r 3 H LL + c r H L which can be compted withot knowledge of RHtL. Since D t is fixed, we will introdce new constants k Ž and and rewrite this simply as D» k Ž "################ z ############### top - r 3 H L + r H L D t,.
3 The apparent speed of the vehicle in or animations will be controlled by adjsting the constants k Ž and. à The Vehicle and Its Orientation The vehicle will be represented by a flexible tbe connected to the center rail of the track. Its crosssections orthogonal to the track will be circles that intersect the track s center rail. At each point on the center rail there is a plane that is orthogonal to the path at that point and contains a circlar crosssection of the tbe. In that plane, imagine two coordinate axes, a horizontal axis that is parallel to the track srface and a vertical axis that is orthogonal to the track. These axes are indeed horizontal and vertical with respect to the orientation of the vehicle. So in order to keep the vehicle oriented properly at each location along the track, we need to compte a pair of orthogonal vectors that point in the directions of the axes jst described. These vectors are: (i) NHL, a nit vector that is orthogonal to the center rail and parallel to the track srface; (ii) BHL, a nit vector that is orthogonal to both the center rail and NHL. With these vectors defined, we can now describe the srface we will se to represent the vehicle at any point rhl on the track. Its parametrization is FHs, ql = rhsl +rbhsl H1 + cos ql +rsin q NHsL, - { s + {, q p. where r is the radis of the vehicle s circlar cross-sections, and { is the vehicle s length. à A Track Given by a Closed Coordinate Crve on a Parametric Srface A nice example is provided by a Möbis strip, an example of which is parametrized and plotted as follows. q@_, v_d := 8H - v Sin@ DL Cos@D, v Cos@ D, H - v Sin@ DL Sin@D<;
4 track = ParametricPlot3D@Evalate@q@, vdd, 8,, p<, 8v, -.,.<, PlotPoints -> 86, 3<, Boxed -> False, Axes -> FalseD; Ÿ The Vector Comptations The track s center rail is the coordinate crve parametrized by r@_d = q@, D 8 Cos@D,, Sin@D< (By coordinate crve we mean a crve with parametrization given by setting one of the coordinates of the srface parametrization eqal to a constant.) The corresponding nit tangent vector is nittan@_d = r Simplify 8-Sin@D,, Cos@D< A vector that is parallel to the track srface and not parallel to the crve is given by q v v =. vec@_d = v q@, vd.v Simplify 9-Cos@D SinA E, CosA E, -SinA E Sin@D= evalated at One step of the Gram-Schmidt process prodces a vector that is parallel to the track srface and orthogonal to the crve: nrml@_d = vec@d - vec@d.nittan@d nittan@d 9-Cos@D SinA E, CosA E, -SinA E Sin@D=
5 The corresponding nit vector is = nrml@d.nrml@d TrigExpand Simplify SinA E, CosA E, -SinA E Sin@D= This is the vector denoted above by NHL. (Note that in this example, the last two steps prodced no change. These steps are needed in general, however.) Finally, the cross prodct THL NHL prodces the vector denoted above by BHL: binrml@_d = nittan@d nitnrml@d Simplify 9-CosA E Cos@D, -SinA E, -CosA E Sin@D= Ÿ The Vehicle The following prodces the vehicle at any point along the crve. Below that is a sample plot sing = 1.5. tbe@_d := ParametricPlot3D@Evalate@ r@sd +.15 HH1 + Cos@vDL binrml@sd + Sin@vD nitnrml@sdld, 8s, -., +.<, 8v,, p<, PlotPoints -> 85, 9<, DisplayFnction -> IdentityD; Show@tbe@1.5D, DisplayFnction -> $DisplayFnction D ; Ÿ The Animation Now we are ready to compte the frames for the animation. The first line below defines the fnction that comptes the parameter step D. The nmbers. and.67 there were chosen experimentally. Forty-eight frames will be prodced, the first of which is shown below.
6 ztop = ;!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ztop - r@d@@3dd +. Step@_D =.67!!!!!!!!!!!!!!!!!!!!!!!!!! = ; While@ 4 p, = + Step@D; Show@tbe@D, track, Axes -> False, PlotRange -> 88-.5,.5<, 8-1.1, 1.1<, 8-.5,.5<<, Boxed -> False, DisplayFnction -> $DisplayFnction DD; Clear@D à A Track Given by a Closed Space Crve An interesting track is obtained from the crve parametrized by r@_d := 8-H + Cos@DL Sin@ D, H + Sin@DL Cos@ D, Cos@D< ParametricPlot3D@Evalate@r@DD, 8,, p<, ViewPoint 83, -, 1<D;
7 Ÿ The Vector Comptations In this sitation the vectors of interest comprise the classical TNB frame at each point along the crve. Becase even fairly simple crves give rise to very large and complicated symbolic expressions for the necessary vectors, we will not calclate them explicitly. The tangent vector of interest here is = TrigExpand Simplify Cos@D- 3 Cos@3D, - Cos@D + 3 Cos@3D-4 Sin@D, - Sin@D= The corresponding nit tangent vector THL is nittan@_d := ModleA8v = tanv@d<, v!!!!!!!! E v.v We will approximate the derivative of this nit tangent vector by a central difference approximation: dt@_d := HnitTan@ +.5D - nittan@ -.5DL.1 Now, the principal nit normal vector NHL is nitnrml@_d := ModleA8n = dt@d<, n!!!!!!!! E n.n Finally the cross prodct THL NHL prodces the binormal vector BH L: binrml@_d := nittan@d nitnrml@d Ÿ The Track and the Vehicle To prodce the track from the crve, we se the vector NHL to create a srface parametrized by GH, vl = rhl + vnhl, p, - w v w, where w is the width of the track.
8 track = ParametricPlot3D@r@D + v nitnrml@d, 8,, p<, 8v, -.,.<, ViewPoint 83, -, 1<, PlotPoints -> 81, 3<D; The following prodces the vehicle at any point along the crve. Below that is a sample plot sing =. (Note the absence of the Evalate fnction inside of ParametricPlot3D here. This is becase of the way the nit normal and binormal vectors were defined above with delayed evalation.) tbe@_d := ParametricPlot3D@ r@sd +. binrml@sd H1 + Cos@qDL +. Sin@qD nitnrml@sd, 8s, -.15, +.15<, 8q,, p<, PlotPoints -> 85, 9<, DisplayFnction -> IdentityD; Show@tbe@D, DisplayFnction $DisplayFnctionD; Ÿ The Animation This animation is created in essentially the same way as the previos one. Forty frames will be prodced with the particlar parameter vales sed. The GraphicsArray that follows contains frames 1, 14,, and.
9 ztop = ;!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ztop - r@d@@3dd +. Step@_D =!!!!!!!!!!!!!!!!!!!!!!!!! = ; While@ p, = + Step@D; Show@tbe@D, track, ViewPoint 83, -, 1<, Axes -> False, PlotRange -> , 3<, 8-3.3, 3.3<, 8-.1,.4<<, DisplayFnction -> $DisplayFnction DD; Clear@D
EECS 487: Interactive Computer Graphics f
Interpolating Key Vales EECS 487: Interactive Compter Graphics f Keys Lectre 33: Keyframe interpolation and splines Cbic splines The key vales of each variable may occr at different frames The interpolation
More informationApplication of Gaussian Curvature Method in Development of Hull Plate Surface
Marine Engineering Frontiers (MEF) Volme 2, 204 Application of Gassian Crvatre Method in Development of Hll Plate Srface Xili Zh, Yjn Li 2 Dept. of Infor., Dalian Univ., Dalian 6622, China 2 Dept. of Naval
More informationIntroduction to Computational Manifolds and Applications
IMPA - Institto de Matemática Pra e Aplicada, Rio de Janeiro, RJ, Brazil Introdction to Comptational Manifolds and Applications Part 1 - Constrctions Prof. Marcelo Ferreira Siqeira mfsiqeira@dimap.frn.br
More information5.0 Curve and Surface Theory
5. Cre and Srface Theor 5.1 arametric Representation of Cres Consider the parametric representation of a cre as a ector t: t [t t t] 5.1 The deriatie of sch a ector ealated at t t is gien b t [ t t t ]
More informationSummer 2017 MATH Suggested Solution to Exercise Find the tangent hyperplane passing the given point P on each of the graphs: (a)
Smmer 2017 MATH2010 1 Sggested Soltion to Exercise 6 1 Find the tangent hyperplane passing the given point P on each of the graphs: (a) z = x 2 y 2 ; y = z log x z P (2, 3, 5), P (1, 1, 1), (c) w = sin(x
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationAn Optimization of Granular Network by Evolutionary Methods
An Optimization of Granlar Networ by Evoltionary Methods YUN-HEE HAN, KEUN-CHANG KWAK* Dept. of Control, Instrmentation, and Robot Engineering Chosn University 375 Seos-dong, Dong-g, Gwangj, 50-759 Soth
More informationVectors. May Mass. Velocity. Temperature. Distance. Density. Force. Acceleration. Volume
Vectors May 17 15 Vectors are mathematical qantities that hae direction and magnitde, and can be pictred as arrows. This is in contrast to scalars, which are qantities that hae a nmerical ale bt no direction.
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationMathematician Helaman Ferguson combines science
L A B 19 MATHEMATICAL SCULPTURES Parametric Srfaces Mathematician Helaman Fergson combines science and art with his niqe mathematical sclptres. Fergson s sclptres are the concrete embodiments of mathematical
More informationCurve Modeling (Spline) Dr. S.M. Malaek. Assistant: M. Younesi
Crve Modeling Sline Dr. S.M. Malae Assistant: M. Yonesi Crve Modeling Sline Crve Control Points Convex Hll Shae of sline crve Interolation Slines Aroximation Slines Continity Conditions Parametric & Geometric
More informationCurves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science
Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types
More informationReview Multicycle: What is Happening. Controlling The Multicycle Design
Review lticycle: What is Happening Reslt Zero Op SrcA SrcB Registers Reg Address emory em Data Sign etend Shift left Sorce A B Ot [-6] [5-] [-6] [5-] [5-] Instrction emory IR RegDst emtoreg IorD em em
More informationMETAPOST and the FIIT Logo
METAPOST and the FIIT Logo Matej KOŠÍK Slovak University of Technology Faclty of Informatics and Information Technologies Ilkovičova 3, 842 16 Bratislava, Slovakia kosik@fiit.stba.sk 1 The Tools Abstract.
More informationContinuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function
J Electr Eng Technol Vol., No.?: 74-?, 5 http://dx.doi.org/.537/jeet.5..?.74 ISSN(Print) 975- ISSN(Online) 93-743 Continity Smooth Path Planning Using Cbic Polomial Interpolation with Membership Fnction
More informationGraphing on the Riemann Sphere
The Mathematica Journal Graphing on the Riemann Sphere Djilali Benayat We give a procedure to plot parametric curves on the sphere whose advantages over classical graphs in the Cartesian plane are obvious
More informationReal-time mean-shift based tracker for thermal vision systems
9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University
More informationPARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT
PAAMETE OPTIMIZATION FO TAKAGI-SUGENO FUZZY MODELS LESSONS LEANT Manfred Männle Inst. for Compter Design and Falt Tolerance Univ. of Karlsrhe, 768 Karlsrhe, Germany maennle@compter.org Brokat Technologies
More informationThe LS-STAG Method : A new Immersed Boundary / Level-Set Method for the Computation of Incompressible Viscous Flows in Complex Geometries
The LS-STAG Method : A new Immersed Bondary / Level-Set Method for the Comptation of Incompressible Viscos Flows in Complex Geometries Yoann Cheny & Olivier Botella Nancy Universités LEMTA - UMR 7563 (CNRS-INPL-UHP)
More informationThe Intersection of Two Ringed Surfaces and Some Related Problems
Graphical Models 63, 8 44 001) doi:10.1006/gmod.001.0553, available online at http://www.idealibrary.com on The Intersection of Two Ringed Srfaces and Some Related Problems Hee-Seok Heo and Sng Je Hong
More informationToday. B-splines. B-splines. B-splines. Computergrafik. Curves NURBS Surfaces. Bilinear patch Bicubic Bézier patch Advanced surface modeling
Comptergrafik Matthias Zwicker Uniersität Bern Herbst 29 Cres Srfaces Parametric srfaces Bicbic Bézier patch Adanced srface modeling Piecewise Bézier cres Each segment spans for control points Each segment
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationConstrained Routing Between Non-Visible Vertices
Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,
More informationLecture 10. Diffraction. incident
1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see
More informationSZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization
SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Mltidimensional Prediction and Error- Controlled Qantization Dingwen Tao (University of California, Riverside) Sheng
More informationMore eamples with half half(0) handle Zero => 1000; > val it = 1000 : int half(1) handle Zero => 1000; > ncaght eception Odd half(0) handle Zero => 10
Lectre 4 0 More eamples with half half(0) handle Zero => 1000; > val it = 1000 : int half(1) handle Zero => 1000; > ncaght eception Odd half(0) handle Zero => 1000 Odd => 1001; > val it = 1000 : int half(3)
More informationMaximum Weight Independent Sets in an Infinite Plane
Maximm Weight Independent Sets in an Infinite Plane Jarno Nosiainen, Jorma Virtamo, Pasi Lassila jarno.nosiainen@tkk.fi, jorma.virtamo@tkk.fi, pasi.lassila@tkk.fi Department of Commnications and Networking
More informationKINEMATICS OF FLUID MOTION
KINEMATICS OF FLUID MOTION The Velocity Field The representation of properties of flid parameters as fnction of the spatial coordinates is termed a field representation of the flo. One of the most important
More informationThe extra single-cycle adders
lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since
More informationFast Ray Tetrahedron Intersection using Plücker Coordinates
Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,
More information11 - Bump Mapping. Bump-Mapped Objects. Bump-Mapped Objects. Bump-Mapped Objects. Limitations Of Texture Mapping. Bumps: Perturbed Normals
CSc 155 Advanced Compter Graphics Limitations Of extre Mapping extre mapping paints srfaces o extre image is typically fixed Some characteristics are difficlt to textre o Roghness, Wrinkles extre illmination
More informationFINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES
FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion
More informationMethod to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot
Method to bild an initial adaptive Nero-Fzzy controller for joints control of a legged robot J-C Habmremyi, P. ool and Y. Badoin Royal Military Academy-Free University of Brssels 08 Hobbema str, box:mrm,
More informationBearing capacity of foundations resting on a spatially random soil
Bearing capacity of fondations resting on a spatially random soil Abdl-Hamid Sobra, Dalia S. Yossef Abdel Massih 2 and Mikaël Kalfa 3 rofessor, University of Nantes, GeM, UMR CNRS 683, Bd. de l niversité,
More informationUncertainty Determination for Dimensional Measurements with Computed Tomography
Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association
More informationPipelining. Chapter 4
Pipelining Chapter 4 ake processor rns faster Pipelining is an implementation techniqe in which mltiple instrctions are overlapped in eection Key of making processor fast Pipelining Single cycle path we
More informationNash Convergence of Gradient Dynamics in General-Sum Games. Michael Kearns.
Convergence of Gradient Dynamics in General-Sm Games Satinder Singh AT&T Labs Florham Park, NJ 7932 bavejaresearch.att.com Michael Kearns AT&T Labs Florham Park, NJ 7932 mkearnsresearch.att.com Yishay
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018
OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde
More informationMath 265 Exam 3 Solutions
C Roettger, Fall 16 Math 265 Exam 3 Solutions Problem 1 Let D be the region inside the circle r 5 sin θ but outside the cardioid r 2 + sin θ. Find the area of D. Note that r and θ denote polar coordinates.
More informationBlended Deformable Models
Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University
More informationOn the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing
1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity
More informationMETAMODEL FOR SOFTWARE SOLUTIONS IN COMPUTED TOMOGRAPHY
VOL. 10, NO 22, DECEBER, 2015 ISSN 1819-6608 ETAODEL FOR SOFTWARE SOLUTIONS IN COPUTED TOOGRAPHY Vitaliy ezhyev Faclty of Compter Systems and Software Engineering, Universiti alaysia Pahang, Gambang, alaysia
More informationGoals: Course Unit: Describing Moving Objects Different Ways of Representing Functions Vector-valued Functions, or Parametric Curves
Block #1: Vector-Valued Functions Goals: Course Unit: Describing Moving Objects Different Ways of Representing Functions Vector-valued Functions, or Parametric Curves 1 The Calculus of Moving Objects Problem.
More informationHardware-Accelerated Free-Form Deformation
Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric
More informationUse Trigonometry with Right Triangles
. a., a.4, 2A.2.A; G.5.D TEKS Use Trigonometr with Right Triangles Before Yo sed the Pthagorean theorem to find lengths. Now Yo will se trigonometric fnctions to find lengths. Wh? So o can measre distances
More informationComp 303 Computer Architecture A Pipelined Datapath Control. Lecture 13
Comp 33 Compter Architectre A Pipelined path Lectre 3 Pipelined path with Signals PCSrc IF/ ID ID/ EX EX / E E / Add PC 4 Address Instrction emory RegWr ra rb rw Registers bsw [5-] [2-6] [5-] bsa bsb Sign
More informationEEC 483 Computer Organization
EEC 483 Compter Organization Chapter 4.4 A Simple Implementation Scheme Chans Y The Big Pictre The Five Classic Components of a Compter Processor Control emory Inpt path Otpt path & Control 2 path and
More informationComputing the weights of criteria with interval-valued fuzzy sets for MCDM problems Chen-Tung Chen 1, Kuan-Hung Lin 2, Hui-Ling Cheng 3
Compting the weights of criteria with interval-valed fzzy sets for MCDM problems Chen-ng Chen Kan-Hng in 2 Hi-ing Cheng 3 Department of Information Management National nited niversity aiwan 2 Specialist
More informationEFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES. Curtis D. Mobley and Lydia Sundman Sequoia Scientific, Inc. th
EFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES Crtis D. Mobley and Lydia Sndman Seqoia Scientific, Inc. th 15317 NE 90 Street Redmond, WA 98052 USA mobley@seqoiasci.com phone: 425-867-2464
More informationReview: Computer Organization
Review: Compter Organization Pipelining Chans Y Landry Eample Landry Eample Ann, Brian, Cathy, Dave each have one load of clothes to wash, dry, and fold Washer takes 3 mintes A B C D Dryer takes 3 mintes
More informationComputer Architecture Chapter 5. Fall 2005 Department of Computer Science Kent State University
Compter Architectre Chapter 5 Fall 25 Department of Compter Science Kent State University The Processor: Datapath & Control Or implementation of the MIPS is simplified memory-reference instrctions: lw,
More informationDate: December 5, 1999 Dist'n: T1E1.4
12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:
More informationFast Obstacle Detection using Flow/Depth Constraint
Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl
More informationp 1 p 2 p 3 S u( ) θ
Preprint of a paper pblished in inimal Srfaces, Geometric Analysis and Symplectic Geometry Adv. Std. Pre ath, 34 (2002) 129 142. SOLUTION TO THE SHADOW PROBLE IN 3-SPACE OHAAD GHOI Abstract. If a convex
More informationA sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationLast lecture: finishing up Chapter 22
Last lectre: finishing p Chapter 22 Hygens principle consider each point on a wavefront to be sorce of secondary spherical wavelets that propagate at the speed of the wave at a later time t, new wavefront
More informationIntegrating Equations of Motion in Mathematica
MmaGuide-GLG.nb Integrating Equations of Motion in Mathematica Gary L. Gray Assistant Professor Engineering Science and Mechanics The Pennsylvania State University 227 Hammond Building University Park,
More informationDiscretized Approximations for POMDP with Average Cost
Discretized Approximations for POMDP with Average Cost Hizhen Y Lab for Information and Decisions EECS Dept., MIT Cambridge, MA 0239 Dimitri P. Bertsekas Lab for Information and Decisions EECS Dept., MIT
More informationCOMPOSITION OF STABLE SET POLYHEDRA
COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationTopological Drawings of Complete Bipartite Graphs
Topological Drawings of Complete Bipartite Graphs Jean Cardinal Stefan Felsner y Febrary 017 Abstract Topological drawings are natral representations of graphs in the plane, where vertices are represented
More informationChapter 6: Pipelining
CSE 322 COPUTER ARCHITECTURE II Chapter 6: Pipelining Chapter 6: Pipelining Febrary 10, 2000 1 Clothes Washing CSE 322 COPUTER ARCHITECTURE II The Assembly Line Accmlate dirty clothes in hamper Place in
More informationEEC 483 Computer Organization. Branch (Control) Hazards
EEC 483 Compter Organization Section 4.8 Branch Hazards Section 4.9 Exceptions Chans Y Branch (Control) Hazards While execting a previos branch, next instrction address might not yet be known. s n i o
More informationHardware Design Tips. Outline
Hardware Design Tips EE 36 University of Hawaii EE 36 Fall 23 University of Hawaii Otline Verilog: some sbleties Simlators Test Benching Implementing the IPS Actally a simplified 6 bit version EE 36 Fall
More informationCS 450: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 2015 DR. MICHAEL J. REALE
CS 45: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 215 DR. MICHAEL J. REALE CLIPPING Clipping = removing part or all of the primitives otside of the clipping volme/window Clipping volme in OpenGL nit cbe
More informationComputer-Aided Mechanical Design Using Configuration Spaces
Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)
More informationASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES
ASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES Workgrop Metrology of CNRS research network 2519 a MCIMS, Presented by Larent Robert and Jean-José Orte b a http://www.ifma.fr/lami/gdr2519/ b CROMeP,
More informationMaking Holes and Windows in Surfaces
The Mathematica Journal Making Holes and Windows in Surfaces Alan Horwitz In this article, we demonstrate makehole, a program which removes points from any Graphics or Graphics3D picture whose coordinates
More informationThe final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.
The final path PC 4 Add Reg Shift left 2 Add PCSrc Instrction [3-] Instrction I [25-2] I [2-6] I [5 - ] register register 2 register 2 Registers ALU Zero Reslt ALUOp em Data emtor RegDst ALUSrc em I [5
More informationEnhanced Performance with Pipelining
Chapter 6 Enhanced Performance with Pipelining Note: The slides being presented represent a mi. Some are created by ark Franklin, Washington University in St. Lois, Dept. of CSE. any are taken from the
More information4.13 Advanced Topic: An Introduction to Digital Design Using a Hardware Design Language 345.e1
.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage 35.e.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage to Describe and odel a Pipeline
More informationOptimal Sampling in Compressed Sensing
Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007 1 On the Analysis of the Bletooth Time Division Dplex Mechanism Gil Zssman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali
More informationAppearance Based Tracking with Background Subtraction
The 8th International Conference on Compter Science & Edcation (ICCSE 213) April 26-28, 213. Colombo, Sri Lanka SD1.4 Appearance Based Tracking with Backgrond Sbtraction Dileepa Joseph Jayamanne Electronic
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationMa Lesson 18 Section 1.7
Ma 15200 Lesson 18 Section 1.7 I Representing an Ineqality There are 3 ways to represent an ineqality. (1) Using the ineqality symbol (sometime within set-bilder notation), (2) sing interval notation,
More informationChapter 6 Enhancing Performance with. Pipelining. Pipelining. Pipelined vs. Single-Cycle Instruction Execution: the Plan. Pipelining: Keep in Mind
Pipelining hink of sing machines in landry services Chapter 6 nhancing Performance with Pipelining 6 P 7 8 9 A ime ask A B C ot pipelined Assme 3 min. each task wash, dry, fold, store and that separate
More informationReview. A single-cycle MIPS processor
Review If three instrctions have opcodes, 7 and 5 are they all of the same type? If we were to add an instrction to IPS of the form OD $t, $t2, $t3, which performs $t = $t2 OD $t3, what wold be its opcode?
More informationMath 5BI: Problem Set 2 The Chain Rule
Math 5BI: Problem Set 2 The Chain Rule April 5, 2010 A Functions of two variables Suppose that γ(t) = (x(t), y(t), z(t)) is a differentiable parametrized curve in R 3 which lies on the surface S defined
More informationAn Introduction to GPU Computing. Aaron Coutino MFCF
An Introdction to GPU Compting Aaron Cotino acotino@waterloo.ca MFCF What is a GPU? A GPU (Graphical Processing Unit) is a special type of processor that was designed to render and maniplate textres. They
More informationRepresentations of Curves and Surfaces, and of their Tangent Lines, and Tangent Planes in R 2 and R 3 Robert L.Foote, Fall 2007
CurvesAndSurfaces.nb Representations of Curves and Surfaces, and of their Tangent Lines, and Tangent Planes in R and R 3 Robert L.Foote, Fall 007 Curves and Surfaces Graphs ü The graph of f : Æ is a curve
More informationENGI Parametric & Polar Curves Page 2-01
ENGI 3425 2. Parametric & Polar Curves Page 2-01 2. Parametric and Polar Curves Contents: 2.1 Parametric Vector Functions 2.2 Parametric Curve Sketching 2.3 Polar Coordinates r f 2.4 Polar Curve Sketching
More informationEXAMINATIONS 2003 END-YEAR COMP 203. Computer Organisation
EXAINATIONS 2003 COP203 END-YEAR Compter Organisation Time Allowed: 3 Hors (180 mintes) Instrctions: Answer all qestions. There are 180 possible marks on the eam. Calclators and foreign langage dictionaries
More informationSwitched state-feedback controllers with multi-estimators for MIMO systems
Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November - 6 89 witched state-feedback controllers with mlti-estimators for MIMO sstems LIBOR
More informationObject Pose from a Single Image
Object Pose from a Single Image How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the
More informationStatistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem
Statistical Methods in fnctional MRI Lectre 7: Mltiple Comparisons 04/3/13 Martin Lindqist Department of Biostatistics Johns Hopkins University Data Processing Pipeline Standard Analysis Data Acqisition
More informationf x y z ds f P S (,, ) lim ( ) ds f P S S S.
4.7 rface Integral We diide srface into patches patch, mltiply by the area with area, and form the sm n n i j f P ( ). We ealate f at a point P, in each Then we take the limit as the patch size approaches
More informationCompound Catadioptric Stereo Sensor for Omnidirectional Object Detection
Compond Catadioptric Stereo Sensor for mnidirectional bject Detection Ryske Sagawa Naoki Krita Tomio Echigo Yasshi Yagi The Institte of Scientific and Indstrial Research, saka University 8-1 Mihogaoka,
More informationThe multicycle datapath. Lecture 10 (Wed 10/15/2008) Finite-state machine for the control unit. Implementing the FSM
Lectre (Wed /5/28) Lab # Hardware De Fri Oct 7 HW #2 IPS programming, de Wed Oct 22 idterm Fri Oct 2 IorD The mlticycle path SrcA Today s objectives: icroprogramming Etending the mlti-cycle path lti-cycle
More informationTDT4255 Friday the 21st of October. Real world examples of pipelining? How does pipelining influence instruction
Review Friday the 2st of October Real world eamples of pipelining? How does pipelining pp inflence instrction latency? How does pipelining inflence instrction throghpt? What are the three types of hazard
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 11 Fall, 2018
Assigned: 11/14/18 Lectre 24 De: 11/21/18 Lectre 26 11-1) A 200 mm x 300 mm monochrome monitor is to be viewed b an observer at a distance of 0.5 m. The desired image qalit is to be excellent as determined
More informationThe single-cycle design from last time
lticycle path Last time we saw a single-cycle path and control nit for or simple IPS-based instrction set. A mlticycle processor fies some shortcomings in the single-cycle CPU. Faster instrctions are not
More informationd f(g(t), h(t)) = x dt + f ( y dt = 0. Notice that we can rewrite the relationship on the left hand side of the equality using the dot product: ( f
Gradients and the Directional Derivative In 14.3, we discussed the partial derivatives f f and, which tell us the rate of change of the x y height of the surface defined by f in the x direction and the
More informationAssignment 1. Prolog to Problem 1. Two cylinders. ü Visualization. Problems by Branko Curgus
Assignment In[]:= Problems by Branko Curgus SetOptions $FrontEndSession, Magnification Prolog to Problem. Two cylinders In[]:= This is a tribute to a problem that I was assigned as an undergraduate student
More informationh-vectors of PS ear-decomposable graphs
h-vectors of PS ear-decomposable graphs Nima Imani 2, Lee Johnson 1, Mckenzie Keeling-Garcia 1, Steven Klee 1 and Casey Pinckney 1 1 Seattle University Department of Mathematics, 901 12th Avene, Seattle,
More informationEXAMINATIONS 2010 END OF YEAR NWEN 242 COMPUTER ORGANIZATION
EXAINATIONS 2010 END OF YEAR COPUTER ORGANIZATION Time Allowed: 3 Hors (180 mintes) Instrctions: Answer all qestions. ake sre yor answers are clear and to the point. Calclators and paper foreign langage
More informationNetworks An introduction to microcomputer networking concepts
Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES
More informationInstruction fetch. MemRead. IRWrite ALUSrcB = 01. ALUOp = 00. PCWrite. PCSource = 00. ALUSrcB = 00. R-type completion
. (Chapter 5) Fill in the vales for SrcA, SrcB, IorD, Dst and emto to complete the Finite State achine for the mlti-cycle datapath shown below. emory address comptation 2 SrcA = SrcB = Op = fetch em SrcA
More information