The effects of pressure on the isothermal fluid behavior of bituminous coals

An investigation into the effects of pressure (helium gas) on the isothermal fluid behavior includes: (1) the effect of pressure on the rate of melting and coking as evidenced by the rate constants k(melt) and k(coke); (2) the effect of pressure on the energies of activation of melting and coking; (3) the effects of pressure on the characteristic times; (4) the effects of pressure on the maximum isothermal fluidity. Results from the effects of pressure on k(melt) revealed that it was generally the high total sulfur, low nitrogen, low reactives/mineral matter ratio, medium rank coals which show the greatest increase in k(melt), whereas the highest rank coals show the least decrease in k(coke). The energies of activation of melting and coking were not significantly affected by pressure. The investigation also reveals increases or decreases in the respective times of softening, maximum fluidity, resolidification and total time of fluid behavior under isothermal pressurized conditions. There appears the possibility that these shifts may be rank dependent. Additionally, the lower rank coals show the largest relative increase in their fluidities when subjected to pressure. Empirical relationships were derived in order to quantitatively predict the maximum isothermal fluidity for most (fluid) coals at a given pressure.     

Constant stretching rate experiments on low density polyethylene

A simple apparatus for elongational test of molten polymers is presented. Its realiability is demonstrated by means of stress growth in constant stretching rate experiments and relaxation test on a low density polyethylene sample.     

An accurate block-trimming device for ultramicrotomy of selected cells

A small instrument is described which is operated on the stage of a light microscope to trim resin-embedded specimens to precise levels for subsequent ultramicrotomy and to cut thin pilot sections for light microscopy. The operating procedure and examples of results are given.     

A Lie group approach to a neural system for three-dimensionalinterpretation of visual motion

A novel approach is presented to neural network computation of three-dimensional rigid motion from noisy two-dimensional image flow. It is shown that the process of 3-D interpretation of image flow can be viewed as a linear signal transform. The elementary signals of this linear transform are the 2-D vector fields of the six infinitesimal generators of the 3-D Euclidean group. This transform can be performed by a neural network. Results are also reported of neural network simulations for the 3-D interpretation of image flow and a comparison of the performance of this approach with that using conventional methods. Computer simulation results verify the Lie-group-based neural network approach to three-dimensional motion perception.     

A real-time neural system for color constancy

A neural network approach to the problem of color constancy is presented. Various algorithms based on Land's retinex theory are discussed with respect to neurobiological parallels, computational efficiency, and suitability for VLSI implementation. The efficiency of one algorithm is improved by the application of resistive grids and is tested in computer simulations; the simulations make clear the strengths and weaknesses of the algorithm. A novel extension to the algorithm is developed to address its weaknesses. An electronic system that is based on the original algorithm and that operates at video rates was built using subthreshold analog CMOS VLSI resistive grids. The system displays color constancy abilities and qualitatively mimics aspects of human color perception.     

Performance engineering and topological design of metro WDM opticalnetworks using computer simulation

This paper demonstrates the use of computer simulation for topological design and performance engineering of transparent wavelength-division multiplexing metropolitan-area networks. Engineering of these networks involves the study of various transport-layer impairments such as amplifier noise, component ripple, chirp/dispersion, optical crosstalk, waveform distortion due to filter concatenation, fiber nonlinearities, and polarization effects. A computer simulation methodology composed of three main simulation steps is derived and implemented. This methodology obtains performance estimations by applying efficient wavelength-domain simulations on the entire network topology, followed by time-/frequency-domain simulations on selected paths of the network and finally Q-budgeting on an identified worst case path. The above technique provides an efficient tool for topological design and network performance engineering. Accurate simulation models are presented for each of the performance impairments, and the computer simulation methodology is used for the design and engineering of a number of actual metro network architectures     

Multicast routing and bandwidth dimensioning in overlay networks

Multicast services can be provided either as a basic network service or as an application-layer service. Higher level multicast implementations often provide more sophisticated features and can provide multicast services at places where no network layer support is available. Overlay multicast networks offer an intermediate option, potentially combining the flexibility and advanced features of application layer multicast with the greater efficiency of network layer multicast. In this paper, we introduce the multicast routing problem specific to the overlay network environment and the related capacity assignment problem for overlay network planning. Our main contributions are the design of several routing algorithms that optimize the end-to-end delay and the interface bandwidth usage at the multicast service nodes within the overlay network. The interface bandwidth is typically a key resource for an overlay network provider, and needs to be carefully managed in order to maximize the number of users that can be served. Through simulations, we evaluate the performance of these algorithms under various traffic conditions and on various network topologies. The results show that our approach is cost-effective and robust under traffic variations.