A Gradient-Based Comparison Measure for Visual analysis of Multifield Data

We introduce a multifield comparison measure for scalar fields that helps in studying relations between them. The comparison measure is insensitive to noise in the scalar fields and to noise in their gradients. Further, it can be computed robustly and efficiently. Results from the visual analysis of various data sets from climate science and combustion applications demonstrate the effective use of the measure.

Video coding mode decision as a classification problem

In this paper, we show that it is possible to reduce the complexity of Intra MB coding in H.264/AVC based on a novel chance constrained classifier. Using the pairs of simple mean-variances values, our technique is able to reduce the complexity of Intra MB coding process with a negligible loss in PSNR. We present an alternate approach to address the classification problem which is equivalent to machine learning. Implementation results show that the proposed method reduces encoding time to about 20% of the reference implementation with average loss of 0.05 dB in PSNR.

Phase diagram of a two-species lattice model with a linear instability

We discuss the properties of a one-dimensional lattice model of a driven system with two species of particles in which the mobility of one species depends on the density of the other. This model was introduced by Lahiri and Ramaswamy (Phys. Rev. Lett., 79, 1150 (1997)) in the context of sedimenting colloidal crystals, and its continuum version was shown to exhibit an instability arising from linear gradient couplings. In this paper we review recent progress in understanding the full phase diagram of the model. There are three phases. In the first, the steady state can be determined exactly along a representative locus using the condition of detailed balance. The system shows phase separation of an exceptionally robust sort, termed strong phase separation, which survives at all temperatures. The second phase arises in the threshold case where the first species evolves independently of the second, but the fluctuations of the first influence the evolution of the second, as in the passive scalar problem. The second species then shows phase separation of a delicate sort, in which long-range order coexists with fluctuations which do not damp down in the large-size limit. This fluctuation-dominated phase ordering is associated with power law decays in cluster size distributions and a breakdown of the Porod law. The third phase is one with a uniform overall density, and along a representative locus the steady state is shown to have product measure form. Density fluctuations are transported by two kinematic waves, each involving both species and coupled at the nonlinear level. Their dissipation properties are governed by the symmetries of these couplings, which depend on the overall densities. In the most interesting case,, the dissipation of the two modes is characterized by different critical exponents, despite the nonlinear coupling.

The restriction mapping problem revisited

In computational molecular biology, the aim of restriction mapping is to locate the restriction sites of a given enzyme on a DNA molecule. Double digest and partial digest are two well-studied techniques for restriction mapping. While double digest is NP-complete, there is no known polynomial-time algorithm for partial digest. Another disadvantage of the above techniques is that there can be multiple solutions for reconstruction. In this paper, we study a simple technique called labeled partial digest for restriction mapping. We give a fast polynomial time (O(n(2) log n) worst-case) algorithm for finding all the n sites of a DNA molecule using this technique. An important advantage of the algorithm is the unique reconstruction of the DNA molecule from the digest. The technique is also robust in handling errors in fragment lengths which arises in the laboratory. We give a robust O(n(4)) worst-case algorithm that can provably tolerate an absolute error of O(Delta/n) (where Delta is the minimum inter-site distance), while giving a unique reconstruction. We test our theoretical results by simulating the performance of the algorithm on a real DNA molecule. Motivated by the similarity to the labeled partial digest problem, we address a related problem of interest-the de novo peptide sequencing problem (ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 389-398), which arises in the reconstruction of the peptide sequence of a protein molecule. We give a simple and efficient algorithm for the problem without using dynamic programming. The algorithm runs in time O(k log k), where k is the number of ions and is an improvement over the algorithm in Chen et al. (C) 2002 Elsevier Science (USA). All rights reserved.

A gradient PCR-based screen for use in site-directed mutagenesis

Site-directed mutagenesis is widely used to study protein and nucleic acid structure and function. Despite recent advancements in the efficiency of procedures for site-directed mutagenesis, the fraction of site-directed mutants by most procedures rarely exceeds 50% on a routine basis and is never 100%. Hence it is typically necessary to sequence two or three clones each time a site-directed mutant is constructed. We describe a simple and robust gradient-PCR-based screen for distinguishing site-directed mutants from the starting, unmutated plasmid. The procedure can use either purified plasmid DNA or colony PCR, starting from a single colony. The screen utilizes the primer used for mutagenesis and a common outside primer that can be used for all other mutants constructed with the same template. Over 30 site-specific mutants in a variety of templates were successfully screened and all of the mutations detected were subsequently confirmed by DNA sequencing. A single base pair mismatch could be detected in an oligonucleotide of 36 bases. Detection efficiency was relatively independent of starting template concentration and the nature of the outside primer used. (C) 2003 Elsevier Science (USA). All rights reserved.

A waveguide problem involving a thick iris in the theory of electromagnetism

The problem of electromagnetic wave propagation in a rectangular waveguide containing a thick iris is considered for its complete solution by reducing it to two suitable integral equations, one of which is of the first kind and the other is of the second kind. These integral equations are solved approximately, by using truncated Fourier series for the unknown functions. The reflection coefficient is computed numerically from the two integral equation approaches, and almost the same numerical results are obtained. This is also depicted graphically against the wave number and compared with thin iris results, which are computed by using complementary formulations coupled with Galerkin approximations. While the reflection coefficient for a thin iris steadily increases with the wave number, for a thick iris it fluctuates and zero reflection occurs. The number of zeros of the reflection coefficient for a thick iris increases with the thickness. Thus a thick iris becomes completely transparent for some discrete wave numbers. This phenomenon may be significant in the modelling of rectangular waveguides.

Spherical piston problem in water

In this paper, we study the propagation of a shock wave in water, produced by the expansion of a spherical piston with a finite initial radius. The piston path in the x, t plane is a hyperbola. We have considered the following two cases: (i) the piston accelerates from a zero initial velocity and attains a finite velocity asymptotically as t tends to infinity, and (ii) the piston decelerates, starting from a finite initial velocity. Since an analytic approach to this problem is extremely difficult, we have employed the artificial viscosity method of von Neumann & Richtmyer after examining its applicability in water. For the accelerating piston case, we have studied the effect of different initial radii of the piston, different initial curvatures of the piston path in the x, t plane and the different asymptotic speeds of the piston. The decelerating case exhibits the interesting phenomenon of the formation of a cavity in water when the deceleration of the piston is sufficiently high. We have also studied the motion of the cavity boundary up to 550 cycles.

Effect of longitudinal surface curvature on boundary layers

We consider here the higher order effect of moderate longitudinal surface curvature on steady, two-dimensional, incompressible laminar boundary layers. The basic partial differential equations for the problem, derived by the method of matched asymptotic expansions, are found to possess similarity solutions for a family of surface curvatures and pressure gradients. The similarity equations obtained by this anaylsis have been solved numerically on a computer, and show a definite decrease in skin friction when the surface has convex curvature in all cases including zero pressure gradient. Typical velocity profiles and some relevant boundary-layer characteristics are tabulated, and a critical comparison with previous work is given.

On the solution of the problem of scattering of surface water waves by a sharp discontinuity in the surface boundary conditions

Closed-form analytical expressions are derived for the reflection and transmission coefficients for the problem of scattering of surface water waves by a sharp discontinuity in the surface-boundary-conditions, for the case of deep water. The method involves the use of the Havelock-type expansion of the velocity potential along with an analysis to solve a Carleman-type singular integral equation over a semi-infinite range. This method of solution is an alternative to the Wiener-Hopf technique used previously.

The effect of boundaries on the plane Couette flow of granular materials: a bifurcation analysis

The tendency of granular materials in rapid shear ow to form non-uniform structures is well documented in the literature. Through a linear stability analysis of the solution of continuum equations for rapid shear flow of a uniform granular material, performed by Savage (1992) and others subsequently, it has been shown that an infinite plane shearing motion may be unstable in the Lyapunov sense, provided the mean volume fraction of particles is above a critical value. This instability leads to the formation of alternating layers of high and low particle concentrations oriented parallel to the plane of shear. Computer simulations, on the other hand, reveal that non-uniform structures are possible even when the mean volume fraction of particles is small. In the present study, we have examined the structure of fully developed layered solutions, by making use of numerical continuation techniques and bifurcation theory. It is shown that the continuum equations do predict the existence of layered solutions of high amplitude even when the uniform state is linearly stable. An analysis of the effect of bounding walls on the bifurcation structure reveals that the nature of the wall boundary conditions plays a pivotal role in selecting that branch of non-uniform solutions which emerges as the primary branch. This demonstrates unequivocally that the results on the stability of bounded shear flow of granular materials presented previously by Wang et al. (1996) are, in general, based on erroneous base states.

Solving a part classification problem using simulated annealing-like hybrid

Part classification and coding is still considered as laborious and time-consuming exercise. Keeping in view, the crucial role, which it plays, in developing automated CAPP systems, the attempts have been made in this article to automate a few elements of this exercise using a shape analysis model. In this study, a 24-vector directional template is contemplated to represent the feature elements of the parts (candidate and prototype). Various transformation processes such as deformation, straightening, bypassing, insertion and deletion are embedded in the proposed simulated annealing (SA)-like hybrid algorithm to match the candidate part with their prototype. For a candidate part, searching its matching prototype from the information data is computationally expensive and requires large search space. However, the proposed SA-like hybrid algorithm for solving the part classification problem considerably minimizes the search space and ensures early convergence of the solution. The application of the proposed approach is illustrated by an example part. The proposed approach is applied for the classification of 100 candidate parts and their prototypes to demonstrate the effectiveness of the algorithm. (C) 2003 Elsevier Science Ltd. All rights reserved.

Accurate Parameter Estimation of Contaminant Transport Inverse Problem using Paartaicle Swarm Optimization

Swarm Intelligence techniques such as particle swarm optimization (PSO) are shown to be incompetent for an accurate estimation of global solutions in several engineering applications. This problem is more severe in case of inverse optimization problems where fitness calculations are computationally expensive. In this work, a novel strategy is introduced to alleviate this problem. The proposed inverse model based on modified particle swarm optimization algorithm is applied for a contaminant transport inverse model. The inverse models based on standard-PSO and proposed-PSO are validated to estimate the accuracy of the models. The proposed model is shown to be out performing the standard one in terms of accuracy in parameter estimation. The preliminary results obtained using the proposed model is presented in this work.

Ascent Phase Trajectory Optimization of a Generic Launch Vehicle

Trajectory optimization of a generic launch vehicle is considered in this paper. The trajectory from launch point to terminal injection point is divided in to two segments. The first segment deals with launcher clearance and vertical raise of the vehicle. During this phase, a nonlinear feedback guidance loop is incorporated to assure vertical raise in presence of thrust misalignment, centre of gravity offset, wind disturbance etc. and possibly to clear obstacles as well. The second segment deals with the trajectory optimization, where the objective is to ensure desired terminal conditions as well as minimum control effort and minimum structural loading in the high dynamic pressure region. The usefulness of this dynamic optimization problem formulation is demonstrated by solving it using the classical Gradient method. Numerical results for both the segments are presented, which clearly brings out the potential advantages of the proposed approach.