### Table 2: Summary of experiments with attributes based on the citation graph. The smallest error that that can be achieved by each representation (by selecting suitable weights of the graph- based attributes) is shown.

2003

Cited by 2

### Table 2: Summary of experiments with attributes based on the citation graph. The smallest error that that can be achieved by each representation (by selecting suitable weights of the graph- based attributes) is shown.

### Table 1 presents a brief comparison of COM, EJB, CCM, and the CDL component model regarding the representation of component contracts and implementations, and its respective direct and indirect interfaces. The concepts of component frameworks and complex components additionally offered by the CDL component model provide a suitable abstraction for the representation of dependencies between COM classes, enterprise beans, and CORBA component implementations. Within the scope of this paper, however, we will not elaborate on these relationships.

Cited by 1

### Table 1: Examples of projection indices suitable for GPP

"... In PAGE 6: ... Hanson exploit geometry-speci c information inherent in the data. Below, we provide a list of representative geometry-based indices, which is by no means exhaustive and can be extended to include other meaningful representations: Table1 : Examples of projection indices suitable for GPP Geometric Primitive Indices Points = 0-simplices The most straightforward set of indices are point spread and point-point distances. Methods used for discrete data points are also applicable.... ..."

### Table 8: This table summarizes the results of Section 4.4. It shows the smallest error that can be achieved by each representation (by selecting a suitable weight for the in-links or out-links attributes). For comparison, the errors achieved without these attributes are also shown.

### Table 8 The dataset for the function z=x+y The first step is to select linguistic terms to be used. Suppose we use 3 linguistic terms (small,ok,big) for each linguistic variable (x,y,z), then we can represent the set of rules as a 3x3 matrix where each cell can assume on of 3 values. To find a suitable representation, we need at least 2 bits to represent each cell value. Therefore each matrix demands a 3x3x2=18 bits string. We can use (00)2 for Small, (01)2 for Ok and (11)2 for Big, and read the matrix left to right, top to bottom. For example, the matrix

in FUZZY LOGIC

### Table 1. Suitability of some design decision Tightness Reliability Cost-eff.

"... In PAGE 3: ... Due to this, software detection is more exible and also has lower installation costs. These properties are summarized in the rst two rows of Table1 . Suitability is assigned in accordance to the normal requirements of low-cost distributed embedded systems.... In PAGE 3: ... Representation of the simple clock synchronization algorithms seem to be more recommended for low-cost distributed em- bedded systems because symmetric schemes require nodes to manage a high number of messages in a short time inter- val, and this overhead can overwhelm the capacity of most low-cost processors and low-cost eldbuses. The properties of symmetric/asymmetric schemes are summarized in Table1 . Again, boolean values are assigned.... ..."

### Table 4: Model Representations Used in the Performance, Variability, and ComFoRT Reasoning Frameworks Reasoning Framework Model Representation

2005

"... In PAGE 23: ... Though the primary purpose of a model representation is as an input to an automated evalua- tion procedure, a reasoning framework might also generate a visualization of the model that is more suitable for human consumption, such as that shown in Figure 4. Figure 4: Graphical Representation of a Model Used in a Performance Reasoning Framework Table4 summarizes the model representations used in the three reasoning frameworks intro- duced in Section 2. CMU/SEI-2005-TR-007 ... ..."

### Table 5: Schematic representation of reduction algorithm. In the first step, we choose AY for each DACXBN DABC CX to transform the gen- erated VC in to the form suitable our simplification rules. We first apply the equality elimination rules in Table 10, until they have all been eliminated. Then we eliminate all A0 BB A0 BA A0 ex- pressions using the rules in Table 7. Then we apply the rules in

### Table 2: Schematic representation of the features of chaos classes

"... In PAGE 5: ... Therefore, with suitable evolution func- tions and in the limit of infinite time, chaos IV is capable of becoming CR random. In Table2 the various aspects of the four classes of chaos are rep- resented schematically. 4.... ..."