3 Pages

Unit07

Course: CS 1110, Fall 2009
School: East Los Angeles College
Rating:
 
 
 
 
 

Word Count: 4218

Document Preview

to Introduction Systematic Programming Unit 7 - Writing Larger Programs 7 . 1 Introduction The first few units of this course have advocated a four stage approach to program writing: i) ii) iii) iv) General think through whole problem Identify and write down the most important features of a solution Get an algorithmic scheme Tidy up to give a complete Ada program. This scheme is fine for an introduction to...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> East Los Angeles College >> CS 1110

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.
to Introduction Systematic Programming Unit 7 - Writing Larger Programs 7 . 1 Introduction The first few units of this course have advocated a four stage approach to program writing: i) ii) iii) iv) General think through whole problem Identify and write down the most important features of a solution Get an algorithmic scheme Tidy up to give a complete Ada program. This scheme is fine for an introduction to writing short, simple programs; but it soon becomes clear that for larger programs a more powerful method is needed. For example think about the factor calculation problem in Unit [4.6]. We looked at a stage (ii) analysis, an algorithmic scheme and at the final program, but did not consider in detail the question of how to get from (ii) to (iii) to (iv). Yet for you to learn to write larger programs, this question must be effectively answered. If we try to apply our current scheme, we will soon find that to make the direct leap from (ii) (features) to (iii) (algorithm) is too difficult (certainly if we want any assurance of correctness). It is also true that once you have some experience of Ada, the clear separation between (iii) and (iv) which is suggested above is unnecessarily restrictive. In fact what we need is a more gradual approach which enables us to make the transitions (ii) - (iii) - (iv) in 'easy stages'. To see how such a method could work, we shall consider the following problem. 7 . 2 Employees' pay problem - systematic development of a solution Problem: Data has been prepared about the employees of a particular company, and contains an employee code number (between 1 and 9999 inclusive), the number of hours and minutes worked during the week, the hourly rate of pay in pounds and pence, and the tax code, for each employee. The data is terminated by a zero employee code number. A program is to be written to determine the following: The gross amount (ie. before tax) earned for the week by each employee (in and pence) The net amount (ie. after tax) earned by each employee for the week (in and pence). The tax to be deducted from the gross pay can be calculated as follows: 0 annual tax due = (annual gross pay - tax threshold) x 0.25 where tax threshold = 10 x tax code annual gross pay = 52 x weekly gross pay annual tax due = 52 x weekly tax due otherwise if the annual gross pay tax threshold - The average actual (ie. net) rate of pay in pounds and pence per hour (to the nearest penny) averaged over all the employees. 7 . 2 . 1 Describe the form of the input data Start by considering the form that the data should take (making up some typical data values and annotating the values with explanatory comments and data types). For this problem we produce: employee codes (Integer) 9271 1235 .... .... 8710 0 35 42 .. .. 38 40 0 .. .. 30 3.25 2.20 .... .... 3.74 240 120 ... ... 202 one such line for each employee data terminator hours minutes worked ( Integer) Ada 7/1 rate of pay in pounds and pence per hour ( Float) tax code (Integer) 1996 A Barnes, L J Hazlewood 7 . 2 . 2 Describe the form of the output results Repeat the above for the form of the results (though fewer comments will be necessary since the results will normally include explanatory headings and other text), producing results which correspond to the data values chosen earlier. We thus produce: EmployeeGross PayTax DueNet Pay 9271115.9117.4498.47 1235 92.40 17.33 75.07 .... ...... ..... ..... .... ...... ..... ..... 8710 143.99 26.29 117.70 Average net rate of pay per hour is 2.97 heading one such line for each employee summary It is also useful at this stage to indicate the intended layout by the inclusion of spaces and blank lines, though this information will not be used until we write the final program. It is helpful if the values in this 'output diagram' are calculated (by hand), from the values in the corresponding 'input data daigram'. 7 . 2 . 3 First thoughts (optional) We need to work through the data line-by-line, calculating the gross pay, tax due, and net pay for each employee from the time worked, hourly rate and tax code, and outputting a line of the table for each line of the data (this implies that we need for a repetition terminated by finding an employee-code whose value is 0). During this repetition, we need to increment a total of the overall net amount earned by all the employees, and to increment a total of the overall time worked by all employees (so that we can later work out the average net hourly rate of pay for all the employees). When the main repetition is complete (and hence all the rows of the table have been output), we can then calculate and output the average net hourly rate of pay. Of course, the heading for the table will need to be output before the main repetition described above commences. 7 . 2 . 4 Write a top level design or outline algorithm The form of the input and output diagrams, the hand calculations needed to produce the values in the output diagram from those chosen in the input diagram and the 'first thoughts' stages should have identified the overall structure of a solution to the problem. The next step is to start to express an algorithmic structure. Firstly, write down a combination of Ada steps and English phrases as appropriate describing (in their correct order) the main features which are important to the overall processing to be performed. Applying this prescription to the example we might obtain something like this: Initialise TotalHrsWorked and TotalNetPay ................. A Output heading for table .................................. B Process all the employee records (ie. outputting the rows of the table and incrementing the values ......... C of TotalHrsWorked and TotalNetPay) Produce average hourly rate of pay (ie. divide TotalNetPay by TotalHrsWorked) ............ D We shall call a form such as the above a top level design or outline algorithm, ie. a description which captures the main essential structure of the algorithm, with all components in the correct order. 7 . 2 . 5 Identify any global variables List the major variables which are identifiable in the top level design. These will be those variables which have been explicitly referred to (ie. by name) in the top level design, or those variables which are not referred to explicitly, but whose existence can be inferred from the intended steps. In the latter case, it should not include variables which are to be used wholly within a single step of the top level design (such as a variable to hold the calculated average net hourly rate of pay in step D), but rather those variables which are needed to hold data values which are required in more than one step, and hence are necessary to communicate information from one step to another. 1996 A Barnes, L J Hazlewood Ada 7/2 Variables identified in this way will become the global variables of the (main) program. In this case the variables which have been used to communicate information between the steps have also been explicitly identified, so we would list the variables: TotalHrsWorked : Float; TotalNetPay : Float; -- Total hours worked for all employees -- Total net pay for all employees Here we note that the variables TotalHrsWorked and TotalNetPay need to be initialised (to zero) in step A, to be updated with the details of individual employee payments in step C, and finally to be used to produce the output in step D (TotalNetPay is divided by TotalHrsWorked to calculate the average net rate of pay), and hence are used to communicate values between the steps of the top level design. 7 . 2 . 6 Development of top level design steps The labelled English phrase steps in the top level design must now be expanded, ie. worked out to a greater level of detail. We may proceed by writing each top level design step as a procedure. For each procedure body we follow a similar scheme to that adopted in the formation of the top level design, using a combination of correctly ordered English phrases describing major activities, and Ada steps as appropriate. This typically involves writing what can immediately be determined in Ada (particularly using the formal notation IF..THEN..ELSE..END IF for expressing selections, and WHILE..LOOP..END LOOP for repetitions) and leaving steps which require greater elaboration as English phrases. It is usually best to begin with the step that's most crucial to the problem: here that is obviously step C (Process all the employee records). Notice that to simplify organisation each undeveloped step has been given an identifying label. It is clear from what we have said above in [7.2.5] that this procedure is going to have to update the global variables TotalHrsWorked and TotalNetPay, ie. these variables are going to be IN OUT actual parameters of the procedure. Thus a possible development of C would be the call: C: ProcessEmployeeRecords ( TotalHrs => TotalHrsWorked, TotalPay => TotalNetPay ) to the procedure: PROCEDURE ProcessEmployeeRecords ( TotalHrs : IN OUT Float; TotalPay : IN OUT Float ) IS BEGIN Get(Item => EmployeeCode) WHILE EmployeeCode /= 0 LOOP Deal with this employee (ie. calculate the hours worked, gross pay, tax due ....... C1 and net pay - and output table row for this employee) Update TotalHrs and TotalPay with the details for this employee ......... C2 Get(Item => EmployeeCode) END LOOP END ProcessEmployeeRecords As each development proceeds we should list the major variables referenced, using exactly the same approach as was adopted in the top level design. The difference here though is that these variables will become the local variables of the procedure ProcessEmployeeRecords. In this case we note the explicitly identified variable EmployeeCode, and the implicitly referred to variables which are worked out in step C1 and needed in step C2 to update the values of the variables TotalHrs and TotalPay. Giving: EmployeeCode : Integer; HrsWorked : Float; -- Number of hours worked by this employee NetPay : Float; -- Net pay of this employee 1996 A Barnes, L J Hazlewood Ada 7/3 Having commenced the refinement of one major step it is usually better to continue its refinement, thus details of each major English phrase used in the refinement of C are then refined. Applying the same process as before we might refine step C1 as the call: C1: ProcessOneEmployee ( EmployeeNo => EmployeeCode, TimeWorked => HrsWorked, TakeHomePay => NetPay ) to the procedure: PROCEDURE ProcessOneEmployee ( EmployeeNo : IN Integer; TimeWorked : OUT Float; TakeHomePay : OUT Float ) IS BEGIN Input Hours, Mins, Rate and TaxCode ........... C1a Calculate TimeWorked, GrossPay, TaxDue and NetTakeHomePay .................. C1b Output EmployeeNo, GrossPay, TaxDue and TakeHomePay ..................... C1c END ProcessOneEmployee which uses the local variables: Hours Mins Rate TaxCode GrossPay TaxDue : : : : : : Integer; Integer; Float; Integer; Float; Float; ------Number of whole hours worked Number of minutes worked Rate of pay in pounds per hour Tax code Gross pay (before tax) Amount of tax to be paid We don't always refine every step into a procedure, sometimes it is clearer to do so, sometimes it is better for the steps to be expressed directly without using a procedure. There is no hard and fast rule about which approach is best - but general advice is to procedurise if the step being refined is complicated. You might feel that introducing all these intermediate steps is unnecessary, and a tedious waste of time, but experience has shown that sticking to fairly small expansions, about whose correctness you can be reasonably certain, is the best policy in the long run. Having got this far, it is now quite straightforward to expand C1a, C1b and C1c into Ada: C1a: Get(Item Get(Item Get(Item Get(Item => => => => Hours) Mins) Rate) TaxCode) C1b: TimeWorked := Float(Hours) + Float(Mins) / 60.0 TaxThreshold := Float(10 * TaxCode) AnnualGrossPay := 52.0 * TimeWorked * Rate GrossPay := AnnualGrossPay / 52.0 IF AnnualGrossPay <= TaxThreshold THEN AnnualTaxDue := 0.0 ELSE AnnualTaxDue := (AnnualGrossPay - TaxThreshold) * 0.25 END IF TaxDue := AnnualTaxDue / 52.0 TakeHomePay := GrossPay - TaxDue which uses the additional local variables (local to the procedure ProcessOneEmployee): TaxThreshold : Float; AnnualGrossPay : Float; AnnualTaxDue : Float; -- Threshold for paying tax at all -- 52 times the weekly gross pay -- 52 times the weekly tax to be paid 1996 A Barnes, L J Hazlewood Ada 7/4 C1c: Put(Item Put(Item Put(Item Put(Item => => => => EmployeeNo) GrossPay) TaxDue) TakeHomePay) where for brevity the output formats have been omitted. Of course they will need to be added later when we write the final program. Step C1 is now completely refined. Step C2 now becomes: C2: TotalHrs := TotalHrs + HrsWorked TotalPay := TotalPay + NetPay Of the remaining undeveloped steps in the top level design (A, B and D), step B is almost trivial and hence is not considered further until we write the final program, while the others are relatively straightforward and can be expanded as: A: TotalHrsWorked := 0.0 TotalNetPay := 0.0 Having already worked out section C, which uses these variables, it is easy to ensure that nothing is overlooked in the initialisation step A. This demonstrates one advantage of dealing with the more central parts of a program first, than rather simply trying to work from 'top to bottom'. We can complete the design with the refinement of D as the call: D: OutputAverageRate ( TotalHrs => TotalHrsWorked, TotalPay => TotalNetPay ) to the procedure: PROCEDURE OutputAverageRate ( TotalHrs : IN Float; TotalPay : IN Float ) IS BEGIN AverageNetRate := TotalPay / TotalHrs Put(Item => "Average net rate of pay per hour is ") Put(Item => AverageNetRate) END OutputAverageRate which uses the local variable: AverageNetRate : Float; -- Average net rate of pay per hour 7 . 3 Input/Output using files With the simple programs discussed so far, we have assumed that input comes from a keyboard and output is sent back to a VDU screen; however, this interactive form is often inconvenient. There may be a large amount of data which we don't want to re-type each time the program is tested, or we may wish to produce printed output, or to avoid input and output getting mixed up on the VDU screen. The solution is to use (magnetic disk) files. If so directed, an Ada program can read its input from a file and/or send its output to a file. In order to use a file Employees.dat (say) for input it must first be opened with the command: OpenInput(FileName => "Employees.dat"); This causes the program to read its subsequent input data (using the Get procedure) from the specified data file rather than from the keyboard. Similarly, the command: OpenOutput(FileName => "Payroll.txt"); will cause the program to write its subsequent output results (using the procedures Put, New_Line, etc.) to the specified file: Payroll.txt, rather than to the VDU screen. Note that any previous contents of the output-file Payroll.txt will then be overwritten. 1996 A Barnes, L J Hazlewood Ada 7/5 Note the convention which is used to identify data and results files which are used with a particular program, ie. use the extension 'dat' for a data file, 'txt' for a file containing text (which could be program results, or 'res' is sometimes used instead). 1996 A Barnes, L J Hazlewood Ada 7/6 When we have finished reading data from an input file we should 'tidy-up' by closing the file with the command: CloseInput; This closes the file and any subsequent input is then taken from the keyboard. Similarly an output file is closed with the command: CloseOutput; and any further output produced by the program is then sent to the VDU screen. Sometimes we may want a program to read its input from a file and/or send its output to a file specified by the user at run-time (rather than a file whose name is specified by the programmer as above). In this case we can use versions of the OpenInput and OpenOutput procedures which take no parameters. For example if a program contains the step: OpenInput; then on execution, the program outputs: Input File> on the VDU screen to prompt the user to enter the name of the file to be opened. The user then types the name of the desired file (not surrounded by double quote marks) and presses the return key. A similar prompt for the user to enter the name of the file to be used for output is produced by the step: OpenOutput; The procedures OpenInput, OpenOutput, CloseInput and CloseOutput are provided in the Ada library package CS_File_IO and before we can use them we must 'import' them into our program by means of the WITH and USE clauses: WITH CS_File_IO; USE CS_File_IO; It is worth noting that if a program takes its input from a file, then obviously prompts to the user of the program (which might have been introduced if the program were to be used interactively) to input data values are not required (since a program which inputs its data values from a file is no longer interactive) and should therefore be omitted. Of course, all data values needed by the program should have been put into the input file (for example by using an editor) before the execution of the program is to commence. You may have observed that the approach described here for input/output using files is different to that in the recommended course books by Feldman and Koffman or Rudd. This is due to the fact that many of the input and output procedures we use are not part of the Ada language, but can be made available to an Ada program in a fairly straightforward manner. In this course we have chosen to make them available through the library packages CS_Int_IO, CS_Flt_IO and CS_File_IO, rather than the approaches adopted by Feldman and Koffman or Rudd, because our approach combines simplicity and flexibility, and is therefore a little easier for you to use. 7 . 4 Final program Finally we collect all the fully developed Ada procedures and program segments together, using the code letters (A, B, C, etc.) to ensure that everything is put in the correct place, add the punctuation, improve the layout of the results, and add further suitable explanatory comment when appropriate. We have also included the use of OpenInput, OpenOutput, etc. to input the data values from a file (since there may potentially be a large amount of data) and output the results to a file (since there may also potentially be a large number of results). 1996 A Barnes, L J Hazlewood Ada 7/7 WITH Ada.Text_IO; USE Ada.Text_IO; WITH CS_Int_IO; USE CS_Int_IO; WITH CS_Flt_IO; USE CS_Flt_IO; WITH CS_File_IO; USE CS_File_IO; ----- To To To To import import import import Put for text, and New_Line Get and Put for Integer I/O Get and Put for real I/O OpenInput, OpenOutput etc. PROCEDURE EmployeesPay IS -- Example program for Unit 07 of Ada course. -- Written by L J Hazlewood, October 1993. -- Updated by A Barnes, August 1996. -- See Ada notes Unit [7.2] for the problem specification PROCEDURE ProcessOneEmployee ( EmployeeNo : IN Integer; TimeWorked : OUT Float; TakeHomePay : OUT Float ) IS -- To deal with this employee (ie. calculate the hours worked, -- gross pay, tax due and net pay - and output table row -- for this employee) Hours : Integer; -- Number of whole hours worked Mins : Integer; -- Number of minutes worked Rate : Float; -- Rate of pay in pounds per hour TaxCode : Integer; -- Tax code GrossPay : Float; -- Gross pay (before tax) TaxDue : Float; -- Amount of tax to be paid TaxThreshold : Float; -- Threshold for paying tax at all AnnualGrossPay : Float; -- 52 times the weekly gross pay AnnualTaxDue : Float; -- 52 times the weekly tax to be paid BEGIN -- Input Hours, Mins, Rate and TaxCode Get(Item => Hours); Get(Item => Mins); Get(Item => Rate); Get(Item => TaxCode); -- Calculate TimeWorked, GrossPay, TaxDue and TakeHomePay TimeWorked := Float(Hours) + Float(Mins) / 60.0; TaxThreshold := Float(10 * TaxCode); AnnualGrossPay := 52.0 * TimeWorked * Rate; GrossPay := AnnualGrossPay / 52.0; IF AnnualGrossPay <= TaxThreshold THEN AnnualTaxDue := 0.0; ELSE AnnualTaxDue := (AnnualGrossPay - TaxThreshold) * 0.25; END IF; TaxDue := AnnualTaxDue / 52.0; TakeHomePay := GrossPay - TaxDue; -- Output EmployeeNo, GrossPay, TaxDue and TakeHomePay New_Line; Put(Item => EmployeeNo, Width => 7); Put(Item => GrossPay, Fore => 10, Aft => 2); Put(Item => TaxDue, Fore => 7, Aft => 2); Put(Item => TakeHomePay, Fore => 9, Aft => 2); -- The above formats have been chosen to produce the output -- layout given in the output diagram in [7.2.2] END ProcessOneEmployee; 1996 A Barnes, L J Hazlewood Ada 7/8 PROCEDURE ProcessEmployeeRecords ( TotalHrs : IN OUT Float; TotalPay : IN OUT Float ) IS -- To process all the employee records (ie. outputting the rows of -- the table and incrementing the values of TotalHrs and TotalPay) EmployeeCode : Integer; HrsWorked : Float; -- Number of hours worked by this employee NetPay : Float; -- Net pay of this employee BEGIN Get(Item => EmployeeCode); WHILE EmployeeCode /= 0 LOOP -- Deal with this employee (ie. calculate the hours worked, -- gross pay, tax due and net pay - and output table row -- for this employee) ProcessOneEmployee ( EmployeeNo => EmployeeCode, TimeWorked => HrsWorked, Take...

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:

UCLA - STATS - 100
MonthX1X2SalesJan1114.049.4Feb811.847.5Mar1115.752.6Apr1415.549.3May1719.561.1Jun1516.853.2Jul1212.847.4Aug1013.649.4Sep1718.262.0Oct1116.047.9Nov813.047.3Dec1820.061.5Jan1215.154.2Feb1014.24
UCLA - CACHE - 0003
$GLL ORBIT PROFILE*ORPRO PSDT*I27B.ORPRO/I27BDD*LEVEL PA2*PREP P.FIESELER X3-0761/D.BLUHM X3-1129*RUNID SEQPF*PROGRAM SEQGEN 98-303/16:29:32.000*CREATION 00-055/20:49:57.681*BEGIN 00-057/20:00:00.000*CUTOF
East Los Angeles College - CS - 1110
CS1110 Introduction to Systematic Programming 1st Practical Class Week 4In this lab we will be looking at Use of Emacs Ada Mode File I/O in Ada Copy the files/usr/local/staffstore/cs1110/debug-exercises/mess.adb /usr/local/staffstore/cs1110/tutoria
UCLA - CACHE - 0003
Interplanetary Cruise TrajectoryFLYBY (1) DEC 8, 1990FLYBY (2) DEC 8, 1992 LAUNCH OCT 18, 1989TCM-19 3/09/93 VENUSFLYBY FEB 10, 1990 TCM-20 8/13/93TCM-22 10/4/93IDA AUG 28, 1993GASPRA OCT 29, 1991TCM-22A 2/15/94PROBE RELEASETCM-25 (
East Los Angeles College - CS - 1110
Introduction to Systematic Programming Unit 18 - Sorting18.1 More on FOR loopsOccasionally it is convenient to use a 'count-down' FOR loop in which the control variable is decreased by one at the end of each repetition. This kind of Ada FOR loop h
East Los Angeles College - CS - 1110
7#u# #q#0# # # # # #)#)# )##5#F#{#@#0#x#)#c# #g#*#N# #U#'#3##Introduction to Systematic ProgrammingUnit 15 - More on Arrays and Strings.15.1 Unconstrained array typesIn Units 10 and 11 we saw how to declare array types, for example: NumHts : CONSTA
East Los Angeles College - CS - 2130
CS2130 Programming Language ConceptsUnit 9 - Values, Types and Variables The term value refers to anything that results when an expression is evaluated, or an entity that may be stored in a memory cell within the computer, or which forms part of a l
Wisconsin Milwaukee - PSY - 551
Psy 551: Learning TheoryHandout on schedules of reinforcementA schedule is a rule for continuing to deliver reinforcers after aresponse has been learned.Continuous reinforcement (CRF) is delivering a reinforcer as aconsequence of every respons
Laurentian - BIOL - 200801
Date Jan. 3 Jan. 10 Jan. 17 Jan. 24Jan. 31Feb. 7 Feb. 14Feb. 21 Feb. 28Mar. 6Mar. 13Mar. 20 Mar. 27 Apr. 3Speaker No speaker Tim Lysyk, Agiculture and AgriFood Canada Anne Beeston, Canada Food Inspection Agency Roy Golsteyn, Department
Laurentian - BIOL - 4500
Date Jan. 4 Jan. 11 Jan. 18Speaker No speaker Doug Colwell, Agriculture Canada Paul Vasey, Psychology and Neuroscience, U. of L. Richard Wassersug Anatomy and Neurobiology, Dalhousie U. Eduardo Taboada, Animal Disease Research Inst. Ute Kothe, Chem
Allan Hancock College - CFACGAR - 20071
[pic] Classification (Publications, Films and Computer Games) Amendment Regulations 2007 (No. 1)1 Select Legislative Instrument 2007 No. 180 I, PROFESSOR MARIE BASHIR, AC, CVO, Deputy for the Governor-General of the Commonwealth
East Los Angeles College - CS - 171
UNIT 11 : Economics The international environment This unit should enable you to understand and explain: The rationale behind international trade The balance of payments account Dealing with balance of payments problems Exchange rate systems Exc
Allan Hancock College - FLAGCAR - 20022002
The legislation that is being viewed is valid for Sessional. Fisheries (Rock Lobster and Giant Crab) Amendment Rules 2002 (S.R. 2002, No. 2)-- CONTENTS
UCLA - CACHE - 0201
Sheet1 PDS_VERSION_ID = PDS3 RECORD_TYPE = STREAM OBJECT = TEXT PUBLICATION_DATE = 2007- NOTE = &quot;This file describes known errors or deficiencies in this archive volume set.&quot; END_OBJECT = TEXT END Users are encouraged to provide comments back to the
Allan Hancock College - FCAR - 200132001
FEDERAL COURT AMENDMENT RULES 2001 (NO. 3) 2001 NO. 322 FEDERAL COURT AMENDMENT RULES 2001 (NO. 3) 2001 NO. 322 - TABLE OF PROVISIONS1. Name of Rules 2. Commencement 3. Amendment of Federal Court Rules SCHEDULE 1 Amendments FED
East Los Angeles College - ACE - 2160
ACE2160 Professional Development Course Outline ver 4Session 1 2 3 4 5 6Topics Introduction to the module; camera work Demonstrations and presentations Demonstrations; introduction to presentations; camera work Presentations - persuasive; camera
East Los Angeles College - PAS - 401
Chapter 5 Stochastic Integrals5.1 The Construction of Stochastic IntegralsFor the rest of this course, we will work on nite time intervals of the form [0, T ]. Well x a probability space (, F, P ) and (Ft , 0 t T ) will be the natural ltration o
East Los Angeles College - PAS - 401
Chapter 7 Stochastic Dierential Equations7.1 SDEs - Existence and UniquenessIn this chapter well be concerned with It processes Y = (Y (t), 0 t T ) o which have a stochastic dierential of the form dY (t) = f (t, Y (t)dB(t) + g(t, Y (t)dt, (7.1.1
East Los Angeles College - PAS - 401
Chapter 6 Stochastic Calculus6.1 It^ Processes and their Stochastic Differo entialsStochastic calculus is concerned with modelling the dynamical behaviour of systems that are interacting with random noise. We are going to consider a general model
East Los Angeles College - PAS - 401
Chapter 2 Conditional ExpectationConditional expectation is an extremely important concept in modern probability theory. In applications to e.g. option pricing, many key formulae are expressed as conditional expectations. In earlier courses you may
East Los Angeles College - PAS - 401
Chapter 4 Brownian Motion4.1 Stochastic Processes in Continuous TimeFor the rest of this course, we will concentrate our attention on stochastic processes whose time index is continuous. So (refer to section 1.4.5) we will either take I = [0, T ]
Metropolitan State College of Denver - ENV - 4970
ROCKY MOUNTAIN NATIONAL PARKGeologic History of the ParkGeologic Timeline (Richmond 1974)1Glacial Geology of the East Side Pre-Bull Lake Exact timing is difficult Lack morainal form 6 ft thick with a yellowish-red color and a clayey charact
Metropolitan State College of Denver - ORADOC - 817
Using Microsoft Transaction Server with Oracle8Release 8.1.6January 2000 Part No. A73029-01Using Microsoft Transaction Server with Oracle8, Release 8.1.6 Part No. A73029-01 Copyright 1996, 2000, Oracle Corporation. All rights reserved. Primary
Metropolitan State College of Denver - ORADOC - 817
Oracle8iGetting to Know Oracle8iRelease 2 (8.1.6)December 1999 Part No. A76962-01Getting to Know Oracle8i , Release 2 (8.1.6) Part No. A76962-01 Copyright 1996, 1999, Oracle Corporation. All rights reserved. Primary Author: Michele Cyran Rut
Metropolitan State College of Denver - ORADOC - 817
Oracle8iStandby Database Concepts and AdministrationRelease 2 (8.1.6)December 1999 Part No. A76995-01Oracle8i Standby Database Concepts and Administration, Release 2 (8.1.6) Part No. A76995-01 Copyright 1999, Oracle Corporation. All rights r
Metropolitan State College of Denver - ASCI - 512
INTERNATIONAL SPACESTATIONMikeSuden SpaceMissionandLaunch OperationsOverviewPurpose History Whosinvolved Future ConclusionPurpose Longtermhumanpresenceinspace Conductresearchtosupporthuman explorationofspace ISShassixlaboratori
Metropolitan State College of Denver - DOCS - 20042005
TRUSTEES OF THE METROPOLITAN STATE COLLEGE OF DENVER Wednesday, January 12, 2005 9 a.m. 12 noon Administration Building Room 570 Auraria CampusAGENDAI. II.CALL TO ORDER APPROVAL OF MINUTES A. Approval of December 1, 2004, Board Meeting Minutes
Metropolitan State College of Denver - DOCS - 20032004
FINANCE COMMITTEE TRUSTEES OF THE METROPOLITAN STAE COLLEGE OF DENVER Wednesday, April 7, 2004 6:30 a.m. 8:00 a.m. Tivoli Student Union, Room 317 Auraria CampusI. II.CALL TO ORDER APPROVAL OF MINUTES March 3, 2004 Finance Committee MinutesIII.
Metropolitan State College of Denver - ENV - 4970
ENV 4970NAME _GIS Lab Exercise: Interpolation Download the Arc data filesOn the course webpage, download the data the interpolation lab. Extract the compressed data (password: glacier) and copy the entire folder to your jump drive-ask me for hel
Metropolitan State College of Denver - ASCI - 512
New Horizon Topics Mission Objectives Specs Payload Current Position Full Trajectory Trivia ConclusionNew Horizons: Mission ObjectivesMap surface composition of Pluto and Charon Characterize geology and morphology of Pluto and Charon Cha
Metropolitan State College of Denver - ENV - 3700
Mountain Research and Deuclojment, Val. 4 , No. 4 , 1984, pp. 287-298THE NATURE OF MOUNTAIN GEOMORPHOLOGYDIETRICH BARSCH' N D NEL C A I N E ~ AABSTRACT A century of study suggests many common characteristics in the geomorphic nature of high moun
Metropolitan State College of Denver - DOCS - 20072008
MSCD BOTSeptember 24, 20071METROPOLITAN STATE COLLEGE of DENVER BOARD OF TRUSTEESMonday, September 24, 2007 1:45 pm. CN 315 AGENDA I. II. CALL TO ORDER ACTION ITEM: The following item is presented by the Office of Academic Affairs: A. Handboo
Metropolitan State College of Denver - DOCS - 20062007
1METROPOLITAN STATE COLLEGE of DENVER BOARD OF TRUSTEES Wednesday, September 6, 2006 10 a.m. 12 noon Tivoli Student Union Room 320 Auraria Campus AGENDA I. II. CALL TO ORDER EXECUTIVE SESSION The Board may convene into Executive Session for the pu
East Los Angeles College - SJM - 217
order to test our assumptions and evaluate the consequences of our proposals, we attempted to measure the eective delay function of the Mixmaster and Mixminion supermix over 26 days. The client software was run in its default conguration, except for
UCLA - CACHE - 2026
Sheet1 PDS_VERSION_ID = PDS3 RECORD_TYPE = STREAM OBJECT = TEXT PUBLICATION_DATE = 2007-05-18 NOTE = &quot;INFO.TXT describes the Electron Reflectometer (ER) data available on this volume.&quot; END_OBJECT = TEXT END The DATA/ER directory contains the Electron
Metropolitan State College of Denver - ORADOC - 817
Oracle8iJava Tools ReferenceRelease 3 (8.1.7)July 2000 Part No. A83727-01Java Tools Reference, Release 3 (8.1.7) Part No. A83727-01 Release 3 (8.1.7) Copyright 1996, 2000, Oracle Corporation. All rights reserved. Primary Authors: Sheryl Mari
Metropolitan State College of Denver - DOCS - 20032004
TRUSTEES OF THE METROPOLITAN STATE COLLEGE OF DENVER Wednesday, April 7, 2004 8 a.m. 12 noon Tivoli Student Union, Room 320 Auraria CampusAGENDAI.CALL TO ORDERII.APPROVAL OF MINUTES A. March 3, 2004, Board Meeting MinutesIII.REPORTS A.
Metropolitan State College of Denver - DOCS - 20072008
Metro State BOTSeptember 5, 20071METROPOLITAN STATE COLLEGE of DENVER BOARD OF TRUSTEES Wednesday, September 5, 2007 10:00 a.m. 12:00 p.m. Tivoli Student Union Room 320 Auraria Campus AGENDA I. CALL TO ORDER II. EXECUTIVE SESSION A. The Board
Metropolitan State College of Denver - DOCS - 20062007
Metro State Board of TrusteesMay 2, 20071METROPOLITAN STATE COLLEGE of DENVER BOARD OF TRUSTEES Wednesday, May 2, 2007 8 a.m. 12 noon Tivoli Student Union Room 320 Auraria Campus AGENDA I. II. CALL TO ORDER SWEARING IN OF NEW TRUSTEES A. Swear
Metropolitan State College of Denver - ORADOC - 817
Oracle8iOracle Servlet Engine User's GuideRelease 3 (8.1.7)July 2000 Part No. A83720-01Oracle Servlet Engine User's Guide, Release 3 (8.1.7) Part No. A83720-01 Copyright 1996, 1999, 2000, Oracle Corporation. All rights reserved. Primary Autho
Metropolitan State College of Denver - ENV - 4010
A P T E R C H4Learning ObjectivesWater covers about 70 percent of Earth's surface and is critical to supporting life on the planet. However, water can also be a significant hazard to human life and property in certain situations, such as a flood.
Metropolitan State College of Denver - GEG - 1220
Remote SensingFluorescenceFluorescence This is luminescence that occurs where the energy is supplied by electromagnetic radiation, usually ultraviolet light. The energy source kicks an electron of an atom from a lower energy state into an
Metropolitan State College of Denver - DOCS - 20072008
METROPOLITAN STATE COLLEGE of DENVER BOARD OF TRUSTEES Committee on Public-Private Partnerships CRL Associates, Inc. 1625 Broadway, Suite 700 Denver, CO 80203 Monday, July 28 3:00 pm. AGENDA 1. CALL TO ORDER 2. REVIEW OF FINANCING AND NEIGHBORHOOD PL
Metropolitan State College of Denver - DOCS - 20072008
METROPOLITAN STATE COLLEGE of DENVER BOARD OF TRUSTEES Committee on Public-Private Partnerships CN 301 Tuesday, April 29, 2008 9:00 - 11:00 amAGENDA1. CALL TO ORDER 2. Roundtable Discussion: Discussion relating to public private development oppor
East Los Angeles College - SJM - 217
Wordpress 2.5 Cookie Integrity Protection VulnerabilityOriginal release date: 2008-04-25Last revised: 2008-04-25Latest version: http:/www.cl.cam.ac.uk/users/sjm217/advisories/wordpress-cookie-integrity.txtCVE ID: CVE-2008-1930Source: Steven J.
Metropolitan State College of Denver - DOCS - 20062007
Academic and Student Affairs BOT Subcommittee Agenda October 4, 20061. 2. 3. 4. 5. 6. 7. 8. Strategic Plan Update General Studies Update Three Year Policy NCA/HLCA Update Faculty Credentials Review of Current Policy (pros &amp; cons) Follow-Up Report f
Metropolitan State College of Denver - DOCS - 20062007
METROPOLITAN STATE COLLEGE of DENVER Board of Trustees Academic and Student Affairs SubcommitteeWednesday, March 28, 2007 9:00 a.m. 12:00 noon CN 301AGENDAI. II. CALL TO ORDER APPROVAL OF MINUTES A. Approval of January 10, 2007 Academic and Stud
Metropolitan State College of Denver - DOCS - 20032004
FINANCE COMMITTEE TRUSTEES OF THE METROPOLITAN STATE COLLEGE OF DENVER Wednesday, February 4, 2004 6:30 a.m. 8:00 a.m. Tivoli Student Union, Room 320 A-C Auraria CampusI. II.CALL TO ORDER APPROVAL OF MINUTES A. December 1, 2003, Finance Committe
Metropolitan State College of Denver - DOCS - 20052006
FINANCE COMMITTEE TRUSTEES OF THE METROPOLITAN STATE COLLEGE OF DENVER Tuesday, April 25, 2006 2:30 5:00 p.m. AD 575, Administration Building Auraria CampusI. II.CALL TO ORDER APPROVAL OF MINUTES January 26, 2006 Finance Committee MinutesIII.
Metropolitan State College of Denver - DOCS - 20032004
TRUSTEES OF THE METROPOLITAN STATE COLLEGE OF DENVER Wednesday, November 5, 2003 8 a.m. 12 noon Tivoli Student Union, Room 640 Auraria Campus**(The Executive Session will begin at 8:00 a.m. and will last for approximately 1hourat which time the
Metropolitan State College of Denver - DOCS - 20052006
FINANCE COMMITTEE TRUSTEES OF THE METROPOLITAN STATE COLLEGE OF DENVER Thursday, January 26, 2006 6:30 9:00 a.m. Administration Building, Conference Room 575 Auraria CampusI. II.CALL TO ORDER APPROVAL OF MINUTES November 30, 2005 Finance Committ
Metropolitan State College of Denver - DOCS - 20052006
METROPOLITAN STATE COLLEGE of DENVER BOARD OF TRUSTEES Wednesday, June 7, 2006 8 a.m. 12 noon Tivoli Student Union Room 320 Auraria Campus AGENDA I. II. CALL TO ORDER EXECUTIVE SESSION The Board may convene into Executive Session for the purpose of
Metropolitan State College of Denver - DOCS - 20042005
TRUSTEES OF THE METROPOLITAN STATE COLLEGE OF DENVER Wednesday, February 2, 2005 9 a.m. 12 noon Tivoli Student Union Room 320 Auraria Campus AGENDA I. II. CALL TO ORDER APPROVAL OF MINUTES A. Approval of January 12, 2005 Board Meeting Minutes B. App
Metropolitan State College of Denver - DOCS - 20052006
METROPOLITAN STATE COLLEGE of DENVER BOARD OF TRUSTEES Wednesday, May 3, 2006 8 a.m. 12 noon Tivoli Student Union Room 320 Auraria Campus AGENDA I. II. CALL TO ORDER APPROVAL OF MINUTES A. Approval of April 5, 2006, Board Meeting Minutes III. REPORT
Metropolitan State College of Denver - DOCS - 080603
TRUSTEES OF THE METROPOLITAN STATE COLLEGE OF DENVER Wednesday, August 6, 2003 8 a.m. 12 noon Tivoli Student Union, Room 320 Auraria CampusI. CALL TO ORDER II. APPROVAL OF MINUTES A. June 4, 2003, Board Meeting Minutes B. June 16, 2003, Board Meet
Metropolitan State College of Denver - DOCS - 20052006
METROPOLITAN STATE COLLEGE of DENVER BOARD OF TRUSTEESVIA CONFERENCE CALLWednesday, August 3, 2005 8 a.m. 12 noon Central Classroom 301 Auraria Campus AGENDA I. II. CALL TO ORDER APPROVAL OF MINUTES A. June 1, 2005, Board Meeting Minutes B. July
Metropolitan State College of Denver - ORADOC - 817
SQL*PlusGetting StartedRelease 8.1.7 for WindowsSeptember 2000 Part No. A82954-01SQL*Plus Getting Started, Release 8.1.7 for Windows Part No. A82954-01 Copyright 1996, 2000, Oracle Corporation. All rights reserved. Primary Author: Contributo
CSU Fullerton - MUSIC - 100
Music 100 Concert Report FormComplete on typewriter or on your computer using 12-point font. Be sure to check your text before printing. Write birth/death years for all composers on the attached program sheet, if not already printed there, and indic
East Los Angeles College - PW - 321
Single sideband optical signal generation and chromatic dispersion compensation using digital filtersP.M. Watts, V Mikhailov, M. Glick, P. Bayvel . and R.I. KilleyIt is shown that signal processing for single sideband signal generation and electron
Metropolitan State College of Denver - DOCS - 20062007
1METROPOLITAN STATE COLLEGE of DENVER BOARD OF TRUSTEES Wednesday, December 6, 2006 8 a.m. 12 noon Tivoli Student Union Room 320 Auraria Campus AGENDA I. II. CALL TO ORDER APPROVAL OF MINUTES A. Approval of November 1, 2006, Board Meeting Minutes
East Los Angeles College - PW - 321
Performance of Optical Single Sideband Signal Transmission Systems Using Adaptive Electronic Dispersion CompensatorsP.M.Watts (1), V.Mikhailov (1), M. Glick (2), P.Bayvel (1), R.I.Killey (1) 1: Optical Networks Group, Department of Electronic and El