### Table I. Summary of the basic idea behind the classes of tests in the diehard test suite for random number generators. In all cases tests are run with several parameter settings. For a complete description we refer to [Marsaglia 1995].

### Table 1. Comparison of the numerical solution with three grid levels and the analytical solution for Poisson equation. This simple example illustrates the basic idea underlying MSS, and it suggests that it might provide a very e cient way to performing DNS for very complex con- gurations.

"... In PAGE 5: ... i+1 ? 2 i + i?1 h2 = fi; and three levels ( 1; 2; 3), we obtain the numerical solution at selected points: in 1 1i+1 ? 2 1i + 1i?1 :52 = ?4; in 2 2i+1 ? 2 2i + 2i?1 :252 = ?4 ? ( 1i+1 ? 2 1i + 1i?1 :252 ); in 3 3i+1 ? 2 3i + 3i?1 :1252 = ?4 ? ( 1i+1 ? 2 1i + 1i?1 :1252 + 2i+1 ? 2 2i + 2i?1 :1252 ); where 1 = I 2 1 1; 1 = I 3 2 1; 2 = I 3 2 2: Letting (1); (2); (3) denote the nal solution at grid levels 1, 2, and 3, we obtain the results as shown in Table1 . Obviously, the more the grid levels, the better are... ..."

### Table 2. Basic granules and their measures

2002

"... In PAGE 6: ... In the rest of this section, we will use an example to illustrate the basic ideas. Table2 summarizes the measures of basic concepts with respect to the parti- tion piclass.... ..."

Cited by 11

### Table 2. Basic granules and their measures

"... In PAGE 6: ... In the rest of this section, we will use an example to illustrate the basic ideas. Table2 summarizes the measures of basic concepts with respect to the parti- tion piclass.... ..."

### Table 1 summarizes the results of diagnosis. The example illustrates the basic idea of using CLP( lt;) to diagnoses soft faults. In our experiments with lters we do not take parameter tolerances into account. However, instead of one we take several measurements, and combine the computed values of suspected faulty components in order to rank them in decreasing likelihood of beeing faulty. Suspected Computed component value [ ] R1 250 500 R2 4000 8000

1993

"... In PAGE 6: ... However, instead of one we take several measurements, and combine the computed values of suspected faulty components in order to rank them in decreasing likelihood of beeing faulty. Suspected Computed component value [ ] R1 250 500 R2 4000 8000 Table1 : Computed actual values of potentially faulty resistors CLP( lt;) is resticted to systems of linear equations and inequalities. Non-linear con- straints are accepted but not resolved they are just delayed until (if) they eventually become linear.... In PAGE 15: ...3 Example 3: R5 faulty In the last experiment, we inserted a deviation fault of R5 (100 k instead of correct 10 k ) into the circuit. Like in previous examples, measurement results (Table 9), computed values of the assumed components for the four modes of operation ( Table1 0), and computed average values (Table 11) are given.... In PAGE 15: ...3 Example 3: R5 faulty In the last experiment, we inserted a deviation fault of R5 (100 k instead of correct 10 k ) into the circuit. Like in previous examples, measurement results (Table 9), computed values of the assumed components for the four modes of operation (Table 10), and computed average values ( Table1 1) are given.... In PAGE 16: ...423 x x x x 1005 0.002 Table1 0: Computed values of suspected components for R5 = 100k The di erence between the measurement results and the simulated values of gain and phase in the all-test mode indicate that the faulty element is one of the resistors. Computed values of V in the rst stage test mode con rm that R1 can be eliminated as well as R3.... In PAGE 17: ...0698 R3 997 3.371 Table1 1: Average values for R5 = 100k 5 Conclusion Achieved results show that the model-based diagnosis with CLP( lt;) can be used in auto- matic fault isolation of active analog lters designed in accordance with the proposed DFT methodology [9]. Although the results refer to a narrow problem domain, the applicability of the model-based approach to more general cases is by no means excluded.... ..."

Cited by 3

### Table 9: Project Instance Now the basic idea of the rule can be described as follows (cf. [5], Theorem 1): We assume that all of the activities currently in process have either been previously delayed or have become eligible, that is, they start at the current decision point. Moreover, we can nd an activity j which is in process and which cannot be simultaneously processed with any other activity temporarily started at tg. Furthermore, job j cannot be 15

1994

"... In PAGE 16: ... We obtain: [i; mi; j; mj] := ( 1; if job i in mode mi and job j in mode mj are simultaneously performable, 0; otherwise. Consider the project instance shown in Table9 . The corresponding network is shown in Figure 3.... In PAGE 18: ... 2 The following example illustrates the previously described bounding rule. We consider again the instance given in Table9 . Furthermore, we consider the partial schedule shown in Figure 5 (a).... In PAGE 20: ...Table9 and the partial schedule displayed in Figure 5 (b). Activity 3 in mode 1 may be processed simultaneously with activity 5 in mode 2, but not with job 4 in mode 1 (recall, we have [3; 1; 5; 2] = 1 and [3; 1; 4; 1] = 0).... ..."

Cited by 1

### TABLE III Table III). The third technique is fingerprinting [1]. The basic idea here is to mark every location with a unique set of cell tower identifications and signal strengths. The current measurement is compared with the database of all fingerprints and the location of the fingerprint that corresponds at most to the measurements is then chosen. Fingerprinting needs dense training coverage as it is not able to localize in areas that are not included in the training data. Table III shows the accuracy of this technique which is comparable to the GP based technique and slightly better in the downtown area. This area has the highest density of cell towers. This advantage will be mitigated when evaluated in sparse training environments, where GPs outperform fingerprinting techniques.

2006

Cited by 9

### Table 4: Extensions: Representational level Predicate terms P describe concrete predicates. They are either a predicate name PN or a list (hnameDi (x1 : : :xn) hexprDi) consisting of a domain identi er hnameDi and a list 9This follows the basic ideas presented by Baader and Hanschke in [1]. 10adding the missing number-restrictions is simply the task of adding rules to the inference engine 11minimum and maximum are provided for backward compatibility and handled as prede ned concrete predicates.

### Table 1: Duality model of TCP/AQM algorithms. In the table, y(t) = Ps xs(t) is the aggregate source rate at link l. Other notations are explained in Sections 3.1{3.2. marginal utility of these schemes are illustrated in Figure 2.2 We now proceed to their derivation. 3 Duality model of TCP/AQM 3.1 (F; G; U) for Reno The basic idea of Reno [30] is for a source to probe for spare network capacity by linearly increasing its window and halving its window when a mark is detected.3 Let ws(t) be the window size, p(t) be the congestion measure at the link, and m(t) = m(p(t)) be the marking probability in period 2The plots can be used to compare the shapes of various utility functions and their derivatives, but not the absolute values as they have di erent units. 3In this paper, unless otherwise speci ed, a `mark apos; means either a packet loss or an ECN bit that is set. Most implementations of Reno and its variants treat multiple marks within a round trip time as a single congestion signal 5

2003

"... In PAGE 5: ...Table1... ..."

Cited by 153