### Table 1. Features of Real-time Networks

"... In PAGE 9: ...these two protocols. Table1 lists some main performance criteria of several types of commonly used bus real-time networks. It can be found from table 1 that RT-Ethernet (an Ethernet using the RTCC protocol) has a good real-time performance, a higher bandwidth, and a larger data size a message is able to send at one time.... ..."

### Table 2. Confirmation of Microarray Data by Real-Time PCR

2002

"... In PAGE 6: ...2486 The Plant Cell of these 17 genes was tested in each case using the same cDNA samples that were used for the microarray hybridiza- tion experiment. Table2 shows that the real-time PCR data were similar to the microarray data: in most cases, genes that showed high expression in the microarray experiment showed high expression in the real-time PCR experiment. In a few cases ( Zat12 , ADH1 , unknown protein At3g11930, and pectin methylesterase), the expression ratios were dif- ferent, although both approaches indicated strong gene induction.... ..."

Cited by 1

### Table 1: Objects and members for real-time tracking.

1995

"... In PAGE 5: ....7 seconds. This is admittedly slow real-time perfor- mance, but is adequate for our purposes, and quite reasonable, considering the computational resources used. Table1 shows the feature membership for each object found by the Cluster Agent. A few observa- tions can be made about the clustering: The system detected three objects during tracking, mainly because the motion model is too simple.... ..."

Cited by 3

### Table 1: Comparison of linear propositional real-time logics

1992

"... In PAGE 34: ...ver time (e.g. all times with an even time di erence from the initial state). Thus, RTTL( lt;,s) is interpreted over a discrete time domain, and can be used to specify constant lower and upper time bounds on the time distance between events. The various logics are compared in Table1 for satis ability, model checking and expressiveness over discrete and dense time domains relative to RTTL. For any real-time logic that is closed under boolean operations, and... ..."

Cited by 28

### Table 1: Comparison of linear propositional real-time logics

"... In PAGE 34: ...ver time #28e.g. all times with an even time di#0Berence from the initial state#29. Thus, RTTL#28#3C,s#29 is interpreted over a discrete time domain, and can be used to specify constantlower and upper time bounds on the time distance between events. The various logics are compared in Table1 for satis#0Cability, model checking and expressiveness over discrete and dense time domains relativetoRTTL. For any real-time logic that is closed under boolean operations, and... ..."

### Table 1: Timing Characteristics of the Real-Time Workload and its Recovery

15

"... In PAGE 1: ... S1(12) = 31, S2(12) = 31, S3(12) = 17. It is possible to observe in Table 4 that if Recovery Blocks are used to handle faults, due to the fact that the computation time of the secondary block of task 2 is equal to Cs 2 = 11 (see Table1 ), it can recover under any level of responsiveness.CL GL GE FA 31 31 17 17 Table 4: RTAB Table for Example 3 4 Conclusion A scheme was presented to provide scheduling guar- antees for a variety of fault tolerant techniques.... In PAGE 2: ... The breakdown utilization UBD of a task set with uti- lization UW = Pn i=1 Ci=Ti, including fault-induced re- quirements is given by UBD = UW maxf1 i ngminft2SigfWF i (t)=tg (6) If UW UBD then the task set is schedulable, otherwise the task set is unschedulable. Table 2 shows the fault tolerant recovery bound Uf, and the breakdown utilization UBD, for the task set used in Table1 . It can be observed that under all the recovery schemes UW gt; Uf.... In PAGE 2: ... The largest recovery time with priority i which arrives dt=TF i e in the interval [0; t] may be calculated by, LRi = maxft S i g Wi(t)=dt=TF i e (9) It follows that the largest recovery time which may be added to a set of n tasks without disturbing their schedulability is given by, LTi = minfi k ngmaxft S kg Wk(t)=dt=TF i e (10) Example 1. Considering the fault-free workload pre- sented in Table1 , the analysis for calculating the largest recovery time is given in Table 3. Table 3 shows that there is enough spare time in the schedule to satisfy the timing requirements of the fault tolerant recovery workload, except for the checkpointing model.... In PAGE 3: ... As stated in equation (2), we can compute the schedu- lability test for the fault tolerant real-time task set as, maxf1 i ngminft2SigfWF i (t)=tg 1 (4) Equation (4) gives us an schedulability condition for fault tolerant real-time task sets. Table1 shows a task set consisting of 3 periodic tasks, and its associated timing characteristics for each fault tolerant mechanism. From this requirements, in Table 2 we show the schedulability analysis for the fault tolerant models previously discussed.... ..."

### Table 4: Network utilization for deterministic real-time channels

"... In PAGE 17: ... 7.4 Analysis of Network Utilization Table4 presents a comparison of maximumachievable network utilization of the network using the two tra c models. For a particular trace all the connections are assumed to have characteristics same as that of the trace.... ..."

### Table 6. Result from dynamic real-time system experiment

2005

"... In PAGE 15: ... Since every mutant operator generated more mutants for this system model we decided to use a subset of mutation operator types. Table6 use the same column notation as table 4, but columns \R quot; and \G quot; are added to include the results from random testing and genetic algorithms results respectively. Table 6.... ..."

Cited by 1

### TABLE 1. Quantitative (real-time) PCR analysis of mb-1 transcripts in murine B-cell lines

in Early B-Cell Factor, E2A, and Pax-5 Cooperate To Activate the Early B Cell-Specific mb-1 Promoter

### Table 6-1 Frame rates achieved during real-time simulation of the final model

in C et al

1992

"... In PAGE 9: .... 48 Table6 -1 Frame rates achieved during real-time simulation of the final model using... ..."

Cited by 1