UNIVERSITY OF ILLINOIS LIBRARY AT URBANA-CHAMPAIGN CENTRAL CIRCULATION BOOKSTACKS The person charging this material is re- sponsible for its renewal or its return to the library from which it was borrowed on or before the Latest Date stamped below. You may be charged a minimum fee of $75.00 for each lost book. Theft, mutilation, and underlining of books are reasons for disciplinary action and may result in dismissal from the University. TO RENEW CALL TELEPHONE CENTER, 333-8400 UNIVERSITY OF ILLINOIS LIBRARY AT URBANA-CHAMPAIGN JAN 6 1Q97 When renewing by phone, write new due date below previous due date. L162 no. 949 UIUCDCS-R-T9-9 1 +9 Flxtli < UILU-ENG 79 1729 July 1979 THE UNI CLASS INDUCTIVE PROGRAM AQJUNI PROGRAM IMPLEMENTATION AND USER'S GUIDE *y ROBERT STEPP Digitized by the Internet Archive in 2013 http://archive.org/details/uniclassinductiv949step Report No. UIUCDCS-R-79-9^9 The Uniclass Inductive Program AQ7UNI t Program Implementation and User's Guide by Robert Stepp July 1979 Department of Computer Science University of Illinois at Urbana -Champaign Urbana, Illinois 61801 This work was supported in part by the National Science Foundation under Grant NSF MCS 79-06614. ABSTRACT This paper contains implementation notes and user's guide for an inductive program (AQ 7 UNI ) which given a set of events (via an integer-valued feature vector for each object), generates one or more characterizations of those events, expressed in the form of VI4 expressions. Variable-valued Logic System VLi is a monadic predicate calculus in which rules can be formed which describe single events or sets of events. The VT4 characterization is a generalization of the descriptions of the event examples given to the program. The degree of generalization is controlled by the user. AQ7UNI belongs to a family of programs which employ quasi- extremal optimality techniques. Data input formats are highly compatible with the discrimination generating program AQVAL/1 (AQ?) . A variety of operational parameters are provided to direct the generalization processes and to determine the quasi-optimality judging criteria and tolerances. CONTENTS Background : The Uniclass Algorithm 1 Program Implementation Notes 8 User's Guide 16 Appendix It Program Listing 37 Appendix lit Sample Input Stream 57 Appendix III: Sample Output 6*4- Backg ro und The uniclass inductive program AQ7UNI accepts a set of symbolic descriptions (events) of arbitrary objects and produces a general description (characterization) of the set, expressed in the language VL^ (Variable-valued Logic system 1 [Michalski 7^» 75]). This report describes the AQ7UNI program and explains how to use it. The Uniclass Algorithm The basic uniclass algorithm was developed by R. S. Michalski and was partially implemented by a student at the University of Illinois, H. Yuen. The following discussion will explain the algorithm as it exists in a modified and extended form which is the basis for the implementation of the inductive program AQ7UNI , version 2. In the VI4 system [Michalski 7^0 1 a cover for a class of events is a logical formula which is the disjunction of logical expressions called term s. It has already been shown, by examples, how a term is the product of selectors, and how a term may be satisfied by one or more events. A complex is a subset of the set of all points in the event space. For every term there is an associated complex composed of all those points in the event space at which the term is satisfied. Some complexes cannot be represented by a single term. Such complexes will be purposely avoided by requiring that any complex by exactly described by some term, and with thi3 constraint terms and complexes become equivalent, one making: a logical statement, the other a set-theoretical statement, about the same situation. Throughout the remainder of this pap<»r the words "term" and "complex" will be used interchangeably, each connoting the hidden properties of th» other. A cover is a set of complexes (a list of terms) such that every event is in the union of the complexes. If the intersection of any two distinct complexes is non-empty, the complexes are intersecting , otherwise they are dis jo int . The variables in system VL* may be of nominal or interval scale. Nominal scale variables may be simple, called FACTOR type variables, or generalization tree structured, called STRUCTURED type variables. Interval scale variables are called INTERVAL type variables. A syntactic limitation is built into the VL^ selector reference set notation. FACTOR variable reference sets may be any powerset of the domain of the variable. STRUCTURED variable reference sets must be a single leaf or nod* in the generalization tree. INTERVAL variable reference sets must be a single interval subset of the domain of the variable. Pecause of term/complex equivalency, these syntactic restrictions also further restrict the subsets of events which are legal complexes. Some definitions are needed to assist with a formal presentation of the uniclass algorithm. varia b le X^ Xi l HALT: the disjunction > of the elements of COVER is the uniclass characterization. J build neighborhoods: (l and on each iteration another complex in the cover is produced, and the events which it covers are removed from Er. step li Build neighborhoods. A number (given by the user) of "neighborhoods" are constructed. A neighborhood is a set of events E^ such that for each event e' in E^ t R(e',seed) is not greater than a limit rank set by the user. "Seed" is an event selected arbitrarily from the set Er and is unique to each neighborhood constructed. C(E^) is the complex which covers the events En. The degree of generalization of C(E^) is determined by the set Ejyj. During the neighborhood construction process some events are either excluded from E^ or forced into E N in order to satisfy the user-given constraints of density threshold and/or selector threshold. step 2t Select best neighborhood. A quasi-optimal neighborhood is selected according to one or more neighborhood judging criteria (ties are broken by making an arbitrary choice). Seven criteria are defined as follows. criterion It the number of complexes in the cover (estimated as the negative of the number of events in E R covered by the complex) criterion 2: the number of selectors in a complex criterion 3: the sum of the costs of the variables in a formula (costs supplied by the user) criterion ^: the degree of generalization (estimated as l/D(C(E N ))) criterion 5« "the sum of weights of the events covered by the complex (weights supplied by the user) criterion 6: the length of references (£ s^) criterion 7 '• the relative scope of references (the sum of the mean deviations for all variables) These criteria are identical to the criteria available in program AQ7 [Larson & Michalski 753 • Neighborhood judging may be based on several criteria, applied in an ordering determined by the user. A tolerance value is specified for each and at each step of the judging, a neighborhood is eliminated if its criteria value is greater than an upper bound calculated as UBOUND = MIN + TOLERANCE * (MAX-MIN). step 3s Processing the chosen neighborhood. The best neighborhood represents a complex C(E^) which will be saved to become one complex in the cover of the events. The events in E are eliminated from E R and from other neighborhoods which were not selected. 8 AQ7UNI Program Implementation Notes AQ7UNI is a 1280 statement PL/l program which will run in l^OK bytes of memory. The source listing for AQ7UNI has been reproduced in Appendix I and you are directed to that listing for detailed information. The following block diagram shows the procedures into which the program is divided. Each block in the diagram will be discussed briefly. AQ7UNI - read first set of keyword data BLKA - read domain definitions, variable definitions BLKB - read criteria specs, event data, uniclass keywords BLKC - generate a characterization NEXTSEED select a new SEED event CRITVAL evaluate neighborhoods PR COVER print VLj rules NGBREPORT (diagnostic aid) PUTEVTS NGBRHD RANKCHAIN ECOV GENERALIZE DROPSEL build a neighborh ood POPULATION NUM READVEC READGAM Figure 2 AQ7UNI The main program block is responsible for beginning to set up the environmental data needed later. The first set of keyword data (NGE,NMQ,LQTRACE,STRACE,QLQT.QST,PNTE, MODE , SAVE , SAVELQ , MAXSTAR , CUTSTAR , I NFORM .TITLE , LQST , CLASSES , MAXNV .DOMAINS, NAMES, MAXNAMELEN.STLVLS) is read by the main block. Each problem starts out here and then control flows to BLKA, BLKB, and BLKC as more parameters are read and evaluated. BLKA BLKA is responsible for reading domain definitions, variable definitions, the number of levels for each variable and the number of classes and the number of sample events in each. BLKB BLKB takes over and reads the ordering information, the criteria specification, the event data, and the uniclass keyword data ( UNI CLASS, QUT, UNI TR ACE, SAVEC ) . Then BLKB reads in each characterization specification (the number of such specifications is given by the UNICLASS keyword parameter). Block BLKC is invoked for each characterization. BLKC Most of the work is done here and BLKC is built much as the flow chart on page 8 indicates. Using the ULIST variable, the event set E R is built from the events in the indicated classes. E R is actually a bit string in the program with each event represented by a unique bit. 10 As long as the bit string is not all zero, neighborhoods are constructed using the NGBRHD procedure and the CRITVAL procedure then determines which one is quasi-optimal according to the criteria requested. As each neighborhood is being built up, a record is kept (as a bit string) of each event which the complex of the neighborhood, C(E») covers. After CRITVAL has determined which neighborhood is the best, the set E R is updated via a simple bit string operation to remove those bits corresponding to covered events, i.e. events in E... The POPULATION procedure can count the bits in a bit string whenever a population count is necessary. When E R becomes empty, the procedure PRCOVER is used to convert the internal representation of the complex into standard notation and print the results. NEXTSEED The NEXTSEED procedure selects an arbitrary event from E R for use as the seed event in neighborhood construction. CRITVAL CRITVAL applies whatever criteria the user requests to all existing neighborhoods and then makes a selection of the neighborhood which is optimal according to the criteria used. PRCOVER PRCOVER prints out the complexes given a bit string which is the internal form for both complexes and events. PRCOVER also has access to the variable and value names 11 tables. Numeric variable values and event data values are used throughout the program from input up to the time to print the complex. User supplied names are substituted for numeric values as the complexes are printed out. NGBREPORT The NGBREPORT procedure is used only when the "quick trace" is active (the QUT parameter). NGBREPORT prints data associated with each neighborhood on each cycle of the program. The internal procedure PUTEVTS is used to print lists of events which are included in the neighborhood POPULATION POPULATION counts one bits in a bit string. Since extensive use is made of bit strings in AQ7UNI, an efficient population count procedure is important. NUM NUM is a utility procedure which can convert a number to a varying length character string, or to the correct special name associated with the given value. NUM is used most by the PRCOVER procedure. READVEC READVEC reads event data which is in vector format. READGAM READGAM reads event data which is in gamma format. Gamma format is not often used and is described fully in [Larson 751* 12 NGBRHD NGBRHD builds neighborhoods around a given seed event The algorithm for neighborhood construction is given in [Stepp 79] and in figure 3. The procedure RANKCHAIN creates RANK+1 singly linked lists of events of E R according to their rank with respect to the seed event. NGBRHD then goes through a trial and error procedure of adding events to the neighborhood, first an entire chain of events of the same rank at a time, but later, event by event until it can go no further. The last legal neighborhood under the constraints of rank, disjointness (optional), density threshold, and selector threshold is the final result. Along the way, the GENERALIZE procedure is used to edit the values which interval or structure variables may take. If the selector threshold is not satisfied by the final arrangement, the DROPSEL procedure is used to further reduce the number of selectors. NGBRHD reports the density of its result and gives bit strings which indicate which events the neighborhood covers. ECOV ECOV checks lists of events to determine which ones are covered by the complex for a neighborhood. The test involves only simple bit string operations. Build Ne lRhborhooda 13 empty a] 1 1 1 n t a Li (lRANK add events on list L r to E N count the selectors in C(E N ) add e to list of rank RANK+1 remove events on list L r from E N someadded* N o select first event e on list L_ add event e to E„ r»r+li HALT if r>RANK Bomeadded^No select next event in E R -(SEED} remove event e from E and add it to list L r+1 aomeadded=Yes Legend i SEED Ep i Lii RAMK Em I C(Em STi DTi D(C) select next event e on list L i an event which was selected from Eq the set of events remaining to be covered a list of events whose distance to SEED (measured by R ) Is i i a rank limit Imposed by the user the set of events belonging to the neighborhood ) i the smallest single complex covering the events Efj the maximum-number-of-selectors threshold the minimum-density threshold i the density of complex C Neighborhood Construction Figure 3 14 GENERALIZE GENERALIZE extends the reference set for variables of interval or structure type. Interval variables are extended by filling in gaps of missing values in an enclosing interval, because in system VLj , the reference set for a variable of interval type must be a single closed interval. Structure variables are extended by finding a common node in the variable structure which encompasses all values present. After GENERALIZE, every interval variable has a reference set which represents only one interval and every structure variable has a reference set which represents a particular node in the structure tree. DROPSEL The selector threshold parameter is used to cause all but a certain number of selectors to be extended and dropped. Sometimes the neighborhood construction process is not sufficient to obtain the desired number of selectors. (That is not surprising since the neighborhood construction process is not involved with the number of selectors.) When the number of selectors remains too large, DROPSEL finds and extends references on certain selectors so that they are eliminated. First, variables of factor type are considered. DROPSEL eliminates those with the highest fraction of their domain in the reference set. If that does not reduce the 15 selector count sufficiently, then all variables are considered and again those with the highest fraction of the domain already present in the reference set are eliminated* When AQ7UNI is producing disjoint complexes, care is taken not to eliminate any variable needed to maintain disjointness. When disjoint complexes are being generated, DROPSEL may not always be able to reduce the number of selectors to the limit given by the selector threshold, A note About the Internal Bit Representation of Events Individual events and complexes are represented within AQ7UNI as bit strings. The strings are all the same length, with a bit for each value of each variable. This works because AQ7UNI permits only integer values for its variables and the underlying numerical domains of all variables begin with zero. In actual practice, more than the minimum number of bits are consumed, so as to be able to align the 0-bit for each variable at a character (byte) boundary. Whenever possible, the bit strings are operated on as character strings to improve program efficiency. 16 User's Guide for Uniclass Program AQ7UNI (This user's guide is for version 2 of AQ7UNI - November 1978.) Robert Stepp 17 Introduction AQ7UNI Version 2 is a PL/l program which can accept one or more descriptions of classes of events and generate one or more characterizations for each. The input formats are purposefully similar to those used by AQVAL/1 (AQ7) [Larson 75D. Only a few statements of uniclass parameters need be appended to data already set up for AQVAL/1 (AQ7) to use AQ7UNI to generate characterizations of the events. Version 2 of AQ7UNI supports the following parameters and features not available in previous versions. - interval variable domains - structured variable domains - user selected judging criteria - domain definitions with symbolic assignments to variables and their values Input Parameters Input to AQ7UNI is defined below. Many input specifications match those of AQVAL/l (AQ7). though some of the parameters for AQVAL/1 (AQ7) are accepted by AQ7UNI but cause no action. The parameters for AQ7UNI are either simply numbers separated from each other by blanks, or keyword expressions. Whenever simple numerical values are called for they must be coded. Keyword expressions, however, need not be coded when the default value is desired. 18 MODE= default i M0DE='IC possible valuest *IC , t 'DC, , VL*. MODE is an AQVAL/l parameter not used by AQ7UNI, INFORM= defaultt INFORM=' VECTOR' possible values « 'VECTOR', 'GAMMAS INFORM determines the format of the event description. TITLE= default! TITLE=0 possible valuesj any non-negative integer, TITLE specifies the number of lines of title data. MAXSTAR= defaultj MAXSTAR=150 possible valuesi any positive integer less than NGE, MAXSTAR is an AQVAL/l parameter not used by AQ7UNI. CUTSTAR= default: CUTSTAR=50 possible valuesi any positive Integer less than NGE» CUTSTAR is an AQVAL/l parameter not used by AQ7UNI. NGE» default! NGE=200 possible values! any positive integer r NGE is an AQVAL/l parameter not used by AQ7UNI, NMQa default! NMQ=35 possible valuesi any positive integer, NMQ defines the storage area for the final output complexes generated by AQ7UNI, 19 LQST= de fault t LQST='1*B possible values: 'O'B, 'l'B, LQST is an AQVAL/l parameter not used by AQ7UNI. SAVE= default i SAVE^'O'B possible values: 'O'B, 'l'B, SAVE is an AQVAL/l parameter not used by AQ7UNI. QLQT= default: QLQT='0'B possible values: 'O'B, 'l'B. QLQT is an AQVAL/l parameter not used by AQ7UNI, LQTRACE= default: LQTRACE='0'B possible values: 'O'B, 'l'B. LQTRACE is an AQVAL/l parameter not used by AQ7UNI. STRACE= default: STRACE^'O'B possible values: 'O'B, 'l'B* STRACE is an AQVAL/l parameter not used by AQ7UNI QST= default: QST='0'B possible values: 'O'B, 'l'B. QST is an AQVAL/l parameter not used by AQ7UNI, 20 SAVELQ- de fault i SAVELQ- • • B possible values i 'O'B, 'l'B SAVELQ is an undocumented AQVAL/l parameter not used by AQ7UNI PNTE- de fault t PNTE- 'l'B possible valuesj 'O'B, 'l'B PNTE controls the printing of the input event sets. PNTE- 'l'B causes printing to be performed. CLASSES- default i CLASSES-32 possible values i any non-negative integer CLASSES specifies the maximum number of event classes. MAXNV- default i MAXNV- 32 possible value s i any non-negative integer MAXNV specifies the maximum number of variables. DOMAINS- default! DOMAINS-0 possible values i any non-negative integer DOMAINS specifies the number of domain definitions. When D0MAINS>0 domain definition parameters are required. See the special section on domain definitions. 21 NAMES- default i NAMES- possible values « any non-negative integer NAMES specifies the maximum number of symbolic names for data values which may be defined. (See the section on domain definitions). MAXNAMELEN- defaulti MAXNAMELEN-8 possible values* any non-negative integer MAXNAMELEN specifies the maximum length of any name in characters. Names longer than this will be truncated. STLVLS- default i STLVLS-0 possible values: any non-negative integer STLVLS specifies the maximum number of structured variable levels. (See the section on domain definitions) . This ends the first group of keyword parameters. A semi-colon must be typed to separate these keywords from the following data items. Title datai As many lines of title data as were specified via the TITLE* parameter should be included at this point in the input stream. 22 Variable definition datai Notei if DOMAINS- is specified and given a value greater than zero, then see the section on domain definition for parameters to be used in lieu of the following items. One of the following specifications must appear, (a) n 'FACTOR 1 (b) n 'INTERVAL* default i no default example i 2 'FACTOR' 1 b The n numbers on the right denote variables which are of the type indicated (either interval variables or factor variables). Variables not mentioned are assigned the opposite variable type. Structure variables can be defined only via domain definition (see section on domain definition). None of the editorial symbols "(a)", "(b)", "<", or M >" are actually coded. number of levels per variable i n, default t no default example* 4, 5 3 2^ The n numbers on the right indicate the number of levels of each of the n variables respectively starting with variable X^. 23 number of events per event class t n, default i no default example i 3, 5 4 10 The n numbers on the right indicate the number of events in each event class. These events are defined later on in the input stream, ordering information i integers separated by spaces Ordering information consists of a permutation of the sequence of integers f l f ... up to one less than the number of classes, criteria specification: n, , Up to seven user criteria may be specified. The criteria are defined in the body of this report. The integers serve to identify which criterion is to be used while the real numbers give the tolerance value s • example i 2, 4 6, 0.0 0.5 The example indicates two criteria will be used. Criterion #4 will be applied first with a tolerance of 0.0. Then criterion #6 will be applied with a tolerance of 0.5« 24 event data* At this point in the input stream place a vector of numbers (if I NFORM»' VECTOR' ) or a single number (if INFORM- 'GAMMA' ) to describe each event. Events must be grouped by class and appear in class order. Z and/or W value st Z values are the costs for each variable. W values are the costs for each event. These values are to be coded only if criterion numbers 3 and/or 5 are used as criteria specifications. If criterion 3 is used, then any number of specifications of the following form may be given. After the last one code a semi-colon. Z(i)- defaulti Z(i)»1.0 Z(i) specifies the cost for variable i If criterion 5 is used, then any number of specifications of the following form may be given. After the last one code a semi-colon. W(c,n)» defaults W(c,n)al.O W(c,n) specifies the cost for the nth event defined for class c. If both criterion 3 and criterion 5 are specified, then code a set of Z specifications and a set of W specifications with the Z's first if criterion 3 occurs first in the criterion list and with the 25 W*s first if criterion 5 occurs first in the list. This concludes the parameter specifications which AQ7UNI and AQVAL/l (AQ7) have in common. The following parameters are peculiar to AQ7UNI. uniclass parameters « UNI CLASS* default i UNICLASSaO possible values j any non-negative integer UNICLASS specifies the number of uniclass character- izations to be performed on the event data. QUT= default: QUTs'O'B possible values: 'O'B, 'l'B QUT controls an informative "quick trace" of the neighborhood construction process. UNITRACE= default: UNITRACEs'O'B possible values: *0 , B, '1*B UNITRACE controls the printing of detailed internal data. SAVEC= default: SAVECa'O'B possible values: 'O'B, •1 , B SAVEC determines whether characterization complexes are to be written in internal form to a file with DDname COVER. No such output is produced when 26 SAVEC-'O'B. A semi-colon must be coded after these keyword parameters. The following group of specifications occur as many times as the value of the UNICLASS parameter above. Each group of specifications pertains to one characterization performed. MODE- default i MODE-* R EL* possible values t •REL*, •EXACT*, 'aPPROX 1 , •FREE 1 MODE controls the density threshold value. With MODE* 'EXACT 1 the density threshold is set to 1.0. With MODE- 'FREE 1 the density threshold is 0.0. With MODEa 1 APPROX* the density threshold is given by the DT» parameter and with MODE-'REL* the density threshold is the product of the value given by the DT» parameter and the density of the learning sample in the event space. DT» defaults DT-0.0 possible values i any non-negative real number The DT value is used only when MODE is 'APPROX* or 'REL*. ST» default i ST»number of variables possible values i any positive integer 27 The ST parameter gives the maximum number of selectors any single complex is to contain. RANK= default i RANK-number of variables possible values i any non-negative integer RANK limits the degree of dissimilarity between events which make up neighborhoods. NGB= default: NGB=3 possible value si any integer greater than 3 NGB specifies the number of neighborhoods built in parallel and from which the quasi-optimal one is chosen. Characterizations should improve as NGB approaches the number of events in the learning sample, but process time grows in proportion to NGB as well. TYPE= default: TYPEa'IC' possible values: *IC , t 'DC* TYPE determines whether intersecting ('IC 1 ) or disjoint ('DC') complexes are to be produced. NCRIT- default: NCRIT=0 possible values: an integer from to 7 NCRIT specifies the number of user selected criteria choices to be made. 28 ULIST- default i a bit string of all ones possible value st any bit string of the form 'bbbb'B where each b is either or 1. The number of bits must match the number of classes defined. Starting with class on the left, each bit corresponds to one class of events. If the corresponding bit is a 1, then the events of that class will be included in the event set to be characterized. AQ7UNI makes no notice of the class of events, this is merely a technique to facilitate taking certain subsets of the learning sample . example i (assume two classes) ULIST*'01'B This indicates that class 1 (the second class) of events will be covered. ULISTa'll'B would' indicate that both classes and 1 are to comprise the events characterized. A semi-colon must be coded at this point. criteria choicest If NCRITa specifies a value greater than 0, criteria choices must be coded. If NCRITan, then n integers in the range 1 to 7 are coded followed by n real numbers. The integers serve to identify which criterion is to be used while the real numbers give the tolerance values. Criteria choices for a given 29 characterization override the general criteria stated previously (following the ordering infor- mation) which serve as the default criteria. Note i The reading of Z and/or W data values is under the control of the general criteria specification. If you wish to use criterion 3 or 5 you must be sure to also state these same criteria as general criteria to trigger the solicitation of associated data values. The same Z and/or W values are used for all characterizations. This concludes the parameters for each uniclass character- ization. At this point you may place a separator card which is an asterisk in column 1 followed by blanks and then begin coding parameters for another entire problem. You may place as many independent problems (separated by separator cards) in the input stream to AQ7UNI as you wish. The example on the following page illustrates an entire input stream. Line numbers are for reference only. lines 1,2 i AQVAL/l keywords line 3 j title data line 4i factor/interval specification (variables l»2,3» i *' are of factor type line 5* number of variables, number of levels per variable 30 I Sample AQ7UNI Input Stream 1 INFORM- ' VECTOR • 2 TITLE«1| THIS WILL BB THE TITLE OP THIS EXAMPLE 4 'FACTOR' 122 3 * 7 1 8 1 1 0.0 9 2 3 10 2231 11 2 2 12 12 2 2 1 2 2 2 12 3 2 15 2 2 2 1 16 12 11 17 UNICLASS-2 QUT-'l'Bi 18 MODE-'EXACT' NGB-5 ULIST-'IO' NCRIT«2| 19 fc 7 0.25 0.6 20 MODE-'APPROX' DT-.375 RANK- 2 ULIST-'ll'Bi 21 * 22 INFORM- ' VECTOR • . \l line 61 number of classes, number of events per class line 7* ordering information (the first class will be called class 0, the second, class 1) line 81 general criteria (criterion #1, tolerance 0.0) lines 9-16 t event data in vector format (first 4 are in class 0, second 4 in class 1) line 17i Uniclass keywords lines 18-20 1 parameters for two characterisations line 21 1 problem data separator, followed by next problem in line 22 31 Domain Definitions The parameters described on the proceeding pages support those features of AQ7UNI which are compatible with AQVAL/1 (AQ7). AQ7UNI has a domain definition feature which is not compatible with AQVAL/l (AQ7) and for that reason it is documented separately. The following parameters are to be used whenever the DOMAINS* specification is given a positive value. Parameters through and including the title data are coded as before. None of the variable definition parameters which follow the title data up to (but excluding) the ordering information are to be used when DOMAINS has a positive value. Substitute parameters given below are used instead. domain definition datai d # ' typeidname* 1# n# default: no default Domains are numbered 1 through DOMAINS (DOMAINS is the value given to the DOMAINS* keyword). Domains are defined in order, each definition being of the form given above. M d#" is the domain number. "1#" is the number of levels associated with this domain. (The domain is the integers through 1#-1). M n#" is the number of special names to be assigned to the values in the domain. Following the n# number 32 you must code that number of names, each name mutt be enclosed in apostrophes. "Type" indicates the type of the domain and is either FACTOR, INTERVAL, or STRUCTURE, "idname" is optional and specifies any name you wish to call the domain. The parameter MAXNAMELENs described early in the user's guide specifies the number of characters stored for each name (or dname). The following example illustrates domain definition. Assume DOMAINS-2 was coded. 1 •FACTOR 1 k 2 'INTERVAL i COLOR 1 5 5 'WHITE' 'LITE GRAY' •GRAY' 'DARK GRAY' 'BLACK' These two statements define domains #1 and #2. The first statement indicates that domain 1 is of factor type and has four levels and no special names. The second statement indicates that domain 2 is of interval type called "color" with 5 levels and 5 special names. The value will be called "white", the value 1 will be called "lite gray",..., the value 4 will be called "black". The parameter NAMES- must be given a value large enough to accomodate all of the names given to all domain definitions. NAMES- should be the sum of the number of levels (1#) of all domain definitions which have a non-zero number of names (n#). 33 Domain definition for a structured domain is more complicated. The regular domain defining parameters are coded and then following them use these extra specifications! sl# sn# nn A structured domain is a tree. The leaves are defined via the regular portion of the domain definition statement, i.e. the number of leaves is the number of levels (1#). The number of interior nodes is specified by the sl# parameter and via the sn# parameter, each interior node may have a name. Following the list of interior node names (if any) come sl# number of structuring specifications. The structuring specifications correspond to the interior nodes, and give a list of previously defined nodes (either leaves or internal) which are to be considered conceptual refinements. An example should clear up the mysteries. Consider the set of the objects: line, circle, ellipse, square, trapezoid, triangle, hexagon. Circles and ellipses are closed lines. Squares and trapezoids are 4-sided. 4-sided, triangle, and hexagon objects are polygons. Polygons and closed lines have area. Suppose this kind of domain is to be domain number 3. Then we write: 34 3 'STRUCTURE i SHAPE* 7 7 'LINE* 'TRIANG' •CIRCLE' •ELLIPSE' •HEXAGON' •SQUARE' 'TRAP.' 4 4 'CLOSED LINE' •4-SIDED 1 •POLYGON' 'HAVE AREA' 2 2 3 2 5 6 3 8 14 2 ? 9 The domain is named "shape" and has 7 levels which are named as this table indicate si line 1 triang Pour internal nodes are to 2 circle 3 ellipse be defined and will be given 4 hexagon 5 square internal numbers as the exten- 6 trap. sion to the table indicates 1 7 closed line 8 4-sided (Note that these extended 9 polygon 10 have area levels may not be found in the input data defining the sample events*) The relation- ships between the internal nodes and the leaves are given by the four specifications following the last internal node name. "2 2 3" applies to name 7 (the first internal node) and says there are 2 conceptual refinements of "closed line", namely items 2 (circle) and 3 (ellipse). Similarly there are two refinements for "4-sided" which are items 5 (square) and 6 (trap.) "Polygon" has 3 refinements which are 8 (4-sided), 1 (triang) and 4 (hexagon). Lastly, "have area" has 2 conceptual refinements! 7 (closed line) and 9 (polygon). 35 number of variables and domain number for each n, default* no default This specification follows the last domain definition, n specifies the number of variables and each of the n numbers which follow must be the number of a domain which was previously defined. Many variables may have the same domain. number of variable names and name for each m, default: no default m may be zero in which case no names may be given. In that case the variables are automatically named Xi where i ranges from 1 to the number of variables. If m is less than the number of variables, then those variables not given special names will retain their Xi form of name. If a given name begins with a period, the period is removed and replaced by the name given to the domain. Thus if a variable is of domain number 2 (as defined in a previous example) and its special name is • •#!.• then it will be refered to by the name "C0L0R#1 M on all output. The following example of a whole AQ7UNI input stream illustrates the variable naming feature. 1 2 I 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 36 Sample AQ7UNI Input Stream using Domain Definitions INF0RM-VECT0R NAMES»3 DOMAINS* 2 TITLE«1| THIS WILL BE THE TITLE OP THIS EXAMPLE 1 'FACTOR' 4 •FACTOR tSIZE' 3 3 'SMALL' 'MED' 'LARGE' 2 2 12 0.0 2 4, 1 2 2 2 2 2 1 2 1 OF #1' OF #2' 'TYPE OF BOX' 1 1 2 2 2 2 2 2 2 UNICLASS-2 QUTs'l'Bi MODE-' EXACT' NGB-5 ULIST-'IO' NCRTT«2| 4 7 0.25 0.6 MODE-'APPROX' DT-.375 RANK-2 ULIST-'ll'Bi line It the total number of names is 3 (domain and variable names do not count). line 2i 2 domains will be defined. line kt domain #1 is of factor type with k levels. No special names are used. line 5» domain #2 is of factor type with 3 levels given special names. The domain is named "size." line 6 i there are 4 variables. Variables 1, 2, and 4 are defined on domain #2 while variable 3 is defined on domain #1. line 7* The variables are named as follows i "size of #1", "size of #2", "type", and "size of box". 37 APPENDIX I Program Listing of AQ7UNI (Version 2) November 1978 38 STBT LET HT AQ70BI - TUSIOI 2 3 4 I 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 II 15 26 il 29 30 32 33 13 36 37 38 39 42 43 00 05 06 07 AQ70BI: PBOC OPTIONS (Bill) ; DCL /*♦♦♦ AQ7 BITB DIICL1SS ♦ ♦♦•/ {LQTBACZ,STBACI.QST,QLQT,LQSI,SATE,SA¥ELQ) /•AQTAL (AQ7) OIL!*/ BIT (1) ALIGNED, (BAXST4B, COT STAB. ICE) /'AQTAL (AQ7) OIL!*/ FIXED BIB(15). BODE /•AQTAL (107) OIL!*/ B(2) ALIPED, CHA1 BPC /• BOBBEB OF BITS PXB CBABACTEB •/ FIXED BIb]15) BOB! TLB •/ CLASSES ill CBABBOr /* „ CHAB(BO) ALIGNED, CLASSES /* BAXIBOB BOBBBB OP FIXED BIB(15), COVEB /• PILE TO IBICB COBPLEIBS BAI BE BBITTII •/ PILE STBZAfl OOTPOT EXTSBNAL. CEBOG /* COBTBOL OP DEBOC OOTPOT */ BITM 001 BITM) ALIGNED. BAI VS /• BOBBBB OP DOBAIBS DKFIIBD •/ 15 /• BALP-BOBD BOBK ABBA, OTEBLATS Pi PB1 PIIED BIB (15) PB /• STBDCTOBE PB •/ DBPIBBD TO COT El PB15 / BASED ( (PILL1,PC1 /• TBE TBO BTTXS IB PB15 CUAB(1) ALIGBBD. PLOSB /• IBDICATES BBBB IIPUT DATA BUST BZ SKIPPED •/ BITM) ALIGBBD. I IP OB 8 /* ETZNT iBPDT POBBAT (CABBA OB TBCTOB) CHAB(6) HAXBABELEI PIXED BAI NT / ALIGBBD, /•.BAI BOBBEB OP CBABS IB EACH BABE •/ PIIED BIBMS), X1T /• BAI BOBBEB OP TABIABLES •/ PIXED BIBM5), BABES /• BOBBBB OP DEPIBBJ) BABES •/ PIXED BIBMS). ■ BO /• BAX BOBBBB OP COBPLEZBS IB A COTEB •/ I TO PKIBT ETEBT DATA */ PIXED BIB (IS). PITE /• IBDICATES . BITM) ALIGBED, STLTLS /• BAX BOBBBB OP STBOCTOBB LEfSLS •/ PIXED BIB (151, TITLE /• BOBBEB OP HIES OP TITLE DATA •/ FIXED BIBM5). , TfiDBOP /• TEAB5LATE TABLE TO DBOP LEFTBOST BIT •/ CHAB(2S6) ALIGBBD. IRIDX /• LOOKOP TABLE TO GIVE IBDEX OP LEFTBOST BIT*/ (0:255) FIXED BIB (15). TBPOP /• LOOKOP TABLE TO GITE POPOLATIOB OP BTTE •/ (0:255) PIXED BIB(15) , (I, J,J1,J2,E) FIXED BIB (31); BPC - 8: /» THEBZ ABB 8 BITS PEE CBABACTEB •/ TBIDX(O) • 8; J1,J2 « 1: DO | • 7 TO BT -1j DO J = J1 TO J2; TRIDX (J) - I; END; J1 » J2*1; J2 « (J1»2)-1; END; TBPOP(O) * 0; J1 « t; DO I - 1 TO 8; DO J « TO J 1-1: TBPOP (J*J1) - 1 ♦ TBPOP (J); END: J1 - 51 • 2; EBD; FP ■ ADDB(PB15) ; FB15 - 0: S0BSIB(TfiDHOP,1,1) - FC1; J1.J2 - 1: DO I * 1 TO 8: DO J - J1 TO J2; FB15 - J-J1: SOBSTB (TBDB0P,0O,1) ■ FC1; EBD: J1 * J2*1; J2 ' (J1*2)-1; END; DEBOG O'B; Oil ENDFILEjSXSIN) LIST BEGIB; ('END OF DATA OB STSIB FILE'): (•AQ70NI ENDS') ; POT SKIP (3) POT SKIP (2 LIST STOP; EBD; /• BEGIN BEEE TO STABT NEB PBOBLEB */ NEBDATA: CLASSZS*32; BAXNT-32; BAXNABELEN«8; HODE='IC' : INFOBB « 'YECTOB' : TITLI.DOHAIKS.KABES, STLTLS - 0; NBQ=35: PNTE*'1'B; FL0SH='0'B; 39 STBT LET NT AQ70NI - VERSION 2 48 19 50 51 52 53 54 55 56 57 58 59 60 /* BEAD AQ7 KBINOHDS •/ GET DATA(lGE,«nu,L SATE.SATELQ.HAXS CLASS ES.BAX&V. DO /• PBOCBSS TITLE CTBACE.STBACE,gLOT,OST, PHTE.HODB, lAB,CUTSTAB.IBP0Bfl t flTtE,LQST, BAINS, BABES , BAI NAHELEI ,STL VLS.D1B OBB06) ; r*T DP) IT IcHABBUF IF TITLE>0 THBH DO; GET SKIPM): DO 1*1 TO TITLE: GET EDIT (CH ABB POT SRIP(I) £D END; bid: pot skip(2) list!' pot skip(2) edit?' if debog then pot nhc,dohaibs,nahe BLKA: BEGIB; DCL #E /» BOH BEE OF ETEBTS •/ FIZEC BIB (31) ) (COL0U(20) ,A) ; AQ70HI - VERSION 2 - OCT 1978»): IHPOT FOBHAT IS • .IBFOBH) (A, A) : DATA (PNTE. DEBOG. IBFOBH, BODE, FLOSH, S, BAXSV,flAXNABELEH,CLASSBS,STLTLS, TITLE) ; •IVABS /• HOBBEB OF IHTEBTAL TABIABLES */ FIXED BIB (15), •BABES /* NEXT IBDEX OF A BABE */ FIXEE BIB (31) , #N AVARS /* HOBBBB OF VARIABLES BITB HA TALOES •/ FIXEE BIB (15) , •STBOC /* BEIT IBDEX OF A STBOCTOBE */ FIXE! BIBJ31), *S TABS /• HOBBEB OF STBOCTOBED VABIABLES •/ FIXES BIB (151. AHABE /* BOSK AREA FOB DZFIBED BABES */ CBAB (HAINAHELEBI TAB ALIGIED, B*E /• BOBBEB OF BTEHTS IB BIT OBITS (HOLT OF BPC) •/ FIXES BIB (15) . BLEB /• LEBGTH OF ETEBT BEPBESEBTATIOB IB BITS */ FIXES BIBJ311, "cflxlW JHfPBHMf?" TABIABLE *' CtE /* BOBBEB OF ETEBTS IB CHAB OBITS •/ FIXEE BIB 115) . CLBB /• LENGTH OF ETEBT BEPBESEBTATIOB IB CBABS •/ FIXES BIB (31) , CO /* CBAB OPPsI T FOB EACH TABIABLE */ (BAXBT) FIXED BIN (15) , Dt_/» SOBAIB BOBBEB COBBEBTLI IB OSE •/ FIXES BIN (31) , DOH* /» DOHAIB BOBBEB FOB EACB TABIABLE •/ (HAXHT) FIXED BIHJ15) . DOHDATA /* SOBAIN DATA */ LETELS IB THE DOHAIB */ (HAX (I.DOBlHSn, #LVLS /• BOBBEB OF FIXES BIB (151 , DTTPE /* DOHAIB TIPB (I,S,F) */ CHABjl) ALIGNED, HAHESIEX /• INDEX TO FIBST DEFIBED BABE */ FIXEE BIB (15) . PBEPIX /• NAHE ASSIGNED TO DOHAIB */ CHAB (HAXNAHELEN) TAB ALIGNED, STBUCIEX /« ItlDEI TO FIBST STBOCTOBE ELEHEHT */ FIXES BIN (15), IDBAHES /• DEFINED NAHES FOB TABIABLE TALOES */ (MAX (1 , NAHES)) CBAB (HAXNAHELEN) TAB ALIGNED, INTVABS /* LIST OF IBTEBVAL VABIABLES */ (HAXNT) FIXED BIN (151. LEAF /» VALUE OF A LEAF IB STfiOCTOBE TBEE */ FIXES BIN (31) . LIBITIAL /* ABEA OF THE ETENT SPACE •/ FLOAT, BAXCL /• HIGHEST CLASS BOBBEB •/ FIXEE BINJ3V BAXET /• LABGE FIXES HAXSB /• LAtiGE <3 lsT 3 !sf BXHAHE /• HOBBEB BINJ31), /• LABGEST FIXES BIN (31) BOBBEB OF ETEBTS IB A CLASS*/ HOHBEB OF STBOCTOBE BITS •/ OF BABES ALLOiED FOB A DOHAIB •/ FIXEE BIB (311, BAIND /* INDICATES TABIABLES BITB BA TALOES •/ (HAXNT) CHARM) ALIGNED. BATABS /* TABIABLES BITB BA TALOES •/ (HAXRV) FIXED BIBM5) , BC /• NOHBEB OF CHARACTERS BEPBESEBTIBG A TABIABLE*/ (HAXHT) FIXED BIN(15l, NCL /* BOBBEB OF CLASSES */ FIXEE BIN (31) , NCHAX /* LABGEST OF THE BC (I) */ FIXES BIN(31). BE /* NOHBEB OF EVENTS IN EACH CLASS */ (0:CIASSES) FIXED BIN (15), I /* NOHBEB OF IHTEBIOB NO FIXEE BIN (31) NHL /• NOHBE UEE BIN (31) , HI /» NAHES INDEX DES IB A STBOCTOBE */ IN OSE */ FIXES BIN (31> NL /* NOHBEB OF LEVEL (HAXNT) FIXED BIN (15) . NLVL /* MOHBEfc CF LEVELS FIXES BIN (31 NNAHE /* NOHBE FIXES NV /* NOHBEB FOB EACH TABIABLE •/ FOB A DOHAIN */ BIN (31) , /* NOHBEB OF T FIXES BIN (31) , OF NAHES ENTEBED */ VARIABLES */ HSPEC /* NOriBEEOF SPECIFICATIONS EHTEBED */ 40 SIBT LET NT AQ70II - TBBSIOB 2 61 b2 65 66 67 69 7? 77 78 79 eo 81 62 83 64 85 66 67 88 89 90 91 11 94 95 96 97. 98 99 100 1C1 1C2 103 104 105 106 107 M 110 111 112 113 114 115 116 117 118 119 120 121 122 123 m 124 125 126 127 128 1?9 130 121 132 133 134 135 136 FIIEt Bin (3 SI /• STBOCID FIXED BIH(3 STBDC /• STBO (BAI (1.STLT STB0CTAB5 /• (HAI1T) FIX TIPE /» TIBIA CHAB1 TABBABE /• BA (BAIBT) CBA TABTIPE /• II (BAIBT) CBA .1 BE' IBDBI IB OSB •/ ct6bb lsi) piibd bibm5). stboctobed tabiables BIBJ •/ ■ L H /* LEBGT FIXED BIN (3 ID Bill BLB TIPB »/ ILB1+10) TIB ALIGNED, BE OF EACH TABIABLE */ B(BAXNAHELBB) TAB ALIGBED, P£ OF EACH TABIABLE •/ B(1) ALIGNED. b OF BIT BOBK ABBAS IB BITS */ 1). (I.J.I) FIXED BIB(31) ; •ITABS,«STABS,«NATABS - 0; #NAHES,#STB0C,BAISB-1; IF DOBAIJiS < 1 TBBB DO; /* DETEBHIBi IBTEBVALS OB FACTOBS •/ GET LIST (NSPEC, TIPE) : IF SOBSTfitTIPi.l,!)- 1 ! 1 THEB DO; ABAHB - 'F» ; TIPE « 'I*; IBD: ELSE DO; ANABE - 'I' ; TIPB - 'F'; BID: TABTIPE ■ ANABB; DO 1-1 TO NSPEC; GET LIST (J) ; TABTIPI (J) ■ TIPB; BND; /• BEAD BOBBEB OF TABIBBLBS •/ GET LIST (NT) : IF BT > BAIVT TBBB DO: PUT SKIP LIST rTABIABLES EXCEED BAIBT'): FLOSB » M'B: GO TO ELBA BBD; END: DO 1-1 TO BT; TABBAHE(I) ■ 'I' II BOB (1,0); END; IF NSPEC^O I NSPEC-BT TBBB DO: POT SKIP EDIT ('ALL TABIABLES BILL BE COTEBED BT ') (A); IF TABTIPE (1)"'P T TBBB POT EDIT ('FACTOBS') (A); ELSE DC* POT IDITriBTEBTALS') (*) ; •I?ABS»NT; DO I«1 TO BT; INTTABS (I)«I; ENC; END; END: ELSE DO: POT SKIP LISTJ'THE FOLL08IBG TABIABLES ABE ' I I 'COTEBED BI FACTOBS'); J1 « 0; DO I=»1 TO BT; IF TABTIPE (I) = 'P' THEB DO; IF NV>27 THEB J1 - J1 ♦ 1; ELSE J1 » I: IF J1 > 27 THEN J1 « Is POT EDIT (I) (C0L(35*(J1»3) ) ,P(3) ) ; lit ■ END: POT SKIP LIST ('THE FOLLOIIBG TABIABLES ABE * H'COTEBED BI IBTBBTALS*) ; J1 - 0; DO I»1 TO NT; IF TABTIPIJI)«'I' TBBB DO; IF HT > 27 THEB Jl - J1 ♦ 1; ELSE J1 - IS IF J1 > 27 THEN J1 ■ Is ?I ?Aliiii»A fi CT ,35MjW3,, ' M3,,: INTVABS (IITABS)-I; IIS; END; END; POT SKIP (2) EDIT (' N0B3EB OF TABIABLES »',NT) (A,F(4)); /* BEAD NOBBEB OF IETELS •/ GET LIST((NL(I) DC 1=1 TO NT)); POT SKIP EDIT^BUBBEB OF LEVELS FOB EACH TABIABLE: • ) (A) ; DO 1=1 TO NT) ) (COL (38) , (27) F (3)) ; TJ PUT EDIT((NL(I) END: ELSE DO; /* BEAD DOHAIN DEFINITIONS */ POT SKIP (2) LIST ('DOHAIN DEFINITIONS'); PUT SKIP (2); DC I = 1 TO DCBAINS: DO HD AT A (I) . ILVLS.DOBDATA (I) . NABESIDI=0; DOMDATA I . SIBUCIDX.KI.SI-O; DOHDAIAJI .EBEFIX=' , ; GET LIST (Dl.TYPE) ; IF III « 1 IBEN DO; 41 STBT LBV ■ T 137 2 3 138 2 3 139 2 3 140 2 3 141 2 2 142 2 2 113 2 2 144 2 I 145 2 146 2 2 147 2 3 146 2 3 149 2 4 150 2 4 151 2 4 152 2 3 153 2 3 154 2 4 155 2 • 156 2 4 157 2 3 158 2 4 159 2 4 160 2 3 161 2 2 162 2 3 163 2 3 164 2 3 165 2 3 166 2 4 167 2 4 168 2 5 169 2 5 170 2 5 17 1 172 2 4 2 5 173 2 5 174 2 5 175 2 5 176 2 4 177 2 4 178 2 5 179 2 5 180 2 5 181 2 4 162 2 5 183 2 5 184 2 4 185 2 3 186 2 3 187 2 3 188 2 4 189 2 4 190 2 4 1S1 2 4 192 2 3 193 2 4 194 2 4 195 2 s 196 2 5 197 2 6 198 2 6 199 2 1 200 2 201 2 5 202 2 5 203 2 4 204 2 3 205 2 2 iol 2 2 | 208 2 2 209 2 2 210 2 3 211 2 3 212 2 3 213 2 4 214 2 4 215 2 3 216 2 2 217 2 2 218 2 3 2 19 2 3 220 2 3 221 2 3 222 2 4 223 2 4 225 2 4 226 5 227 2 5 228 2 5 2?9 2 5 2*0 2 5 231 2 4 232 2 3 AQ7DHI - VEBSIOM 2 POT SKIP LIST ('DOBAIH DBFIMITIOM • . 1, ' EI PECTBD BUT*, di.'Foomd') ; FLOSB ■ • 1'B: GO TO BLKA i&E; BUD: GET LIST (HLTL.HBABB) ; DOBDATA(D#) .4LVLS « HLTL; DOBDATAJDli .CTXPB - TTPB; J K INDEX It T P jI • • ■ \ • IP J>0 THEM DCBDATMD*) -PBBPIX-SOBSTB (TT PE.J* 1) ; ir HHABE > THEB DO; BXBABE ■ ILTL: IP #KABES*BIh1bE-1 <= BARBS THEM DO; DOKDATA THEM DO; BXBABB - MHL: IP DOBDATA(Ci).IABESIDX > THEM IF »MABES+BIMABB-1 <* BASIS THBM DO; MI - «MABES; •BABES - #HABKS*BXMABB; IMC: ELSE DO: •NABBS = DOHDATA(D«) .IABESIDX; EOBDATA (0#) .BABBSIDX - 0; BXMABE = 0; AMD; ELSE BXBABE * 0: CO J i 10 MMABE-1; GET LIST(AHABB): IF J < BXMABE THBM IDBABBS (HI* J) IMD; A BABE; IF BMABE < BXBABE THEI DO J ■= MB ABB TO BXBABE- 1; IDBAHES (MI*J) * M0fl(HLTL*J,0) ; IMD; EHC: DOBCATA(Dt) .STBOCIDX.SI - f STBOC; •STBOC = ISTBOC ♦ HLTL ♦ BHL; IF •STHOC-I > STLTLS THEB DO: POT SKIP LIST {'STLTLS TO LOi TO ACCOHODATE • ll'STBOCTOBBD DOBAIM HO.',D»); FLOSB = '1'B: GO TO BIKA BSD; £H£ ■ ™ DO J = HLTL TO HLVL*HHL-1; GET LIST(BT) ; DO K = 1 TO HT: GET LIST (LEAF); IP LEAF >= J THEB DO: POT SKIP LIST (• STBOCTOBE DBPIHITIOB EBHOB', LEAF.'IH LETEL'.J) ; FLOSB * M'B: GO TO BLKA BID; EBD; STBOC (SI+LEAF) = J; EBD; EMC; BHD; /* PBIHT DOBAIB DATA •/ IF DOBCATA( ELSE IF DON ELSE TIPE = POT SKIP ED DOflDATA(D IF DOB LATA ( IF DCHDAT POT EDITJ HI ■ DOHA DO J = PUT SKI ENC; EMC; ELSE; ELSE DC: POT EDIT( SI = DOHD NI = COMD DO J = POT SKI K = 1: CO BHIL IF HI ELSE K,LEA IF K> END; EMC; EHD; C«).DTIPE ■ 'S' THBM TTPB * •STBOCTOBE': CATA(D#).DTIPE - 'I* THBM TTPB - 'IBTEBTAL'; •FACIOB* ; IT (• DOBAIH '.D*.' OF •-TTPB, 1 TIPE HAS •, • ) .»LTLS,« LEVELS') (COL (4) ,i,P(2), (3) A,F(«) ,A) ; Ctl.DTTPE -•= 'S' THEN A(t») .MABBSIDX -— THEM DO: •VALUES iEBE MAHED AS FOLLOWS : • ) (I (4) , A) ; ATA(D») .HAHESIDI: TO DOBDATA(Dt) .«LVLS-1; P EDIT(J,IDHAHES(HI-»J) J (COL (12) ,F (4) ,COL (22) ,A) ; •STBOCTOBE BAP FOLLOWS • ) (I (6) , A) ; ATA(D») .STBOCIDI; ATA (Cti .HABESIDX: TC DOHDATA (Di) .ILVLS-1; £ EDIIf •) 0) ; >0 THEN POT EDIT(IDNAHES(KI*L£AF)) (A) ; PUT ECITjLEAFl JP ?3) ) ; E = STBOC (SI + LEA., THEN POT £DIT(* -> ') (A); hZ STBT LET IT AQ7DBI - TBtSIOl 2 «i33 23<4 289 290 292 293 294 211 297 298 299 300 3C1 302 303 304 305 306 307 308 309 310 2 2 2 2 1 °0 2 2 POT SKIP (2) ; BBD; /* BiAD BOBBBfi OF LET ELS •/ 6IT LIST(BT) : IP NT > BAXBT TBBB DO: POT SKIP USK'TABIABIBS BICBED BAXBT'); PLOSB * 'VB: GO TO BLKA lit; BID: POT SKIP (21 EEITCIOBBEB OP VABIABLES - ' , IT) <1»F(«)); GBT LIST (DOB ♦ J I) DO 1-1 TO DTI); " EDIT(*DOBAIB BDBBBB FOB I POT SKIP EDIT POT EDIT ( (DOB « (I) 1 tO IT; I1CH TiBIlBLB DO 1-1 TO If)) (COL(38),(27)P DO I « 1 TO II; Di - DOB* (I ) ; IF D* > DOBAIIS TBBI DO; POT SKIP LISTf'DOBAII I0IBBI FOB TABIABLI',1, KlJIPYW' 11 GO TO BLKA IID; BID; ■Lilt - DOHDATA(DI) .ILILS: TABTIPIjI) - EOflDATA(D«> .WIPE: If DOBEATA(E«).ETIPB * »I' TBBI •ITABS ■ «ITABS»1; IBTTABS(IIIABS) - I; ■<;i«" DO; .si I •) . •STABS - (STABS*!; DTIPB - i; TBBB DO; STBOCIABS(ISTABS) BBD; BBD: POT SKIP BDITt'BOBBBB OP LBTBLS FOB BACB TABIABLB: • ) (A); POT BDITf" GBT LIST i DO I EC' T < CUB. CX> DO 1-1 TO IT))JCOL(38). (27) P (3) ) ; T UBAMBi : /* BBAD TABIABLE I Alii •/ 1 TO BIABE; GET LIST(AIABE) ; IP I <- IT TBIB DO: IP SOBSTB (AHAbI.I,!)-'.' TBBB TABBABE(I) - DOHDATA(DOH*(I) ELSE TABBABE(I) - AIABE; «.!! Di ).PBBPIX || SOBSTB(ABABE,2) IF 111 BE < IT TBBB DO I-IIABE+1 TO IT; TAIBABZ(I) ■ 'X' || BOB (1,0); BID; BID; ICBAX - 0: CLE! - 0; LIIITIAL - 1.0; DO I - 1 TO IT: LIIITIAL - LIIITIAL • IL (I) ; f/BFC; ICBAX - IC(I); BID; BLBI - CLEI • BPC; /• BXAD BOBBBB OF CLASSES ABD BOBBEB ETBITS II BACB •/ GET LISTjICL); BAXCL- ICL-1: IF HCL > CLASSES TBEI DO; POT SKIP LIST ('CLASSES SPECIF ICATIOI OKLI ALLOIS OP TO 1 , CLASSES. 'CLASSES') ; PLOSB - 'VB: GO TO BLKA BID; BBD; GET LIST((IK(I) DO 1-0 TO BAXCL)); POT SKIP BtlTTIOBBEB OP ETBITS*- • SPECIFIED FOB BACB CLASS: «, • CLASS IBTBITS') (A,A,SKIP(T),COL(8) .A) ; POT EDIT ((I. IE (I) DO 1-0 TO BAXCL) ) (SKIP, (2) P ( 10) ) ; tE,BAXBT - 0; DO I • E TO BAXCL; • E ♦ BBf~" BAXBT II (if TBBI BAXBT - BB (I) ; EID; CIE - <»E*EPC-1) / BPC; BtE - CIE • BPC; BLEN - SAX (BtE. BLEB. flAXSB): IF DEBOG THEH POT DATA (DOBEATA, It BABES, STIDC.T ABTTPE, DOB #, •BABES, ISTBOC. BAXCL. BAXBT. BCL.IKTTAH5. *ITABS,STHOCTABS. t STABS, TXPE.BL, BO, CO, IC, Bt,BAXSB, «E, C»E, LIBIIIAL, BLEB, CLEB, BLEN,BCHAX,TAB1ABB) ; BLKB: BBGIB; DCL BT /« OBITEBSAL BIT TBCTOB */ BIT (4096) EASED, CLIST /* CEITEBIA LIST ♦/ (7) PIXEL BIB (15) III L J. *£. A. B1R I IJJ | CHAP /* BIT BAP OP ETBBTS IB BACH CLASS*/ (0: BAXCL) EIT(BtE) ALIGNED, CV /• OBIVEBSAL CHAHACTEB TECTO! CHAE(512f EASED, DT /* DEHSITY TBBESHOLD */ FLOAT, >B •/ £(*£) /« ETEBT BEPBESEITATIOIS •/ ES) ALIGBED, • TBI CLASS OP EACH BTBIT */ UTjB ECLASS / (•e) r IXED BIB(15) , 4 3 STHT LEV IT AQ70HI - VERSION 2 311 3 212 3 313 3 314 3 315 3 1 316 3 2 317 3 2 318 3 2 319 3 3 321 3 3 312 3 4 323 3 4 324 3 5 325 3 5 327 3 5 3 n 328 3 3 329 3 2 330 3 1 EEVN /* TUE EVENT [#b[ fixed BIN MO IITBII CLASS FOB BACH EVENT*/ i#Bi fixed bin(15). BRANKC /• EVfBT CHAIN BT Bill */ (IE) FIIED BIM (151 . Fill. /• CBITEBIA EVALOATIOI FLOATING BESOLT */ FLOAT, HCLIS1 /* DBFAOLT CHITEBIA LIST */ (7) FlXEt BIN (15), HBCBIT /• DEFAOLT NOBBEB OF CBITEBIA •/ FIX1D BINM5) , HODE /* EXACT OB APPBOX OB BEL OB FBEE */ CBABI6) VAE ALIGNED, 1 BQ /• STORAGE FOB COHPLEXES */ (BHC) , 2 *££ /* NOBBEB OF EVENTS COVERED iOT BEHAIBING »/ FIXED BIN(31), 2 #ER /• NOBBEB OF EVENTS COVEBED BEHAIIIMG •/ FIXED BIB (31) , 2 DBS /• DENSITY OF COBPLEI */ FLOAT. 2 IBT /• BIT BBPBESEHTATION OF COHPLEX */ BIT(BLEN) ALIGNED. 2 NBANK /* BANK OF COHPLEX •/ FIXED 2IN(31). DEFAULT HTLIST FLO PI NCBIT /* NOHBEB OAT, TOLEBABCE LIST */ FIXED BIN (15) . >RD" BEING OF CBITEBIA */ BEIGBBOBBOODS */ NGB /» N0HB1_ FIXED BIBJ31L. INFOBBATION (0:B'AXCL) - ONES /• SOOHCE OF STRINGS OF ONES •/ BIT(HLEN) ALIGNED, (OP1.0P2) /* SPBCIAL OPTIONS */ BIT(1) ALIGNED. BANK /* BANK LIBIT VALOE */ FIXED BIN(31), BANKS /• CHAIN5 OF EVENTS OF SABS BANK •/ (0:N%*1) FIXED BIBJ31), QOT /* QOICK TBACE OPTION */ BIT (1) ALIGNED, SAVEC /• SAVE COHPLEXES OPTION */ BITfl) ALIGNED /'* STR0CT0RE BIT BEPBESENTATIOBS */ (tSTBOQ _BITJHAISB^ ALIGNED, SBITS SBBOBK /• SIBOCTORE BOB! ABEA •/ BIT(HAXSB) ALIGNED, SPAREHASK /« INDICATES OHASSIGNBD BITS IN BBPS •/ BIT(BL£N1 ALIGNED. ST /* SELECTOR THRESHOLD •/ FIXED BIN(31), TLIST /* LIST OF TOLEBAHCE VALOBS •/ (7) FLOAT, TYPE /* TYPE OF COVEB (IC,DC) »/ CHAR (6) VAB ALIGNED, OLIST /* CLASS SELECTION INDICATOB */ BIT (NCL) ALIGNED, DNICLASS /» NOBBEB OF CHABACTEBIZATIOIS */ FIXED BIN(31). ONITBACE /* DETAILED TBACE OPTION •/ BIT(1) ALIGNED, '• CBITEBIA ETALOATIOH VALOE */ r cc VAL /» FIXED BINJ31), H /• EVENT HEIGHT VALOES (0:BAXCL,1:HAXEV) FLOAT CONTROLLED, WEE /• BIT HAP OF COVEBED EVEITS HOT IN BBHAINING*/ BIT (B#E) ALIGNED, HEB /• BIT BAP OF COVEBED EVENTS BEBAINING */ BIT (B*E) ALIGNED, HLBE /• BIT BAP OF COHPLEX */ BIT (BLEU) ALIGNED, BNEE /* BIT BAP OF EVEITS IN NEIGHBORHOOD */ BITJB*E) ALIGNED, (01,82) /* BIT BOHK 1.B2) /* BIT BOBK ABEA */ BIT(WLEN) ALIGNED, /» VARIABLE BEIGHTS */ (NV) FLOAT CONTROLLED, (I,J,J1,J2) FIXED BIN (31) ; ONES * 'O'B: ONES = -• ONES; SBITS >= 'O'B; DO D* = 1 TO DCHAINS: IF DOHDATA(D«) .ETIPE = 'S* THEH DO; SI = lOHDATA (D») .STROCIDX; J2 = EOHDATA (Dt) .ILVLS-1; DO I = TO J2: J1 = 1: J = I; DO SHILE (J1 > 0); J1,J = STBOC (SI+J) ; If J>J2 THEN DO: SDBSTB (SBITS (SI*I) ,J-J2,1) " SDBSTR (SBITS (SI«-J) ,1*1,1) = END; END; END; END; END; /* INITIALIZE VARIOUS VARIABLES AND CONSTANTS •VB; l'B; kk STBT 1X1 BT AQ70BI - TUSIOI 2 346 3*7 308 3*9 350 351 352 in- M 3 !3 I 8 3B1 Mi 364 3 38S 366 3 387 3 388 389 390 391 392 393 3 8 3 3 1 3 1 1 1 3 399 395 I 1 100 3 1 4C3 I i 404 4C5 3 1 406 3 1 407 3 1 408 3 2 409 3 3 410 3 3 411 3 3 412 3 3 413 414 I \ 415 3 3 416 3 3 417 3 3 4 18 419 1 \ 420 3 1 GET LIST (OUST) : GIT LIST{BCRIT, JCLIST(I)D0 1*1 TO ICBIT)); GET LIST ( (TLIST (I) DO I« 1 TO ICBIT) ) ; ir KBIT < 1 TBI! DO; BCBIT ■ 1; C1ISTM) - 1: ILISTJIJ - 0.0; 110: BHCBlt - ICBIT; BCLIST - CLIST; HTLiST - TLIST; /• GET IBPOT BTEITS •/ B - •0»B; IP IBPOBB - 'ViCTOi' THBB CALL BSADTBC: ELSE IP IBPOBB - •GABBA 1 TBBB CALL BBADCAB ; POT Silt (3) LIST (••• IITALID ETEBT POBBAT SPBCIPIBD KPJ3I U - '1*B; PLOSB ZBD : IP PLOSB TBBB GO TO BUB BID; POT SKIP<2) ; J1,J2 ■ 0: DO J - 1 10 ICBIT; IP CLIST (J) -3 TBBB J1-1; 1LSE IP CLIST (J)*5 TBBB J2-1; 1BD; IP J1-1 TUB DO; ALLOCATE Z; 2 - 1,0: GET DATA(Z) : IP STBACE TBBI BBD; IP J2»1 TBBB DO; ALLOCATE B; 8 -1.0: GBT DATl(I) : IP STBACB TBJ END; ); IN POT SKIP DATA(Z) ; ill POT SKIP DATA(B) ; < (ic(I)«BPC) TBBB Bo|l)*Bt(I) TO (C0II1*BC(I)-1) spabUasi!,j,1) - M'b; SPABBBASK - 'O'B; DO I - 1 TO BT : IP BL(I) < (IC DO J • BO S0BSTB(SP BBD; BID; CBAP - 'O'B; J - 1;; DO I » TO BAXCL: SOBSTB(CBAP TBEB DO; DO J =» 1 TC BCBIT; M'B; 'IC; GET LISTjTAL) : IT J <- 1 IHEB CLISTJJ ELSE POT SKIP LISTCCB •EOT OSEE') ; END; DO J - 1 TC NCBIT; GET LIST IP"" ) - »AL; ITBBION TALOE'.TAL, IP <- 7 THIN TLIST(J) « PTAL: ELSE POT SKIP LIS? ('TOLEBAHCE TALOE' ,PT AL, ■HOT OSEC) ; BID: IP BCBIT > 7 THEB NCBIT - 7; EBD: ELSE DO; <*5 STBT LET IT AQ7UBI - TBBSIOI 2 4<1 023 424 129 430 431 132 433 434 435 436 425 3 426 3 427 3 428 437 4 1 439 4 1 440 4 1 441 4 1 442 4 1 443 4 2 444 4 3 445 4 3 446 4 3 447 4 3 NCBIT « BBCBIT; CLIST * BCLIST; TLIST - BTLIST; END; IP BODE^'FBEF" TBEI DT=-0.000; IP BODE«'EIACT' TBEI DT-1.0: POT SKIP(3) IDITC J'.!,') '.'BODE •ST =',ST, 'BGB ='.BGB. ■ .BANK ,'TIPE POT * '.BODE, 'DT »',DT, IP OLIST THE!; ELSE DO: PUT sIlP LISTf'OLIST SPECIFIES 10 CLASSES OF ETEBTS'); 60 TO NEXT COTBB; END; IF NGB < 3 THEE HGB * 3; BLKC: BEGII; DCL «CLAZZ /• BUflBEE OF CLASSES THIS CHABACT2UZATI0E*/ FIXED BIB (15) . #£TN /• iOHBBB OF ETEBTS THIS CHARACTEBIZATIOB */ FIIED BINJ31) . CLAZZ LIST CLASSES V AZZ /* JNCL1 FIXES BUMS), CHIT /* CBITEBIA TALDE FOB EACH IEIGHBOBHOOD */ (IGB) FLOAT. DINITIAL /» DENSITI OF LBABIIIG SIT •/ FLOAT . EE /• E TENTS COTEBED EOT REHAIIIIC */ (KGB) BZT(B#E) ALIGNED, Efi /• E TENTS COTEBED BEflilBIBG •/ (NGB) BITJBiB) ALIGNED, ELIB /• INDICATES BOT ONE OF THE BETTBB BGHBBHOODS*/ (NGB) ' IDX /* FIXED BIB(31) IBITiOE HBB /* BIT BAP OF H~ EIT(BIE) ALIGNED, BEEP /* POIBTEB TO HIM •/ POINTEB HQ BIT(1) ALIGNED. BABDOB INDEX FOB IEXTSUD */ IB(31) IBITiCtE), BIT SAP OF BESAIBIBG ETEBTS * * /* NDBBEB OF COBPLEIES GEB2BATED •/ FIXED BIB(31). HSEED /* BIT HAP OF BEBAIBING SEED ETEBTS V EIT(B«E) ALIGNED, BSEEDP /• POIBTEB TO HSEED */ POINTEB, NEE /* ETEHTS II TBE IEIGHBOBHOOD •/ (NGB) BITJBtE) ALIGNED. 1 NGBB /• OTHEB IEIGHBOBHOOD DATA */ (HGB) . 2 *E£ /* NOBBEB ETEBTS II EE */ FIXED BINJ31), *EB /• NDBBEB FIIED BIN (31) , " OF BITS IN EB •/ COBPLEX */ / 2 tLKE /* ABEA FLOAT, 2 »N££ /• BOBBEB ETEHTS II IKE FIXED BIN (31) , 2 DEB /* DENSITY OF COBPLEX */ FLOAT, 2 BBANK /» BANK OF TBE COBPLEX */ FIXED BIH(31), 2 SEED /• SEED STENT FOB THE NEIGHBOBHOOD */ FIXED BII(31), COBPLEX EBIRC THE BEIGHBOBHOOD •/ BGL /• NOBB EXE TBE BEST IEIGHBOBHOOD •/ FIXED BIN (31" NLNE r (NGB) BITjBLEM). ALIGNED MOeC A NDBBEB OF CHABS IB TAMABLE HBP */ FIXED BIN(15). PEE /* PCIITEB TO EE */ POIBTEB, PEE /* POIBTEB TO EB */ FOINTEB, PLNE /* PCIITEB TO LHE */ EOINTEB, PBLNE /♦ POINTEB TO BLNE */ EOINTEB, BEFBESH /• INDICATES NEIGHBOBHOOD SEBTICE BEQ */ (NGB) BITM) ALIGNED, SEEDS /* INDICATES THAT SEEDS BEBAIN */ EIT(I) ALIGNED, STBT /* OFFSET OP TABIABLE IB BEP •/ FIXED BIN (15) , (I,J,K,I) FIIED BIN (31) ; BEEP = ADDB (BEB) ; BSEEDP = ADDB(BSEED); *CLAZZ,BQ*, BANKS (0) = 0; KEB = 'O'B; #EVN = 0; DO I = TO HAXCL: IF (SOBSTBJULIST, 1*1,1) ) THEN DO; •CLAZZ = #CLAZZ*1: CLAZZ (ICLAZZ) = OLIST(I); BEB = HEB I CBAP(I) ; «£VN ■ *£TB ♦ HE I ; **6 STBI LB¥ IT AQ70BI - TBBSIOB 2 531 532 4 * 4 4 4 4 4 4 4 4 4 3 2 ! 4 2 : i 2 1 4 4 4 4 : i : i s i 4 4 4 3 4 2 4 2 * 4 4 2 * 2 4 2 t 1 4 2 1 2 4 3 4 4 4 4 4 4 4 4 4 4 4 5 4 5 4 5 4 4 4 5 5 I 4 S 4 6 4 6 4 6 4 5 4 6 4 6 4 6 4 6 4 6 4 5 4 4 4 5 4 5 4 5 4 5 4 4 4 3 4 2 4 2 526 4 1 529 4 1 530 4 1 BID; HO: DIBITIAL - «XTB / LIIIIIU; IF BOD*»'fiIi' TUB! DT - DT • IF DT > 1.0 TBBB DT ■ 1.0; as bbc • ui: BBFBESB • M'B; SEEDS - M'l: IF DEBOG THJi POT 01TB (BBB) ; DIBITIAL; DO BHILE (BBB) DO I - 1 ■ 'Kit BITBACE TBBB POT SKIP BEPBESli <|i'- 'O'B; IILB B VESTS IUIII •/ BDIT('SEBTICIBC B6BB •' ,1) USB 1BD; BBC; BBPBBSB(I) ■ 'I'l; D(Z); /• BOILD UB BOBUOOD •/ SELECT BBST B6BBB0OD */ BGL - CBITTAL: /* IF QDT THIN ClLl BCBBBPOBT; IF TTPE-'IC TBBB DO: PBB - A£DB(EB(BGL) J ; PB15 - 0; J ■ 1; DO I - 1 TO C»E; PC1 - CO BUIL1 B - J«TBIDX(FB15): EBABKCjK) - BABKST.0) BABKS(O) - K: PCl - IBABSLATB(PCI.TBDBOP) ; J - J** BPC; BED; BBC; IF SATBC TBBB POT SEIP FILE (COf EB) HQ» - BQ« ♦ 1; l TO C*E: S0BSTBjPBB->C¥,I,1) ; LL1 (PBl5>0i: J*TBIDX(FB15i: LIST (BLBB (BGL)) BGL) ; BGL). BLBB | BGBB(NGL) .< BGBBJBGLi.BIB: - IGBB(IGL) . BBABK; :?5Ii BBB BBB DO I IF {- BIFBBSbU)) TBBB DO; SEE - IB (I) C BE (BGL) ; IB (I) - BB(I) | BIB; IB (I) - BB(I) 6 111 ui « ACDBJBB(I)): SGBB(I).«EE - PDPOLATIOBfPBB, 1,C»E); (I) .#EB - T"- SH(I) » M'B; IF BGBH|I).»BB ■ TBBB DO; BESH(I) ■ " OBITBACE BLBB(I) BIFBB.. IF OBITBACB TBBB POT SKIP BDITf'BGBB* 1,'BEJBCTED - BO (BBAIEIBG XVBBTS') XBD; IF (- BBPBBSH(Il) THE! IF TTPB-'DC TBEB HLSE ■ BLBEJBGL) 6 PILBE - ADDfl (BLBE) ; DO E IF 0BSPBC(! fi(PBLBB->CT,CC l),K BLSB J*1; lit: IF J-0 TBBB DO; BBPBBSB(I) - M'B: SOBSTB (aSEED.ICBBJI) .SBED,1) ■ ' 1'B; SEEDS - M'B: IF OBITBiCE TBBB POT SKIP EDIT ('BOBS', •BEJECTED - BOT DISJOIBT 1 ) (A ,P (3) , X (1) ,4) ; • 1 TO IT BBILE (J-0) ; BAIBD(K) - ~~THIB IF OBSPBC (SOBSTB (PBLBB- 3 (A.P(3),I(1),A); DO; TBBB; bbdV 1 BBD; IF (-> BEFBBSB(I)) IF BBE TBBB DO; EE(I) it ■ SiUcl TBBB BEE; oU LATIOB (PBX,1,C»E) ; III PBB ■ ADDBl BGBB(I) ,*St END; END; Klfi a BSEEC'« BSEID 6 BBB; PBIBI OOT THE OKICLiSS COTEB •/ POT SKIP(3) EIITi'THE FOLLOBIBG' .BOB. _ . • CABTESIAB COMPLEXES FOBB TEE 0BICLAS3 COTEB' ) (A.F (4) , A) ; POT EDIT (' FOB CLASSES' , (CL122 (J) DO J-1 TO BCLAZZ) ) (A.i#CLAZZ)F(4)) : POT SKIP EDITj'DEBSITT OF LEABBIBG BTBBTS IB', ' ETEBT SPACE IS ' , DIBITIAL, • DEBSITY TBBBSHOLD IS'.Dlf , JCOLjb) ,A,A.£{1073,4r.A,Bn0,3,4)) ; POT SKIP: CALL PBCOTEB(O) ; PBEPABB TO BBITE COBBOB CBABACTXBISTICS */ ^7 STBT LEf NT 533 4 1 534 4 2 535 4 2 536 4 2 537 4 3 5 40 4 3 541 4 4 542 4 4 5<43 4 4 544 4 3 545 4 4 546 4 M 547 4 3 548 4 3 549 4 2 550 4 2 551 4 2 552 4 2 553 4 2 554 4 3 555 4 3 536 4 3 557 4 2 558 4 2 559 4 3 560 4 3 561 4 4 562 4 4 563 4 3 564 4 3 565 567 4 4 4 4 568 4 4 569 4 3 570 4 2 571 4 2 3?3 4 1 4 2 574 4 2 575 4 3 576 4 3 577 4 2 AQ70NI - TBBSIOB 2 578 579 5 1 580 5 1 581 562 5 1 5 2 583 5 2 584 5 2 565 5 2 586 5 1 587 5 1 588 5 1 589 5 1 590 5 1 591 5 1 592 5 1 593 594 IF HQt>1 THEN DC: §L8i ■ HQj1).IIT: P8LNI = ACDB(BLHE) ; DO I = 1 TO NT; STBT ■ COJI) : BOBC DO K tBT = CO (I) : BOBC = BC fl) ; i K = 2 TO BQ« BHILE(J-O); ELBE = ADDB(HQ(K).IBT) : IF SOESTB (PHLBE->CT,STBT,B 0; SOBSTB CT,STRT, BOHC) THEB J*1; £BD; IF J=6 THIN DO K*1 TO HQ#: l EDIT ('THE POLLOBIBG SELZCTOBS ABE COHBOB ', •CHABAdTEI"" HQJHt CALL PBCOTEB 0 THEB DO: POT SKIP(3) EDIT('SABBIBG: THE POLLOBIBG VARIABLES ARE BOT •APPLICABLE TO SOUS RTBBTS*) (A); DO I = 1 TO BBAVARS; POT EDIT(TABBAHB(SATABS(I))) (COL (20), A); END; EBD; /• PBOCEDOBE TO SELECT BEIT SEED ETEBT */ BEZTSEED: PBOC RETORHS (FIXED BIB (31)); DCL I FIXED BIB (31) ; FB15 - 0; DO I * 1 TO C*E BHILE (FB15 ■ 0) ; IDX ■ IDX ♦ 1: IF IDX > C«E THEB IDX » 1: FC1 = SOBSTB (BSEEDP->CT,IDX,1) ; SOBSTBjHSEEDP->CT,IDX,1) = TRANSLATE (PC1 ,THDROP) ; IF FB15 > THEB I = 1+TBIDX (FB15) ♦ ( (IDX-1) »BPC) ; ELSE SEEDS ■ 'O'B: IF ONITBACE THEN IP SEEDS TBEB POT SKIP EDIT f'NEXTSEED IS • ,1) (A, F (4) ) ; ELSE POT SKIP EDIT('NEITSEED XS OOT OP SEEDS') (A); BETOBB I""' END tilll BETOBB (I) : [TSEED; PBOCEDOBE TO SELECT BEST NEIGHBORHOOD OSIBG CRITERXOB LIST •/ CBITTAL: PBOC BETOBBS (FIXED BIN (31)); DCL *B /» BOHBEB OP 1BPEREBCES */ FIXED BIB(31) , ATEB /* AVERAGE BETEREBCE TALOE */ FLOAT, CCASE /• CASE LABELS •/ (7) LABEL, CHAX /• BAXIHOH CBITEBIA TALOE •/ FLOAT, CBIB /♦ BINIHOa CBITEBIA TALOE */ FLOAT, PC /» CBITEBIA ETALOATIOB TALOE */ PLOAT, FIBST /* INDICATES FIRST RGB ETALOATED */ BIT(1) ALIGNED, IKIN /* NGB NOBBEB BITH LOBEST TALOE •/ PIXEE BIN (31) , fl CI /• BAXIHOH DISTANCE TALOE */ FLOAT PEB /* POINTEB TO EB •/ POINTEB. PKLNE /» POIHTEB TO NLNE */ POINTEB, PKLKE /* POINTER TO BLBB */ POINTER, B /» REFERENCE TALOES */ (NCHAX*BPC) FIXED BINM5), SOBEFIT /* INDICATES NOBBEB OP BGBS TO COBSIDEB*/ FIXED BIN (31) , 48 STBT LBB IT AQ70BI - TBBSIOB 2 595 596 597 599 600 601 III 601 605 606 609 in itt 615 616 617 618 619 620 m \i\ 628 \\\ III \\\ US 638 639 640 641° 642 643 644 645 646 647 648 III III 659 660 1 2 663 664 ill 668 669 670 671 672 673 674 675 676 677 678 II 118 681 682 683 684 685 666 687 5 1 5 1 1 | i i 5 4 I I 5 6 5 6 I I 5 6 5 7 I l 5 6 5 5 S 4 5 4 5 4 5 4 5 5 1 I 5 5 5 4 5 5 5 6 5 6 5 6 5 5 0BO0BD /• OPPBB BOOBD 01 C1ITBBA fALOBS «/ FLOAT, (C.I.J, E,l,B,B,0) FIZBO 111(31) ; PW.il - ADCSf8I.II); IP DOT TBI! POT SKIP(2) EDIT ('SELBCTIIG BBST BSICBBOBBOOD') (1) ; SOdBPIT-2: IBIB - 1; BUB - BEPBESB: 00 1-1 TO BC8IT BBZLE (SOBEPIT>1) ; IP 00T TBBB POT SKIP BOIT ( T 10f lPPLIIBS CtIT #*, PiSiriTim^'^" 00 J-1 TO B6B; IP -BLIB(J) TBBB DO: PBLB1 - ADDB(BlBBtj)) J 60 TO CCASE(CLIST|l ; CCASI(11 : PC - -B6BB (J) »*JB; ' GO TO BB; CCASB(2) : fLBB-BOOMPBLBB^BT.SPABBBASI,' 1000'B) ; C-0: DO t - 1 TO Bf; IP (0iSPBC(IaBSTBJpiltBB->Cf,O. ■)) ) TB1B IP (OBSPic (SUBSTB(PBlBB->C?,0.ih) Till C-C*1; BBS; PC-C; 60 TO BB; CCAS1(3) : ILBlt-BOaMPMLBB^BTrSPABBBASK.'IOOO'B); POO.O; 00 I - 1 TO B?; If" (OlipBC (SDBST8 |pBt>B->CT , 0, B) ) ) TBBB IP (OBSPIC (SOBSTB(FIXBB->CT, 0,1))) TBBB fC-fC*I (K BBC; 60 TO BB; CCASB(4) : GO TO BB; PC CT,B,1) ; BBILB Ifbll > 01 J B - TIIDX(PB1S*«L; PC«PC*U(BCI.ASS(B) .1ITE(B) ) ; PC1 » TBABSLATZ(PC1,TB0Bbp); 111); L - I ♦ BPC; IBS; 60 TO BB; C-0. TO B? POPOLATIOB (PHLBB.CO (I) , BC (K) ) ; L < II. (K) TflEB C-C*t; CCASE(6) DO K - 1 L IP BID; POC: 60 TO Bfl; CCASE(7): PC-O.O; DO B - 1 TO Bf B - BCjB); - CO(B) . AfBB -0.6: •■ DO B • TO 0*1-1. PC1 * SOBSTB(PBLBB-> SO BBIL| (FB15 > 0) ; BCjtB] BLIE->C»,B,1) ; 1-0; LB (PB •B - ?B*1: B(iB) ■ L*TBIDIJFB15); FEB - AVB8*B(«I) : :1 - TBABSLATB(FC1, .JS; 1 - L*BFC; PCI I HO; TBDBOP) ; IBD: DO B - 1 TO *B: BDI * lBS(A»BB-B(B)) ; DO; BDI IBD: PC - PC BBC; BBC; GO TO BB; BB IF IP ♦ (BDI / #B); TALOE IS : CBIT(J) - PC: OOT TBEM POT EDIT ( • H6B', J. • ( ?i C UhHifi ? l Jo , ;' A ' i(10 ' 3 ' <,f,; IHII«J; ?HI«SWb? ,I,(J,S BIG: ELSE EC* IP CBfH>CBIT(J) TBBB DO; CBIB-CBIT(J) ; IBIN-J; EBB: ELSE IP CBAKCBIT(J) TBBB CBAI-CBIT (J) ; .PC) 49 ■THT LEV «T AQ70NI - VEB3I0N 2 686 669 690 69'. 692 693 690BO0ND THEM DO; ELIB (J) » *1'B: IP UNITBACE THEN POT EDIT ( • RGB • , J , * ELIBINATED') (X(4),A,P(«),A); BIO: ELSE SGHBFIT ■ SOBEPIT ♦ 1; END; END: BID: BETOBN (IBIN); BND CBITVAL; /• PBOCBDOfii TO GENERATE A NGBBHD: PBOC (NGB»); BBICHBOBBOOO •/ DCL ADDED /• BOBBER OP BVBHTS ADDED LAST */ PIXEE BIN(31). CBHEV /* NEXT EVEBT TO PBOCBSS •/ FIXED BIN (31), D1CHK /• INDICATES DENSITY HOST BE CHECKED */ BIT (1) HOPELESS ALIGNED, /• INDICATES DENSITT CANNOT BE BET •/ BIT(1) ALIGNED. LASTEV /• EVEBT LAST PROCESSED */ FIXBB BIN (31) , LASTOPEATE /* NOHBKB OP LATEST UPDATB •/ PIZEC BIN (31) , N /• HOBKING STORAGE POB NGBB ♦/ *iE /» BOBBER EVEBTS IN EE •/ PIXEE BIH(31), " ET1 TENTS IB BB •/ PIXEE BII(3U, •LNE /• AREA OP COBPLBX •/ FLOAT, IBEE /• BOBBEB EVENTS IB BEB */ FIXEC BIN (31) , DEN /• DENSITY OP COBPLEX */ PLOAT. NBABK /* BANK OP THE COBPLEX •/ PIXEE BIB(31), SEED /• SEED EVENT FOB THE NEIGHBORHOOD */ FIXED BIB (31) . NGB* /» BOBBER OP BEIGHBOBBOOD •/ PIXEE BINJ31J. NGBOK /* INDICATES THRESHOLDS SATISFIED */ BIT(1) ALIGNED. OLDEV A EVENT LAST SOCCESSPOLLT INCLODED */ PIXEE BIN(31), PLNE /» POIBTBH TO LNE •/ POINTER, PSLNE /• POINTER TO HLNE */ POX H TE B (EB1,PH2)'/» POINTBHS TO 81, B2 •/ SNGL /• INDICATES EVENTS ADDED ONE AT A TIBE •/ BITM) ALIGNED, SCHEOK /• INDICATES SOBE EVENTS HERE ADDED */ BITM) ALIGNED OPDATESAVED PIXEE BIN BIEE /• HOB* VALUE POB *EE */ PIXEE BIN 131), WIEB /* HOBK VALOE POB *EB »/ FIXED BINJ31). MILNE /• HOBK VALUE POB tLBE */ FLOAT, WINEE /* HOBK VALOE FOB tBEB */ PIXEE BIN(31), BEEN /* SOBK VALOE POB DEN ♦/ FLOAT, (I.J,K,L) FIXED BIN(31); PH1 = ADDB(W1): PB2 ■ ADDB(82); PULNfc = ADEB (NINE) ; FB15 = 0; SNGL_= 'O'Bi DTCHK ■= DT > 0.0; /• BUILD BANK CHAINS •/ D /* UPDATE BOHBEB BITH SAVED DATA */ ORK VAL0E FOB ADDB 0) ) ; AIDED =0: DC BHILE (CUBEV>0) ; 50 S1BT LB. IT 4Q70BI - msiot 2 739 708 719 750 77i 7?; m 8C8 809 m i 812 813 814 815 816 817 818 819 820 m ■IP B1P0BJ GIIEIALIZI LASTET * COBB?: ILIE - BLBE I fc (COBBT) ; S0BSIB(BHBI.COBBT,1) - M'B; ItlEI - BtNBE ♦ 1; ADDED - AEDED ♦ 1: COBB? ■ IBAMKCICOBBT) : IP SBGL TBJB CO TO OIBOILT; BIO: OBBOBLI: IP (II¥ABS»#S»AIS) > TBIB DO: IP DIBOG TBBB POT SUP IDIT( T BIT ciSi'tiBihEii.; IP DEBDG TBBB POT SKIP EDIT ('BIT IIP OP BAIE' .1 ,ILIE,IIBE) IP Tfpi-^DC^ T&BI ^0* 5 B i * 1 TO 10* IRILI (IGBOK) ; 81 - ILB1 t IQ(J) .IIT; BGBOK « T 0'B; BO I • 1 TO IT IBILBi-IGBOK) ; IP lAIBB(L) - ' ■ full IP D»SPBC(S0BSTB(PB1->Cf,CO(L) ,»C(L) ) ) TBBB; ELSE IGBOK-M'B; * u r • (?VGBB BOT DISJOIBt""biTB 1ISPXCT TO COBPLBX f'.J) BfLBI - 0.0: II I6BOI I (ST \ TBIB DO J « 1 TO IT- L ■ PQP0LATIOIJP|LII.Cp(J) .IC(J)) ; IP L>0 Till 11111 - 6ii.li * t; IP l-IL(J) Till K - 1-1; I?_l>l?_1 l-'O'B; ELSE DTCBK BIB IP IGBOK t DTCBI IP HiLBB < 1.0 TBBI I > 0. TBIB S3! HOPELESS'- (*EVV / ■ •LIE) < pi: IP DIBDG TBI! POT SKIP DATA (ML IP_7 jKBOl I BOPELISS) ItLIi ■ 1.0: IP IIIII > 1 TBBIBO J - 1 TO IT: L - PO»DXmOSjPfLII,CO(J).fC{JJ) ; IP L>0 TBI! MLII - BtLtfX • L; 110; BID; BGBOK ■ (IIIII / BILIE) >- DT: -?B / HILII) < Bi, POT SKIP DATA(llLlI, IGBOK, BOPELISS, SOUOK) ; ^ BOPBLBSS) TBBI BO; ■«Ed - BtMEE: BEB - BIKE: CALL ICCT (I,COBEV,»«EB,BEB,iLIE) ; 8IEE - 0; WEE - 'O'B: IP BABKS(0)>0 TBI! CAU. ICOf (0, BAIKS(O) , MEE, IEE, ILIE) J BDII - (8#EB«I«EB) / ItLIB; IGBOB - IDII >- DT; IP IGBOK TBI! DO; IB(IGBI) - III; IBJIGBI) - IBB; V.fEB - B*EB; b.tll - MEI; I.CII ■ 8DEI; OPDATESATED * LASTOPOATB ♦ 1; III; IIC; BIB: IP IGBOK TBI! BO; SOBEOK - M'B: LASTOFEATB - LASTOPOATB ♦ 1; MLIE(IGBl) « BLUB; BBEJBGBI) - llll; l.illl - BILBE; N.tllE ■ IIIII; I.IBABB - I: OLBII - LASTBT; BIB: ELSE IP (- OP1) TBI! BO: IP (- 3IGL) TBIB IP ADBBB>1 TBBI BO; IP G oilTBACl"TBBB B pOT SKIP LIST('STAITII6 SIIGLI BOB!'): COBEV ■ BAIKS(I); /* STABT OTBI •/ BID; ELSl'lP (- OP2) TBBI DO; IP CEBOG THE! POT SKIP EDIT ( • SKIPPIIG OTIB ETBIT', LASIET) (A,P(«J): IP COBEV-0 THE! IGBOK - SOBEOK; ELSE BGBOK - M'B: IP OLDET <~ TBI! BAIKS(I) * COKIT; ELSE EBJ ••■ EBIIKCj BABKSl IP BGBOK TBBI DO: IP N.NBANK <» O.THEB GO TO IGBOK - M'B: D£V <» TBBI BAIKS(I) > EIAIKC (OLDET) * COBBT; C(LlSTiV) ■ BAIKS(I*1); i(I*1) ■ LASTBV; E8D; EBD; BID; END: IP LA5T0PDATE > B.tKBE,B.«EB ILIE - 'ILIE(IGBI) ; WNEE ■ lEiHsGt*); WILBE = N.FlKE; ' UtKEE ■ N.IIEE; THE! DO; • i; 51 TBT LEV IT 832 5 2 833 5 2 834 5 2 835 5 2 836 5 2 837 5 2 838 5 2 839 5 1 840 s I 841 5 BUD 5 3 845 5 4 846 5 4 817 5 4 848 5 4 8 09 5 3 850 5 3 851 5 2 852 5 3 854 5 3 856 5 3 857 5 Q 858 5 4 859 5 4 860 5 4 861 5 3 862 5 3 863 5 2 864 5 1 865 5 1 866 5 1 867 6 1 AQ70NI - VEBSIuN 2 868 6 1 869 6 1 870 6 2 671 6 2 872 675 6 3 6 3 876 6 3 877 6 3 878 6 2 879 6 2 880 6 1 881 6 1 862 6 1 883 6 2 664 6 2 865 6 1 666 6 2 e67 6 2 668 6 3 869 6 3 890 6 4 8S1 6 4 892 6 4 893 6 5 894 6 5 895 6 4 896 6 4 8S7 6 4 898 6 4 899 6 4 9C0 6 3 901 6 3 902 6 2 903 6 2 904 6 1 905 6 1 906 5 1 9C7 6 1 •INE.N.DEN ■ 1.0; •E£,N. NBANK = 0; E 1 TUEi DO J * 1 TO BT; L = POFOLATION (PLNE.CO (.7) ,NC(J)) ; IF L>0 THEN B.iLNE - N.ILNE • L; IF L=NL(J) THEN K •* 1-1; END: If K>SI THEB CALL DBOPSEL (PLNE,K-ST) ; END: IF LA5TDPDATE •*= 0PDAT1SAVED THEB DO: B.*EB = N.BHEE; EB (NGB«) - »BE(BGB»); N.*£E = 0; EElNGBt) « 'O'B; IF N.tNEE > 1 THEB DO: IF OLDEV>0 THEB OLDEV = ERAHKC (OLDET); CALL ECOVjN. NBANK, OLDEV, N.IBB.EB (HGB1J , B¥; BLBE(BGBt)); IF BANKS (0)>0 THEB CALL ECO? (6 , u \BK S (0) , B. #EE,EE (NG B« ) , NLEE (NGBI)) ; END; N.DEN = (N.#£B»N.#£E)/B.#LBE; EBD; END: NGBB(SGB») s B; IP DEE0G TBEN POT SKIP DATA (BGBB (BGBt) , BLBE (BGB») , BEE (NGBt) , EB (NGB*) ,EE(BGB#) ) ; PBOCEDOBE TO CBAIB EVENTS BT RANK •/ BANKCBAIN: PBOC (SEED) ; DCL f?£BT /• EVEBT N09BEB */ FIXED BIB (31), ' THE SEED EVEBT BOHBBB •/ BIB (IT) , SEED /* THE FIXED " (I,J,L,B) FIXED BIB (31) ; PB15 ■ 0: IP *HAVABS>0 THEB DO; HLN£ = E (SEED) ; DO 1=1 TO tNAVABS; B = NAV8BS (I) : IF SUESTB(ULNK,J,L) THEN: BL(B); J = BO (B) ; L i , J , L) THEN ; ELSE S0BSTB(BLNE,J,L) " ONES; END; HLNE = - BLNE; EN£: ELSE BLBE = - I (SEED) ; L = 1; DO I = 1 TO BANK+1; BANKS(I) = 0; £ H E ' DO I = 1 TO CIE: FC1 = SUBSTB CV,I,1) ; DO BHILE (FB1S > 0); EVENT = L+TBIDX (FB15) ; IF EVENT ->= SEED THBH DO; 82 = BLN£ 6 E (EVEBT) ; B = 0; DO J = 1 TO CLEB BHILE (H<=»BANK) : IF SUBSTB (PB2->CV, J, 1) — LOB(1) THEB B=B*1; END: IP UNITBACE THEB POT SKIP EDIT (' EVENT' , EVENT, •IS OP HANK'.B) (A,F(4),X(1),i,P(4)); IF B < 1 THBB 1=1: EBABKC (EVENT) = BANKS (B) ; BANKS (B) = EVENT; END; FC1 = TBABSLATE(FC1,THDH0P) ; END; L * L ♦ BPC; END: IP DEBUG THEN PDT SKIP DATA (BANKS, EBABKC) ; END BANKCBAIN; /* PBOCEDOBE TO FINE COVEBED EVENTS */ ECOV: PBOC (SBABK, SEVNT, COUNT, HAP, LNE) ; DCL COONT /*_CCBBENT POPULATION COOBT */ INK /« FIXED BIN (31 FIXED BIN (31) , LINK /« LINK TO NEXT EVEBT ON BABK CHAIB LNfc /* BIT REPRESENTATION OF COHPLEX */ BIT (*) ALIGNED, BAP /* BIT BAP OF EVENTS COVEBED */ BIT (*) ALIGNED, FLANK /* STOPPING BANK VALUE »/ FIXED BIN(31), StVKT /* STABTING EVENT NOBBEB */ FIXED DIN(31), SEANK /* STABTING RANK VALUE •/ :;k /* FIXED I BIN (31) , I FIXED BIN(31) ; 52 STBT LB? IT ZQ70II - TBBSIOB 2 908 909 910 THE! PBEBE * BAII*1; ELSE PBABK - 0; LIBE ■ SBTBT; DO I - SBABE TO PBAIK; 00 SHILZ (LIIZ > 0) : IP DBITBZCE TBBB POT EDIT ( 'ZTZIT* • , LIII) (X (2) . A, P <«) ) ; K2 - B1 t ZJLIBB): IP B2 TUB IP OiItBACE THEI POT EDIT (' IOT COTEBED*) (A) USE: ELSE DO: COO IT ■ CO0IT*1; S0BSTBiBEP.i.iBE,1) • 'VB: IP OBITBACE TBBB POT EDIT}' IS COTEBED') (E) ; ZBD; UHE - EBEBEC(LIBK) ; IP KPBEBE TBEH LIU - BABES (1*1); EBI: BBS SCOT; /* PBOCEDOBB TO GBIIBALIZI SBLBCTOBS •/ GSIZIALIZI: PBOC; DCL PB IB /• BOBBEB OF PIIZD BIB (31 PBLB POIBTEB, PISH /• LEST CHAB BOBBBB */ PIXED BIB (31) , I BITS */ POIITBB TO ILBE •/ STBT /• STABTIIC CBAB BOBBBB •/ PIIID BIB (31), a, J. 1.1) PIEBD BIB (31) ; PBL|Z_- o EDDB(BlBl); DO I - 1 TO fITEBS; » - IBTfEBS(I).; L - BO(t) ; STBT - CO(T): PISH DO J - STBT to PBSB STBT»IC(¥) -1; PC 1- "I OBSTB (Ml BB->CT . J , 1 ) ; IP PC1 — LOB(1) TBEI 60 TO PSTBIT; 1 - L ♦ BPC; ZBD; CO TO BOI; /• BO BITS 01. SEIP TO BBZT •/ PSTBIT: PP. - L*T8IDX (PB15I : t « ((»C(T)-1) * BPC) ♦ b6]T): IP J < PBSB THEI DO J - PISH TO SOBSTB (PBLBE->C¥ . J , 1) ; THZB GO TO LSTBIT; PCI IP PC1 — L0fl(1) I - I - BPC; ZBD: LSTBIT: DO WHILE (PB15>0) ; KB - PE 15: PCI - TBAfcSLZTE(PC1,TBDB0P) ; ZBD: BB - (L*TEICX (IB) )-PB»1 IP IB > 2 TBEI SOB BOI: BBC; STBT BI -1; STB (BLBB, PB,BB) - OBBS; DO I > 110 BSTEBS; T - STB DC TABS (I) ; L.BB - 0; SBBOBE - OBIS: SI - DOBEATA (DOHI (¥) ) .STBOCIDX: SIBT - CO(V): PBSH « STBT*IC(¥)-1; DO J - STBT TO PBSB; ZC1 * S0BST£iPHLIZ->C»,J,1) ; CO BHILZ (PB1S>0) ; SBHOBK - SBBOBK C SBITS (SI*L*TBI DX (PB1 5) ) ; NB - HB + 1; . PC1 « TBEBSLETE(PC1,TBDE0P); ZBD; I » L ♦ BPC; EBB: IP BB>1 TBEB DO: J ■ IBDIX (SBBOBK. ' 1'B) ; IP J*0 TH BSTBlBLMi t BO_(T) , IL{¥) )»OBSS ir »*— ■ u mis JUDJiBiiitPbf ouii ILSE SOBSTB (MLBE,BO(V) ,BL(¥) ZBD; EBI: END GZIEBELIZZ; * SBit3(SI*i-1*BL(¥)); /* PBOCEDOBZ TO ELI BIB ATE LESS DESIBABLE SBLBCTOBS */ DBOPSZL: PBCC (PL8E,C); DCL COONT /• BOBBEB OP BITS POB EACH VAEIABLB */ BV: SOBSTB (PLIB->BV,BO (DBOPVAB) , HL(DBOPVAR) ) -ONES; IF TIPE= , DC» TBBH DO; L ■ 1j PB2 ■ ADDBJH2) : DO J- 1 TO BQ# BHILB(L=1); L » 0: B2 = PLHB->BV 6 BO (J) .III; CO I = 1 10 IV SHlLE (L-0) ; IF NAXBD(K) = • ' THBH IF ONSPBC (SOBSTB (Pf2->CV, CO (K) ,NC(K) )) THEN; ELSE 1=1; END; END: IF L=0 THEN DO: SOBSTB (PLNB->BV,1,BLfil) - B1; COONT (DBOPVAB) - 0.0; END; END; IF CGONTJDROPVAB) > THEB PO; D ■ D-1; IF 0NIT8ACE THEN POT EDIT ('VARIABLE* , DBOPVAB, • DBOPPED') (A,F(4)) ; END; END; END; XHX: IF DEBOG TBEN POT SKIP EDIT ('BIT HAP AFTBB DBOPSEL • , PLNE->BV) (A.X(5) ,B(BLBB)); END EBOPSil; END NGBBHD; /• PB0C2D0BE TO LIST EVENTS COVEBBD BX NEIGHBORHOOD •/ NGBHEPOBT: PBOC; DCL PIE /* PCINTEB TO BE */ POINTEB, PEB /» PCINTEB TO EB */ POINTEB, I FIXED BIN (31) ; FB15 = 0; POT SKIP; DO I > 1 TO NGB; POT SKIP ECIT( , NGBB , ,I.' 'I (B,F(31 1 J IF BEFBESH(I) THEN POT EDIT ('iS IDLE') (A); ELSE DO IF POT rEHTS COVERED II EB:*) I-BGL THEN POT EDITf* (COHPLBX* . (BQ«-»1), ' )•) (A f F(3) ) ; T EDIT (•BANK =• . NGBB jl) .NBANK, 'ABEA «■ .NGBBjI) . §LNE, •DENSITI =',NGBfi(I) .DEN) (COL (25) , A, F (3) , X (5) , A, " 10,3,4) ,l'(5), A,E(10,3, 4)') : SKIP EblT(BGBB(I).SBB, a BVI OL(10) ,F(J).A); = AEDB(EB(I>) ; POTEVTS (PBBl: POT SKIP EDIT(IGBB(J P*i C 2 l .2&tfi ifft J IF NGBB(I) . IEE > 1 DITjlGBB(I) ,«£E,' EVENTS COVEBED II EE:<) END; END; THEN CALL POTEVTS (PEE) ; /• PBOCEDOBE TO BBITE AN EVENT LIST */ POTEVTS: PBOC (PE) ; DCL C /* TYPE 0? ENTBI (E-EVEIT,S-SE£D) CHAB(1) ALIGNED, EV /« EVENT NOHBEB */ FIXED BIN (31) , BO /* COLUMN NOHBEB FOB FOBHAT */ */ FIXEC BIN(31) , PE /* POIIiTEB TO POINTEB, tEVr- FI SEED EVENT BIT HAP */ PEEVCLASS /* CLASS OF PBEVIOOS EVENT */ FIXED BIN (" ED /* SEEI _ FIXED BIN (31) , FIXED BIN(31>, SEED EVENT NOBBEB V 5* StBT LIT IT AQ70BI - TUSIOI 2 1048 10|S 1072 1075 1076 1077 1081 1062 1063 1060 1087 1088 1090 1091 1093 ioTs 1096 1097 1098 1099 1100 1101 1102 mi 1105 1106 1107 1108 1109 1110 1111 ijjj nt) 18 19 1120 1] (J,L) PIIIO BIM(31) : ■0 - 0; L - 1; SI 10 - IGBB (Il-SIID; PIITCLASS ■ -1: 00 J ■ 1 TO CM: FC1 ■ SOBSTB (tE->Cf,J,1) ; DO !HILI (PB15 > 0) : IT » I ♦ TBIDI (PBlS) : IF ECLASS(ET) — PEITC1 5[I») PBITCLiSS - ■0 « HO ♦ 1 CLASS TBI I DO; ECLASS(IT) ; IF BO > 20 faiB BO - 1: POT ICIT I'C'.IOJ (PBITCLAS3.0) ) (COL (32* ( BID. 10 ■ to ♦ 1; IF BO > 20 TUB BO - 1: IF IT ■ Slip Till C • •§'; IO*«)) ,A,A); SB /• 1IDIIG CIAI POSZTIOB IB LIB •/ $ IBD BIB (IS). /• OOTPOT LI IE IIA6B •/ ABJ200) TAB ALIGIID, * LEBCTU OF OOTPOT LllI */ BOPOT /* TBOI IBILB 10 OOTPOT PBODOCID •/ BITp) ALICBIO, PABB /* IIDICATI5 COBPLIXIS TO PBIIT •/ FIIID BII(31), PBC /* LAST BO tO PBIIT •/ IlXID BIB(lS). PBLBI /• POIBTBl TO BLII •/ POUT IB, SI /• SIBOCTOBIS IIDIX */ FIIID BII(31), SBC /• StABTIBG BQ BOIBBI FIIID BIB(15) STBT /• FIB.' [ID BUMS), /• FIBST CB FIIBD BIB (15) , BQ BOIBBI V AB POSITIOB IB LII */ (I,J,K.L,P) FIIID BIB(31) ; FB1S.SI.II - 0; IF PABB>0 f~ ILSE CO: SB IF PABB^O TBII SBQ.PBQ - PABB; ELSE CO: SHQ«1: PBQ-BQI; " DO I « S8Q TO PB' IBD; EDIT ( •COHPLII' ,1) (A,F («) ) ; I - SBQ 10 PHQ: NLIE - IDCB(BQU) .IIT) : F PABBOO TBBB POT SKIP ~ PABB-0 TBIB DO; POT £DIT( T OF BAlK *.HQ(I) .'(Bill ' COTIBS* K.' IT1ITS ( T .IQ(i).flI,* Bill IITB OBI _ (i,F(3),A,F!5f,X,F(3),A,I(l3,3,l)); IDS DIBSITI OF', BQ (I) .DIB) •1'lj Lilt - ' ': BOPOT DO J ■ 1 TO BT; SIBT « CO(J): FBSB ■ STIT*BC(J) -1 ; P P POP0LATl6B(PBLBI.STBT,BC(i)j ; IF P — IL(J) TUB DO; LII£ - LIBI I IF P ■ THBI ELSE DO; L - 0- IF OOBAIBS > TBIB BI-DOBDATA (DOB* (J) ) .BABISIDX; TBII DO: II • (« || TABBAII(J) || •-•; II LIBI - LIBI || 'l.A.) •; IF TABTIPB(J)»'F» TBII DO; CO K =• STBT TO FISB FC1 ■ SDBSTB(PBLB1->CT,K,1) ; ' BBILB (FB15 > 0) : LIIB-LIBE II BOBITBIDI (PB15) »L,BI) || ',', FC1 * TBABSLATI(FC1,TBDBOP) ; BID; I - L*BPC; IBD: SUBSTB (LIIE,LIIGTH (LIB!) , 1) LIIE « LIBI II • '; EIC: ELSE IF TAITrPIiJi-•I , THII DO; DO K « STBT f<3 FISB: FC1 - SUBSTB (P8LBI->CT. 1,1); "1(1) TBII CO TO END; IF FC1 -^ LOll(1) TBI! L - L*BPC; 6ITBIC; GETBEG: BT - L«TBIDX (PB1S) ; l-(BC(J)-1)»BPC; IF K < FBSB TBIB DO E - FISI TO STBT BT -1; 55 STBT LEV NT AQ70BI - VEBSION 2 1121 1122 1123 1 12*» 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1110 1141 1142 11*3 1144 1145 1146 1147 1148 1149 1150 1151 \m \\n 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1176 1177 1178 1179 1180 1161 1182 1183 3 4 1184 4 ilea 4 1169 4 1 1190 4 1 1191 4 2 1192 1193 4 2 4 2 1194 4 2 1197 4 2 1198 4 3 11S9 4 3 1200 4 4 12C1 4 4 I I MOH(EV,BI) ; FC1 * SUBSTB(PWLNB->CV,K,1i ; IP PCI — LOH(1) THEN GO TO GETBHD; L * L-BPC; END: GETEND: DO WHILE (PB15 > 0); EV « PB15; FC1 * TRANSLATE (PCI, TRDBOP) ; END; EV * L*TBIDI(EVI ; LINE ^ LINE [I NOh(BV.NI) : IF EV > BV THEN LIME ■ LINE II LINE * LIME M •) • ; ELSE If VABTTPE(J)*'S' THEN DO; SBUOBK ■ ONES: SI ■ DOHDATA(DOB#(J)) .STBOCIDI; BV = 0; DO K < STHT TO PBSH: FC1 = SUBSTR(PNLNE->CV,K,1) ; CO WHILE JFB15 > 0) ; EV ■ TBIDI(FB15) ♦ L; BV * BV ♦ 1; SBBOBE » SBBOBK t SBITS (SI* FV) | FC1 ■ TRANSLATE (PC1,TBDROP) ; BID: L - L*BPC; END; IF BV > 1 THEN DO: EV ■ IBDEX (SBBOBK,' 1'B): IF EV=0 THEN LIBE * LINE II • EBBOB. ..•; EV ■ EV-1*BL(J) ; END; LIBE i LXIE || HOH(BV,BI) if ') •; END: ELSE POT SKIP LIST('PBCOVEB BSCEITES ILLEGAL CODS'); END; IF LeIgtB(LIBE) > 120 THEM DO; PUT SKIP EDIT (LIBE) (A (LL) ) ; NOEtJT = 'O'B: LINE ■ SOBSTB (LIBE, LL) ; EMC; LL ■ LENGTH (LIME) ; END; END; IF LENGTH (LIME) > 1 .THEM POT SKIP EDIIJLIEEi (A) ; ELSE IF hCFCT THEN IF PABB=S THEN POT SKIP EDIT NIT COHPLEX ) ') (' ( ONIT COBPLEX ) •) (A); ELSE POT SKIP EDITC ( NOME )•) POT SKIP; END; END PBCOVEB; (M; BLKC EKC: EBD BLKC; NEXT.COVEB: ill CBEOBI; /• PBOCEDOBE TO DXTEBBIME BIT POPOLATIOB COOMT •/ POPOLATION: PBOC (P, START, L> BETOBMS (FIXED BIN (31)); DCL L /* N08BEB OF CHAfiS IN STBIBG TO BIT-COOBT */ FIXED BIN (15) . P /* POINTS TO STRING NHOSE BITS ABE COOBTED */ POINTEB POP /* POPULATION COOBT •/ FIXED BIH131), STABT /* CHAHACTEB OFFSET AT BHICH COOBT STABTS*/ FIXED BIH(31 CABT /* CBAHA . . FIXED BIN (15) , I FIXED BIN (31) ; POP = 0: FB15 - 0; DO I » STABT TO STABT*L-1; FC1 = SOBSTB (F->CV,I,1) ; POP = POP ♦ TRPOP(PBl5); END: BETOBN (POP): END POPOLATION; PBOCEDOBE TO BEAD VECTOB EVENT DATA •/ BEADVEC: EBOC; DCL IE /» EVENT BOBBEB •/ FIXED BIN(31) ( PE /* POINTEB TO ELEBENT OF E */ POINTER. VN /* VARIABLE NOHBEB OB OOTPOT LINE */ FIXED BIN (31) , (I,J,K) FIXED BIN(31) ; IE = 0; NAVARS = 0; tBAVABS = 0; NAIND=* •; DO K=0 TC HAXCL: PO^SKIP^ fctlT ('CLASS F(',OLIST(K) .') ') (A,P(2) , A) IF PNTE THEK POT SKIP EDIT('EVEHT NO. ',1,'=') (CCLM8),A,F(3).A) ; IE ■ IE ♦ Is PE = ADDR (E (IE) ) ; EEVN(IE) = I; ECLASS(IE) * OLIST ( K) ; VB = 0; DO J = 1 TO NV; GET LIST (VAL) : IP PNTE THEN DO; VN = VN*1: IF VN>27 THEN VN=1; 56 STBT LBV NT ]ffi 4 4 1204 1205 4 4 m 4 4 11U 4 4 4 1211 4 1 4 4 4 ! 1215 4 1216 4 1 1217 1218 4 4 \ 1219 1220 4 4 \ 1221 4 1222 3 1223 4 AQ70BI - TBBSIOB 2 1224 mi 1229 12 12 3i ii I] 35 I 6 )l 37 38 12 39 40 41 1242 1*3 244 1245 1246 33« 3 3 1244 3 2 3 1247 3 1248 1249 : 1 1251 : 1 \m \ \ I mi i | 3 1260 1 1261 1 1262 1 1263 1 1264 1265 1 138 : 8 IF TAL>«0 THBB POT EDIT (TIL) (COL I 35* (T»»3| ) ,t (3) ) 1LSB POT MITC »A«) (C0i(35V(f>«j)),i); IF TAL >» ML (J) IBIM DO; TAL « BL(Ji-l: POT SKIP LIST('*** TABIABLE',J. ♦iBCOBBBCTLI SPBCIPIXD') ; PIOSB - M'B; IF Til >- TBBB SDBSTB(PB->BT,BO(J) *HL, 1)-M'B; BL3X BAIBD(J) «•♦•;' BBC; BBC; BBD; DO K - 1 TO BT; IF BAIBD(K) - •♦• THBB DO; •BATAB4 - flATABS ♦ 1; BATABS(BBAT ABS) BBO; BBD: BID BBADTBC; K; /« PBOCBDOBB TO BIAC GABBA BTBBT DATA •/ BEADS la: PBOC; DCL BTAL /• PIIBD IB /• BTBBT fix.:: 6AB /• GABB IIB DICODED TABIABLB TALOB •/ BI> (31). BIT BOBlBB IB •/ __OB •/ FIIED §11(31). PB /• POUT IB TO BLBBBBT OF B •/ POIITIB, (I,J,B) FIZBD BII(31) ; 0; DO K»0 TO BAICl: POT SKIP (2) ICIT ('CLASS P('. OUST (K) ,') ')BT, BBD; BBD; BBO: BBD BIADCAB; BO (J) ♦BTAL, 1) ■ M'B; BLEB BBD: IP ALLOCATIOB (B) TBBB FBBJ IF AILOCATIOB(Z) TBBI PBBB X; BBO BUB; /* PBOCXDOBB TO B Bill I BOBBBB OB ASSZGBXfi SIHBOL •/ BOB DCL : / PBOC (T.BI) BBTOBBS (CBAB130) TAB ALXGBBD) ; * BOBBBB COBSTBOCTIOB ABBA */ HAJ(8) ALIGBBD, D /* C1CXHAL BOBB TALOB •/ FIXED DBC(5' BI /• BABB' FIXBD BI !C(5). tS I|DBI :, j"Ll J TO COI 'HID BIB (31) , TALOB 10 c6HT PI I FIXID BIB (31) ; (IF BOT ZBBO) V IF BI > TBBB BBTOBB (IDIABBS (II»T) ) ; SLSi DO; C - T; C » 0: CO I - 7 TO 1 £l -1; IF S0BSTB(C,I,1) » • • THBB GO TO BBT; BBD; I - 0: BBT: BBTOBB (SHBSTB (C,I*1) ) ; BBD: BBC BOH; BLKA BBD: EBD BLBA: IF FLUSH THIS POT SBIP12) LI.T ('SKIPPIBG TO BBXT PBOBLBB'); IMFOBB » • T : DO BBXLB (IBFOBB -» '•'); GIT SKIP EDIT (IBFOBB) (A(1)); BBC; GBT SKIP; POT PAGE: GO TO NBIDAIA; BBD AQ70BI; 57 APPENDIX II. Sample Input Stream 58 On pages 61 and 62 the actual Input stream for four problems is shown* A complete description of the four problems along with interpretations of the results will be found in [Stepp 79], The first problem is called TRAINS* The data represents ten trains each train consisting of 3 to 5 cars* There are 26 variables defined as follows* number of cars no* wheels on car no* wheels on car no* wheels on car no* wheels on car no* wheels on car length of car 1 length of car 2 length of car 3 length of car h length of car 5 shape of car 1 shape of car 2 Six domains are defined t number of carsi 3 levels no* wheelss 2 levels length of can 2 levels shape of cart 10 levels shape 1 shape 2 shape 3 cargo J+ cargo 5 cargo cargo cargo cargo cargo cargo cargo cargo of car of car of car shape- shape- shape- shape- shape - amount amount amount amount amount 3 k 5 ■car •car •ear •car •car 5 —car 1 •-car 2 —car 3 —car h —car 5 1 2 I a mixture of mixture of 3 k 6 2 8 0-3 cars 1»4 cars 2» 5 cars 0-2 wheels 1*3 wheels 0«short l«long Oaopen rectangle laopen trapezoid 2«U- shaped hexagon ellipse 5*double open rectangle enclosed rectangle 7» jagged top 8«sloping top 9*locomotive 5»open top 9*closed top I 59 cargo shape i 4 levels 0«circle l=hexagon 2= triangle 3=rec tangle cargo amount t ^ levels [0,3l The ten events are divided into two classes, of 5 events each. Judging criteria number 6 is to be used. When the value of a variable is unknown or not applicable (e.g. the length of car 5 for a train of 3 or 4 cars) the value -1 is given to represent this condition. The characterization parameters for TRAINS are MODE^'APPROX' DTalE-6 NGB=8 TYPE^'DC* which designate that disjoint complexes are to be produced such that no complex has a density less than 10~ . The selection of best neighborhood is to be made from among 8 neighborhoods built around 8 different, randomly selected seeds. Because the ULIST parameter is not specified, this characterization will be of the union of the two input classes — all ten events. Skipping the relatively simple second and third problems (BOTTLES and FACES), a few comments are directed to problem four, called ANIMALS. The data describes 79 cute little animals (shown in figure *0, each represented by values of 13 variables. The definitions of the variables can be found at the bottom of page 61, As shown in figure 3 i the animals are initially broken into 1^ classes. This information is stated to the program in line 3 on page 62. 60 Neighborhood judging criteria numbers 6 and 1 will be used to select the best neighborhood during all 18 characterisations performed. Using the ULIST parameter, the first Ik characterizations are made on one class of animals at a time. MODE*' FREE' eliminates the density threshold constraint* The four characterizations which follow are characterizations of all animals, without regard to the input class categories. The first two of the four use RANK and selector threshold to determine the degree of generalization. The specifications RANK-3 ST«8 indicates that complexes are to be composed of no more than 8 selectors and that neighborhoods are to be composed of events which differ from the seed event in no more than three variables. The last two characterizations use RANK and density threshold to determine the degree of general- ization. In these characterizations, no complex is to have a density less than .05* In the four characterizations of all animals (the last four) both disjoint and intersecting complexes are obtained for comparison. The output of the AQ7UNI program corresponding to the input stream reproduced on the following pages is given as Appendix III. 61 I»POBfl*'TECTOB' BAXBV-26 DOSiKS^b BABES-24 STLTLS-12 TITLE*! BAXMAH£LE*«16: "TBAIkS." FBOB iLkiSOt 77 J, PAGE 107. 1 'IBTEBTAL' 3 3 2 •IiIBB»AL:BBBELS' 3 'FACTOB^EHGTH' 4 'SHOCTB:CSHAPE' 10 •4" 2 i 2 o 5 6 26 26 •FACTORrLSHAPB' •IBTBBTAL:LOAD« 4 122222333 'BCARS' 2 ■ « ■ 3 4 1 -1 -1 -1 -1 -1 : •5* 2' '3' SHORT' 'LOBS' OP£B BCTiCL' 'OPBB TRAP. 1 'O-SBAPBD' BXIAGOI* •ELLIPSE* ' DBL OPEB BCTHSL* CLOSED BCTiGL* 'JAGGBD TOP' SLOPIBG TOP* •LOCOBOTITE' OPXI TOP* 'CLOSED TOP* I F ? 9 CIRCLE' 'BBIACOI' 'THIABCLE' •RBCTilSLX* 4444S5SS566666 4) f : 3 • . (4) • • (•)' . 4}' :f -1 -1 -1 -1 0BICLASS-1: B0DB=' APPBOI' DT=1B-6 BOB'S 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0-1 -1 -1 -1 16- 1 I' 6 6 -1 - 2 7- H- -1 - :1 -1 -1 -i -1 2 1 3 0-1 2 2-1 2 3 3 3 0-1 2 -1 -1 2 -1 -1 -1 -1 3 3 3 -1 -1 IIPORB-'TECTOB' TITLE=2 BA ■BOTTLES," FBOB [ BICHALSEI TIPB-'DC; BJJS=H D0BAIIS=« BAXBABELEB»16; 78], PAGE 26. 1 'IBTEBTAL' 2 'IBTEBTAL' •IBTEBTAL' •IBTEBTAL' 12 3 4 • ISQ0ABES' 4 4 2 4 3 3 ' tTRIABGLBS' '♦CIBCLES' '# ASTERISKS' 3 4 4 4 2 1 1 6 112 110 2 2 12 12 1 10 2 1 13 1 12 2 1 12 1 DHICLASS»3: BODE=' EXACT' ST=2 HflB=8 TIPK»'DC'; BODE= , EIACT' ST=2 BGB=8 TIPE^'IC*: BODB='EBX« BT=2 «GB=8 TIPB» T DC«; IBPOBB='TECTOB' TITLB=2 BAHES=4 DOHAI«5=« BAIN ABELE8=1 6 ; "PACES," PfiCfl [BICBALSEI 75], PIGOBE 3. 1 'IBTEBTAL: (CIRCLES' 3 2 'INIEBTAL:*OTALS* 3 3 'IBTEBVAL:»TBIAB6LES' 4 4 •IHTERTAL: (SQUARES' 3 4 12 3 4 4 '(CIRCLES' '(OTALS' '(TRIAIGLBS' 2 4 4 1 1 6 2 2 2 12 3 2 m if], fan 0BICLASS=2: HODB-'EXACT' DT».42 ST=3 BGB=6 TIPB-'DC'; HODE='FKEE« BGB°=6 RAMK*2 TTPB='DC«; I BPOBH= t VECTOR' D08AIHS=13 flAXBABELEB- 10 BAB£S-40 TITLE=2; "AMI HALS," FBOB [ BICBALSKI 75], EIAflFLB 2. (SQUARES' 1 2 3 4 5 6 7 8 9 10 11 12 13 IBTIBVAL:BLK-CIBC 3 3 FACTOB:#TAILS' 2 2 IHTEBVAL: (CBOSSBRKS' 3 3 FACTOR: *£XTB£B' 2 2 PAC10B:T£XTOBE' 7 7 IBTEBTAL: (BBP-CIHC 3 3 PAC10B:(EBP-SQ' 2 2 FACTOB:(EBP-TRIABG' 2 2 PAC10B:TAIL« 3 3 PACTOB:SBAPE* 4 4 FACTOR: (ABGLES* 2 2 FACTOBclEJES' 2 2 FACTOR: (BLK-SQ' 2 2 1 1 1 2 1 1 1 1 1-1 1 1 -1 1 1 2 -1 •0' '1' '2 OR BORE' •0' «1 OR BORE' '0' '1 OR 2' '3' •0 OB 1* '2 OB BORE' •BLABK' 'DOTS' 'BORIZ LIHES' 'BATES' 'DXAG LUES' 'COARSE* • VEBT LIHES' "0 OB 1« '2' '3 OB BORE' •0' M OR BORE' °0' '1 OR BORE' 'BONE' 'STEAIGBT' 'SPRING' •IEREGOLAB' 'ELLIPSE' 'CIRCLE' 'TBIAIG-SQ' e 0' M CB BOBB' •0' «1 OB BORE' •0' "1 OB BORE" 62 13 12 3 » 5 o 1 « J 10 111213 3 '•• ••• *.* '•• •«* '.* •-• '-• •-• •-• •-• •_• •.• • * 5 i 7 fa 9 10 11 12 13 , it. DIICL1SS-18; BODB-'PaEB' HODB-'IBEB* BODB-'PBBB' HODB-'PREB' H0DB= , ?HEB' BOOB**PB£B* BOOB^'PHM* HOOB-'IBBB* BOOB-'PBIB* HOD fliZf BODB-'PBBB* B00B>'?BBE a 600**' tilt' SODfliil* BODB-'PHM' B00B-' PUB* BODB-'ftPPBOX IGB-6 »GB»6 ■ SB-6 ■ SB-6 BGB-6 MGB-6 ICB-6 1IGB-6 BGB-6 BGB-6 ISB-6 BGB-6 BGB-6 BGB-6 B1BK-3 |lBK-3 BODls-'iPPIOI' 6 TIP*-'., NGB-6 TI|•- , DC•; MGB-6 TIPJS-'IC; 63 0. J E X [ M S : 1 SMUXEYS: 2. GRUFFLFS fe^^-^y 4. SNORPS 6 MflLINARKS'- 8. FUBBYLOOFERS: 10. NORLEYS: 12. FLORGItnGRFlES: Ghff^-Aj,?^* ~\Q iW>A 3. SELFFUNGS: 5. SPURONS: 7. SCRANILLEMS: 9. SREFOLYBUFFS: 11. SEYLRONS: 13. SELFRODEIGROLFS: ■MPgff, & SPECIES OF 'ANIMALS' Figure b from [Michalski 75J 61* APPENDIX III Sample Output Listings 65 ■OB IA» o o tn •4 ■4 a J i4 O tn O O ■4 a to * •4 o O J V) V) * J •4 4 O W a a a •4 a 04 a. B ■ a 4 4 4 M a ■ ■ a a a B ■a ■ a M a M B H ■ ■ a u a 8 U) tn ■ a B M H B B V) Ml ►J ►J a i a 19 4 r» en r> tn V\ mi *4 >4 a a a a tn > o a a hi a m a a a -» a >4 >4 a 4 a o <-j oo (N HH O. a oioeu O tna aaOHO a en en -«o* mhh h a ^« gno aaatn a HbOOOOQHa aa OHH jmww OiHHt4 AUOOd MOia aa i o-jo HOAann amu>i oatncm-i i u u MA ChOOU A a I AOJJ1JA I A B t UUHU I I H4 a ua (X UC9 • I AABHCUOa aaa i i uoo ih«q ■ «»* h HUMMlHPq (3H (naHcuotncxaaao 4U(kOHMH8 MZ94 ^ i4 o «n4 »-<■»>« a a •4 a j a a tn • a % a a a a in r» a a a w a a a H ^ H H O-H a Mao a H ■4 ■4 HO» H 8 a a BO ■ a >n»m arxm MIIInI 1 8 a a a a 8 u H H U (N a tn a a a a a M H a a o o tn H ao^fM NOf ao»- M H H o O o tn M a a a H ^ (N rn > a a a a a a K, i o a H M H DM a a a H ■ a a a B B H a s o a s r» Oi a ca a o ana MU a >4a a ••aa tn a aa a a ono a a>4 a a-J'J a 44»i nnoua M Mt» Oi^UI4 H a a Muaan 44SN HfflMHU >4 tNaOM HM8H a aa auBHa a bbhw o a aaaamin H a U H tnaoaia a a a atna a H -4« M asofiui" fcOf^lfl a aa»4H o o H aa 44444 ■ ■■■■ 444P4 ■ ■■ a 4f«404 ■ ■ ■ ONNrvS 44404 ■ ■» m 4*-404 oooo*» 04404 44404 ■■ m aaa ■ "■OrOO 40404 ■ SB ooo*- ooooo eo^eo o M 4 H 4 a o u )^e< NO «- MM JLJUJA ♦ « • • i 22222 MMMMM MMMMM !»*•»»»» MHMMM » • t i « SSSSS |iH*t->H MMMMM MHMMM MMMMM -» U 01 -A (J OM oo 4 MM MK 4M -»■ UD H MM BU H MB oa •4 OM U MM ■ H H I o z a z CM o a u© a a a a 3 OS II (9 1 u a aw B a E» < a w— H H HfS Oi h a»» H H ■ to a •j^ a V « a u • a ^» M»- *^ ^^ —.to CO a fN a a a ■ H r» »r*> fMOPN^ «»^*»^ a p» aw H a a a a aa za H o II a H a mf> *-©»- *» • • a e ato o M H a M t/1 to t o to to to—. M J -J -5 hi f- o an H H HO E a a a Z a ii ■ — i K n •- P4 MP> toil <» a«- a»- w*- H ^ H H H H a a • • » • • • • • 4H H hm »»il S"ll > ii H 9>>> »•»■».». as a an aM an fN u to z a a a a atob» aaaa aaaa oa U a zto a -J H u o— o— o — OS H a ^ ajuin M ^ U e- H« «- II • E ft* a «oi- o «■ II ato »M to to to a a a a a a PiDtlkJ Pw an OtO a a a 1 o a H M H H OZOOU ** *^ oa OJ JT a CO a 6M a a a a Pn ft-. u BU JU M4 a< M< H z B a B B aaaa a< oa as as as a f H o 2 o o HHHM to to aa a JO -JOf ■JO D S <« a Q a aaaa to to OH ^t ato 0 • O to aa 01m U 3 *.H H H 4 o ObH H HH fwfS ^ a a a H a a aa a i| a O 71 M 4 H •1 o too] a «< aa « O a> > > a o at* > ><• >a a * MBfl J -d-. u ♦ Mag ^a a— d_J u -on 4 P* 0)11 «i u o ja » • a o -1M » »^-» »-ffl a 3H BtH • O OH 0 WT- aw a^- a H Hid > II >aa a H MM >ll >M > ii a a a OW OM _ << a to Oto ou OtO < JO o« JH au ua UK oa HZ 10 to to Ha a M a a aw rv|M Jm as oa hi -JO JQ3 6bO fel -JOI -IS JOI ObO ^^ a. to OiH a ^^ &iin iH ---- a CM M «»• «•» H ro a K-m a<» «•• H ^ o— o»» a-» a O w o— O'- a*" "" ' H u (J H ** H u u u H 69 in •*. 10 a •*. H '—I = Cu s •A a 'J ■< Cu to CO 10 to a -) a J a M 4 4 s» » > > a a a J a a a -J CO w to to t «s «< «e =5 £ a a -a 33 3d a a] r» a, Oi 3< Oi jv X X X X •" H H H H 6- -J -J -1 -J u «s «e < •< o 03 > s» ■> > o 03 09 as -o 1 H 4 ^ a 04 U H H H H oj -J -.0 z z z z S» z M f-l H M z Q O CO M Cu Cu Cu Cu H M H o o o O 'O H 25 (-> z r- r\] m 3- U < M > sc Cu 03 ■J z z z Z 1 O a -< -H M l-l fiu < « << «: H 3 C « JC c z H -^ o o o o 3 1j •< ■a a Q a 3 Z 3 <: i-l ■3 u a o o »H it * ^ H O • a, O o X fi 3 t to M O If CD < * a O o i li tos MC0 09 O VS ■o-w ■^ z tO 09 l/l « z o 13 OfN *3 a II 'J z tOM — ■< tor* H 61 i < c-> (Nro a ecu —"• ,« •a 3 3tO to to • o a r-"0C0 r\l»- oto ■a a U< Oa •H OtO < -J -(OS II II II II II II II II ;jo •-^ jn 3 03 030 r-r^r-i^ r-Om ZZZZ zzzz ja 'JO 'J— . •ecu t-i 6-"Z rN aWMto H^HH KHHH Zi XM «" II II CJ tJ(H zzzz zzzz OU »»3> >»»» S3 < a«* M Cut05» -U a Jj'-U .gww jJ OOI IrHvO a z> -juo a tk D a-a -eo OOtOtOa* < 034* ^ «*o II zx "M :>m_:aiO ^^ --k 'J H MH •- '1 « 1 *2» 30 = = -J a ^Z ^2 o — zazz D J Z3 " — " H a 70 O O o u^ o o • • • «H CM o N II II O O o < •< < o o i o i o ^1 ua ■3 <*i o o "i <•» -» " -jo u a a Z C>] H JS H IN N .-•< VI a H ^^ a a ~o ** "— WJ ft] II • ■4 coto t/l to— u E-wJ ~ — H -< aa zcm z— . a *: Mil a«- < SO »(/> » II a aO •qua atO u 4N -J-. -■j » a »M >(N » w a oa on O «« Ua ua '-> — -1 a =» » II a a * MM a JLO u •an a a a o — a a (NJ z a OH : — i O O M OtO « a ■ a •M 0(0 4 ■ 'J O-i JH >h o a H a to tool (J H II aa a 03H H <» a - • a a H MM » » — a M a (0 JL5 o u O < a t-ia M a -.- m ■ -JZ >j -j -1 — a -i «U ^M xu XU aa JMU XU oo aa joa Oa oaa J 35 ft. — — - - ft.O j-- - «^ O.U a.u a a«u - _ . hi s B fS (N r» M M B B a to r* B»-B B h*a>d n^ B B a b a B «» H to H CM Md NtO 10 H Oj a 2 B M a a >*aa toBtOHBUBH a a H a x a H hi O H o hi o HOO t<4HK»i*i*« ►JO o to o H o B 0^o«-m aoot anaaaauc* >o.Of Buo*»(Nfn4»mvo toO» -iAuiw*cvOwnve*o>«^f^inv© VIBO&B M fttVIB •Jfli M Bo mw H MB MMM BB*4B)M ■ BO*-««r»oo»ow'*m ItBkikiJ ^ — ^ — QBOOU OOOOO OOOOO JUA1A iAAW • • • • • •#**» 2SSSS SSSSS ■ ■■■■ ■)■■■■ MMMMH MHMMM 3HBB 48S BBBB BQDO M VI 4 VI •4 U 73 ooooo ooooo ooooo ooooo »-»»^«»»- ooooo ooooo oooo^ ooooo ooooo oo«-^o ooooo o«^o*»o ocnoo*- ooooo ooooo ooooo N^CMfSO ooooo 00»»«-»» ooooo ^•oooo ooooo ©ooooo oooooo OwOOf OOOOOfl oooooo oooooo oooooo oooooo OrOOPO oooooo oooooo oooooo oooooo OfOOfO oooo« ^•*u*iyB rMm^irt ^so ^(ni»i#wP)^ #-c<4fn»inv6 • t t • t • • t • • • • • t • • ««»••• « » t • • >••••• t t • • • t • t f t t • ooooo ooooo oooooo oooogo ooooo oooooo oooooo oooooo mmm-jem nzaxzz lazxza mmatmaam >oo oc ibm as >oo< ■asfi: HHHUH HHHHH as a sob as as HMMNHH MHHNH HNMMH ■»*>■»•» »■•»»»> •»>•»■»»•» P4MMHM MMMB4P4 flBMMMMM « ■ ■ SB « 30 MHMMMMj »»■»■»»»(►»» HHMHDIM HHHHH ■ ■■SB SB HNHHH HHHHHH aasasBasas HHMHMM 04HD4HQ4 Q4Q404P4MM l-HHHHH HHUHHH ■ xaaxa ■»■» MNHHHM HHHHHH MMMMMPq HMHHHM irt V) w n in w V) w u U U U u u u 74 O O 2 O O O O S 2 O O O S B § o o •ft o o o o — o «— O •■ o M • N i H vt 8 3 H 3 S • o o o ft? M O M - M 002 u 8 O o 1 ♦ oc 1 ♦ B< ?a M o • M O • M E o •H — ■ O VPiB H o A* ft* O „ U H • li i R M o cm o 51 VI ^M VI MS* tMVI MH * MM Hta MM «S M MM HI Mftj OOrOOO ooooooo o-ooo oooooo MO * Ml ■ ■o VIM 03 — oooowo OOMOOOO ooooo oooooo M o WIN HO o «!<"<« HO H o 3? MM o -s Si 4 • BM • oooooo ooooooo • oooo oooofla Q o U t :1 o u • VI MV* M«" .M ■ oi M f> a OOJ-^f ooooooo ••0* - **™* - »»>«»>«»»»>•»>»»' M •■ BV| MC •» BVI aa ft> o M ■ M o M IN O DO M •> — . NO M • (NMP<»«NC*OI 4 M 1 cno ■« BO* MVI -A «-M» ■ 1 H t vio —M B »■""•"«■ *"*" VI O VIMM o VIM ^(NOKNC****: ^■^4^#**Ot^^* oOOOO oooooo OB 1 ft«H M Boa l *C s. §H 85 SS= o OH as Sa 1 ♦ VI a- ♦ VI a* MM o MM B — MM B m O J ->■ l*KO OM MB tnH mi OH MM M» OK o»M M ■» O ■ MVI O a M Oftt • Ovi HM • OVI H xmajjl J-»»Bt»»>»»B *»•»•»*»»» ft>ft«ft» t»Bt» MB m MOU M MO HNMMMM HMNWmit HMMHM MMMMMM OO vfi M MM » B M O B ■J • i» O—U 1 (• o-> mo 1 IM OM 1 IM ©_ ^^ 0B4 0^ ^a, U H MH •-KM H MH •- « o O »» W e» • MM BM UM MVI BM -& o »- •»> •» fti OH OVI MM OM Ovi ^* %»* ** ^* OM OJ -J» MUM OM MB MVI ft* to ft) ft* u au -JW au MU 1 MM OO M 1 0, oa B 1 M VI 10 VI V) M MMM ft> MMM tfi VI VI VI OH ^* MMM *■* ft. -»« •4 * •4 •4 ■ H •» M aavi M M III d M u d 3 OB ■ O ^^ •4 o «■■ a H o— — u 75 o o Ot o O ^ m o o o m o O O o o o 1 o O M o o ^ ^ o O o o M o o M o ■ o o H o e ■ o H o o H o e O o H o o H o © ■ o ■ o o H »■ o o H o ^ ■ o o M o » »- «Mt o o - © o ^ M o O o a o O w- o M o II ■ o H o II o ^» o n o ■ © m o M o • o H o H o ft* o m II H N M II a H n © II H H H H at H » H (I H u H 1 in H (A ■ w M Ol M CM H 1 H m H ■ H M H B B pa A o H D 8 E. M «• B 1 & a B M «• * H ** ■ ■ O n ft* O U o u H ol. vn2l u & U _ U o- a II o *>«* o 11 o o a II o O M a ii o o ♦ CMH a H O o M CM «M M CM 1 04 CX) « M J"" H iJ-° M r> B H O • °< M o • <" H O • ■* H o' M o - "» a, O •b Bi o Cta o *m Oi o •© a, o • « X o *-l oa •4 o ■3" " H o O — H o CM u H o i — H f II m Ii • II — H • || H • " H H • •1 A o O"* o og o OP o 9 W m H OuH H OuHM M HH ■H oua MH OH MH OH A HH O 1 HH OH OH at ii OH M OH -1© OH HH OH *^ hm mhm HM HH IMM HaA Bum MHH Bmm M v0 ■ KOM V0 ■ H 1 « ■ « M hmcq « ■ Ha aaaa HI M mflMM MM Hfc MM MMM HH M»»«» COM MM HQ MO (OB HO MM | na M ft— Ha MM H •» MMM II *» ■ M n m ■ MM H m MH Ovn hh— om M« OlA HHH om HHa om HH a co CD uo a» 0) uo Q w B UO OHM B uo Q-ao B uo (9 i ^.^ 19 1 (1 M(4 OH O t 33 CO iS O 1 II sao MH B3 O ■o mn Ba MO tn«— MO MH ■o MH BMa © MM HM« ■ ■04 o MM HO o Ml* H« O Mr- HHH o M«N HMO O HM o HM ss o HvO HBa O M<0 MMM o HM HB H ■ HO> t HH » hp» « HO ■ HO • HO ■ HM • HH o U t *M o u • VI o U • Mil o u • D« o U t MM M»» ^4U M*» aI MCI aHM HOI aH — M»" aH 1 «■> ■ ■ coat It ■ ■ Ot «n M ■HH ft M ■ M f> ■ ■ HU w— OM 0411 * MM*k r» SCO MB ^ BID H'-^"' ^» DM HHa r» DM H— H © H o H ■ M o H M M o H ■ HO o H ■ a no M a— HO 04 0 1 o SM in©* - fn t H — mo HU H t HU Ma H t HU aO H • HU Ma no « mh m ^«, MO m MO m f-33 MO m ■ 0* «- hh ■ Oj — M ■a* —HOI ■3 0M — m BCM — M© HM HU hm ■ MM HM HM MH HM H || O 01— CO o ■■ a -o S-J3 O in a M OOH a M a M OOH MO UM MO U -H HO UHM HO U r-H Ha OM HM M HH HM M — HH *» HM mil at »■ MH *■ ^ ■ H MHO* m> MH «•« t» ■ M Mil CM m* MM HM n •CM MH mm Ma HM MH U« HH OM 0) UH HB UH MH UH HB h UMH m MO m MMM H HOM H UMM -o M HUCM «' 04 MM «a M MH — « H ■ MO >o H ■ H — M *«H MHH oa *"H u M ^■H HH M *"H HUM M »"H mu a ««B 04 s HHa M ■HH M ■ «*A ■m —M at n ft^ tM •^4 H •u "■^t H H — H ft. o OM — ft. o H h O H M •X O ft. H H O ft. ■ H to Oa 11 o Oa o 19 OaO N o OaM II O OaO II ■ M Oa II ■ M O N MM OH N ■ H O ft II ■ M '•M l-t HH •-ii oa H HH ^■11 H HH •-It H H <-*H •-II H H HH •• II H MM 3iM um mm ■ H Ua ■ W MH UH MM ■ H UM HM ■ H UH QH out MO OH O(0 MO an OM HH an OM UO an OM HH OJ ja Has OH HM H|| MUM OH HM HM OH HM MM OH HS MM ■U HM MUD bu HM ■ U HH huh BU HH MUII au HH MUII oa oa i H oa M 1 M OO HI H HHH OO H 1 H OO H 1 H ft. JMH On HMH m H hhm H Am^^ *■* cmhh ^^ a>HH *^ ChH* 4^ CMHH 0^ CMHH *n 04 BBH • 04 BB« in M ■ HH « H BBH t* H aBH 33 c— a o— ■ o— a o— — a o — — H U ** H u * — H u ^* H u *^ H u 76 o e o o s s e o o o § O © o — o o o *<« o o *» o O o o e o II o o e o M o s o o a o e o o o e o M e o © o H o A s e o L m o m; * 1 N H 1 p M O H h H • H H o M n ** M o w a H «M* H H M H £ H M 3 M . D a O H M M d M • M M M O 1 M ■4 U M O S o (A ft o o ■j M O o M O o H O OM o COM oco — o O M II M °.5 N ♦ M ^3 u M kA -» H H OS M O •■ M O • M O • H H O • H a, O VAii fi* O ■3-m ft* O^- M ft. o.=»- M O M O og M O »5 M o Oo H t o H • o H • o H o <* M O J CA O NO m o NM •n O N4 »n — o ■ H»- 41 ■ HM ■ Ml HO MM H MM H MM MB MO M MO MM MO CAMo HO MH N ■ JftO ■ •» ■o H ■» ■ OO H M MM ■ 88 2o • OCA OO So a 82 Qotn S 8S MH Oft* U i Mo CI 1 H o i ■ MH o i •— ■o MM MHO ■o MM ■aa ■o CAH ■ O CAH H o Mr* HUH HI 0» MMM o CAT* HM o C/W» HMH o Mr* H» e t Mia MO o t HO HM MH. o 1 an Hftft ■ H — o • aa H«n ■A e u • J9J. o u • M o u • M o u • H M • MM f» M MM m M B«0) f\ M ■ Mo — DM M— ■ M DM M— M DM H"*M ^ DM MMO o H M • o H ■ O H -~o o H mMh MO) NO M ^O - * no M *^ HO H HO H O H • MM HO *Ho o H • ss vOO A- O H • B3 4Qft Ah o H • «g <«Qcn M 1 via m mo WO M CAO M CAO UM ■CM "-NJ II an MB* "-**H MB* *^*H ■3 0* >-»M ■M MCA MM Men MH Men »•*■ O MHM HHM O MMO o MM » o M • *C ft*H HCABJ ft*H HMH Km Ho— 1 MMM N ■ MM H M MMIA 1 M MM Sh as MB* MH— §H as MOM MMO Sh aa HOft* MHM o OH as MHo MOO ♦ M MM MM ♦ M E MU ♦ M a- HUM ♦ M a- "■A MH M Mo MH »— MH MM MH OJ MH 4HO OM — i OM MM <*5-«9 OM MM ■0MM OK MM *»M OM *H Oft* o*h » OH MH OM o ■ 1 O M oCA O a M O ■ H t sg «J3 t OM M| t OM HM • OCA •-• e OM o UH MM o UH MM o UH MM MHM MMH ■ MOM M CAOB H l MH 1 MM MMM II MM HftSO N MH MMo MM MMM MM M M mm H H mm MHO) * HM MMH H HM »■- H HM MMH H HM MMM a M OM » O So OO O 3o S°H O M OHI UMO MO U«)H u — MO KM Mm HM •-© HM •"» HM #«» MH XSOU — MH 111 •» MH nHH ^ MH tn M MM mm MM mS2 MM MO* MM oH uh UH UM UM MM UM MM M M MMH M MHS M MMH « M ■ «"• » « M MMM * M MMM « M MO » 3 «-M M M M »»H MHM 3 •-.J 4H" M »»M MMM HoM M MM— H<» a M M ft* -M M ft* ** ft* **^^ ft* MM •M o ft* >a ft* o ft* o •• O ft* O ft* O MOO ■ u O 1(9 N o O— C9 H o O — H N o O O ■ MH OM H MH OM N MH OM 1 MH -73 H MH — HH H HH »-HM H HH •-H M H *-tH MIA ■ H UM MCA MH UH M(A MM UH HCA BH UM OH OM MH OH Oca MO* OH OM HM OH OlA MH OJ -la 33 HH MUM OM ■u m8 HM MUH So" m3 MU I OM ■u m3 mSm oo M 1 e* MMM oo M 1 H 3mh oo H 1 0* >4mm o*Mm OQ H 1 ew fi ft* ft* ft* MMM 4^ CftMH *^ HHM ^^ ^^ CMMS 30 M MMt/1 en M ■ HH o M MOM V* M ■acn a o— — ■ o«— »» ■ O"— - ' ^ a 0— — ""* M u ** H U *■» H u ** H U 77 © o w o ^ o ^ o o o o o o o o o o o o ^ ^ o o ^^ e H o o o o M o o & e © o o o H o ^* o en o M o ^ o I o 09 o o o> © H M e H O o a M it • M II O H M H M H u H OT O W w «*. H M H M H ^ B H H M H B 3 I a M 4k H D M o O n u • OVOO U o OCO U a o a rH.H II o ♦ r>n, II o so or ii o ^V 99 •m M •M M •Cm M o -3"H M O rW a M o OB 0. o AS Bi o r'1,3 eu o s.S »- o H o H o H • C i H t V) H • C5«- o M— . H > aaw H M M om M»- om MO 1 33 M— . 0) uo a a uo aaM a OM o « M u 1 H (9 i a-. mo WM ago MO MM aaa ao 10W aoo o ot^ H O l/XN HO* o Wf» H-O, o Mi- HO o as H — o Mi0 • Mar ■A • B(N ■ HO aaen o u • o U t -. BO o u • O 1 MfN — « H** H» • ow u • ©en otb O UH H«"» O UH o ii. O UH oen M l/JM M W~^9 ■ OTM*- II MM 08H — II MM a < H MM MU MM M»0 MM «— . H MM w«»-» H HM M— 1| H HM >oa H HM »~-w O OT O W O W OHO (J VIM a en O a MO U—BQ MO MO u—o HM MH Ha HM HM oa ^ MH 9TMM »• MH comb ^ MH »^ M M M M«»M M ktt-*^ vO M ■ « — 10 M M—tM ve M ■MM** H «-H « a M M s ttma M a* M dH M *- » O a » a 1 u a M •4 H a a a 1 a — O a H a a a a • «■» a fN ao — arsia a D VI as a* 0J— «• ana a*— - MUM ana u o H ■M -a a — -Si a—v) a IBM -Si H HO a * — 1 ,-. ,-» ao H o a a r»— oh »o — N S- a3 rsiOB *>f23B »-a a H 1 H u 9 N*- a 11 A3 H H — H ao a ^^ aa aa mb MB a B Qu «-o< — — —Ma «-«aa —o* — MS -ao s^aa a a to a a aa •»-» a— au • •»-! H o ma VIM MBM Wl-^3 a VIBB Ufm. VI— O U II fi H M ao HO aa H«a a 11 H ♦V) a a aa ao -•aa aeon an a MUM MV)U a vim u BOH B an tx •»a ^a a 11 Ok-) H a I^H o»- J»— • (Naa 00M a— « a— m a a CO O O a 00« ooa O a O » a a u UK U — U ■ u— una u a U— a u— H a a a »-a oa aa •-VJ om oa a r— a M ns ma n 11 • *"ii 11 ma a »- H II on a Oil 11 a a a a w w VIH an MM MH VIH U a «0 a H mi*^ Bll >4^ HU ^hM H a ao a ttH_ MH4 Kda MMa hCMM MMa U sO a aa aa 1«- M*(l a via m^f-> aaa X-^lu a M a -j au ao B«*S a* M 01 a ^^ «M —o ^"*m. UVl **^m. —VI **^^ a BH O Ou a • a a a«»— ' a a — a II u o— t 0—0 0— 11 0— 0— 11 O— O—ll (9 II a «H o ^^^ Oil oa ^^ oa r~^* Oa a H M H •-II (MHO mil u *ii a in— a so n a r»ii m ana H Bio afOM U U II ua UH oa UH ua UH a OH o«-w a MO aaw caat 11 O mm ao aa O— OH •J ■ H na HU MH via MH Ma MH J ■u M a au au 1 XU | NU 1 HH II HU 1 MUH MU 1 HH OINfl M 1 a 1 a a 1 o< a 1 a a hi j m 1 a M 1 H a 1 a Oa Our na HMH JKX HXE nan MXE 4KH HMB ao ^a* OiH Oj -JO a • » Ol a • • • " H • «* -* ** ►. o :* vO NoN »-3- CM t . ^T a H - • II O II C3 "A n 2? o2 lip N ^ 52 V to < < aM as to aM X 1 ^ ao a a*-* o » H* M » WJ M M HO a as u O « — on an a^. QO an a — C3 1 a % in ■ a U n B3 to M 33 — . so aa bm sn an o to r" HO Ha H< Ha HM HM H10 o M (N •s& MM MM MM Ma MU MM • M r» a-) as aM an a i aa o o ■ to M u X a B H fN -^ 1 ~*> mM -*-> ~-j -oc «M0 9 a SSi 1H aa aa a* MM aco— . to o M >H > II >H >ao »cao a + 40 mm M M J aa MX M MO) 10 MM M W iiA M II tO HO^ u OJ M a r»H *H » I «H r»>-M ("•MM 0«-M a OM Oi M ■»M m— » «Ol in~» T- X MM •-II x o o a] at B —« Ha tOM B t O 01 H *■* M 4^ M* M* M« a o u H ^^ o M O agw M~- M— • o z (0 Will co*- con too to* 10M u il a M C3_ 03(0 m aco Q3B A a*-^ MH— . ^ » WMO MbC on — MM M O M O W»CJ M H H a) >ll »M >(0 >a »03(0 s— — -It »— TO a Q to on OB OM OM OO 1 OOlO u~i M H (9 (j be u« ua u«o U 'J una H a en M 10 »-x tox ua to ^ os M cob no flj no nil m mMM nosM a M a to 03 a tOM am OM o u 03 to (J H u Mca B~- aa H 4 MO M» MM M« MMH MtO M H U tfl M as 03 a— ■ aM a~" aM » ato_ aa k M 04 r» J >*U «c Ml* M o M ~ — o mho h •- ii o m m m •"_**» H •- o m •- — i d. o ■ v H l ft. B — V* « « & ■ M Bo — H ~ O M M • a — -. O «- »- mm S e © A — — a R* a< m a m o o ui m © *» m H 1 ** ■ MM O J h u A ©) o hj i A u H o U) I ■ o M US Go B M * « ?~ 4* m? 8 M ■ UN ■ UO — MOM O M MM Mo I in M I B «* o M MO • © flu I o B 0. H •» © — UM ' — H MM P> M 8 a o • J m mj • M trt <■ U — BuM — M MB M — '" , o. o* -o «* o *■ oO o* o *" ^BOa^/^^^O _ M M O • O _T M _^-»^T o W _? °" o o o»*m • a© • y •■ » o^ii^h ^o (\l h OS Oq Oo O oi/» O « —O « n O 9 <\J m M OnV)HMHM|)MMM ■ -Jul I n -I * - rf? CJ P,r> ' - r-M P ^ M ^6B63 63 6g 6V 6i 6« §S3 ogS6«?S6 V 6 U M " o u S 1 Q Mo N4 M«Vi —M" ©— OMo OB Oii~ O— ~ OM. ©— H •""> 1 M H OT m M I M— MM B» — M«> a — _ ■ •4 OB OO O Q4H OM O IM |M |M |U ♦— ♦fflflg *• ♦an «o| »HH *oV» IMM O, m m • a A. m ho H O Mo MM MBM — M O— OMo OM OM~ O— OM. ©— H -J OM OJ OM OO O OJM OM OOO O — OHO O Ol OHO) K 01 a MU M H MM M II HMO MHO M— MHM HMM M*-^» MH I MM I M M «H OM O" OM 0«U OMB O OMM OMM O M OMM OlM M MM vO« 1AM W) OM OO OM O OMM O0>4 O— J OM>4 OM M MM MM MB (N-. lAB. OdM OBM OMO OBM OCIi O^O O-JOS iflHfl M ^ =8 .H .K tO .KO tO I .HO ♦■H .»•• • M t a iM tM«* M £ H M R »o a M & M S « P- M -Jj^ ^ 3 & -M^ ^«M -MM -^ MB- K *wM kiH luW k,HM K.MB hHI tuB | *-H— •>.—*.— !<■• k,N. M K OM O w Ol O-X OB* 0"-0> OHM O— M OM OO OOO OMO OHO Bu M H— M M-J M No M -» Nil Hi fc M MM Mo MB M_«ft MM M — I MMM M— O MBM MBM MMM M— V\ vO I HI H»- HM l-"- w MMo H'M MOW H— B HMM HMM MMM H M M M MJ M H«a H MMM M «4 HH'x M MMi-l HMJ MhK M.-X M O IAH MM in— <0M— ul'^a IAMB MM MMM WHO 1/1HO Wl«— a MMM II M MM MO a MOM a O MOW ■»«-. IOO IMII MMO a • II* 8» MH M Mo M M MoB M — MHO M MMM MMM Mo" MQ- O a— OO OM QOj OM OO Q w 1 OOr Q«a 0*M QM Ql W I M IB MM I o M 11 — W — W Mo o ao M M Mo MB MM BBU BOO BflO n -JMJ aj»W O M B M BOO MMM O M «- HO HM Hoi HMM HB HM l| H«-M HMM Hoi H-l H«H HOM O MM MM MM MB MMM M I- MMM M M MM-I HnH H<^M M W M J • -I r» BO) *H Mil BHM MMM JHH ■!• BH(9 B M O, IKd. MMM MMB O U • M M M MM OM MM Q«~ MM MM M<«l OJ III H M ol oM oM oMM o M oMM o oM«l oMM oMB o O oBM n a mom a« BDo a«M mmm ■•• moo »•• mmm aat) bmh smm m •- B M MB M>— MHO M-*i MMM 19"— MMM a~~ Me- MB— MHM MM« U MM B —MM M M BB«* a MBM a MM MM IB* IHh NO M Mo MO oH M— oo MO oo Mo Mo M— Ml H O B M M— MO OHM MOM MM MOM **MB v-OO *>OM -OH »>M MMM M H • HO* M •" — I Jt— Ho JIM H iM MM Sa Ho •&. M IOO M o M MM MM Mid MM M I UO UO Ma —4 M B M >-»M «HM — oM -y« — **M —MB — MO —no — aa — aa *M4 — M ' M MM B M MM MH •-! M(S •» Ma — ■ —I a-l oM H O MM MB MM** MMa W—t3 MBM W— »- MBM M >4 M >4 «l«0 MO— U IM H HJ HM HO— HMO H (9 HMM H I HMM HoM HoM K II Hi M II M aB mi aa aMM a— M aMM aoM BMoa imm imm aoM aMo a Sh a g :- S3 Smo ss3 r?a sa? s?a sav ss^ ss^ s?a saa a IM M M MM MU m °l B^H MMM MUM MMI I MUM MB MM MMM MHO OJ «4 M MH v»— 09«-M OH Om H »M »-|IM •4 B MH v»— B*-M M— It MMM B OM OH BOM O-J MM oM MM oM M— oM O a M< M MM OM MM MJ WJ MH M*4 oM o MU MHM H MH] MHM MHM mh4 MHM Ovo M BB BMM aa % a«a. aMH aMH BMCM aMH a M «• a*»M M« M OM M — — Ml-» *-*• — o **o ""Mil — o ■« a — o »-•■ M OMM ■MoMtOlu— MuOMOtu- k>0 MO— MOM MOM I — ■ u Oo OoO o to oo Ooh Ooii oo o—q o o o o»i o » H B M O OM *»M Oo Oa OM *>_ Oa Mo M OM Oo U • O M H M -»*> MM MB M— M M— — B *-M MB UM B U*l U H — " H— MH OM M Oo M I IM OM M_H O B M MO MM MO— MM- MOo MHO MOo MMM MMM MH— M— U II B M Mo MB MHo MB MU MBU MUM MBCJ MmO MoIH MU M M ■> MO M M«>OI M o MMMo M a MM I M a MH MM I MMo Moo M H H M M»U MM »»«-V| MflMO •><-«■ kMH »» — U MMM MM*- MMGM M—M MOO M a M OM OO O I OOH O a OOM O B OOM OHM OHB O a ONI M M (9 UM U o UoO U a UoO U M Uo U«H UoO UMB SB M *-0 MM *-M OM *-M OH *-M *-MI *MB Oa MM M H "1 M m» N "MM AIM *»NH •"■II OHM OHM OHO— OHN IMH M t« m M MM OH MM Mm) M«J MH HJ oM o IU MM O U M M -JM BM *4H -JM JM J| -IM MH Mo Jh HH H s H H H —II MNH hi II M MHO tAIM 4 14 MM HM MNO H MM »<^M U UM UM Ull UH UH UM UM UI — UI — UM — U II B oh o*-m a ae* mh aot mm mm mo mm mo ao aa aa Oo 0>-l HI B M MM MH MM MH MH MB MH MM MM MH MM M m] M MU MUll MUM MUI MUJ MU I MU I MU I MUj MUj MUJ MU I JM OMO Ml MM MICm Mia. ma. M I 0< MIJ M|b M I ft. M|0t M I ft. Mlfti Oa JM JMH JMM nIMM JMB -1MB MMH JMB JMB mMB -1MB -1MB MO OmJ Cm-IM Ot-IB CbJM a-»M ftj-IM B*MM CM-IM 0.-1M CM-1M O.MM ftj-IM M BO BOH BBM BBM BBm* BBB BBH BHM BBM 8B« BBM BS« B a— O— O— O— O— O— O— O"— o— o— o— o— o— H— UUUUUUUUUUUU 81 ■ — a H »<■« ^ O ^ ^ M M n ft. B St o a M O O a o 1 a u H M e a •< M M ii H a 4 o u U *- H ■ i a *^ n u a. % M a M .^ u el M ■ O H 4k O M H a ** ■ . ■ u M m a • * ^^ H M ** M H M a w— 4 H M ,— MM H • a a a« PJi *-^ M OO ■ H ua «- r» a «- — I * 3 so a a h a * W M — H M j in aa — — i» O *• O H M n a — a (9 * H H H ana ts a a u m «• h — a> m n -a-0 - M .a _ B I _H - a, o*ii*w'm»m*b _^« _! «. — " * °- J! *•<=• M f- in " 5 •• 3 H a " a M m "a. •• o " S2 « M " oa M<«<«<>) no, ns cup oa* - ma nd» a a .in »h .a .— «a . ii »h • •« «ha ►j h tnvi iau) inn mo ina inM vom «-«— no «-m«» u » % a a a a a oo h a— m aa »*a *-h ao- &.>- *-= mh m a >>.»< — *,h a h oa oa o i ow o oh o— oma oaa o— — o m o o a. i — m na hii oi M a Ma aa aa mm >«- aa n— mbj a—a a— w a hii hi na us h hh h«- hhu h vi h»- ■ a a Mi-i hj Ma na na m w h naa w-»i h o a a cam t/iH en— aa aa ao si a a aa aa » O V> •- HO HO HM Ha HM H Ha— H— * HO— HNH O a(N MM Mil Ml MM HU MO HHO M«*>»J M O H«a • -J r» ao) ao) ssi »-j a i au bhii aim bm ih« a a m ii oa •«•-.«. 6 mo -.— V)H h— —m H o a a a Na oh— in rsiacn mo roa ena soi tn HtHUa as 33 tn | -»| |l— ao> «— JIM M mo a — — a < aa a M aa an a>H aMo aao aaa aoa aaa aao a I VI MM MM MB MM HM Man MO II HU* MBO MBM My a U MM M N MM MB MM MM Maji MOll Wy» MBO MBM Mu o»j m a «— a a oh a m »m <*im »•— o U H b a a a a mb aa »-&. —a ja r-w «■ a m na na no no r»Ha naa nun o m nM« nil a a b a a a a — v-i om wm — a aj wj u a a a u u a bb mj mh hh mm m a ao mo aa aa a— h a h mmb aa i aaa bmm oo a aa aa a— a— aa » aa « aa » aoa* a— h **i* a o -i au au a a n a ana m« a no oina o n a MW ann u U U U «-« UB U« Oil UM fUH om o«-w a a a a iim bm bm ao> aa aa Om m a M M M M W II Mil Mil MW MH MH BU M M MU MU MU MU MmM MUM MUM MU I MU I MU I omo mi mi mi a i bmoi m i ft. a i a. m i ft. aieu a i a. *.»- mm mm m»c jm mmm »)aa >iaa mbb mmb mmb - Mm Mm CUM aiM MHB a>MB 0.-J33 MmB Q.MM MmM a M aa aa aa aa a«a aaa aaw aa« aaa aaa «- a»- o— o— o— o— o— — o— o~*~ o— o— o— — H^ uuuuu u u u u u a H a M O H a U M a w M H M a a B o O a M a w B H a o— a a M a a MM Oa M M MO O a a o a a r* a— a at H a a 82 REFERENCES Larson, J., Michalski, R. S. f "AQVAL/l(AQ7) User's Guide and Program Description," Department of Computer Science report number 731 t University of Illinois, Urbana Illinois, June 1975* Larson, James B., "Inductive Inference in the Variable Valued Predicate Logic System VL21 i Methodology and Computer Implementation," Department of Computer Science report number 869, University of Illinois, Urbana Illinois, May 1977. Michalski, R. S., "VARIABLE- VALUED LOGIC 1 System VLi," 197** Internaltlonal Symposium on Multiple-Valued Logic , West Virginia University. Morgantown West Virginia, May 29-31# 197^. Michalski, R. S«, "Variable-Valued Logic and its Application to Pattern Recognition and Machine Learning," chapter in the monograph 1 Multiple-Valued Logic and Computer Science , edt, David Rine, North-Holland publishers, 1975* Michalski, R. S., "A Planar Geometrical Model for Representing Multidimensional Discrete Spaces and Multiple-valued Logic Functions," Department of Computer Science report number 897, University of Illinois, Urbana Illinois, January 1978, Michalski, R. S., Larson, J. B., "SELECTION OF MOST REPRESENTATIVE TRAINING EXAMPLES AND INCREMENTAL GENERATION OF VLi HYPOTHESES 1 the underlying methodology and the description of programs ESEL and AQ11," Department of Computer Science report number 867, University of Illinois, Urbana Illinois, May 1978. Michalski, R. S., "STUDIES IN COMPUTER INDUCTION AND PLAUSIBLE INFERENCE," a research proposal submitted to the National Science Foundation, Intelligent Systems Program, Computer Science Section, Division of Mathematical and Computer Sciences (1979). Stepp, Robert, "Learning Without Negative Examples via Variable-Valued Logic Character! zat ions 1 The Uniclass Inductive Program AQ7UNI," report in preparation. BIBLIOGRAPHIC DATA SHEET 1. Report No. uiucdcs-r-T9-9 1 +9 4. 1 ii !<• and Subi [tie e Uniclass Inductive Program AQTUNI : Program Implementation and User's Guide 3. Ree ipient '• Acci 5. Report Date July 1979 6. 7. A uthorl s ) Robert Stepp 8. Performing Organization Kept. No. 9. Performing Organization Name and Address Department of Computer Science University of Illinois Urbana, IL 6l801 10. Project/Task/Work Unit No. 11. Contract/Grant No. NSF MCS 79-06614 12. Sponsoring Organization Name and Address National Science Foundation 13. Type of Report & Period Covered 14. 15. Supplementary Notes 16. Abstracts This paper contains implementation notes and user's guide for an inductive program (AQ7UNI) which given a set of events (via an integer-valued feature vector for each object), generates one or more characterization of those events, expressed in the form of VL-. expressions. Variable-valued Logic System VL is a monadic predicate calculus in which rules can be formed which describe single events or sets of events. The VL characterization is a generalization of the descriptions of the event examples given to the program. The degree of generalization is controlled by the user. AQ7UNI belongs to a family of programs which employ quasi-extremal optimality techniques Data input formats are highly compatible with the discrimination generating program AQVAL/l(AQ7) . A variety of operational parameters are provided to direct the generali- zation processes and to determine the quasi-optimality judging criteria and toleranes. 17. Key Words and Document Analysis. 17a. Descriptors Computer Induction Machine Learning Without Teacher Variable-valued Logic Characteristic Descriptions 17b. Identifiers .'Open-Ended Terms 17c. ( OSATI Fie Id /Group 18. Availability Statement Unlimited FORM NTIS-15 (10-701 19. Security Class (This Report) UNCLASSIFIED 20. Security (lass (This Page UNCLASSIFIED 21. No. of Pages 82 22. P USCOMM-DC 40329-P7 1 M 1 2 1980 FEB 2 BM