Wave algorithms:Optimal database search and catalysis

Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any physical system that allows superposition of states. A physical realization of this algorithm is described using coupled simple harmonic oscillators, which can be exactly solved in both classical and quantum domains. Classical wave algorithms are far more stable against decoherence compared to their quantum counterparts. In addition to providing convenient demonstration models, they may have a role in practical situations, such as catalysis.

SPSA algorithms with measurement reuse

Four algorithms, all variants of Simultaneous Perturbation Stochastic Approximation (SPSA), are proposed. The original one-measurement SPSA uses an estimate of the gradient of objective function L containing an additional bias term not seen in two-measurement SPSA. As a result, the asymptotic covariance matrix of the iterate convergence process has a bias term. We propose a one-measurement algorithm that eliminates this bias, and has asymptotic convergence properties making for easier comparison with the two-measurement SPSA. The algorithm, under certain conditions, outperforms both forms of SPSA with the only overhead being the storage of a single measurement. We also propose a similar algorithm that uses perturbations obtained from normalized Hadamard matrices. The convergence w.p. 1 of both algorithms is established. We extend measurement reuse to design two second-order SPSA algorithms and sketch the convergence analysis. Finally, we present simulation results on an illustrative minimization problem.

Robust prediction of residual velocities and ballistic limits of projectiles for impact on thin aluminium plates

This paper deals with the simulation-driven study of the impact of hardened steel projectiles on thin aluminium target plates using explicit finite element analysis as implemented in LS-DYNA. The evaluation of finite element modelling includes a comprehensive mesh convergence study using shell elements for representing target plates and the solid element-based representation of ogivalnosed projectiles. A user-friendly automatic contact detection algorithm is used for capturing interaction between the projectile and the target plate. It is shown that the proper choice of mesh density and strain rate-dependent material properties is crucial as these parameters significantly affect the computed residual velocity. The efficacy of correlation with experimental data is adjudged in terms of a 'correlation index' defined in the present study for which values close to unity are desirable.By simulating laboratory impact tests on thin aluminium plates carried out by earlier investigators, extremely good prediction of experimental ballistic limits has been observed with correlation indices approaching unity. Additional simulation-based parametric studies have been carried out and results consistent with test data have been obtained. The simulation procedures followed in the present study can be applied with confidence in designing thin aluminium armour plates for protection against low calibre projectiles.

Prediction of inplane damping from deterministic and stochastic models

This paper reviews computational reliability, computer algebra, stochastic stability and rotating frame turbulence (RFT) in the context of predicting the blade inplane mode stability, a mode which is at best weakly damped. Computational reliability can be built into routine Floquet analysis involving trim analysis and eigenanalysis, and a highly portable special purpose processor restricted to rotorcraft dynamics analysis is found to be more economical than a multipurpose processor. While the RFT effects are dominant in turbulence modeling, the finding that turbulence stabilizes the inplane mode is based on the assumption that turbulence is white noise.

Intelligent prediction of the stress-strain response of intact and jointed rocks

An application of Artificial Neural Networks for predicting the stress-strain response of jointed rocks under different confining pressures is presented in this paper. Rocks of different compressive strength with different joint properties (frequency, orientation and strength of joints) are considered in this study. The database for training the neural network is formed from the results of triaxial compression tests on different intact and jointed rocks with different joint properties tested at different confining pressures reported by various researchers in the literature. The network was trained using a three-layered network with the feed-forward back propagation algorithm.About 85% of the data was used for training and the remaining 15% was used for testing the network. Results from the analyses demonstrated that the neural network approach is effective in capturing the stress-strain behaviour of intact rocks and the complex stress-strain behaviour of jointed rocks. A single neural network is demonstrated to be capable of predicting the stress-strain response of different jointed rocks, whose intact strength varies from 11.32 MPa to 123 MPa, spacing of joints varies from 10 cm to 100 cm. and confining pressures range from 0 to 13.8 MPa. (C) 2010 Elsevier Ltd. All rights reserved.

Prediction of breakout noise from an elliptical duct of finite length

This paper describes a predictive model for breakout noise from an elliptical duct or shell of finite length. The transmission mechanism is essentially that of ``mode coupling'', whereby higher structural modes in the duct walls get excited because of non-circularity of the wall. Effect of geometry has been taken care of by evaluating Fourier coefficients of the radius of curvature. The noise radiated from the duct walls is represented by that from a finite vibrating length of a semi infinite cylinder in a free field. Emphasis is on understanding the physics of the problem as well as analytical modeling. The analytical model is validated with 3-D FEM. Effects of the ovality, curvature, and axial terminations of the duct have been demonstrated. (C) 2010 Institute of Noise Control Engineering.

Modified linear prediction method for directions of arrival estimation of narrow-band plane waves

A modified linear prediction (MLP) method is proposed in which the reference sensor is optimally located on the extended line of the array. The criterion of optimality is the minimization of the prediction error power, where the prediction error is defined as the difference between the reference sensor and the weighted array outputs. It is shown that the L2-norm of the least-squares array weights attains a minimum value for the optimum spacing of the reference sensor, subject to some soft constraint on signal-to-noise ratio (SNR). How this minimum norm property can be used for finding the optimum spacing of the reference sensor is described. The performance of the MLP method is studied and compared with that of the linear prediction (LP) method using resolution, detection bias, and variance as the performance measures. The study reveals that the MLP method performs much better than the LP technique.

Improved prediction of plane transverse jets in supersonic crossflows

THE flowfield due to transverse injection of a round sonic jet into a supersonic flowis a configuration of interest in the design of supersonic combustors or thrust vector control of supersonic jets. The flow is also of fundamental interest because it presents separation from a smooth surface, embedded subsonic regions, curved shear layers, strong shocks, an unusual development of the injected jet into a kidney-shaped streamwise vortex pair, and a wake behind the jet. Although the geometry is simple, the flow is complex and is a good candidate for assessing the behavior of turbulence models for high-speed flow, beginning with the corresponding two-dimensional flow shown in Fig. 1. At the slot, an underexpanded sonic jet expands rapidly into the supersonic crossflow. Expansion waves reflect at the jet boundary, coalesce, and give rise to a Mach surface (Mach disk for round jets).

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Let G - (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate (delta) over cap (u, v) of the actual distance d( u, v) between u, v is an element of V is said to be of stretch t if and only if delta(u, v) <= (delta) over cap (u, v) <= t . delta(u, v). Computing all-pairs small stretch distances efficiently ( both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel, and generic scheme for all-pairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for all-pairs t-stretch distances for a whole range of stretch t, and we also answer an open question posed by Thorup and Zwick in their seminal paper [J. ACM, 52 (2005), pp. 1-24].

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Formant extraction from linear-prediction phase spectra

Extraction of formant information from linear-prediction phase spectra is proposed. It is shown that the derivative of phase spectrum gives reliable formant information. Since the phase spectra for several resonators in cascade are additive, the resonance peaks are additive in the derivative of the phase spectrum unlike in the magnitude spectrum and hence the problem of identifying merged peaks is very easily solved by this method. Application of the method is illustrated through examples of linear-prediction spectra obtained for simulated models and for actural speech segments.

Prediction of Specimen Strain from Extensometer Deflection Measurements in a Direct Stress Fatigue Test Specimen under Static Tensile Loading

The displacement between the ridges situated outside the filleted test section of an axially loaded unnotched specimen is computed from the axial load and shape of the specimen and compared with extensometer deflection data obtained from experiments. The effect of prestrain on the extensometer deflection versus specimen strain curve has been studied experimentally and analytically. An analytical study shows that an increase in the slope of the stress-strain curve in the inelastic region increases the slope of the corresponding computed extensometer deflection versus specimen strain curve. A mathematical model has been developed which uses a modified length ¯ℓef in place of the actual length of the uniform diameter test section of the specimen. This model predicts the extensometer deflection within 5% of the corresponding experimental value. This method has been successfully used by the authors to evolve an iterative procedure for predicting the cyclic specimen strain in axial fatigue tests on unnotched specimens.

Algorithms for Colouring Random k-colourable Graphs

The k-colouring problem is to colour a given k-colourable graph with k colours. This problem is known to be NP-hard even for fixed k greater than or equal to 3. The best known polynomial time approximation algorithms require n(delta) (for a positive constant delta depending on k) colours to colour an arbitrary k-colourable n-vertex graph. The situation is entirely different if we look at the average performance of an algorithm rather than its worst-case performance. It is well known that a k-colourable graph drawn from certain classes of distributions can be ii-coloured almost surely in polynomial time. In this paper, we present further results in this direction. We consider k-colourable graphs drawn from the random model in which each allowed edge is chosen independently with probability p(n) after initially partitioning the vertex set into ii colour classes. We present polynomial time algorithms of two different types. The first type of algorithm always runs in polynomial time and succeeds almost surely. Algorithms of this type have been proposed before, but our algorithms have provably exponentially small failure probabilities. The second type of algorithm always succeeds and has polynomial running time on average. Such algorithms are more useful and more difficult to obtain than the first type of algorithms. Our algorithms work as long as p(n) greater than or equal to n(-1+is an element of) where is an element of is a constant greater than 1/4.

Optimal reservoir operation for irrigation of multiple crops using genetic algorithms

This paper presents a genetic algorithm (GA) model for obtaining an optimal operating policy and optimal crop water allocations from an irrigation reservoir. The objective is to maximize the sum of the relative yields from all crops in the irrigated area. The model takes into account reservoir inflow, rainfall on the irrigated area, intraseasonal competition for water among multiple crops, the soil moisture dynamics in each cropped area, the heterogeneous nature of soils. and crop response to the level of irrigation applied. The model is applied to the Malaprabha single-purpose irrigation reservoir in Karnataka State, India. The optimal operating policy obtained using the GA is similar to that obtained by linear programming. This model can be used for optimal utilization of the available water resources of any reservoir system to obtain maximum benefits.

Integration-free algorithms for fixed end-point regulator problems

A new formulation is suggested for the fixed end-point regulator problem, which, in conjunction with the recently developed integration-free algorithms, provides an efficient means of obtaining numerical solutions to such problems.