Oxford University Press. The oxford english dictionary. http://dictionary.oed. com/, January 2005. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Reification and Reflection in C++: An Operating.. - Madany, Islam.. (1992) (6 citations) (Correct)
....object oriented programs. The steps involved in reflection consist of: reification of an abstract object oriented concept, reflective computation using the reified attribute as data, and reflective update that modifies the objects through reflective computation. 1 The Oxford English Dictionary[9] defines reflection as the mode, operation, or faculty by which the mind has knowledge of itself and its operations, or by which it deals with ideas received from sensation and perception. 2 We define reification 2 as the representation of an attribute of an object oriented program such as ....
....of the Choices project[1] we have developed an object oriented operating system written in C . Reflection in Choices supports: ffl Storage concurrency and performance of memory allocation and deallocation. ffl Existence mechanisms for automating the deletion of objects. 2 Reification [9] is the mental conversion of a [person or] abstract concept into a thing. 3 ffl Persistence mechanisms for persistent object activation and deactivation. ffl Class the relationship between an object and its class. ffl Inheritance the relationship between classes in a class ....
Oxford University Press. Oxford English Dictionary. Oxford University Press, Walton Street, Oxford, UK, 1971.
Gibbs Fields with Multiple Pairwise Pixel Interactions for.. - Gimel'farb (1997) (Correct)
....vision and image processing are dealing with spatial image structures and image textures. Nonetheless, both these latter terms, as state, for instance, HARALICK and SHAPIRO [1992] are lacking formal and precise definitions. Informal human views can be found in most standard lexicons, say, OXFORD [1971], WEBSTER [1959, 1986] BARNHART and BARNHART [1990] etc. The structure (from a Latin structura which means to build, arrange ) is defined in a broad sense as a mutual relation of the elements of the whole object or a fabric or framework of putting them together. The texture (from a Latin ....
....part of the lattice wide interactions. For brevity, we refer below to them by the same terms cliques and clique families . 2. 1 Traditional Markov Gibbs models The Gibbs models were used first in statistical physics to describe the behavior of large systems of interacting particles (ISIHARA [1971]) Here, the interaction structures and strengths have obvious and constructive physical parallels. But, in the context of image textures it is necessary to define the exact meaning of these notions because the straightforward analogies with physical interactions between the particles, with ....
[Article contains additional citation context not shown here]
The Oxford English Dictionary (the Compact Edition). Vol. II (P-Z). Oxford Univ. Press (1971) 1165, 3274.
Managing Change in Information Systems: Technological Challenges - Sjøberg (Correct)
....3. 3 The Thesaurus Tool The Thesaurus tool was built by the author to support software maintenance at the implementation level (Sj berg et al. 1993, Sj berg et al. 1994a) The term thesaurus generally denotes a treasury or storehouse of knowledge, as a dictionary, encyclop dia, or the like (Oxford 1961). The term is not used in the more popular meaning denoting a dictionary of synonyms. In this context the knowledge is information about names and identifiers such as where they are defined and used, what kinds they are, in which contexts they occur, etc. The information captures all the ....
Oxford (1961). The Oxford English Dictionary. Oxford University Press, London.
An experimental study of SB-trees - Paolo Ferragina, Roberto Grossi (1996) (Correct)
....really good in practice. We now show a space efficient and alphabet independent implementation of blind tries based on Patricia trees [19] that requires a total of 8:25jS j Gamma 4:25 bytes b b b c b a = 01000000 b = 10000000 c = 11000000 a b c 1 26 a b a a a b a b 25 17 Z = 00011101 Pos = [ 1, 17, 25, 26 ] a a a b c b a b a b a b a Compress Uncompress St r = b b b c b a b c a b a a a b a b a a a b c b a b a b a b a Figure 5: The Patricia Tree corresponding to the blind trie in Figure 4. The bit array Z, the array of pos values, and the Str array of string pointers are shown. see ....
....we do not have an efficient suffix tree implementation in external memory and want to compare suffix trees to SB trees in a conservative way. We take Clark and Munro s [8] best experimental results on suffix trees in external memory as our basis. The authors choose the Oxford English Dictionary [26] (OED) as a text archive of size N 128 million indexed suffixes (actually its total size is half a gigabyte, but they only index word beginnings) They fix a page size of B = 8 kilobytes and find that the suffix tree height is 4 (the root is kept in main memory) This interesting result deserves ....
The Oxford English Dictionary , second edition, 1989.
Test Driving Reusable Components - Marshall (2005) (Correct)
No context found.
Oxford University Press. The oxford english dictionary. http://dictionary.oed. com/, January 2005.
Dynamic Conflict Detection in Policy-Based Management Systems - Dunlop, Indulska, Raymond (2002) (Correct)
No context found.
Oxford University Press, "Oxford English Dictionary", January, 2000.
Dynamic Policy Model for Large Evolving Enterprises - Dunlop, Indulska, Raymond (2001) (Correct)
No context found.
Oxford University Press, "Oxford English Dictionary ", January, 2000.
Methods for Conflict Resolution in Policy-Based Management.. - Nicole Dunlop Jadwiga (Correct)
No context found.
Oxford University Press, "Oxford English Dictionary", January, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC