نتایج جستجو برای: class hierarchy

تعداد نتایج: 445210  

1989
P. MADANY V. RUSSO D. LEYENS

This paper describes the object-oriented design and implementation of a family of stream-oriented le systems under UNIX and under an object-oriented operating system called Choices. A class hierarchy provides an object-oriented taxonomy of the algorithms and data structures used in the design of this family. The family includes the System V le system, the 4.2 BSD le system, and the MS-DOS le sy...

1993
Stephen A. Fenner Steven Homer Mitsunori Ogihara Alan L. Selman

This paper focuses on complexity classes of partial functions that are computed in polynomial time with oracles in NPMV, the class of all multivalued partial functions that are computable nondeterministically in polynomial time. Concerning deterministic polynomial-time reducibilities, it is shown that 1. A multivalued partial function is polynomial-time computable with k adaptive queries to NPM...

2012
Christophe Foket Bjorn De Sutter Bart Coppens Koen De Bosschere

This paper presents class hierarchy flattening, a novel obfuscation technique for programs written in object-oriented, managed programming languages. Class hierarchy flattening strives for maximally removing the inheritance relations from object-oriented programs, thus hiding the overall design of the program from reverse engineers and other attackers. We evaluate the potential of class hierarc...

Journal: :SIAM J. Comput. 1997
Stephen A. Fenner Steven Homer Mitsunori Ogihara Alan L. Selman

This paper focuses on complexity classes of partial functions that are computed in polynomial time with oracles in NPMV, the class of all multivalued partial functions that are computable nondeterministically in polynomial time. Concerning deterministic polynomial-time reducibilities, it is shown that 1. a multivalued partial function is polynomial-time computable with k adaptive queries to NPM...

2002
Liping Zhao James O. Coplien

The class concept is central in OO programming (OOP) to implement abstract data types and enforce encapsulation. Type hierarchy has been regarded as a useful technique for consistency during extension. Yet, the importance of class and type hierarchy extends beyond their technical merits. Specifically, a class classifies objects and a type hierarchy classifies classes. Classification is fundamen...

Journal: :Nord. J. Comput. 1999
Min-Shiang Hwang

In this paper, we propose a new dynamic cryptographic key generation scheme for access control in a hierarchy. Our method can achieve the following three goals. First, the storage space needed to store public information is smaller than that required in the previous work. Second, when a security class is added to the hierarchy, we assign a secret key and a public derivation key to the security ...

1995
David E. Breen Mark A. Linton Paul R. Calder

Modeling and animating three-dimensional scenes involves inherent difficulties both in the specification of scenes and in the implementation of computer animation systems. We present an objectoriented methodology for the integrated modeling of geometry, time, and behavior. Models are defined by two directed acyclic graphs and a set of constraints: the geometry graph is used to specify hierarchi...

1989
Peter Madany Roy H. Campbell Vincent F. Russo Douglas E. Leyens

This paper describes the object-oriented design and implementation of a family of stream-oriented le systems under UNIX and under an object-oriented operating system called Choices . A class hierarchy provides an object-oriented taxonomy of the algorithms and data structures used in the design of this family. The family includes the System V le system, the 4.2 BSD le system, and the MS-DOS le s...

1999
O. Lechtenfeld A. Sorin

A wide class of N=2 reductions of the supersymmetric KP hierarchy in N=1 superspace is described. This class includes a new N=2 supersymmetric generalization of the Toda chain hierarchy. The Lax pair representations of the bosonic and fermionic flows, local and nonlocal Hamiltonians, finite and infinite discrete symmetries, first two Hamiltonian structures and the recursion operator of this hie...

1998
Yoon Kyu Jang Heung Seok Chae Yong Rae Kwon Doo-Hwan Bae

Modified programs are required to be retested to determine whether changes have been made correctly and to investigate whether those cause any adverse effect on the program behavior. Then, the key issue is the extent of the retesting tasks. To save time and efforts, retesting should be done on only the parts that might be affected by changes. Change impact analysis is the activity which identif...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید