### 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 6-1: Real-Time Track: List of Courses

1993

"... In PAGE 28: ... Students with sufficient background may be able to waive the prerequisite courses and should therefore contact the Department of Electrical and Computer Engineering. Table6 -1 contains information about the courses that students can take to develop skills in understanding real-time computing issues and in developing software for real-time systems. The table also shows prerequisite courses.... In PAGE 29: ... Those students who already have fundamental programming and electrical engineering skills (includ- ing signals and systems) are best prepared to pursue a controls option under the real-time track. The courses shown in Table6 -2 are members of one of the following four categories: (1) courses which are prerequisites for other courses, (2) courses whose content covers the educational objectives specified earlier, (3) courses whose content covers some of the previ- ously listed educational objectives and are prerequisites for other courses, and (4) courses which cover advanced DSP or control theory. To select a sequence of courses, the student should consider course prerequisites as well as the term(s) in which a course is offered.... In PAGE 30: ... The student could then complete a summer independent study involving an industrial control application and follow this with the Real-Time Applications Laboratory course and Linear Systems or Digital Signal Processing I. Table6 -2: Industrial Controls Option: List of Courses Course Name Educational Objectives Course Number Prerequisite Course(s) Term Offered Units Calculus Prerequisite 21-121 None Listed Fall* Spring* 10 Calculus in Three Dimensions Prerequisite 21-259 21-121 Fall* Spring* 9 Numerical Methods EE3, EE4 21-369 21-259 Fall* Spring* 9 Introduction to Numerical Analysis I EE3, EE4 Advanced Topics 21-660 None Listed Contact Instructor Fall* 12 Intro. to Electrical amp; Comp.... ..."

Cited by 5

### Table 6-1: Real-Time Track: List of Courses

"... In PAGE 12: ... The student could then complete a summer independent study involving an industrial control application and follow this with the Real-Time Applications Laboratory course and Linear Systems or Digital Signal Processing I. Table6 -2: Industrial Controls Option: List of Courses Course Name Educational Objectives Course Number Prerequisite Course(s) Term Offered Units Calculus Prerequisite 21-121 None Listed Fall* Spring* 10 Calculus in Three Dimensions Prerequisite 21-259 21-121 Fall* Spring* 9 Numerical Methods EE3, EE4 21-369 21-259 Fall* Spring* 9 Introduction to Numerical Analysis I EE3, EE4 Advanced Topics 21-660 None Listed Contact Instructor Fall* 12 Intro. to Electrical amp; Comp.... In PAGE 13: ... Those students who already have fundamental programming and electrical engineering skills (includ- ing signals and systems) are best prepared to pursue a controls option under the real-time track. The courses shown in Table6 -2 are members of one of the following four categories: (1) courses which are prerequisites for other courses, (2) courses whose content covers the educational objectives specified earlier, (3) courses whose content covers some of the previ- ously listed educational objectives and are prerequisites for other courses, and (4) courses which cover advanced DSP or control theory. To select a sequence of courses, the student should consider course prerequisites as well as the term(s) in which a course is offered.... In PAGE 14: ... Students with sufficient background may be able to waive the prerequisite courses and should therefore contact the Department of Electrical and Computer Engineering. Table6 -1 contains information about the courses that students can take to develop skills in understanding real-time computing issues and in developing software for real-time systems. The table also shows prerequisite courses.... ..."

### Table 1. Real-time channel table

"... In PAGE 3: ... If the request corresponds to the secondary chan- nel, it must also be verified that the primary channel does not go through the switch. To do this, each switch has a channel table (see Table1 ) that keeps track of all channels that go through it. If there are not enough resources or the primary channel goes through the switch, a false response message is returned to Ha0 .... In PAGE 5: ... The Control Port allows switches to inject control mes- sages. The Channel Table keeps track of all channels that go through the switch (see Table1 ). In the DRRTC proto- col, the input and output virtual channels for each real-time channel must be recorded in the table.... ..."

### Table 1. Specs of a real-time system

2000

"... In PAGE 4: ... In section 4, we present a new scheduling algorithm with a improved controller that can satisfy the specs. Table1 illustrates the specs for a real-time system to be designed. The miss-ratio window of interest is MW = 2.... In PAGE 4: ... It was shown that FC-EDF rendered satisfactory performance in term of the classical (steady state) metrics such as the average deadline miss-ratio (Ma) [17]. However, a FC-EDF may fail to meet the specs in Table1 , due to control saturation or system modeling errors, as shown by experiment results (see Section 3.3).... In PAGE 7: ...2, a real-time system is stable if it can always settle down to a steady state in finite time. According to the specs of Table1 , the system is in steady-state if MR(t)=0%. A system unstable if there exists a run in which the system fails to enter and stay in the steady state.... In PAGE 9: ...ontrol gains, (0.25, 0.1), (0.5, 0.1), and (0.25, 0.5), can satisfy the specs in Table1 when SP=2.4 sec.... ..."

Cited by 53

### Table 1. Specs of a real-time system

in Gang Tao ¶

"... In PAGE 4: ... In section 4, we present a new scheduling algorithm with a improved controller that can satisfy the specs. Table1 illustrates the specs for a real-time system to be designed. The miss-ratio window of interest is MW = 2.... In PAGE 4: ... It was shown that FC-EDF rendered satisfactory performance in term of the classical (steady state) metrics such as the average deadline miss-ratio (Ma) [17]. However, a FC-EDF may fail to meet the specs in Table1 , due to control saturation or system modeling errors, as shown by experiment results (see Section 3.3).... In PAGE 7: ...2, a real-time system is stable if it can always settle down to a steady state in finite time. According to the specs of Table1 , the system is in steady-state if MR(t)=0%. A system unstable if there exists a run in which the system fails to enter and stay in the steady state.... In PAGE 9: ...ontrol gains, (0.25, 0.1), (0.5, 0.1), and (0.25, 0.5), can satisfy the specs in Table1 when SP=2.4 sec.... ..."

### 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: Comparing features of AI and real-time systems.

in Revision:4:1

"... In PAGE 5: ... 2.2 AI Methods The third column of Table1 outlines characteristics of traditional AI planning systems, and reveals a sharp contrast with real-time systems. Most AI systems are based on the \closed world quot; assumption: the AI-controlled agent is the only source of change in the world.... In PAGE 6: ... For example, \reactive quot; systems have been developed to rely on frequently-updated, sensor-based representations of their environment and perform little or no lookahead planning [1,4,11]. The features of these systems are summarized in the fourth column of Table1 . Note that, since they do not perform search, reactive systems generally havelow-variance, bounded response times.... ..."

### 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.... ..."