### Table 3. A collection of diagram operations Name Designation in Arity Shape Denotational Semantics texts diagrams Input sketch Output sketch

1995

"... In PAGE 19: ... Among them there are operation-determined predicates expressing that certain (output) sets and functions are obtained by application of a corresponding procedure to input sets and functions. For example, labeling a square diagram by the pull-back marker hPBi means that the pair of arrows with the common source was obtained from the pair of arrows with the common target by a certain procedure called hPBi (whose semantics is described in the Table3 ). This is quite similar to introducing, eg, a ternary predicate h+i s.... In PAGE 19: ...+i s.t. h+i(x; y; z) means that z = x + y. In addition, it can occur that input data for some operation are speci ed by a diagram of sets and functions subjected to certain conditions. For example, input data for the operation providing the universal arrow of push-outs, UAPO (see Table3 ), are speci ed by two squares and one of them should be a push-out while the other should be commutative. Thus, we assume that our collection of markers is partitioned as M = P [ O with P the set of predicate (constraint) markers and O a set of operation markers s.... ..."

Cited by 29

### Table 2. A collection of diagram operations Name Designation in Arity Shape Denotational Semantics texts diagrams Input sketch Output sketch

1995

"... In PAGE 13: ... This is quite similar to introducing, eg, a ternary predicate h+i such that h+i(x; y; z) means that z = x + y. By presenting the collection of Table2 we do not wish neither to convince a DB designers to use just these operations for they are the quot;best quot; ones nor to enforce their using in order to facilitate view integration with our automated algorithms: everyone can use those operations he/she prefers but he has to specify them in the sketch-like format. Also, we do not worry about independence of these operations, many of them can be composed from the other.... ..."

Cited by 6

### Table 2: A collection of diagram operations Name Designation in Arity Shape Denotational Semantics texts diagrams Input sketch Output sketch

1995

"... In PAGE 9: ...ernary predicate h+i s.t. h+i(x;y; z) means that z = x + y. In addition, it can occur that input data for some operation are speci ed by a diagram of sets and functions subjected to certain conditions. For example, input data for the oper- ation providing the universal arrow of push-outs, (UAPO in Table2 ) are speci ed by two arrow squares and one of them should be push-out while the other should be commutative. Thus, we assume that our collection of markers is par- titioned as M = P [ O with P a set of predicate (con- straint) markers and O a set of operation markers s.... ..."

Cited by 1

### Table 5.7: Aggregate recognition rates for the baseline system (BL) and SketchREAD (SR) for the circuit diagrams by shape.

2004

Cited by 8

### Table 1 Characteristic Practices

"... In PAGE 5: ... The software reuse literature was screened for dominant themes to develop the survey items. The items along with the applicable literature references are presented in Table1 . Other demographic information such as company size was also collected.... In PAGE 5: ... Other demographic information such as company size was also collected. ----------------------------------------- Insert Table1 about here ----------------------------------------- In order to get a sense of the survey items in aggregate, an affinity diagram was composed. The affinity diagram technique [15] collects textual data into clusters via an iterative, manual process performed by domain experts (in this case, the authors).... ..."

### Table 1: Relative-error approximability via sketches

"... In PAGE 17: ...?r additively, and, if 1?r is smaller than the error of approximation (i.e., if jA Bj lt; jA[Bj), then the techniques of [BCFM98], which approximate jA Bj as jA Bj = (jAj + jBj)1?r 1+r, do not perform well,k but our technique approximates jA Bj with small relative error regardless of the size of jA Bj. This information is summarized in Table1 . Other cells in the Venn diagram reduce to these results, e.... ..."

### Table 1: Relative-error approximability via sketches

"... In PAGE 16: ...?r additively, and, if 1?r is smaller than the error of approximation (i.e., if jA Bj lt; jA[Bj), then the techniques of [BCFM98], which approximate jA Bj as jA Bj = (jAj + jBj)1?r 1+r, do not perform well,6 but our technique approximates jA Bj with small relative error regardless of the size of jA Bj. This information is summarized in Table1 . Other cells in the Venn diagram reduce to these results, e.... ..."

### 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 2: A collection of diagram operation markers (queries) Name

"... In PAGE 2: ... Certainly, the derived items of the sketch we consider can be obtained by an evident Select-From-Where SQL- query. We prefer, however, to specify this query as a compo- sition of elementary diagram operations with sets and func- tions: Null, CoImage, Composition, presented in the top of Table2 (as for the Null operation, we assume that each domain contains a single distinguished null value). Deno- tational semantics of operations is described in the corre- sponding column of the table.... In PAGE 2: ... In general, a diagram operation Q is speci ed by a sketch denoting its input data, Sin Q, and a sketch denoting the out- put data, Sout Q . It is convenient, however, to join Sin Q and Sout Q into one sketch SQ so that an operation Q is speci ed by an inclusion Q : Sin Q - SQ (in the Table2 sketches SQ apos;s are called output sketches). The body of operation is then a procedure PQ which calculates an extension of SQ from a given extension of Sin Q.... In PAGE 2: ... 2. Given Table2 , with conventions adopted above the graph- ical image on Fig. 4(a) speci es a system of queries against the basic sketch in a unambiguous way.... ..."

### Table 2. Contents of the states of the interaction diagram of the proposal protocol.

2004

"... In PAGE 11: ... 2. Interaction diagram of the proposal protocol (see Table2 for state contents). In the presented model temporal aspects are only sketched, we plan to de- velop this point in the future.... ..."

Cited by 17