LIBRARY OF THE UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN 5)0.84 ZUr no. 582-587 COD. Z Digitized by the Internet Archive in 2013 http://archive.org/details/guideoexperiment587mura yu> sil UIUCDCS-R-73-587 e^ GUIDE-0 AN EXPERIMENTAL INFORMATION SYSTEM by Shinnichi Murai August, 1973 GUIDE-0 AN EXPERIMENTAL INFORMATION SYSTEM BY SHINNICHI MIIRAI B. Eng. , Kyoto University, 19^3 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the riiversity of Illinois a1 -Champaign, 1973 . [11 j nois Ill ACKNOWLEDGMENT The author wishes to thank Professor Jurg Nievergelt for providing me with the opportunity to work on the project and for many valuable suggestions and encouragements on the work. Thanks are also due to Mr. Dave Eland for suggestions and corrections on the manuscript and Messrs. Jean Pradels and Mateti Prabhaker for discussions on the project. Special thanks go to Mrs. Connie Slovak and June Wingler for the quick and excellent typing and preparation of the paper. IV TABLE OF CONTENTS Page I . INTRODUCTION 1 II. THE FUNCTIONS OF GUIDE -0 3 1. Search for and Display Lessons Which Match a Given Search Prescription 3 1.1 Input (Search Prescription) 3 1.2 Output (Lesson Names and Abstracts) 3 1.3 Notes k 2. Display Lesson Descriptors k- 3. Display Course Outline 6 h. Display Student Record 6 III. THE DATA BASE OF GUIDE-0 7 1 . Le s s on Catalog 7 1.1 Lesson Catalog 1 10 1.2 Lesson Catalog 2 11 1.3 Keyword Table 12 2 . Course Record 13 2 . 1 Course Outline 13 2.2 Student Record Ik 2.3 Student Directory 15 2.k Course Directory 16 3. Implementation of the Data Base 18 3.1 PLATO IV Storage Organization 18 V 3.2 Implementation of the Data Base in Common Storage 20 IV. THE MODULES OF GUIDE -0 22 1. Instruction Decoder and Controllers 22 1.1 Instruction Decoder "idecode" 23 1.2 Controller 1 (Search for Lessons Which Match Search Prescription) "idclsp" 23 1.3 Controller 2 (Display Lesson Descriptors) "idcdld" 26 l.k Controller 3 (Display Course Outline ) "idcdco" 26 1.5 Controller k (Display Student Record ) "idcdsr" 26 2. Lexical Analyzer for Search Prescription ("lexi" ) 31 2.1 General 31 2.2 Input 31 2 . 3 Output 3 a conversational information system, is to help students in selecting PLATO IV lessons to study. This selection is made in an interactive manner, and is based on the student's past activity and performance. The necessity of this kind of system is apparent, considering the rapid growth of the number of students with different back- ground and ability, and also the increasing number of lessons in the PLATO IV system. GUIDE-0 is intended to serve as an experimental system for GUIDE to investigate the formation of search prescriptions, keyword repertoire, data items to be included in the data base, structure of the data base, search algorithms, etc. in the PLATO IV environment. It is also intended to fulfill the practical necessity for GUIDE until it is actually implemented. The capabilities of GUIDE-0 are "reduced" in the following sense: (a) The language for the communication between GUIDE-0 and its users is severely restricted. GUIDE will allow communication by natural language (English), but GUIDE-0 is restricted to its own special language (instructions). (b) No judging function based on each student's past record is included in GUIDE-O. It displays only the information in the data base. For example, students can't ask GUIDE-0 such questions as "What should I study today?". A student is expected to ask GUIDE-0 to display his past record and/or course outline, and to judge by himself what to study. (c) GUIDE-0 is not "clever" enough. It searches the data base based upon exactly the user specified terms. For example, suppose a user asked to search the lessons which deal with "2 -dimensional arrays", and also suppose that not "2-dimensional arrays" but "2 -dimensional array" is included in the keyword repertoire. Then, GUIDE-0 can't search by the plural form. Also, GUIDE-0 won't automatically do the expansion of a search prescription to a broader term, for example, from "2-dimensional array" to "array", although GUIDE-0 suggests users to do so, when it can't find what users asked. (d) The scope of the data base is small, and the structure of the data base is influenced by the scope and current status of the ever expanding PLATO IV system architecture, II. THE FUNCTIONS OF GUIDE -0 1. Search for and Display Lessons Which Match a Given Search Prescription Users are supposed to give GUIDE-0 a search prescription, i.e., a logical expression of keywords which represents their interest. Then GUIDE-0 searches the data base for the lessons which match the given search pre- scription, and displays the names and abstracts of those lessons. 1.1 Input (Search Prescription) The input for this function is a logical expression of keywords followed by a semicolon. The allowed logic operations in the expressions are AND(*), 0R(+) and NOT('). Operators and operands may be separated by blanks, and parantheses (nested to any level) are allowed. For example, suppose that a user wants to study about data structures other than arrays, in any languages other than PL/l and ALGOL. Then the search prescription for him could be as follows : data structure * array' *(pl/l + algol) 1 ; 1.2 Output (Lesson Names and Abstracts) The output of this function is a list of lesson names and abstracts which match the given search prescription. The following is an example: LESSON ABSTPACT racetrack Simulation Experiment somaga Software Management Game to teach Programming montecarlo Area Calculation by Monte Carlo Method 'If the number of lessons to be displayed exceeds the display size, the lessons are paged and the first page is displayed at first. "NEXT" and "BACK" keys are used to turn pages forward or backward. 1.3 Notes Each keyword in the search prescription must be exactly the one listed in the Keyword Table of GUIDE -0. As explained in the introduction, for example, if only the singular form of a keyword is listed and if a user specifies the plural form, GUIDE-0 does not accept the search prescription and tells the user that the keyword is not included in the repertoire. If GUIDE-0 cannot find any lessons which match the search pre- scription given, GUIDE-0 suggests that the user search by a broader term. If there are syntactic errors in a search prescription, GUIDE-0 asks the user to correct it. 2. Display Lesson Descriptors The user is asked to give a lesson name. Then GUIDE-0 searches the data base for the specified lesson, and displays its lesson descriptors. The lesson descriptors consist of the following items: (a) Lesson name — the name of the lesson which is registered in PLATO IV system. (b) Type — the type of the lesson such as "practice", "examination", etc. (c) Abstract - a brief explanation about the contents of the lesson. (d) Subject category — each lesson included in the data base of GUIDE-0 is classified into one or more of the categories listed in Table 1. GEtJEHAL INTRODUCTION 1.0 General 1.1 Programming 1.2 Computers 1.3 Applications PROGRAMMING LANGUAGES 2.0 General 2.1 PL/I 2.2 Fortran 2.3 Basic PROGRAMMING LANGUAGE CONCEPTS 3.1 Introductory 3.11 General Information 3.111 Operating Systems — Hasp, Express 3.112 Compilers — PL/l, PL/C 3.113 Job Control Language 3.12 Overview of a language 3.121 General Program Format — statements, labels, comments, line continuation, character sets, delimiters, separators, use of blanks, punctuation 3.122 Program Structure — sequencing rules, blocks, groups 3.123 Basic Instruction Types -- executable unit 3.124 Identifiers, Keywords, Reserved Words 3.125 Interaction with Operating System and Environment 3.126 Special Conventions, Features 3.127 Illustrative Programs 3.2 Data Types 3.21 Arithmetic -- constants, variables, fixed, float, precision 3.22 Character String 3.23 Bit String 3-24 Pointer 3.25 Labels 3.26 Declarations, Attributes 3.3 Data Operations 3.31 Arithmetic 3.311 Operators 3.312 Assignment Statement 3.313 Expressions 3.314 Initialization 3.315 Built-in Functions 3.32 String 3.321 Operators 3.322 Built-in Functions 3.33 ''omporison 3.331 Operators 3.332 Expressions 3.34 Logical 3.341 Operators 3-342 Expressions J.l| Data Structures 3. 41 Arrays H. 1*2 Hierarchical Structures 3. 43 List 3.5 riato Storage 3.51 Storage Types — static, external, automatic, based, . . . }.%' Dynamic Storage Allocation 3.6 Control Statements 3.61 Unconditional Branch — goto 3.62 Conditional Branch -- computed goto, if, then, else 3-63 Loops, Iteration -- do, while 3.64. Recursion 3.7 Input /Output 3.71 Data formats — (F, E, A, . . . ) 3.72 Printer carriage control — page, line, column 3.73 Types of I/O 3.731 Stream 3.732 Record 3.733 Internal — (get string, put string) 3.8 Subprograms 3.81 Functions 3.811 Built-in — arithmetic, string 3.812 Library 3.813 Programmer Defined — internal, external 3.811* Generic 3.815 Recursive 3.82 Subroutines 3.9 Others 3.91 Interrupts 3.92 Debugging aids 3.93 Compiler Directives, Macros APPLICATIONS 4.0 General 4.1 Natural Sciences 4.2 Engineering 4.3 Social Sciences 4.4 Humanities 4.5 Business Data Processing 4.6 Education TECHNIQUES 5. ,0 General 5 . 1 Numerical Methods 5.10 General 5.11 Error Analysis; Computer Arithmetic 5.12 Function Evaluation 5.13 Interpolation; Functional Approximation 5.14 Linear Algebra 5.15 Nonlinear and Functional Equations 5.16 Numerical Integration and Differentiation 5.17 Differential Equations 5.18 Integral Equations 5. ,2 Combinatorial 5.20 General 5.21 Enumeration 5.22 Sorting 5.23 Searching 5.24 Graphs 5.3 Optimization 5.4 Simulation 5.40 General 5.41 Discrete 5.42 Continuous 5.43 Monte Carlo 5. 5 Heuristic 5.50 General 5.51 Heuristic Search 5. 52 Adaptive Programs 5.53 Pattern Recognition 5< 6 Programming Techniques 5.6l List Processing Table 1. Subject Category (e) Keywords — keywords which represent the contents of the lesson. (f) Time required — the estimated time required to go through the lesson. (g) Relations to other lessons — the relations between lessons such as "prerequisite of the lesson", "sequel to the lesson", etc. 3. Display Course Outline The user specifies the course and section number. Then GUIDE-0 displays the course outline of the specified course. The Course Outline is a list of lesson names with the dates by which each lesson must be taken, the estimated time required to go through the lesson, and the expected performance in the lesson (if it is a "practice", "exercise" or "exam" type lesson) . k. Display Student Record The user specifies the course and section number, his name and his social security number. Then GUIDE-0 displays his record in the specified course. The student record is a list of lesson names with the last date the student took each lesson, the time the student spent on the lesson, and his performances in the lesson (if it is a "practice", "exercise" or "exam" type lesson). III. THE DATA BASE OF GUIDE-0 The data base for GUIDE-0 consists of two parts, the Lesson Catalog and Course Record, each of which consists of several files. The Lesson Catalog contains the information related to lessons such as the abstracts of the lessons, the keywords attached to the lessons, etc. and is mainly used for functions 1. and 2. of the preceding chapter. The Course Record contains the information related to course activity such as course outlines, each student's performance in each lesson, etc. and is used for functions 3* an( i k. The Lesson Catalog consists of three files: Lesson Catalog 1, Lesson Catalog 2 and Keyword Table. The Course Record consists of four files: Course Directory, Course Outline, Student Directory and Student Records. All of these files are stored in the "common" storage provided by PLATO IV [k]. Figures 3.1 and 3.2 illustrate the structure of the Lesson Catalog and Course Record. 1« Lesson Catalog The Lesson Catalog provides the information necessary to know what a lesson is about, or to retrieve the lessons which are supposed to be related to a user's interest. The Lesson Catalog consists of three files: Lesson Catalog 1, Lesson Catalog 2 and Keyword Table. The first two are related to what a lesson is about, and the last is used for retrieval purposes. The difference between Lesson Catalog 1 and Lesson Catalog 2 is as follows: (a) Lesson Catalog 2 is sorted by lesson name, thus allowing a binary search by lesson name; on the O H o< P o5 O o co co ra -p ^ 1 s P> •H -H" *r ra ra -d . p ^H , •H O • rQ ^ OJ co cu w M W t- o ra t>> o Sh -P rH m 03 o o rH ^ cu bO CJ ■n 0) O P -P oo _=r 2 a5 OJ M CO O LT\ OJ d o ^ -p a) S o rH in crj ■ CO w -p rH c 0) P ,Q p> o S o a? cd tH >> !H p r° 05 w rC! rQ £ o o H cO O cvj CU 3 o H co a M rH O CU CO 05 CO S o ^ w 3 OJ o cu S p i-q c o o H s A ^ d O CO d O 5 "> d rH O ra d ?H o OJ bO O rH cd P> aJ O £ o ra ra 3 "N ra o fl p> o CO co ra a o i-J •H P ?h 05 rH ^d a) ■p « o d CD cu rH s •H •H 2 H en CI) K n S a o ra ra cu CI) h-l d £h o ra d o d ?h o Is OJ J J ra P> H 0J oo •H P> ■p -p VD w p> _rr H t~- ■H rH rH O H rH 05 ra 05 P 1 U O 05 05 ra 0) d ^ CD +3 O rH fl H •H o rH O HH S Ph i — 1 ra d o OJ a o w co 0) hH Ch Ctf rH P CJ U P CO CD H •H 0> P c -a •H 3 O P On CO & ■d 3 p p 11 c co B V •H O. Eh CO & s y 3' 43 SO r- f- r- O P 8 \ N 4) OS a- w 3 PS & 43 10 other hand, Lesson Catalog 1 is sorted by lesson number. (Actually no sorting operation is done on Lesson Catalog 1. The location of a lesson in Lesson Catalog 1 is the lesson number of the lesson. ) (b) Lesson Catalog 2 contains different information about the same lessons which are stored in Lesson Catalog 1. At the current implementation, the information for up to 60 lessons can be stored in the Lesson Catalogs and up to 256 keywords can be stored in the Keyword Table. Figure ^>.l illustrates the structure of the Lesson Catalog. 1.1 Lesson Catalog 1 Lesson Catalog 1 consists of the following four fields: (a) Lesson Name (lessonml) --10 characters This field contains the lesson name of maximum 10 characters. (b) Abstract (abstrct) -- 62 characters This field contains the very brief explanation of the lesson of maximum 62 characters. (c) Subject Category -- 2xk characters This field contains up to two codes each of which consists of k digits (characters) and represents the category of the lesson. Originally, Lesson Catalog 2 was intended to provide only an index to Lesson Catalog 1. However, since the unit of information processing in the PLATO IV system (in the TUTOR language) is basically a word (not a character or a byte) and the available storage area is severely restricted, it was decided to store a part of the information about lessons into the area of Lesson Catalog 2 which would otherwise be wasted [k, 5]. 11 (d) Keyword — 7x8 bits This field contains up to seven keyword identity codes (the location of the keyword in Keyword Table) of 8 bits. Thus a maximum of 8 keywords can be attached to each lesson. Thus Lesson Catalog 1 consumes 9 words of memory per lesson, i.e., 640 words are necessary for 60 lessons. 1.2 Lesson Catalog 2 Lesson Catalog 2 consists of the following five fields: (a) Lesson Name (lessnm2) -- 10 characters This field contains the lesson name of up to 10 characters. (b) Lesson Number (glessnn) -- 6 bits This field contains the location of the lesson in Lesson Catalog 1 (the lesson number). (c) Time Required (gtime) -- 6 bits This field contains the average time required to finish the lesson. (d) Relations to Other Lessons -- 4x(^+6) bits This field contains up to k relation identity codes of k bits each of which is followed by the lesson number (6 bits) of the lesson which has the relationship specified by the relation identity code with the lesson specified in the Lesson Name field. For example, if the lesson has two prerequisites 12 and 13, and one sequel Ik; the Relation field should look like 12 P 12 P, 13 P Ik 000... O ^ O w^ ^ ^ ^-^-^ 1]- "bits 6 bits 10 "bits where p , p are the relation identity codes for "prerequisite" and "sequel" respectively, and 11, 12, 13 doce lesson numbers, (e) Type (gtype) -- k hits This field contains the lesson type identity code of k hits. Lesson Catalog 2 consumes 2 words per lesson, thus 120 words per 60 lessons. 1. 3 Keyword Table The Keyword Tahle consists of the following two fields: (a) Keyword (keyword) --20 characters This field contains a keyword (or phrase) of up to 20 characters. (h) Retrieval Code (retcode) -- 60 hits This field contains a retrieval code of 60 hits which is attached to the keyword specified in the Keyword field. Each hit of a retrieval code represents a lesson and the hit position corresponds to the lesson number. For example, consider the following case: Keyword Retrieval Code program flow control ' 00100001100 This indicates that the keyword "program flow control" is attached to three lessons, the lesson numbers of which are 3> 8 an( 3- 9 respectively. Thus if the user specifies the keywords which represent 13 his interest, then the G-UIDE-0 program searches the Keyword Table, obtains the retrieval codes, and gives the necessary information (lesson names and abstracts) about the lessons which appear in the retrieval codes. The Keyword Table is sorted alphabetically by keywords, allowing a binary search for a given keyword. The Keyword Table consumes 3 words of memory per keyword, thus 768 words per 256 keywords. 2. Course Record The Course Record provides students and instructors the information such as course outlines, students' performances in some lessons, the date when students took lessons, etc. The Course Record consists of the following four files : (a) Course Directory, (b) Course Outline (c) Student Directory, (d) Student Record. The Course Directory contains the pointers to course outlines and to student directories, and some other administrative information. The Course Outline contains course outlines (the schedule of lessons to be taken in each course). The Student Directory contains lists of students enrolled in the courses and pointers to each student's own record. The Student Record contains students' records such as performance in lessons, time spent in lessons, etc. 2.1 Course Outline The Course Outline is the schedule of lessons which are to be taken by students who are enrolled in the course. It consists of the following five fields: Ik (a) Lesson Number --6 bits This field contains a lesson number (the location of the lesson in Lesson Catalog l). (b) Time Required -- 6 bits This field contains the average time or the maximum time to finish the lesson specified in the Lesson Number field. (c) Performance Expected --32 bits This field contains the performance expected of the lesson specified in the Lesson Number field. (d) Date -- 16 bits This field contains the date by which students are expected to finish the lesson specified in the Lesson Number field. The first 7 bits contain the year, the next k bits the month, and the last 5 bits the day. Thus, the Course Outline occupies 2 words of memory per lesson. 2.2 Student Record The Student Record stores the various student records such as the performance in a lesson, the last date the student took the lesson, etc. for all students who are enrolled in the courses listed in Course Directory. The Student Record has exactly the same format as the Course Outline, consisting of the following k- fields: (a) , Lesson Number -- 6 bits This field contains a lesson number (the location of the lesson in Lesson Catalog l). (b) Time Spent — 6 bits This field contains the time spent by a student to finish the lesson specified in the Lesson Number field. 15 (c) Records — J2 bits This field contains coded records of the student's performance in the lesson specified in the Lesson Number field. (d) Date -- 16 bits This field contains the last date the student took the lesson specified in the Lesson Number field. The Student Records occupy 2 words of memory per lesson (same as Course Outline ) . 2.3 Student Directory The Student Directory contains lists of students who are enrolled in the courses listed in the Course Directory, and the pointers to each student's student record. Each course has its own student directory and is sorted by the social security number of the students who are enrolled in the course. If the same student takes two different courses, his name appears twice in two student directories. The Student Directory consists of the following three fields : (a) Social Security Number -- 9+1 digits (characters) This field contains the social security number of a student as a character string of 9 digits (characters) +1 blank character. (b) Student Name -- 17 characters This field contains a student's name of up to 17 characters. (c) Pointer to Student Record — 18 bits This field contains a pointer to the student record of the student specified in Social Security Number and 16 Student Name field. The logical location or array subscript, not the physical address, is meant "by "pointer". Thus, the Student Directory occupies 3 words of memory per student. 2. If. Course Directory The Course Directory contains various administrative data, consisting of the following eight fields: (a) Course and Section Number (coursen) — 10 characters This field contains course and section number (e.g. cslOlel, mathl05al, etc.). (b) Security Code (seccode) -- 10 characters This field contains security code of up to 10 characters, which protects the privacy of student records. (c) Pointer to Course Outline (pcoutln) -- 12 bits This field contains a pointer to the course outline of the course specified by Course and Section Number field. The logical location or array subscript, not the physical address, is meant by "pointer". (d) Length of Course Outline (lcoutln) -- 6 bits This field contains the length of the course outline, i.e., the number of lessons contained in the course outline for the course specified in Course and Section Number field. 17 (e) Length of Student Records (lsrecrd) -- 6 bits This field contains the length of student records, i.e., the maximum number of lessons to be recorded in each student record. The number contained in this field should be equal to or greater than that of Length of Course Outline. If both numbers are equal, only the lessons listed in the Course Outline are recorded in the Student Record. (f ) Pointer to Student Directory -- 18 bits This field contains a pointer to the student directory of the course specified in Course and Section Number field. (g) Length of the Student Directory -- 9 bits This field contains the length of the student directory of the course specified in Course and Section Number field, i.e., the maximum number of students to be enrolled in the course. Note that this number is used to reserve a space for the student directory at the beginning of a semester. No more students than this number can be registered in the course under the current version of the GUIDE-0 editor, (h) Number of Students -- 9 bits This field contains the current number of students who are registered in the course specified in Course and Section Number field. Thus, the Course Directory occupies J words of memory per course. 18 3. Implementation of the Data Base 3.1 PLATO IV Storage Organization [k, 5] The Storage hierarchy of the PLATO IV system consists of three levels (see Figure 3«3) (a) Central Memory (CM), (h) Extended Core Storage (ECS), (c) Disk. Central Memory is used for the lesson which is currently "being executed "by the CPU, and so the contents of central memory stays the same only within a single time slice. Extended Core Storage is used to store the lessons which are being "taken" by students currently sitting at a terminal. For example, if 20 students are taking 5 different lessens, those 5 lessons are stored in ECS at the same time. The Disk is used as a permanent storage device for all lessons in the PLATO IV system. Each lesson in PLATO IV has access to two kinds of variables, "student variables" and "common variables". A set of 150 student variables is attached to each student and is stored in disk. A set of maximum I4-I86 common variables is attached to a lesson (if necessary) and is also stored in disk. Whenever a lesson is condensed, the student variables attached to the student who is going to use the lesson, and the common variables attached to the lesson being condensed are transferred into ECS from disk. When a time slice is given to a student by the system program of PLATO IV, the lesson the student is working on, the student variables of the student, and in case of automatic loading mode the first 1500 out of lj.186 common variables attached to the lesson (if any) are loaded into the central memory. In case of non-automatic loading mode, the loading of up to 1500 common variables is specified by the instruction in a lesson. In this case you can specify 19 CO o p -p 1 c ra (D cO £ tj o £ CO ra S H o P ra cd T3 ra •H 0) CD ^ P H 05 Pi t> o w > H H H ■P cd cd PI h ?H 0.) 0) m a) > £ ra ra o p -p +2 c C c cd CD 1 CD T) ■o rtf 1 2 3 1 2 ! P p ■ P 1 CO co , CO | CD -p w CD H ■8 •H d c0 to CI ra w CD H CD P i ra cO w > H O EH O f CD •H w O P CO CD h 20 which part of 1+186 common variables to load. In other words, even though 150 student variables and eventually i|186 common variables can be accessed by a lesson, only 150 student variables and 1500 common variables can be accessed at the same time. 3.2 Implementation of the Data Base in Common Storage The data base of GUIDE-0 is implemented in common storage area. Since the amount of storage area which is available as "common" storage is limited to If 186 words as explained above, the maximum number of items of each file is limited as shown in Table 2. This would be acceptable considering the experimental nature of GUIDE-0. The amount of storage used and the location of each file are also shown in Table 2. 21 I H M O H a} -P aj O OJ P a5 O o o w I w 31 3 g -d U O o o o o H l^ OS OJ ' H H H » i , . — ; i ! & o « O (U +3 tJ . -P PI o fc , o n u o a) h o h p •H a> rd fl n « ; fi o p i£ ' 0) tH c «H o 0) cd o ■ £g a a CD EH pq ci) « <; CO ^ j / i 1 i ^^ II I i '■ _ ~ CJ o U 8 c3 0) H •H CD cd &h -p S?H ■P N « O cd cd t>j c3 a) o ra O -P H CO -p C cd CO H 3 cd CD CJ CO 1 i i i 1 d d * o ■V T3 CD 1 ' t • i ^ H H £3 CJ £i 0) CO O H |d c o O -H CJ -P O Cm O o F«4 «« OJ -d- >s a) M £h ?H 43 CO O CO o W -p •H CD CO -H a) t3 pq a> S W CO 1 1 J 1 1 ' ' 1 * OJ ra D ■H &4 !h 0) H H O O o O o H ?! M •H C ENTRY ; 29 Input Course & Section # 1 / Search \ Course Directory Input Student's Name & SS # / Search \ \ Student Directory / _i / Edit & Display \ \ Output Message / i EXIT ^ v j Figure 4.8 Flow of Controller if 30 & o W -p O !h O -H n i H a3 *h •H CD P ,£ Pi o CD ?H pi 03 CT 1 CD > CD M £1 o3 o Pi fH •H Ctf pq cd CO -=J- CD H H O ^ ,- P tH O Pi o o Pi o O P h j I ra CD H & Pi CD CD £ P CD rQ ft •H si w § •H -P o3 H CD m H n3 P o pi in P CO -=t- CD bD 31 for the specified course and section, and returns the "logical" location of the course and section in the Course Directory. Then Controller h receives the student's name and social security number and joins the Binary Search module. The Binary Search module searches the specified (by PSDIRCT and NSTUDNT fields of the Course Directory) portion of the Student Directory for the specified social security number and returns the "logical" location of that number in the Student Directory. Next, Controller k- joins Message Editor h-. Message Editor h- generates the part of display image -which is unique to the student record, obtains the location and length of the student record in Student Record from the Student Directory and Course Directory (PSRECRD and NLSREC ) and joins the Subeditor which is shared with Message Editor 3* The Subeditor reads the specified portion of the Student Record and Lesson Catalog 1, and generates the rest of the display image. 2. Lexical Analyzer for Search Prescription ("lexi") 2.1 General The Lexical Analyzer is joined by the Syntax Analyzer to get from the search prescription the next token to be analyzed. 2.2 Input The input is a search prescription (explained in II.l.l) which is stored in the array "sprescr(l)" ~ "sprescr(lwnpres)" . If the search pre- scription consists of less than 11 characters, then it occupies only the first word of the array, i.e., sprescr(l). If it consists of 11 ~ 20 characters, then it occupies the first two words of the array "sprescr(l)" and "sprescr(2)"; and so on. 32 2.3 Output The output is a number stored in "crtoken" which designates one of the operators +, *, ' , (, ) and ;, if the number is positive, or the "logical" location of the operand (search word) in the search word table "searchw(l)" ~ "searchw(lwschw/2) n , if the number is negative (Table 3)« The search word table is an array each element of which consists of 2 words (= 20 characters). Thus the maximum length of a search word (a keyword) is 20 characters. 2.k Functional Description The Lexical Analyzer ("lexi") examines a search prescription stored in "sprescr(wnspres)" one character at a time, "lexi" has k- states as shown in Figure ^.10. The operation depends on both the state and the current symbol (character) stored in "tcursym". (a) State (ready to get a new token) If the current symbol in "tcursym" is one of the operators (+, *, ', ( f ) or ; ), then "lexi" stores the code of the operator shown in Table 3> into "crtoken" and returns to the Syntax Analyzer. If the current symbol is a blank, "lexi" ignores it. If the current symbol is an upper case shift code, "lexi" goes to the State 1. If the current symbol is any other character, the symbol is assumed to be the first character of the new operand (search word or keyword), is stored into the first character position of the new location in the search word table ("searchw(wpsw)"), and goes to State 2. cr token MEANING h < 1 The location of an operand (keyword) The operator + (OR) 33 +- The operator * (AND) The operator ' (NOT) —4 - The operator ; The operator ( The operator ) Table 3. Code of Token upper case shift code others others Figure Ij-.IO State Diagram of Lexical Analyzer 3^ (b) State 1 (upper case character from State 0) If the current symbol is ', then "lexi" stores 3 into "crtoken", goes to State 0, and returns to Syntax Analyzer. Otherwise, the symbol is assumed to be the first character of the new operand, is stored into the first character position of the new location in the search word table, and goes to State 2. (c) State 2 (getting an operand) If the current symbol is one of the operators, "lexi" backs up one character position in the search prescription so that the current symbol appears again as the next symbol, negates the current location in the search word table and stores it into "crtoken", goes back to State 0, and returns to the Syntax Analyzer. If the current symbol is the upper case shift code, "lexi" goes to State 3- Other wise, the current symbol is assumed to be a character of the current operand, and is stored into the current character position of the current location in the search word table. (d) State 3 (upper case from State 2) If the current symbol is ', "lexi" backs up one character position in the search prescription so 35 that ' appears again as the next symbol, negates the current location in the search word table and stores it into "crtoken", goes to State 1, and returns to the Syntax Analyzer. Otherwise, "lexi" assumes the current symbol is a character of the current operand, stores it into the current character position of the current location in the search word table, and goes back to State 2. 3. Syntax and Semantics Analyzer of Search Prescription ("parser") 3.1 General The Syntax and Semantics Analyzer ("parser") analyzes a search prescription according to the simple operator precedence grammar [6] described below, and outputs the result in the form of Polish postfix notation. 3.^ The Grammar of the Search Prescription = ; = + | = * | = ' = () 3*3 Precedence Relations Between Operators The meaning of the symbol in Table k is as follows R > S -- R has precedence over S R = S — R and S have the same precedence R < S -- S has precedence over R The numbers 2, 3, •••, 9 indicate no relations. 36 + -x- t 5 ( ) i + > < < > < > < * > > < > < > < t •> > > > 2 > 3 5 < < < = < h < ( < < < 5 < = < ) > > > > 6 > 7 i > > > > 8 > 9 Table k. Precedence Matrix 3 . k Input The input to "parser" is a sequence of tokens extracted from a search prescription by "lexi" as described in the preceding section. 3 . 5 Output The output of "parser" is a search prescription transformed into Polish postfix notation. This is stored in the array "postfix(l)" ~ "post fix (lpstfix)" . Each element of the array contains either an operator or an operand. Operators are encoded as shown in Table 3* Operands in the postfix notation are the "logical" locations of the operands in the search word table. 3.6 Functional Description The main frame of the "parser" consists of the following (a) Precedence Matrix "precdnc(l)" ~ "precdnc(ij-9)" (b) The current token "crtoken" (c) Unreduced tokens in the syntax stack "pstack(l)" ~ "pstack(lpstack)" 37 (d) The parsed result in "postfix(l)" ~ "postfix(lpstfix)". "parser" first joins the "lexi" and gets the current token. If the current token in "crtoken" is an operand, the contents in "crtoken" is saved in "crident" and the code designating identifier is assigned into "crtoken". If the current token is an operator, no operation is done in this stage. Next, the precedence is examined between the top-most operator in the syntax stack "pstack(j)" and the current token in "crtoken". If the operator in the stack has the precedence over the current token, "parser" keeps examining the precedence between the next top-most operator and the current token until it finds the head of the prime phrase to be reduced, and reduces the prime phrase according to the grammar described in 3«^> producing the postfix notation appropriately. If the operator in the stack does not have the precedence over the current token, the contents in "crtoken" is stored at the top of the syntax stack "pstack(i)" . "parser" repeats these operations until it encounters ;. In the precedence matrix "prednc(l)" ~ "pre dnc (14-9)", -1 denotes <, denotes =, and 1 denotes >. Other numbers denote that no relation exists between the two operators. k. Search Range Vector Calculator "calcsrv" k.l Search Range Vector The Search Range Vector is a bit-string which represents a set of lessons. Each bit of the string corresponds to a lesson in the data base. In the current implementation of GUIDE -0, the Search Range Vector consists of 60 bits representing 60 lessons. For example, the following search range vector 01100010 010 v ^ ; 60-bit 38 represents the lessons #2, jfe, #7 and #59» Lesson #2. means the lesson whose lesson number, i.e., the "logical" address of the lesson in Lesson Catalog 1, is 2. 4.2 Basic Function of "calcsrv" The Search Range Vector Calculator "calcsrv" evaluates an expression which represents a search prescription in the form of Polish postfix notation (this expression is generated by the Parser). The result is expressed in the form of a search range vector, and is given to Message Editor 1. 4.3 Input The input to "calcsrv" is a logical expression which represents a search prescription in the form of Polish postfix notation. The expression is generated by the Parser and is stored in the array "postfix(pointps)". See IV.3-5 for more detail. 4 . 4 Output The output of "calcsrv" is a search range vector stored in an element of the array "tsrange(l)" ~ "tsrange(ltsrnge)". The location of the element where the search range vector is stored is given by "pstack(l)". 4.5 Functional Description of "calcsrv" The Search Range Vector Calculator "calcsrv" is basically a conventional postfix expression interpreter, "calcsrv" scans the "postfix(pointps)" . If it encounters an operand, it stores the operand into the stack "pstack(j)"- If it encounters an operator, it executes the operation specified by the operator on the relevant operands which have been stored on the top locations of the stack "pstack", and then stores the result on the top of the stack. 39 There are two kinds of operands : one is a keyword stored in the search word table "searchw(l)" ~ "searchw(lwpsw)", and the other is a search range vector stored in the search range vector table "tsrange(l)" ~ "tsrange(ltsrnge)". In the "pstack", a keyword is represented by the negated "logical" address of the keyword in the search word table "searchw", while a search range vector is represented by the negated "logical" address of the search range vector in the search range vector table "tsrange" minus "lwpsw" where "lwpsw" is the maximum number of keywords which can be stored in the search word table "searchw(l)" ~ "searchw(lwpsw)". Thus if - lwpsw < pstack(j) < - 1, then pstack(j') represents a keyword which is stored in "searchw(-pstack( j ) )", while if pstack(j) < - lwpsw, then pstack(j) represents a search range vector which is stored in "tsrange(-pstack(j )-lwpsw)" . Thus, before the operation is executed on the operands, the operands have to be checked to see whether they are keywords or search range vectors. If the current operand is a keyword, i.e., - lwpsw < pstack(j) < - 1, then the operand first has to be transformed to the corresponding search range vector. The search range vector for a keyword is given by the retrieval code attached to the keyword. Thus, if the operand is a keyword, "calcsrv" searches the keyword table for the keyword and obtains the retrieval code attached to it. After all the operands relevant to the operation are transformed to search range vectors, the operation (AND, OR, NOT) is executed bit by bit on the operands (which are search range vectors). The result of the ko operation (which may "be the operand of a further operation) is stored into the search range vector table "tsrange(q)". The location "q" of the result (actually -q-lwpsw) is stored on the top of the stack "pstack(j)". Thus the final result of the calculation is put in the search range vector table "tsrange(-pstack(l)-lwpsw)" in the form of a search range vector which represents a set of lessons which match the given search prescription. The location of the final result in the search range vector is given by -pstack(l)-lwpsw. 5. Sequential Search Module "ssearch" 5.1 General The Sequential Search Module "ssearch" is a general subroutine which searches specified locations of the common storage area in PIATO IV for a specified keyword of the specified length, and returns the "logical" address of the keyword. 5.2 Input (Parameters) (a) "sdb" -- Start address of the file The starting address of the file in the "common" storage area which is to be loaded and searched. (b) "nwload" -- Physical length of the file The number of physical words to be loaded and searched. (c) "flength" — Logical length of the file The number of items in the file to be loaded and searched. (d) "scorn" — Start address of common variable The starting address of the common variables into which the file is loaded. (e) "key(l)" ~ "key(2)" — Keyword The keyword to be searched for (up to 20 characters). The keywords of less than 20 characters are left aligned in "key(l)" and "key(2)". (f) "kylengt" — Length of keyword The number of characters in the keyword. (g) "subscrp" — Expression The expression to calculate the physical address of the specific field which is to be searched within the common variables. For example, suppose that a file, each element (item) of which consists of three physical words, is loaded into the common variables ncl26 ~ ncl85 (therefore, "scorn" = 126, "nwload" = 185- (126-1) = 60, "f length" = "nwload"/3 = 60/3 =20). Furthermore, suppose that the field to be searched is the second word of each item. Then the expression should be 3*(nl2-l) +126+1 = 3*nl2+12^ where nl2(=i) contains the logical address of the items of the file. In other words, the expression maps the logical address (l, 2, 3, •••> 20) into the physical address (127, 130, 133, •••, 18*0 • (h) "count" — Character count The number of characters in the above expression. 5 • 3 Output The output is the logical address, i, of the searched item in the file. If not found, a value of is returned. '42 5.4 Functional Description The specified file (by "sdb" and "nwload") is loaded into the specified common variables (by "scorn"). Then the specified field (by "subscrp" and "kylengt") is searched for the keyword stored in "key(l)" and "key(2)" all through the file sequentially. If an item whose field matches the keyword is found, the logical address i of the item is returned. If not found, a value of is returned. 6. Binary Search Module "b search" 6.1 General The Binary Search Module "b search" is a general subroutine which searches the specified fields of the specified locations of the common storage area for a specified keyword of the specified length, and returns the "logical" address of the item whose specified field matches the keyword. If an item which matches the keyword cannot be found, a "would-be-address" is returned in negative form. The items are supposed to be sorted lexicographically by the specified field in order that the binary search[7] can be executed. 6.2 Input (Parameters) In addition to the input to the Sequential Search Module "s search", the following input is necessary: "bsmask" — Mask pattern for the keyword The mask pattern for the last "physical" word of the keyword. For example, if the keyword consists of 17 characters, the first 10 characters are contained in KEY(l) and the last 7 characters are contained in KEY(2). Thus, the "bsmask" should contain 0077777777 777777 ,0000, 2x7 k3 I.e., the 6-bit right shifted mask pattern for 7 characters. If the keyword consists of 6 characters, "bsmask" would be OO777777777777 000000. 2x6 6.3 Output The output is the logical address, i, of the searched item in the file whose specified field matches the keyword. If the item matching the keyword is not found, the "would-be-address" of the searched item in the file is returned in the negative form. 6.k Functional Description The specified (by "sdb" and "nwload") file is loaded into the specified (by "scom" and "nwload") common variables. The starting address for the binary search is calculated by "f length". Then the specified (by "subscrp", "kylengt" and "bsmask") field of the address is compared with the keyword. The unit of comparison is a maximum of 9 characters. For example, if the keyword consists of l6 characters, the first 9 characters are compared first. If matching occurs, then the next 7 characters are compared. The comparison is numerical in order to tell the next search location (forward or backward). This is the reason why the unit of comparison is not 10 characters (full word) but 9 characters and operands are right-shifted in order to avoid a possible negative value. If the item whose field matches the keyword is found, the "logical" address i of the item is returned. If not found, the negated "would-be-address" is returned as the value of i. 7- Message Editors Message Editors consist of 5 separate modules: (a) Message Editor 1 "edtlsp" (b) Message Editor 2 "edtdld" (c) Message Editor 3 "edtdco" (d) Message Editor k "edtdsr" (e) Subeditor "edtdata" The first four correspond to the four functions of GUTDE-0 while the last is a common subroutine for Message Editor 3 and k. 7.1 Message Editor 1 "edtlsp" Message Editor 1 "edtlsp" is the output message editor for the function 1 (display lessons which match search prescription). First it displays the headings on the top of the screen. Then it obtains the final result (search range vector) of the calculation done by "calcsrv", and displays the lesson names and abstracts of the lessons which are represented by the search range vector. Note that each bit of a search range vector- corresponds to a lesson and the bit position shows the lesson number, i.e., the "logical" address of the lesson in Lesson Catalog 1. Thus, "edtlsp" scans the search range vector, detecting the bit positions which contain l's, and displays the lesson name and abstract fields of the corresponding lessons in Lesson Catalog 1. If the number of lessons represented by the vector exceeds the number which can be displayed at one time on the screen, the lessons are paged and the control of turning pages are done by NEXT and BACK key. If the search range vector represents a null set, the editor displays a message which suggests that the user broadens the search, range. An example of the output is shown in Figure k.ll. 7.2 Message Editor 2 "edtdld" Message Editor 2 "edtdld" is the output message editor for function 2 (display lesson descriptors). As explained in IV. 1. 3, the Binary Search module obtains the "logical" address of the specified lesson h5 LESSON ABSTRACT racetrack Simulation Experiment somaga Software Management Game to Teach Programming montecarlo Area Calculation by Monte Carlo Method Figure ^.11 Output Format for the Function 1 > 4 6 in Lesson Catalog 2. Then "edtdld" gets the lesson number of the lesson, i.e., the "logical" address of the lesson in Lesson Catalog 1, from the lesson number field "glesnn" in Lesson Catalog 2. Now since "edtdld" knows both "logical" addresses of the lesson in Lesson Catalog 1 and 2, it displays the necessary fields of the lesson in Lesson Catalog 1 and 2 with the corresponding titles. An example of the output is shown in Figure k.12. 7.3 Message Editor 3 "edtdco" Message Editor 3 "edtdco" is the output message editor for function 3 (display course outline). Since the file structures of the Course Outline and the Student Record are identical and also the output message formats for the function 3 and ^ are essentially the same, Message Editor 3 and Message Editor k use the common subroutine Subeditor "edtdata" for displaying the data in the Course Outline and the Student Record. "edtdco" displays the headings which are unique to function 3« Then it obtains the "logical" pointer and the "logical" length of the course outline of the specified course from the Course Directory. After this, it calculates the starting "physical" address and the "physical" length of the course outline to be loaded. Note that the "logical" address of the course in the Course Directory is given by the Sequential Search module. Then the Subeditor "edtdata" is joined to display the data in the Course Outline . An example of the output is shown in Figure k.l'ji. 7.4 Message Editor k "edtdsr" Message Editor k "edtdsr" is the output message editor for function k (display student record). Like "edtdco", it first displays the 1*7 LESSON NAME: plldo Type: exercise ABSTRACT: Introduction to PL/l DO- statement CATEGORY: 2.1 , 3.63 KEYWORDS: iteration flow of control pl/1 TIME REQUIRED: 1*0 min. PREREQUISITES: plldata pllio pllarray SEQUELS : pllif Beginning Computer Science Lessons PL/l Input /Output Introduction to PL/l Arrays PL/l IF-THEN-ELSE Statements Figure 4.12 Output Format for the Function 2 kQ LESSON TYPE racetrack game plldata exercise pllops exercise pllarray exercise plldo exercise exam exam pllif exercise PERFORM EXPCTD TO 70 65 TO TO 65 TIME KEQKD 20 min. ^-0 min. kO min. k-0 min. ^0 min. 50 min. 60 min. DATE 9/10/T3 9/15/73 9/25/73 10/10/73 10/20/73 10/25/73 11/5/73 Figure h.l$ Output Format for the Function 3 k9 headings which are unique to function k, and then calculates the "physical" address and length of the student record which is to be displyaed. The "physical" address is deduced from the "logical" pointer to the student record, which is obtained from the "psrecrd" field of the Student Directory. The "physical" length comes from the "logical" length of the student record given by Controller k. Then it joins the Subeditor "edtdata" to display the data in the student record. An example of the output is shown in Figure !j..11j.. 7.5 Subeditor "edtdata" Subeditor "edtdata" is the common subroutine which is used by both the Editor 3 and k- to display the data stored in the Course Outline or the Student Record, "edtdata" first loads the specified part of the Course Outline or the Student Record and the Lesson Catalog 1. Note that both files have the identical file structure. Then "edtdata" displays the data in every field of the Course Outline or the Student Record except for the lesson number field. The lesson number is used to obtain the lesson name from Lesson Catalog 1. 8. Miscellaneous Modules The following modules are usually deactivated and should be activated only for very special occasions such as the change of the specification of GUIDE-0 itself or the introduction of the new modules to GUIDE-0 system. 8.1 "inprecd" — Initialize the Precedence Matrix This module is used to initialize the precedence matrix "prednc(l)" ~ "prednc(^9) M for the "parser". The numbers and their meanings are as follows on page 51- 50 LESSON TYPE PERFORMANCE TIME SPENT DATE racetrack game 30 min. 9/5/73 plldata exercise 85 k-0 min. 9/10/73 pllops exercise 65 30 min. 9/22/73 pllarray exercise 80 55 min. 10/7/73 plldo exercise min. // exam exam min. // pllif exercise min. // Figure ^-.1^ Output Format for the Function k 51 -1 -- < — = 1 — > 9 — no relation 8.2 Setting the Experimental Data into the Data Base The module names and their corresponding file names are listed in Table 5. MODULE i 1 ! FILE debugl Lesson Catalog 2 debug3 Keyword Table debug6 i Course Directory- debug7 Student Directory dbgclgl Lesson Catalog 1 dbgsco Course Outline dbgssr Student Record Table 5. Data Base Initialization Modules 8.3 Displaying the Variables for Debugging Purpose (a) "debug2" Displays the keyword stored in the Search Word Table. Used as a subroutine for "debugV. (b) "debugl!" Displays the contents of the Postfix and the Search Word Table by using "debugs" and "debug2". Used in Controller 1. 52 (c) "debugs" Displays the contents of the Postfix. Used as a subroutine for debug^. (d) "debug5" Displays the search range vector in the Search Range Vector Table. Used in Controller 1. 53 V. FUNCTIONAL SPECIFICATION OF THE DATA BASE EDITOR GUIDE-0 File Editor consists of two parts, Lesson Catalog Editor and Course Record Editor, corresponding to the structure of the files of GUIDE-0 explained in the previous chapter. In the following specification the necessary functions are listed in somewhat random fashion. These functions may he divided into sub functions or be synthesized into more comprehensive functions to achieve the effective maintenance of the GUIDE-0 files. 1. Lesson Catalog Editor 1.1 Addition of a New Lesson Name into Lesson Catalog (a) Insert a new lesson name at the first available location in Lesson Catalog 1. (b) Clear the corresponding Subject Category and Keyword fields in Lesson Catalog 1. (c) Insert the new lesson name into Lesson Catalog 2 in such a way that the resultant Lesson Catalog 2 is sorted lexicographically by lesson names. (d) Set the corresponding "Lesson Number" field in Lesson Catalog 2 to the lesson number of the new lesson (this is the pointer to the new lesson in Lesson Catalog 1 or the "logical" location of the new lesson Lesson Catalog 1, -X- If the field to be "cleared" is a character string, "clear" means to store "blank" characters (octal 55) into the field. Otherwise "clear" means to set the field to 0. I.e., the lesson number is an integer between 1 and 60 ) . (e) Clear the corresponding "Time Required", "Relation to Other Lessons" and "Type" fields. 1.2 Replacement of Abstract Replace an abstract in the Abstract field of Lesson Catalog 1 of the lesson specified, (by lesson name). 1.3 Addition of a Subject Category Code Add a subject category code into the Subject Category field of the specified lesson, if the field is not full. l.k Deletion of a Subject Category Code Delete a specified subject category code in the Subject Category field of the specified lesson. "Delete" means to change the specified code into blank characters. 1.5 Replacement of a Subject Category Code Replace the specified subject category code of the specified lesson with the specified subject category code (the combination of 1.3 and l.h). 1.6 Addition of a Keyword (a) Test whether or not the space is available for the addition of the specified keyword in the Keyword Field of the specified lesson in Lesson Catalog 1. If not available, no operation. 55 (b) If the space is available in Keyword field in Lesson Catalog 1, search the Keyword Table for the specified keyword. If the keyword is found, modify the corresponding retrieval code in Retrieval Code field of Keyword Table (set to 1 the bit which corresponds to the specified lesson). If the keyword is not found and if space is available in the Keyword Table, insert the keyword into the Keyword Table so that the resultant Keyword Table is sorted lexicographically by keywords, set the corresponding retrieval code to all T s but one bit which corresponds to the specified lesson, and modify all the keyword identification codes in the Keyword field of Lesson Catalog 1 which correspond to the keywords located after the newly inserted keyword in the Keyword Table (add one to all the codes). If the space is not available, i.e., 255 keywords have already occupied Keyword Table, then no operation. (c) If the specified keyword is found or inserted in Keyword Table, add the identification code of (the "logical" location of or the "logical" pointer to) the keyword (8-bit code representing 1 ~ 255) into Keyword field of the specified lesson in Lesson Catalog 1. 1.7 Deletion of a Keyword (a) Search the Keyword Table for the specified keyword and obtain the corresponding identification code. 56 Note that the identification code is the logical location of the keyword in the Keyword Table and is not actually stored in the Keyword Table. (b) Modify the corresponding retrieval code (set to the bit which corresponds to the specified lesson). If the resultant retrieval code is all O's, i.e., if no lessons are related to the keyword, delete the keyword from the Keyword Table, relocate all the keywords which are originally located after the deleted keyword, and modify all the identification codes of the keywords which are relocated in the Keyword field of Lesson Catalog 1. (c) Delte the identification code of the keyword obtained in (a) from the Keyword field of the specified lesson in Lesson Catalog 1. 1.8 Replacement of a Keyword Combination of 1.6 and 1.7* 1.9 Addition of a Relation to Other Lesson Add the specified relation pair consisting of a relation code and a lesson number into the Relations to Other Lessons field of the specified lesson in Lesson Catalog 2, if the field is not full (i.e., the field contains less than k relation pairs). 1.10 Deletion of a Relation to Other Lesson Delete the specified relation pair from the Relations to Other Lessons field of the specified lesson in Lesson Catalog 2. 57 1.11 Replacement of a Relation to Other Lesson Combination of 1.9 and 1.10. 1.12 Replacement of Lesson Type Replace the ^-bit lesson type code in Type field of the specified lesson in Lesson Catalog 2 with the l+-bit code of the specified lesson type. 1.13 Replacement of the Time Required Replace the time required in Time Required field of the specified lesson in Lesson Catalog 2 with the specified time required. 2. Course Record Editor 2.1 Registration of a Course Reserve spaces for a course outline and a student directory of the course. (a) Search the Course Directory for the specified course and section. If found, then error. (b) Insert the course and section number into Course and Section Number field at the first available space in the Course Directory. (c) Reserve the specified amount (the maximum number of lessons) of space in Course Outline, and store the "logical" pointer to and the length of (i.e., the maximum number of lessons which can be contained in the course outline) the space into Pointer to Course Outline and Length of Course Outline fields in the Course Directory. (d) Store the specified length of the student record (the maximum number of lessons which can be 58 recorded in the student record) of the course into Length of Student Record field in the Course Directory. Note that the spaces for the student record are not reserved at this stage. (e) Reserve the specified amount (the maximum number of students to be registered in the course) of space in Student Directory, clear Social Security Number field of the reserved space, and store the "logical" pointer and length of the space into Pointer to Student Directory and Length of Student Directory fields of the Course Directory. (f) Set to the Number of Students field of the Course Directory. 2.2 Deletion of a Course Search Course Directory for the specified course and section number. If not found, no operation. If found, change the course and the section number in the Course and Section Number field to a string of blank characters. 2.3 Insertion of a Lesson into Course Outline Insert a specified lesson (Lesson Number, Date and Performance Required) after the specified line in the course outline of the specified course. Note that the user doesn't specify the Lesson Number but Lesson Name. The editor must find out the lesson number of the specified lesson. 2.h Deletion of a Lesson from Course Outline Delete the lesson at the specified line of the course outline of the specified course, and relocate the lessons which are located after the deleted lesson. 59 2.5 Replacement of a Lesson in Course Outline Replace the lesson at the specified line of the course outline of the specified lesson with the specified lesson (Lesson Number, Date and Performance ) . 2.6 Registration of a Student into a Course (a) Search the student directory of the specified course for the specified social security number. If found, error. (b) Insert the specified social security number and the student ' s name at the numerically ordered (by social security number) position in the student directory of the specified course. (c) Reserve a specified (by Length of Student Record field of the specified course in Course Directory) amount of space in Student Record for the specified student and store the "logical" location of the reserved space into Pointer to Student Record field of the Student Directory. (d) Copy lesson numbers in the course outline of the specified course into the corresponding field of the student record just reserved above. If the student record has more space than the corresponding course outline, the rest of the space (Lesson Number field) must be cleared. 2.7 Deletion of a Student from a Course (a) Search the student directory of the specified course for the specified social security number. If not found, no operation. 6o (b) Delete all the items (Social Security Number, Student Name, Pointer to Student Record) of the specified student from the student directory of the specified course, and relocate the items which are located after the deleted student. 2.8 Modification of "Date" and "Performance" of Student Record This function must be activated by the system program of PLATO IV system, i.e., whenever a student terminates a lesson, this function is executed. (a) Check the lesson type of the lesson the student just finished. If the lesson was an exam type and the lesson had been taken before by the same student, then do nothing. Otherwise, (b) Modify Date, Performance and Time Spent field of the student record of the lesson in the student record of the student in the specified course. 2.9 Garbage Collection Garbage collection is activated (called) if the space is not available when Course Record Editor tries to allocate the space for course outline, student directory or student record. The garbage collection of course outline, student directory and student record requires the following two functions: (a) Formation of storage map Form the storage map which tells the current status of storage usage by scanning the Pointer to Course Outline and the Length of Course Outline 61 fields of Course Directory for the garbage collection of Course Outline (Pointer to Student Directory and Length of Student Directory fields for Student Directory; Pointer to Student Directory, Length of Student Directory and Length of Student Record fields of Course Directory and Pointer to Student Record field of Student Directory for Student Record) . (b) Reallocation of storage Reallocates all the spaces currently used to the top of the storage and make a big available space at the bottom of the storage. 62 LIST OF REFERENCES [1] Nievergelt, J. and Reingold, E. M. , "Automating Introductory Computer Science Courses" in the proceedings of the 3rd ACM-SIGCSE Symposium on Computer Science Education (1973) > 24-25. [2] Alpert, D. and Bitzer, D. L. , "Advances in computer based education", Science 167 (1970), 1582-1590. [3] Pradels, J., "The GUIDE", (Report for Ph.D. Preliminary Examination), Department of Computer Science, University of Illinois at Urbana- Champaign, Urbana, Illinois. [k] Shirer, D. and Sherwood, B. , "aidl", PLATO IV lesson, Computer-based Education Research Laboratory, University of Illinois at Urbana- Champaign, Urbana, Illinois. [5] Sherwood, B. et al. , "aid2", PLATO IV lesson, Computer-based Education Research Laboratory, University of Illinois at Urbana -Champaign, Urbana, Illinois. [6] Gries, Do, "Compiler Construction for Digital Computers", Chapter 6, John Wiley & Sons, Inc., (1971), 122-132. [7] Knuth, D. E. , "The Art of Computer Programming", Volume 3> Chapter 6, Addison-Wesley (1969), i|06-l|.22. 63 APPENDIX LISTING OF GUIDE -0 UJ Z O Z ■* (VI in IS « Z o • in • If # _l UJ z c «- c c — H- ►« z c •- c • z UJ ♦ in > «■ c «r x « UIUI • o a o i r- «i o •* IB • (\ c uj a V _j IS taJ »- « U. « T 4 a UJ U.I err ii r < c? « «r » a * c > u u u. t- x c c »- k •- ♦• _i r ►-ire * 3 X «• ivr jit < it Ik c o h- c K M or- NX •♦ W ■• X 4 ■ I/) Z • 4 ax* m K * r- • K (* «r- o II K II in r» « a. r- ue w r- ir c « • N Z e n II x - •* V) © a < o o a ft c eeito e a i/) © mxcr-ee4o o • • o r- o r- Z 4-i»- o r»e r» • (\jr» © *• •♦ r» «- ■* a. (vi r» r» r» r~ ■« if if x r- r- r- r- • m in r- r- r- r- < (v » 4 r» r» r» r» h- IICtXN SKN 4 0C m K r»^- r» C 4 II • *- r- r» K IT if (V r- r» r» r^ r» « • inr-r-r-r-KKN- •- a r- r- r- r* c •- r- " 4 x * »ccccncc uj o Z r» ivi ii n ii it o ii ii ru £■•-#- — if ac -ecu. — c — n n jc * t n k nk u •- u if — if if in if if if if iur -< a « « 44444 e is u if m x x x x x xx z ui o r K X •- m T U. Z O Ui s o c Ui o = c IS o -I a 4 c r- u. < «j u- If 7 U. If c UJ J m IT a Uj ui a a a c if « c IX © o z ■m xy I- c u. a « c « a »- c ClAh Z l/> •A ♦» <* Z I* c z - X e C 0» if C II — — II u (. — z i- U I- a c » 10 X »- If in IT COl/) 4 4 z o o -I IVI « m — i- a 4 UI V» O I- CO _J — - U -J •» IV 4«J U. ♦ ♦ Or t« C »- — < W O X - I/) l/> l/l o -< l/> ♦ ♦ I u. ■ — •> u — B - - C C oil in O MM O ♦ « Z M * • • a — —»t — zoo «u _ __ J _ i- a a a a * x ¥• ■» *- a < o u u -5 tc v 3 fit in c (9 z uj M H- < in o ui o -J o ac UD If » ac u c c B uj m «J ►- u u m e m c U k. if o o ♦ o o • z z — u >r M t-i < < a a s x UJ o c u > UJ JC kJ z o mC o UJ oo Om o c CQC mC J c> a u.' c v z >• u. ujo V UK Om X o z u. o x «c X 2 U <£ O z _• If « z u C -J m in u. UJ o -I in u c o or o o * z u X O « X o z IV © o z o If m UJ m m u. a o o < ♦- o If. z II X e z ii in — if O u. if _> u z II — IV ►- -c — ii »- «j o a a k •- if if a x i « _i o »• z »» n < u o ~ ~~. a. a. z z, m if z l* o <* z n ■* •- ii — OU' "5 3 a c r c if > CUJ Z it m w w * a « »- u: if c < * X tvi* c C t- c m Ml 4 hum c c >- > u « u k «. z z z _j m if if UJ « ♦ z c k c c -# <«V X If c nr II «\ c — z »-•». IVI UJ 1C z in (VI « 4 is z a o * JZlt « C If >- in « « m x UUJM -J -J « U. M O MM in z -J C f m —i* in -« u I — _J (VI IV is e a -j -j UJK *- a « < o u in in m c ♦ ♦ Ct M ►- o * • * (VI nj O O u -J _i O «J c c » x — Z ? 7 U _J »» o o •♦ (* z z — UN o -» — m fv m •- ii ii — *- (\ (v (\ z ISCIZ W If _ If m in « < x x M x in in « « z « x m «r •» in (V4 (\J IVI -I « M O W «*> _l — «l/it • mu. a? (M* O UJ IS (V c _l IB C i_ _i z a _JO c ? _' If u z x w — z in i_ — •- z e n z — u' ■- - H ~ — — (V K U _• •*-> If z _i e _j •- UI •- — o> e m (v f * it ■©*-« M(vi(vt(xj(V(vi(vt(W(vi(vi(v/m<»)f»»i^r)W(^i^<*'r>-»* •»•»■»•»■*•» << Ji ^ 65 (NJ z z C UJ l/l - « _i x Z X « « c c u > »- x a iij X O U. •- Q — O ■» c a a £ u >■ H- c if U C U J (\ uj if z ft >- x - _. _ ►- ¥ I w r a <* *- * Z IS Z C •» Z •- _ l/l < K u a (V _l (/l c I - X X »- C *- U' if c a c »- - » o * - - 3 W UJU. T K >- KO U If u. If C • if ♦ C m _ ? a • c u ia z «- •v u. * - _ --t ii a 4 n r\ « — •- s c >- (V c _ II T ►- c > >■ « a k u u c c *■ _j » if if » — e ~ o u- £ •- (V. •- «\j Z »*■ - II — H _ II C u *- < *- a s. 2 i > z: C J C 1 1 1 v (. v u. > > U. »- » 3 U C U. — C If _| i ? 3 - rv ««■ ♦ ,/> ^ »> r 9 .f if if XI Jl ^ifif "• IM * XX if if *: at 1/1 l/l «/l «/> i/> Ul •« ■« < 4 « a u. X 3 7 J T X X * <* * + * UJ Z> « »f JJt XK K e z z V> «/) If l/l *■ « « « « « « a U- UJ X X X X X « o uu * M «• * * * i- a a — fV f «\. « « o o a. a a. a a. x z uu i/» i/i »/i i/» i/> o V X .» < «» u» •»»•»* X IP i/ t/ If If If If o u. -i ^ _i«, at « u 5 uu U « « X u rv if m X • a a o »i C tl « (J ►- a > < z ft If • C c L>U UU U U UU auaacsaaaa; caccccccc ■_ « c e ■ t. u u «_ «_■ • u«***«* • CC (_ l_(_ cu uuu -i __/_j_i-j_,a IZIllllllC ? Z2727Z7L u UU u u u u z z z z z z z ii n M ii ii n ii «. * m U. II 0- I- •- — u c ii a c •- u >- - — o- ~ n 2 ? u. u <- Q o r - c a \r i/ u _i U.ZZ CKHK »- c _i _i a u u 2 u c»-»-uoece err u«-»-r>- t-cc oc c>- c W'UUl/ll/ll/l/'U ■r a _ _ii _iJ_i a c ►- i/i z C n. it rv < X f f f f x v. \r \r v c « « « « U X X X 2 UJ ^ «* •» * X If If * If ►- 1/ ft a u u « « ►- t- c c c c Ii* u« « « « a •/ «/ •/ */ I* c — - •- - JU u u u - ♦ Z Z 2 2 U C >- II II II M Z o u — — — r a ►■ ^ _ N •- — — >- 2 C Z •- — X 3 _l UZ - - ft C t- IS 1/ u u. u r ii - C P U u. || ~ — w >- T - C U U — ft Q " U u. L •- H if 7 u. I. « C 2 If if if a c If if a if y n - ►- T U2 If •- If C u o ~ 4 ►- _l If a to Uj •- X o »- z c •- c _l ft If ►- C If r uu. C UJft a c u c u »- < u. ft Z 10 D UJ»- « O QI T u r> « c ►-►-►- a if if if c U C •- ■• a _ H u c ►- C X or - ft •- c c «. Q. lb 7 t u a - IU u^ >- a if c u X I 9 it- * ' « X X v » X If If a a If I jf X If w J C X < 1^ Jf * ^ If if < rvj i* t — If U i* If It- * < «• l/l Z £ l/l «J» ft < If _l — « 4* « U — — » 3 * — U — ^ U _■ — — — _ ♦ — u *- •— « — _l ♦ U _l — u « — _ « u z - - ♦ — z II — (_ •— — II -US — l_ - — Z II I. 7 — — II - Z Ii - 2 - .- II - X — z — — a II u ~ i - - c i. if a »-->». u. _ a. < - > > a _ u c <= — j. 1 w > - Z- — 3 w — <\.c-»if<"--353' - ~ *K "• ■* if««x«x *»»Kh.^- r^r^^r^r-f^xec irxrixri oft » o-y ^'ya' 66 UJ z z c z >- o z u. UJ c T UJ _l t/> • U. U a a IV X o • «_' c a 4 4 IT UJ • IS a u. z c c •- ►- uj at >sl 4 »-• i— V 1/ < •* (* V- »» a K ►- •-z UJ t-4 a a c ^ J a a o «- c X K M u UJ i/i t- «-4 4 <•-> i« -1 uj a t- K z a UJ «r a a « a. i- a « UJ ^« a a *— C _i 4 a. ►- c c u a: at uJ X o JJO X V) «j c a X UJ o Z (J u. i/i i UJ u - y u. a u uj i- o a u 1- u o < a: IT uu UJ at « u. « U Q ^ — 2' » .»- ►- ■M c j ¥ >■ i/ »- (/) If! I c c 1/1 — u. c >- i- a: uj OUJ o M u >< X O p^ in UJ -i m < a: tr a: a * <*■ a ir a ir a p4 it IE _J K > — M * «* 4 • ♦ * if _j 4 _i 4 10 c 4 -1 Uj -J »- c ►- u- f\ c »- 4 N- 4 1- »- c *— ►- a If _ u* ** UJ *• * *" Q — X ^* _i (»1 ** u t— 4 o 4 4 o <_) 4 i.-~> • •- Z a z <_ z u. z u. z bJ _l ^ _| I — 1 — IV II tr II ir ii a II K II c u. II 4 (J «_ >7 •» ~ c a *- o a — » a -^ c a -^ o Z a: «« ,-< _1 z — ii c ir •- <\ a ^ -» (/■ •- a a ■— rv IT HH fv a i/- !-■ u u. II JX c — — < ii - II n *- II ii — ■» if »■* II n *- II if ii *- 2 •» «- — •- ii ir a If c 5 c c l_ II ii > x- u li. u. i- T z -c II u •* ii u — it u_ <_ u. ■» T ? i_- z c x »— ^« cr a e i/) O Ir-" fH U. 1/1 « u_ a * t- a tf i C X u C 1. ►- u u 2 ^ j ii _ <3 II a II U a. > c « a u. a i_ 2: (_ a <_ u u 1- 1- a c ^ _j u. _ _ > ►- a > 1- « K ;/ :? 2 i/ <: 1/ a u o ►- 1/ 1/ i/ D if u. •» U. u K - _ > i- _ 1- If a. a "i a .-"j I 3. a a. a c a k- (/ i- a o a a __' z. i- _j ir a. ^ IT — if f — If a _j u-> a _i 1/1 ►- _i if) (T u _i IT If) _j _j a -j wrtrviMMiMMMRjMiviiMirinfnnnnn nn IA M *- K X a. ou M O e x a X « u c Uj X at i/i •~ _l UJ u < a> UJ X l/l «o c a uj z> x -J a d z o « 1/1 1/1 o *-* o o U.' K *» (J u. a u. u. C UJ ►- o z IA V _l < I uiat o «j o c a « u. U. (J > »- < < p- u. U. 431/! c a UJ - « if ujx « »- 1/1 (— » »-> <_l 3V OUJ t-O x r; uj a. c ac « at -or b, U u a. a X K 4 UJ o u-i at 5 c u. u. 2 »— u. a u. u. u. O X o Ui o o »-4 u. m ix M o o Uj _J a: 1- c u. u. *— 1 u u. c tr ►- c " c c U. X U. C 3 a X K z •- z *- Z 1- X »- ^ JO 1- UJ X OUJ ? ^ 1- u. K « u. u. _l b. > *5* U X z u. I •- > z 2 K b. Z O C ►- c u. o ;- IT H- t— ' < (£ ►-)« II ►- ■- 'J •- o O C2 Z Z n Z 1/' Cfl u. a. uju. c ► i-jai-i- u. «/ I If c i- 2 z Z 2 2 4 2 2 2 -J ID »- UJ K D UJ e — u. •- u.- U-' u. at (0 at UJ at a. at OU) < at »- »- at at >- a z a isj 4IUII/I x at at at at UJ X UJ o t— •- oz O UJ U34 •33 S£ UJ — «J If) 1/) <_/ •" * -i a (_ a cm. t ^ f if Z If if » IT * If. If. V) « ^ If if *■ If * If ^ 1/1 If If If * *■ if if n if if (V a. 2 U f fri ■— r- a o t- r -i f, 4 PM p~l _• ■* PH — — c (vi iv 2 Z c 2 z ? i- is at ii UJ t- x: a. 2 Z UJ> Z u. r * i. k _ e if »- f <} 1/ -mc c _j tj — a u I c t - z 7! 1/ >■ Q 5 K — > ?; C T -I If >- II II II u. i 3 r u i a t t/ o <_' u. T If * — a . h. U U f- L. C -„fV "14 ^ IN ir ■> c «- IV; <~ ■» !T ■T'- J **«*<*irjniTjr^jrj"irir 67 o o o a l/> O a z • o — — Z 1/1 C IT _ U C a u a — k z U u, I/I o u V — T C 1 1/1 U. 2 a c a •- z »- c «- 7 a ir _i o ►- c z a. z o _i a X 4 e a • u ■* a U, X a ir c _J >- «_ u V X ir or c C . . - ►- u u. u z I >->■>- 4 <1 4 4- n • <1 a -1 ►- p. ^ Z Uj * u c u_ n o q a q 4— 4- »- fr- — (_ •- » ♦ 4 n ll ►— »- b ? a T ■o -J 1/1 1/1 1/1 I U o I ' 0. 1/1 X 1 V -j t— (J c * c j IT 7" c c <_ u u 4- 4— ^~ ll a o a 1/ u >- u u ♦ 4 1/ 1/ u U C C 1" t_ ^- i/ 1/ :: e e ir a. J fr- fr- u _• a > a k •J ki 1 u u 1/ U ~ fl u u ►- u 1/ I T c > c iz iz 1/ _i l a u u V c ♦ 4 \l tl a T 3 C »- !_' C = » e — — *» — c ■- IV Z Z ^ _i O 1/) . c ►- - j- r C C a a t ►- Uj >- no 2 _ ■■ S * K — (\r « "V 4 1% — — MM — o »- i 2 ir ♦ c fV ♦ 4 1 lT lT a c < <\ •— ►- 1/1 a z 4 3 u tr 7 u U b. * u » ►- o u. u. » U. <3 < *■ •— u. u •- 4- N t- ►- h c It o a (1 c • o L »- a •a ►- >- c r 7 Q < a T C 1/ >- a — • — • m • —• T r ~> i 3 4— • 4 -• _i I— — . — • -r o -i hN Jj -i ■— ■3 — 4 z >- a •- a 4— 1 t 3 4— * ■D *— o • »- Z UJ -t t- 1 ►— I 1 ►— *. E O a ►— o 3 <- ir >- Z 4 i <1 » 4 • •a _J \r c -> is- a • l/> • • • r z C •a » < t • • a i/ -> a o a w — u — — ——•-« — i\ji\ii\/iMi\iiv<\iMi\iivnnnnnnnn i\. rvitv * iff n i-in*«4t«4r#< « ruiv«viviviv iviviv i\ xo>c- ^ivi4>*ifivrr» x» c — iv m 4»4T1/1 lflunifli/1 l/l IT Jl If Jl X >C .£ ^ IVIVIV tV(V«MIVIV(V , V IV l\ IV(VIVi\ o (/I UJ a a is> T UJ It > UJ X z 1/1 -I a «- i a u if u. 2 a. i a IT UJ ir 3 tr UJ IL _J u.' a i— . c z (/> X u. k c u. y- G UJ r» i z. 2 c 4 If. It CK u. «3 2 < _) a. X O (1 + u. *- *• u. C u. X U. if 3 <; IT 7 u. If a u. »- - 3 i UJ 3 « D V <-« b— *-• a i— I I O 4 1 7 4 ►- a a CO a U. T » a. ~> • * ~ C •a 31 c z < >- x ♦ c — UJ a »- «- - l/l , IT «- 4 u. « X z I 4 «• I «/l z . >■ u. c c ■ X X Z -• 4 4 l/> C O V J u- u~ u u. lZH(t r c c c a _J •- x i J»- CUJ i o < z u. a « _■ U- « iro. (/i <_> C/) o »- 4 -I I- UJ • a « « x r o a. *- ; a. — u. z is a u. . a c c a c_i ♦ < ■v a o c ? L • C I 4 * ~ Z C h- < ; « c u. e. a i/>a »- u. sex c « c x o cr « n < Z UJ > 4 (/) a _i ~ UJ •- >• I - • 4 -I : a ♦ c a c o z «- — 4 _i «- X «■ I/O ►- 4 J* «• c a _) t c j X z o t~ 4 u. C — IT- l/" V < u. _J a ♦ u r a t c a • a c r u. ir « a 3 _l u. a > c UJ u. _) ♦ c a « c z s C v _ u c * •- u. I _) uJ X 1/1 < a t. c if u~ c c<-C — _I>-04_1 >- _l — Z404X4 Z=ro u. i_ tf a u. o it un iv(vcvr\(\ r\.(V(V(\)i\.'(\'(v»x.iv CV<\i(\i»V "i ci pi c ff r»^*^f*> 69 o a »- z o o a o o u a u o It a v « rv ♦ i < u Kf 1 U r a z o in u — u 2 — : 7 Z c N 2 C 1 V I- c u .- «/) *- c rv. »- r- _i c • « — _i a u ♦ »- *■ — u«zvc_»-tt«»-ou c < u - x a u. < ? — os c z « i <- j i c > < _jua-i^ji>-uc»ci/i — »♦—»■ «c;*iu.oi/ , i/"i/ , zoar a « t I — *~ o c (* o *- — u u - r- 2 »- O C IT 11/ I « — a t i/ a. c c c u z e >-ro * z ■: • u. ~> • -> < i a o u. a ►- w « o a ik u 3 IT 2 c y »- U 7 u t c b. □ c u 1 — u ir t- c tr a z _ a c *■ • U u. T C B 1 -~ a »- (J <_ u ^ »■ u a u c a 1/ — c 3 o I ir e J >■ e > <_■ < U K c II 2 o *- — It a J i/> z .r 9 ♦ ■a IT < D IT T L a « u u t u u u u U ►- K c o r> i/ 7 tr IT Q ►- -j -« — • i 3 ~-« — « ~> ~* 3 E ►- 1 a:>- «r 3 o ►— *~ 1 r 3 •o t « a C -> • -> • u- « 1 ir — rv fn '\i(\j(V(\ji\j(V'Vivojni^r>mi^nmrn ff o »- cv i"> * « # ■♦ ■» * ■♦ rnr m ir r> 70 or i/> o u Q I 7 a C — Z UJ 4 ~ o u. — a; i/-, a c c • oo UJ UJ — x z Z C a: i c i u. a < > UJ i i/) o O a u, c a. IT u 3T UJ — >- r o ex ►- u c _ »- a • o o c u. u. u a a •-• C/l tf) C I o T U. K 4 i- o a w C - a t- C C C <_ •- C a. a z a u. « .— U. f li * a a a 3 • _l ■ a cot-? "-" IT «- U, O UJ UJ > UJ *- *- c a -l -t X 3 Z <- X x t- ~ « 3* < in k a 0C UJ 2 U ace 4 I U T a i (j or •- « a u u c a « i • (J U I- c 1 ll'l/l 2 V mi «ic «- t- c - cr or •- 3 >- < U 0D UJ Uj U. UJ z w z (/•(/• c a c -• -. •- a *r a a oi- X a « UJ I/- u. I a c •-•a ir in a z — UJ t- — in u. — a 5 z a « uj c a u c- 4 ir c q a c r — u. ir. ♦ c r uj - — -"OK X l/l U. o X l/> — 0. — c * •- IT * w a i e — i- a ♦ o o ►- Z UJ o u_ a a _ - — IT a « >- UJ I li.>K Lie C li k ? ir t/- o « ir c it "-•a a « uj 44 t-crx 4 >- a: »- a: a 4Xi/)« a ir. cr « uj _i •* U- 3 u 3r »- C O (j — x a < i- a x >- * a < » « i/- c ►- a: XI 4j if x r- i t» c _ i iv ■C 1 >0 JJ ^ ^ »> r^ »^ 71 u « l/> u. 1 a 1/ u a •- o «/ c c C t- t- C u. e z a l/l - T X ««-X«0 « 3 a »- v a I- —or u « » a -■ ^fMJO-M1«i/lJJMffc-IV( a i/l a a u z a. o IS «\ c z a a c a a c a o a a c a I o -1 o m O — 1 •-t * a o ci UJ »» c ♦ ♦ K X u •- V « •- If u a • > u C t- If c a. z V a ►- If (/> o a B O « c a a. UJ ♦ c • a c « — i „ 1 — * a • u. i > w J" If >r _ « — — s T a a ~ a •— ♦ 1- IT * X ■» X u v »- u >- b - If «_ «_ o «■ a «- z Q •- z (- a «• □ « Q o £ c _• *- <- 1/ •- u- i _ K (. a t- ■ a a a ■j -» a T > a i/ 1 . *- IT I »- o a c c c <- c J_ C c c « ? 2 — II- JI-JI- r « zo«o«o«o = o u._i<->c<_>ce«r in u. «r • c a ~) ~: f^ - o z M u o a o z o z a u 1C — _ •- I - c • u a > c 4 St c o o to c — I/) ♦ Z — * ►" t — • c — c _ _ _ X t DM z Ul UJ ft, St c c c 4 «5 c: c <- • .? «_ 2 a 2 2 ^ < c > <- Q u. Q < Q K a a- a a a. in a: a in — * 1/1 c c 1— (/" c a c c <_• c Q <_ »— =r j _ *— _i o o a o 2 < i£ - 1 _. X) -c ■c •c * X) r^ j <» *» ■* - i/i ►- 3 C U' UJ _• i sc • a > o — UJ z .-- t k ~ ; — r t * c cv It S UXffUJ <-• < a c tr c era o « • x z a «si t-uc>*-«_) t- zo «oroooo«o ~-t ftj c»i -» ifi x* h-ac o* o >— h-r^r*-r--r'-r^r— r*-r*^aocD a o Ul z z ►-< cr _l b. in o ftj K »- — ►- ».' u ft 2 u X _i (in 3 Ul UJ Ul U' 1/1 # 2 15 S a • ti Q > • « 2 u «r uj z a »- IT cr 4 __ : -i a -i u Ul in a. a i/> or in 1 >- z tr. j c < t- — in w c (T 1- _J "> a » 2 *• o O «- ■* _i D O St * • St 2 •— m »> > C — l: » 4 z < n uj a. c < -— ~ T * o Oh o » 1* m j* pn t/i o X X ftj Ul >- « a. m »4 ^* jj 1 Ul U 1 * » » UJ u c K- SC 1 tf 2 «= u a c U o — ~* • O -^ *» ^ »- ^- t PM ui a o e ■J* i/- c •- *- c — ^» *- *- _J <3 Ul ft U ft ^« r~ Z x Uj u U DC u c a Uj <3 u. •— i ♦ a •- (S is 1 3 CI > t- tr ir 2 It c u c u- u 7 ~ 2 ~ ~ Si 2 u >- *- ir — ' J _i 2 <3 £. a t- ►- K o Cl- a « i_ - Ul U' UJ V u >- i_ • >- > > a « t/1 K IT a a o c a c c c c ♦ V c cr o 3 «. C Q c h- t- 4 »-« 3 T i— 4 _l i— 4 _) k— »— J »— t— _J ►— _l »— t— _l z 4 »- X >- a 4 3 z O -* ir xi r^ or 0> O __ t\j m -J ■XI -f l^ I OD 00 CO CO OC OD OD CD 0> o » ». > » 0> a> o o o o o oo c o * ■* -* -* 4 ■* ■♦ 4 •* ■♦ ■* ■* -» <» •* •» •• * iTlfl IT If IT If If if u- 73 If u o u Ifl U. > O a. > c a (A UJ c z « ac 1/1 -I Ifl if. u> 9 a a r o o UJ a o a if) « c uJ a. • l/> UJ ►- a : « ir 2 4— X 7 a *" O c a if 4- Z c • u. I? -> 44 o o • t- — o w » • « ] c pp » C 4V 1 If f u o -1 C a a ♦ 4- -I u. o o • UJ i/i u u. w U. 4— a ~ a > O o a c ■ — V -J c z X 2 -J -1 — 4- « UJ « ja « 1 a u a * V a i 1/ ir C i_> 4 *< UJ o z if) o*~ UJ I <3 2 -J •>» 4 • LO _< 4- • _> 4- a « _i » If _ 4- ♦ 1/ a 4- mm 4 ^ ♦ m — i W e «■ p« ~ t *- — u • • 4 •» "> — 4 "- — b u * ♦ u 4 U « u *- Ul u. ♦ b. * it e ii if a 4- > 1 >~ > a 4- 15 VIS z a t_ c ■4J c a u If c Q u. i/ c o u Q »- a J ea C Q if if if vf z u H UJ 2 lf> 1 a »- r- — If -> a o c 4- *T > u >• b' > u. >- u « > UJ V I. i ■» r> c c r« c p- C a 4- C »- a 1/ l- c ►- a ►- C a -J 3 3 < _l 4- 4- 4- — • *— 4- — • 4— 4— 44 4- o J -1 *-t 4— 144 4- 4— ■J *— x r 4— z 3 z 3 4- T o z p- T 3 z 4- (X Z « « 2 ■< Z t- if u - ir u li « X ■ u « * (.' u » X uj a o - u L. « X IS UJ — rvi f J u~ .c 4^ X o c p^ (V n 4 if 4> 4- or o» o ^_ (V n ■« Ifl « 4- IT o- p< pa *- 4- — — — P4 — —. rvj r\J rvi l\J f\J (\J IM IM rvj (VJ rn o m n m o r> n m m IT j- if If ir ir IT IT IT IT if lf IT if ir in IT IT if) If IT Ifilfl IT ir m IT IT Ifl i/i o - X — X - O V If B u. « a • c > (V s UJ 4^ X 4- c 4- A u - a C ^~ 4- • If * > a J ♦ C n a. o> X >- 4- X • if> « UJ wr> It ~ >- JJ. 4- X x i_ «« a U. V _j if> PH i t t * * t . x- a W — 1/ c •. - T X y *- X C 1/ 1/ If tt X T IT »: 4- UJ a t c • « c <_. 2 1/ 1! _' 4- t <■ 4- a 3i a u « Z 4- o 3 C 2 4- < « _i 3 U Q 1 C a _ " Ul uJ U' > if jT 4- l_ C » C If. If If 1C T. u o If U U" 2 U 4- C U CJ — «■>_! ZOO* r _j x o r\j'*)-#if)'Cf*irf>o— iv*)-* ir < * 4 < ■» -« 4 Jifljllfljljl^ irifirifiirtiriririririfu-tiriT ('4 X o a < UJ If. (J a •■* o o ft • a <_> r •— □r • c o a o o * *— c; i. *? _• c if c r li. a -1 a a c _l 2 >- •—i X (A u u. ir *£ u. o ~ t- * c -• t-> J Z 4 4 ran r K co o* => — (\im iPirififxififif u OC UJ l/» 1 UJ V) u a. x o > N* Z Ui If X o _l ►- * a 2 IT U.> z 4 • UJ •- — X o — \ X o UJ ►- 4 K • O X o »- d z X tj K X 4- Or X u. u a 3 K 4 Z 15 O 4 o X 4 4 C a C •- O UJ <_> u UJ u. U. 4 U X O l/> ft UJ If C X O — UJ 4 U. I CC U uci-oy *x Uj _l »- X C J O UJ 1/1 it e k _j -J K ■-• 3 JO o c c a II/II CM 4 X u. c «_• »-• tr u. a <_> 4 >- k z OK K ft K U a -i U, CD UJ UJ UJ UJ o • K K O Z UJO 4 3 I U c in * a um nmi. K U. I * CJ U. IT X »- c It K C C tr c • »- X 1 If K 1 UJ u. u. > Z K 1 -Jft K U. 1 ac CO o ui «. k K if Z Ifl U. 4 O O UJ UJ u. * z se J K O O 1/1 w* O CJ u. U. Z t- o u o i/i a a k z uj X UJ u M O 1/1 *- U.' o K o u. u. K ft X ft z IWC a K z uj -J «K X O K »0 o o «— K >- Z K 4 3 « IS a 3 IKK Z K K C (J c IT C X •- a x C IT 4 U; 04 h. K ►- 4 4 uj z a ft ^ o a 4 V z K a u. C K a u -t U. K a cc a. 3 •-H k-i u. « 3 K 1 K XK CD-i u. in uu. 3 *■» O it _l K -i K -J K Z X UJ »C Ul/i ►-.1/1 > »- Z »- in z O 3 o a C U. e I 1 1 1 • 1 I i < -J c c - 1 1 1 1 r • i • Ui -1 •-• «- 1 1 I 1 • i i i y c u U _l 1 s k u •— «r x k c a a. UJ 4 i-^ k •— > z If tf 4 u K 4 I X Z UJ — UJ 4 X ZCIfl Z * K U — ^ > _! X a c u _j a _, ►-• 4 UJ >- if o u _l B 3 o it) l I K UJ Uj X If K uiac I 4 k a * X CO i/) (A U. Z u in«K«0'0 — l\jn ■» IT « Mt » O f. iMO^lTOK 4>4>«<£4>KKKKKKKKKK O O X a X S OD I irmir it ir in ur ir it it irir iririr iririiririr ifirir c _i 9 Z CC c in X X u o o e < IT l/t o X z u K C x 4 z o 3 -I CO 0> » CD IT IT X • BK — OJ Z C A V >- z a a r\ K UI X X V. ft -J UJ U. C _l 4 U. K I- IT K _l < T * X » * I U ^ t (V CJ _l i- u Q r o z •-K3 « 4 « :: 4 t i/i 4 uj a a. i U JK JI _lt-X — V 4 ft u e •- _i Z 4 o o o Uj • «J l»> — «V o — ru m ■» in * k i » » »o » o> » » o» IT. If ITlf If IT IT IT IT G ft c •- ir v ; u ^ •- c - ft c CK C U IT _J o C •-• UJ UJ u. a t _j — T t- — >~ c a 0. UX X X c c U UI u u ir ft C t- C 4 t- Z •- X r o o C 3 uj O ? a. t- •- C Z • Q *- ft »- C O a in 7 a c If 1 1 1 Till •- l> 1 a a i c i » X uj e * OK _J 1/ I K uj x3 a K 3 O X V ; if c i; c a ►- X z o u. c * * * 0» o-- M r»> o oc o o s * .r x -c 75 K or x u or < in 1/1 u. o r- r» ^ T K h- X 1/" c o K C i/ a j < r- <3 f- <* 7 * • » r» x X * o ► c a t- \r (/> 4T c a ^> ■Cf~ 4 « 4 c X X • •a ■ • » x * * C k *» c ■ r V w 1/ •» 1/ i/ C * tr u tt t\ 4 l/l 1 ■a 4 a ■a X «M • a ^ » *• « * IP •m t- ■ M X >- ■ » • ^- o X /l UJ m o a 1 "" - * a — 4 — a * « a ^ ■ — 4 * x a c r" J ■c • h II • 1 3 *■ 1 «* r * u • «> T • P> • o • « U Z c a u Q u c Z Q U c I a i i 2 u A * K — ♦ — i A u • - • A • K ►■ t~ UJ _i IS * — a X" a x a _1 X a x is tr e • iS IT _l >■ .' — i — — — UJ z >■ — — UJ z < z M z z > V u j_ r > U V »- U- K C/ v »- u. u u U a ►- V 7 u — V ► Z u •» x a > ^_ u. * _• _ I u u ► t t » * t c t 5 X t t 3 ■ A A A A 1 O ^-> ►- 1 r t t K t t_ ►- _ *- _l — - 2 i C l! m K 7 1 3 «: 1 r> rv _ UJ ^_ g • z X U. UJ > r uj > X X z UJ >■ X T T v ♦ T I ^ 1 X X _l t r ♦ u a b I. ►- t- u «. >- u. l_ c ll ► U (. (. I _' C C -J •-ecu «j •- .J _ r ►-•-11 z •- *• Z r _ w X 7 -• z z - ? r Q z V t > a a a <: ■ t « < < t « « <• « 3 « « H X 3 3 3 ? a 5 z a •1 X 2 2 or o a iT a 3 a UJ 2 •- a »- r <_ o l; i u U X a ►- i- U X I 3 -1 r i _i — X x ►« ^ X >- 3 o m o- -4 ■» o in a. c e i c -• « i • c • a t q t 3 o 3 u 1 u — »- Ct I- o tf> •- < c U it i. c e-«- « Z o- c Uk tt _) V — • - V V O • • u _ — a „ — - c t • r r u ■» u. u. u. o II i_ <_ *. c •a u o a a u _ r ; r * m ~ c c c u. uul ~ i- c c c -< ►- 4 4 Z O D O Z. C _l _i c o oo c o-^ ~* *~ *+ *+ ^ _ _* ^, ^* r\, nj ru fv ru rv iviiv m ivjn n nnn nfl r>r>^> c -• (vr> « « « « « « ^> « « c « ■i -r i- o — - la (_>-•- »- a •- *. x t — IT (J w • u >- ♦ ?ui> -: «- •- u. z i — • »- _ - a - a » t U. (/■ > T LL A • UJ UJ U- jj a »- 2 X Q <- C Q <_. O O >- >- _» — x a t- -. 2 -a o o jj o x u. i_ o i_ » t/i tr u. i u i/i UJ a: a i o a it a a c < z a « UJ 0- s/> o >- -I UJ « e> 2 2 « u. c 1/ •- u o -i UJ t- a Z Q 4 T a: u. c (/ »- < C Q 2 U. < a c x <■ Q t- UJ 2 Q >- 2 UJ(_)UJ« * •* • C c u. * i z <_ c a »- < »- K UJ «a a «/) _i a u. u u. a it c UJ UJ a ir a o a Z (V UJ ff z U.' i X c c c c ♦ *- 3: a: ►- P-* 4 c a a x a •» 4 '- •- a *- x (j 1 • o »— * a uj >- 1— « « U 2 u «» < i_> UJ Z — ' •M 2 l/l X a c (J < C w* —5 l_> « I c «v * « ►■ c 3 • c c t_ c >- t. < 1 *- - 1/1 UJ It 1— IT UJ C "3 ~- a t c a — a t t IT c a a «» t i/i a uj a 1 • ^- t— i 2 ~ i_- a r — a *- c <■ a »- *- c - c — *v. u. u »- 2 »- ~- •— u. »- »— »— c 4 a 3 * UJ * * * 2 I z- UJ T I i * X * ¥ IS. X (A 1 X 1 t _l X X UJ X u. I C #- u. a c C L. u. St <_ H- <_ *- <_ (- e — c — ~ •— «_ X c V <_ < ►- a a a K *- «_ Z c c Z *. a z < c ~ z a i_ ? z c (/ K t 4 IT (/■ i/ 3 >r u. <■ *- t- < t <. « 2 « t t- a <£ 1 t «a « ? _■ »- «= U- < 4 _J to •- 2 a a UJ U. ■x a a o: a a uj a X o z I Uj 4 X ~> ►- X a u. X 3 -> X I »- O : X K X >- «j K a 2 4 -1 2 O 4 z o o 4 o o o O ~ C U hJ -) _) <-> ■H «v r- •» If « « » Ji >Cr^ x^-^ ^nrv LT IT Jl iT if < J3 ^) f*l-*l/!-GP-X^O ^>f -C f ^ f x*c — (v ei .» ui « r^ a: M99)lt SISSXIC 777 777 77 77 OOC C o 77 u Ml z X 3 C u l/l 2 c in b ^_ « z z < _i • m t- uJ O ►- K O ■4 "* +• ~ ip ♦ a or m a • l/l o o * • » a ♦ a « a a « l a -1 « c « l« ♦ » 1/ \r H U i/ u C «.' 1/ »« z a — ii n - - a a — >- r- i/i a — m UJ *- w - ►- t/ - c >- i/ l H »- 1/ u » z a ♦ za. * >■ z a o z • z z a, K UJ —• »— ►- o a h- c 2 ♦ C > Z o a c z X C Z P4 1/1 JT G c a • a c •a c »- Z Q D- O t • C - Ml- O c •" " (V • L. - z t a c ♦ to C 1/ •- t a. ~* ii a t a t » « * M — o *■ a a c *» tm •- c - c C c - • i/ M IT » i/. »» tm w V y u. U u u x u M r u. a — I 1 UJ Q — ♦ * t x a — l/l T l/l t i/i X l/l m l/l ► u c c ►- u 1. «- c ►- U — C (-I.HU i_ Q c a u a u a 2 fr- _ 2 -; I- Z £ Z. z ►- 1 z z r ►- - ««»-!/. Q <- a •a ■» a u a e c T til oo X a uj c & U" a a o c u a u a t-> tucu a a r i a n. • ■* T t or 3 a a 3 a a i a a a u X u O 9 X UJ 0> U a c c _»►- IMIO 9 5 IS * u • JT< K » y O — f\j "i *un.CK(B0"O — Nn*lT«N«»0-Mn ooo o cmmm— „_„ — ««iVMMWMMivjnji\j(\jnnr,n » » (V. • • • ♦ (M • ♦ « ♦ C X - * I — CI 1 - 1/ MM Q, • • «n MM « ♦ • CO - • • - II- c L"U I « l/> 1/ T T o a «. I. i/ i/ a 1/ — — «3 _> UO uj U Z Z 1/ W 1*1 r^ r- h- h- X Ul a. Ui c c Q IT ft «C • o u I > U s ►- n o UJ « »J* U U' »- u i/ D Q M 4 (V a ^ U 1- u u c 2 lJ-1 vi X c »- UJ o o z a >- U-: •— f- O •» u u u X UJ •-• H o u z r ►- O z ^ UJ u m « _j h. u. u l/l It 1/ C 1/ z « Z « a •— L. »— l_ o ►- > Ik oa — I X Uj U u U. a o o e a UJ H a UJ a N u z. a ~ >■ _J 1 i i i < 1 i i i 7 1 i i • < C ^ IN r _l ui U/ Uy u « 1- »- 1- *- c 4 < « < M i— *— i- ►» X Ul un in UO u. O M rvm ■» IP » « « ■« « « Q 1/ a Z in »- a UJ i/i • • m l/l X ^-» a •* i. • C 3 c a o * M I 1/ A 2 u a a *- Q w V a a a a -I i/i o i.- Q « C L C I- UJ J _) •- u a _, o ir r- « » o m « ♦♦KIlT 78 X >• in c z < a. ac © u t/l U o a a: o tn u. a a i ■ WV if a if 2 a a ui * o ♦ ft • 1-2 4- 1/1 ku a »- * c c c a k * o 2 tf IClii U K 4 a O CO O 2 l_ 4 » K ft * ►-*■ • «/■ 12 1/ ♦ — C * n • 5-7 v I UJ v u * c a K C K r « »- •- u i- a x I- I/" <_> UJ PK 2 1/1 UJ D- If O C a t- r 2 ¥ u UK a < a 4 BO a «j _i • p- *. if- *- if • if x t- (9 -* x C t II • _ v r uj if u St er C tt I- c t- 2 r « k >- 4 t_> i- a: x n- ICOUJ 1/1 UJ »- Jt 1!C a t- — 2 K UJ UCE a 40r < coo a c a • K ft *■ »- * » «r X ►- IT — • IT Ifl X O « II • T — 2 > I Ul a if u. ± c « a k c ►- a - « ►- — _i u p- a: x v ft «* K 2 I/1UJ P- If tt c _ ^ X u. z o at -14 a: O CO o u u I Ul a v u.< y c « a »- c *■ a r <» p- *- x o i- a x »- »- ITU UJ ft t- 2 in Uj a p- r 2 * UJ jc uor z . • * a IT »- <5 U 2 I > a uj «- a: oi uj i- a: a in mo o u. c a • it 2 x V- <_ » • a x M Ctc II • — r z — -p t V V I UJ * 1/ if u ± u c IT a t- C i t- t~ u. r « k if «= »- 2 o i- a a t- x t- i- i/u i- ; u" u 2 « u.' e; o o 4 o (SCL'O acccc acc«_c acctc occcc «->->-_»i- >->- >- j»- »—»—»—_•>— ►—>—»—_(•— Z0040 Z0040 Z0040 Z0040 U.' C O C C UlOISL'O UIISCUl! UlOCUC ace accLC accc c •—»—•— >-t-'-_ii— >—•—•—_• — ZOO 20040 Z004 O uj is c ujiscoib u.c J1 * N » » O -t ft.' in ui lt in -c *o *o r^ r- r~ r^ r^ r- *- -ix)a)oo Pl ■» 1/1 X P-B 0"o ^ ivn 4 IT * " 79 c o U.' a. u CD > > a «/> UJ IV UJ V) 4- a UJ «/» o ar. ►- >- Z (9 i 4- ♦ ♦ u ♦ 7 * in in * m 9 or m » a a • a • ar * c a u B o o a • 3 if a i/i • • a z 4 c » in a » _i o 4- c • >■ uj It u a o 4- ■ in a » 4 o » r L c X >- UJ O tf a a « UJ o o m 4 1- » •— >- • M in > ir (9 C « T I- O a UJ U • a a I 1 > i o a a in > U } C 4- •v. 4- 1/ 4- (9 1 u Q < UJ 4 » a in » z z 4-0 a -i _i o • o » 4- Z o _l o o »- X i i/i a i/t • l/l V I ♦ w o in a t> ♦• • c 4* C — C t a a t 1/ o. p« a ■ « *- c ^- > «. ^- • 4 4 c » 4 4 • 4 *- u 4 — t — 2 u T 4 > 4« « » I » 10 4 ♦ % c • a n o b t 1 UJ t _l JT 4- a 1 in > » r _i a 4- a cr 4- — . •— z 4- f k U r r u ~ K n A C 4— u U. r\ u u 1/ t. A c — i/ c 4— 4» C >a c z 4- ."" 4- K ir 4- k c 1 Q a • J ii ■< i/ 4- ►- 4- a a -» a * Q - C a w u »- u a (J 1/ «. «,' «. L 4- t 4- i/ i/ u- If 1/ o u. u O (/ « c ~ i/ « if n u Z a b _l 4> < ■' _l 4- < < 4- *3 1 j. a. ■ a a UJ (1 1 4- 4- 4- K u a UJ a uj a o UJ a u K <_) Uj c 7 1 1/ 1 I 1/1 r L • o «_ u t 4 Uj ^ U1 ir 1/ 1/ 4- U in U ♦ u. -1 ♦ bj u. UJ U IT — 1-1 O i/l O o u V V > u > > * ■a bv > Uj >- >• < _' o u c c o C a «- c 4- C O c o L' O b C C C 4- c o 4- n «_ 4- a <- C 4- w > _l 4- *— _» ►— -1 4- — • 4— »- 4- 4- J 4- •> -1 _» 4- "^ 4- *— M4 4— -1 •-• 4— -1 J — 7 O « o z « z - a 1 o z o 7- « Z o « z o a o z a i" < K Z •« Z « u. 3 «J V It (.' u u c » tr u 12 UJ u Uj X 03 a » c UJ * u> i UJ UJ U 3 U. T 3* c _ (V n 4 J\ 4) 4*. 1 9 c — K X 9 C -m n ■» ID ■c K B or o — IV C» « in 4- a u 1 4- - a uj \f) o z 4 <1 - cr — if ~ 4- » u- a 4- 4- « C 1/ c 4— u •» _< 2 4- a 4- « 4- if t * c a C uj UJ ~* u. a ►- «• >- <_ 4- L a C <- -• _l 4— 4 -1 z « Z O 4 3 U u. _l u IT -C 4^ X £J" C m <^ M n n -0 x « a XXX 80 o u a t- o ui z VI a i/) «/> UJ -i -1 a o Ul z X 1/1 ft o «J o z «- u «■ < "3 a * (/> ►- K X «■ K- V If. 4 •- 4 • ^ «■ _■ _j T T C z ♦ O Q U W 1- 3 l/> «• UJ t»= X X 1/1 Z < X a uj «/1 u « * C ? 2 -1 o a • X UJ - • o «- *■ IS u. t- X © X c ^ (/ *- _' K * c u • «- 4- »- «- •- * — i— • o c U-! 1/1 •-• ♦ •C « II ♦ c H- II «- «- a ~* C fv (v X. c _ a u a *- — a a a c e T f» * 1/ ♦ M t 2 3 s r t r- u^ c _) rv -)t- •— *- * sr c >/> •- z c •- u_ 4 a. o i/i 4 o > o a C K > c >- z u. 4 t/1 — z »- o a •— ir »- •a (/> u z — o u. 1/) •- O u • c *- «s 7 Z q a tr a _j z c 1/ (/• (V K •»- u if ft •- y V If *- IT X _l ecu. a. I U. UJ ♦ IE UJ o Ol/l If u. IT/ sr _i _J £ < Z z -1 ♦ - a: »- a: t tr « 3 « » (T >- sr u. uj ft «.' C - z 4 o < o«r < o« cr o u. c; c c tr a o e a uj c a c y > c ft *- B K «- •« o O i- 1— *-« ^— ■— t z •- O XI- T o z ►- a: Z X UJ « _l «/l < 1/1 «£• U/ 4 3 UJ u. « U. U.'(J • C K I- C C t- •-■ -• « _l o ►- a: »- a; o « (£4 3 « 3 _J (J ox z >- Til U. < — • fV 1 f ^ iJD X ■»■»-»■» •» ■» (f x a i o — r\j m -» xxxx xxxxx r^r^Kr^r^xxxxxxx XX xxxxxxxxxxxx xx 81 o _J o a it «/> o t- o UJ o UJ u ♦ «■ z ♦ a ♦ ♦ u ♦ (X ♦ ♦ a. * t * ♦ » P4 a B • ♦ 4 — > pi ♦ *- i- a ♦ ♦ 2 U ♦ a o •« c _) ■ Z X. -3 B U) -1 a a IS ■» a • ■» «j • UJ O I z ♦ (^ a i/i ♦ t/ • c - c ♦ — Uj2 « — a V u «- «/- t ♦ ♦ 2 tr -. * l/l r <~> o p- 1/ ♦ « u t «1 < c u ►— 1/ c c f- 1 « ^ « <_ a _ ►- c -1 u » >- c >/> z u — r- »- ►- c U Z p- — »■• t-H It ~) K _l - ~ -) 3 _ - 4 P- 0> — (V O ■» 2 •• >- ur <• ♦ O ♦ - • C V If U Z I*- U r a •- »\ o ♦ •— X ♦ U. v x •- it a a * » » p- y *- v c i- O O O O ~ O — D t- op-x*-r*-xp-r»- »- X Ul it o >- u. it »- X UJ z 2 K O ■» IN) * IS - *- tr a. — t- X h~ i U -I «• ■• l/l — UJ _1 _) — « «- — »- • *- z ~ «- _j «- K UK Z 4- «« u • or « ojz *— «■ ** * (_> (/: C «/) z *-• •a a c -> .(/■ir * u * s ♦ I — UJ c M •• a a UJ <» 3 •-« • _l «■ »— «■ > • t- ♦ C/l — — X a — ir u K Z U. ♦ * * u. «■ a «■ «\ y a a u. If > a a k ■* < a v > s •» «■ J 4- if c ♦ r 2 c [/I C V Uj »- UJ in t jit * j sf < — «■»- "5 • u O -> «\J O J3 cr it >- St r i/i U. IT If < *. - • If It W 1 !/• it X U. » O l/l IT *» <_ T U.- ^« v (^ » a * »x «■ U W= * 2 ♦ ►- UJ X I O O *- mi C * (\j - m «• O ojoj »- m ot 01 ling. -J or l_- a 0. c a c 3. 1 it 1 a 4- > £ 1 C I » UJ UJ O UJ 2 O UJ ui uj e uj » t- »- ¥- K i/i «- X. K K K c • c 3 » *- Q t_ N .-->«* * w* z - t * C C — 3 ~> ♦ od n m • ~> cr V UJ 11 a ♦ > IX — r r r- «\ V 3 * l\ c it «v r r- c ~ b. t~ ir a a. a a a a t- V •* u n a t~ a a a 3 it X * z x s x 1 5 S » lL c- «• *- 7 t X X I T > t ? u. A UJ Ui UJ UJ UJ UJ Ul It IV «: r« UJ UJ U. Uj uj u. A J? -> ~>t- »-(->- t- • ►- • z c — «■ ^ »- -5 2 K ►-»- it -) "i C U U. < U « U. ! -a:r>-c»:r»-a:T»-a:« ri5jjc«jif- «l UJ < h. aOCI-' CU3K3KC >-_|(__| t-_|0«0-<>- z « o «j o « 11 iao II t C O (9L>l/)XV)Xtt UJ « X < u ■» u r_ * — ♦ oc c>«_ci--«c a ►- t-_i >- 3 JK H 1- •- -• z< ox«oar o z*-t Uj <_ C (ft C J t C u.<3 cinm*-#*-»**^**i/irfirfiijnin in i/tin ithicjj]ii«««'0 r» I » o — (V « « « f' K K 0> O o^ o> o^ 0> n^ir O K£ 9C ~*tv »o o > '0>«)>c>o v » r- » iT IS (X) 9 o » » UJ m o z s ■• rv v 2 C o IT I c If) >/> u z u -J UJ Q (J 1/) •- « c ? — oc »- U t «\ c — < ? r a _■ «- I- I « t u >■: w o u ■»»-«.■ O — _l x a < (/-so ■c »» a> » c — I x a> o o> » 9 9 O- ff 0> rvj I a 3 Z f- O _l o Z T •* Z t* C » » « < « o a 3 C O 2 o uj u a a z IM is- a a i < uj I K (.< % O « rv •- a a X UJ a u a - u ♦ K O (V — IV ~ C -4 t — — — t- «V.(V ♦ X ♦ O ♦ I <" •* 7 X Q * * a (/< t- u 3 I « If t IS « « Z UJ U. UJ x i- uj»->-kv_ixic«)£¥k >- « U'cr a i_ c i ►- * L t- j <- O — _i z « o >- r at « uj e c « (Si > • o » C » «_' c O -I O _l t- >- r < >- r « o « isi u < tsi o (9 a in 2 O «/> «S1 z UJ (S) _i c u. J _l IT u c c c X (- z lfl»- »■ *"" UJ — ♦ -« y u ► u UJ o (S k a t- V t- >— 3 — « ^ « _5 -• Z « K z »- K « « uj a Ui uj -a » a u. rvjci*in cr- e -< M o o» a- v 9 o> o> » 0> oooo 0> 0> » 0> 9 9 9 9 OOOO (P « r- ai f~ (ti coo ooooo o u Ul K a. Z t * * « _ _ _ _ ___„_o-"«vjm ~m (•■ ■# it «m a •- ~- >-• — o c- «j «_ o c o e «_> o c e u e UZZZ 2 2 2 2 2 2 2 2 7 2 UlCCCCCCCCCCCCC a <- o u o (j c; (_i c o c o «_ c a u,uu uuujuuju 1 uuuu zoraacraiaoiaauicicr — aaaaaaaaicia an »- o >-• J z « 3 o — (Mri^u-iJjjr^eoo-c— ■ i\in « l\JfVI(\JCM(\l(M(V(VI(>J(*>(" 1 (">(*'d oooc-oooeoooooo 8k u U) Q _> DB u c (VI (\J IT -* a • kJ — O o o o o O UJ ♦ c c (J (U — ___,_.___ _, „ _ Ui a i~.-.-.-«\.— .-i iici« it i i ir i c t v ~< ** r- a. ►- tt«.ttt*****tt«**t*tt««*«.t****t«*tt*t.a z _ . , - , . . — — . . . ~ . » c , n „„mivK,ivh\\MVKivnmpnnnnnnn4««4«4 4 44 4F- i/i _ ______________■_______. ______ • ___ fc. c _■ «,• «_• t; sj •_• *_• u o e o o o u o _ «j c o o c «j o *i>j w e — <\j m ■* in « *- •» o ~ im pi ■♦ in oomm m * * ■♦■»♦ •# •# ■*<•■* iPiPini/iunuiiniriinui * « « 4>t^r*r~r-f-i- oocoooc ooceoooo oooooooooo ooooccoocooooooo » 4- UJ 4 «- uj a U Jl/I V Ul «►"•!- t- a o «- _i z U. ft X _J c zu< 1 U' w X » • O UJ UJ 1- ♦ . . • _i «•«■«- C c * ir _ t * •*. ir -» • u. w c e .- «v. c <\ (j _ _ — _ ft — T u, u. u u u c e r c a a o. a u. r v k > > >- > ■J V j»- t-t- i- Ul Ul UJ — j_j _j _j — c n -i u H- a 3 < C ¥- t! C »- a t- <_■ ►i _J _!-* •-< -1 Z «* Z x ? « _> «j _• UJ * « _" «J vj m cr o - NO -* IT ^. r-b- ^- a> a> t» CD ce ec o c o c o o e c c o 85 is m o UJ N C • ♦ « 4 ♦ * . ♦ a »- < c a a ♦ *■ t « o o o o o c o o e e e c o o o o o o o o o e c o o o o © o o o o o o o o s e e e o o o o o o o o coo© » c c c c i. 1 i c o © o < «» < © o o o X cr _i ID r- ~c ■* o OU.O «-»»-»-«-«inr«-ji »-—— — — U OCo»«©o _i_i_j_/-j« a^ cc cc a a a a a a • • • »••••♦♦*«•)« ♦ ♦ »«■♦«• « t --••♦♦ « — »» — -. — — © — ■ ©-»-Hi-f\ 5r7 2Z772r7«_C'C«-«.V.CC»_V_t_Z i/ if i/ if if if ir ir ifif^ifififififinififvirifif) If If V If If If If If If IT ^ ~ - _ww_«. .. ,/• u.U.u.t^luU'U.UJUUJUUUOCOOIJOUOUJ J- JJJJJJJJ72 777 ZZ Z7Z Z_) U o »- •- o « - _l UiUJ UJ • a a z l UJ o o c a uj _i z a t/> uj » • • Q ♦ «- ♦ U ©.- IV, c 7 Z Z Z O I- t- t- P- C « « < a > ■ i i — ■ U. U. u U. u a ar or a a tf U U U <_> — 7 « z < 3 »J C t- _!■-• 7 «« ■r r*> t) T © -- iv ■-' — ivj m # l/i -C r- XOO«-»f\jn^j%Xf^(rO * t) ®x <* o r> cr t> o o r> (7- ty o©ooo oo©oo C © © © 0©0 o© ©© OC c~~**~*~~_-«— «*__-• — — . © >^rvj m * ip (9 3 SB UJ e • m o - • B • © • » o • « o • • ♦ ♦ o ♦ «■ ♦ «■ © * ♦ o ♦ * o « ♦ © p- P- u o © O o C Z Z ~ c u o »- © O UJ u. tt o a o •- o o Z X l- © V o < © z c ? u w © *- C O C © is p- o © « © a * c «- « « u. o « O _l © ►- a © I/" p- t- ft © »- C U © a a O 1/1 IT « 3 o « o u. c c « © « c t- © o o c z ou * ■ (V • • * • ru • • o • » o • • ♦ ♦ c « » c ♦ ♦ © ♦ c ♦ © ♦ c ♦ 1 « C « t C * « c « t c t t C * i 1 I „ IV I 1 (V 1 1 — I I m rvi -• I I (V — 1 1 — ■" •" IV IV (V r- n ft •* •» * lTl/1 IT ♦«« ♦ * ♦ ♦ »-►->-»-►-►-►-»-»-•-•-►->-►-•->-»- CCCCCCC.CCC c c c c c c c yyy>>> >>■>>>->•> >>->>■ itujuju.uju:u.ujUjujuj u. u ii j u u il (TxXlrkkkkkkkkkkkxkk — (/> ir ir ir< if if if v if ir if ir ir i/ if ir if a ■ — ---.- UUUUUUUUUL'Ut'l.UUUUl. CZ7Z7Z7Z2 7 7 7 Z 7 2 ? ?? 7 4 oc»o— i\jcn*ir ^f^ cccr © — rv <*>* m -««iv/(\ji\jiv,i\ji\j i\ii\j MM fin n mi^n 86 Al o» • o • •©••© »• o » • • »o » • o m •■ O • •> a • • ©4-4- 4- 4 O 4 4- © 4-4-04- 4-04- 4- O 4- 4-04-4- O 4- 4 4- 4- O 4- 4- O 4- 4- o ♦ 4- o * «• e ►- o o c o Z UJ © _J_I O o »■* o Z o o o © 2 o _J o o O —• 12 Oil. O © O Z o o o o © C Z c U c «s c o © Z « © © U © c ? c ►- © o O O o z O (J o o ©13 OIKOO o —1 •-• O H- O o O i-i o UJ o »-• a o >- © O 4 <9 © 4 Z O i- o »- U. © 4 © © o »- © _J z © I K O ►- O V © O — 1 o O o « © o O o Z o T e a C Ui o o • • « ► Oo..O»»©» .p^»»r-»».*»« © • » • »o • • © • » o • • © • • (VI 4- 4- 4- 4--4>4-4-- — • • * 1 • * 11—11 o- o> © © c UJ • * * • • • • • • * * * • • ***»*•***« • • * • • * * ♦ * * _) ►- fr- t- »- 4- K »-►-►- »—»-•— 1- »- J-KKKKKt-t-h- »-K»-K»->-t-»-»-K •-K i- *- K K K ►- »- K ♦ it X * X X It X St X X It It X X XXXXXXXXX XXXXX XXXXX X X X * XX X X X X >■ X X X St * X x x it XXX X xxxxxxxxxx XXXXX XXXXX X X X X XX XXXXX o, a a a a a a. a a. a a. a a a. a a. a. a a. a. a a. a. 0.0.0.0,0.0.0.0.0,3. aa a a a a. a a. o. a. a * X 1 3 X X 11 X XXX X xxxxxxxxxx xxxxxxxxxx X X X X XXX XX X VI 4 ♦ ♦ ♦ « 4 ♦ ♦ 44 ♦♦♦44 « 4> ♦ * 4> 44 ♦♦♦ «4«44 44 4 4*4 4 4 c c c c o c c c c c ee ecococeceococacccc cc c c c c c c c cocc « 3ZXXXX 1] XXJTXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 3 13- >>>>■>>>>>>>■>>■>'>■>■>>>>>■>■>>■>>>>>■>>■>>>>>■>■>■>> >->->c bJWUJ UJUJUJUJUJUJUJ UJ UJ UJ UJ Ul UJ UJ UJ UJ UJ UJ UJ UJ Uj UJ UJ UJ UJ UJ UJ UJbJ UJ U. UJ Uj UJ UJ UJ UJ Uj UJ UJ Jt XkXkkXXXXXXXXXXXXXXXXXXXXXXXXkXXXXXXXXXXXXXC v \r i/ tr v \r it (JOU CUUUUOUUU UUU (JOUUO UUUUUUUUUUOUUUUUU (JUUUUUUJ 7'Z?i-Z.?Z????7-Z?-2.-Z-Z??2-Z-ZZ.7?-ZZ7?-Z-ZZ*-Z?.-Z?.Z.-Z-Z2.Z-i.-2*.'~ o Q « C I- _( -■ Z X -3 U' *M ff C ^ 111 n* ijT- « h- *» 0~(V (*>'4>l/l'CKlfl«^ IT^O^Mm * Jl Jj M 0»O i*!!*! i*in ♦ -» * * * ■* •+ ■* -4 ■* \i\j) \n mininirmiriA«4i«««««4 o«r»Kr-f^^^r-r»^^«> o 9 C t- BO « Uj •_ c « Ox - I « _| _ c a a a 'j- • » • • 4-4-4-4 t t * 4 — (V n -» is z z z r _ : * z z z l_ f IA U" I/ 1 <5 (/• IT IT IT T U. Ul UJ u. C _J _l _J -I I- t. 87 Ul c 19 (9 Z UOI/I *M (j a o X z a o 3 C W 7 « C r •- ►- a x C _J Uj IS »- uj a x O UJ ISI i/> (flff I *- u. o -a Z — _» Z Z O UJ JQ.H uj r _i x a. x o r» x o or uj — z K ui« « Z »- Z un — V )-U UC 4 ►- U. •• «h » IT k U IV k- IT IT J4-4. V 1/1 O UJ UJ in « — o « lt-t- JL. >• •- a c c 4- o z «• 4u.Cu.ir 3 X X U *■ ♦ « ♦ Z _i «9 U 4 — ♦>••- u — a i a » a Uj 4- o at ■« ►- o X c 4- U. z Z >. x o » v UJ z c U. I >- _jk- •/> » 4 Z 4 Z a u. u o ♦ _i 4- a T UJ X 4- 04- c c T ►- ♦ r ar uj uj ♦ O 4^ B o o o o o o o o o o o UJ 3 UJ - t~ 4 Z (/> o o o a o o o o o o o • C C c ti r 3 c 4- K C c c c o c. c o c c o e a f ♦ ►- « u a ♦ ►- a e a c c o o o o c c o o o ~ ft. UJ V z o x k- UJ Z O O c o o o o o o o o o a • * 4- z « c * z > 4- J O o o o o o o o o o o UJ ff • • ~ C X 2 U i C C * O o o o o o o c o o o c U" ♦ ♦ Z a — ♦ o u. •— u o c o o o o o o o o o o o • ♦ 4 ♦ ♦ 4 o z 4- •-• O ♦ 4- J>- O o o o o o o o o o o a a c 4- *— tk ►- Z >- l_J X _l O c O 4 o o o l\J o o c c c _ 4- ♦ : a « •- 4 ~ < 4 ? C o o •- o * c ftj o o o u o k a « C< J7 c K CO c- © o o o o © o o *- < •« < •D « -1 _ O » 3 Z — O UJ ll/l O i/l 4- o O u"l o M O O ftj >- t-» 4- a «I _i 3 v ar »- u- v or « o — — «M O O o o o * ♦ ar uj « u. 3 — • -1 >- X -j >- u j a j 4— UJ -J UJ « o * * o o * * © o — o 4- c — «3 X .— c — * Z C « U ♦ Z X _' 1" « « u- < RJ k- p« o 4M -- _• ►- f- z — — — — —l c i/i a » o as a. ~- 4- « ♦ O c o © o o o o — * © u u «r c _ J _ Q a ♦ 4 4 ♦ « • 4 4 ♦ • • c ■» « c c « •« « « r- r- ^ u I a C^ a c riif if n c c c c m c c c © © c c _, at # ♦ • ♦ ♦ _ rv d ♦ it * k- X o> •> — o o C C O O O o o u o • t « t o t 4. i 1 • »- k- kkkKh p. 4- 4- 4- » 4 « « * * 1 t « l/> Uf — m c l- u t- <_> c c c c u o «■ «i * IS C _ a or at ar ot at a a a if * k a ^ — - ►- 4- ►- >- t- >- >- 4- 4- 4- 4- — fv r- < ir •€ r- X 0> ^ — p4 D c ir W is is is is is 1/ C u 3 1 a a a a a X a a a u u. u. UJ u. u. u Uj U UJ u. Pi t; c 1 3 I T I o o e o o oc o o X p» 7 » 7 r 7 7 7 c c c c c c c c c c z u ~ 1/ 1/ i s r i i j i j » i > > > >■ > > V >■ > >■ > tr 4- u. u. u. W u. . u lAJ U~ UJ UJ UJ kk UJ UJ uj uj uj u. u. UJ UJ UJ UJ UJ UJUJ UJ UJ UJ J C i/> _/ -' -J -' _J _1 -I p- 4- 4-4-4-4-4- 4- 4- 4- 4- 44 If . . . • • K It X X _/ — 4 o — . » » '.4Y»r>r»**l. oaaaaaa aaaa o o -^ © o o o o o o CCC©C OOC© it©***-* ^ ir«# ritr c^ccc cccc ©oo©o ©o oo — ^ i — to no -*r- cc— ftft.«^«<< cccc© cc oc ocooo occo eooo© cc cc • ococo cocc • » » » »• - •»*-rno©oono©© 4- 4- 4 4 4 4 4 4 4 — OOOO— OOO *4ioooc r"o cc — o c c o — ccc — < o o © c — occ _________ I -40000 OOOO uj ZX> XX « o u. a or ooooo oooo — _ f\J ^ ■# LP IP ^3 k-O ooooo OOOO coccoccoc— CCCCCCCCC pap* -. _ — «^-._i/i «-UU uuuoo u • »«-»«-»»•'»» 4-4-4-4-4-4-4-4-4- ««JUUUUUOtJU i«t«.———— — —ISVISISVtSUISIS 7ZZ7T-ZT77* ******** -C UjUJUJ uj uj uj UJ u. UJUJ -MT 4 iT ^>4- CC (T i: luuuucuii Lt t • •• •• • • » ro;ttOttaaaaaa , » w i r i'i''^'*"'''*'f r UJ £ coccc 6c CC UUC UCOt-O (_' OOOU(JUUUUO(_)Z 2 7 ? 7 7 ~ 7 - 4 Z C 4- — _» -• z « ' u • • a "kc — ftj r>> « ir < «? k- T o» o -• ft. r) * (p ^p. C g> OMivn < i/iji Mi>a e r» » CkO k o*o > jkO > 0» o^oooooooooo-^-^ — — — -«— «-<—(m -•——.««-..<—, _ _ — ■ — — •ftjrvjftjftjftjftjftjftjrurvftJftJMftjftJftJftJftJftJftJM NIMIMMNNNNNni'll'Ifln^l'li'K'in* ftjftjftjftjftjftj ftjftjftjftjnj ftjftjftjftjft; ftjftjftjftj in e O OD o as UJ o CM 19 CO X 3) o o o o a o — * o ►- c o o * u r o- U c i" u >-« O < c H- -J •"-• Z X - u, • (V IV M IV c X I u in a CO 3 >* X •- <_ u. a t- « if LU c If Q. ¥ (J « C 3 UJ 4 3 * 3 I tx- _J l/l LP <0 f- CO f\j (\i evj rvi * o I U — in o a 3 to i • c to — — if 3 3* (V I X •- IE C (. • = a a rv 3 « « *- Lu UJ UJ U C I/" IT Z ►- C 3 3 ■1 •* 3 3 Z 3 I X ;: _j to to o- o -« iv * If i IT) 10 (V M M <\j pi IT (V (0 It! c o u i/i (9 3 C c a 4- «-«-«- 4- 4-4-4-4- 4- 4 4- 4- 4- * 11 (V o r>- <\j ooo p) p> (V P) p- .- or>„ » » 4- «• •* ^ (X) o CD O p> © cc co « in (\i p> * M ■» n n om« r- e o •- in — ■ « OJ • » • » «■«■«■ «■ * * * t (V ■- P^ IV •• If r- * cc -« in •» r- cc c * 4*4*4- t t * t t lOCE 00 inuj - 3 IM - ) z ■* — z -•-> t» Z< U -» C! K « r- ►- id io c o- lf> * * 4<4 r r- r- n- a w* •-• — IV IV IV fv IV IN p* i\j • & w* \t o •• i/> O ~* o o © © o ^> IV IV • O M o o o o o —• o o a O o c © o o o c c c c c o c c o c c c c c o o o o o o o o c- o o o o o o o o o o o o o o o o o o o o o o CI o o o o o o o o p4 o c o o coo o c o — ►- o c o o o o o o o n • ■a c r c -» •• — h- c IT ■» 7 IT * IT r* i\j ir — IT (V r~ _J IT ■f r* c — iv r- r- c o »- o o o — — ■ — t — o o o D c 2 o o o c t * o * » « t t * t t ^ _ c/ ^ c u ivr j u « k a o — — •- ooccocosocc *■< «r «• < ««<<« <: v >/ \r tsvirt/iisvirir oouououuou o 7ZZ2Z?Z?irZ- o a m c »- _i ~ z * r bi • r\j rv IVIVIVOJIVIVIVIVIVIVIV « ir r> ■• ^ c -. (v * it in ir KIT ->l" IV' — © < o © o © o o o o © © © © o o o o © © © © o o © © © o o o © o o o ■O <*> O 4 n it IV — iv r •• © © o o C C C c •v IV IT < IT IT * o IV o o o o o o o o o o o o o © e o o m o •• if o o c c « t t « t « t IX V - — IT — IV o o o o o o o o o © o o o o o o o o o o o o o o o o o © o © o o o o o © C p- c c o o o o o o o o o o o o o o o o o o c o o o — © © — o o » o o o iv it a OCU a * « V u. \r z i"" ■• \t 4 *- a I «J u o u O Z 7 2 Z z « 3 U c uouooovjua zz zzzzzz c a 9 « UJ c c -J z => • X V OxIM 0> » o o o If) -1 ♦ u e z a i/i »- _i • * — in o a n o * a * i c X — t- o u — u. K X > u< t- IT • «r z — a. r iv C u e u c r i/ t- r ir a r a c (/• cr c < a U IT OU I UU 3 — a c — i/> c z»-ot o»-i OX — • — rvrviviMfvrv 90 i 00 ■# > IT ■cc ■r or pi CD <\J OD CVI «\. 00 ao— <— <^.#aD4>-£F»-9— ' M OS i fffcirrKM^ Vc civcKcirtccc ~ ■« ir h- oo «•"■ r> •« (Vir»r»co(tfv. < 4Mfv o>an!ir#o)«-i--fuuio <-to*aoin»»>or-f»)0><*)(*»eO'*-«m(\i(\if»»z(\iftJin — — • _ „ — _ „ _ « _ .- „ ,- _ ._ c — eo r- *■> <*i oo in r-- ~t t\t *- *1 r+ oj r> (»> n <\j (\j o 2 z c >- ISC in a a oa * i/> 3 3 Ilfll u. *- *: * a u. — ■ b n - oocca.zo:_j*->»-a:«-> >o x0MU|H0HU\3OIAUni -LIU.J21-X04- (J K Z _l »- CCC>>irii7tt(f>-KU" UJ _J —i _. U. a. c c c c c c c a a or c c <_;»-»- t- u o U- 2 2 Zli.li. c c c c c r •- e c i_ »■ — i/> O o or ol o UJ o J I/)U13 or c e e _> o a «_ c i. c u: /) 3 3 3 3 3 r -.-.-.-. -. 91 ■o (V in ■c fVJ 4 — o rw IT *■ MSC •♦ 4 in <*> <*» (v r I/I w z Z uj c a UJ u ■».£> — *> .C XI l\ O <»> IT CD iv««~r. « •* * ^ k ♦ ct*»»»*N*Cf>r?*«vo>'«-««ir« , inirr-r"Kr-h-Kt»K«»c « » « — oo-— .,o-»r^»r^oor--iji<''>r-in<*icOf\j.o'*i-» — — — smcifoofM^nr- nil o- i\j r~ * » (M — -c o- ■»r\j«moZP'*irr-oiri«»a)«— o r- i- c< — ■ «in r^p-aDr>--« t? — .- C — c C U •- c 1 c w »- Jl-L JluUL (JU « IS" IS « C IS If 1/1/ •- u u — c u. u U u. — aQ-li.QDx«-«"DQ r_i_rc_/_uu.uj_'_i •- i/ i/ — i-i/ i/ j ii/tr IM IV t/i m um uu i/iu>i/iu> u isi aaacaca ira ci/aai/aais. aai/ ace IbC U: JC Jill U.C C li UC UJIS C k'V Wlu c ■ in>-l/10»-DI/l~0[l-«Oftl/H-ttOI-«L)l/ltt««'->-»<«-««>"t-CO a»-at->-t-a>>Q>-»u.oo — a _ ~ Q—aoxxxxxxxx'-KK- ll.lllli;CCC a ua u u u o .iruji-vauiSLiLisoav i_j_._i_j__-u.uu. c - f c u i_) u — uj _j a. s is u a j u i/i o J i/) - z caa-Qr^zz«- 7 I 23X 1 - C I > 1 * * ~ >- uj i/i -> o i/i z>- imi z ii-i-iuoui _• >- zum ooi-Kjinzi>-^uu3ui/<<--i'C«uiic<«<5«e«jjii. c , »>»"-»»ci/*-_'u»-QQ»-ci-»uou«'C-'_auai.c-cco » Zll/llAiJ3IXl/lliJullJUUlUyUll.J30I4& 4UUUIItlVI>-l- -•-•-•»--«_i_i_i_iz_zzzzzzzzzzzzo_a:i/ii/>i/»i/>i/>i/>is»i/> 4 1JZX JOuli-i- 92 a • • — 1- UL' u", ouu K o tr v £ • — •— v •- — I 2 t- ir t\ a a 2. -» tr v- \- • ►- • • •~ w u. • x o r^ r x u- uioo — •— i una. -l « « _i 3. a k o a A p- r* r- f^ f f^ IT IT tv r\jrv> t\. <\j r\j fvj m (*! • • • • • • • • V » a> a CJ- a a C BIBLIOGRAPHIC DATA SHEET 1. Report No. UIUCDCS-R-73-587 3. Recipient's Accession No. 4. Title and Subtitle GUIDE-0 --AN EXPERIMENTAL INFORMATION SYSTEM 5. Report Date August, 1973 6. 7. Author(s) Shinnichi Murai 8. Performing Organization Rept. No. 9. Performing Organization Name and Address Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801 10. Project/Task/Work Unit No. 11. Contract /Grant No. NSF G J- 31222 12. Sponsoring Organization Name and Address National Science Foundation Washington, D.C. 13. Type of Report & Period Covered 14. 15. Supplementary Notes 16. Abstracts The experimental information system GUIDE-0 is a bibliographic aid for those students who are taking the introductory computer science courses some of the material of which are implemented as PLATO-IV lessons. The functions, the data base and the detailed description of each module of the system are presented. 17. Key Words and Document Analysis. 17a. Descriptors information retrieval, information systems conversational information system interactive information system computer-assisted instruction data base 17b. Identifiers/Open-Ended Terms 7c. ( OSAT! I- ic Id/Group '8. Availabiliry Statement release unlimited 19. Security Class (This Report) UNCLASSIFIED 20. Security (lass (This Page UNCLASSIFIED 21. No. of Pages 101 22. Price ORM N TI3- 18 (10-70) USCOMM-DC 40329-P71 V A JUL 25^* c,