Designing A Concrete Arch Bridge

Similar documents
Present state Next state Q + M N

d e c b a d c b a d e c b a a c a d c c e b

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

EE1000 Project 4 Digital Volt Meter

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Designing A Uniformly Loaded Arch Or Cable

QUESTIONS BEGIN HERE!

1 Introduction to Modulo 7 Arithmetic

Construction 11: Book I, Proposition 42

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

Seven-Segment Display Driver

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

Module 2 Motion Instructions

C-201 Sheet Bar Measures 1 inch

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Decimals DECIMALS.

JEA - BARTRAM RE-PUMP FACILITY POTABLE WATER STORAGE EXPANSION STRUCTURAL STORAGE TANK PLANS

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

QUESTIONS BEGIN HERE!

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

CS 103 BFS Alorithm. Mark Redekopp

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

Planar Upward Drawings

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

0.1. Exercise 1: the distances between four points in a graph

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

DETAIL B DETAIL A 7 8 APPLY PRODUCT ID LABEL SB838XXXX ADJ FOUR POST RACK SQUARE HOLE RAIL B REVISION

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

CS September 2018

Constructive Geometric Constraint Solving

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Polygons POLYGONS.

Outline. Binary Tree

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

CS 461, Lecture 17. Today s Outline. Example Run

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

LIVING/DINING 23'-6" x 13'-1" W/D M&E METER CLOSET OPT. PANTRY W/D. LIVING/DINING 23'-6" x 13'-1" ROOF TOP TERRACE AREA SQ. FT.

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

Physics 222 Midterm, Form: A

RAW / PEYOTE STITCH / BRICK STITCH / HERRINGBONE

Instructions for Section 1

Tangram Fractions Overview: Students will analyze standard and nonstandard

OpenMx Matrices and Operators

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM

COMP108 Algorithmic Foundations

Problem solving by search

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

SAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings

N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f

Fractions. Mathletics Instant Workbooks. Simplify. Copyright

TCI SERIES, 3 CELL THE COOLING TOWER CO., L.C. TCI 3 CELL SERIES GA

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Last time: introduced our first computational model the DFA.

AIR FORCE STANDARD DESIGN MILITARY WORKING DOG FACILITY

Multipoint Alternate Marking method for passive and hybrid performance monitoring

What do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse

Amphenol Canada Corp.

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

ECE Experiment #6 Kitchen Timer

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

12. Traffic engineering

Limits Indeterminate Forms and L Hospital s Rule

Walk Like a Mathematician Learning Task:

Floating Point Number System -(1.3)

Floating Point Number System -(1.3)

Schick CDR consumables catalogue

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Aquauno Video 6 Plus Page 1

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

TOPIC 5: INTEGRATION

The Z transform techniques

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

Section 3: Antiderivatives of Formulas

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms

CS 241 Analysis of Algorithms

Electric Potential. Electric Potential Video: Section 1 4. Electric Fields and WORK 9/3/2014. IB Physics SL (Year Two) Wednesday, September 3, 2014

Self-Adjusting Top Trees

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?

Transcription:

This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr or t th top o ny p. Whn you r on with this lsson, lik on th Contnts utton hr or t th top o ny p to rturn to th list o lssons.

7 99 t 100 11 t 11 t Th Prolm: This is prtilly inish orm irm o ri tht will spn 99 t. Th rwy slops t 7%. Eiht wlls sp 11 t prt rin totl ls o 120 h rom th sti k to onrt rh low. Th rh is onrt sl tht is 8 inhs thik n 16 t wi throuhout th spn. Th llowl xil strss in th rh is 800 l/in 2. Shp th rh in suh wy tht smnt is prlll to th ri k s shown.

7 99 t 100 11 t 11 t Stp 1: Wht is th mximum llowl xil or in th rh Th ivn prmtrs r n rh thiknss o 8 inhs, n rh with o 16 t, n n llowl strss o 800 l/in 2. Th ross stionl r o th rh is its with tims its thiknss: Ar = (with)(thiknss) = (16 t)(12 in./t)(8 in.) = 1536 in 2 Th llowl xil or in th rh is th r o th rh tims th llowl strss: For = (Ar)(llowl strss) = (1536 in 2 )(800 l/in 2 ) = 1,228,800 l = 1229

A B Stp 2: Construt lin irm n pply intrvl nottion. Workin lokwis rom th uppr lt, pl xtrnl rvity ls on th orm irm. Th sps or intrvls twn ors r ll with th upprs lttrs o th lpht. In this irm, th irst ip l is pl ovr th ltmost rh wll. Lttrs A n B r ssin to th intrvls on ithr si o th l. This is l AB.

A B C Th son l is pl ovr th nxt rh wll. Lttr C is to th irm, n this oms l BC. With h l, vrtil lin o tion is xtn own throuh th r o th orm irm whr th rh will onstrut.

A B C D Th pross ontinus until ll th ls on th rh hv n onstrut n ll. This is l CD.

A B C D E This is l DE.

A B C D E F This is l EF.

A B C D E F G This is l FG.

A B C D E F G H This is l GH.

This is l HI. Th lin irm is now omplt. All o th xtrnl rvity ls tin on th rh hv n pl on th lin irm. Vrtil lins o tion hv n rwn or h l, xtnin own throuh th r o th orm irm whr th rh will onstrut.

Stp 3: Construt l lin to ny onvnint sl. Th L Lin is rphil summtion o th ls tin on th strutur. On th L Lin, th mnitu o th ors rom th lin irm r rwn to sl. Binnin with or AB, w plot smnt o th l lin, prlll to AB, ll. Th lnth o sls to 120, th mnitu o th or. 120 L Lin 400

On in, w work lokwis roun th Form Dirm, plottin h l onto th L Lin in tip-totil shion. Althouh th L Lin is ompos o vtors, th ns o th or smnts r mrk with horizontl tik mrks rthr thn rrow hs. This hlps to kp th irm lil n urt. Vtors rrn tip-to-til L Lin 400

Sin ll o th ls on our rh r o qul mnitu, h smnt o th L Lin will qul in lnth. Whn th ls on strutur vry in mnitu, or r not ll stritly vrtil in irtion, th smnts o th L Lin will vry in lnth n irtion s wll. L Lin 400

W ontinu ross th, plottin ll th ls on th rh onto th L Lin. Noti how intrvls on th orrspon to points on th L Lin. L Lin 400

W ontinu ross th... L Lin 400

W ontinu ross th... L Lin 400

W ontinu ross th... h L Lin 400

Th L Lin is now omplt. Th totl lnth o th L Lin is qul to th totl l on th rh, in this s 960. 0 200 400 600 800 1000 1200 L Lin 960 h i 400

Stp 4: Construt ry o known irtion ut unknown lnth. Ry is vtor whos lnth is qul to th mnitu o th or in rh smnt, n whos irtion is prlll to tht or. Construt ry throuh point on th l lin, prlll to rh smnt. Althouh w on t yt know th lotion o point o, th lt n o ry, it must our somwhr lon this lin. h i L Lin 400

A B C D E Hr is th qution w us in Stp 1 to in th mximum llowl or in th rh: For = (Ar)(llowl strss) = (1536 in 2 )(800 l/in 2 ) = 1,228,800 l = 1229 F G H I Stp 5: Construt th lonst ry n in point o. Evn or w know th lotion o point o, w n skth th nrl lyout o th rys o th For Polyon. W n s rom this skth tht, or ny point o tht lis on ry, ry o will th lonst ry, orrsponin to th rtst or in th rh. Thus w must limit ry o to lnth o 1229. Ry o is th lonst ry L Lin o o o o o oh h i 400

From point, w us ompss to strik n r o rius 1229, th mximum or llowl in th rh. Whr this r intrsts with ry is point o. Th L Lin hs now om prt o For Polyon. Point o is th Pol o th irm. Hr is th qution w us in Stp 1 to in th mximum llowl or in th rh: For = (Ar)(llowl strss) = (1536 in 2 )(800 l/in 2 ) = 1,228,800 l = 1229 Pol o h i For Polyon 400 rius = 1229 ry o

By slin th lnth o ry on th For Polyon, w n now trmin th mnitu o th or in smnt o th rh. 1098 o h i For Polyon 400 rius = 1229 1098 o 0 200 400 600 800 1000 1200

1113 1098 Stp 6: Throuh th Pol o, onstrut th rminin rys o th For Polyon, innin t th ntr n workin towr th ns. As h ry is rwn, onstrut prlll to it th orrsponin smnt o th onrt rh on th Form Dirm. Sl th lnth o h ry to in th mnitu o th or in th orrsponin smnt o th rh. o h i For Polyon 400 1113 o

This is ry o. o 1141 1113 1098 o h i For Polyon 400 1141 o o

This is ry o. o 1180 o 1141 1113 1098 o 1180 h i For Polyon 400 o o o

This is ry o. 1229 o o 1180 o 1141 1113 1098 o 1229 h i For Polyon 400 o o o

This is ry o. 1229 o o 1180 o 1141 1113 1098 o 1097 o h i For Polyon 400 1097 o o o o

This is ry o. 1229 o o 1180 o 1141 1113 1098 o 1097 o 1108 o h i For Polyon 400 1108 o o o o o

This is ry oh. 1229 o o 1180 o 1141 1113 1098 o 1097 o 1108 oh 1132 o 1132 o o o o o oh h For Polyon 400

This is ry oi. 1229 o o 1180 o 1141 1113 1098 o 1097 o 1108 oh 1132 oi 1168 o h i For Polyon 400 1168 o o o o o oh oi

A B C D E F G H I This is th ri tht you hv sin. Th or polyon is rphil tool tht llows you to in th ors in strutur, n to in simultnously th pproprit orm or th strutur. 1229 o o 1180 o 1141 1113 1098 o 1097 o 1108 oh 1132 oi 1168 o h i For Polyon 400 Mximum or in rh o oi o o o o oh

A o 1168 B o 1132 C o 1108 D 1097 E 1098 F o 1113 G o 1141 H oi 1229 oh 1180 I Usin th sm mth tht w us to in th orm n ors or th rh, w n in th orm o suspnsion ri whos l n sly rry ivn mximum or. Th pol o th For Polyon lis to th riht o th l lin, rthr thn to th lt. Th ors in th l r tnsil, rthr thn omprssiv. Clik on th Contnts utton to in nw lsson. Clik on th im o th Shwnh Bri to rturn to th innin o this lsson. h i o o o o o oh oi o For Polyon 400