10 Pages

Wireshark_INTRO_July_22_2007

Course: EPL 375, Fall 2009
School: East Los Angeles College
Rating:
 
 
 
 
 

Word Count: 2508

Document Preview

Lab: Wireshark Getting Started Version: 2.0 2007 J.F. Kurose, K.W. Ross. All Rights Reserved Computer Networking: A Topth down Approach, 4 edition. Tell me and I forget. Show me and I remember. Involve me and I understand. Chinese proverb Ones understanding of network protocols can often be greatly deepened by seeing protocols in action and by playing around with protocols observing the sequence of messages...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> East Los Angeles College >> EPL 375

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.
Lab: Wireshark Getting Started Version: 2.0 2007 J.F. Kurose, K.W. Ross. All Rights Reserved Computer Networking: A Topth down Approach, 4 edition. Tell me and I forget. Show me and I remember. Involve me and I understand. Chinese proverb Ones understanding of network protocols can often be greatly deepened by seeing protocols in action and by playing around with protocols observing the sequence of messages exchanged between two protocol entities, delving down into the details of protocol operation, and causing protocols to perform certain actions and then observing these actions and their consequences. This can be done in simulated scenarios or in a real network environment such as the Internet. The Java applets that accompany this text take the first approach. In these Wireshark labs1, well take the latter approach. Youll be running various network applications in different scenarios using a computer on your desk, at home, or in a lab. Youll observe the network protocols in your computer in action, interacting and exchanging messages with protocol entities executing elsewhere in the Internet. Thus, you and your computer will be an integral part of these live labs. Youll observe, and youll learn, by doing. The basic tool for observing the messages exchanged between executing protocol entities is called a packet sniffer. As the name suggests, a packet sniffer captures (sniffs) messages being sent/received from/by your computer; it will also typically store and/or display the contents of the various protocol fields in these captured messages. A packet sniffer itself is passive. It observes messages being sent and received by applications and protocols running on your computer, but never sends packets itself. Similarly, received packets are never explicitly addressed to the packet sniffer. Instead, a packet sniffer receives a copy of packets that are sent/received from/by application and protocols executing on your machine. Earlier versions of these labs used the Ethereal packet analyzer. In May 2006, the developer of Ethereal joined a new company, and had to leave the Ethereal trademarks behind. He then created the Wireshark network protocol analyzer, a successor to Ethereal. Since Ethereal is no longer being actively maintained or developed, we have thus switched these labs over to Wireshark with the 4th edition of our text. 1 Figure 1 shows the structure of a packet sniffer. At the right of Figure 1 are the protocols (in this case, Internet protocols) and applications (such as a web browser or ftp client) that normally run on your computer. The packet sniffer, shown within the dashed rectangle in Figure 1 is an addition to the usual software in your computer, and consists of two parts. The packet capture library receives a copy of every link-layer frame that is sent from or received by your computer. Recall from the discussion from section 1.5 in the text (Figure 1.202) that messages exchanged by higher layer protocols such as HTTP, FTP, TCP, UDP, DNS, or IP all are eventually encapsulated in link-layer frames that are transmitted over physical media such as an Ethernet cable. In Figure 1, the assumed physical media is an Ethernet, and so all upper layer protocols are eventually encapsulated within an Ethernet frame. Capturing all link-layer frames thus gives you all messages sent/received from/by all protocols and applications executing in your computer. packet sniffer packet analyzer application application (e.g., www browser, ftp client) operating system packet capture (pcap) copy of all Ethernet frames sent/received Transport (TCP/UDP) Network (IP) Link (Ethernet) Physical to/from network to/from network Figure 1: Packet sniffer structure The second component of a packet sniffer is the packet analyzer, which displays the contents of all fields within a protocol message. In order to do so, the packet analyzer must understand the structure of all messages exchanged by protocols. For example, suppose we are interested in displaying the various fields in messages exchanged by the HTTP protocol in Figure 1. The packet analyzer understands the format of Ethernet frames, and so can identify the IP datagram within an Ethernet frame. It also understands the IP datagram format, so that it can extract the TCP segment within the IP datagram. Finally, it understands the TCP segment structure, so it can extract the HTTP message contained in the TCP segment. Finally, it understands the HTTP protocol and so, for example, knows that the first bytes of an HTTP message will contain the string GET, POST, or HEAD, as shown in Figure 2.8 in the text. 2 Figure numbers refer to figures in the 4th edition of our text. We will be using the Wireshark packet sniffer [http://www.wireshark.org/] for these labs, allowing us to display the contents of messages being sent/received from/by protocols at different levels of the protocol stack. (Technically speaking, Wireshark is a packet analyzer that uses a packet capture library in your computer). Wireshark is a free network protocol analyzer that runs on Windows, Linux/Unix, and Mac computers. Its an ideal packet analyzer for our labs it is stable, has a large user base and well-documented support that includes a user-guide (http://www.wireshark.org/docs/wsug_html_chunked/), man pages (http://www.wireshark.org/docs/man-pages/), and a detailed FAQ (http://www.wireshark.org/faq.html), rich functionality that includes the capability to analyze hundreds of protocols, and a well-designed user interface. It operates in computers using Ethernet, Token-Ring, FDDI, serial (PPP and SLIP), 802.11 wireless LANs, and ATM connections (if the OS on which it's running allows Wireshark to do so). Getting Wireshark In order to run Wireshark, you will need to have access to a computer that supports both Wireshark and the libpcap or WinPCap packet capture library. The libpcap software will be installed for you, if it is not installed within your operating system, when you install Wireshark.. See http://www.wireshark.org/download.html for a list of supported operating systems and download sites Download and install the Wireshark software: Go to http://www.wireshark.org/download.html and download and install the Wireshark binary for your computer. Download the Wireshark user guide. The Wireshark FAQ has a number of helpful hints and interesting tidbits of information, particularly if you have trouble installing or running Wireshark. Running Wireshark When you run the Wireshark program, the Wireshark graphical user interface shown in Figure 2 will de displayed. Initially, no data will be displayed in the various windows. command menus display filter specification listing of captured packets details of selected packet header packet content in hexadecimal and ASCII Figure 2: Wireshark Graphical User Interface The Wireshark interface has five major components: The command menus are standard pulldown menus located at the top of the window. Of interest to us now are the File and Capture menus. The File menu allows you to save captured packet data or open a file containing previously captured packet data, and exit the Wireshark application. The Capture menu allows you to begin packet capture. The packet-listing window displays a one-line summary for each packet captured, including the packet number (assigned by Wireshark; this is not a packet number contained in any protocols header), the time at which the packet was captured, the packets source and destination addresses, the protocol type, and protocol-specific information contained in the packet. The packet listing can be sorted according to any of these categories by clicking on a column name. The protocol type field lists the highest level protocol that sent or received packet, this i.e., the protocol that is the source or ultimate sink for this packet. The packet-header details window provides details about the packet selected (highlighted) in the packet listing window. (To select a packet in the packet listing window, place the cursor over the packets one-line summary in the packet listing window and click with the left mouse button.). These details include information about the Ethernet frame (assuming the packet was sent/receiverd over an Ethernet interface) and IP datagram that contains this packet. The amount of Ethernet and IP-layer detail displayed can be expanded or minimized by clicking on the plus-or-minus boxes to the left of the Ethernet frame or IP datagram line in the packet details window. If the packet has been carried over TCP or UDP, TCP or UDP details will also be displayed, which can similarly be expanded or minimized. Finally, details about the highest level protocol that sent or received this packet are also provided. The packet-contents window displays the entire contents of the captured frame, in both ASCII and hexadecimal format. Towards the top of the Wireshark graphical user interface, is the packet display filter field, into which a protocol name or other information can be entered in order to filter the information displayed in the packet-listing window (and hence the packet-header and packet-contents windows). In the example below, well use the packet-display filter field to have Wireshark hide (not display) packets except those that correspond to HTTP messages. Taking Wireshark for a Test Run The best way to learn about any new piece of software is to try it out! Well assume that your computer is connected to the Internet via a wired Ethernet interface. Do the following 1. Start up your favorite web browser, which will display your selected homepage. 2. Start up the Wireshark software. You will initially see a window similar to that shown in Figure 2, except that no packet data will be displayed in the packetlisting, packet-header, or packet-contents window, since Wireshark has not yet begun capturing packets. 3. To begin packet capture, select the Capture pull down menu and select Options. This will cause the Wireshark: Capture Options window to be displayed, as shown in Figure 3. Figure 3: Wireshark Capture Options Window 4. You can use most of the default values in this window, but uncheck Hide capture info dialog under Display Options. The network interfaces (i.e., the physical connections) that your computer has to the network will be shown in the Interface pull down menu at the top of the Capture Options window. In case your computer has more than one active network interface (e.g., if you have both a wireless and a wired Ethernet connection), you will need to select an interface that is being used to send and receive packets (mostly likely the wired interface). After selecting the network interface (or using the default interface chosen by Wireshark), click Start. Packet capture will now begin - all packets being sent/received from/by your computer are now being captured by Wireshark! 5. Once you begin packet capture, a packet capture summary window will appear, as shown in Figure 4. This window summarizes the number of packets of various types that are being captured, and (importantly!) contains the Stop button that will allow you to stop packet capture. Dont stop packet capture yet. Figure 4: Wireshark Packet Capture Window 6. While Wireshark is running, enter the URL: http://gaia.cs.umass.edu/wireshark-labs/INTRO-wireshark-file1.html and have that page displayed in your browser. In order to display this page, your browser will contact the HTTP server at gaia.cs.umass.edu and exchange HTTP messages with the server in order to download this page, as discussed in section 2.2 of the text. The Ethernet frames containing these HTTP messages will be captured by Wireshark. 7. After your browser has displayed the INTRO-wireshark-file1.html page, stop Wireshark packet capture by selecting stop in the Wireshark capture window. This will cause the Wireshark capture window to disappear and the main Wireshark window to display all packets captured since you began packet capture. The main Wireshark window should now look similar to Figure 2. You now have live packet data that contains all protocol messages exchanged between your computer and other network entities! The HTTP message exchanges with the gaia.cs.umass.edu web server should appear somewhere in the listing of packets captured. But there will be many other types of packets displayed as well (see, e.g., the many different protocol types shown in the Protocol...

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:

Iowa State - A - 79365
FA M I LYAnswersTiesJUNE ISSUE 2008TO THE HOUSING CRISISConcern about the housing crisis is in the news and the US government is looking into options. Pockets of stress have occurred in rural Iowa due to several factors. Increase ARM (Adjustable Rate
Michigan - EECS - 598
Progressive MeshesHugues HoppeMicrosoft ResearchABSTRACTHighly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance, transmission b
Michigan - EECS - 598
Efficient, Fair Interpolation using Catmull-Clark SurfacesMark Halstead Michael Kass Tony DeRose Apple Computer, Inc.AbstractWe describe an efficient method for constructing a smooth surface that interpolates the vertices of a mesh of arbitrary topolog
Michigan - EECS - 598
Subdivision methods for geometric designJoe Warren Department of Computer Science Rice University November 15, 1995Contents1 Introduction 2 Subdivision methods for uniform B-splines2.1 2.2 2.3 2.4 Degree zero B-splines : : : : : : : : Higher degree B-
Texas Tech - STAT - 5302
Latin Square Designs (15.4) Lecture Objective Introduce basic experimental designs that account for two orthogonal sources of extraneous variation. Terminology Square design Orthogonal blocks RandomizationsLatin Square -1Examples A researcher wishe
N.C. State - ZO - 501
RESEARCH ARTICLESMigrating Songbirds Recalibrate Their Magnetic Compass Daily from Twilight CuesWilliam W. Cochran,1* Henrik Mouritsen,2 Martin Wikelski3Night migratory songbirds can use stars, sun, geomagnetic eld, and polarized light for orientation
Texas Tech - STAT - 5302
Factorial Treatments (15.5)Completely randomized designs - One treatment factor at t levels. Randomized block design - One treatment factor at t levels, one block factor at b levels. Latin square design - One treatment factor at t levels, two block facto
Cornell - NELS - 39
Negative Concord is not Multiple Agree Liliane Haegeman (Lille III) and Terje Lohndal (University of Maryland) West Flemish (WF) is a language that exhibits Negative Concord (NC), that is, multiple negative expressions that together convey a single negati
Iowa State - NR - 24532
University of Texas at Dallas - KXW - 016500
Joint Operation in Multi-Hop WDM Networks under Dynamic Data Traffic*Wu Kai, Zeng Qingji, Xiong YizhiR&D Center for Broadband Optical Networking Technology Shanghai Jiao Tong University, Shanghai 20030, P. R. China Email: kwu816@mail1.sjtu.edu.cn Tel: (
Miami University - WILLIA - 85
Ecology, 82(6), 2001, pp. 17481760 2001 by the Ecological Society of AmericaULTRAVIOLET RADIATION AND ZOOPLANKTON COMMUNITY STRUCTURE FOLLOWING DEGLACIATION IN GLACIER BAY, ALASKACRAIG E. WILLIAMSON,1 OLAF G. OLSON,1 STEVEN E. LOTT,1 NATHAN D. WALKER,1
Clemson - HUBCAP - 211
Application: The Costs of Taxation8Copyright2004 South-WesternApplication: The Costs of Taxation Welfare economics is the study of how the allocation of resources affects economic wellbeing. Buyers and sellers receive benefits from taking part in the
Universitat Politcnica de Catalunya - PLA - 91
A New Instructional Operating SystemDavid A. Holland, Ada T. Lim,1 and Margo I. Seltzer Harvard University Cambridge, MA 02138 cfw_dholland,ada,margo@eecs.harvard.eduAbstractThis paper presents a new instructional operating system, OS/161, and simulate
Colorado - MOREY - 4808
0.1Discussion of the conditions necessary and su cientEdward Morey: neccsu.pdf January 23, 2007 " Tommy in the Grocery Store" - an important treatise on logicMy two favorite words: N _ _ _ _ _ _ _ _ and S_ _ _ _ _ _ _ _ _ If you understand the distinct
Stanford - MATH - 52
Math 52 - Winter 2007 - Midterm Exam IName: Student ID: Section number and TA name: Signature:Instructions: Print your name and student ID number, print your section number and TAs name, write your signature to indicate that you accept the honor code. D
Berkeley - CS - 61
CS61C Machine Structures Lecture 37 - Input/Output 11/26/2007 John Wawrzynek(www.cs.berkeley.edu/~johnw)www-inst.eecs.berkeley.edu/~cs61c/CS61C L37 Input / Output1Wawrzynek, Fall 2007 UCBReview: Virtual Memory Memory managed in conjunction with disk
Stanford - MATH - 51
EXAM II SOLUTIONSMath 51, Spring 2002. You have 2 hours. No notes, no books, no calculators. YOU MUST SHOW ALL WORK AND EXPLAIN ALL REASONING TO RECEIVE CREDIT Good luck! Name ID number1.(/30 points)"On my honor, I have neither given nor received any
UNC - MATH - 31
MATH 31 Review Problems Fall 20031. Use the graph to answer (a) through (f) below.ab0cda. xa f (x)= lim b. lim f (x)= +xcc. f (x) = 0 at what x value(s)? d. Give the x value(s) for which f (x) is discontinuous, but the limit at that point exists.
Acton School of Business - OCALLAGHAN - 195
INTRODUCTION TO LOGIC Phil 195 Winter 2006 195-A: Carnegie 339 M, W 1:10p2:30p 195-B: Carnegie 339 M, W 2:40p4p Oce hours: M, W 4p5p; F 11a12p Teaching Assistants: Katie Celeste (kceleste) and Adrienne Maxwell (amaxwell) Text Meaning and Argument: An Intr
East Los Angeles College - IT - 620
Storage and Retrieval of XML Data using Relational Databases - Chaudhuri, ShimStorage and Retrieval of XML Data Using Relational DatabasesSurajit ChaudhuriMicrosoft ResearchKyuseok ShimKAIST1About this TutorialTutorial presented based solely on pu
East Los Angeles College - IT - 620
Efficiently Publishing Relational Data as XML DocumentsJayavel Shanmugasundaram* Michael Carey Bruce Lindsay Eugene Shekita Hamid Pirahesh Rimon Barr Berthold Reinwald+IBM Almaden Research Center 650 Harry Road San Jose, CA 95139 jai@cs.wisc.edu, sheki
East Los Angeles College - IT - 620
Genomics Algebra: A New, Integrating Data Model, Language, and Tool for Processing and Querying Genomic InformationJoachim Hammer and Markus Schneider Department of Computer & Information Science & Engineering University of Florida Gainesville, FL 32611-
East Los Angeles College - IT - 620
The VLDB Journal 10: 270294 (2001) / Digital Object Identier (DOI) 10.1007/s007780100054Answering queries using views: A surveyA.Y. HalevyDepartment of Computer Science and Engineering, University of Washington, Seattle, WA, 98195; E-mail: alon@cs.wash
East Los Angeles College - IT - 620
Distributed Query Processing and Catalogs for Peer-to-Peer SystemsVassilis Papadimos David Maier OGI School of Science & Engineering Oregon Health & Science University cfw_vpapad,maier,tufte@cse.ogi.edu AbstractPeer-to-peer (P2P) architectures are commo
East Los Angeles College - IT - 620
SPOTLIGHTExtending Your Markup:An XML TutorialAndr Bergholz Stanford UniversityXML introduces a family of languages to provide a more semantic management of information than HTML.By now, no doubt, you've heard the acronym XML. You've probably also h
East Los Angeles College - IT - 620
Applying Model Management to Classical Meta Data ProblemsPhilip A. Bernstein Microsoft Research One Microsoft Way Redmond, WA 98052-6399 philbe@microsoft.com AbstractModel management is a new approach to meta data management that offers a higher level p
East Los Angeles College - IT - 620
Automated Ranking of Database Query ResultsSanjay Agrawal Microsoft Research Surajit Chaudhuri Microsoft Research Gautam Das Microsoft Research Aristides Gionis Computer Science Dept Stanford UniversityAbstractRanking and returning the most relevant re
East Los Angeles College - IT - 620
Crossing the Structure ChasmAlon Halevy Oren Etzioni AnHai Doan Zachary Ives Luke McDowell Igor Tatarinov Jayant MadhavanUniversity of Washington alon, etzioni, anhai, zives, jayant, lucasm, igor @cs.washington.eduAbstractIt has frequently been observ
Cox School of Business - LYLE - 3345
1 7Data Structures1 2005 Pearson Education, Inc. All rights reserved.2Much that I bound, I could not free; Much that I freed returned to me.- Lee Wilson Dodd`Will you walk a little faster?' said a whiting to a snail, `There's a porpoise close behin
Santa Rosa - CS - 66
Chapter 9The Wireless Revolution9.1 2006 by Prentice HallManagement Information SystemsChapter 9 The Wireless Revolution OBJECTIVES Identify the principal wireless transmission media and devices, cellular network standards and generations, and stand
Eastern Washington University - SCCS - 95
Queens on a Chessboard: Making the Best of a Bad Situation *Timothy J. Rolfe, Assistant ProfessorDakota State University Madison, SD 57024-1799 (605) 256-5166 rolfe@alpha.dsu.eduhttp:/www.dsu.edu/~rolfe/Current information Timothy J. Rolfe Professor,
Penn State - ME - 33
Figures 11-34 and 11-36 Smooth and Rough SpheresLaminar TurbulentFigure 11-34. Average drag coefficient for cross-flow over a smooth circular cylinder and a smooth sphere.Figure 11-36. The effect of surface roughness on the drag coefficient of a sphere
Penn State - ME - 33
Example Laminar Pipe Flow; an Exact Solution of the Navier-Stokes Equation (Example 9-18, engel and Cimbala) Note: This is a classic problem in fluid mechanics.Fully developed flowIt is good practice to number the assumptions.This is a tremendous simpl
Penn State - ME - 33
Taking a Shower while Someone Flushes the Toilet (Example Problem 8-9, engel and Cimbala)This is a practical, everyday example of a parallel piping network.This is a simplifying assumption that may or may not be valid. We should check the validity later
Penn State - ME - 33
EES Solution for Example Problem Matching a Pump to a Piping SystemHere is exactly what I typed into the main "Equations Window" of EES:Here is what the Formatted Equations window looks like (much "cleaner" looking equations and easier to spot typo erro
Penn State - ME - 33
The Moody Chart
Penn State - ME - 33
EES Solution for Example Problem Major and Minor Losses in a Piping SystemHere is exactly what I typed into the main "Equations Window" of EES:"EES Solution for the class example problem - major and minor losses in a piping system J. M. Cimbala, Februar
Penn State - ME - 33
Laminar Versus Turbulent Flow A Comparison (Section 8-2, engel and Cimbala) Laminar Flow Can be steady or unsteady. (Steady means that the flow field at any instant in time is the same as at any other instant in time.) Turbulent Flow Is always unsteady. W
Penn State - ME - 33
Example of Grade Lines in a Fluid FlowAt point 0, HGL = EGL inside the tank, since the fluid is at rest (V = 0). Neither EGL or HGL can rise above this value unless work is added to the flow (e.g., with a pump). At any location in the duct, the differenc
Penn State - ME - 33
Stability of a Boat (Figure 3-46, engel and Cimbala)Line of action of the buoyancy force before rotation Line of action of the buoyancy force after rotationPoint M is above point GPoint M is below point GM = the metacenter = the point where the lines
Penn State - ME - 33
Examples of Liquids in Rigid Body Rotation1. Liquid mercury mirrors. By rotating a container of mercury, a nice parabolic mirror can be generated without the need to grind or polish. Unfortunately, it can look only straight up. However, there is some dis
Penn State - ME - 33
ME 33, Fluid Flow Chapter 3: Examples of Archimedes PrincipleThe Golden Crown Hydrostatic Bodyfat TestingME 33, Fluid Flow Chapter 3: Examples of Archimedes PrincipleEric G. PatersonDepartment of Mechanical and Nuclear Engineering The Pennsylvania Sta
Penn State - ME - 33
Example Problem Hydrostatic Pressure Force on Curved Surfaces (Example Problem 3-9, engel and Cimbala)Draw a free body diagram around this volume of water, as shown to the right. Calculate the horizontal force Fx acting on the projected vertical face. Ca
Penn State - ME - 33
Hydrostatic Forces on Plane Surfaces (Section 3-5, engel and Cimbala)Liquid surface, open to air pressure P0 (P0 is usually Patm)The centroid C is the mathematical center of the plate's area. We calculate the average pressure at the centroid. However, t
Penn State - ME - 33
MIT - BHATT - 794
OpinionTRENDS in Cognitive SciencesVol.8 No.10 October 2004Universal Grammar, statistics or both?Charles D. YangDepartment of Linguistics and Psychology, Yale University, 370 Temple Street 302, New Haven, CT 06511, USARecent demonstrations of statis
MIT - E - 35
6.042/18.062J Mathematics for Computer Science Srini Devadas and Eric LehmanApril 14, 2005 Lecture NotesIntroduction to ProbabilityProbability is the last topic in this course and perhaps the most important. Many algorithms rely on randomization. Inve
Acton School of Business - OCALLAGHAN - 272
PHILOSOPHY FROM DESCARTES TO KANTCasey O'Callaghan Phil 272 Fall 2007 M, W, (F) 9:30a10:50a (o) 73 Campus Ave (e) cocallag@bates.edu (w) www.bates.edu/cocallag/ The era of the modern scientific revolution was spurred by the publication of Copernicus's 15
Columbia - EESC - 4937
REPORTSFig. 3. Comparative plot of active houses of giant larvaceans (blue line) and discarded sinkers (red line) versus depth, in square meters of area swept. The data are derived from a 10-year time series of quantitative video transects at depth inter
GWU - NSAEBB - 66
Swarthmore - E - 90
Directional Hearing Aid DesignDavid Luong and Mark Piper Swarthmore College E90 Senior Design Project Advisors: Professor Erik Cheever and Professor E. Carr Everbach November 30, 2005 Abstract In this proposal we describe our intent to build a directiona
Middle Tennessee State University - MTSU - 32
Applications of Ion-Selective ElectrodesAnalyte Ammonia Carbon dioxide Chloride Electrode type Gas sensing Gas sensing Solid State Liquid Membrane Combination Chlorine residual Cyanide Fluoride Nitrate Nitrogen oxide/nitrite Oxygen, dissloved Sulfide Sol
E. Michigan - EMUNIX - 138
The BlueJ TutorialVersion 1.4 for BlueJ Version 1.2.xMichael Klling Mrsk Insitute University of Southern Denmark1Table of contents1 Foreword 1.1 1.2 1.3 1.4 2 4About BlueJ. 4 Scope and audience. 4 Copyright, licensing and redistribution. 4 Feedback
UPenn - LDC - 95
DRAFT of 4/20/95 - JFP PhoneBook Final Report - - -John F. Pitrelli, Cynthia Fong, Hong C. Leung April 20, 1995 OVERVIEW PhoneBook is a phonetically-rich, isolated-word, telephone-speech database, created because of (1) the lack of available large-vocabul
San Jose State - ME - 20
Creating a SpringSelect Insert Helical Sweep Protrusion Four steps have to be performed to create a spring1 Attributes; Select Constant pitch, Thru Axis and Right Handed spring, then choose Done.Creating a Spring2 Swp Profile; Select Plane and choose
Colorado - MOREY - 4808
0.1Mathematics is a language of symbols, grammar and logic. It greatly facilitates the process of deductionJan 18, 2007, language.pdf While reviewing the syllabus, I said mathematics is a language. Languages are ways of conveying information and meaning
Stanford - RISA - 362
22. Dark matter 122. DARK MATTERWritten September 2003 by M. Drees (Technical University, Munich) and G. Gerbier (Saclay, CEA). Revised September 2005.22.1. Theory22.1.1. Evidence for Dark Matter : The existence of Dark (i.e., non-luminous and non-abs
UCSD - MATH - 20
Math 20F - Linear Algebra - Winter 2003 Quiz #6 1 Answers - March 4 2 1. Consider the following table of data values. x -1 y 0 0 1 2 4 2 4Find the best linear least squares fit to the data. That is, find the linear function f (x) = c0 + c1 x that best fi
UCSD - MATH - 20
Name: Discussion Section- No:PID: Time:Midterm 1, Math 20F - Lecture B (Spring 2007)Duration: 50 minutes This is a closed-book exam. Calculators are not allowed. You can use one page of notes. To get full credit you should support your answers. There
UCSD - MATH - 20
Name: Student ID:Thursday section time: Math 20F - Linear Algebra - Spring 2003 Self-Assessment Quiz #2.5 - April 251. Find the determinant of the following matrix: 1 2 1 2 2 4 2 2 2 3 6 4 . -1 0 2 2 ANSWER:1 2 2 -1 2 4 3 0 1 2 6 2 2 2 4 2 1 0 0 0 1 0
Cornell - NELS - 39
Maximize Presupposition and Two Types of Definite Competitors Luis Alonso-Ovalle1, Paula Menendez Benito2, and Florian Schwarz3. 1 UMass Boston, 2 University of Gttingen, 3UMass Amherst. As noted by Hawkins (1991), an indefinite phrase of the form a NP ca