### Table 1: A schedulable set of skippable periodic tasks. Using a processor demand criterion, Je ay and Stone [5] showed that a set of hard periodic tasks is schedulable by EDF if and only if, for any interval L 0, L n

1997

"... In PAGE 3: ... They also found that, given a set ? = fTi(pi; ci; si)g of periodic tasks that allow skips, then n Xi=1 ci(si ? 1) pisi 1 (2) is a necessary condition for the feasibility of ?, since it represents the utilization based on the computation that must take place. To better clarify the concepts mentioned above consider the task set shown in Table1 and the corresponding feasible schedule, obtained by EDF, illustrated in Figure 1. Notice that the processor utilization factor is greater than 1 (Up = 1:25), but condition (2) is satis ed.... ..."

Cited by 17

### Table I Best Calendar Rules under the Mean Return Criterion This table reports the historically best-performing calendar rule, chosen with respect to the mean return criterion, in each sample period for the full universe of 9,452 calendar rules.

1998

Cited by 10

### Table III Best Calendar Rules under the Sharpe Ratio Criterion This table reports the historically best-performing calendar rule, chosen with respect to the Sharpe ratio criterion, in each sample period for the full universe of 9,452 calendar rules.

1998

Cited by 10

### Table I Best Technical Trading Rules under the Mean Return Criterion This table reports the historically best-performing trading rule, chosen with respect to the mean return criterion, in each sample period for both of the trading rule universes: the BLL universe with 26 rules and our full universe with 7,846 rules.

1999

Cited by 23

### Table II Best Technical Trading Rules under the Sharpe Ratio Criterion This table reports the historically best-performing trading rule, chosen with respect to the Sharpe ratio criterion, in each sample period for both of the trading rule universes: the BLL universe with 26 rules and our full universe with 7,846 rules.

1999

Cited by 23

### Table 4: Example Task Set Exact Criterion Results

1992

"... In PAGE 34: ... To find out whether this task set is schedulable, we are forced to use the exact criterion. The result of using the exact criterion algorithm for each task is shown in Table4 . The algorithm requires that we check for a particular condition at each period boundary of each task.... ..."

Cited by 6

### Table 4: Example Task Set Exact Criterion Results

1992

"... In PAGE 34: ... To find out whether this task set is schedulable, we are forced to use the exact criterion. The result of using the exact criterion algorithm for each task is shown in Table4 . The algorithm requires that we check for a particular condition at each period boundary of each task.... ..."

Cited by 6

### Table 3 reports the variance decomposition [Mundlak (1978)] of the factor exposures [see equation (10)]. The factor exposures result from rolling weak RBSA over 180-days windows of individual mutual funds on the following factors In2, In4, In5. See Table 2 for description of the indices. The selected individual funds have data over the complete sample period. In total 5 funds meet this criterion.

"... In PAGE 22: ... We use the last part of the identity given in equation (10) that splits the total variance into the variance between time, the variance between funds and a residual component. Table3 reports, for the 5 funds with complete data coverage, this decomposition with respect to the exposures to the broad equity index (In2), the small cap index (In4) and the Belgian bond index (In5). Table 3 : Decomposition of Variance.... ..."

### Table 1. Convergence of p-cyclic GMRES for periodic steady state test problems. M is the number of time points, n is the number of unknowns per time point. The number of iterations needed to satisfy the stopping criterion is displayed in the last 5 columns, for different values of p.

"... In PAGE 7: ...imulation. The periodic DAE is solved by the procedure explained in Sect. 1. Table1 shows the sizes of the test problems (2). The matrices are taken from the first Newton step of the nonlinear system solution process.... In PAGE 8: ...Table1 . We see that usually the speed of convergence decreases with increasing p, but it decreases only slowly relative to the increase in p (see also Table 1).... ..."

### Table 3: Tests for time varying parameters in periodic model speci cations

"... In PAGE 10: ... The case of German consumption data illustrates how di cult periodic time series are to specify in applied work if forecasting performance is seen as a criterion for model evaluation. Tests for periodic parameter variation for models in rst di erences gave convincing evidence in favour of a time dependent data structure (see Table3 ). In terms of ex{post forecasting non{periodic models in rst and seasonal di erences are clearly outperformed by periodic... ..."