"... In PAGE 6: ....9, 2.2 10,000,000 64 24500 NA 8080 ---, 3.0 Table2 -a: Normalized broadcast rates in Kbytes/second with a fixed root processor. Table 2-b gives the normalized broadcast rates where the root processor is cycled through all p processors as the broadcast operation is repeated.... In PAGE 6: ...0 Table 2-a: Normalized broadcast rates in Kbytes/second with a fixed root processor. Table2 -b gives the normalized broadcast rates where the root processor is cycled through all p processors as the broadcast operation is repeated. Notice that the rates do change from those in table 2-a and the maximum percent change depends on the machine.... In PAGE 7: ....9, 2.4 10,000,000 64 24600 NA 8270 ---, 3.0 Table2 -b: Normalized broadcast rates in KBytes/second with the root processor cycled. To better understand the amount of concurrency occurring in the broadcast operation, define the log normalized broadcast rate as (total data rate)/log(p) where p is the number of processors involved in the communication and log(p) is the log base 2... In PAGE 8: ...constant for a given message size as p varies. Table2 -c gives the log normalized data rates with a fixed root processor and shows in fact that concurrency is being utilized in the broadcast operation for these machines. Figure 2 shows these results for a message of size 100 KBytes.... In PAGE 8: ....9, 2.4 10,000,000 64 258000 NA 86800 ---, 3.0 Table2... ..."

"... In PAGE 5: ...A(i) is 8 bytes, then the communication rate is calculated by 8*n*(p-1)/(wall-clock time) and then normalized by dividing by p-1 to obtain the normalized broadcast rate. Table2 -a gives the normalized broadcast rates obtained by keeping the root processor fixed for all repetitions of the broadcast. Figure 1 shows the graph of these results for a message of size 100 KBytes.... In PAGE 6: ....9, 2.2 10,000,000 64 24500 NA 8080 ---, 3.0 Table2 -a: Normalized broadcast rates in Kbytes/second with a fixed root processor. Table 2-b gives the normalized broadcast rates where the root processor is cycled through all p processors as the broadcast operation is repeated.... In PAGE 6: ...0 Table 2-a: Normalized broadcast rates in Kbytes/second with a fixed root processor. Table2 -b gives the normalized broadcast rates where the root processor is cycled through all p processors as the broadcast operation is repeated. Notice that the rates do change from those in table 2-a and the maximum percent change depends on the machine.... In PAGE 7: ....9, 2.4 10,000,000 64 24600 NA 8270 ---, 3.0 Table2 -b: Normalized broadcast rates in KBytes/second with the root processor cycled. To better understand the amount of concurrency occurring in the broadcast operation, define the log normalized broadcast rate as (total data rate)/log(p) where p is the number of processors involved in the communication and log(p) is the log base 2... In PAGE 8: ...constant for a given message size as p varies. Table2 -c gives the log normalized data rates with a fixed root processor and shows in fact that concurrency is being utilized in the broadcast operation for these machines. Figure 2 shows these results for a message of size 100 KBytes.... ..."

"... In PAGE 4: ...xperiments are not performed at all, i.e. we have 0 repetitions. Table1 displays the number of repetitions with respect to medicament combination, duration, and diet type of the experiments of the original project. Temporal arrangement: Several repetitions should be carried out in parallel, that is, they should start and nish at the same day.... In PAGE 6: ... Finally, we introduce one resource for each experiment in order to control its temporal arrangement. According to Table1 , we have 25 experiments with a number of repetitions greater than zero. Hence, we obtain 25 resources k = 3; : : :; 27 of this type with a constant availability of Rk(t) = 1 for all t 2 T: The idea behind these latter resources will become clear when we de ne the activities in the next subsection.... In PAGE 7: ... The third row then displays the number of repetitions of each of the resulting activities. In accordance with the number of repetitions stated in Table1 , we obtain J = 62 activities. The processing time pj of activity j 2 f1; : : :; 62g is given by the duration of the related experiment.... In PAGE 11: ... Proof. From Table1 we know that 109 experiment repetitions have to be scheduled. Given that only 6 rats may be examined per examination day, we need at least 19 exam- ination days which are also working days.... In PAGE 11: ... The number of experiment repetitions with a duration of more than 3 days is 95, cf. again Table1 . These repetitions require at least 16 examination days which are also working days.... ..."

"... In PAGE 4: ... Table 1 summarizes general fault-tolerant multi-party protocols because they can be used to implement untraceable broadcast and secret ballot election. Table2 summarizes untraceable broadcast protocols, Table 3 secret ballot election protocols. The assumptions for untraceability and fault tolerance are independent.... ..."

"... In PAGE 7: ... We consider that the key reason for the difference is the rate of the rep- etition of a basic motion. Table1 shows the approximate repetition rates using the data of Figure 4. Table 1: Approximate Repetition Rate Object Repetition Rate [Hz]... ..."

"... In PAGE 3: ... However, given unreliable recog- nition, prosody could provide a helpful knowledge source for repetition detection if results for the prosody-onlymodel are bet- ter than chance. Table2 shows results for repetition detection. Table 2.... ..."

"... In PAGE 3: ... However, given unreliable recog- nition, prosody could provide a helpful knowledge source for repetition detection if results for the prosody-onlymodel are bet- ter than chance. Table2 shows results for repetition detection. Table 2.... ..."