Multispectral data compression using bidirectional interbandprediction

The introduction of high spatial and spectral resolution sensors on-board remote-sensing spacecraft has increased, by orders of magnitude, the data rates which need to be sustained on the down-link or cross-link transmission channels. Since these channels are severely limited in capacity, the need arises to perform on-board compression to reduce the volume of data which would need to be down-linked. This paper discusses the development and refinement of a low complexity lossy spectral/spatial compression method which provides high compression ratios at low levels of distortion. The developed techniques uses pixels in adjacent bands to predict the intensity of pixels in the band being compressed via a simple linear prediction model. This prediction method when combined with a low-distortion discrete cosine transform (DCT) block coding method yields performance comparable to block-adaptive Karhunen-Loeve Transform (KLT)-DCT methods without incurring the complexity penalty of the KLT. The methods' performance suffers under misregistration. A fractional-pixel interpolation enhancement to the basic technique significantly improves the performance in the case of misregistered bands     

Mean residence time of gas in mechanically agitated gas–liquid contactors

In the present study of gas–liquid contactors, mean residence/contact time was calculated from knowledge of superficial velocity and the gas phase hold-up, for various gas rates and impeller geometry and speeds, and compared with values obtained from RTD measurements. A new correlation, involving Flow Number, Froude Number, system geometry and the physical properties, is proposed. This uses the authors data and those available in literature.     

An integrated approach to the optimum utilization of national tungsten resources: Technology gaps

A critical review of the current status of tungsten resources, of state-of-the-art processing technology and of product development in India vis-a-vis the world scenario is presented. An attempt has been made to identify technology gap areas requiring attention.     

Proving termination of GHC programs

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.     

EVA基质PTC特性材料制备与导电机理分析

本文简述了以EVA为基质材料制备有机PTC特性材料的实验,实测了样品有关特性,并用非线性回归方法讨论了其导电机理.这对指导温度传感器的设计有一定帮助.     

几种数据压缩算法的比较

对几种数据压缩算法进行了总结,并针对实验数据表对其压缩率进行了比较。     

Integration framework for intelligent manufacturing processes

In this article, we describe a new approach to applying distributed artificial intelligence techniques to manufacturing processes. The construction of intelligent systems is one of the most important techniques among artificial intelligence research. Our goal is to develop an integrated intelligent system for real time manufacturing processes. An integrated intelligent system is a large knowledge integration environment that consists of several symbolic reasoning systems (expert systems) and numerical computation packages. These software programs are controlled by a meta-system which manages the selection, operation and communication of these programs. A meta-system can be implemented in different language environments and applied to many disciplines. This new architecture can serve as a universal configuration to develop high performance intelligent systems for many complicated industrial applications in real world domains.To whom all correspondence should be addressed.     

Axial vibrations of U-shaped bellows with elastically restrained end conditions

Previous work by Li et al. in the area of axial vibrations of bellows dealt with fixed end conditions. However, it is seen on several occasions that bellow ends are welded to a small pipe spool that has a lumped mass such as a valve or an instrument. Hence, the present paper aims at finding out the effect of elastically restrained ends on the axial natural frequencies. The analysis considers finite stiffness axial restraints on the bellows, i.e. solving the set of equations with non-homogeneous boundary conditions. Two bellow specimens are considered for comparison having the same dimensions as taken by Li in his analysis. The transcendental frequency equation deduced is accurate as the first, second and third mode frequencies computed are in close agreement to the ones obtained by Li.     

Prediction of the maximum spoutable height in spout-fluid beds

The development of the semi-theoretical correlation in Hadzisdmajlovic et al. (1983) for predicting the maximum spoutable height in a spout-fluid bed, is observed to involve certain discrepancies. Based on their experimental data, a new correlation is proposed.     

Parametric modeling of somatosensory evoked potentials

In this paper, we examine methods of characterizing somatosensory evoked potentials (SEP's) in both the time and frequency domains. We have found that the truncated impulse response (TIR) method produced an accurate time domain model of the SEP signals at model orders greatly reduced from the original state space matrix. The TIR method was valuable for smoothing signals that were slightly corrupted by noise. In this case, the simulated data sequence was close to the original data sequence in the mean squared error sense. For signals that were greatly corrupted by noise, the TIR method was not able to perform as well. Therefore, the TIR method was not a feature extraction method but was valuable for data simulation. In the frequency domain, we have used the autoregressive moving average model (ARMA) to parameterize the SEP signal. An overdetermined set of Yule-Walker equations was created to determine the autoregressive (AR) parameters of the original data with the model order established by the singular value decomposition. From these AR parameters, a residual time series was generated which was used to find the moving average parameters. The resulting ARMA model was used to produce a simulated data sequence. The frequency domain characteristics of the simulated sequence and the corresponding power spectral density of the ARMA filter were very close to the periodogram of the original data sequence. Accurate parameterization was achieved for the SEP waveforms at low filter lengths.