초록 ▼

A method is illustrated in the flow diagram 100 of FIG. 1. A processor 1001 renders a message 1025 for the processor operator's education during times of processor latency 1015, such as dialing onto any network, such as the Internet. This wait time 1017 is normally non-productive, and therefore can

A method is illustrated in the flow diagram 100 of FIG. 1. A processor 1001 renders a message 1025 for the processor operator's education during times of processor latency 1015, such as dialing onto any network, such as the Internet. This wait time 1017 is normally non-productive, and therefore can be used in such a way as to be non-invasive. It is also understood that this time is short, so as to make other actions, such as getting up from the desk, not attractive. Finally, even if the wait time was, or became, very short, the present invention provides the first message 1025 to the process operator that has been filtered. This filtering is a balance of the message owner's willingness to out bid other messages, the time of the day, the location of the operator, and finally the operator's likes and dislikes.

대표청구항 ▼

A method is illustrated in the flow diagram 100 of FIG. 1. A processor 1001 renders a message 1025 for the processor operator's education during times of processor latency 1015, such as dialing onto any network, such as the Internet. This wait time 1017 is normally non-productive, and therefore can

A method is illustrated in the flow diagram 100 of FIG. 1. A processor 1001 renders a message 1025 for the processor operator's education during times of processor latency 1015, such as dialing onto any network, such as the Internet. This wait time 1017 is normally non-productive, and therefore can be used in such a way as to be non-invasive. It is also understood that this time is short, so as to make other actions, such as getting up from the desk, not attractive. Finally, even if the wait time was, or became, very short, the present invention provides the first message 1025 to the process operator that has been filtered. This filtering is a balance of the message owner's willingness to out bid other messages, the time of the day, the location of the operator, and finally the operator's likes and dislikes. ans. CAD of IC, vol. CAD-7, No. 8, 1988, pp. 919-928. G. Mrugalski, J. Rajski, J. Tyszer, "Synthesis of pattern generators based on cellular automata with phase shifters," Proc. Int. Test Conf., pp. 368-377, 1999. R. Kapur, S. Patil,T.J. Snethen, and T.W. Williams, "Design of an efficient weighted random pattern generation system," Proc. ITC., pp. 491-500, 1994. F. Muradali, V.K. Agarwal, and B. Nadeau-Dostie, "A new procedure for weighted random built-in self-test," Proc. ITC., pp. 600-669, 1990. S. Pateras and J. Rajski "Cube contained random patterns and their application to the complete testing of synthesized multi-level circuits," Proc. ITC., pp. 473-482, 1991. J. Rajski, J. Tyszer, "Test responses compaction in accumulators with rotate carry adders," IEEE Transactions CAD of Integrated Circuits and Systems, vol. CAD-12, No. 4, pp. 531-539, 1993. J. Rajski, J. Tyszer, "Accumulator-based compaction of test responses," IEEE Transactions on Comput., vol. C-42, No. 6, pp. 643-650, 1993. N.R. Saxena and E.J. McCluskey, "Analysis of checksums, extended-precision checksums, and cyclic redundancy," IEEE Trans. Comput., vol. C-39, No. 7, pp. 969-975, 1990. N.A. Touba and E.J. McCluskey, "Transformed pseudo-random patterns for BIST," Proc. VLSI Test Symposium, pp. 410-416, 1995. N.A. Touba and E.J. McCluskey, "Altering a pseudo-random bit sequence for scan-based BIST," Proc. ITC., pp. 167-175, 1996. K.H. Tsai, S. Hellebrand, J. Rajski, and Marek-Sadowska, "STARBIST: Scan autocorrelated rand