"... In PAGE 6: ... Although the traditional mechanism designer, ignoring computational considerations, attempts to provide eco- nomic guarantees about a mechanism, the computational mechanism designer strives also for computational guarantees, and he thus is concerned not only with economic consider- ations but also with issues of computational complexity and algorithm design. To illustrate the distinction between the two fundamentally different aspects of mechanism study, Table1 lists a few examples of economics and computational results that are often pre- sented in research. Table 1: Examples of Mechanism Design Results... In PAGE 7: ... No algorithm can implement this mecha- nism and have a worst-case computational complexity that is linear in its input. Table1... ..."

"... In PAGE 2: ... Simultaneous co-creation and co-modification oper- ations for detailed design cannot be supported effectively. Real co-modelling functions can be supported by the second category of work, in which three common distributed modelling mechanisms have been developed and their characteristics are compared in Table2 . Several popular systems in this category are summarised in Table 3.... ..."

"... In PAGE 35: ...igure 4.3 illustrates the timing relationship in the B-TE. Table 4.1 summarises which clocks have to be applied to the PCM coder and decoder for the various options. The algorithm to determine the timing recovery mechanism at the terminal, as summarised by Table4 -1, is as described in the following paragraphs. In addition, the B-TE shall conform to the signalling requirements of section 2.... ..."

"... In PAGE 35: ...igure 4.3 illustrates the timing relationship in the B-TE. Table 4.1 summarises which clocks have to be applied to the PCM coder and decoder for the various options. The algorithm to determine the timing recovery mechanism at the terminal, as summarised by Table4 -1, is as described in the following paragraphs. In addition, the B-TE shall conform to the signalling requirements of section 2.... ..."

"... In PAGE 4: ... Thus, if many design patterns utilize a certain language mechanism, we can be reasonably sure that many real world software systems use the mechanism as well. In Table1 , we list the design patterns from [8] and classify them regarding their use of inheritance. A + in the column Abstract means that inheritance from a fully abstract ancestor class is used to establish a common interface in the sense of subtyping.... ..."

"... In PAGE 2: ...hock. A sudden failure mechanism that is not dependent on time. A typical example of such a failure mechanism is failure of electrical components. In Table1 , an overview of the relationship between the OREDA III apparent failure causes (called failure... In PAGE 3: ...The classification presented in this table is a simplification, and deviation from this scheme may occur. In addition to the failure mechanisms listed in Table1 , OREDA comprises codes related to design and operational causes. These codes do not fully fit into the scheme used here, and such events are included in the degradation or shock category according to the observed distribution between these two failure mechanisms.... ..."

"... In PAGE 2: ...hock. A sudden failure mechanism that is not dependent on time. A typical example of such a failure mechanism is failure of electrical components. In Table1 , an overview of the relationship between the OREDA III apparent failure causes (called failure... In PAGE 3: ...The classification presented in this table is a simplification, and deviation from this scheme may occur. In addition to the failure mechanisms listed in Table1 , OREDA comprises codes related to design and operational causes. These codes do not fully fit into the scheme used here, and such events are included in the degradation or shock category according to the observed distribution between these two failure mechanisms.... ..."

"... In PAGE 26: ... Table1 summarizes the differences between machines that support the two paradigms. The primary advantage of explicit message-passing is the ease and efficiency of building scalable machines, since processing nodes require minimal hardware/software support for communication management.... ..."

"... In PAGE 38: ...Table 2: Algorithm for Synthesizing single input, multiple output mechanisms The SIMO synthesis problem can be solved by a series of calls to SISO Synthesize as in ( Table2 ). Calls to SISO Synthesize produce a tree with isolated paths from i to each oj.... In PAGE 38: ...Table 2). Calls to SISO Synthesize produce a tree with isolated paths from i to each oj. However, this introduces a lot of redundancy in the form of common intermediate motions along these paths. The optimization algorithm in Table2 merges common motions in the paths: if the inputs I1 and I2 to two abstract mechanisms in two di erent branches of the initial tree are equivalent, we eliminate the path to I2 and connect I1 in place of I2. This eliminates repeated transformation of i to I2.... ..."