"... In PAGE 5: ... We expect them to be tested intensively during the test for the targeted components. Table3 shows the statistics on various programs contained in the software tester, including the test pattern generation program and the test application programs for ALU, SHU, and PC. For each program, we show the number of instructions included in the program, the size of the program in bytes, and the execution time in the number of processor cycles.... ..."

"... In PAGE 5: ... We expect them to be tested intensively during the test for the targeted components. Table3 shows the statistics on various programs contained in the software tester, including the test pattern generation program and the test application programs for ALU, SHU, and PC. For each program, we show the number of instructions included in the program, the size of the program in bytes, and the execution time in the number of processor cycles.... ..."

"... In PAGE 7: ... Welch,12 on the Ziv-Lempel compression algorithm. This variation is labelled LZW in Table2 . We actually tried out two versions of the LZW program.... In PAGE 8: ... For the results shown in Table 2, k was chosen to be 4. The version of DMC used in Table2 started with a braid- structured initial model and was not subjected to any memory- size constraints. Furthermore, we set the parameters that control the cloning of states in the Markov model to values that give good results.... In PAGE 8: ... We compared the five different compression programs on several data files. The resulting compression factors are shown in Table2 . A compression factor is computed as the ratio between the size of the encoded (compressed) file and the size of the original file.... In PAGE 9: ... Both the LZW and CW methods are, for practical purposes, byte-oriented. It is indeed possible to implement bit-oriented versions of LZW and CW but, in the case of LZW (as seen in Table2 ), the results are poor. This is because the learning period for LZW becomes much longer, too long for LZW to achieve reasonable compression on typical files.... In PAGE 9: ...bserved figures in the range of 2.2 to 2.6 bits. Of the compression algorithms compared in Table2 , the LZW algorithm is by far the fastest, while the CW method is the slowest. In terms of storage requirements, the adaptive Huffman algorithm uses the least amount of storage and the CW method normally uses the most.... ..."

"... In PAGE 10: ...2 Testing the Hypotheses Since the three hypotheses are obviously related in their outcome, namely to reduce cost of non-quality and improve field performance, we will try to first summarize the achievements in one picture. Table1 provides average values of the different process metrics in the discussed three-year timeframe. They look promising but can not imme- diately show detailed relations.... ..."

"... In PAGE 7: ... Unit materials cost is $35 and labor cost is $29 the second year (4) Capital purchase of $500,000 the first year. 10% straight line depreciation with no scrap value (5) Unit sales price is $200 the first year and $180 the second year (6) Three sales people with an average salary of $30,000 the first year and $31,000 the second year (7) Rent is $3,000 per month (8) Sales are projected to be 3,000 the first year and 3,200 the second year Table2 lists how the combined items of Table 1 break down into the eight subtasks for building the pro forma income statement for this problem. The third column identifies which items in Table 1 are used for each subtask.... In PAGE 8: ...Table2 is to avoid spreadsheet programming oversights. This is intended to include all the types of mistakes one can make when creating the spreadsheet, such as typing mistakes, formula pointing errors, etc.... ..."