Adaptive cell division for ray tracing

In ray tracing the two most commonly used data structures are the octree and uniform cell division. The octree structure allows efficient adaptive subdivision of space, while taking care of the spatial coherence of the objects in it; however, the tree structure locating the next node in the path of a ray is complex and time consuming. The cell structure, on the other hand, can be stored in a three-dimensional array, and each cell can be efficiently accessed by specifying three indices. However, such a uniform cell division does not take care of object coherence. The proposed data structure combines the positive features of the above data structures while minimising their disadvantages. The entire object space is implicitly assumed to be a three-dimensional grid of cells. Initially, the entire object space is a single voxel which later undergoes “adaptive cell division.” But, unlike in the octree structure, where each voxel is divided exactly at the middle of each dimension, in adaptive cell division, each voxel is divided at the nearest cell boundary. The result is that each voxel contains an integral number of cells along each axis. Corresponding to the implicit cell division we maintain a three-dimensional array, with each array element containing the voxel number which is used to index into the voxel array. The voxel array is used to store information about the structure of each voxel, in particular, the objects in each voxel. While a ray moves from one voxel to another we always keep track of the cell through which the ray is currently passing. Since only arrays are involved in accessing the next voxel in the path of the ray, the operation is very efficient.     

A STUDY OF THE PRIMARY PHASE OF FOOD FREEZE-DRYING IN VACUO

In the development of a novel freeze-drying technique in a fluidized bed at atmospheric pressure, a parallel study was undertaken using a conventional vacuum equipment. Two kinetically distinct phases were observed during freeze drying of representative Pood samples:

(1) a period during which the rate of drying was constant and (2) a second period during which the drying rate sufferedcontinual reduction. This paper focused attention on the primary drying period which corresponded with the kinetics of sublimation of pure     

Intramolecular crosslinking of poly(vinyl alcohol)

Poly(vinyl alcohol) is crosslinked in dilute solution (c=0.1 wt%) with glutaraldehyde. The reaction product is characterized by viscometry and gel permeation chromatography (g.p.c.). The intrinsic viscosity decreases with increasing degree of crosslinking and does not depend on temperature. G.p.c. reveals that the reaction product is not homogeneous, but consists of a mixture of particles with different sizes, possibly both intra- and intermolecularly crosslinked molecules. The intramolecularly crosslinked molecules are smaller in size than the initial polymer molecules and their size depends on the degree of crosslinking. They possess a narrow particle size distribution even if the initial polymer sample had a broad molecular weight distribution.     

Generalisations of Heyman's and Foulkes' theorems using dual formulation

Existing duality principles in structural optimisation are briefly reviewed and then they are extended to structures with segment-wise constant cross-sections. All theories are discussed in the particular context of optimal plastic beam design with symmetric convex specific cost functions and are confirmed by independent calculations on illustrative examples. It is shown that the optimal solution is always associated with a displacement field in which the mean absolute curvature value for each segment equals the subgradient of the specific cost function, with respect to the maximum absolute moment value for that segment. Moreover, the dual problem consists of the maximisation of the difference of two terms: the first one is the integral of the product of load and deflection (external work), and the second is the sum of products of segment lengths and the mean complementary cost values (taken with respect to the mean absolute curvature for that segment). Finally, some tentative proposals for a class of non-convex optimisation problems are presented. For special cases, the proposed general statements reduce to theorems by Heyman, Foulkes and Hemp.     

Laboratory accreditation in the UK

Two complementary national laboratory accreditation schemes are run by the National Physical Laboratory (NPL) to provide official recognition of competent British laboratories and an assurance of quality to their customers. The first of these, the British Calibration Service (BCS), was set up in 1966 to accredit laboratories to calibrate instruments, gauges and reference materials. In 1981 the National Testing Laboratory Accreditation Scheme (NATLAS) was formed to extend the service to all kinds of testing. Both BCS and NATLAS form an integral part of the UK national measurement system and were combined to form the National Measurement Accreditation Service on 1 October 1985.     

Combining multiple knowledge bases

Combining knowledge present in multiple knowledge base systems into a single knowledge base is discussed. A knowledge based system can be considered an extension of a deductive database in that it permits function symbols as part of the theory. Alternative knowledge bases that deal with the same subject matter are considered. The authors define the concept of combining knowledge present in a set of knowledge bases and present algorithms to maximally combine them so that the combination is consistent with respect to the integrity constraints associated with the knowledge bases. For this, the authors define the concept of maximality and prove that the algorithms presented combine the knowledge bases to generate a maximal theory. The authors also discuss the relationships between combining multiple knowledge bases and the view update problem     

Pulse-stream VLSI neural networks mixing analog and digitaltechniques

The pulse-stream technique, which represents neural states as sequences of pulses, is reviewed. Several general issues are raised, and generic methods appraised, for pulsed encoding, arithmetic, and intercommunication schemes. Two contrasting synapse designs are presented and compared. The first is based on a fully analog computational form in which the only digital component is the signaling mechanism itself-asynchronous, pulse-rate encoded digital voltage pulses. In this circuit, multiplication occurs in the voltage/current domain. The second design uses more conventional digital memory for weight storage, with synapse circuits based on pulse stretching. Integrated circuits implementing up to 15000 analog, fully programmable synaptic connections are described. A demonstrator project is described in which a small robot localization network is implemented using asynchronous, analog, pulse-stream devices.     

Finite-element grid improvement by minimization of stiffness matrix trace

A new and simple method of finite-element grid improvement is presented. The objective is to improve the accuracy of the analysis. The procedure is based on a minimization of the trace of the stiffness matrix. For a broad class of problems this minimization is seen to be equivalent to minimizing the potential energy. The method is illustrated with the classical tapered bar problem examined earlier by Prager and Masur. Identical results are obtained.