### Table 1. Example question and supporting diagram fragment

in Editors

2006

"... In PAGE 105: ... We thoroughly defined in [20] a suite of measures for structural properties of OCL expressions. Table1 only introduces some of the measures we defined for measuring coupling. Table 1.... In PAGE 105: ... Table 1 only introduces some of the measures we defined for measuring coupling. Table1 . Measures for coupling within OCL expressions Measure Acronym Measure Description NNR Number of Navigated Relationships NAN Number of Attributes referred through Navigations NNC Number of Navigated Classes WNCO Weighted Number of Collection Operations DN Depth of Navigations We defined measures for coupling within OCL expressions, because coupling is one the most complex software attribute in object oriented systems [3] and a high quality software design should obey the principle of low coupling [6], [7].... ..."

### Table 1. Example question and supporting diagram fragment

2006

"... In PAGE 105: ... We thoroughly defined in [20] a suite of measures for structural properties of OCL expressions. Table1 only introduces some of the measures we defined for measuring coupling. Table 1.... In PAGE 105: ... Table 1 only introduces some of the measures we defined for measuring coupling. Table1 . Measures for coupling within OCL expressions Measure Acronym Measure Description NNR Number of Navigated Relationships NAN Number of Attributes referred through Navigations NNC Number of Navigated Classes WNCO Weighted Number of Collection Operations DN Depth of Navigations We defined measures for coupling within OCL expressions, because coupling is one the most complex software attribute in object oriented systems [3] and a high quality software design should obey the principle of low coupling [6], [7].... ..."

### Table 1: Relations of Canonical AND/EXOR Trees, Expressions and Decision Diagrams

1997

"... In PAGE 5: ... III. ENHANCING THE GREEN/SASAO HIERARCHY WITH NEW REPRESENTATIONS Table1 shows relationships of the canonical trees, the canonical expressions, and the decision diagrams created from these trees by applying the reduction rules. This table adds new AND/EXOR representations, Zhegalkin Forms 1, to the table from [33].... In PAGE 8: ...iew.Similarly as in examples 2.2 and 2.3 one can create functions that prove that the proper inclusion relations illustrated in Table1 and Figure 4 are true; for instance, that the MPGKTs are better than PGKTs, the MPGKE are better than PGKEs, and so on. An interesting open question is the following: quot;Is the FGKE family of expansions equal to the well-known class of ESOP circuits or is it properly included in ESOP, as the Figure 4 would suggest? quot; The guess of the authors is that it is very close to ESOP but not the same and perhaps only experimentation will answer this question.... ..."

Cited by 4

### Table 6: Complexity of operations on decision diagrams.

2002

"... In PAGE 37: ... It is well known that using a different branching factor, or representing a function by a vector of diagrams, has no effect on the complexity of the operations used during model-checking [41]. The middle column of Table6 summarizes these complexities of the operations from the left column with respect to the size of the graph representing the diagram. Note that even though we can think of representing an mv-set using a vector of diagrams, the underlying implementation constructs a single directed acyclic graph.... In PAGE 37: ... Moreover, since the underlying graph is connected, we can express the complexity of operations relative to the number of nodes in this graph. These complexities are given in the right column of Table6 , where a9 is the number of nodes and a33 is the branching factor of the decision diagram. Using this representation of complexity, we infer the expected running time based on the empirical evidence on the sizes of different decision diagrams.... ..."

### Table 1: Layers of a service chart diagram

"... In PAGE 8: ...In Table1 , next services field represents the list of services that are due for execution after a service completes its execution. This list is an expression that combines services over logical operators (AND, OR, and NOT).... In PAGE 9: ... Preparation state only applies to M-services; they need to be checked and installed upon arrival from the business site to the site of user which is a mobile host. Table 3 illustrates how the fields of Table1 are instantiated according to execution site. After terminating the execution of flight reservation service, the relevant information such as date of departure and date of ... ..."

### Table 1. A collection of diagram operations

1996

"... In PAGE 7: ... 3. Specifying correspondence information The sketch notation for graph-based operations is presented in Table1 . Each operation is specified by its output sketch, Sout, containing a designated input subsketch, Sin.... In PAGE 7: ... Semantics is as follows: if an extension of Sin is given, then extensions of the output items belonging to Sout \ Sin can be computed by the corresponding procedure. So, Table1 presents a (small part of) graph-based query language. Thus, we have extended initial black sketches S1,S2 to black-green sketches S1, S2 specifying also some additional (but necessarily derived) data.... ..."

Cited by 2

### Table 3 Evaluation of the processes of generating class diagram from use case diagrams

2003

"... In PAGE 8: ... The goal-oriented modelling approach was applied in a few small and medium size case studies for the purpose of evaluation and comparison with other object modelling approaches. Table3 evaluates the modelling process with the approaches by considering the effectiveness of devel- oping class diagrams and the stability of the diagram, based on the experiences of the case studies. Fig.... ..."

Cited by 4

### Table 1. Hilbert Curve State Diagram: for Mapping from One Dimension

"... In PAGE 5: ... This state diagram is then expressed in tablular form in Tables 1 and 2. Table1 contains a row for each state and is used in the mapping from one to n dimensions. Within a row, points, expressed as n-points, are ordered by sequence number, or derived-key value.... In PAGE 14: ... Our rules result in a number of states given by n2 n;1 According to Bially, this is the minimum possible. The size of a single state is determined by the number of derived-key { next-state pairs in Table1 , for example, and is given by the expression 2 n . The complexity of the mapping algorithm given in Algorithm 1 can be seen to be O(kn) and this is the same as for the algorithm given by Butz which relies on calculation alone, although the latter includes a higher constant fac- tor.... ..."

### Table 1 - Various combinations of diagrams given to different subjects

1993

"... In PAGE 6: ... 3.5 Experiment Execution Each subject was given a randomly selected combination of four diagrams and two editors based on Table1 . Each subject was given a small demonstration of the two editors.... ..."

Cited by 11

### Table 1: Layers of a service chart diagram Layer Field Perspective

"... In PAGE 3: ... Therefore, the service chart diagram of a composite service consists of con- necting the service chart diagrams of all the services that constitute that composite service. Table1 summarizes the three layers that constitute a service chart diagram. Interesting is layer 2 which con- tains the states that a service takes.... In PAGE 3: ...In Table1 , next services eld represents the list of services that are due for execution after a service completes its execution. This list is an expression that combines services over logical operators (AND, OR).... In PAGE 3: ... Preparation state only applies to M-services; they need to be checked and installed upon arrival from the business site to the site of user which is a mobile device. Table 3 illustrates how the elds of Table1... ..."