### Table 1 Analysis: The Detect Task

### Table 3 Analysis: The Direct Task

### Table 3. Result of ANOVA. Dependent variable is total presence score and R2=1.00

### Table 5. Result of ANOVA. Dependent variable is presence

### Table 2. Application task under the Stopped scheme

Cited by 1

### Table 1. Performance analysis of authentication schemes

"... In PAGE 7: ...1 Performance Evaluation In this section, we analyze and compare the performance of four authentication schemes: PKD, PKD with IAPP caching, PKD with anticipated 4-way hand- shake, and the proposed scheme. The overall results of the analysis are summa- rized in Table1 in which m represents the average number of neighbor APs per each AP. In Table 1, the communication factor represents the necessary number of mes- sage exchanges for the PMK and PTK establishment among the entities.... In PAGE 7: ... The overall results of the analysis are summa- rized in Table 1 in which m represents the average number of neighbor APs per each AP. In Table1 , the communication factor represents the necessary number of mes- sage exchanges for the PMK and PTK establishment among the entities. The common exchanges of the flrst full EAP/TLS authentication exchanges, or group key handshake are not included in this analysis.... ..."

### Table 2: Analysis of Segmented Fuzzy Checkpointing Scheme

1996

"... In PAGE 5: ... We assume the size of the log (not including the checkpoint-records) generated within a complete checkpoint interval is independent of the way the database is segmented. Table2 shows the parameters and derived formulas used in our analytical model. We use the size of the log from the rst checkpoint-record in the most recent complete check- point interval to the end of the log as the recovery cost, Ravg.... In PAGE 5: ... Thus, we can concentrate on how to reduce the recovery time with- out worrying about how di erent number of segments might introduce di erent overhead during normal transaction pro- cessing. Using all of the formulas in Table2 , we derive the following equation. Ravg = S0 + schk (n + 1) + 1 2 S0 Pn i=1 s2 i (1) Since we assume the size of the log (not including the checkpoint-records) generated within a complete checkpoint interval is independent of the way the database is segmented, the value of S0 can not be changed by di erent ways to seg- ment the database.... ..."

Cited by 7

### Table 1 Various storage schemes for CTMC analysis

2002

"... In PAGE 5: ... However, as these researchers have stated, symbolic methods are hindered by the memory requirement for the storage of the probability vector(s). In Table1 , we summarise the main representative approaches used for over- coming the state space explosion problem when analysing stochastic models. We concentrate on the data structures used to store the matrix and vector, and whether they are stored in- or out-of-core.... In PAGE 6: ... This approach does not have the memory limitations stated for all other implicit methods in Table 1. The first explicit out-of-core method listed in Table1 was introduced by Deavours and Sanders [9,10], where the vector is stored explicitly in RAM as an array and a disk is used to store the matrix explicitly. In [17] this method was further extended by storing the vector as well as the matrix on disk.... ..."

Cited by 7

### TABLE II QUANTITATIVE ANALYSIS OF MOBILITY SCHEMES

2005

Cited by 2