3 Pages

Presenter.Notes

Course: CSEP 590, Fall 2009
School: Washington
Rating:
 
 
 
 
 

Word Count: 797

Document Preview

Security Homeland / Cyber Security Chris Hartmann-Siantar, Lawrence Livermore National Laboratory Ed Lazowska, UW Computer Science & Engineering Steve Maurer, UC Berkeley Goldman School of Public Policy Stefan Savage, UCSD Computer Science & Engineering Geoff Voelker, UCSD Computer Science & Engineering Notes for presenters Students will be located at four sites: the University of...

Register Now

Unformatted Document Excerpt

Coursehero >> Washington >> Washington >> CSEP 590

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Security Homeland / Cyber Security Chris Hartmann-Siantar, Lawrence Livermore National Laboratory Ed Lazowska, UW Computer Science & Engineering Steve Maurer, UC Berkeley Goldman School of Public Policy Stefan Savage, UCSD Computer Science & Engineering Geoff Voelker, UCSD Computer Science & Engineering Notes for presenters Students will be located at four sites: the University of Washington, Microsoft, UC Berkeley, and UC San Diego. Sites will be linked using Microsoft ConferenceXP and UW Classroom Presenter Internet conferencing and distributed presentation tools. A full archive (course session audio/video, Powerpoint lecture notes and course session annotations, electronic whiteboard) will be available on the web. From the speaker's point of view, the key attribute of Presenter is that it provides "virtual Mylar" allowing you to annotate your slides on the fly, for emphasis or clarification, using the Tablet PC stylus. It also has an integrated whiteboard capability. The price is that your slides must be in Powerpoint (vs. pdf or LaTeX or whatever), and there must not be any "builds" (single slides where material is added every time you hit return of course, it's possible to simulate this perfectly well using multiple slides). You must email your Powerpoint to our tech staff one day in advance of the class session. (Email to Fred Videon, fred@cs.washington.edu, and Rod Prieto, rprieto@cs.washington.edu.) They will pass it through the Presenter pre-processor, and have it ready on a Tablet PC at the lectern when you arrive for class. Please number your slides as part of our "when the technology goes south" fallback plan. More on Presenter Tablet PC Presenter has a very simple user interface there's essentially no learning curve for basic presentations. Your Powerpoint (.ppt) is pre-processed by the DeckBuilder application (or by a Powerpoint plugin) which creates a Presenter file (.csd). This file is in turn opened by Presenter. In use, Presenter shows the instructor a different view than it shows the students. The students see a single transparency. The instructor sees a large version of the current transparency, and a "filmstrip" showing small versions of the next few transparencies (so you don't get surprised!). You can "advance" by using the stylus either to poke the next transparency, or to poke the arrows at the upper left and upper right of the display. The instructor also sees simple controls for annotating, erasing, and using the whiteboard arrayed across the top of the display. All these of are completely intuitive. To experiment with Presenter prior to class (you can use it on any Windows XP PC doesn't have to be a Tablet PC although it's oriented towards that), you can download and install Presenter and DeckBuilder here: http://www.cs.washington.edu/education/dl/presenter/. We will use version 2.0 there is a "Download" link at the top of the page or under "Downloads" in the left-hand column. Be sure to read the "Basic usage" section of the main Presenter webpage, and also the material referenced by the "Getting Started" l under "Notes" http://www.cs.washington.edu/research/edtech/presenter/doc/gscp.htm. (We will not utilize the "student-side" aspects of Presenter in this class.) Tips for annotation and whiteboard use There are three "standard" uses of annotation: emphasis ("attentional"), diagrams, and text. Avoid clutter Use color thoughtfully (don't use black ink to annotate black text) Pre-plan some specific annotations (provide an x-y axis, or a quad-chart) Pre-plan some whiteboard use. More tips are in this easy-reading paper: http://www.cs.washington.edu/education/dl/presenter/papers/AAM_2005.pdf. Tips for class interaction This is a multi-site class with audio and video latency. Interacting with students is very different than in a single classroom. Be alert for spontaneous questions from remote sites. Periodically pause for questions, perhaps polling each site. Plan some explicit activities during each class that will require groups of students to work together "For the next 5 minutes, break up into groups of four and list the three most important ..." When the technology goes south Presenter itself is solid. The Internet conferencing, however, has proven to be flaky, because it utilizes multicast. The tech staff is prepared with a set of backup plans to avoid wasting too much time when things go south ("when," not "if" ...): Switch from multicast to tunneling Drop back to a telephone conference call where the tech staff at each site advances the transparencies on cue (that's why we ask you to number your slides) In the extreme, cut off a misbehaving site and have those students watch the web archive (which preserves all annotations, etc.) the next day The trick is for them to make these decisions rapidly and reasonably. Do remember, this is an experiment! The class meets from 6:30-9:20, with 15-minute breaks at approximately 7:20 and 8:20. We can move the breaks to cover technical difficulties.
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Washington - CSEP - 590
Information Technology and Public PolicyEd Lazowska, Computer Science & Engineering, University of Washington Steve Maurer, Goldman School of Public Policy, University of California Berkeley Notes for presenters Students will be located at four site
Washington - CS - 321
CSE 321: Discrete Structures Assignment #1 January 7, 2009 Due: Wednesday, January 14Reading Assignment: Read Sections 1.1 - 1.4 carefully (make sure that you understand the examples). Problems: 1. Let p, q, r be the propositions. p You get sued by
Washington - CS - 321
CSE 321: Discrete Structures Assignment #2 January 15, 2009 Due: Thursday, January 22, in SectionReading Assignment: Sections 1.5 1.7 and handout on logic. Problems: 1. Determine the truth value of xy(x y 2 ) when the universe of discourse is the
Washington - CS - 321
CSE 321: Discrete Structures Assignment #3 January 22, 2009 Due: Wednesday, January 28, in ClassReading Assignment: Sections 2.1 2.3, and 3.4 3.6. Problems: 1. Section 1.6, exercise 28. 2. Prove that if you pick 10 numbers from 1 to 1000, then th
Washington - CS - 321
CSE 321: Discrete Structures Assignment #4 January 28, 2009 Due: Wednesday, February 4, in classReading Assignment: Sections 3.4 3.7 and 4.1 4.2. Problems: 1. Let a, b and c be integers. Prove that if a does not divide bc, then a does not divide
Washington - CS - 321
CSE 321: Discrete Structures Assignment #5 February 4, 2009 Due: Wednesday, February 11, in classReading Assignment: Sections 4.1 4.3 and 5.1. Problems: 1. Which amounts of money can be formed using just dimes and quarters? Prove your answer using
Washington - CS - 321
CSE 321: Discrete Structures Assignment #5 February 15, 2009 Due: Friday, February 20, in classReading Assignment: Sections 5.1 5.4. Justify your answers to the following problems. Problems: 1. Assume that friendship is always mutual; that is, if
Washington - CS - 321
CSE 321: Discrete Structures Assignment #7 February 20, 2009 Due: Wednesday, February 25, in classReading Assignment: Sections 6.1 6.4. Justify your answers to the following problems. You do not need to provide explicit numbers for permutations an
Washington - CS - 321
CSE 321: Discrete Structures Assignment #8 February 25, 2009 Due: Wednesday, March 4, in classReading Assignment: Read Sections 6.1 6.4, 8.1 8.2. Problems: 1. (a) Prove or disprove: If events E and F are independent, then so are their complementa
Washington - CS - 321
CSE 321: Discrete Structures Assignment #9 March 4, 2009 Due: Friday, March 13, in classReading Assignment: Read Sections 8.1 8.5, 9.1 9.5. Problems: 1. For the relation R = {(b, c), (b, e), (c, e), (d, a), (e, b), (e, c)} on {a, b, c, d, e}, dra
Washington - CS - 321
Discrete Structures LogicChapter 1, Sections 1.11.4Dieter FoxD. Fox, CSE-321Chapter 1, Sections 1.11.40-0Outline Propositional Logic Propositional Equivalences First-order LogicD. Fox, CSE-321Chapter 1, Sections 1.11.40-1Proposit
Washington - CS - 321
Supplementary Logic NotesCSE 321 Winter 200911.1Propositional LogicMore efcient truth table methodsThe method of using truth tables to prove facts about propositional formulas can be a very tedious procedure, especially if the formulas conta
Washington - CS - 321
Discrete Structures SetsChapter 2, Sections 2.12.2Dieter FoxD. Fox, CSE-321Chapter 2, Sections 2.12.20-0Sets a A: Objects in a set are called elements / members of the set. Set descriptions: List all elements, set builder notation, Venn d
Washington - CS - 321
Discrete Structures FunctionsChapter 2, Section 2.3Dieter FoxD. Fox, CSE-321Chapter 2, Section 2.30-0Functions f : A B: A function from A to B is an assignment of exactly one element of B to each element of A. A is the domain of f and B
Washington - CS - 321
Discrete Structures Integers and DivisionChapter 3, Sections 3.4 3.6Dieter FoxD. Fox, CSE-321Chapter 3, Sections 3.4 3.60-0IntegersLet a, b, and c be integers, a = 0. a | b: a divides b if there is an integer c such that b = ac. When a
Washington - CS - 321
Discrete Structures RelationsChapter 8, Sections 8.1 8.5Dieter FoxD. Fox, CSE-321Chapter 8, Sections 8.1 8.50-0Relations Let A and B be sets. A binary relation from A to B is a subset of A B. If (a, b) R, we write aRb and say a is relat
Washington - CS - 321
Discrete Structures GraphsChapter 9, Sections 9.1 - 9.5Dieter FoxD. Fox, CSE-321Chapter 9, Sections 9.1 - 9.50-0Undirected Graphs A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pairs of dis
Washington - CS - 321
Midterm Practice with Solutions1. Answer the following questions with True or False: (a) (p q) (q p) T (b) (p q) (p q) T (c) If A and B are sets, A - B = A B. F (d) If a|b and a|c, then b|c. F (e) If a|(b + c), then a|b and a|c. F Let P (x,
Washington - CS - 321
<?xml version="1.0" encoding="UTF-8"?><Error><Code>NoSuchKey</Code><Message>The specified key does not exist.</Message><Key>7165f03cf154b1d8e3c237b1f9cd2340a536071c.txt</Key><RequestId>B6AA93DFF22357B7</RequestId><HostId>J2/0OG8f1Tjbk3Zq43mT9XyWkXxR
Washington - CS - 321
CSE 321 Practice Problems from Old FinalsInstructions: Feel free NOT to multiply out binomial coefficients, factorials, etc, and feel free to leave answers in the form of a sum. No calculators, books or notes are allowed. 1. True or False: p q i
Washington - CS - 321
CSE 321 Solutions to Practice ProblemsInstructions: Feel free NOT to multiply out binomial coefficients, factorials, etc, and feel free to leave answers in the form of a sum. No calculators, books or notes are allowed. 1. True or False: p q is l
Washington - CS - 403
%!PS-Adobe-2.0 %Creator: dvipsk 5.58f Copyright 1986, 1994 Radical Eye Software %Title: hw-soln1.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentPaperSizes: Letter %EndComments %DVIPSCommandLine: dvips -o hw-soln1.ps hw-soln1.dvi
Washington - CS - 403
%!PS-Adobe-2.0 %Creator: dvipsk 5.58f Copyright 1986, 1994 Radical Eye Software %Title: hw-soln2.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentPaperSizes: Letter %EndComments %DVIPSCommandLine: dvips hw-soln2.dvi -o hw-soln2.ps
Washington - CS - 403
%!PS-Adobe-2.0 %Creator: dvipsk 5.58f Copyright 1986, 1994 Radical Eye Software %Title: hw-soln3.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentPaperSizes: Letter %EndComments %DVIPSCommandLine: dvips hw-soln3.dvi -o hw-soln3.ps
Washington - CS - 403
CTAS Build 2 SSS, Revised Draft14 February 1997 (Corrected Copy)Center-TRACON Automation System Build 2 System SpecificationRevised Draft, 14 February 1997Prepared for: Department of Transportation, Federal Aviation Administration TATCA Progra
Washington - CS - 531
CSE 531Automata, Computability, Complexity Course OrganizationFall 1996 W. L. Ruzzo Handout 1 1 Oct 96Instructor Larry Ruzzo 415 Sieg 543-6298 ruzzo@cs.washington.eduTA Nitin Sharmanitin@cs.washington.eduClass Place & Time: Sieg 224, TuTh 1
Washington - CS - 531
CSE 531Automata, Computability, Complexity SyllabusFall 1996 W. L. Ruzzo Handout 2 1 Oct 96Computational models including nite automata, regular expressions, context-free grammars, pushdown automata, Turing machines and techniques for analyzing t
Washington - CS - 531
CSE 531Automata, Computability, Complexity Collaboration on HomeworkFall 1996 W. L. Ruzzo Handout 3 1 Oct 96The purpose of homework is to re-enforce learning. I know there are many situations where collaborative solution to problems is an effecti
Washington - CS - 531
CSE 531Automata, Computability, Complexity Homework #1Due: Tuesday, October 22, 1996 Fall 1996 W. L. Ruzzo Handout 4 8 Oct 961. Text 1.10 2. Text 1.11 3. Text 1.13 4. Text 1.20. Except specializing the problem to n = 5 fine. that's interesting en
Washington - CS - 531
CSE 531Automata, Computability, Complexity Homework #3Due: Thursday, November 7, 1996 Fall 1996 W. L. Ruzzo Handout 6 1 Nov 96In all problems below requiring you to construct a Turing machine, I want a high level description, unless otherwise spe
Washington - CS - 531
CSE 531Automata, Computability, Complexity Homework #4Due: Tuesday, November 26, 1996 Fall 1996 W. L. Ruzzo Handout 9 19 Nov 961. Text page 230, #7.1 2. Text page 230, #7.6 3. Text page 231, #7.10 4. Text page 232, #7.22 5. Text page 232, #7.23 6