### Table 1: Examples of static probabilistic combination strategies

"... In PAGE 10: ...resp., D4BD A8C3BUBC D4BE, D4BD A9C3BUBC D4BE), where C3BUBC is obtained from C3BU by replacing CP (resp., CQ) by CTBD (resp., CTBE). The static probabilistic combination strategies for the dependence informations in Figure 1 are shown in Table1... In PAGE 12: ... Recently, the prob- abilistic conjunction and disjunction strategies for ignorance, independence, positive correlation, negative correlation, and mutual exclusion have especially been discussed in [18] and [17]. To our knowledge, the strategies for the remaining dependence informations in Table1 have not been considered so far. 2.... In PAGE 12: ... For associative static or dynamic probabilistic disjunction strategies A8 and probabilistic pairs D4BDBN BM BM BM BN D4CZ with CZ AL BD, we write C4CXBECJBDBMCZCL D4CX to denote D4BD A8 A1 A1 A1 A8 D4CZ. The following proposition identifies some static probabilistic conjunction and disjunction strategies in Table1 that are commutative, associative, and distributive. Proposition 2.... In PAGE 29: ...INFSYS RR 1843-00-04 Table1 0: ProbView postulates for probabilistic combination strategies BOTTOMLINE D4BD AA D4BE AK D4BD AAD4CR D4BE D4BD A8 D4BE AL D4BD A8D4CR D4BE IGNORANCE D4BD AA D4BE AI D4BD AACXCV D4BE D4BD A8 D4BE AI D4BD A8CXCV D4BE IDENTITY D4BD AA D4BE AH D4BD, if CJD0BEBN D9BECL BP CJBDBN BDCL and CTBD CM CTBE is consistent D4BD A8 D4BE AH D4BD, if CJD0BEBN D9BECL BP CJBCBN BCCL ANNIHILATOR D4BD AA D4BE AH BR, if CJD0BEBN D9BECL BP CJBCBN BCCL D4BD A8 D4BE AH BQ, if CJD0BEBN D9BECL BP CJBDBN BDCL COMMUTATIVITY D4BD AA D4BE AH D4BE AA D4BD D4BD A8 D4BE AH D4BE A8 D4BD ASSOCIATIVITY B4D4BD AA D4BEB5 AA D4BF AH D4BD AA B4D4BE AA D4BFB5 B4D4BD A8 D4BEB5 A8 D4BF AH D4BD A8 B4D4BE A8 D4BFB5 MONOTONICITY D4BD AA D4BE AK D4BR BD AA D4BE, if CJD0BDBN D9BDCL AK CJD0BR BDBN D9BR BDCL D4BD A8 D4BE AK D4BR BD A8 D4BE, if CJD0BDBN D9BDCL AK CJD0BR BDBN D9BR BDCL In summary, these observations show that ProbView assumes a number of postulates that do not have any justification in probability theory. Moreover, as ProbView is missing a rigorous probabilistic background, it also ignores the important fact that there are combinations of probabilistic pairs D4BD BP B4CTBDBN CJD0BDBN D9BDCLB5 and D4BE BP B4CTBEBN CJD0BEBN D9BECLB5 with dependence information C3BU AI C3BUBRB4CTBDBN CTBEB5 that are unsatisfiable.... In PAGE 30: ...27 Table1 1: Comparison with ProbView Our Approach ProbView D4BD AAD0CX D4BE BP B4CTBD CM CTBEBN CJBMBHBN BMBICLB5 D4BD AAD4CR D4BE BP B4CTBD CM CTBEBN CJBMBEBN BMBICLB5 D4BD A8D0CX D4BE BP B4CTBD CN CTBEBN CJBMBHBN BMBJCLB5 D4BD A8D4CR D4BE BP B4CTBD CN CTBEBN CJBMBHBN BMBJCLB5 D4BD A9D0CX D4BE BP B4CTBD CM BMCTBEBN CJBCBN BMBECLB5 D4BD A9 D4BE BP B4CTBDBN CJBMBEBN BMBJCLB5 AACXCV B4BMCTBEBN CJBMBGBN BMBHCLB5 BP B4CTBD CM BMCTBEBN CJBCBN BMBHCLB5 which imprecise attributes are modeled as probability distributions over finite sets of values. Their approach assumes that key attributes are deterministic (have probability 1) and that non-key attributes in different relations are independent.... In PAGE 34: ...10 (sketch). The statements can be easily verified along the static probabilistic combination strategies shown in Table1 (see Proposition 2.9).... In PAGE 36: ...33 The claim is immediate for C3BU BP CUC1D2CSB4CPBN CQB5CV, since the static probabilistic combination strategies for independence are clearly computable in time C7B4BDB5 (see Table1 ; in fact, this holds for every C3BU there). Assume now C3BU BI BP CUC1D2CSB4CPBN CQB5CV.... ..."

### Table 1: Signals of the decoder. The signal v accomplishes the synchronization with the CUT, e.g. by controlling the scan clock in a scan- based BIST environment. The interaction of the other signals becomes clear by inspecting the state transition diagram of the finite state controlling the work of the decoder (see Figure 9).

### Table 4. Statistical Counter definitions

2004

"... In PAGE 21: ... These counters are only present if selected at compile time. Each counter is described in Table4 . There are 6 counters related to head-of-queue operations, 2 related to tail-of-queue operations, 2 related to the distribution, and 1 indicating the first addition to a bin.... ..."

Cited by 1

### Table 1. Comparison of sequential and concurrent probabilistic processes

"... In PAGE 9: ... (13), it makes sense for a Markov net (N, P) and for a reachable marking m, to use the notations: Pm, Em, (14) to respectively denote the probability Pv and the expectation Ev for any finite configuration v with positive likelihood, and such that m = m(v), provided that such a v exists. Table1 summarizes and compares the definitions introduced so far, and em- phasizes the symmetry between sequential and concurrent systems. Table 1.... ..."

Cited by 1

### TABLE 1. - MATHEMATICAL RELATIONS FOR PROBABILISTIC AND FUZZY FAULT TREE ANALYSES

### Table 1: 3-bit counter transition relation table

2003

"... In PAGE 4: ...Table 1: 3-bit counter transition relation table boolean function which is the disjunction of the boolean functions of each of the transitions. Table1 shows the transition relation for the 3-bit counter. An alternative method for describing the transition relation is for each state variable to define its valid next states.... ..."

Cited by 4

### Table 1: 3-bit counter transition relation table

2003

"... In PAGE 4: ...Table 1: 3-bit counter transition relation table boolean function which is the disjunction of the boolean functions of each of the transitions. Table1 shows the transition relation for the 3-bit counter. An alternative method for describing the transition relation is for each state variable to de ne its valid next states.... ..."

Cited by 4

### Table 1: A collection of probabilistic-logical models together with their underlying probabilistic and logical formalism.

"... In PAGE 1: ... Each subarea focuses on its own language con- cepts. Consider Table1 which lists a subset of proposed for- malisms 1. The language concepts vary from acyclic to cyclic models, from logically structured dependencies among ran- dom variables to states, from finite to continuous random variables, and from functor-free languages to Prolog.... ..."

### Table 1 : Probabilistic Sensitivities and Their Deterministic Analogues

1999

"... In PAGE 3: ... To summarize, the main innovation in a probabilistic approach is that a probabilistic sensitivity is formulated in terms of a change in probability of meeting the target over change in an FoM or probability of meeting another target. Examples of typical probabilistic sensitivities and their deterministic analogues are given in Table1 . The left column gives the change of confidence in meeting a target per unit change in FoM, while the right column gives the deterministic analogue sensitivity in terms of the value of one FoM relative to another.... ..."

Cited by 1

### Table 2 Average performance of probabilistic scheduling Rule

2001

"... In PAGE 5: ... In order to report aggregate measures, the best result obtained for a problem is set in relation to the outcome of the deterministic version of the FCFS rule. These values, averaged over the instances of the benchmark set, are shown in Table2 with respect to the four objectives under consideration. The results shown for FCFS verify that a probabilistic schedule builder can produce con- siderable improvements against a deterministic one.... ..."