12 Pages

# P0884

Course Number: P 884, Fall 2009

College/University: Utah

Word Count: 3925

Rating:

###### Document Preview

The Photographs of Wallace and Mary Doi Photograph Collection (P0884) Number and types of photographs: 448 digital scans taken from various sizes of photographs Dates of photographs: early 1900s-1970s Collection Processed by: Jamie Colton and Mary Ann Curtis Register Prepared by: Mary Ann Curtis Register Completed: September 6, 2001, updated: August 7, 2002 Linear Feet...

##### Unformatted Document Excerpt
Coursehero >> Utah >> Utah >> P 884

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.

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:

Utah - P - 727
The Photographs of Clifford C. Snyder Photograph Collection (P0727) Number and types of photographs: One 8x10 and 3x5, black and white. Three 3x5, c
University of Illinois, Urbana Champaign - CS - 438
Congestion ControlCongestion Control What is congestion? Methods for dealing with congestion TCP congestion controlReview of Flow ControlReceiver advertises window in ACK packetsReceiver window size = amount of free space in receive buf
University of Illinois, Urbana Champaign - CS - 438
TCP12/12/06CS/ECE 438 - UIUC, Fall 20061TCP Adaptive Retransmission Algorithm - OriginalTheory Estimate RTT Multiply by 2 to allow for variations Use exponential moving average (A = 0.1 to 0.2) Estimate = (A) * measurement + (1- A) * es
University of Illinois, Urbana Champaign - CS - 438
Where Are We? Global InternetDealing with complexity and scaleInternetConnect heterogeneous collection of networks Simple addressing hierarchyScalability ChallengesRoutingMinimize number of entries in routing tablesAddressingEfficiently uti
University of Illinois, Urbana Champaign - CS - 438
Routing RoutingSpringfield Champaign Chicago A tourist appears and grunts, Chicago? Which way do you point? Danville Indianapolis Effingham St. LouisCS/ECE 438 Robin Kravets, UIUC - Spring 2005 1 CS/ECE 438 Robin Kravets, UIUC - Spring 2005 2Ro
University of Illinois, Urbana Champaign - CS - 438
The Big(ger) Pictureapplication end-to-end IP data link/physical 328/497 topics detailed description of issues here most coverage until nowWhere are you?Understand how toBuild a network on one physical medium Connect networks Implement a reliabl
University of Illinois, Urbana Champaign - CS - 438
Internet RoutingRouting algorithmsLink state Distance Vector Hierarchical routingInterplay between routing and forwardingrouting algorithmlocal forwarding table header value output link0100 0101 0111 1001 3 2 2 1Routing protocolsRIP OSPF B
University of Illinois, Urbana Champaign - CS - 598
Forwarding vs. Routing Routing in the InternetForwarding: the process of moving packets from input to output based onThe forwarding table Information in the packetRouting: process by which the forwarding table is built and maintainedOne or more
University of Illinois, Urbana Champaign - CS - 438
Routing RoutingSpringfield Champaign Chicago A tourist appears and grunts, &quot;Chicago?&quot; Which way do you point? Danville Indianapolis Effingham St. LouisCS/ECE 338 Robin Kravets, UIUC - Spring 2004 1 CS/ECE 338 Robin Kravets, UIUC - Spring 2004 2
University of Illinois, Urbana Champaign - CS - 438
The Big(ger) Pictureapplication end-to-end IP data link/physical 428/598 topics detailed description of issues here most coverage until nowperformanceCS/ECE 438congestion control Robin Kravets, UIUC - Spring 2007 1Where are you?Understand
University of Illinois, Urbana Champaign - CS - 438
Global InternetDealing with complexity and scaleCS/ECE 438 Robin Kravets, UIUC - Spring 20071Where Are We?Internet Connect heterogeneous collection of networks Simple addressing hierarchy RoutingScalability ChallengesMinimize n
University of Illinois, Urbana Champaign - CS - 497
An Error Control Scheme for Large-Scale Multicast ApplicationsChristos Papadopoulos christos@dworkin.wustl.edu Guru Parulkar guru@arl.wustl.edu George Varghese varghese@askew.wustl.edu Washington University, St. Louis, MO ABSTRACT Retransmission bas
Utah - MATH - 6740
Utah - MATH - 6730
Math 6730 Notes and Homework Exercises1Regular Perturbation Theory(due Sept. 25, 2006) 1. Find a two-term asymptotic expansion, for small , for each solution x of the following equations: (a) x3 3x + 1 = 0 (b) x2+ = (c) xex = 2. Find a two-te
Utah - MATH - 6740
Normal Form for the Fold BifurcationThe purpose of these notes is to give a simple proof (simpler than Kuznetsov) that the normal form for the fold bifurcation is dx = a x2 dt Theorem: If the function f (y, a) is smooth and 1. f (0, 0) = 0 2. fy (0
Utah - MATH - 6730
Averaging the Rapidly Forced Pendulum In these notes we nd the averaged equation for t + (a + f ( )F () = 0, (1)the equation for a rapidly forced pendulum. Ultimately, we will take a = 2 , but that is of no consequence here. We assume that f is p
Utah - MATH - 6770
Math 6770 Homework Exercises1Circulation(due Sept. 23, 2008) 1. (a) Choose some parameter values and plot the solution to the ltration equations, (11.27) and (11.28), in the q,Pc phase plane. (b) Modify the model for capillary ltration by allow
University of Illinois, Urbana Champaign - CS - 498
Mengzhu Julie Bai CS 498 1/29/2009 Group Text Conversation Visualization Previous social visualizations have focused on the text itself, making possible interesting observations in the changes in length, mood, and activity over time. However, what is
University of Illinois, Urbana Champaign - CS - 498
One major thing in conversations is who has control and how that control shifts from one speaker to another. Who is speaking, how long they have been speaking, how loudly they are speaking, and when the other person is trying to speak and interjects
University of Illinois, Urbana Champaign - CS - 498
Torrent Smoke One of the most popular new technologies on the web is bittorrent. Since torrents use multiple sources and break the files into smaller chunks, there are interesting and discrete pieces of information to visualize. The idea for this vis
Utah - EE - 3110
ECE3110Homework #4Fall 2005(Due Sept. 21 by 6pm in homework locker) 1. Assume the transistors below have a finite and an infinite Early voltage. Write an expression for the input resistance Rin in the circuit shown below. Your expression shoul
Utah - SPIN - 143
0( 9): 0 0 0 0 * * 0 1 ( *, *) ( *, *) ( *, *) ( *, *) ( 2, *) ( 4, *) ( *, *) ( 6, *) [ic,ic,ic,ic,i1,i1,ic,i1] 0 1( 14): 1 1 1 1 * * 1 0
Utah - MATH - 1170
Practice Exam 4 MATH 1170, Fall 2007 1. Find all of the critical points of the following functions in the given domains and state whether they are local maxima or local minima. Also state what the global maxima and minima are of each function over t
Utah - SPIN - 134
0( 26): 0 * 0 * 0 0 0 0 ( *, *) ( 3, *) ( *, *) ( 5, *) ( *, *) ( *, *) ( *, *) ( *, *) [ic,i1,ic,i1,ic,ic,ic,ic] 0 1( 28): 1 * 1 * 1 1 1 1
Utah - SPIN - 134
0( 0): 0 * 0 0 0 0 0 0 ( *, *) ( 3, *) ( *, *) ( *, *) ( *, *) ( *, *) ( *, *) ( *, *) [ic,i1,ic,ic,ic,ic,ic,ic] 0 1( 19): 1 * 1 1 1 1 1 1
Utah - SPIN - 134
0( 45): 0 0 * * 0 0 * 1 ( *, *) ( *, *) ( 3, *) ( 4, *) ( *, *) ( *, *) ( 7, *) ( 8, *) [ic,ic,i1,i1,ic,ic,i1,i1] 0 1( 48): 1 1 * * 1 1 * 0
Utah - SPIN - 134
0( 18): 0 0 * 0 * 0 0 0 ( *, *) ( *, *) ( 3, *) ( *, *) ( 4, *) ( *, *) ( *, *) ( *, *) [ic,ic,i1,ic,i1,ic,ic,ic] 0 1( 20): 1 1 * 1 * 1 1 1
University of Illinois, Urbana Champaign - CS - 473
Chapter 20 Linear ProgrammingBy Sariel Har-Peled, December 6, 2007x20.1Introduction and MotivationIn the VCR/guns/nuclear-bombs/napkins/star-wars/professors/butter/mice problem, the benevolent dictator, Biga Piguinus, of Penguina (a country in
University of Illinois, Urbana Champaign - CS - 473
21: Linear ProgrammingSariel Har-Peled April 19, 2006 473G - Algorithms1Introduction and MotivationIn the VCR/guns/nuclear-bombs/napkins/star-wars/professors/butter/mice problem, the benevolent dictator, Biga Piguinus, of Penguina (a country i
University of Illinois, Urbana Champaign - CS - 397
CS 397: Network Systems Laboratory Supplementary Document To Lab Project 3 TCP Implementation in Linux KernelGuanghui He and Jennifer C. Hou Department of Computer Science University of Illinois at Urbana Champaign ghe, jhou@cs.uiuc.eduI: Importan
Utah - MATH - 1210
Diagnostic Test in Algebra and Trigonometry This test comes in two parts. The rst part tests whether or not you really know what your calculus instructor assumes you know. These are typical problems from courses in Algebra and Trigonometry. If you ge
Utah - PROBS - 1210
Calculus I Practice Problems 225 20 15 10 5 0 0 -5 -10 1 2 3 4 54. Sketch the graph of a function with these properties: a) f 0 2 and f 1 0; b) f x 0 for 0 x 2; c) f x 0 for x 0 or x 2. The next two problems are about the motion of an object trav
Utah - PROBS - 1210
Calculus I Practice Problems 2: Answersf xAnswer. Use the quotient rule: f xAnswer. Here is the graph.25 20 15 10 5 0 0 -5 -10 -15 1 2 3 4 54. Sketch the graph of a function with these properties: a) f 0 2 and f 1 0; b) f x 0 for 0 x 2; c)
Utah - PROBS - 1210
Calculus I Practice Problems 35. Consider the curves C1 : y sin x and C2 : y cos x. a) At which points x between 2 and 2 do the curves have parallel tangent lines? b) At which such points do they have perpendicular tangent lines?8. Find an appr
Utah - MATH - 2210
Mathematics 2210 Calculus III, Final Examination Answers Part I. Do FIVE (5) of these rst 7 problems. 1. Find the distance of the point P (2,1,1) from the plane given by the equation x+yz = 1. Solution. Choose a point Q on the plane,say Q(1, 1, 1). N
Utah - PROBS - 11
Calculus III Practice Problems 111. Let C be the boundary of the triangle with vertices at (0,0), (3,0), (4,5), oriented in the counterclockwise sense. Find C 3ydx 6xdy.C4. Let C be the boundary of the triangle with vertices (0,0), (1,0), (1,2)
Utah - PROBS - 2210
Calculus III Practice Problems 111. Let C be the boundary of the triangle with vertices at (0,0), (3,0), (4,5), oriented in the counterclockwise sense. Find C 3ydx 6xdy.C4. Let C be the boundary of the triangle with vertices (0,0), (1,0), (1,2)
Utah - PROBS - 2210
Calculus III Practice Problems 12P4. EvaluateS1x2y2 dS where S is the surface given parametrically by5. Let S be the part of the plane 2x y 3z 12 which lies in the first octant, oriented upward. Let the boundary S of S be oriented so t
Utah - PROBS - 12
Calculus III Practice Problems 12: AnswersSBsince the volume of the ball of radius 4 is 4 3 4 3 . x2 y2 lying over the unit disc in the xy-plane. Let F x y zPAnswer. Let C be the boundary of P: the circle x 2 curl F NdSPy21zCCIf
Utah - PROBS - 2210
Calculus III Practice Problems 12: AnswersSBsince the volume of the ball of radius 4 is 4 3 4 3 . x2 y2 lying over the unit disc in the xy-plane. Let F x y zPAnswer. Let C be the boundary of P: the circle x 2 curl F NdSPy21zCCIf
Utah - PROBS - 2210
Calculus III Practice Problems 4: Answers1. Consider the line L in the plane given by the equation 2x 5y 10 0. Find a base U V with U parallel to L, and V counterclockwise to U. Find the equation of the line in coordinates u v relative to the base
Utah - PROBS - 2210
Calculus III Practice Problems 11: Answers1. Let C be the boundary of the triangle with vertices at (0,0), (3,0), (4,5), oriented in the counterclockwise sense. Find C 3ydx 6xdy. Answer. Green's theorem tells us this isTsince T has base length 3
Utah - MATH - 2210
Mathematics 2210-90 Calculus III, Final Examination Jul 29,30,2003 1. Find the equation of the line through the origin and orthogonal to the plane through the points P (2, -1, 0), Q(1, 2, 1) and R(3, 0, 2). Solution. By &quot;the equation of the line&quot; we
Utah - MATH - 2210
Calculus III Practice Exam 21. A conic in the plane is given by the equationa) What conic is it? b) At what angle to the x-axis are the axes of the conic? 2. A conic in the plane is given by the equationa) What conic is it? b) At what angle to
Utah - MATH - 2210
Calculus III Practice Exam 2, Answers1. A conic in the plane is given by the equation x2 a) What conic is it? Answer. Since B2 square to obtain: x 4AC 2 y 2 2x y22xy4 1 1 0, this is a parabola. We can verify that by completing the 0, which is
Utah - MATH - 2210
Mathematics 2210 Calculus III, Final Examination Jul 29,30,2003 You may use graphing calculators and tables of Integrals. You MUST show enough work to convince me that you know how to do the problems. 1. Find the equation of the line through the orig
Utah - CS - 3520
laptop% ocaml Objective Caml version 3.06# 5 ;- : int = 5# true ;- : bool = true# 1 + 3 ;- : int = 4# fun (x : int) -&gt; x ;- : int -&gt; int = &lt;fun&gt;# fun x -&gt; x ;- : 'a -&gt; 'a = &lt;fun&gt;# (fun x -&gt; x) 10 ;- : int = 10# (fun (x) -&gt; (x) (
Utah - CS - 5510
Factorial(local [(define fac (lambda (n) (if (zero? n) 1 (* n (fac (- n 1)] (fac 10) local binds both in the body expression and in the binding expression1-2Factorial(let ([fac (lambda (n) (if (zero? n) 1 (* n (fac (- n 1)]) (fac 10) Doesn't wo
Utah - CS - 5510
Utah - CS - 5510
The Arbitrariness of IdentiersAre the following two programs equivalent? (define (f x) (+ x 1) (f 10) (define (f y) (+ y 1) (f 10)yes argument is consistently renamed1-2The Arbitrariness of IdentiersAre the following two programs equivalent?
Utah - CS - 5510
How to Design ProgramsHow to (in Scheme): represent data variants trees and lists write functions that process the data See also http:/www.htdp.org1Running Example: GUIsApple Pick a fruit: Banana Coconut Ok CancelPossible programs: Can cl
Utah - CS - 5510
1Page 12Page 273Store-Passing InterpretersOur BCFAE interpreter explains state by representing the store as a value Every step in computation produces a new store The interpreter itself is purely functional It's a store-passing interpre
Utah - CS - 5510
Functional ProgramsSo far, the language that we've implemented is purely functional A function produces the same result every time for the same arguments Also, lazy and eager results are the same. except that eager evaluation might loop forever
Utah - CS - 5510
Quiz Question #1: What is the value of the following expression? {+ 1 2} Wrong answer: 0 Wrong answer: 42 Answer: 31-4Quiz Question #2: What is the value of the following expression? {+ fun 17 8} Wrong answer: error Answer: Trick question!
Utah - CS - 3520
FAE Datatypes in Camltype fae = Num of int | Add of fae * fae | Sub of fae * fae | Id of string | Fun of string * fae | App of fae * fae and faeValue = NumV of int | ClosureV of string * fae * subCache and subCache = MTSub | ASub of string * faeValu
Utah - CS - 6510
Architecture of LISP MachinesKshitij Sudan March 6, 2008A Short History Lesson .Alonzo Church and Stephen Kleene (1930) Calculus( to cleanly define &quot;computable functions&quot; )John McCarthy (late 60's)(used Calculus to describe the operation o
Utah - CS - 5510
Simulating a Web ServerHTTP protocol is like calling a function:(define total 0) (define (a) `(&quot;Current value:&quot; ,total) &quot;Call a2 to add 2&quot; &quot;Call a3 to add 3&quot;) (define (a2) (set! total (+ total 2) (a) (define (a3) (set! total (+ total 3) (a)1Sim
Utah - CS - 5510
CFAL = Lazy FAE&lt;CFAL&gt;:= | | | | |&lt;num&gt; {+ &lt;CFAL&gt; &lt;CFAL&gt;} {- &lt;CFAL&gt; &lt;CFAL&gt;} &lt;id&gt; {fun {&lt;id&gt;} &lt;CFAL&gt;} {&lt;CFAL&gt; &lt;CFAL&gt;}{fun {x} 0} {+ 1 {fun {y} 2} 0 {fun {x} x} {+ 1 {fun {y} 2} error1Implementing CFALOption #1: Run the FAE interpreter in
Utah - CS - 3520
Cost of Substitution(interp {with {x 1} {with {y 2} {+ 100 {+ 99 {+ 98 . {+ y x} ) (interp {with {y 2} {+ 100 {+ 99 {+ 98 . {+ y 1} ) (interp {+ 100 {+ 99 {+ 98 . {+ 2 1} )With n variables, evaluation will take O(n2) time!1-4Delaying Substitu
Utah - CS - 5510
AE{- 20 {+ 10 10} {- 20 {+ 17 17} {- 20 {+ 3 3}1WAE{with {x 10} {- 20 {+ x x} {with {x 17} {- 20 {+ x x} {with {x 3} {- 20 {+ x x}2F1WAE{deffun {f x} {- 20 {+ x x}{f 10} {f 17} {f 3}3F1WAE{deffun {f x} {- 20 {twice x} {deffun {t
Utah - CS - 3520
Part I Lexical Addresses and Compilation1Identifier AddressSuppose that{fun {x} {+ x y}appears in a program.If the body is eventually evaluated:.{+ x y}where will x be in the substitution? Answer: always at the beginning:x = . .2-3