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 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.

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.

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.

Benchmark Control Problem for Highway Bridge based on FLC

Fuzzy logic control (FLC) systems have been applied as an effective control system in various fields, including vibration control of structures. The advantage of this approach is its inherent robustness and ability to handle non‐linearities and uncertainties in structural behavior and loading. The study evaluates the three‐dimensional benchmark control problem for a seismically excited highway bridge using an ANFIS driven hydraulic actuators. An ANN based training strategy that considers both velocity and acceleration feedback together with a fuzzy logic rule base is developed. Present study needs only 4 accelerometers and 4 fuzzy rule bases to determine the control force, instead of 8 accelerometers and 4 displacement transducers used in the benchmark study problem. The results obtained are better than that obtained from the benchmark control algorithm.

Pickup and delivery problem using metaheuristics techniques

Dial-a-ride problem (DARP) is an optimization problem which deals with the minimization of the cost of the provided service where the customers are provided a door-to-door service based on their requests. This optimization model presented in earlier studies, is considered in this study. Due to the non-linear nature of the objective function the traditional optimization methods are plagued with the problem of converging to a local minima. To overcome this pitfall we use metaheuristics namely Simulated Annealing (SA), Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Artificial Immune System (AIS). From the results obtained, we conclude that Artificial Immune System method effectively tackles this optimization problem by providing us with optimal solutions. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.

The pursuit-evasion problem of two aircraft in a horizontal plane

The pursuit-evasion problem of two aircraft in a horizontal plane is modelled as a zerosum differential game with capture time as payoff. The aircraft are modelled as point masses with thrust and bank angle controls. The games of kind and degree for this differential game are solved.

Approach to the problem of ferroresonance in e.h.v. systems

An analytical analysis of ferroresonance with possible cases of its occurrence in series-and shunt-compensated systems is presented. A term `percentage unstable zoneÿ is defined to compare the jump severity of different nonlinearities. A direct analytical method has been shown to yield complete information. An attempt has been made to find all four critical points: jump-from and jump-to points of ferroresonance jump phenomena. The systems considered for analysis are typical 500 kV transmission systems of various lengths.