Algorithm for cosine transform of Toeplitz matrices

An algorithm for calculating the 2D cosine transform of a Toeplitz matrix is presented. The algorithm is based on the application of 1D cosine transforms. More specifically, four 1D cosine transforms of size N are needed to obtain the transform of a Toeplitz matrix of size N×N. This is an improvement over previously published algorithms. The algorithm is also simple and regular     

Study of Desorption and Adsorption During Grain Aeration

One requirement in designing and operating and operating system is to minimize the moisture change in stored grain. Moisture transfer during the aeration process is generally believed to be caused by the partial pressure difference between water in grain and water in air (P₃-P₄). A mathematical model was developed for rough rice, which predicts the partial pressure difference under various grain and ambient conditions. Observations of moisture change over 10 aeration tests confirmed the good correlation between sorption phenomena and partial pressure differences. Studies indicated that air relative humidity, air temperature, grain temperature and grain moisture are significant factors influencing the partial pressure differences and, thus, affecting     

Analysis of thin walled structures using the boundary element method

In this article the direct boundary element formulations of stretching and bending plate problems are combined together to solve thin walled structures and other similar frames. The final system is obtained by assuming each individual plane structural element as a subregion. After the necessary transforms of these equations they can be combined together taking into account the displacement compatibility and equilibrium conditions.     

Cost Effective VLSI Architectures for Full-Search Block-Matching Motion Estimation Algorithm

In this paper, we present efficient VLSI architectures for full-search block-matching motion estimation (BMME) algorithm. Given a search range, we partition it into sub-search arrays called tiles. By fully exploiting data dependency within a tile, efficient VLSI architectures can be obtained. Using the proposed VLSI architectures, all the block-matchings in a tile can be processed in parallel. All the tiles within a search range can be processed serially or concurrently depending on various requirements. With the consideration of processing speed, hardware cost, and I/O bandwidth, the optimal tile size for a specific video application is analyzed. By partitioning a search range into tiles with appropriate size, flexible VLSI designs with different throughput can be obtained. In this way, cost effective VLSI designs for a wide range of video applications, from H.261 to HDTV, can be achieved.     

A novel electrochemical process for the production of ammonium perchlorate

Perchloric acid, HCLO₄, and ammonium perchlorate, NH₄ClO₄, of high purity have been produced by electrolysis of chloric acid and subsequent reaction with high purity ammonium hydroxide to produce ammonium perchlorate. The process involves no alkali metals, chlorides or transition metals such as chromates, and thus produces propellant and explosive grade ammonium perchlorate of high purity and with no associated instability or pollution problems. The products can be recovered by solution crystallization-drying or direct spray-drying, respectively.     

Postoperative analgesia. Simple methods for improvements exist

An improved, combined staining method for myofibrillar ATPase (m-ATPase) and for acetylcholinesterase activity is described. This method allows the observations, on the same slide, of the classical histochemical m-ATPase profile following the Brooke and Kaiser technique and the neuromuscular junction morphology. Thus the pattern of innervation, nerve ending structure and number of nerve endings along the fibres is shown simultaneously for the basic differentiation between slow and fast fibres. The use of acidic and alkaline preincubation allows better visualization of endplate morphology and avoids the masking effect of a positive m-ATPase reaction. The technique has been validated on skeletal muscles from avian and mammalian species.     

Measurement and prediction of pressure drop in two-phase flow

Experimental data for air–water two-phase co-current flow in two different pipe diameters were used to test the prediction of pressure drop by a number of existing theories and correlations. Several models are shown to be useful for prediction, particularly with the stratified regimes which have proved difficult to handle in the past. The model suggested by Olujic proved to be of particular value.     

The effect of bandwidth allocation policies on delay inunidirectional bus networks

We consider the problem of allocating bandwidth fairly to each node in a shared, unidirectional bus network. We focus on the p_i persistent protocol, since these are open loop policies designed to operate well in high speed networks, which have a very large bandwidth-delay product and feedback in the upstream direction is not available in a timely manner. First, we introduce an improvement to the basic p_i persistent protocol, in which we replace random coin tosses with a deterministic counting algorithm, and thereby reduce the delays for all nodes for any given choice of {p_i}. We then describe an exact method for calculating average packet delays and queue lengths in both the p_i persistent and our new deterministic n out of m protocols, based on the regenerative approach of Georgiades et al. (1987). These delay results, together with simulation measurements, show that both of these protocols still waste some bandwidth. After presenting a lower bounding argument to show that some wasted bandwidth is inevitable in all such distributed access control schemes, assuming a passive bus without feedback in the upstream direction, we show that changing the bus to unidirectional point-to-point links between (very simple) active interfaces at each node allows us to construct distributed access schemes that require no upstream feedback and are both work conserving and fair. To illustrate how this can be done, we introduce the p_i preemptive protocol, in which each node randomly inserts its own packets into the traffic arriving from upstream. We derive a simple and effective heuristic for calculating the preemption probability for each node, and use simulation to show how well it equalizes the delays at each node