### Table 1. General form of the interactive elicitation procedure.

2005

"... In PAGE 8: ...Table1 summarizes the general form of the interactive elicitation procedure that we consider. We first discuss the type of queries that we consider in this work, then describe a number of elicitation strategies.... ..."

Cited by 14

### TABLE VIII ES ALGORITHM IN ITS GENERAL FORM

2006

Cited by 1

### Table 2: General form categories and frequencies across all subjects

2003

"... In PAGE 7: ...ovements, circular/arc (-segment) movements and orientation change, i.e. a stationary move- ment leaving the hand position unchanged. In more detail, Table2 shows category frequencies for the whole corpus as well as for each of the five objects. Tables 3 and 4 show the frequencies of the hand-shape and movement categories that we observed.... ..."

Cited by 16

### Table 1 Diffusion equations used in image processing. The general form of the equations is

1999

"... In PAGE 2: ... JPEG has a characteristic blocking-artefact (Figures 1,2,3 and 6). PDEs of Table1 were tested as perceptually adaptive filters for compression artefact reduction in [8]. The adequate perceptually adaptive filter fell out to be the PMC-AD, since it suppresses noise while performing shape enhancement.... ..."

Cited by 1

### Table 5.1: Linear optimization problem in general form

### Table 2. The general function form is:

2007

"... In PAGE 4: ... We finally come up with four databases. A short extract of one of them is reported in Table2 , where with INT we indicate one of the problem descriptions within the class Interface (5 levels-class), in the same manner SEC is a problem type within the main class Security .... ..."

### Table 3n3a General form of the PDE problems included in the study.

"... In PAGE 12: ... to obtain three levels of accuracy n7c 10 n003 n2c 10 n004 and 10 n005 n7c are collected by the PYTHIAn2dII system. Table3 shows the general form of the PDE problems included in the study. In Table 4n2c the solver modules and solver sequences which were applied to the problems are listed.... ..."

### Table 4: General form of multi-step algorithms. x : non-zero coe cient

"... In PAGE 11: ... Appendix A: Multi-step scheme coe cients In this study, three families of schemes are used for the multi-step particle path integration algorithms: Adams-Bashforth, Adams-Moulton, and backwards di erentiation. The general forms for the coe cients are shown in Table4 and the speci c coe cients for the schemes are presented in Tables 5-7. Appendix B: Non-constant timestep algorithms Most of the algorithms which we have discussed for constant timesteps can easily be extended to non- constant timesteps.... ..."

### Table 4: General form of multi-step algorithms. x : non-zero coe cient

"... In PAGE 13: ... Appendix A: Multi-step scheme coe cients In this study, three families of schemes are used for the multi-step particle path integration algorithms: Adams-Bashforth, Adams-Moulton, and backwards di erentiation. The general forms for the coe cients are shown in Table4 and the speci c coe cients for the schemes are presented in Tables 5-7. Appendix B: Non-constant timestep algorithms Most of the algorithms which we have discussed for constant timesteps can easily be extended to non- constant timesteps.... ..."