Immunochemical approach to the mapping of an assembled epitope of human chorionic gonadotropin: Proximity of CTP-alpha to the receptor binding region of the beta-subunit

A single-step solid-phase RIA (SS-SPRIA) developed in our laboratory using hybridoma culture supernatants has been utilised for the quantitation of epitope-paratope interactions. Using SS-SPRIA as a quantitative tool for the assessment of epitope stability, it was found that several assembled epitopes of human chorionic gonadotropin (hCG) are differentially stable to proteolysis and chemical modification. Based on these observations an approach has been developed for identifying the amino acid residues constituting an epitopic region. This approach has now been used to map an assembled epitope at/near the receptor binding region of the hormone. The mapped site forms a part of the seat belt region and the cystine knot region (C34-C38-C88-C90-H106). The carboxy terminal region of the alpha-subunit forms a part of the epitope indicating its proximity to the receptor binding region. These results are in agreement with the reported receptor binding region identified through other approaches and the X-ray crystal structure of hCG.

Growing length and time scales in glass-forming liquids

The glass transition, whereby liquids transform into amorphous solids at low temperatures, is a subject of intense research despite decades of investigation. Explaining the enormous increase in relaxation times of a liquid upon supercooling is essential for understanding the glass transition. Although many theories, such as the Adam-Gibbs theory, have sought to relate growing relaxation times to length scales associated with spatial correlations in liquid structure or motion of molecules, the role of length scales in glassy dynamics is not well established. Recent studies of spatially correlated rearrangements of molecules leading to structural relaxation, termed ``spatially heterogeneous dynamics,'' provide fresh impetus in this direction. A powerful approach to extract length scales in critical phenomena is finite-size scaling, wherein a system is studied for sizes traversing the length scales of interest. We perform finite-size scaling for a realistic glass-former, using computer simulations, to evaluate the length scale associated with spatially heterogeneous dynamics, which grows as temperature decreases. However, relaxation times that also grow with decreasing temperature do not exhibit standard finite-size scaling with this length. We show that relaxation times are instead determined, for all studied system sizes and temperatures, by configurational entropy, in accordance with the Adam-Gibbs relation, but in disagreement with theoretical expectations based on spin-glass models that configurational entropy is not relevant at temperatures substantially above the critical temperature of mode-coupling theory. Our results provide new insights into the dynamics of glass-forming liquids and pose serious challenges to existing theoretical descriptions.

Implicit and multigrid procedures for steady-state computations with upwind algorithms

A computational study for the convergence acceleration of Euler and Navier-Stokes computations with upwind schemes has been conducted in a unified framework. It involves the flux-vector splitting algorithms due to Steger-Warming and Van Leer, the flux-difference splitting algorithms due to Roe and Osher and the hybrid algorithms, AUSM (Advection Upstream Splitting Method) and HUS (Hybrid Upwind Splitting). Implicit time integration with line Gauss-Seidel relaxation and multigrid are among the procedures which have been systematically investigated on an individual as well as cumulative basis. The upwind schemes have been tested in various implicit-explicit operator combinations such that the optimal among them can be determined based on extensive computations for two-dimensional flows in subsonic, transonic, supersonic and hypersonic flow regimes. In this study, the performance of these implicit time-integration procedures has been systematically compared with those corresponding to a multigrid accelerated explicit Runge-Kutta method. It has been demonstrated that a multigrid method employed in conjunction with an implicit time-integration scheme yields distinctly superior convergence as compared to those associated with either of the acceleration procedures provided that effective smoothers, which have been identified in this investigation, are prescribed in the implicit operator.

Crop Classification using Biologically-inspired Techniques with High Resolution Satellite Image

Remote sensing provides a lucid and effective means for crop coverage identification. Crop coverage identification is a very important technique, as it provides vital information on the type and extent of crop cultivated in a particular area. This information has immense potential in the planning for further cultivation activities and for optimal usage of the available fertile land. As the frontiers of space technology advance, the knowledge derived from the satellite data has also grown in sophistication. Further, image classification forms the core of the solution to the crop coverage identification problem. No single classifier can prove to satisfactorily classify all the basic crop cover mapping problems of a cultivated region. We present in this paper the experimental results of multiple classification techniques for the problem of crop cover mapping of a cultivated region. A detailed comparison of the algorithms inspired by social behaviour of insects and conventional statistical method for crop classification is presented in this paper. These include the Maximum Likelihood Classifier (MLC), Particle Swarm Optimisation (PSO) and Ant Colony Optimisation (ACO) techniques. The high resolution satellite image has been used for the experiments.

Practical Algorithms For Mean Velocity Estimation In Pulse Doppler Weather Radars Using A Small Number Of Samples

Doppler weather radars with fast scanning rates must estimate spectral moments based on a small number of echo samples. This paper concerns the estimation of mean Doppler velocity in a coherent radar using a short complex time series. Specific results are presented based on 16 samples. A wide range of signal-to-noise ratios are considered, and attention is given to ease of implementation. It is shown that FFT estimators fare poorly in low SNR and/or high spectrum-width situations. Several variants of a vector pulse-pair processor are postulated and an algorithm is developed for the resolution of phase angle ambiguity. This processor is found to be better than conventional processors at very low SNR values. A feasible approximation to the maximum entropy estimator is derived as well as a technique utilizing the maximization of the periodogram. It is found that a vector pulse-pair processor operating with four lags for clear air observation and a single lag (pulse-pair mode) for storm observation may be a good way to estimate Doppler velocities over the entire gamut of weather phenomena.

He II spectra of La, Ce and Yb: Novel features in the valence band region

He II photoelectron spectra of La, Ce and Yb show features which cannot be explained in terms of single electron excitations. It is proposed that these are due to formation of electron-hole paris.

Ant Colony Optimization Algorithms for Shortest Path Problems

We propose four variants of recently proposed multi-timescale algorithm in [1] for ant colony optimization and study their application on a multi-stage shortest path problem. We study the performance of the various algorithms in this framework. We observe, that one of the variants consistently outperforms the algorithm [1].

Improved Algorithms for Reservoir Capacity Calculation Incorporating Storage-Dependent Losses and Reliability Norm

Two algorithms that improve upon the sequent-peak procedure for reservoir capacity calculation are presented. The first incorporates storage-dependent losses (like evaporation losses) exactly as the standard linear programming formulation does. The second extends the first so as to enable designing with less than maximum reliability even when allowable shortfall in any failure year is also specified. Together, the algorithms provide a more accurate, flexible and yet fast method of calculating the storage capacity requirement in preliminary screening and optimization models.

On the direct parallel solution of systems of linear equations: New algorithms and systolic structures

The paper presents two new algorithms for the direct parallel solution of systems of linear equations. The algorithms employ a novel recursive doubling technique to obtain solutions to an nth-order system in n steps with no more than 2n(n −1) processors. Comparing their performance with the Gaussian elimination algorithm (GE), we show that they are almost 100% faster than the latter. This speedup is achieved by dispensing with all the computation involved in the back-substitution phase of GE. It is also shown that the new algorithms exhibit error characteristics which are superior to GE. An n(n + 1) systolic array structure is proposed for the implementation of the new algorithms. We show that complete solutions can be obtained, through these single-phase solution methods, in 5n−log2n−4 computational steps, without the need for intermediate I/O operations.

A study of placement algorithms through trial interchange of logic modules

Based on trial interchanges, this paper develops three algorithms for the solution of the placement problem of logic modules in a circuit. A significant decrease in the computation time of such placement algorithms can be achieved by restricting the trial interchanges to only a subset of all the modules in a circuit. The three algorithms are simulated on a DEC 1090 system in Pascal and the performance of these algorithms in terms of total wirelength and computation time is compared with the results obtained by Steinberg, for the 34-module backboard wiring problem. Performance analysis of the first two algorithms reveals that algorithms based on pairwise trial interchanges (2 interchanges) achieve a desired placement faster than the algorithms based on trial N interchanges. The first two algorithms do not perform better than Steinberg's algorithm1, whereas the third algorithm based on trial pairwise interchange among unconnected pairs of modules (UPM) and connected pairs of modules (CPM) performs better than Steinberg's algorithm, both in terms of total wirelength (TWL) and computation time.

SHAMP: An experimental shared memory multimicroprocessor system for performance evaluation of parallel algorithms

In this paper, the design and implementation of a single shared bus, shared memory multiprocessing system using Intel's single board computers is presented. The hardware configuration and the operating system developed to execute the parallel algorithms are discussed. The performance evaluation studies carried out on Image are outlined.

Efficient algorithms for computing Reeb graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(nlogn+nlogg(loglogg)3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. We extend this algorithm to construct Reeb graphs of d-manifolds in O(nlogn(loglogn)3) time, where n is the number of triangles in the simplicial complex that represents the d-manifold. Our result is a significant improvement over the previously known O(n2) algorithm. Finally, we present experimental results of our implementation and demonstrate that our algorithm for 3-manifolds performs efficiently in practice.

Simplified algorithms based on Haar transforms for signal recognition in protective relays

This letter presents the development of simplified algorithms based on Haar functions for signal extraction in relaying signals. These algorithms, being computationally simple, are better suited for microprocessor-based power system protection relaying. They provide accurate estimates of the signal amplitude and phase.

Sensible heat fluxes during the active and break phases of the southwest monsoon over the Indian region

Based on the theory given by Saltzman and Ashe (1976), sensible heat fluxes are calculated for the active and break phases of the southwest monsoon over the Indian region. The conclusion drawn is that the sensible heat flux is generally larger during the break monsoon situation when compared with that for the active monsoon situation. The synoptic heat flux is negligible when compared with mean and diurnal heat fluxes over the Indian region even during the monsoon season.

Using tau polarization to probe the stau co-annihilation region of the minimal supergravity model at the LHC

The minimal supergravity model predicts the polarization of the tau coming from the stau to bino decay in the co-annihilation region to +1. This can be exploited to extract this soft tau signal at LHC and also to measure the tiny mass differences between the stau and the bi lightest superparticle. Moreover, this strategy will be applicable for a wider class of bino lightest superparticle models, where the lighter stau has a right component at least of similar size as the left.