### Table 4: Parameter estimates as obtained with Proc Mixed analysis of the extensive data set underlying the upper triangle in Table 2.

in Abstract

2005

"... In PAGE 16: ...Random Efiects fi1; : : : ; fi8 Intercept Calyear DY DY, log (DY) log (DY) Table 3: Mixed model speciflcation. Table4 contains the parameter estimates and their standard errors as obtained with Proc Mixed in SAS. The predicted values for the remaining cumulative payments of the reported claims were computed using the second formula in (16).... ..."

### Table 7 More extensive PVM data transfer rates for the four node studies Bytes in

1993

Cited by 29

### Table 1. Data complexity of query answering in extensions of DL-Lite

2005

"... In PAGE 9: ...anguage EL instance checking is polynomial even in the presence of general (i.e., cyclic) inclusion assertions, while extensions of the language lead easily to intractabil- ity (cf. Table1 ). Conjunctive query answering in EL has not been studied yet, however the results in Table 1 show us that such a service is PTIME-hard in data complexity and hence cannot be delegated to a relational DBMS (actually such a lower bound holds already for instance checking).... In PAGE 9: ... Table 1). Conjunctive query answering in EL has not been studied yet, however the results in Table1 show us that such a service is PTIME-hard in data complexity and hence cannot be delegated to a relational DBMS (actually such a lower bound holds already for instance checking). 5 Conclusions For the management of data intensive ontologies, we have advocated the use of DL-Lite, a subset of OWL-Lite that (i) is specifically tailored to capture conceptual data models and basic ontology languages, and (ii) keeps the worst-case data complexity of sound and complete reasoning in LOGSPACE.... ..."

Cited by 6

### Table 1. Data complexity of query answering in extensions of DL-Lite

2005

"... In PAGE 9: ...anguage EL instance checking is polynomial even in the presence of general (i.e., cyclic) inclusion assertions, while extensions of the language lead easily to intractabil- ity (cf. Table1 ). Conjunctive query answering in EL has not been studied yet, however the results in Table 1 show us that such a service is PTIME-hard in data complexity and hence cannot be delegated to a relational DBMS (actually such a lower bound holds already for instance checking).... In PAGE 9: ... Table 1). Conjunctive query answering in EL has not been studied yet, however the results in Table1 show us that such a service is PTIME-hard in data complexity and hence cannot be delegated to a relational DBMS (actually such a lower bound holds already for instance checking). 5 Conclusions For the management of data intensive ontologies, we have advocated the use of DL-Lite, a subset of OWL-Lite that (i) is specifically tailored to capture conceptual data models and basic ontology languages, and (ii) keeps the worst-case data complexity of sound and complete reasoning in LOGSPACE.... ..."

Cited by 1

### TABLE I GGP CONVENTION FOR FILENAME EXTENSIONS IN THE CASE OF SEISMIC DATA (FROM [9])

2005

### Table 3 contains the results of Lempel - Ziv compression on the data values. Recall that because of the extensions

### Table 1. Extensions of existing query languages for the access to new types of the data Host

"... In PAGE 2: ... Here, we briefly summarize the potential interoperability of semantic web with relational and XML databases from data management and query perspectives. Table1 illustrates some extensions of existing query languages for access to new types of the data. It is well-known that SQL is extended to query both relational and XML data, namely SQL/XML, allowing SQL queries to create XML structures with a few powerful XML publishing functions.... ..."

### Table 5: Area extensions of the approximations

1993

"... In PAGE 8: ... To get a feeling which area extensions are realistic, we computed the approxima- tion extensions of the real data presented in section 3. Table5 depicts the average area extension normalized to the MBB-approximation which is set to 100%. Table 5 shows that on the average the area extension of the 5-corner and of the minimum bounding ellipse is about 22% higher than the area extension of the MBB.... In PAGE 8: ... Table 5 depicts the average area extension normalized to the MBB-approximation which is set to 100%. Table5 shows that on the average the area extension of the 5-corner and of the minimum bounding ellipse is about 22% higher than the area extension of the MBB. The area extensions of the 4-corner, of the RMBB and of the circle are 42% to 51% higher than the area extension of the MBB.... ..."

Cited by 55

### Table 5: Area extensions of the approximations

1993

"... In PAGE 8: ... To get a feeling which area extensions are realistic, we computed the approxima- tion extensions of the real data presented in section 3. Table5 depicts the average area extension normalized to the MBB-approximation which is set to 100%. Table 5 shows that on the average the area extension of the 5-corner and of the minimum bounding ellipse is about 22% higher than the area extension of the MBB.... In PAGE 8: ... Table 5 depicts the average area extension normalized to the MBB-approximation which is set to 100%. Table5 shows that on the average the area extension of the 5-corner and of the minimum bounding ellipse is about 22% higher than the area extension of the MBB. The area extensions of the 4-corner, of the RMBB and of the circle are 42% to 51% higher than the area extension of the MBB.... ..."

Cited by 55

### Table 1: The extension K=k

"... In PAGE 46: ...2.1 The Extension K=k The data concerning the extension K=k are summarised in Table1 . First, we list the ground eld k, the integral ideal f and the conductor f(K=k) dividing f of the extension K=k.... ..."