A Visual and Interactive Input abb Automata. Theory Course with JFLAP 4.0

Size: px
Start display at page:

Download "A Visual and Interactive Input abb Automata. Theory Course with JFLAP 4.0"

Transcription

1 Strt Puse Step Noninverted Tree A Visul nd Interctive Input Automt String ccepted! 5 nodes generted. Theory Course with JFLAP 4.0 q0 even 's, even 's q2 even 's, odd 's q1 odd 's, even 's q3 odd 's, odd 's S S S B B! Ryn Cvlcnte Thoms q4 Finley Susn H. Rodger S S B! This work ws supported y: Ntionl Science Foundtion DUE Derived! from B. Derivtions complete. Deprtment of Computer Science Duke University Mrch 4, 2004

2 Outline Why develop Tools? Previous Work Wht is JFLAP? How Does JFLAP Fit In Automt Course? JFLAP's Use in the Course New Fetures of JFLAP Feedck nd Use of JFLAP JFLAP's Future

3 Students Redy to Lern Automt Theory!

4 Things strt well enough...

5 But soon, insted of pictures, there re WORDS.

6 Big words! The type with more thn one syllle!

7 VIOLENCE AMONG STUDENTS AS NERVES FRAY!

8 We only wnted to lern utomt theory! Isn t there etter wy?

9 Try JFLAP...

10 Students Lerning Automt with JFLAP

11 Why Develop Tools for Automt Theory? Different Representtions of Presenttion Textul Tulr Visul q0 q1 q2 Interctive q0 q1 q2

12 Why Develop Tools for Automt Theory? Different Representtions of Presenttion Exmined 10 utomt theory textooks in pst 11 yers (Tylor, Cohen, Sipser, Kelley, Linz, Sudkmp, Lewis, Kiner, Hopcroft, Mrtin) One hd softwre integrted for prt of the ook (Tylor) All hd visul representtion of DFA Only 6 hd visul representtion for PDA Those hd few visul exmples, only 2 or 3 sttes Only 6 hd visul representtion for Turing mchine 3 of those switched different visul representtion Only 2 hd picture of NPDA creted in CFG to NPDA trnsformtion None hd picture of prse tree for unrestricted grmmr

13 Previous Work on Automt Tools y Others Turing's World - Brwise nd Etchemendy (1993) Deus Ex Mchin - Svoiu (seven models of computtion) Models of Computtion nd Forml Lnguges - Tylor (1998) Snpshots of the Theory of Computing - Ross (2002)

14 Our Previous Work on Automt Tools JFLAP - creting nd experimenting with utomt nd grmmrs (SIGCSE 2000, SIGCSE 1999, SIGCSE 1997) JeLLRp - LL nd LR prsing (SIGCSE 1997) Pâté - Brute force prser, grmmr trnsformer (SIGCSE 1997) Lsys - creting L-systems The new JFLAP incorportes concepts from ll of these.

15 Thnks to Students Who Hve Worked on JFLAP nd Automt Theory Tools NPDA , C++ Dn Cugherty FLAP , C++ Mrk LoScco, Greg Bdros JFLAP , Jv version Eric Grmond, Ted Hung, Mgd nd Octvin Procopiuc Pâté, JeLLRp, Lsys Ann Bilsk, Json Slemme, Lenore Rmm, Alex Krweit, Royn Geer JFLAP Thoms Finley, Ryn Cvlcnte

16 Wht is JFLAP? Jv Forml Lnguges nd Automt Pckge Instructionl Tool to lern concepts of Forml Lnguges nd Automt Theory Regulr lnguges - crete DFA NFA regulr grmmr regulr expression q0 q2! q1 Regulr lnguges - conversions q0 q1 NFA DFA Miniml DFA NFA regulr expression NFA regulr grmmr 0 q2 0,1,2 0,1

17 Wht is JFLAP? (cont) Context-free lnguges - crete Strt Puse Step Noninverted Tree,! ;,! ; push-down utomton context-free grmmr Context-free lnguges - trnsform PDA CFG CFG PDA (LL prser) CFG PDA (LR prser) CFG CNF Input CFG LL prse tle nd prser CFG LR prse tle nd prser q0!, S ;! String ccepted! 5 nodes generted. S S S B B! CFG Brute force prser Derived! from B. Derivtions complete. S S q1 B!!, Z ;! q2

18 Wht is JFLAP? (cont) Recursively Enumerle lnguges Turing mchine (1-tpe) Turing mchine (multi-tpe) unrestricted grmmr unrestricted grmmr rute force prser L-Systems Crete L-systems

19 How JFLAP Fits Into Topics In Forml Lnguges Course Topic JFLAP 3.1 JFLAP 4.0 Finite Automt 1 1 Regulr Grmmrs/Expressions ¾ 1 Properties of Regulr Lnguges ½ Context-Free Grmmrs ½ 1 Simplify CFL 1 Pushdown Automt 1 1 Properties of CFL Turing Mchine (1-Tpe) ½ ¾ Other Models of TM ¼ ½ Recursively Enumerle Lnguges ¼ LL nd LR Prsing 1 L-Systems 1

20 How JFLAP Fits Into Topics In Forml Lnguges Course Summry JFLAP 3.1 covers 4 chpters of mteril spred out over 6 chpters. JFLAP 4.0 covers 9 chpters of mteril spred out over 11 chpters.

21 Use of JFLAP y Instructor Showing how to lyout items Poor: q0 q1 q2 q2 Better: q0 q1

22 Use of JFLAP y Instructor Is this correct for n n c n? ; 1, R 2 ; 2, R ;, R q1 ; 2, R 3 ; 3, R ;, R q2 c ; 3, L ;, L ;, L 3 ; 3, L 2 ; 2, L q0 1 ; 1, R q3 2 ; 2, R q4 How do we fix it?

23 Use of JFLAP y Instructor Experimenting with Difficult Concepts Nondeterminism: ww R Students ttempt t desk - difficult: wnt to find the middle Instructor solves with clss using JFLAP,! ;,! ;, ;!, ;!, ;!, Z ; Z, Z ; Z q0 q1, ;! q2 q3!, Z ; Z

24 Use of JFLAP y Instructor Testing Student Progrms ;, R! ;, R ;, R ;, L q0 ;, S! ;!, L q1 c ; c, R ; c, R q2 c ; c, S! ;!, R! ;!, R! ;!, R q3

25 Use of JFLAP y Instructor Relte to other CS Concepts Running Time Consider n n c n one-tpe TM O(n 2 ) two-tpe TM O(n)

26 Other Uses of JFLAP y Instructor Demonstrte Nondeterminism Demonstrte the running of CFG to PDA using LR method Which lookhed do you choose? Demonstrte trnsformtion from one form to nother Exmple: PDA to CFG And mny other uses...

27 JFLAP Student Use Recrete nd experiment with instructor s exmples Use with Homework A study id - crete dditionl exmples explore concepts in depth weker students get more feedck

28 Feedck from Students in CPS 140 Duke University - Spring 2003 Used JFLAP nd tools in 6 of 9 homeworks Questionnire - 33 responses Ws JFLAP esy to use? All 33 nswered yes. Did you look t the help t ll? If so, wht prt did you look t nd ws it helpful? 6 used help nd found it helpful, 27 did not look t help. Do you prefer creting FA using JFLAP or drwing them on pper? 17 students - prefer to use JFLAP 12 students - prefer pper first, then JFLAP for testing 2 students - prefer pper

29 New Fetures in JFLAP 4.0 RE FA reworked Brute force prsing Trnsform CF Grmmrs to Chomsky LL(1) nd SLR(1) prsing L-Systems Minor New Fetures in JFLAP 4.0 Compre Equivlence Comine Automt Grph Lyout 3-5 Tpe Turing Mchines

30 Finite Automt Editing nd Simultion The most sic feture of JFLAP hs lwys een the cretion of utomt, nd simultion of input on utomt. Here we demonstrte the cretion nd simultion on simple NFA.

31 FA Edit & Simultion Strt up JFLAP When we strt up JFLAP we hve choice of structures. The first of these is the Finite Automt!

32 FA Edit & Simultion Strt Editing! We strt with n empty utomton editor window.

33 FA Edit & Simultion Crete Sttes q0 q2 We crete some sttes... q1

34 FA Edit & Simultion Crete Trnsitions q0 c q2 We crete some trnsitions... q1

35 FA Edit & Simultion Initil nd Finl Stte c We set n initil nd finl stte. q0 q1 q2 Now we cn simulte input on this utomton!

36 FA Edit & Simultion Input to Simulte... When we sy we wnt to simulte input on this utomton, dilog sks us for the input.

37 FA Edit & Simultion Strt Simultion! q0 q1 c q2 When simultion strts, we hve configurtion on the initil stte with ll input remining to e processed.

38 FA Edit & Simultion After One Step q0 q1 c q2 This is nondeterministic FA, nd on this input we hve multiple configurtions fter we Step.

39 FA Edit & Simultion q0 After Two Steps The previous configurtions on c q2 q 1 nd q 2 re rejected, nd re shown in red. q1 The remining uncolored configurtions pths re not rejected, nd re still open.

40 FA Edit & Simultion After Three Steps c q0 q1 q2 Yet nother step.

41 FA Edit & Simultion After Four Steps c q0 q1 q2 One of the finl configurtions hs een ccepted!

42 FA Edit & Simultion Trceck One cn then see trceck to see the succession of configurtions tht led to the ccepting configurtion.

43 RE to FA New pproch strts with single RE trnsition in GTG, nd recursively reks RE trnsitions into norml FA trnsitions until the GTG ecomes n FA.

44 FA to RE New lgorithm trnsforms n FA to GTG, nd removes sttes until the GTG hs only the initil nd finl sttes. At this point conversion ecomes trivil. (+)(+) *

45 Amiguous Grmmr Prsing with SLR One cn lso prse strings with grmmrs in JFLAP using LL(1) or SLR(1) prsing. To the right is trivil, oviously miguous grmmr. We show how SLR(1) dels with miguity.

46 SLR(1) Prsing In order, students: Define First nd Follow Sets Build the FA modeling stck. Define the prse tle. Ornge entries indicte conflict in the prse tle. Current ctive vlue is displyed.

47 SLR(1) Prsing Suppose we prse with current conflicts oth set to the defult reduce entries. As students step, the prse tle entry eing used nd grmmr rule used (if reduce) is highlighted. Notice lso the input remining nd the stck.

48 SLR(1) Prsing Shown is the completed prse tree. Well done!

49 SLR(1) Prsing Recll the conflicts. When we click on the ornge entry, we cn choose different entry to resolve the conflict. In this cse we chnge the reduce opertions to shift opertions.

50 SLR(1) Prsing Notice, this chnge results in very different prse tree.

51 SLR(1) Prsing With Reduce Entries With Shift Entries

52 Brute Force Prsing Brute force prsing llows oth CFG nd unrestricted grmmr prsing. To the right is n unrestricted grmmr tht genertes the lnguge n n c n. We cn uild the unrestricted prse tree!

53 Brute Force Prsing We prse the string cc with the rute force prser. Notice how in this cse multiple nonterminl nodes re grouped together to form single node. This ccomplishes the unrestricted grmmr possily replcing multiple symols t once.

54 L-Systems L-Systems my e used to model iologicl systems nd crete frctls. Similr to Chomsky grmmrs, except ll vriles re replced in ech derivtion step, not just one! Commonly, strings from successive derivtions re interpreted s strings of render commnds nd re displyed grphiclly.

55 L-Systems This L-System renders s tree tht grows lrger with ech successive derivtion step.

56 L-Systems L-systems my lso e stochstic. The T Tg rule dds g to the derivtion, which drws line segment. We dd nother rewriting rule for T, T T. With two rewriting rules for T, the rule chosen is rndom, leding to uneven growth!

57 L-Systems The sme stochstic L-system, rendered 3 different times ll t the 9th derivtion.

58 Compre for Equivlence Determines if two FA recognize the sme lnguge. e q4 q0 q5 e e c d q0 c q1 d q2 q1 c q2 c q3

59 Multiple Tpe Turing Mchines For exmple, with 3 tpes, you cn reltively esily define Universl Turing Mchine. 1 ; 1, R 1 ; 1, S 1 ; 1, R 1 ; 1, S 1 ; 1, S! ;!, R 1 ; 1, S 0 ; 0, R 1 ; 1, S 1 ; 1, S! ;!, R 1 ; 1, S 1 ; 1, S 1 ; 1, S 1 ; 1, L 1 ; 1, R 1 ; 1, S 1 ; 1, S q11 q7 Rewind T3 Skip 4 T1 0s 1 ; 1, R 1 ; 1, S 1 ; 1, S 0 ; 0, R 1 ; 1, S 1 ; 1, S 0 ; 0, R 1 ; 1, S! ;!, L 0 ; 0, L 1 ; 1, S 1 ; 1, S 1 ; 1, S 1 ; 1, S! ;!, L 1 ; 1, R 1 ; 1, S 1 ; 1, R 1 ; 1, S 1 ; 1, S 1 ; 1, L 1 ; 1, S 1 ; 1, L 1 ; 1, S 1 ; 1, R 1 ; 1, S! ; 1, R 1 ; 1, S 1 ; 1, S 1 ; 1, L q3 1 ; 1, R 1 ; 1, R 1 ; 1, S Rewind T2 0 ; 0, R 1 ; 1, S 1 ; 1, S q6 Skip 5 T1 0s 1 ; 1, R 1 ; 1, S 1 ; 1, S 1 ; 1, R 1 ; 1, S 1 ; 1, S q8 q10 Skip 3 T1 0s Skip 1 T1 0s 1 ; 1, R 1 ; 1, S 1 ; 1, S 1 ; 1, S 1 ; 1, S 1 ; 1, S q12 1 ; 1, S 1 ; 1, S! ;!, L 1 ; 1, S 1 ; 1, S! ;!, L 1 ; 1, S 1 ; 1, S! ;!, R 1 ; 1, S 0 ; 0, L 1 ; 1, S 0 ; 0, L 1 ; 1, S 1 ; 1, S 0 ; 0, R 1 ; 1, S 1 ; 1, S 1 ; 1, S 1 ; 1, S 1 ; 1, R 0 ; 0, R 0 ; 0, L 1 ; 1, S 1 ; 1, S 0 ; 0, L 1 ; 1, S Rewind T2 1 ; 1, S 1 ; 1, L 1 ; 1, S 0 ; 0, R 1 ; 1, S 1 ; 1, S 0 ; 0, R 1 ; 1, S 1 ; 1, S q1 q0 Rewind T3 Mtch Stte 1 ; 1, S 1 ; 1, L 1 ; 1, S q9 Skip 2 T1 0s q31 q33 q1 or higher q2, ACCEPT! q32 q2 or higher! ;!, R 1 ; 1, S 1 ; 1, R 1 ; 1, S! ; 0, S 1 ; 1, S 1 ; 1, S! ; 0, L 1 ; 1, S 1 ; 1, S! ;!, R 1 ; 1, S 1 ; 1, S 0 ; 0, R 1 ; 1, S q2 Mtch Symol 1 ; 1, S 1 ; 1, R 1 ; 1, S 1 ; 1, S 0 ; 0, R 1 ; 1, S q16 1 ; 1, S! ; 1, S 1 ; 1, S 1 ; 1, R! ; 1, R 1 ; 1, S Rewind T2 1 ; 1, S 1 ; 1, L 1 ; 1, S q22 Fill Left Blnk q30 Fill Right Blnk q15 Next 1 1 ; 1, R! ; 1, S 1 ; 1, S 1 ; 1, S! ; 0, L 1 ; 1, S 1 ; 1, S 0 ; 1, R 1 ; 1, S 1 ; 1, S 1 ; 0, R 1 ; 1, S q24 Moved L 1 ; 1, R 0 ; 0, R 1 ; 1, S 1 ; 1, R! ;!, R 1 ; 1, S q26 1 ; 1, L 1 ; 1, S 1 ; 1, S 0 ; 0, L 1 ; 1, S 1 ; 1, S Skip Right 1 ; 1, S! ; 1, R 1 ; 1, S 1 ; 1, S 0 ;!, R 1 ; 1, S 1 ; 1, R 0 ; 0, R 1 ; 1, S 0 ; 0, S 1 ; 1, S 1 ; 1, S 0 ; 0, R 1 ; 1, S! ;!, L 0 ; 0, R 1 ; 1, S 1 ;!, L q17 Rewind T2 0 ; 0, S 1 ; 1, L 1 ; 1, S 1 ; 1, S 1 ; 1, R 1 ; 1, S 0 ; 0, S 1 ; 1, S 1 ; 1, S q25 Rewind T1 q14 Next 0 q4 Write Stte 0 ; 0, R 0 ; 0, L 1 ; 1, S 1 ; 1, S 0 ; 0, L 1 ; 1, S q20 Prev 1 1 ; 1, R 1 ; 1, R 1 ; 1, S 1 ; 1, R 1 ; 1, R! ;!, R 0 ; 0, S 1 ;!, R 1 ; 1, S 0 ; 0, S! ; 0, S 1 ; 1, S 0 ; 0, S 0 ; 1, L 1 ; 1, S 0 ; 0, S 1 ; 0, L 1 ; 1, S 0 ; 0, S 1 ;!, L 1 ; 1, S 0 ; 0, S 0 ; 0, L 1 ; 1, S 0 ; 0, S 0 ;!, L 1 ; 1, S 1 ; 1, S 1 ; 1, R 1 ; 1, S q21 1 ; 1, S 1 ; 1, S 1 ; 1, S 0 ; 0, S! ; 1, S 1 ; 1, S 1 ; 1, S 1 ; 1, L 1 ; 1, S q23 Rewind T2 q13 Write Symol q5 Rewind T3 Strt Compression q27 1 ; 1, S 1 ; 1, R 1 ; 1, S Moved S q29 Moved R 1 ; 1, S 1 ; 1, R 1 ; 1, S 1 ; 1, S 0 ; 0, R 1 ; 1, S 0 ; 0, S 1 ; 1, R 1 ; 1, S 0 ; 0, S 0 ; 0, R 1 ; 1, S q19 Prev 0 q18 Fst Forwrd T2 0 ; 0, S! ;!, L 1 ; 1, S q28 Skip Right

60 JFLAP s Use Around the World JFLAP we pge hs over 42,000 hits since 1996 Google Serch JFLAP ppers on over 2300 we pges JFLAP ppers on utomt theory clss wepges t over 40 US universities Note: serch only shows pulic we pges Note: ppers to e mny foreign sites JFLAP hs een downloded over 8000 times since Jn JFLAP ppers in use (we pges or downlods) in over 40 countries

61 Future Work Filling in the missing pieces for utomt theory course JFLAP User mnul out in Decemer 2004 (Rodger, Finley) JFLAP Automt Theory textook out in Fll 2005 (Rodger, Linz) JFLAP is FREE!

Regular Sets and Expressions

Regular Sets and Expressions Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite

More information

One Minute To Learn Programming: Finite Automata

One Minute To Learn Programming: Finite Automata Gret Theoreticl Ides In Computer Science Steven Rudich CS 15-251 Spring 2005 Lecture 9 Fe 8 2005 Crnegie Mellon University One Minute To Lern Progrmming: Finite Automt Let me tech you progrmming lnguge

More information

Homework 3 Solutions

Homework 3 Solutions CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

More information

Reasoning to Solve Equations and Inequalities

Reasoning to Solve Equations and Inequalities Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

More information

Increasing Interaction and Support in the Formal Languages and Automata Theory Course

Increasing Interaction and Support in the Formal Languages and Automata Theory Course Increasing Interaction and Support in the Formal Languages and Automata Theory Course Susan H. Rodger Duke University ITiCSE 2007 June 25, 2007 Supported by NSF Grant DUE 0442513. Outline Overview of JFLAP

More information

Java CUP. Java CUP Specifications. User Code Additions You may define Java code to be included within the generated parser:

Java CUP. Java CUP Specifications. User Code Additions You may define Java code to be included within the generated parser: Jv CUP Jv CUP is prser-genertion tool, similr to Ycc. CUP uilds Jv prser for LALR(1) grmmrs from production rules nd ssocited Jv code frgments. When prticulr production is recognized, its ssocited code

More information

flex Regular Expressions and Lexical Scanning Regular Expressions and flex Examples on Alphabet A = {a,b} (Standard) Regular Expressions on Alphabet A

flex Regular Expressions and Lexical Scanning Regular Expressions and flex Examples on Alphabet A = {a,b} (Standard) Regular Expressions on Alphabet A flex Regulr Expressions nd Lexicl Scnning Using flex to Build Scnner flex genertes lexicl scnners: progrms tht discover tokens. Tokens re the smllest meningful units of progrm (or other string). flex is

More information

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions. Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd

More information

Integration by Substitution

Integration by Substitution Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is

More information

Automated Grading of DFA Constructions

Automated Grading of DFA Constructions Automted Grding of DFA Constructions Rjeev Alur nd Loris D Antoni Sumit Gulwni Dileep Kini nd Mhesh Viswnthn Deprtment of Computer Science Microsoft Reserch Deprtment of Computer Science University of

More information

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the

More information

Bypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems

Bypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems Bypssing Spce Explosion in Regulr Expression Mtching for Network Intrusion Detection n Prevention Systems Jignesh Ptel, Alex Liu n Eric Torng Dept. of Computer Science n Engineering Michign Stte University

More information

Regular Languages and Finite Automata

Regular Languages and Finite Automata N Lecture Notes on Regulr Lnguges nd Finite Automt for Prt IA of the Computer Science Tripos Mrcelo Fiore Cmbridge University Computer Lbortory First Edition 1998. Revised 1999, 2000, 2001, 2002, 2003,

More information

Concept Formation Using Graph Grammars

Concept Formation Using Graph Grammars Concept Formtion Using Grph Grmmrs Istvn Jonyer, Lwrence B. Holder nd Dine J. Cook Deprtment of Computer Science nd Engineering University of Texs t Arlington Box 19015 (416 Ytes St.), Arlington, TX 76019-0015

More information

Binary Representation of Numbers Autar Kaw

Binary Representation of Numbers Autar Kaw Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse- rel number to its binry representtion,. convert binry number to n equivlent bse- number. In everydy

More information

Lec 2: Gates and Logic

Lec 2: Gates and Logic Lec 2: Gtes nd Logic Kvit Bl CS 34, Fll 28 Computer Science Cornell University Announcements Clss newsgroup creted Posted on we-pge Use it for prtner finding First ssignment is to find prtners Due this

More information

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( ) Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +

More information

EQUATIONS OF LINES AND PLANES

EQUATIONS OF LINES AND PLANES EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint

More information

AntiSpyware Enterprise Module 8.5

AntiSpyware Enterprise Module 8.5 AntiSpywre Enterprise Module 8.5 Product Guide Aout the AntiSpywre Enterprise Module The McAfee AntiSpywre Enterprise Module 8.5 is n dd-on to the VirusScn Enterprise 8.5i product tht extends its ility

More information

FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES

FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES Introduction This compendium contins exercises out regulr lnguges for the course Forml Lnguges, Automt nd Theory of Computtion

More information

PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY

PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive

More information

Experiment 6: Friction

Experiment 6: Friction Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht

More information

Section 5.2, Commands for Configuring ISDN Protocols. Section 5.3, Configuring ISDN Signaling. Section 5.4, Configuring ISDN LAPD and Call Control

Section 5.2, Commands for Configuring ISDN Protocols. Section 5.3, Configuring ISDN Signaling. Section 5.4, Configuring ISDN LAPD and Call Control Chpter 5 Configurtion of ISDN Protocols This chpter provides instructions for configuring the ISDN protocols in the SP201 for signling conversion. Use the sections tht reflect the softwre you re configuring.

More information

Welch Allyn CardioPerfect Workstation Installation Guide

Welch Allyn CardioPerfect Workstation Installation Guide Welch Allyn CrdioPerfect Worksttion Instlltion Guide INSTALLING CARDIOPERFECT WORKSTATION SOFTWARE & ACCESSORIES ON A SINGLE PC For softwre version 1.6.5 or lter For network instlltion, plese refer to

More information

Section 5-4 Trigonometric Functions

Section 5-4 Trigonometric Functions 5- Trigonometric Functions Section 5- Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form

More information

Words Symbols Diagram. abcde. a + b + c + d + e

Words Symbols Diagram. abcde. a + b + c + d + e Logi Gtes nd Properties We will e using logil opertions to uild mhines tht n do rithmeti lultions. It s useful to think of these opertions s si omponents tht n e hooked together into omplex networks. To

More information

Rotating DC Motors Part II

Rotating DC Motors Part II Rotting Motors rt II II.1 Motor Equivlent Circuit The next step in our consiertion of motors is to evelop n equivlent circuit which cn be use to better unerstn motor opertion. The rmtures in rel motors

More information

GFI MilArchiver 6 vs C2C Archive One Policy Mnger GFI Softwre www.gfi.com GFI MilArchiver 6 vs C2C Archive One Policy Mnger GFI MilArchiver 6 C2C Archive One Policy Mnger Who we re Generl fetures Supports

More information

CS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001

CS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001 CS99S Lortory 2 Preprtion Copyright W. J. Dlly 2 Octoer, 2 Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes to oserve logic

More information

GFI MilArchiver 6 vs Quest Softwre Archive Mnger GFI Softwre www.gfi.com GFI MilArchiver 6 vs Quest Softwre Archive Mnger GFI MilArchiver 6 Quest Softwre Archive Mnger Who we re Generl fetures Supports

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-280 Technicl notes on using Anlog Devices DSPs, processors nd development tools Visit our Web resources http://www.nlog.com/ee-notes nd http://www.nlog.com/processors or e-mil

More information

Vendor Rating for Service Desk Selection

Vendor Rating for Service Desk Selection Vendor Presented By DATE Using the scores of 0, 1, 2, or 3, plese rte the vendor's presenttion on how well they demonstrted the functionl requirements in the res below. Also consider how efficient nd functionl

More information

2 DIODE CLIPPING and CLAMPING CIRCUITS

2 DIODE CLIPPING and CLAMPING CIRCUITS 2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of

More information

Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding

Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding 1 Exmple A rectngulr box without lid is to be mde from squre crdbord of sides 18 cm by cutting equl squres from ech corner nd then folding up the sides. 1 Exmple A rectngulr box without lid is to be mde

More information

5 a LAN 6 a gateway 7 a modem

5 a LAN 6 a gateway 7 a modem STARTER With the help of this digrm, try to descrie the function of these components of typicl network system: 1 file server 2 ridge 3 router 4 ckone 5 LAN 6 gtewy 7 modem Another Novell LAN Router Internet

More information

Learning Outcomes. Computer Systems - Architecture Lecture 4 - Boolean Logic. What is Logic? Boolean Logic 10/28/2010

Learning Outcomes. Computer Systems - Architecture Lecture 4 - Boolean Logic. What is Logic? Boolean Logic 10/28/2010 /28/2 Lerning Outcomes At the end of this lecture you should: Computer Systems - Architecture Lecture 4 - Boolen Logic Eddie Edwrds eedwrds@doc.ic.c.uk http://www.doc.ic.c.uk/~eedwrds/compsys (Hevily sed

More information

Solution to Problem Set 1

Solution to Problem Set 1 CSE 5: Introduction to the Theory o Computtion, Winter A. Hevi nd J. Mo Solution to Prolem Set Jnury, Solution to Prolem Set.4 ). L = {w w egin with nd end with }. q q q q, d). L = {w w h length t let

More information

Protocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff

Protocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff Protocol Anlysis 17-654/17-764 Anlysis of Softwre Artifcts Kevin Bierhoff Tke-Awys Protocols define temporl ordering of events Cn often be cptured with stte mchines Protocol nlysis needs to py ttention

More information

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of

More information

9 CONTINUOUS DISTRIBUTIONS

9 CONTINUOUS DISTRIBUTIONS 9 CONTINUOUS DISTIBUTIONS A rndom vrible whose vlue my fll nywhere in rnge of vlues is continuous rndom vrible nd will be ssocited with some continuous distribution. Continuous distributions re to discrete

More information

Warm-up for Differential Calculus

Warm-up for Differential Calculus Summer Assignment Wrm-up for Differentil Clculus Who should complete this pcket? Students who hve completed Functions or Honors Functions nd will be tking Differentil Clculus in the fll of 015. Due Dte:

More information

Modular Generic Verification of LTL Properties for Aspects

Modular Generic Verification of LTL Properties for Aspects Modulr Generic Verifiction of LTL Properties for Aspects Mx Goldmn Shmuel Ktz Computer Science Deprtment Technion Isrel Institute of Technology {mgoldmn, ktz}@cs.technion.c.il ABSTRACT Aspects re seprte

More information

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: Write polynomils in stndrd form nd identify the leding coefficients nd degrees of polynomils Add nd subtrct polynomils Multiply

More information

Small Businesses Decisions to Offer Health Insurance to Employees

Small Businesses Decisions to Offer Health Insurance to Employees Smll Businesses Decisions to Offer Helth Insurnce to Employees Ctherine McLughlin nd Adm Swinurn, June 2014 Employer-sponsored helth insurnce (ESI) is the dominnt source of coverge for nonelderly dults

More information

Unambiguous Recognizable Two-dimensional Languages

Unambiguous Recognizable Two-dimensional Languages Unmbiguous Recognizble Two-dimensionl Lnguges Mrcell Anselmo, Dor Gimmrresi, Mri Mdoni, Antonio Restivo (Univ. of Slerno, Univ. Rom Tor Vergt, Univ. of Ctni, Univ. of Plermo) W2DL, My 26 REC fmily I REC

More information

Generating In-Line Monitors For Rabin Automata

Generating In-Line Monitors For Rabin Automata Generting In-Line Monitors For Rin Automt Hugues Chot, Rphel Khoury, nd Ndi Twi Lvl University, Deprtment of Computer Science nd Softwre Engineering, Pvillon Adrien-Pouliot, 1065, venue de l Medecine Queec

More information

Integration. 148 Chapter 7 Integration

Integration. 148 Chapter 7 Integration 48 Chpter 7 Integrtion 7 Integrtion t ech, by supposing tht during ech tenth of second the object is going t constnt speed Since the object initilly hs speed, we gin suppose it mintins this speed, but

More information

Algebra Review. How well do you remember your algebra?

Algebra Review. How well do you remember your algebra? Algebr Review How well do you remember your lgebr? 1 The Order of Opertions Wht do we men when we write + 4? If we multiply we get 6 nd dding 4 gives 10. But, if we dd + 4 = 7 first, then multiply by then

More information

5.2. LINE INTEGRALS 265. Let us quickly review the kind of integrals we have studied so far before we introduce a new one.

5.2. LINE INTEGRALS 265. Let us quickly review the kind of integrals we have studied so far before we introduce a new one. 5.2. LINE INTEGRALS 265 5.2 Line Integrls 5.2.1 Introduction Let us quickly review the kind of integrls we hve studied so fr before we introduce new one. 1. Definite integrl. Given continuous rel-vlued

More information

EasyMP Network Projection Operation Guide

EasyMP Network Projection Operation Guide EsyMP Network Projection Opertion Guide Contents 2 About EsyMP Network Projection Functions of EsyMP Network Projection... 5 Vrious Screen Trnsfer Functions... 5 Instlling the Softwre... 6 Softwre Requirements...6

More information

the machine and check the components

the machine and check the components Quick Setup Guide Strt Here HL-2270DW Before using this mchine for the first time, red this Quick Setup Guide to setup nd instll your mchine. To view the Quick Setup Guide in other lnguges, plese visit

More information

Regular Repair of Specifications

Regular Repair of Specifications Regulr Repir of Specifictions Michel Benedikt Oxford University michel.enedikt@coml.ox.c.uk Griele Puppis Oxford University griele.puppis@coml.ox.c.uk Cristin Riveros Oxford University cristin.riveros@coml.ox.c.uk

More information

E-Commerce Comparison

E-Commerce Comparison www.syroxemedi.co.uk E-Commerce Comprison We pride ourselves in creting innovtive inspired websites tht re designed to sell. Developed over mny yers, our solutions re robust nd relible in opertion, flexible

More information

JaERM Software-as-a-Solution Package

JaERM Software-as-a-Solution Package JERM Softwre-s--Solution Pckge Enterprise Risk Mngement ( ERM ) Public listed compnies nd orgnistions providing finncil services re required by Monetry Authority of Singpore ( MAS ) nd/or Singpore Stock

More information

FAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University

FAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility

More information

DlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report

DlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report DlNBVRGH + + THE CITY OF EDINBURGH COUNCIL Sickness Absence Monitoring Report Executive of the Council 8fh My 4 I.I...3 Purpose of report This report quntifies the mount of working time lost s result of

More information

1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall 2011 - Final Exam

1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall 2011 - Final Exam 1./1.1 Introduction to Computers nd Engineering Problem Solving Fll 211 - Finl Exm Nme: MIT Emil: TA: Section: You hve 3 hours to complete this exm. In ll questions, you should ssume tht ll necessry pckges

More information

New Internet Radio Feature

New Internet Radio Feature XXXXX XXXXX XXXXX /XW-SMA3/XW-SMA4 New Internet Rdio Feture EN This wireless speker hs een designed to llow you to enjoy Pndor*/Internet Rdio. In order to ply Pndor/Internet Rdio, however, it my e necessry

More information

IaaS Configuration for Virtual Platforms

IaaS Configuration for Virtual Platforms IS Configurtion for Virtul Pltforms vcloud Automtion Center 6.0 This document supports the version of ech product listed nd supports ll susequent versions until the document is replced y new edition. To

More information

Answer, Key Homework 10 David McIntyre 1

Answer, Key Homework 10 David McIntyre 1 Answer, Key Homework 10 Dvid McIntyre 1 This print-out should hve 22 questions, check tht it is complete. Multiple-choice questions my continue on the next column or pge: find ll choices efore mking your

More information

1. Introduction. 1.1. Texts and their processing

1. Introduction. 1.1. Texts and their processing Chpter 1 3 21/7/97 1. Introduction 1.1. Texts nd their processing One of the simplest nd nturl types of informtion representtion is y mens of written texts. Dt to e processed often does not decompose into

More information

Advanced Baseline and Release Management. Ed Taekema

Advanced Baseline and Release Management. Ed Taekema Advnced Bseline nd Relese Mngement Ed Tekem Introduction to Bselines Telelogic Synergy uses bselines to perform number of criticl configurtion mngement tsks. They record the stte of the evolving softwre

More information

NQF Level: 2 US No: 7480

NQF Level: 2 US No: 7480 NQF Level: 2 US No: 7480 Assessment Guide Primry Agriculture Rtionl nd irrtionl numers nd numer systems Assessor:.......................................... Workplce / Compny:.................................

More information

Pointed Regular Expressions

Pointed Regular Expressions Pointed Regulr Expressions Andre Asperti 1, Cludio Scerdoti Coen 1, nd Enrico Tssi 2 1 Deprtment of Computer Science, University of Bologn sperti@cs.unio.it scerdot@cs.unio.it 2 INRIA-Micorsoft tssi@cs.unio.it

More information

Unleashing the Power of Cloud

Unleashing the Power of Cloud Unleshing the Power of Cloud A Joint White Pper by FusionLyer nd NetIQ Copyright 2015 FusionLyer, Inc. All rights reserved. No prt of this publiction my be reproduced, stored in retrievl system, or trnsmitted,

More information

Drawing Diagrams From Labelled Graphs

Drawing Diagrams From Labelled Graphs Drwing Digrms From Lbelled Grphs Jérôme Thièvre 1 INA, 4, venue de l Europe, 94366 BRY SUR MARNE FRANCE Anne Verroust-Blondet 2 INRIA Rocquencourt, B.P. 105, 78153 LE CHESNAY Cedex FRANCE Mrie-Luce Viud

More information

Helicopter Theme and Variations

Helicopter Theme and Variations Helicopter Theme nd Vritions Or, Some Experimentl Designs Employing Pper Helicopters Some possible explntory vribles re: Who drops the helicopter The length of the rotor bldes The height from which the

More information

Learning Workflow Petri Nets

Learning Workflow Petri Nets Lerning Workflow Petri Nets Jvier Esprz, Mrtin Leucker, nd Mximilin Schlund Technische Universität München, Boltzmnnstr. 3, 85748 Grching, Germny {esprz,leucker,schlund}@in.tum.de Abstrct. Workflow mining

More information

Review guide for the final exam in Math 233

Review guide for the final exam in Math 233 Review guide for the finl exm in Mth 33 1 Bsic mteril. This review includes the reminder of the mteril for mth 33. The finl exm will be cumultive exm with mny of the problems coming from the mteril covered

More information

A.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324

A.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324 A P P E N D I X A Vectors CONTENTS A.1 Scling vector................................................ 321 A.2 Unit or Direction vectors...................................... 321 A.3 Vector ddition.................................................

More information

Decision Rule Extraction from Trained Neural Networks Using Rough Sets

Decision Rule Extraction from Trained Neural Networks Using Rough Sets Decision Rule Extrction from Trined Neurl Networks Using Rough Sets Alin Lzr nd Ishwr K. Sethi Vision nd Neurl Networks Lbortory Deprtment of Computer Science Wyne Stte University Detroit, MI 48 ABSTRACT

More information

SINCLAIR COMMUNITY COLLEGE DAYTON, OHIO DEPARTMENT SYLLABUS FOR COURSE IN MAT 1470 - COLLEGE ALGEBRA (4 SEMESTER HOURS)

SINCLAIR COMMUNITY COLLEGE DAYTON, OHIO DEPARTMENT SYLLABUS FOR COURSE IN MAT 1470 - COLLEGE ALGEBRA (4 SEMESTER HOURS) SINCLAIR COMMUNITY COLLEGE DAYTON, OHIO DEPARTMENT SYLLABUS FOR COURSE IN MAT 470 - COLLEGE ALGEBRA (4 SEMESTER HOURS). COURSE DESCRIPTION: Polynomil, rdicl, rtionl, exponentil, nd logrithmic functions

More information

P.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn

P.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn 33337_0P03.qp 2/27/06 24 9:3 AM Chpter P Pge 24 Prerequisites P.3 Polynomils nd Fctoring Wht you should lern Polynomils An lgeric epression is collection of vriles nd rel numers. The most common type of

More information

Object Semantics. 6.170 Lecture 2

Object Semantics. 6.170 Lecture 2 Object Semntics 6.170 Lecture 2 The objectives of this lecture re to: to help you become fmilir with the bsic runtime mechnism common to ll object-oriented lnguges (but with prticulr focus on Jv): vribles,

More information

CallPilot 100/150 Upgrade Addendum

CallPilot 100/150 Upgrade Addendum CllPilot 100/150 Relese 3.0 Softwre Upgrde Addendum Instlling new softwre onto the CllPilot 100/150 Feture Crtridge CllPilot 100/150 Upgrde Addendum Prerequisites lptop or desktop computer tht cn ccept

More information

Math 135 Circles and Completing the Square Examples

Math 135 Circles and Completing the Square Examples Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for

More information

Automata theory. An algorithmic approach. Lecture Notes. Javier Esparza

Automata theory. An algorithmic approach. Lecture Notes. Javier Esparza Automt theory An lgorithmic pproch 0 Lecture Notes Jvier Esprz My 3, 2016 2 3 Plese red this! Mny yers go I don t wnt to sy how mny, it s depressing I tught course on the utomt-theoretic pproch to model

More information

Module Summary Sheets. C3, Methods for Advanced Mathematics (Version B reference to new book) Topic 2: Natural Logarithms and Exponentials

Module Summary Sheets. C3, Methods for Advanced Mathematics (Version B reference to new book) Topic 2: Natural Logarithms and Exponentials MEI Mthemtics in Ection nd Instry Topic : Proof MEI Structured Mthemtics Mole Summry Sheets C, Methods for Anced Mthemtics (Version B reference to new book) Topic : Nturl Logrithms nd Eponentils Topic

More information

Rotational Equilibrium: A Question of Balance

Rotational Equilibrium: A Question of Balance Prt of the IEEE Techer In-Service Progrm - Lesson Focus Demonstrte the concept of rottionl equilirium. Lesson Synopsis The Rottionl Equilirium ctivity encourges students to explore the sic concepts of

More information

Morgan Stanley Ad Hoc Reporting Guide

Morgan Stanley Ad Hoc Reporting Guide spphire user guide Ferury 2015 Morgn Stnley Ad Hoc Reporting Guide An Overview For Spphire Users 1 Introduction The Ad Hoc Reporting tool is ville for your reporting needs outside of the Spphire stndrd

More information

HP Application Lifecycle Management

HP Application Lifecycle Management HP Appliction Lifecycle Mngement Softwre Version: 11.00 Tutoril Document Relese Dte: Novemer 2010 Softwre Relese Dte: Novemer 2010 Legl Notices Wrrnty The only wrrnties for HP products nd services re set

More information

VMware Horizon Mirage Web Manager Guide

VMware Horizon Mirage Web Manager Guide VMwre Horizon Mirge We Mnger Guide Horizon Mirge 4.3 This document supports the version of ech product listed nd supports ll susequent versions until the document is replced y new edition. To check for

More information

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered: Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you

More information

0.1 Basic Set Theory and Interval Notation

0.1 Basic Set Theory and Interval Notation 0.1 Bsic Set Theory nd Intervl Nottion 3 0.1 Bsic Set Theory nd Intervl Nottion 0.1.1 Some Bsic Set Theory Notions Like ll good Mth ooks, we egin with definition. Definition 0.1. A set is well-defined

More information

Using Hands-On Visualizations to Teach Computer Science from Beginning Courses to Advanced Courses

Using Hands-On Visualizations to Teach Computer Science from Beginning Courses to Advanced Courses Using Hands-On Visualizations to Teach Computer Science from Beginning Courses to Advanced Courses Susan H. Rodger Department of Computer Science Duke University Durham, NC 27705 rodger@cs.duke.edu Abstract

More information

15.6. The mean value and the root-mean-square value of a function. Introduction. Prerequisites. Learning Outcomes. Learning Style

15.6. The mean value and the root-mean-square value of a function. Introduction. Prerequisites. Learning Outcomes. Learning Style The men vlue nd the root-men-squre vlue of function 5.6 Introduction Currents nd voltges often vry with time nd engineers my wish to know the verge vlue of such current or voltge over some prticulr time

More information

Project 6 Aircraft static stability and control

Project 6 Aircraft static stability and control Project 6 Aircrft sttic stbility nd control The min objective of the project No. 6 is to compute the chrcteristics of the ircrft sttic stbility nd control chrcteristics in the pitch nd roll chnnel. The

More information

I calculate the unemployment rate as (In Labor Force Employed)/In Labor Force

I calculate the unemployment rate as (In Labor Force Employed)/In Labor Force Introduction to the Prctice of Sttistics Fifth Edition Moore, McCbe Section 4.5 Homework Answers to 98, 99, 100,102, 103,105, 107, 109,110, 111, 112, 113 Working. In the lnguge of government sttistics,

More information

trademark and symbol guidelines FOR CORPORATE STATIONARY APPLICATIONS reviewed 01.02.2007

trademark and symbol guidelines FOR CORPORATE STATIONARY APPLICATIONS reviewed 01.02.2007 trdemrk nd symbol guidelines trdemrk guidelines The trdemrk Cn be plced in either of the two usul configurtions but horizontl usge is preferble. Wherever possible the trdemrk should be plced on blck bckground.

More information

Outline. About Me - Research Interests. A bit about me, my background. Through Visualization and Interaction, Computer Science Concepts Come Alive

Outline. About Me - Research Interests. A bit about me, my background. Through Visualization and Interaction, Computer Science Concepts Come Alive Through Visualization and Interaction, Computer Science Concepts Come Alive Susan H. Rodger Duke University rodger@cs.duke.edu CWIC 2012 Columbia, SC Feb. 17, 2012 Supported by NSF Grants DUE-0442513,

More information

Pentominoes. Pentominoes. Bruce Baguley Cascade Math Systems, LLC. The pentominoes are a simple-looking set of objects through which some powerful

Pentominoes. Pentominoes. Bruce Baguley Cascade Math Systems, LLC. The pentominoes are a simple-looking set of objects through which some powerful Pentominoes Bruce Bguley Cscde Mth Systems, LLC Astrct. Pentominoes nd their reltives the polyominoes, polycues, nd polyhypercues will e used to explore nd pply vrious importnt mthemticl concepts. In this

More information

How To Organize A Meeting On Gotomeeting

How To Organize A Meeting On Gotomeeting NOTES ON ORGANIZING AND SCHEDULING MEETINGS Individul GoToMeeting orgnizers my hold meetings for up to 15 ttendees. GoToMeeting Corporte orgnizers my hold meetings for up to 25 ttendees. GoToMeeting orgnizers

More information

On decidability of LTL model checking for process rewrite systems

On decidability of LTL model checking for process rewrite systems Act Informtic (2009) 46:1 28 DOI 10.1007/s00236-008-0082-3 ORIGINAL ARTICLE On decidbility of LTL model checking for process rewrite systems Lur Bozzelli Mojmír Křetínský Vojtěch Řehák Jn Strejček Received:

More information

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May 2008. Time: 14:00 16:00

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 16 th May 2008. Time: 14:00 16:00 COMP20212 Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Digitl Design Techniques Dte: Fridy 16 th My 2008 Time: 14:00 16:00 Plese nswer ny THREE Questions from the FOUR questions provided

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Solutions for Selected Exercises from Introduction to Compiler Design

Solutions for Selected Exercises from Introduction to Compiler Design Solutions for Selected Exercises from Introduction to Compiler Design Torben Æ. Mogensen Lst updte: My 30, 2011 1 Introduction This document provides solutions for selected exercises from Introduction

More information

Babylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity

Babylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity Bbylonin Method of Computing the Squre Root: Justifictions Bsed on Fuzzy Techniques nd on Computtionl Complexity Olg Koshelev Deprtment of Mthemtics Eduction University of Texs t El Pso 500 W. University

More information

1. Find the zeros Find roots. Set function = 0, factor or use quadratic equation if quadratic, graph to find zeros on calculator

1. Find the zeros Find roots. Set function = 0, factor or use quadratic equation if quadratic, graph to find zeros on calculator AP Clculus Finl Review Sheet When you see the words. This is wht you think of doing. Find the zeros Find roots. Set function =, fctor or use qudrtic eqution if qudrtic, grph to find zeros on clcultor.

More information

Unit 29: Inference for Two-Way Tables

Unit 29: Inference for Two-Way Tables Unit 29: Inference for Two-Wy Tbles Prerequisites Unit 13, Two-Wy Tbles is prerequisite for this unit. In ddition, students need some bckground in significnce tests, which ws introduced in Unit 25. Additionl

More information