# Appendix — Dann v. Johnston > Briefs, arguments, decisions, and more. URL: https://www.frixlaw.com/law-library/documents/brief%3Amicro_IA40385003_0284%3A03 ## Record - **Collection:** Supreme Court brief - **Document type:** Appendix - **Published:** January 1, 1976 - **Citation:** 425 U.S. 219 ## Text APPENDIX Supreme Court of the United States OCTOBER TERM, 1974 No. 74-1033 C. MARSHALL DANN, COMMISSIONER OF PATENTS AND TRADEMARKS, Petitioner —v.— THOMAS R. JOHNSTON ON WRIT OF CERTIORARI TO THE UNITED STATES COURT OF CUSTOMS AND PATENT APPEALS PETITION FOR A WRIT OF CERTIORARI FILED FEBRUARY 18, 1975 CERTIORARI GRANTED MAY 12, 1975 ae de Supreme Court of the United States OCTOBER TERM, 1974 No. 74-1033 C. MARSHALL DANN, COMMISSIONER OF PATENTS AND TRADEMARKS, Petitioner —?) THOMAS R. JOHNSTON ON WRIT OF CERTIORARI TO THE UNITED STATES COURT OF CUSTOMS AND PATENT APPEALS INDEX Page RT RRC LN KL TTY te UE ORB Ow tS a ee OL 1 ERENT RRO OOO SOTO OR AIT EEE POTTS SOOO 3 Fe Te algeria butignegpigtibeenennneen 68 Examiner’s Answer dated November 3, 1970 00. 86 Portion of Dirks Patent 3,348,188 ............................................ 94 RRR a RSE SE SEITE SCR ASE SR A a re a 107 Notice of Appeal to Court of Customs and Patent Appeals dated December 28, 19711 ............ SA ated aki a a 110 *Opinion of the United States Court of Customs and Patent Appeals dated September 19, 1974 00000000....00..ccccececccccceeeeceeee 1A Supreme Court’s Order of May 12, 1975, granting the peti- I as 116 * Not reprinted in Joint Appendix. Citations are to appendix of Petition for Writ of Certiorari. 1 DOCKET ENTRIES IN THE MATTER OF THE APPLICATION oF THOMAS R. JOHNSTON Board of Appeals Serial No. 624,741 Filing Date March 20, 1972 Term and Docket No. 9088 Date Proceedings and Orders Counsel for appellant: Morton C. Jacobs Commissioner of Patents March 28, 1972 Motion of appellant to suspend all pro- ceedings in this appeal until final action of the Su- preme Court in Ex parte Bension, et al No. 71-485 P A No. 8376, filed. March 31, 1972 Above motion, granted. February 15, 1973 Suspension lifted pursuant to letters of counsel dated January 26, and February 15, 1973. September 10, 1973 PRINTED RECORD, FILED. October 12, 1973 Stipulation to extend time for filing appellant’s brief to November 19, 1973, filed and ap- proved. November 13, 1973 Stipulation to extend time for filing appellant’s brief to December 19, 1973, filed. November 15, 1973 Above stipulation, approved. See letter in jacket. December 13, 1973 Motion (joint) to extend time for filing appellant’s brief to January 18, 1974 and Com- missioner’s brief to 60 days from filing of appellant’s brief, filed and granted. - Date Proceedings and Orders January 21, 1974 BRIEF FOR APPELLANT, FILED. March 21, 1974 BRIEF FOR COMMISSIONER, FILED. April 4, 1974 Motion of appellant to extend time for filing a Reply Brief to April 25, 1974, filed. April 9, 1974 Above motion, granted. April 24, 1974 REPLY BRIEF FOR APPELLANT, filed. May 8, 1974 Argued and submitted. August 12, 1974 Motion of appellant for leave to file publication, filed. August 26, 1974 Opposition by Commissioner of Patents to above motion filed. August 30, 1974 Appellant’s reply in support of mo- tion to filed publication filed. September 3, 1974 Above motion denied, Markey, Chief Judge. September 19, 1974 REVERSED, Baldwin, Judge. Dis- senting opinion by C. J. Markey. Dissenting opinion by Judge Rich. October 11, 1974 FINAL MANDATE ISSUED TO COMMISSIONER OF PATENTS. Feb. 18, 1975 Writ of Certiorari No. 74-1033 filed in Supreme Court on Feb. 18, 1975. 3 [SPECIFICATION | APPLICATION OF THOMAS R. JOHNSTON, FILED MARCH 21, 1967, SERIAL NUMBER 624,741, FOR MACHINE SYSTEM FOR AUTOMATIC RECORD KEEPING OF BANK CHECKS AND DEPOSITS Abstract of the Disclosure. An automatic record-keep- ing system is provided which is based on machine-read- able records of the financial transactions (checks or de- posit slips) of a bank customer. In addition to the usual data provided on the transaction slips, a set of code characters identifying the bookkeeping category is also provided. A data processor, such as a stored program digital computer, processes all of the machine-readable records, together with a master file carrying individual charts of accounts (i.e. the bookkeeping categories) for the different customers. Output reports are periodically generated on simple forms which present the customer’s records in accordance with his own chart of accounts and accounting procedures. This invention relates to an automatic record-keeping machine system, and more particularly to such a system suitable for record keeping and bank checks and deposits. Automatic data processing equipments employing digi- tal computers have been developed for the handling of much of the record-keeping operations involved in a bank- ing system. The checks and deposit slips are automati- cally processed by forming those items as machine-read- able records; that is, magnetic ink characters are im- printed on the check, so that magnetic readers are en- abled to process these checks and enter the data in a computer system in the form of coded electrical signals. Other character-reading machines operating on an optical principle for automatically reading special optical type fonts are also employed. With such machine systems, most of the extensive data handling required in a bank can be performed automatically. It has been found that such data processing equipment, with certain additions and modifications, can be em- ployed to process automatically much, if not all, of the 4 individual record keeping required by a bank’s customers to maintain their own personal and business financial records. That is, as a supplement to the conventional, periodic bank statement furnished to a bank customer, a record summary is provided with makes unnecessary much or all of the tedious bookkeeping and accounting that the customers would otherwise have to perform. Accordingly, it is among the objects of this invention to provide a new and improved machine system for automatic record keeping. Another object is to provide a new and improved machine system for automatic record keeping that func- tions with an automatic system for banking operations. Another object is to provide a new and improved automatic record-keeping system whereby financial rec- ords are kept and maintained with a minimum of manual operation. Another object is to provide a new and improved automatic record-keeping system for many customers, in which a chart of accounts is provided for each customer which is individually adapted to his requirements. Another object is to provide a new and improved automatic record-keeping system for supplying financial reports to many different customers on printed forms that are small in size and simple in format and adaptable to various accounting procedures. In accordance with an embodiment of this invention, an automatic record-keeping system is provided which is especially adapted for use with automatic banking de- vices for machine handling of the transactions (i.e. checks or deposits) of demand-deposit accounts of bank cus- tomers. Machine-readable records of each bank transac- tion are generated directly on the check or the deposit ticket. The data of such records incorporate those re- quired for conventional banking system presently carried on checks (or deposit tickets); namely, the customer’s account number, amount of the transaction, and the type of transaction (that is, whether a check or a deposit). Another set of data forming a machine-readable record is provided on each transaction, namely, a set of code characters that identify the bookkeeping classification of 5 each transaction; this classification code is called the “category number.” The category number is entered by the customer on each transaction slip (check or deposit) at the time it is prepared, in the form of a machine- readable record by means of an appropriate device, or in the form of a set of hand-written numeric characters which are converted to a machine-readable record by the customer’s bank. In the customer’s bank, upon a deposit being made or a check clearing the bank, the machine-readable transac- tion records on the imprinted checks or deposit tickets are read by a suitable document-reader device and stored in a transaction file. To process the transaction file, the automatic record-keeping system employs a data processor, such as a programmable electronic digital computer, hav- ing certain data storage files and a control system. In addition to the transaction file, a master record-keeping file is used to store all of the records required for each customer in accordance with the customer’s own chart of accounts. The latter is individually designed to the customer’s needs and also constructed to cooperate with the control system in the processing of the customer’s transactions. The control system directs the generation of periodic output reports for the customer which pre- sent the customer’s transaction records in accordance with his own chart of accounts and desired accounting procedures. Printed forms of conventional size can be used for the output reports, and a simple format can be employed that is adaptable for automatic printing of the different charts of accounts. The foregoing and other objects of this invention, the various features thereof, and the invention itself may be more fully understood from the following description when read together with the accompanying drawing, in which: Fig. 1A is a schematic block diagram of a computing machine system for automatic handling of banking trans- actions and record-keeping thereof in accordance with this invention ; 6 Fig. 1B is a schematic block diagram of certain work- ing storage sections of the memory of Fig. 1A; Fig. 2 is a schematic flow diagram of a portion of the machine system of Fig. 1A; Fig. 3 is a schematic flow diagram of another portion of the machine system of Fig. 1A; Fig. 4 is a face view of a bank check having machine- readable records in accordance with this invention for automatic record keeping in the system of Fig. 1A; Fig. 5A is a schematic block diagram of the organiza- tion of variable data fields for a plurality of bank ac- counts in a demand-deposit-account (DDA) master filed as employed in the system of Fig. 1A; Fig. 5B is a schematic block diagram of the organiza- tion fields in DDA and record-keeping (RK) transaction files as employed in the system of Fig. 1A; Fig. 5C is a schematic block diagram showing the organization of data fields in an RK master file as employed in the system of Fig. 1A; Fig. 5D is a schematic block diagram of the organiza- tion of data fields in a portion of the file of Fig. 5C; Fig. 5E is a schematic block diagram of the organiza- tion of data fields in another portion of the file of Fig. 5C; Fig. 6 is a schematic block and flow diagram of a por- tion of the system of Fig. 3, for the master file main- tenance run; Fig. 7 is a schematic block and flow diagram of another portion of the system of Fig. 3, for the transaction file maintenance run; Figs. 8A, B, C and D are schematic block and flow diagrams of another portion of the system of Fig. 3, for the transaction journal run; Figs. 9A, B and C are schematic block and flow dia- grams of another portion of the system of Fig. 3, for summary sheet run; Fig. 10 is a face view of a printed transaction journal report form utilized in the transaction journal run; Fig. 11 is a face view of a printed summary sheet report form utilized in the summary sheet run; Fig. 12 is a modified form of summary sheet report form; 7 Fig. 13 is a top view with parts broken away of a check imprinting device for making machine-readable rec- ords directly on bank checks for use in this invention; and Figs. 14A and Bare, respectively, perspective and frag- mentary front face views of a check-folder and imprint- ing device embodying this invention and for use in the system of Fig. 1A. In the drawing, corresponding parts are referenced throughout by similar numerals. In the system of Fig. 1A, a data processor (e.g. a stored-program digital computer) embodying this in- vention is employed. The computer may assume many different forms that are well known in the art. For example, it includes a memory 10 having a working stor- age section 11, an arithmetic unit or processor 12, and a control unit 14. Input devices are provided in the form of a reader device 16 which accepts machine-readable records 18 such as documents (e.g. bank checks and de- posit slips) having special character formations. The reader 16 is a suitable document reader for reading prescribed character fields (imprinted on the documents 18 in magnetic ink or special optical type fonts, or presented in punch-card form). A document imprinter 19 is used to enter the prescribed fields on the checks or deposit slips 18 (e.g. it may be magnetic ink or special type font imprinter or a card punch). Supplementing the memory 10 are various storage- filed devices such as a disc or drum memory or magnetic- tape stores. One set of filed devices takes the form of a set of tapes or discs 20 carrying the transaction, mas- ter-file and other data that are supplied to appropriate sections of memory 10 and are employed in the data processor. Another set 22 carries updated files cor- responding to the files 20 after certain processing opera- tions have been performed. Another set of files 24 supply control programs or runs to the memory 10 for directing various control operations in proper sequence. The machine may be one operating with binary coded electrical signals, with the signal combinations coded to represent alphabetic and numeric characters in accord- ance with any desired system. The files 20, 22, 24 con- 8 tain successive records having fields formed of such character signal combinations. Fixed or variable char- acter lengths may be used for these fields. An output unit 26 for producing printed records may take various forms that are available in the art. One suitable form is a high-speed printer, and a plurality of such printers may be used for concurrently handling different types of printed output forms. The overall control unit 14 for the data processor performs certain sequences of operation in accordance with the run of the control programs established in the memory 10, and effectuates control of the various portions of the system. In accordance with the operations to be performed in the system of Fig. 1A, the paths of information flow between the various sections of the system and the memory 10 are shown in full lines, while the paths of flow of control signals from the control unit 14 to the other portions of the system are shown in broken lines. The system of Fig. 1A is illustrated further by the flow diagrams of Figs. 2 and 3. A plurality of ordinary bank checks 40, bank deposit slips 42, and other types of bank transaction slips 44 are currently handled in a manual fashion in present-day banking systems. Batches of such transactions 40, 42 and 44 are proved 45 (checked for accuracy) by an operator, such as the bank teller, and the various data sections thereof are placed in machine-readable form directly on the transaction slips by the imprinter 19. One form of well known device used for this purpose is a magnetic-ink imprinter customarily used by banks for ordinary processing of checks and the like. A suitable form of check embodying this invention is shown in Fig. 4. This check may assume any of the customary printed formats for bank checks and, in ad- dition, has a three-digit field 46 at a suitable location on the check (for example, just in front of the signature line thereof). This check, when it is employed with the well known form of magnetic-ink coding, receives a plurality of data fields along the lower edge thereof. One such field is the transit-number field 48 which carries the bank number and routing number for automatic processing of the check in accordance with present-day systems. Another field 50 incorporates the account num- ber (Acctno) of the customer on whose account the check is drawn. The fields 48 and 50 are customarily imprinted on bank checks prior to their being issued to the bank customer. Customarily, an amount field 52 is imprinted on the check at the time of proofing (45) by the imprinter 19 in the bank on which it is drawn (or at the clearing house) for automatic processing of the checks. In addition, a check number (Chkno) may be imprinted in the field 54 prior to issuance of the checks to the customer, or subsequently by the bank. A two-digit transaction code (Tranco) field 56 is employed to identify the particular type of bank transac- tion represented by the instrument. That is, the code in field 56 indicates whether the document is a check, a deposit slip, or some other particular type of bank transaction. For checks, which represent the largest number of transactions, this code field 56 is often left blank. An additional field 56 carries the category num- ber (Catno) inserted in the field 46 the writer of the check. This Catno is entered in field 58 either by the writer of the check (if he has an appropriate device for completing the machine-readable record in accord- ance with this invention) or by the bank on which the check is drawn or which operates the record-keeping sys- tem of this invention. It has been found that a three-digit Catno is suitable for classifying the record-keeping categories in account- ing systems employed by most individuals in their per- sonal bank accounts, by most businesses and professional offices, and by most farmers. Such a three-digit Catno is able to provide a simple technique for the writer of checks to classify the RK category of the particular transaction, and similarly to classify the source of in- come represented by a bank deposit. In a very large number of instances, less than a hundred such categories are required to suitably classify a bank customer’s in- dividual “chart of accounts” (i. e. for each customer, his own list of Catnos, their descriptions, and record- keeping interrelationships). A three-digit code affords 10 the flexibility of separating large areas of records; e. g. categories in the 100 and 200 series may represent different classes of income, and categories in the 300 and 400 series may represent different classes of ex- penditures. Another example found suitable for family RK classifications is to use the 300 series for family income (both primary and secondary), the 400 series for fixed family expenses (e. g. rent or mortgage), the 500 series for variable family expenses (e. g. food), the 600 series for other income (e. g. dividends, loans), the 700 series for family asset expenses (e. g. investments). For agricultural accounts, it has been found suitable to use the 000 series for family records, the 100 and 200 series for various crops, the 300 and 400 series for live- stock, the 500, 600, 700 and 800 series for other farm income and expenses, and the 900 series for capital improvements (e. g. buildings and equipment). For some applications, a two-digit Catno filed may be sufficient to meet the needs of a wide range of customers (this may be treated as a three-digit field, with the first digit handled as “0”). Moreover, the Catno field may be augmented by a fourth digit to afford the flexibility of a more detailed breakdown of any particular area in a customer’s chart of accounts (preferably provision for a fourth digit is made in field 58, as indicated in Fig. 4). Such a breakdown may identify particular sales regions or customers for a narticular business category, or particular models within a product line. Moreover, after a customer has developed and used his chart of accounts, he may readily modify any desired part thereof (as explained in more detail below) by adding or delet- ing various Catnos and by inserting (with the fourth digit) additional ones between two successive three- digit codes. Generally, in setting up a particular chart of accounts, certain Catnos in the sequence may be left unused (blank) and undefined so that the customer has the flexibility of using them at a later time as his record keeping changes. If desired, an alphabetic code may be used for the Catno, which may be easier for certain customers to use. 1l As is described hereinbelow, a bank customer, in ac- cordance with this invention, is individually supplied with his own choice of a chart of accounts in which he selects his own Catnos and the descriptive titles associated therewith. Thereby, each check (Fig. 4) or correspond- ing deposit slip (which generally has the same format as that of Fig. 4, except that it has a different transaction code in field 56 and the transit field 48 may be omitted since it does not leave the bank) receives a Catno in the code field 46 (if a handwritten field is utilized) and in the machine-readable field 58 for automatic process- ing thereafter as machine-readable records. In the system of Fig. 2, as indicated above, the proc- essing operation 45 (which forms part of the initial processing known as the “entry run”) completes the coding for the machine-readable fields of the checks 40 and deposit slips 42 if they have not previously been completed. The bank operator also develops a proof tape 60 with the dollar amounts of the batches of checks and deposit slips, and a proof tape 62 of the Catnos of all of the checks and deposit slips. The outputs of the proc- essing operation 45 are the machine-encoded checks 4, deposit slips 42’, and other transactions 44’ which are utilized, as machine-readable records, as inputs to the system of Fig. 1A as they are read by the document reader 16 in the machine operation 64 (Fig. 2). In present-day automatic demand-deposit-account (DDA) banking systems in which automatic data proc- essing is provided, the document reader 16 is controlled by an appropriate program to read the successive trans- action records 40’, 42’, 44’ and assemble them as a daily transaction file (TRAFI) 70. Each transaction 71, 73 (Fig. 5B) of such a file in accordance with this inven- tion contains data fields respectively representing the Acctno, Catno, Tranco, amount, Chkno, and the date as- sociated with the transaction, as well as any other data desired to be carried along. The TRAFI 70 consists of such transaction records (TRAFR) 71, 73 assembled suc- cessively on an output file 22 as they are read by the document reader 16. The fields forming each TRAFR (and the other records of Fig. 5) are preferably located 12 at prescribed portions of the record, which has a fixed length, so that the desired fields may be readily located and processed in accordance with the known techniques. The TRAFI (Fig. 5B) ends with a special end-of-file record, in accordance with standard techniques, which follows the last TRAFR of the file; the other files are similarly constructed with suitable end-of-file records. The operation of the computer (Fig. 1A) is under the control of a DDA Run of the control program which is stored in the memory 10 at this time. In one conventional form of such DDA run, the control] 14 operates the proc- essor 12 to produce an accumulated net total of all of the amounts in the transactions 40’, 42’, 44’ making up a particular batch and controls the memory 10 and out- put printer 26 to provide a proof listing 66 of all such amounts and the accumulated net total thereof. In ac- cordance with the system of this invention, the DDA run is modified so that the control 14 similarly operates the system to produce a listing of all Catnos and an accumu- lated absolute total thereof. Thereafter, visual checks (or, if desired, automatic comparisons and checks if the contents of lists 60 and 62 are read into the machine) may be made of the corresponding totals provided by the proof listing of amounts 66 with the corresponding amounts of the proof tape 60 to check on the accuracy of the machine entry of the data. An additional such check is provided by the comparison of the Catno totals in the proof listing 68 with the corresponding total of the proof tape 62; thereby an improved accuracy check is provided. In ordinary DDA processing, the daily TRAFI 70 is sorted into Acctno sequence; in this invention the Acctno field 50 and Catno field 58 are treated as one combined field, and the sorting in operation 72 is by both. The DDA Run controls the posting of the sorted TRAFRS to the DDA master balance file 75 as indicated by operation 74. The format of the DDA master balance file 75 is shown in Fig. 5A, in which the sub-files 76. 77 making up each account are assembled in Acctno sequence and the data 13 fields that form each account’s sub-file include successive- ly those for Acctno (which may include the bank number where a central processor for several banks is used), the name and address of the bank customer, the account bal- ance amount, an RK flag (if the account is to be proc- essed in the record-keeping system), and one or more other fields for data such as service charges to the cus- tomer and bank statement cycle times. The DDA Run locates a particular sub-file 76 or 77 in the master bal- ance file 75 corresponding to a TRAFR Acctno and posts the amount of the TRAFR to develop a new account bal- ance in the corresponding field of that sub-file. The output of the processing operation 74 is an up- dated DDA master balance file 78. Subsequent to the posting of each transaction, the RK flag field in that ac- count’s sub-file 76 or 77 is tested (80) to determine if it is an account that receives automatic record-keeping. If so, the particular TRAFR is also transferred to an RK TRAFI 82 that is built up for that day’s transactions. The TRAFI 82 contains only those TRAFR 71, 73 for RK Acctnos, which are arranged sequentially on one of the output file devices 22. The DDA operation is com- pleted for each account periodically in the usual fashion; i. e. on those days when bank statements are to be gen- erated, the customary bank statement 85 is printed out (83) for each account, which statement carries the ac- count balance as well as a listing of all of the transac- tions for the statement period. The transactions for each account during the bank statement period are indicated either in a cumulative transaction file (which is assem- bled on successive days by adding the current day’s trans- action file to the previous day’s file) or by carrying the cumulative transactions in the DDA master balance file as a listing of transactions following the “other data” field. In this invention, an additional output file 87 is generated from the DDA processing 83; this file con- tains a series of records for the RK Acctnos. Each such record (148 in Fig. 5C) contains a “credit” field 150 (consisting of the total deposits on the monthly state- ment), a “debit” field 151 (consisting of the total checks) and a field 149 for a special identifier of that record. 14 These records are added to the RK master file, as ex- plained below for Fig. 6, and for that purpose each rec- ord also contains a change-instruction field that is coded so that the record is added to the proper account sub- ile of the RK master file. The flow chart of Fig. 3 illustrates the processing of the RK data to printed RK reports that are sent to the bank customers and ordinarily with the usual bank state- ments. The daily RK TRAFI 82 developed from each day’s transactions for the RK accounts is added to the RK TRAFI 84 (one of the files 20), which stores the accumulated transactions of previous days. The proc- essing 86 updates file 84 by inserting the TRAFR of file 82 in the proper order by Acctno, Catno and date. The update processing 86 also serves to correct any errors that may exist in the TRAFI 84, and correction records 88 are also suppiied to direct the desired changes in the TRAFI. The output of the processing 86 is the updated RK transaction file 92 (on one of the files 22), together with a printed list 90 of all of the new TRAFR supplied by the file 82 and all of the changes from the records 88. An RK master file (MAFI) 94 (one of the files 20) is utilized which contains all of the required RK infor- mation about each RK account, including the customer’s individual chart of accounts, as explained below. This MAFI 94 is maintained by update processing 96, which controls the performance of any changes, additions or deletions of entire accounts, or parts of accounts, that are specified by records 95. The output is an updated RK MAFI 98, as well as a list 97 of changes. The up- dated files 92 and 98 are the inputs to a transaction jour- nal (Tr-Jrnl) Run 100. This run processes each account of MAFI 94 in the individual fashion determined by the customer’s chart of accounts and in accordance with all of the customer’s transactions for the particular state- ment period. The output is a printed transaction journal 102 for each account. Another input to this run 100 is a set of records 101 which determine the particular ac- counts to be processed on any given date (e. g. a par- ticular sequence of account numbers may be set up to be processed at certain regular periods); also special re- 15 quests for reports of particular accounts can be made by any of these records 101. The input records 88, 95 and 101 may be stored on predetermined sections of one or more of the files 20; they may be punch-card records where appropriate for the computer hardware, or they may be entered manually via the computer console where few in number. The Tr-Jrnl 102 contains a separate printed listing (see Fig. 10 for a pre-printed format) for each account of all of the transactions (checks and deposits) that were cleared during the cycle period. These are arranged in columns by Catno, Chkno, date, the amount, and the type of transaction, as well as by comments indicating the absence of a Catno (Non-Code) on the check or deposit slip, the use thereon of an invalid code in the customer’s chart of accounts stored in the MAFI, or by the incon- sistency of an income Catno being employed on a check or that of an expense Catno on a deposit slip, all is deter- mined by the chart of accounts in MAFI 98. In addition, a sub-total for each Catno is indicated by “* * *” on the Tr-Jrnl. The Tr-Jrn! Run 100 also flags all of the TRAFR of file 92 that it processes, and the flagged TRAFR are re- tained in case a re-run is required for a particular ac- count. All of the TRAFR that were flagged on the previ- ous cycle (i. e. those TRAFR in file 92 that contain flags and are presented as inputs to run 100) are not processed, but are conditioned to be dropped automatically by the subsequent Update TRAFI Run 86. Thus the output 104 from run 100 is a flagged and purged TRAFI, which is used as the input file 84 for the next TRAFI Update Run 86, as indicated by the connectors in Fig. 3. The run 100 also augments all of the year-to-date (YTD) balances carried for each account in its sub-file of the RK MAFI 98 (as explained below for Fig. 5C). That is, as the run 100 develops the totals within each category which is utilized for the Tr-Jrnl, the correspond- ing totals on a YTD basis are augmented in MAFI 98. The output is MAFI 106, having the new YTD totals and also carrying the current cycle period’s totals of trans- 16 actions for each Catno. Thus the MAFI 106 temporarily stores the current month’s totals for each category, which are utilized in the next run 108 for processing the sum- mary-sheet reports (Fig. 11 or 12). The Summary Sheet Run 108 receives the MAFI file 106 as its input, as well as the cycle and request records 101. The Summary Sheet Run 108 produces as outputs, different summary sheets 110, 112 and 114 (in one form of the invention), which have somewhat different format characteristics to meet the special record-keeping needs of different classes of customers; that is, the summary sheets 110 are for personal bank accounts, sheets 112 for business accounts, and sheets 114 for agricultural accounts. A summary sheet format suitable for the per- sonal and business accounts is illustrated in Fig. 11, and such a format suitable for agricultural accounts is illus- trated in Fig. 12. However, these formats are not re- stricted to any particular type of account, and each cus- tomer’s chart of accounts also specifies the particular format for his summary sheet, as explained below. The summary sheet of Fig. 11 is simple in format, having a space 120 for printing the name and address of the customer and the Acctno, which data are obtained from the name record (described below) of the account’s sub-file in MAFI 106, and a space 122 for the month and year, which information is obtained from the cycle record 101. The summary sheet of Fig. 11 is arranged with a plurality of columns having (in one form of the invention) pre-printed captions. The first column 124 contains the Catno, which the output printer inserts therein for each item of the customer’s chart of accounts from MAFI 106, which also supplies the category de- scription for that Catno to be imprinted in column 126. Columns 128 and 130, respectively, receive the printed amounts from MAFI 106 corresponding to the current- period’s amount totals for a particular Catno and the YiD total. The run 108 does not modify the data of MAFI 106 and consists essentially of a print-out of the MAFI for the particular account (modifications of this run are described hereinafter). After the run 108, MAFI 17 106 is subsequently utilized as the file 94 for the input of the next MAFI Change Run 96. In other forms of the invention, the summary sheet is not arranged with preprinted captions, but instead the columns and captions are arranged in accordance with the customer’s individual chart of accounts on the Summary Sheet Run. Likewise, the Jrnl format (Fig. 10) may have the captions inserted by the Jrnl Run 100 instead of being pre-printed. There- by, a standard blank report form may be used for each type of report, with the differences being composed by the runs themselves. The various portions of the RK Runs shown in Fig. 3 are described hereinafter in some detail. These runs refer to the file formats which are described with respect to Fig. 3. FILE FORMATS. DDA Master File. As described above, a standard DDA file 75 (Fig. 5A) provides a sub- file 76, 77 (or set of data) for each demand-deposit ac- count, with the sub-files for all of the accounts being ar- ranged in a certain sequence such as an ascending Acctno order. The DDA master file, in accordance with this invention, has a specified field provided for the RK flag. This field may consist of a single bit that identifies whether the account is one to be processed by the RK system or not. Alternatively, different classifications of RK processing may be provided by using more than one bit; e. g. three RK flags may be provided corresponding respectively to three classes of record-keeping for agri- cultural, business and personal bank accounts, where separate daily TRAFIS 84 are to be set up for each class of accounts. Transaction File. The transaction files (Fig. 5B) are each made up of a sub-file 71, 73 of records carrying the data of the various transactions, as described above. Record-Keeping Master File. Fig. 5C illustrates the format of the RK MAFI, which is made up of a series of sub-files 140 for each account number, with these sub- files following one after the other and arranged in as- cending numeric order. Within each account sub-file, a number of records are set up in a prescribed order; each record is assumed (in this embodiment) to be of a pre- 18 scribed length, and contains various fields at prescribed locations. The first record is a name record 142 for the particular account, and it carries ordered fields 143, 144 for the Acctno and the name and address of the customer, a field 145 (usually the initial field) identifying the record as a name record, a system-flag field 146 defining the particular classification of account (e. g. business, personal or agricultural), a cycle flag 147 which identi- fies by a code the time periods in which the account is to be ultimately processed to a customer report, as well as flags that define the accounting time periods for zero- ing YTD totals (e. g. the fiscal-year month). A second record 148 has an identifier field 149 and net-credit and net-debit fields 150, 151 which are used ultimately for proofing the Jrn] totals against the DDA balance (these records are obtained from file 87, Fig. 2). The remain- ing records are each associated with a different Catno and together they make up the customer’s individual chart of accounts. These records are of two types: one is a title (or title and total) record 160 (Fig. 5D), the other a year-to-date (YTD) record 162 (Fig. 5E). Each record 162 contains the titles for its Catnos, as well as the associated numeric amount totals on which the RK reporting is based. This series of records, which may be selected and varied in any desired fashion, incorporates the individual chart of accounts provided for each cus- tomer. Certain sections of the chart of accounts may be the same for a number of customers (e. g. income and, expense sections for the business type of records) and, as described below, variations are also provided for. Gen- erally, each record is formed with a certain basic char- acter length (e. g. that of a standard punch card), and certain records (e. g. that of the name record 142) are formed of a multpile of the basic length. The title and YTD records 160 and 162 each have the Catno and other fields at specified locations. In Fig. 5C, the chart of accounts section of each ac- count sub-file 140 is shown divided into a number of records which are initiated by a “General Title” record 152 which carries the alphabetic Catno. As shown in Fig. 5D, title records 160 have an initial identifier field 19 164 specifying the type of record and the type of totaliz- ing operation to be performed, if any; thereafter, a title description and Catno fields 165 and 166. Following a first “General Title” are a plurality of YTD records 153, 154. As many of these are provided as may be required for the customer’s chart of accounts. As shown in Fig. 5E, each YTD record contains an ini- tial identifier 167 followed by fields 168 and 168’ in which the numeric totals for YTD and current month, respec- tively, are accumulated for the associated Catno, where the latter is an expense item. Similarly, fields 169 and 169’ store totals for the same Catno where the latter is an income item. Flags 170 and 171 specify respectively whether either or both of the fields 168 (168’) anc 169 (169’) are active for the particular Catno. That is, the flags 170 and 171 are provided depending on whether the chart of accounts follows the form shown in Fig. 11 or 12 (namely, depending on whether the Catno applies to either expense or to income, or to both, respectively). Following a first series of YTD records 153, 154 is a Level-I total (i. e. a sub-total) record 155 (of the type shown in Fig. 5D). This record contains an operator field 164 that specifies the particular control operations to be performed in the Summary Run 108. Successive such sub-file sections are provided as may be required for individual accounts (each including a group of records such as 152, 153, 154, 155), and a final Level-II total field 157 is provided where an accumulated grand or net total is stored; its operator field 164 is coded to specify the particular Level-II totalizing to be performed. Each total record 155 or 157 operates with all of the category data set forth in the preceding records up to any pre- ceding total record of the same or higher level. As shown in Fig. 5C, only two levels of totalizing are illustrated (those of records 155 and 157). This invention contem- plates the use of as many such levels as may be required for any particular account. The identifier 164 is coded to specify at which particular level the total is taken. The working storage section 11 of memory 10 is shown in Fig. 1B. For many of the runs, two input files 20’ and 20” are used with two associated output files 22’ and 20 22”, respectively. Each record from the Input-I file 20’ is transferred to an associated input register 180, from whence it is transferred to the output register 182 and therefrom the Output-I file 22’. Similarly, input and out- put registers 184 and 186 operate with Input-II and Out- put-II files 20” and 22”. Various other storage registers are identified hereinafter in connection with the associated runs. Master-File Change Run (Fig. 6). The inputs to this portion (run) of the system are (1) the RK MAFI 94 (Fig. 3), if one already exists, and (2) a maintenance or change file (CHFI) 95, which may be a set of records (e. g. punch cards, magnetic tape, or dise file) that set forth the changes and additions to be made to the master file. Each record of the CHFI 95 is identified by a field containing the associated Acctno, and all of these records are sorted in ascending order, as are those of MAFI 94. Four types of CHFI records are provided (in this em- bodiment) which are similar in format to the correspond- ing MAFI records (Figs. 5C, D and E), and carry cer- tain modifications as noted (the reference numerals of the corresponding MAFI fields are referred to for identifying the CHFI fields) : (1) A CHFI name record carries any changes in the customer’s name and address 144 and system and cycle flags 146 and 147 in a format similar to the MAFI rec- ord 142. The same special identifier field 145 is provided for this CHFI record. In addition, a predetermined change-instruction field carries a code that identifies ei- ther (a) delete a complete account, (b) add an entire new account, or (ce) change the fields of the MAFI name record 142 to contain the data carried in the corresponding fields of the CHFI record. (2) CHFI YTD records (similar to the MAFI record 162, Fig. 5E) have fields for the Catno and name, as well as for YTD expenses and YTD income; these CHFI YTD records carry a special identifier (i. e. the same as field 167) as well as a change-instruction field that identi- fies by code the type of maintenance operation to be per- formed (e. g. a code specifying a change of the entire ~ ti 21 MAFI YTD record in accordance with the fields of this CHFI record). Another operational code may specify the deletion of the complete MAFI record corresponding to the Catno of the CHFI YTD record, or the addition of the entire CHFI YTD record. Another operational code may specify that one or more fields of a corresponding MAFI record should be changed in accordance with the data set forth in the corresponding CHFI fields (which may include an algebraic identifier for adding or sub- tracting dollar amounts). (8) A CHFI title record (similar to MAFI record 160, Fig. 5D) carries a Catno and title description fields. The CHFI title record also has a field to provide a unique identifier corresponding to that of 164 in the MAFI rec- ords for general title, and Level-I and -II totals. A change-instruction field in the CHFI title record also de- termines whether the maintenance is to be a change in part of the MAF title record, or an addition or deletion of the entire record. (4) A CHFI record for net credit and net debit records carries a special identifier in field 149 and corresponding fields for credit and debit which are to replace the cor- responding data fields 150 and 151 in the MAFI record. Where the MAF file does not exist, the CHFI contains all of the records required to compose the MAFI file. Where a new account is to be added, the CHFI file con- tains all of the records composing this new account and the change MAFI Run is designed to insert the succes- sive records in the proper Acctno and Catno order in the MAFI file. If an entire account is to be deleted, the CHFI name record identifies this deletion and the run is designed to delete all of the records of that account sub- file from the MAFI. The MAFI 94 is set up as Input-II file 20” (Fig. 1B) and the updated MAFI 98 is generated as Output-II file 22”. The CHF file 95 is set up as Input-I file 20’, and no corresponding output file is generated. The CHFI file 95 (Fig. 3) is previously sorted in ascending Acctno order, and within each Acctno the records are sorted by identi- fier code numbers 145 and 149 to provide (a) a name rec- ord 142 and (b) a net cred-deb record 148, and there- 22 after (c) title and YTD records 152, 153, 154, 155, 157 are arranged in ascending Catno order. In the flow charts (Figs. 6, 7, 8 and 9) standard sym- bols and representation are employed. Main control flow is represented by a rectangle for a processing operation, a trapazoid for processing that includes an input or out- put operation, and a hexagon for a predefined process such as a subroutine; a diamond is used for a decision or test with the main and branch flow paths indicated, and a subroutine may itself contain one or more decisions. Connector circles set forth the reference numerals of suc- ceeding branch and main-flow operations. Generally, the flow paths are from top to bottom and from left to right; however, for simplicity of illustration minor variations therefrom are employed. The details and interrelation- ships of the operations are described in the specification with reference to the flow charts. The operations con- sist of basic machine operations or combinations thereof which are generally of an elementary nature, such as the basic arithmetic, comparison, code-recognition and input- output and transfer operations, and will be readily ap- parent to those skilled in the art. Initially in this run (Fig. 6) the first operation 200 GETS a record CHFR from the CHFI file 20’ (Fig. 1B) and places it in working-storage input register 180 (Fig. 1B) in memory. Then test 202 determines if it is an end- of-change-file record (EQCHF) by looking for the asso- ciated identifier code at a prescribed field location). If NO, the next operation 204 GETS a record MAFR from the MAFI file 20”, places it in input register 184, and test 206 similarly determines if it is an end-of-file record (EOMF). If NO, test 208 determines whether the rec- ords are equal on control. This test 208 is composed of several tests, and initially determines whether the Acct- nos for the two obtained records (CHFR and MAFR) are identical. After equality of Acctno is deterinined, a test de- termines whether there is equality on the identifier 145 associated with name records 142. If not, a test is made to determine if there is equality on the cred-deb identi- fier 149; and if not, a test determines if there is equality 23 on Catno. Thus the tests 208 obtain equality on control for the CHFR and MAFR records by first obtaining equal- ity on Acctno, and thereafter equality by testing the suc- cessive records as they would ordinarily exist within the master file. Test 208 proves YES whenever one of the additional subsidiary tests proves YES, and it proves NO whenever any test is NO. Upon obtaining equality on control, the next test 210 determines whether the changeirstruction field of the CHFR in register 180 calls for a “change”. If YES, the appropriate fields of the MAFR in register 184 are changed (212) accordingly. A message print-out 214 identifies the change that was made; and the changed MAFR is PUT (216) on the updated MAFI 22” in prop- er sequence (the PUT operation may vary for different computers; it is assumed, by way of example, that it con- sists of transferring the contents of output register 186, namely, the preceding record, to file 22” and transferring the contents of register 184 to register 186). The CHFR in register 180 is discarded after its change is made; i. e. the program returns to GET (200) the next CHFR without PUTTING the previous CHFR, so that the latter is written over in register 180. This loop is repeated, by GETTING the next CHFR and MAFR, since the preceding records of each were fully processed. This processing continues, and if the test 210 proves that the CHFR is not a “change”, the next test 218 determines if its change-instruction field calls for the deletion of a rec- ord. If not, an error is indicated, since equality of con- trol at test 208 requires either a change or a deletion, which error is handled by the print-out 220 of an error message. The unchanged MAFR in working storage 184 is PUT (216) to the updated MAFI, and the program returns to GET (200) the next CHFR. If the Delete test 218 proves YES, the program branches for a print-out 222 of a message identifying the deletion. Thereafter, the program returns to GET (200) the next CHFR and MAFR without a PUT to the updated MAFT; that is, the record is effectively deleted by its not being put out to the MAFI, and it is written over in register 184 by the 24 next MAFR. If desired, a single CHFR may be em- ployed for deleting all of the records of a particular ac- count. For this purpose, a special loop would be provided in the branch from test 218. In this loop (not shown) a first test would determine whether the deletion was of a single record or of the entire account. If a single rec- ord, then the operating 222 would be performed, as shown in Fig. 6. If the full account is to be deleted, a subsidiary loop proceeds to GET MAFR, then a test EOMF; and if NO, a test for equality on Acctno. If YES, the MAFR is deleted by printing a message and returning in the same loop to GET the next MAFR. This subsidiary loop con- tinues iteratively until the test for equality on Acctno is NO. Thereupon, the loop exits to GET the next CHFR, testing for EOCHF, and returning to the main flow at the input to test 208. If test 208 indicates that CHFR and MAFR are not equal on control, the program branches to test 224 in order to proceed with the control operations required to find the next such equality. Test 224 determines whether the CHFI record is higher in sequential record than the MAFR (the order, as noted above, being determined first by Acctno and thereafter by the identifiers 145 and 149 in the name and cred-deb records 142, 148, and subsequently by Catno. If the CHFR is high (and since the records are arranged in ascending order), test 224 indicates that no CHFI records exist calling for changes to be made in that particular MAFR; and it is PUT (226) to the updated MAFI unchanged, and the program returns to re-entry 204 to obtain the next MAFR. However, if the CHFR is not higher in sequence (test 224 is NO), then the CHFR in input register 180 should properly be a record to be added, since its sequence falls in place be- fore the current MAFR. Therefore, the next test 228 checks the charge-instruction code in the CHFR looking for an ADD; if it is not, the program branches to print out 230 for an error message and proceeds to GET (232) the next CHFR. The test 234 for EOCHF is again per- formed at this point; and if not the end-of-file, the pro- gram returns for the equality test 208 with the MAFR Me 25 that remained in register 184. If the ADD test 228 is YES, the proper fields of the CHFR then in register 180 are PUT (236) to the updated MAFI via output register 186, and an appropriate message is printed out (not shown). Thereafter, a GET 238 of the next CHFR is followed by a test 240 for EOCHF, and if NO, the pro- gram returns to the test 208 for equality. The foregoing outlines the overall control program that produces the updated MAFI 98 in file 22”. Remaining are certain control operations that are performed when a test finds EOMF or EOCHF. Either of the latter can occur first, and the run terminates upon both occurring. When test 206 for EOMF is YES before that for EOCHF, the remaining CHFI records are those for new records for the last account and/or records for new accounts of higher account number; for this processing the program branch- es to test 242. The latter determines whether the CHFR is one to be added (which it should be except as an er- ror); and, if not an ADD, the program branches to print out 244 for an appropriate error message. The program proceeds to GET (246) the next CHFR, performs the EOCHF test 248; and if NO, the program returns to ADD test 242. If the latter 242 finds an ADD record, that CHFR is PUT (250) to the updated MAFI file with a message print-out 252, and the next program steps to GET 246, and so on as described. These alternative loops are repeated until the EOCHF test 248 is YES, and the program branches to the end-of-the run process 254, which performs the particular housekeeping followed to wrap up this run and bring in the next one. If the EOCHF test 202 is YES before that for EOMF, no further changes are to be made, and the program branches to GET (258) the next MAFR with a test 260 for EOMF. If the latter tests NO, the pro- gram returns to PUT (256) the MAFR and GET (258) the next one, and so on. In this way, the remaining MAFI records are successively GOTTEN and merely PUT to complete the updated MAFI until EOMF tests YES, and the run ends. Similarly, when test 240 is YES, the current MAFR in register 184 is PUT 256, and the run winds up as described. 26 In operation of the MAFI Run, test 208 determines if the correct MAFR is located to which a correction is to be made as specifically by the CHFR. Thereafter, tests 210 and 218 identify the character of the correc- tion which is then carried out by the associated branches 212 and 222, respectively. If the CHFR does not call for a correction, test 208 is NO and the record should be an ADD, absent some error. The loop of test 224, PUT 226 and back via GET 204 locates the correct position in the MAFI sequence in which the CHFR is to be added, and when it is (absent an error), the CHFR is inserted by PUT 236. When EOMF occurs prior to EOCHF, the remaining CHFI records are added to the end of the MAFI via branch from test 206 to test 242 and PUT 250, and so on. When EOCHF occurs first, the remaining MAFI records are read out to the updated MAFI via a branch from test 202 or 234. Transaction File Update and Change Run (Fig. 7). Processing 86 of TRAFI primarily calls for acding the new transactions of the daily TRAFI 82 (Fig. 3) to the accumulated TRAFI 84 of the previous days’ operations. This operation can be considered to be a daily vperation in which the new transactions are merged with those of TRAFI 84 in proper sequential order at the end of each day’s DDA processing. Alternatively, the daily TRAFIS 82 for an entire statement period can be ieft unprocessed until the statement time, and then an overall sort performed on them. In actual operation, it is found generally desirable (where the work load warrants it) to perform this merging of each daily TRAFI with the accumulated TRAFI on a day-to-day basis. In addition, it is found that a certain amount of maintenance is required of the transaction file due to errors that may occur in the bank processing or due to customer errors. The TRAFI Update and Change Run described below assumes the latter type of situation where a day-to-day maintenance of the transaction files is desired in order to handle such error correction. The TRAFI Run (Fig. 7) is substantially similar to the MAFI Change Run described above with respect to Fig. 6. The inputs to the TRAFI Run (as shown in Aa 27 Fig. 3) are the RK TRAFI 84, which contains the ac- cumulations of the transactions of previous days, the current daily TRAFI 82, which is presorted in ascending sequence order (at least by Acctno, Catno and date), and (as a prefatory addendum to TRAFI 82) the records 88 of changes to be made in the RK TRAFI. Each change to be made in file 84, in this embodiment, is represented by two change records 88; i. e. a record having a change-instruction field that calls for a deletion from file 84 of the entire identified transaction that is in error, followed by a record adding the entire transaction with the correct data. For simplicity of illustration, the TRAFI Run of Fig. 7 omits certain portions of the run which are substan- tially the same as those described above with respect to Fig. 6. In Fig. 7, parts corresponding to those of Fig. 6 are referenced by similar numerals, with the addition of a. In reading Fig. 7 together with Fig. 6, references to “MAFR” are read as “TRAFR”; that is, for purposes of Fig 7, the file being updated is the TRAFI (just as the MAF is updated in Fig. 6). The change-file records (CHFR) of Fig. 7 are composed of the records 82 and 88 (Fig. 3) pre-sorted to be in proper sequence. The TRAFI Run starts with GET 200a CHFR, a test 202a for end-of-filee GET 204a TRAFR, a test 206a for end-of-file, followed by a test 270 to determine whether the Acctno is blank (which condition comes about, as described below, when processed TRAFRS are flagged in the Jrn! Run, and then in a subsequent Jrnl Run their Acctno fields are blanked). If test 270 is YES, the program loops back to GET 204a the next TRAFR, without a PUT of the TRAFR with the blank Acctno, and thereby dropping it. If test 270 proves NO, the program then tests 272 to determine if the change record contains a Delete change-instruction field. If it does not, then it must be an ADD record (since only two types are used), and the program branches to test 224a to determine if the CHFR sequence order (Acctno, Catno and date) is greater than that of the TRAFR. If it is, the TRAFR is PUT 226a and the program returns to GET 204a the next TRAFR; and if it is not, the CHFR 28 must be an ADD, and it is PUT 236a. A message print- out (not shown) of the ADD record is performed, which is followed by GET 238a the next CHFR. Thereafter, the program proceeds to test 240a for EOCHF, and the program follows the corresponding operation described above for Fig. 6. If test 272 finds a Delete record, test 274 then de- termines whether there is equality on control on a first set of criteria which are limited to the Acctno, the Catno and the date. If that equality is found, test 276 checks a second set of criteria for equality of control to locate the precise TRAFR identified in the Delete record; i. e. the criteria include the Chkno (the check or deposit number), the Tranco, and the amount of the transac- tion. If test 276 finds equality, a print-out 278 of a Delete message follows, and the program returns to GET 200a the next CHFR and GET 204a the next TRAFR without a PUT of the TRAFR or CHFR, and thereby deleting the TRAFR. If test 276 does not find equality, the TRAFR is PUT 280 and the program returns to GET 204a the next TRAFR. This control loop continues via equality tests 274 and 276 until the precise TRAFR to be deleted is located and effectively deleted via the path 278. If the test for the first criteria proves NO, the pro gram branches to test 282, which determines if the CHFR sequence order (Acctno, Catno and date) is greater than that of the TRAFR. If it is not, an error is indicated in the data of the CHFR, which error is identified by a print-out 284 of an error message, and the program continues to GET 238a the next CHFR. If the test 274 proves NO, and test 282 proves YES, the program branches to PUT 280 the TRAFR and returns to GET 204a the next TRAFR, and so on until test 974 is YES. If EOTRF test 206a is YES, the branch is to test 242a to determine if the CHFR currently in input register 180 is a DePete or an ADD. If a Delete, an error is indicated by a print-out 244a; otherwise, the program proceeds to PUT 250a the remaining CHFRS until test 248a finds EOCHF and the run ends (254a). 29 In other respects, the TRAFI Run (ex i respect noted hereinafter) is the same —~ 4 ‘MAF! ny = the general control procedures to be followed. =: the TRAFI Run, the special addition of handling ank Acctno fields is dealt with following each test for EOTRF _(such as test 206a and that corresponding to test 260 in Fig. 6). This is done by performing a test similar to test 270 to determine if the TRAFR Acctno field is blank; if YES, the program loops back . GET the next TRAFR without a PUT of the current RAFR and thereby dropping it. If the Acctno field is printed journal and summary sheet forms, or — printer may be used with an unprinted form (whic ; : composed in the manner described above) to —— ™ journal format or the summary format called for by e customer’s chart of accounts as well as by the — ar section, journal or summary sheet, of the run ing operated at that time. For this purpose, the journa beony is performed generally in the manner described above, except that the updated MAFI file is written out on a working file that takes but one account's output data as it is processed by the Jrnl section of the run. Thereafter, the updated MAFI on the working file is utilized to com- plete the Summary portion of the run to print out the 57 summary sheet in the manner described above. As each record from the working file is processed in the Summary Run, it is then written out to the update file 22” for the MAF'I, as described above, to produce a combined up- dated file. Another approach for a combined journal and summary run employs a wide, pre-printed sheet which has the journal format on one half and the summary format on the other. As each active Catno of the Jrnl Run is processed, the summary for that active Catno is then printed out on the summary part of the report. That is, as the Jrnl is processed for any Catno, all the data for the summary print-out exist in working storage at that time, as will be apparent from the description of Fig. 8 above. This process is repeated for each active Catno; in order to have a parallel presentation of corres- ponding rows of the two reports, the data for any in- active Catno are not printed out. The general titles may be printed out and spaces left for corresponding rows on the transaction journal without destroying the neat pre- sentation of that report. The totals may be omitted from the summary sheet, or instead they may be accumulated and printed out, but generally would be limited to totals for the active Catnos. As a supplement to this monthly, abbreviated summary statement, periodically (such as on a semi-annual basis) a full summary statement is pro- vided in the manner described above for Fig. 9. For the purpose of saving master file storage, one may modify the MAFI format from that shown in Figs. 5C, D and E. That is, for certain Catnos, such as those which experience shows are most commonly used and in which uniform descriptions are accepted by customers, the de- scriptive portion of the Catno may be omitted from the MAFR and stored instead in a look-up table. The MAFR for that Catno carries a flag instead of the description, and the flag during the Summary Sheet Run calls for an entry inte the look-up table at the proper Catno for read- ing out the description to be printed. Though this can be done with all of the Catnos, generally for versatility in meeting the varied needs of businesses and personal financial record keeping, it is desirable also to make pro- vision for the storing of specific descriptive titles in the Ee a re ee 58 MAFI, as described above. Even where the pre-assigned titles are used for Catnos, and they are stored in a look- up table, nevertheless the customer can be afforded the versatility of selecting his own chart of accounts from an overall category listing. In the pre-assigned system, if a customer does not wish to utilize the pre-assigned description, he may still employ the same Catno and sup- ply his own description; in the absence of the afore- mentioned flag, the look-up table is not entered and the customer’s own choice of description is printed out in- stead. It has been found desirable in many cases to em- ploy a combination of pre-assigned descriptions with the flexibility of customer-chosen descriptions. One use of such a system is for purposes of information retrieval of the pre-assigned categories; certain classes of accounts (e.g. farmers dealing with certain classes of crops or livestock) would have total data in the Catno types of MAFRS that could be extracted and analyzed on a sta- tistical basis to provide valuable interpretative data of a particular region or community. Other examples of the use of such systems are to determine what the general population is spending for medical expenses or housing, and the like. In the processing of accounts at the cycle period, in- stead of processing them by a specified range of Acctnos as described above, the cycle flag 147 may be used. There- by, at each particular Jrnl and Summary Sheet Run, the operator need only specify a particular cycle flag, and the operation of selecting the proper account is by way of a match on the cycle flag rather than determining whether the Acctno fell in the specified CYC range. In Fig. 13, a top view of a check imprinting device 640 is shown, with parts broken away to show the use of a customer service or credit card 642, which is used to develop certain portions of the check. The service card 642 may be a plastic dise of the conventional form used for credit cards, in which raised imprinting characters are provided for the payer’s bank name 644, payer's Acctno 646, the bank routing number 648, and payer’s name 650. This credit card is positioned at a predeter- mined location on the printing bed 652 by guides 654 59 which position the various edges of the card 642. A key- board 656 is provided having slidable keys 658, each movable in a slot 660 and connected by appropriate link- ages (not shown) to an individually rotatable number wheel 662 having raised characters for imprinting. A bank 664 of such keys 658 and associated wheels 662 is used for entering the amount of the check in dollars and cents. A second bank 666 of similar keys 668 and wheels 670 is used for entering the Catno of the check. A set of imprinting wheels 672 is readily adjustible to present the date of the check, and a semi-permanent template 674 contains the name and account number of the payee organization, as well as the name and transit number of the payee bank. The check writer 640 operates in a fashion similar to the conventional credit card im- printer, in which the credit card is inserted in the guides 654, the position of wheels 672 is adjusted to enter the date, keys 658 are adjusted to enter the amount of the check in wheels 662, and keys 668 are adjusted to enter the Catno in wheels 670. Positioned on top of the bed 652, service card 642 and wheels is a multi-leaf document with interleaved carbons, such as is commonly employed with credit card im- printers. The hinged head 676 of the imprinter moves down over the printing bed 652 and positions the docu- ment 678 therebetween. The head 676 may contain a printing roller (not shown) which is connected to a handle 680 slidable in a slot 682. Movement of the handle from left to right through the slot 682 applies roller pressure to the paper document to receive the impression from the raised lettering of the service card, the template 674, and the number wheels 662, 670 and 672. Thereby a document is printed which may be used as a machine- readable record; that is, the type fonts of all of the raised lettering on the service card 642, the template 674 and the number wheels are chosen to be of suitable special type for optical or, if desired, magnetic-ink reading de- vices. The printed checks developed by the imprinter 640 have their transaction fields at specified locations for a document reader 16 to handle and to transfer into suit- able combinatorial electrical signals. This imprinter 640 60 may be used by sales organizations in place of the usual charging systems. Thereby, a machine-readable document is developed directly by the writer of the check, with the Catno entered in machine-codable form when and where he check originates. ; The ya 678, when in the form of a check, would be pre-printed to carry the usual “Pay to the Order of information at an appropriate place adjacent to the tem- plate 674, as well as the signature line and other appro- priate data. Thereby, the bank check that comes out of the printer 640 is complete both as a machine-readable record and as a check. For such purposes the template 674 need not be employed, but it is preferred in order to carry the data required for automatic processing of the payee Acctno and payee’s bank transit number. With these machine-readable records, the check serves the dual function of a debit against the account of the credit-card holder as well as a credit to the business s payee) extend- ing the credit. Such a check (or credit-card receipt ) would be handled in the same fashion as described above when treated as a debit to be charged against the payer's account, and would be processed for account balance and record-keeping purposes in the manner described above (Figs. 2 and 3). In addition, this check is used as a credit transaction record for purposes of automatically crediting to the payee’s account as though it were a deposit slip, in the same manner as described above for such deposits. For record-keeping purposes of the payee’s account, a “credit” category code field can be added at a specified machine-readable location associated. for ex- ample, with the template 674. Thereby, all of the infor- mation for automatic record keeping of the payee’s ac- count is also provided on this “check.” Accordingly. the imprinted check document 678 provided by this device 640 is a uniquely constructed machine-readable record in that it contains, in machine-readable form, the infor- mation provided by template 674. That is, the check carries data fields 677 and 675, respectively, for the payee’s account number and that of his bank (with the appropriate routing information) so that it can be proc- essed automatically as a machine-readable document for 61 the payee Accordingly, the check assumes a double char- acter fur automatic processing; in addition to serving all of the functions of previous checks, it also serves as the equivalent of a deposit slip, since the data required for routing to the payee’s bank and for posting to the payee’s account therein is in machine-readable form on the check. The complete processing can be performed without composing additional documents as is presently required and without the manual labor and successive handlings associated therewith, each of which often re- sults in the entry of errors on hand-composed documents. The large amount of labor required by banks to com- pose the machine-readable records is eliminated, and the responsibility for accurate entry of the machine-readable data fields is placed in the hands of the originators of the documents. Similarly, a check imprinter 19 of the type shown in Fig. 13 is adopted for use by the bank customer in his own establishment for writing checks directly with the RK Catno directly on the check in machine-readable form. Where the device 640 is used by the payer to write his own checks, the template 674 is not utilized, nor is serv- ice-card 642 required; for the document 678 is in the form of pre-printed checks of conventional machine- readable form carrying all of the data required for proc- essing the check, and the device 640 serves to supply the remaining machine-readable character fields for the cate- gory number and the dollar amount. Thereby, the payer writes a check that carries in machine-readable form all of the data required for automatic processing through his own bank, so that it can be automatically posted to his DDA account and automatically processed for record keeping in the manner described above. For this purpose a simply constructed device is formed of the essential character of the device of Fig. 13, but small enough and compact enough to be carried in one’s pocket in the same fashion as a conventional check folder. An embodiment of this device is illustrated in Figs. 14A and B. In the pocket check-folder 690 of this invention, two body members 692 and 694 are hinged together and a stack of checks 696 is attached to the bottom member ee enna ee 62 694 and retained in position between the two members 692 and 694. Preferably, a fold-over flap 698 is hinged to member 694 and folds over the checks 696 and cover member 692 to prevent accidental imprinting. The flap 698 is also used to carry the conventional register book 699 in which the payee records the check data. Such checks are pre-printed and carry (as in currently avail- able systems) machine-readable fields of the account num- ber of the payer as well as the routing data of the payer’s bank. In accordance with this invention, the pocket check-folder is constructed so that the payer com- pletes the imprinting of the check as a machine-readable document for automatic processing in the system described above. For this purpose, the cover 692 is provided with two sets 700 and 702 of slidable tapes 704 each carrying a sequence of spaced numeric printing type characters 706 attached to the inner tape surface (e. g. each tape contains the numerals 0 through 9). A suitable number (e. g. three or four) of such tapes 704 form set 700 for the Catno and a suitable number (e. g. five or six) form set 702 for the dollar and cent amount. The raised imprinting type characters 706 may be of the rubber- stamp type carrying the ink in the imprinting type material; or alternatively, impact type paper may be used for the checks 696 in which the ink is formed in small, separated globules which are embedded in the surface of the paper, and which are burst by the type during the imprinting process. The type fonts are suit- able for any particular document reader 18 that is used. These tapes carry the type characters 706 in reverse printing relation. The check-folder and writer 690 is preferably formed of inexpensive plastic materials so that it can be dis- carded after a stack of checks 696 are used. The inside surfaces c* the members 692, 694 and 698 are formed of a sheet of soft plastic material such as that used for conventional check folders. The bottom and flap mem- bers 694 and 698 are preferably formed of at least two layers of such plastic, whereby checks 696 and register 698 are neatly secured to the inside layer. The checks 696 are preferably secured to a stiff paper- 63 board or plastic backer which, in turn, 1s secured (e. g. by bonding) to the inside layer of member 694. There- by, the checks are retained in pre“etermined relation to the type characters 706 for printing at predetermined areas 708 and 710 respectively associated with the Catno tapes 700 and the amount tapes 702. The plastic between the members 692 and 694 is grooved to form an integral hinge 712. A similar hinge 714 is grooved in the plastic material between members 690 and 698. The outer surface 716 of cover 692 is formed as a sheet of relatively stiff plastic material that is bonded to the inner plastic face. Extending across the width of the outer face 716 (Fig. 14B) are a series of deep de- pressions 718, which are spaced the width of each tape 704, so that each adjacent pair of depressions form a guide channel for a tape 704. Each tape is retained and slides smoothly between a pair of guides 718. A cut-out opening 720 in face 716 is formed between each adjacent pair of guides 718, and extends about half-way from near the upper edge to about the middle of the cover. The tapes 704 are formed as flexible, rectangular plastic or metallic members, and each has a projection or hook 722 at the upper end which extends through the open- ing 720 to be accessible to the finger nail of the user. Along the outer face of each tape 704 is a sequence of numeric characters that are uniformly spaced and ar- ranged in positions directly opposite to the type char- acters 796. A window 724 in face 716 is formed as a clear plastic section at about the center of the face 716, and extends down from the lower edges of the openings 720 about the height of the numeric character. The length of each tape 704 is about half or less the width of the cover face 716. Each tape slides as a simple linear device in the channels formed by guides 718 up or down from a media! position at which, for example, the character “4” is positioned in the window 724 as illustrated in Fig. 14B. All of the characters may be positioned at that window either by running the slide up to half its length up the channel (with “9” in position at the window 724, in the extreme upper adjusted position), or down the channel to about haif 64 its length (with “0” being in the window at the extreme lower position). The operator can quickly and easily make these adjustments by manipulating hook 722 on each tape (or by providing somewhat larger openings 720 and knurling the tape surface, whereby the user’s finger can engage the tape directly to manipulate it). The section of the cover face 716 below the medial window 724 is preferably made opaque or diffused, so that the window 724 clearly presents and identifies the characters to be printed. In the inner, flexible surface of cover 692, two windows 726 and 728 are provided at positions diametrically opposite to the window 724 (and the cor- responding window, not shown, for the amount tapes 702). The type characters 706 for the Catno tapes 700 can project through the window 726, and similarly, the type for the amount tapes 702 can project through the window 728. In operation, the checks 690 have the pre-printed coded fields 730 in a suitable area of the check (e. g. along the lower edge), in a suitable manner, such as described above with respect to Fig. 4. The user may write his check in the conventional manner, except that the numerals for the Catno and the dollar amount are imprinted directly in machine-readable form. That is, the user sets the tapes ‘700 for the Catno by sliding them up or down to position the desired Catno in the window 724, and similarly, positions the tapes 702 for the dollar amount. Thereafter, the cover 692 is pressed down toward the bottom member 694 so that the inner face of the cover rests against the top check 696. The user slides his finger across, or individually presses down on, each character at the window 724. The stiff plastic cover 716 transmits the finger pressure to the flexible tapes 704, so that the corresponding type characters on the reverse sides of the tape project through the windows 726 and 728 and are impressed to print on the top check 696 at the areas 708 and 710, respectively. Thereby, the encoding of the check as a machine-readable docu- ment for automatic record-keeping at the bank is com- pleted. When a check is not being written, the flap 698 folds over between members 692 and 694 to prevent any false imprinting. 65 Accordingly, with the check writing device 690, the ordinary bank customer may directly encode his check as a machine-readable document so that it may be auto- matically processed thereafter. The bank need not re- encode the document and thereby avoids the problem of making errors in its customer’s records, and the relatively expensive manual labor of encoding such docu- ments is largely eliminated. The service or credit card 642 may be constructed to carry the Catno characters directly. That is, credit card 642 may be constructed with a set of number wheels or slidable number tapes, having a few raised numerals for imprinting. When the card is used, the owner adjusts the wheels or tapes to set up the Catno for the particular transaction. In addition, on the re verse side of the credit card a space may be provided for listing appropriate Catnos and category descriptions, so that the customer can readily enter the Catno for each transaction to which his credit card is applied. Thereby, the credit card operating company may supp!y the user of the card with a periodic record-keeping re- port of his transactions as well as with a record-keeping analysis and report thereof in the manner described above. Various other forms of machine-readable records may be used with this invention. For example, punch cards or punched paper tape may be used to develop transac- tion records that carry data fields in machine-readable ag (e. g. the fields described above with respect to ig. 4). This invention is not limited to use with demand- deposit banking accounts; the record-keeping may be performed separately from any banking operations and, as noted above with respect to Fig. 13, the record- keeping system may be applicable to credit-card accounts in a similar fashion. The RK system of this invention may be fully integrated with the DDA system. For example, the DDA master file may be combined with the RK master file, so that a single master sub-file is provided with each account and all of the transactions are stored with each master subfile ‘or a separate transaction file may be provided). It is not necessary for the DDA 66 master file to carry RK flags that identify the RK ac- counts; the checks and deposit slips may be pre-printed with a machine-readable field (e. g. by specially assigned Acctnos) to identify the account as such. That field is carried in the TRAFRS and the daily RK TRAFI 82 (Fig. 2) may be constructed via a test similar to test 80 which identifies the TRAFRS for RK processing. Similarly, credit-card accounts may be appropriately iden- tified for RK processing. The system is not limited to using the MAFI Change Run for correcting the RK MAFI records where, for example, a Catno had been omitted from a transaction and therefore was not re- flected in the accumulated YTD totals. The correction may be made in the Jrn! Run by generating a TRAFR with the Catno and appropriate data so that the YTD record can be properly updated by control 436 (Fig. SC). Such a TRAFR is supplied with an appropriate flag so that control 436 is limited to accumulation in register 400 but not in register 402 or 408; thereby, the Acct-tot is not changed since it had previously ac- cumulated all transactions, with or without valid Catnos. Such modified systems will be readily apparent to those skilled in the art from the foregoing description. As described above, this invention provides control mechanisms for a stored-program digital computer, where- by the record-keeping of financial transactions of dif- ferent types of persons and businesses can be auto- matically performed. This invention is adaptable for use with various types of computers including those with large or smal! memory capacities and those with dif- ferent types of storage files and input-output devices. In addition, the principles of this invention are ap- plicable for use with a special purpose computer having all of the control mechanisms of the various runs and the files built into the computer in the form of equivalent logic design. For example, various ones of the above- described runs may be built into the control system 14 by suitable logic circuits. The RK MAFI may take various known forms and it functions as a logic board or control program in that each master sub-file specifies the control operations to be performed in accordance Cees SOUPS errs = _- 67 with the sub-file’s particular chart of accounts. How- ever, the stored-program form of the invention described above is preferred in that it is comparatively much less expensive and more compact. In addition, the stored- program enables one to modify, enlarge or simplfiy the system by modification of one or more portions of the runs; such modification is readily performed without rewiring of the machine circuitry. Similarly, each cus- tomer’s chart of accounts may be readily modified to meet the customer’s changing record-keeping require- ments simply by inserting or deleting the various records making up his master sub-file. The RK MAFI may be constructed to have a greater or lesser amount of vari- ability among the accounts. For example, instead of the totalizing records 155 and 157 that are inserted in and made part of the master sub-file, pre-assigned Catnos (such as 100, 200, 300, etc.) may be used solely to initiate the totalizing operations in the Summary Run; and each time a master sub-file is processed, tests similar to tests 568 and 570 (Fig. 9B) would determine when any of the pre-assigned Catnos fal] between those in the registers 184 and 186 and eal! in the associated totalizing operations. In constructing each chart of ac- counts, with such pre-assigned totalizing Catnos, the cate- gory areas are similarly predetermined by the total Catnos. Various other modifications of this invention will be apparent to those skilled in the art from the above descriptions of illustrative forms of this invention. The appended claims are intended to cover such modifications as are encompassed by the scope and spirit of this in- vention. Appended hereto is a print-out of a complete program of one form of this invention for use in the IBM 1400- series computers. The print-out is written in the Auto- code assembly language, and the program when assembled into the machine language for said IBM computer, con- trols and directs the operation of that computer in ac- cordance with the invention and particularly with the form thereof illustrated in Figs. 6-9. Also appended hereto is a detailed flow chart of said complete program. 69 68 [APPLICATION DRAWINGS] “SSNIIAI| Waid INIdaND ‘to’ op} TSH zaxA| Celt INTAANI 2S FMUOONIN «TAT: 10001\ I IT F2 x NITED oo ral gor fee ZS JViO2NI . ‘ svi0oni| F44 ETAT ec o” ETVIELTE) 80r~ ~ VOONI LOL LDH : SDUTA DAD FSV > it) na LOL 8IQA AI2az9 ACY LNNOII LALS 7 VES zee FH AFLSIDIA 1NA1NO = ee SH -909 Aad aLA ISUE Yo oos-f_ ON dAL SAS | ISNIAXI| STHOL LUD L. IFA FTIAI HHODN \Add INZLAAN OV r4 Vysiiadxa | s7L0L| ead ~ FONT LU2 GLA Z(sASLSIDIA LNA LNOY IF IFA LSINOIA zy? oox-f Fw wals/ 2a INdnl & 7s AILSIDTA NANI yoy 02 * -_ é Gy As0HIIW ben : ée Je y V FOLa : ' — & OS ot dan Be s 7 aid ANMUS ANUA Uda FavdIed ANVILS ANUS IJUW NA FLUAANA 47/4aL H-a 3lwdadn Wa FLYUAdN ANY, SNOILIUSNUAL 150d a a ee ee ee ee ee oe oe ee ee vF 70aINOD t “T \ i tiednaiaie 1 FOWAOLS i TF-r_. DNIAAOM a7 amd 1 L925 Aas 00 LAND 1 an te SIVIV ve JONYMD 11M J Vvad Swng vad i { ECE ; fala OF [wos sworay—— ajavia Ca09027A BEST COPY AVAILABLE na 70 CHECKS* € DEPOSITS MCODE CLS 68~ PROOF MACHINE ToT RECO? DS ARF CAT NO PP00FED TO PrOOF TAPES PROOF 664 NET TOTAL AMOUNTS. 71 CHANGES ll CH 82 YPAF/ 84 “ RK NCES | Ss MAF f° 94 88. ft CHANG UPDA RK i tal TRAFI - (86 re ae TRAFI OUEST W MAFI TOTALS op. RECORDS FLAG TRAF/ +) TR-JRNL PROOF TO DDA 101 102 PRINT SULMARRY BY TYPE BUSINESS SUMMARY SHEETS. 112 Hin. 3. SHEETS \n~-408 | PERSONAL SUMAARY SHEETS 210 INVENTOR. THOMAS R, JOHNSTON MdaiihLe z . = ° oO ‘7g OT agsag ? 69%, ©9F, 89% 89 " x | | |r |. | be Gor do] =? iss FWHN) ON | izan2|aLA| 1xANI\ALA\ ay ‘| ON | aun | LOL a FILL) 19 | : Aor LU) FILL) 7 “ = hy SHMOINI | ISNIAXT L oe 3 697? 9 a er “gar or Spor ‘Of ‘ALT si . - : _ FF SSF WT ESFy UST IHINNA. BHT» OFF ' eco ri-:- ~_ = LOL: LOL} } H uu i vior' TWLOL* gui | waza L1a7a9;| 977\ 574 ON | | 33s | T°TAT! 21 TaN} LIN dan 7DA9| SAS 2 4990} | St i ls s ‘Z be 4 a “a oD aoe «lL . =o — =% - rad 4 - oor? Yr vot FSP OsF ef Sor dor bye “SrF sJdath Aa puaa : L: Zwasvyl coh 41. Fy atsvaL gil — CTT Tyee] on | ow |D on] 41 ,.,| a0] on | on ‘2S bur ; ‘ H t NuezL| £49 |129"/) 1, 4H y LVS) puzeta| 4 99\ 499 ler Lh, WUWIAUSINUAA «gn yw @Z ! i Cl vival ours qua\%\z on| wsvalov7s| wa\%| ron VE 'FLM — ¢_ | wanso| wt] £500) fh | 2294) x2ns0} 4a [42 0u) 4) 4920) , = 1) 65 4° oy Zz hienuened Ls on | esann iNno22u Lismpah = | 77) es wall 29 = slels|t|olololololol. Elalt : ON 12 7 sau110d _— — FF ems NIFLKIS : ) JO w#7dto 4 $ IHL OL Ald eS , SOHN WUS en ZLE-2L OS ON E> = s NIKI ON wn SISNIAXT THIOINI | SISi oo7LU) oo Nl a\ ainta-oL 2Uah| ATHINOW | ATHLNOW | ZUM Ae 402 / 3 aA,ON ININILULS AABHNAS — ON -1290 sszadau SHUN | : SS 74 75 76 77 ROC TRAFIE MAFI 382 78 Li are eg? Ly ad yes 486 per tne) Tor’ INVLD PROC ‘ TRAFR = 488 490 TRAF I (re! es) 438) a) éD. INVENTOR THOMAS R. JOHNSTON [ito aole 81 TOTALS THOMAS R. VOHNS TON Nt sToarks — 55 Siaa/ SET ADDR 449 r Ie. STRT-OF ACCT L608 FOR GET ‘SAVE ADDR 5 sol sive nODR + lo : ‘ : 2 83 TRANSACTION JOURNAL TERIOR W|ACCOUNTNO| NEME Ss TeT] L21.212_ 3) ADDRESS taro" YR|" CAP TeHECK | WECOUNTS ' wo | wo | 287* Menzies |pévost COMMENTS 104 \03\25 66 2 87 | | NON CODE it 2'87 ' xx 128 03 3/166 } $1 \46| INVALID CODE to a S/ \46| exe 134 |0101 103'3/'\66 6:77 13} |0/03 \04:04'b6 2:00 : it 8'77 | | xex a —— : uw Oe i i ts. 11:64) °° $1:46, ACCNT TOT. | 4A ° ” fps. A | “ecer-No "| = SUMMARY STATEMENT I : J. norval 222 ~ gi 24, . ¢12e (428 £30) 4875 4845 CAT RECOUNTS || PERCENTAGES | No. | CATEGORY NAME txTsaRrF 7a \vERe TO DATE | CURRENT WO. \YFAP 70 DATE 100 | INCOME ee =a) , ' 04 | D/V/DENDS = 8 901 || \ \ 107 | WAGES 511 48! | 1464193, || ; ’ me pi il ! i TOTAL INCOME 377 \46\ 7473 \83, |, H i so 1 : 120 | EXPENSES? % od SA : Se a8) : ' 12/ | AUTO 40/3; 160 .95' || H 1 125 | CLOTHING 5 1001 67 14), || } SS t —— = ce ) Hl TOTAL EXPENSES | 293112; | 1240 6); mn H € INVENTOR Lo Fioti, THOMAS R. JOHNSTON BY [ldechiceachs BEST COPY AVAILABLE aoa —4 hand bt | # NATIONAL BANK ' i uy £VADA, 1OWA ‘e 0372-648 [mel Bta 0134~646 450 ¥: ONS TIN fF a ef ' st a bat Ss a ANY BANK ANYWHERE, USA 47/§ OG72 7 62 o4/7 67 ANY BUS/NESS 652 CSNY WHER PE USA 85 SDD OOSOOOO . “699 Gs cAT NO n *p nen Pr on 9- 9A 9R FP In | 8}; 8}; 8] 8]| 8) 81) 8 Bs : 71] 7H) Fit 7iL 7h) 7} 7 a 711 7 : -&{| al} 6}) 6) 6) gh euicic se _ st] sil sil si} s OL sil sills 7 4|| 4|| 4/| 4 uy aii ail all all. 3|| 3|| 3 abl 3\, 3|| 3|| s|| 3 | al| 2i| AXaty all ai] i] 2 2 C t aI a} dial} atl allall all tease j golf oU od off oU oU oU ob tat b40——~" : ry 7 yi : THOMAS R I OHNS TON eae a] BR ° . ® " ~ ~_ 2 ST OS Ds w g ee oe nts fee ai | , ~ atu iy = = Ny ne 8 Oy 2 of on Fete a Sete oe of =e b - stots Bor Vo! ry ' iy 86 EXAMINER’S ANSWER, NOVEMBER 3, 1970. This is in answer to an appeai from the Final Re- jection of Claims 1 through 11 and 16 through 27. Claims 12 through 15 were withdrawn from considera- tion when applicant acceded, without traverse, to an election requirement. No claim is allowed. A correct listing of the claims under appeal appears in Pages 3 through 17 of applicant’s Appeal Brief. THE REFERENCES RELIED UPON FOR THE FI- NAL REJECTION ARE: 3,274,554 Hopper et al September 20, 1966 3,308,439 Tink et al May 7, 1967 3,343,133 Dirks September 19, 1967 3,374,462 Best et al May 19, 1968 3,407,387 Looschen et al October 22, 1968 APPELLANT'S INVENTION: Appeiiant’s invention is a financial record keeping process for monitoring the various dealings of persons using the services of a bank. It is a process that is designed to elicit information from transaction documents, to update the bank’s records for such persons, and to then produce monthly bank statements for mailing to such persons. The process is set forth in the form ef a computer program which is to function with an automatic system. Appellant’s disclosed best mode is a computer program listing which is to be used with an IBM 1400 series computer. It is noted that appellant’s “preferred em- bodiment” as set forth in lines 11-16 on Page 19 of his Appeal Brief is contradictory in some very important aspects (i.e, elements 10 and 14 on Fig. 1A) to his “preferred embodiment” as set forth in lines 14-22 on page 7 and lines 1-3 on page 92 of his specification. ; é : 87 The various subroutines or phases of appellant’s process are set out in Pages 20-40 of his Appea! Brief. It is noted that appellant uses the term “mechanisms” to describe his various program subroutines or phases and concedes that his invention (i.e. process) “is adaptable for use with various types of computers” (see Page 40 of his Appeal Brief). EXPLANATION OF THE REFERENCES: The patent to Hopper et al shows a document reader and operating console for input data, magnetic tape transports for master and updated files, memory and processing modules with controls therefore, and a docu- ment printer and a magnetic drum as output devices. The various mechanisms of Hopper et al are computer programmed controlled. The patent to Tink et al shows a banking system having multiple teller stations interconnected with a data processor and a random access unit operating under program control. A bank customer can get full informa- tion of his account, updated, at the time he engages in - a transaction with a bank teller. Non-personal contact transactions also can be entered in the data processor for recordation and updating of files, however, when it is most convenient to the bank. The patent to Dirks shows a program controlled data handling system having an input means and input file, a central processing file system, output file and a printer output unit (ie. Fig. 49 and Columns 3-5) which is used for file maintenance, up-dating for current balances and generating printed output documents. The patent to Best et al shows an operator as well as program controlled computer, a memory with controls therefore for computational purposes and a printer out- put unit. The patent to Looschen et al shows a program con- trolled banking system similar to Tink et al, and which 88 has all of the features and abilities of Tink et al. In addition, Looschen et al includes a polling system pri- marily to establish interconnection between a central control and a particular window machine. It is noted that appellant admits that all of the cited references are adaptable, when properly program- med, to carry out the methods of his invention (see Page 41 of his Appeal Brief) as is set forth in his computer program. THE FINAL STATUS OF THE CLAIMS: Claims 1-8, 10, 11 and 16-24 are rejected under 35 U.S.C. 112 for failing to particularly point out and distinctly claim the subject matter which the appellant considers as his invention, as was stated in Paragraph 13 of the January 6, 1970 Final Action which is in- corporated herein. Appellant’s claims are considered as misleading and hiding his true contribution in that he is claiming a program as structure using the means- plus-function format. Claims 1-8, 10, 11 and 16-24 are rejected under 35 U.S.C. 112 as claiming a program in means-plus-func- tion language (in apparatus form) as indicated in Para- graph 15 of the January 6, 1970 office action which is incorporated herein. The claims are considered to be directed to a use for a known machine. Claims 1-11, and 16-24 are rejected under 35 U.S.C. 102 as being anticipated by Hopper et al, Tink et al, Dirks or Best et al as indicated in Paragraph 16 of the January 6, 1970 Final Action which is incorporated herein. Appellant’s “banking system limitation” is not considered controlling. Claims 25-27 are also rejected under 35 U.S.C. 102 as being anticipated by Tink et al or Looschen et al, as indicated in Paragraph 18 of the Final Action and which is incorporated herein. 89 RESPONSE TO APPELLANT'S ARGUMENTS: Since the appellant has chosen to argue the patent- ability of his claims in several categories, this RE- SPONSE will follow such format in order to provide con- tinuity between Argument and Response. 1. The Rejections on Prior Art The first claims considered by appellant are Claims 25-27, which are method claims which were submitted by the appellant by supplemental amendment. Such claims stand rejected under 35 U.S.C. 102 as being anticipated by Tink et al or Looschen et al. The two cited references are considered to comprise all of the computer elements specified in appellant’s claims, i.e., a computer master and sub files, account numbers, records for category codes and monthly state ment generators. ; Appellant places great weight for the patentability of his method claims on his terms “demand deposit banking accounts” and “category code numbers”. The theory be- hind “demand deposit banking” accounting and “savings accounts” accounting is essentially the same. Transac- tions against specific bank accounts are normally or- ganized by “category codes” (i.e. deposit, withdrawals, charges against or interest earned). Whereas, the ap- pellant uses code numbers for his individual transactions and Tink et al or Looschen et al do not, both procedures end with the same result (i.e. updated bank records and the monthly generation of bank statements). In essence, the appellant is seeking patent coverage for a process which (1) he has assigned a particular name to and (2) uses numbers. No new steps over the prior art methods are considered to be found in such “numbered particularly narmed” process. Certainly, what one can do with bank savings accounts he can obviously do with bank demand deposits. 90 Claims 1-11 and 16-24, as apparatus claims, are treated next. Such claims stand rejected under 35 U.S.C. 102 as being anticipated by Hopper et al, Tink et al, Dirks or Best et al. Appellant admits (1) that his so-called apparatus system is defining process steps in the means-plus-func- tion format (see page 47 of the Appeal Brief) and (2) that the cited prior art general purpose computers are capable, structure-wise, of carrying out his invention, i.e. a computer program (see Page 41 of the Appeal Brief). In the face of such admissions, it is inconceiv- able that the appellant can contend. that the structure of the cited references does not anticipate what he is claiming. It is again emphasized that appellant has not cited any specific structural elements of his “best mode” (i.e, the programmed IBM 1400 computer) which are correlated to his individually claimed “means”. It is noteworthy to indicate that the IBM 1400 computer can assume a variable number of configurations in dependence upon the needs of the particular customers. No struc- tural elements not shown by the cited references are found in appellant’s claims. Appellant's citation of Prater and Wei, 162 U.S.P.Q. 541 (1969) as authority for his position is considered without merit. What was said by the court relative to the operation of a programmed general purpose com- puter was dicta for such operation was not an issue in that case. As for Bernhart and Fetter, 163 U.S.P.Q. 611 (1970) what is discussed therein is not pertinent to the present issue involved herein. The issues involved in such case dealt with statutory subject matter and a method for the use of a planar plotting apparatus. No such issues appear in this Appeal. Appellant’s claimed “system’’ cannot operate wholly without human intervention because of the need to initially manually fill in the transaction records either by the 4 H - ‘ i : ; | 91 bank’s customer or the bank teller, the need to insert the records into a reader and the need to generate individual output reports on a monthly basis. Appellant’s machine readable records are only a small part of the invention he seeks patent coverage for. Jn re Jones, 153 U.S.P.Q. 77. was cited by appellant in support of his machine readable records, but such case was directed to a dise (structure) with etched markings on it that activated a photocell, and is therefore con- sidered not pertinent. Appellant’s whole invention is a program, written in the form of symbols, and it is in- tended that such program convey intelligence to any one reading it. 2. Rejections Under 35 U.S.C. 112 Appellant’s own admissions that his total invention is a process, in the form of a program, that directs a general purpose computer system through a series of steps should negate any contention that he should be entitled to structure claims (i.e. Claims 1-8, 10, 11 and 16-24). Also, Appellant’s late submission of process claims 25-27 by Supplemental Amendment is taken as another indication that the proper format for his claims would appear to be the method type claim, as a possible new use for a known machine. Ex Parte Lewis, 154 U.S.P.Q. 487, which was cited by the appellant, was directed to method claims drawn to the function of an apparatus. Such decision did not uphold “the patentability of machine process claims for computer inventions embodiable in the form of software computer programs” as appellant would have us be- lieve on Page 54 of his Appeal Brief. The Appellant’s argument with regard to Claim 9 is considered untenable for the imprinting “input de ice” claimed therein can reasonably be considered as struc- ture. In Bernhart and Fetter, the question of the sufficiency of disclosure of that application under 35 U.S.C. 112 was not before the court as it is here. Also, in such 92 case, no holding such as “a software computer program for—is a physical control device and is properly ex- pressed in apparatus form in means-plus-function lan- guage” (see Page 57 of Appellant’s Appeal Brief) ap- pears therein, as appellant argues. In the representative structural claims in Bernhart and Fetter (i.e. Claims 18 and 19) words such as “electronic signal data pro- cessing means—programmed” and “electronic digital com- puter means programmed” are far different than claim- ing a software computer program in means-plus-function language. Concerning the appellant’s failure to particularly point out and distinctly claim the subject matter which ap- pellant considers as his invention, his failure to indicate in his disclosure what structural parts of the IBM 1400 system he considers for his individually claimed means is considered sufficient to sustain the rejection of Claims 1-8, 10, 11 and 16-24 under 35 U.S.C. 112. The blocks in Figs. 6, 7, 8 and 9, referred to on Page 57 of the Appeal Brief, are flow charts setting forth particular routines of appellant’s program. The technical and manufacturing problems raised by this Exarainer as being associated with the building of a computer, and dismissed so lightly by the appellant as “within the skill of the art to handle”, are very real and highly important to the producers of such structura! computers. Many computer configurations, designed “on paper”, prove unfeasible or inoperative when reduced to structure. Should one carry the supposed meaning of Bernhart and Fetter decision to a natural conclusion, the number of “physically different” machines appears determined by (1) the length of the program being used on a par- ticular computer multiplied by (2) the number of steps required for each instruction in completing the processing required by that program. The enormity of determining what structure the computer may consist of at a par- ticular thousandth of a millionth of a second (their present operating speed) should be obvious from such conclusion. ee eee ee ee en 93 SUMMARY: In view of the above rebuttal of appellant’s arguments, when considered with the incorporated Final Rejection, it is submitted that (1) Claims 1-8, 10, 11 and 16-24 do not particularly point out and distinctly claim the subject matter which the applicant considers as his in- vention nor are such claims in the proper type of claim format as required by 35 U.S.C. 112 (2) Claims 1-8, 10, 11, and 16-27 are anticipated under 35 U.S.C. 102 by prior art. Accordingly, it is submitted that the re- jections of the aforementioned claims be upheld and the appellant be denied patentability for any of the sub mitted claims. /s/ Paul J. Henon PAUL J. HENON Group AHT Unit 237 Conf: P. J. Henon G. D. Shaw ; ; ; 3 ; ; ; 3 ; $3 ; ; 3 ; +3 +) ; eee +s es Seae $3 is: ; : H [ig s333 ; $3 eS ; ii iit +38 eo ; ; H eee oe : ES i ii - if : i 7a it Hit il ; HF i : : i : if ii i oe { netene's seat tatnnty oz ‘ ; i ; £22 BF i ii TP if fi i = See 5 ‘f it i i i i i nit | _ tao | i Man. - 95 4 Comms —-it is transferred to the inmer memory, for example, the core memory of the computer. The third category of systems applications is the “tape ta ; ing of the satellite computers with simplified, administrae indicate, for example. items which are known to require the administrative type of applications is in the field of Broups of tracks of a 7 poy Br 3 tive tyre programs. This izaves a good dzui of incentive, special attention, due to their high value, their entical matrix operations for linear programming and similar vertical arrangement yy: which bee ye j interesting and fexpunsiric Operations withia the vorious $9 supr'y condilion on the market, special dificulties in pro functions. This type of operation is also a special stream- —_— signal heads —- one 7 a of managerial levels of companies. according ths principles duction of suie, or doe to their design and probadiity of ing mode type of operation in which series of calculations 70 signal heads over ae & Sam — j of multiple management and mansgement by exception. alterstions, ete. Oa the other hae t, the fefoemotins crits are performed at matria members in certain determined waske, together wih cannssutive Leng bt weeks, 7 4 Some operatives fur weich tandutt vaio. iat 4) tes ryav ag! sat J* ° 1SP PFe°8 6uct a@ —— hn a — ae in pony ph —~ Siieneiie —t _— - mad _ —— ; e re eopeciclly ‘wozlal are deverited oy the tigwing cx «ert i voflts “ges " 7 wen etard. ss or . wdiease. % be a well sopteabte to tit yoy peek ty There may be two of more input or output channels { angles 75 recutds of information units may indicate, for example, The modern development of the components makes 76 Operative at the same time within the same set of discs J / 4 8,343,133 9 items behind schedule, overdrawn, overdue, above or be- low, over or understocked plan, out of intended sequence, schedule; records with new evidence, which apply or may result in modifications of the established or basic plan records; selected records of the established or basic plan group which may be used in several tentative or conditional runs and rearrangings to determine the optional reaction to the new evidence records; ification records for the established or basic which are supplementary to the records of the established or basic plan group and are therefore utilized | 6 groups or key field indexes for the record im a track or in a combination of a group of tracks. Another use for reference records is as reference records in random sequentially oriented files, in which selected ones are used to build up with other reference or detail records mew sequences of groups of records, thereby newly composed sequences of records digits and text for ordering, scheduling, reporting, etc.. for example, with eventually a mamber of levels of producing and alternation. Variove caamples are cally in addition to "he basic plan group. This may be effectea Dy a mark .n the basic plan growp records, or, single random-wise located records in random files, or if they are not *oluminous, by a search operation for § as sequentially serted records, which are sorted sad modification before the basic plan group records are merged into groups of key field numbers. The sequentially used. ~ tJ tr LF For the purpose of simplification, the up-dating of the information collated under account aumbers ater basic plan file by the modification records by merging up-dated print cut, but with available random access dur. them with the basic plan file may be accomplished only ing the collating time period. The sequeatially sorted in determined interva!s such as, for example, days, weeks = records may comprise bills of materials or operation or months, dependent upon the prevailing conditions, 25 plans, and may comprise scheduled sequences of infor- but the requirement of complete usage of the mation units for production, purchasing, financing, cost file system is achieved by the automatic combination of accounting, sales forecast and controlled sales promo- the basic plan file and the modification file. In simple _—tion, esc., as illustrated in greater detail in the examples up-dated file operations such as, for example, ledger files presented in Charts I to DG. for personal accounts, accounts receivable and payable The use of the reference file may be Mlustrated by provisions, a split within the file system may be made = describing the reference and detail records in « produc- between records sorted according to key fields, repre- tion planning and control operation. The reference in- senting, for example, account numbers, on a daily basis, Lit, |-t.,— b_ and merged into the monthly transactions, which are produce the requirement of material, manpower, equip- printed out as statements at the end of the month, aad 35 ment and tools, broken down into time periods, and to including as latest balance the balance of the end of the check such requirement with available stock on order, last day, but permitting, if requi random access to manpower and equipment capacity available, and to ed- the detail information assembled up to date for the par- just both requirement and availability of coverage in @ ticular sccownt number. The split may be randomwise,. continuous feedback loop system, may be shown, for according to timely occurrence such as, for example, 40 example, for a product consisting of sub-assemblics aad recorded transactions of the day, tested im case of an res 1 Piece Gob Amembiy Namber.......... caetee ees ae : ye : inquiry for detail information for information sorted The may inctode, as Chart I shows, the mais according 0 eS dandmaanie standard features (273, ) - coqenten, Go com ety be of ane Out cease ges number 034.21 count number, including but a few informations, in addi- ee ae - Se tion to the account aumber and latest balasce, comahs 2 B® sub-tscambly number 036.215-080.01 in and nee, such as indicators overdrafts = cate entiiae requiring special attention or special The product may also include, as optional. features: my —y SF PE ned cut. Toe spt in the OS PO ment 027.336-012.88 tion for the iod not yet prin fle operation may alo’ be used for tulomatic auditor and as a special feature: a trials i file ing. as berei in detail ht for FIGS. 139, 140 and 141), "1% ! BS Sow Mom part. This type of splitting of the file operation permits the 65 instead of: obdservonce of all management rules, which are generally Minus 2 pes. part pumber 127.316-010.04 determined by the principles of multiple management and management by exception. Reference records may be used for various operations such as, for example, as search records for random files to determine the location of detail records in index search operations. In its simplex« form, this may be accomplished by short key and location identifier records. The search may be broken down into one and more steps, a first one, which may include a selection of all key Selds concerned, and an Sn el ee eee systems requiring good reaction times and operating under information indicaics, as illustrated in Chart i, that 15 the principle of management by exception. 1 sub-assembly number ..... 034.216-210.05 consists in turn of: 2 pes. part number 216.014-034.03 1 pe. part number 632.134-012.01 20 5 pes. part number 337.216-137.04 3 pes. raw material number ............... 7.316.214 ‘1 pe. raw material number 2.136.116 and that itr stamdard time schedules are 15 and 10 time 95 units (for example, days) before completion of the sub- The lust two digits of the number Examples for planning and contro! are shown for the areas of production, finance, cost-accounting and sales, and for up-dated reporting for the areas of ledger files and other accounting dala. Operative File for Planning, Control and Up-Dated Re- porting in Production Planning and Coatrol The use of the reference information records A3a and A36 of FIG. 1, shown in more detail in Chart Il, and of the detail information records A4e and A4d, shown in more detail in Chart III, produces together with the pro- duction schedvlirg information A7, shown in more detail in Chart I, the first summary B¢ of planning information in the operative file BI by the selection and selective mul. 20 tiplication of the detail information for assemblies and parts B2 per assembly level, and by sorting and distribut- ing such records to the planning periods B3. The scheduled times for planning periods are determined in this example ing the required standard lead time units (for ees dy substracti Sub-assembly 034.216-210.04 beginning with . . . until 35 example, days) from the shipping, calculated assembling Sub-assembly 034.216-210.05 beginning with .. . until of completion date of the assemblies or parts. Ta the preparation of part requirements, and operation schedules, the 3 pieces of product 1460-210, which are CHART N1L—REPERENCE FILE RECORDS {Yor production planning and control opersiioa schedule for parts] pest Be Avaliable - — : Univ ee. dap) : ceeteeee DOHC Contrat Lever : Moterial —..... 2206) Stor! Shall (measurements and qual 10 Operetoe 2—Machine 126C = =—s_- Milling (time required) oon part number 216.014-.03. These are: Raw material “steel shaft” 3.216.031 and measurements Operation | “turning” on machine group 314.000 and time Operation 2 “milling” on mac..oc group 136.027 and time required etc. The standard time schedules may be 10, 8 and 6 time units etc. before completion of the part. the number of units, which is 3, the order number, which is 1460-210, and the avsembly or shipping year aod day (1960-262, ay well av the main, optional and special fea- tures hereinbefore de-cribed. C. Operative files The srecis? advastices of randonseqvential fle ban- 4 : il i g : g i to be shipped on day 262 (Chart I) will each require 3 pieces of assembly #034.216-210.05, 30 time units (for example, 30 days) before completion date. Therefore, 3x3 or 9 pieces of assembly 4034.216-210.05 must de available on day 232 (day 262 minus 30 days). Accord- ing to Chart If, the sub-assembly of each two picces of part #216.014-034.03 requires 15 days for its comple- tion, so that 9x2 or 18 such parts must be available at day 217 (day 232 minus 15 days). Since the sicel shafts required for the machining of the part contro! lever, 216.014-034.03 must be available 10 days before the availability of such parts for the assembly (Chart 11), 18X11 or 18 steel shafts must available on day 217 minus 10 or 207, to meet these re- quirements. It is evident that not everything in a plant follows the Original scheduling, nor is the capacity used in the best manner of available at the richt time for all such require- ments. A fexidle and adaptive planning and control op eration therefore requires a constant feedback Icop sy» tem B3 to B9 in the informativa retrieval and processing * for the slaarins ead contro! & Erldt aha yet OF Pefancavion 10 to 200,905 inf oma a BEST COPY AVAILABLE 13 14 quentially according to assemblies, Darts, The items in which greater differences ocewr are cob equipment, in scheduled periods, and it selec- y~ frit tol by tion and rearranging of such information. detail information BS and exception summary B6. The automatic processing of the comparison of the items require action, either by buying from other vendors, requirements of parts, assemblies or tools, their avail- § producing them in other shops, or by other facilities, ability in stock, supply by vendor or own shop and the using other material or parts or changing the time comparison of required manpower and machine time and schedule. Effective planning and control requires the capacity for the various places of the shop and the floor — ability to first hold the change influencing information will indicate in the summary B4 of the requirement and — units in a separate area of the file system, in order to availability either the ability or the inability to perform yg permit the evaluation of the consequences before they the operation according to the intended schedule or an become effective. Unti! the best solution of the problem economic or uneconomic use of available capacities. Se ae This be shown positive or negative required. joa &. Bn A. A - sr 20d availability for either Management games may be accomplished with selected assembled parts, tools, manpower or facilities for the 1§ information units within the loop of information B3 to periods calculated in quantities, and, as far as required _BY. In the information feedback Joop system a continuous in accounts. adjustment to the occurring requirements is achieved with The use of the random-sequential type of operation as small a reaction time within the feedback loop system may keep the total of the preparation of requirements as economically possible. The planning period may refer and scheduling of parts and operations in a current up- 20 to a period of about one year or several months ahead, dated condition with the possibility of selectively rearrang- but the nearer the scheduling time, the more dangerous ing fractions of such information without losing their = and difficult are the changes, and the more important is mutual conditional timed relationship. This may also a small reaction time with rapid access to information avoid the necessity for rerunaing the entire operation in and rapid processing. This refers also to engineering periodic cycles as in data processing sysiems now utilized at by new design AS and obsolescence Aé informa- for such purposes. 23] 25 Baas sees 3 CHART [Vd.—OPERATIVE FILE RECORDS (For produciics planning and contre! pisaning information for parts requirement svallabLity) =i Fre T «ere ec nuns Part é Requirement prodaxt Seuree Ores “high value and — Fy end any “misting,” “surplus” ems. Req’ anent Net oan 3 Sikdnes ‘Beoken down, 0 required acearding to sources Supplier, Promise Beruken deere, i squised scoording \¢ supplies Supple, Supply ae te ew te Aaktes Dee males = ond — - —e ~s0r% + Ne ae me lm | ee ee ee eee 101 3,343,153 CHART Vc—OPERATIVE FILE RECORDS (Por prodc:.ion plasaing and contro! pianag taformaton for tect uss requirement caperity] 15 at - he ae ee J. oe oe Charts IVa to IVc present the preparation of informa- operations B16, B17, T18, if this is not accompiished tion for production planning and the breakdown of the by the unit in the production control center. details for requirement and availability of parts, man __ Since every planning or control is only reliable if a and machine operations per period in vertical grouping 20 constant feedback loop comparing planred and actual of the details per time period or date. The bereinbefore Operation is established, a continuous comparison BI? descnded loop selectively updates, by us Tandom-se- between scheduled or intended performance BI6 and actual performance B18 is provided. In the continuous 2 change and thereby up-dates the great quantity of in comparison, there is continuously reported back in ma- in- 25 chine readable form information indicating what is per- other processing operations. formed by whom and where it is performed B19 and in a which there is constant comparison of planning and per- follow-up of the existing conditions may be . formance data and any exception, in which plan and disagree, is automatically reported. y *_ performance and control. The vertical information of Charts 29 For the various types of managerial decision levels the IVa, IVb, and IVe may be grouped into horizontal current comparison between plan and actual reporting on periodic report rows. The charts only indicate principals, variances in quantity or time, or multiplying quantities Not specific forms or detailed solutions. and times with standard costs, variances between planned The planning information for the month, weeks or and actual performance in cost figures may thus become days ahead BI@ and the current survey of the day is 75 available in any desired detail, in listings indicating basic information required for the control period. It uses summary and exception information for planned or the detail information for the control periods B11 (parts budget, actual and variance [Text truncated at 120,000 characters. The full text is on the page linked above.] --- Source: Frix Law Library, https://www.frixlaw.com/law-library/documents/brief%3Amicro_IA40385003_0284%3A03. Public record. Not legal advice.