Three-dimensional laminar compressible boundary layers with large injection

The effect of large mass injection on the following three-dimensional laminar compressible boundary-layer flows is investigated by employing the method of matched asymptotic expansions: (i) swirling flow in a laminar compressible boundary layer over an axisymmetric surface with variable cross-section and (ii) laminar compressible boundary-layer flow over a yawed infinite wing in a hypersonic flow. The resulting equations are solved numerically by combining the finite-difference technique with quasi-linearization. An increase in the swirl parameter, the yaw angle or the wall temperature is found to be capable of bringing the viscous layer nearer the surface and reducing the effects of massive blowing.

On the criteria for reverse transition in a two-dimensional boundary layer flow

Experiments on reverse transition were conducted in two-dimensional accelerated incompressible turbulent boundary layers. Mean velocity profiles, longitudinal velocity fluctuations $\tilde{u}^{\prime}(=(\overline{u^{\prime 2}})^{\frac{1}{2}})$ and the wall-shearing stress (TW) were measured. The mean velocity profiles show that the wall region adjusts itself to laminar conditions earlier than the outer region. During the reverse transition process, increases in the shape parameter (H) are accompanied by a decrease in the skin friction coefficient (Cf). Profiles of turbulent intensity (u’2) exhibit near similarity in the turbulence decay region. The breakdown of the law of the wall is characterized by the parameter \[ \Delta_p (=\nu[dP/dx]/\rho U^{*3}) = - 0.02, \] where U* is the friction velocity. Downstream of this region the decay of $\tilde{u}^{\prime}$ fluctuations occurred when the momentum thickness Reynolds number (R) decreased roughly below 400.

PocketAlign A Novel Algorithm for Aligning Binding Sites in Protein Structures

A fundamental task in bioinformatics involves a transfer of knowledge from one protein molecule onto another by way of recognizing similarities. Such similarities are obtained at different levels, that of sequence, whole fold, or important substructures. Comparison of binding sites is important to understand functional similarities among the proteins and also to understand drug cross-reactivities. Current methods in literature have their own merits and demerits, warranting exploration of newer concepts and algorithms, especially for large-scale comparisons and for obtaining accurate residue-wise mappings. Here, we report the development of a new algorithm, PocketAlign, for obtaining structural superpositions of binding sites. The software is available as a web-service at http://proline.physicslisc.emetin/pocketalign/. The algorithm encodes shape descriptors in the form of geometric perspectives, supplemented by chemical group classification. The shape descriptor considers several perspectives with each residue as the focus and captures relative distribution of residues around it in a given site. Residue-wise pairings are computed by comparing the set of perspectives of the first site with that of the second, followed by a greedy approach that incrementally combines residue pairings into a mapping. The mappings in different frames are then evaluated by different metrics encoding the extent of alignment of individual geometric perspectives. Different initial seed alignments are computed, each subsequently extended by detecting consequential atomic alignments in a three-dimensional grid, and the best 500 stored in a database. Alignments are then ranked, and the top scoring alignments reported, which are then streamed into Pymol for visualization and analyses. The method is validated for accuracy and sensitivity and benchmarked against existing methods. An advantage of PocketAlign, as compared to some of the existing tools available for binding site comparison in literature, is that it explores different schemes for identifying an alignment thus has a better potential to capture similarities in ligand recognition abilities. PocketAlign, by finding a detailed alignment of a pair of sites, provides insights as to why two sites are similar and which set of residues and atoms contribute to the similarity.

Dynamic subspace clustering for very large high-dimensional databases

Emerging high-dimensional data mining applications needs to find interesting clusters embeded in arbitrarily aligned subspaces of lower dimensionality. It is difficult to cluster high-dimensional data objects, when they are sparse and skewed. Updations are quite common in dynamic databases and they are usually processed in batch mode. In very large dynamic databases, it is necessary to perform incremental cluster analysis only to the updations. We present a incremental clustering algorithm for subspace clustering in very high dimensions, which handles both insertion and deletions of datapoints to the backend databases.

Three-dimensional double-diffusive convection and macrosegregation during non-equilibrium solidification of binary mixtures

A three-dimensional transient mathematical model (following a fixed-grid enthalpy-based continuum formulation) is used to study the interaction of double-diffusive natural convection and non-equilibrium solidification of a binary mixture in a cubic enclosure cooled from a side. Investigations are carried out for two separate test systems, one corresponding to a typical model "metal-alloy analogue" system and other corresponding to a real metal-alloy system. Due to stronger effects of solutal buoyancy in actual metal-alloy systems than in corresponding analogues, the convective transport mechanisms for the two cases are quite different. However, in both cases, similar elements of three-dimensionality are observed in the curvature and spacing of the projected streamlines. As a result of three-dimensional convective flow patterns, a significant solute macrosegregation is observed across the transverse sections of the cavity, which cannot be captured by two-dimensional simulations. (C) 2003 Elsevier Science Ltd. All rights reserved.

Understanding the building-up process of three dimensional open-framework metal phosphates: Acid degradation of the 3D structures to lower dimensional structures

Acid degradation of 3D zinc phosphates primarily yields a one-dimensional ladder compound, an observation that is significant considering that the latter forms 3D structures on heating in water.

Contrained linear spectral unmixing technique for regional land cover mapping using MODIS data

Over the last few decades, there has been a significant land cover (LC) change across the globe due to the increasing demand of the burgeoning population and urban sprawl. In order to take account of the change, there is a need for accurate and up- to-date LC maps. Mapping and monitoring of LC in India is being carried out at national level using multi-temporal IRS AWiFS data. Multispectral data such as IKONOS, Landsat- TM/ETM+, IRS-1C/D LISS-III/IV, AWiFS and SPOT-5, etc. have adequate spatial resolution (~ 1m to 56m) for LC mapping to generate 1:50,000 maps. However, for developing countries and those with large geographical extent, seasonal LC mapping is prohibitive with data from commercial sensors of limited spatial coverage. Superspectral data from the MODIS sensor are freely available, have better temporal (8 day composites) and spectral information. MODIS pixels typically contain a mixture of various LC types (due to coarse spatial resolution of 250, 500 and 1000 m), especially in more fragmented landscapes. In this context, linear spectral unmixing would be useful for mapping patchy land covers, such as those that characterise much of the Indian subcontinent. This work evaluates the existing unmixing technique for LC mapping using MODIS data, using end- members that are extracted through Pixel Purity Index (PPI), Scatter plot and N-dimensional visualisation. The abundance maps were generated for agriculture, built up, forest, plantations, waste land/others and water bodies. The assessment of the results using ground truth and a LISS-III classified map shows 86% overall accuracy, suggesting the potential for broad-scale applicability of the technique with superspectral data for natural resource planning and inventory applications.

Issues in Achievement of Haptic Realism

This paper deals with haptic realism related to Kinematic capabilities of the devices used in manipulation of virtual objects in virtual assembly environments and its effect on achieving haptic realism. Haptic realism implies realistic touch sensation. In virtual world all the operations are to be performed in the same way and with same level of accuracy as in the real world .In order to achieve realism there should be a complete mapping of real and virtual world dimensions. Experiments are conducted to know the kinematic capabilities of the device by comparing the dimensions of the object in the real and virtual world. Registered dimensions in the virtual world are found to be approximately 1.5 times that of the real world. Dimensional variations observed were discrepancy due to exoskeleton and discrepancy due to real and virtual hands. Experiments are conducted to know the discrepancy due to exoskeleton and this discrepancy can be taken care of by either at the hardware or software level. A Mathematical model is proposed to know the discrepancy between real and virtual hands. This could not give a fixed value and can not be taken care of by calibration. Experiments are conducted to figure out how much compensation can be given to achieve haptic realism.

Quantum destruction of spiral order in two-dimensional frustrated magnets

We study the fate of spin-1/2 spiral-ordered two-dimensional quantum antiferromagnets that are disordered by quantum fluctuations. A crucial role is played by the topological point defects of the spiral phase, which are known to have a Z(2) character. Previous works established that a nontrivial quantum spin-liquid phase results when the spiral is disordered without proliferating the Z(2) vortices. Here, we show that when the spiral is disordered by proliferating and condensing these vortices, valence-bond solid ordering occurs due to quantum Berry phase effects. We develop a general theory for this latter phase transition and apply it to a lattice model. This transition potentially provides a new example of a Landau-forbidden deconfined quantum critical point.

Scalable Context-Sensitive Points-To Analysis Using Multi-Dimensional Bloom Filters

Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the analysis increase tremendously for large programs, making the analysis non-scalable. We propose a scalable flow-insensitive context-sensitive inclusion-based points-to analysis that uses a specially designed multi-dimensional bloom filter to store the points-to information. Two key observations motivate our proposal: (i) points-to information (between pointer-object and between pointer-pointer) is sparse, and (ii) moving from an exact to an approximate representation of points-to information only leads to reduced precision without affecting correctness of the (may-points-to) analysis. By using an approximate representation a multi-dimensional bloom filter can significantly reduce the memory requirements with a probabilistic bound on loss in precision. Experimental evaluation on SPEC 2000 benchmarks and two large open source programs reveals that with an average storage requirement of 4MB, our approach achieves almost the same precision (98.6%) as the exact implementation. By increasing the average memory to 27MB, it achieves precision upto 99.7% for these benchmarks. Using Mod/Ref analysis as the client, we find that the client analysis is not affected that often even when there is some loss of precision in the points-to representation. We find that the NoModRef percentage is within 2% of the exact analysis while requiring 4MB (maximum 15MB) memory and less than 4 minutes on average for the points-to analysis. Another major advantage of our technique is that it allows to trade off precision for memory usage of the analysis.