Results 1 
4 of
4
A Customisable Memory Management Framework
, 1994
"... Memory management is a critical issue for many large objectoriented applications, but in C++ only explicit memory reclamation through the delete operator is generally available. We analyse different possibilities for memory management in C++ and present a dynamic memory management framework which c ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
Memory management is a critical issue for many large objectoriented applications, but in C++ only explicit memory reclamation through the delete operator is generally available. We analyse different possibilities for memory management in C++ and present a dynamic memory management framework which can be customised to the need of specific applications. The framework allows full integration and coexistence of different memory management techniques. The Customisable Memory Management (CMM) is based on a primary collector which exploits an evolution of Bartlett's mostly copying garbage collector. Specialised collectors can be built for separate memory heaps. A Heap class encapsulates the allocation strategy for each heap. We show how to emulate different garbage collection styles or userspecific memory management techniques. The CMM is implemented in C++ without any special support in the language or the compiler. The techniques used in the CMM are general enough to be applicable also to...
Minimal Simplicial Dissections and Triangulations of Convex 3Polytopes
 DISCRETE COMPUT. GEOM
, 2000
"... This paper addresses three questions related to minimal triangulations of a threedimensional convex polytope P . . Can the minimal number of tetrahedra in a triangulation be decreased if one allows the use of interior points of P as vertices? . Can a dissection of P use fewer tetrahedra than ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
This paper addresses three questions related to minimal triangulations of a threedimensional convex polytope P . . Can the minimal number of tetrahedra in a triangulation be decreased if one allows the use of interior points of P as vertices? . Can a dissection of P use fewer tetrahedra than a triangulation? . Does the size of a minimal triangulation depend on the geometric realization of P? The main result of this paper is that all these questions have an affirmative answer. Even stronger, the gaps of size produced by allowing interior vertices or by using dissections may be linear in the number of points.
A Quantum Potential Description of OneDimensional TimeDependent Scattering From Square Barriers and Square Wells
, 1981
"... The timedependent scattering of onedimensional Gaussian wave packets of various energies incident on (1) a square potential barrier and (2) a square well is examined numerically, using the quantum potential introduced by Bohm. The timedependent quantum potential is calculated in each case, and th ..."
Abstract
 Add to MetaCart
The timedependent scattering of onedimensional Gaussian wave packets of various energies incident on (1) a square potential barrier and (2) a square well is examined numerically, using the quantum potential introduced by Bohm. The timedependent quantum potential is calculated in each case, and the results displayed on threedimensional computer plots. The particle trajectories from different initial positions within the wave packet are also shown, giving a detailed description of reflection and tunneling in terms of individual processes. The wider implications of this analysis are also briefly considered. 1.
More on Parametrization Relevant to Describe Violation of CP, T and CPT Symmetries in the K 0K 0 System
, 1999
"... To study violation of CP, T and/or CPT symmetries in the K 0K 0 systems, one has to parametrize the relevant mixing parameters and decay amplitudes in such a way that each parameter represents violation of these symmetries in a welldefined way. Parametrization is of course not unique and is always ..."
Abstract
 Add to MetaCart
To study violation of CP, T and/or CPT symmetries in the K 0K 0 systems, one has to parametrize the relevant mixing parameters and decay amplitudes in such a way that each parameter represents violation of these symmetries in a welldefined way. Parametrization is of course not unique and is always subject to phase ambiguities. We discuss these problems with freedom associated with rephasing of final (or intermediate) as well as initial states taken into account. We present a fully rephasinginvariant parametrization and a particular rephasingdependent parametrization, and give a couple of comments related to these and other possible parametrizations.