### Table 1: Relative complexity for certain problems restricted to the graph classes I, UD, P, and TL.

in Improper

"... In PAGE 3: ...Table1 for a summary of what is known about these problems, comparing the restrictions to interval graphs, to unit disk graphs, to planar graphs, to disk graphs and to weighted induced subgraphs of the triangular lattice. Later, we shall be able to add two rows to this table that correspond to k-IMPROPER CHROMATIC NUMBER and MAX k-DEPENDENT SET.... ..."

### Table 1.1: Relative complexity for certain problems restricted to the graph classes I, UD and P.

2005

### TABLE 5. Work restrictions* for health-care workers (HCWs) exposed to or infected with certain vaccine-preventable diseases

"... In PAGE 40: ...TABLE5 . Work restrictions* for health-care workers (HCWs) exposed to or infected with certain vaccine-preventable diseases Disease/Problem Work Restriction Duration Mumps Active Exclude from duty 9 days after onset of parotitis.... ..."

### TABLE 5. Work restrictions* for health-care workers (HCWs) exposed to or infected with certain vaccine-preventable diseases

"... In PAGE 39: ...TABLE5 . Work restrictions* for health-care workers (HCWs) exposed to or infected with certain vaccine-preventable diseases Disease/Problem Work Restriction Duration Diphtheria Active Exclude from duty.... ..."

### Table II: The usage of different access strategies (in % of all usage) at tasks with a certain level of experience. (Abbreviations used: RB - Restricted Browsing view type; FB - Free Browsing. )

### Table 6.12: OSPF problem instances. There are four data sets, one for each expansion phase. Each set exists in three variants: Free link designs within global limits, link designs restricted to a certain amount of changes, and all link designs fully fixed.

### Table 1: Literature containing algorithms answering questions in invariant theory and their implementations. for this class of algorithms). New contributions are the use of the multigraded Hilbert series driven Buchberger algorithm [9, 22] for computation of relations, completeness of equivariants (B. 2.)), restriction of completeness to certain degree (A.2b.), B. 2b.)), mem- bership of free module. Restriction with respect to various gradings are the key to the partial completeness questions. This is illustrated by examples which have been computed on a Dec Alpha workstation. These new ideas mainly improve the e ciency of existing algorithms. The algorithmic treatment for continuous groups has been implemented and tested for the rst time.

"... In PAGE 4: ... However this is not well recognized by the dynamical systems community. Table1 summarizises the relevant books and articles so far they contain e cient algorithms and gives an overview of implementations. Invar [29] and Symmetry [19] are implemented in Maple while an implementation for C.... ..."

### Table 1. Examples of relations between restricted permutations and other combinatorial objects

2005

"... In PAGE 12: ...voiding these three patterns is Fn (see, e.g., [9]), where Fn is the n-th Fibonacci number with F0 = 1 and F1 = 1, we have jS5(k; n + k)j = kFn. In Table1 we provide some of the connections related to the structures described above for certain choices of i, j, and k. Note, that we meet non-trivial connections between difierent classes of restricted permutations.... In PAGE 12: ... Note, that we meet non-trivial connections between difierent classes of restricted permutations. However, the connections from Table1 beg direct bijections to indicate the actual coding of the objects in terms of restricted permutations, which we leave as open problems. Closing this subsection, we indicate that restricted permutations might be used to give combinatorial proofs of certain identities.... ..."

Cited by 2

### Table 4: Interrelationship Characteristics The kind of interaction which might occur between participants is the third relationship we consider. First of all, interaction between entities can be asynchronous or synchronous (i.e. all participants have to be present at the same time). In the synchronous case interaction can be either unrestricted or restricted through certain mechanisms (e.g. floor or token mechanisms). This can apply to the whole group or to a sub-set of participants. Uncontrolled interaction allows unrestricted sending of data. All participants are allowed to send data at any time. Controlled interaction refers to a restricted data exchange between participants. Rights towards data exchange can change during the lifetime of the application (dynamic) or be defined for the whole communication (static). Changes are controlled and restricted by rules or conditions. If only a sub- set of participants has distinctive rights for data exchange we have sub-uncontrolled and sub- controlled interactions. The membership in a sub-set can be variable or fixed.

### Table 1: Summary of parameters on the other hand, controls the length of the path expres- sions in each predicate. In addition, the decision of whether a certain node in QG has a restriction predicate on a simple attribute was made randomly. For each join strategy, we keep track of the number of page IOs incurred as we process each class (node) in the access plan. For the join-index, we make use of the cost model presented earlier to estimate the cost of performing the join. For nested-loop (NL) and sort-merge (SM) we use known formulae which are shown below. In these formulae, the parameter Mc denotes the number of data pages needed to store the objects of class c, and Mem denotes the size of the main memory cache in pages.

1995

Cited by 3