"... In PAGE 4: ... And the table MCS_LOGICAL_FILE can store the metadata for all kinds of objects instead of just for data files. Thus RegistryObject is equal to MCS_LOGICAL_FILE semantically: lt;owl:Class rdf:ID= quot;MCS_LOGICAL_FILE quot; gt; lt;owl:equivalentClass rdf:resource= quot;RegistryObject quot;/ gt; lt;/owl:Class gt; Table3 . Mapping OGCRIM RegistryObject elements to MCS elements.... ..."

"... In PAGE 6: ... 3.3 Trace Description Table3 summarizes the characteristics of the various traces that are used in this paper. Because of the large num- ber of production workloads, we often also present the arith- metic mean of their results.... ..."

"... In PAGE 6: ... 3.3 Trace Description Table3 summarizes the characteristics of the various traces that are used in this paper. Because of the large num- ber of production workloads, we often also present the arith- metic mean of their results.... ..."

"... In PAGE 2: ... It is also possible, however, to view the program to be evaluated as data, which are transformed by certain operations according to a particular inference mechanism, and apply some of these operations in parallel to the whole, or parts of the original program. Table1 shows an overview of the categories of parallelism, arranged according to the granularity and the components of a logic program. It identi es the particular data structures and operations applied in a category.... In PAGE 2: ... It identi es the particular data structures and operations applied in a category. The notation used in Table1 is based on viewing a logic program as a collection of clauses, possibly organized into modules (or objects). The clauses consist of literals, arranged as head and tail.... ..."

"... In PAGE 1: ..., the logical constants provided by the language, primitive concepts and roles introduced by the user, and named de ned concepts and roles. Table1 shows some top level primitive concepts roles for building a data base containing descriptions... ..."

"... In PAGE 11: ... Both can be combined into F-molecules. Hence, the example ontology shown in Table1 consists of F-molecules containing only signature-F-atoms as schema for the corresponding objects. Please note that the property HD Interface of class Mainboard is a multi-valued method indicated by = gt; gt; instead of = gt; for single valued methods.... In PAGE 12: ...g. PDF-files containing experiences about resolving problems with computer hardware, is now established by a meta-data characterization that somehow conforms to the ontology in Table1 . Such a characterization does not require an expressive underlying formalism but must allow identifying the concepts and associated entities of the ontology in a unique and unambiguous way.... ..."

"... In PAGE 2: ... There is not a hierarchical structure, so all classes can be accessed individually by the client code (Fig. 1; Table2 ). Some naming conventions have been adopted to designate the elements of the program.... ..."

"... In PAGE 9: ... After enough effort, we were able to find a good ordering that allows symbolic simulation to run. Table2 shows the results. In this sequence of experiments, we were able to complete the assertion check without using any constant logic values to simplify the assertion.... In PAGE 9: ... In this sequence of experiments, we were able to complete the assertion check without using any constant logic values to simplify the assertion. By comparing the results in Table 1 and in Table2 , we observe that variable ordering sig- nificantly impacts the performance of symbolic simulation. For the OBDD sizes, we show two types of data: the total number of OBDD nodes at the end of symbolic simulation (to- tal OBDD nodes), and the maximum number of OBDD nodes during the symbolic simulation (max OBDD nodes).... ..."

"... In PAGE 2: ... The notions of dynamic binding and polymorphism are intertwined and have been seen rst in languages that were neither object based or object-oriented such as CLU and Lisp. Table1 provides a comparative analysis of the procedu- ral and the object-oriented approaches from a pedagogic perspective. It is clear from Table 1 that the object- oriented approach is stronger in its support of key soft- ware engineering concepts such as localization of details, separation of logic and data structures from control, and direct representation of the problem domain in terms of entities and relationships.... In PAGE 2: ... Table 1 provides a comparative analysis of the procedu- ral and the object-oriented approaches from a pedagogic perspective. It is clear from Table1 that the object- oriented approach is stronger in its support of key soft- ware engineering concepts such as localization of details, separation of logic and data structures from control, and direct representation of the problem domain in terms of entities and relationships. The ACM/IEEE Computing Curricula apos;91 report fo- cuses on nine concepts that are recurrent through all areas of computer science.... ..."