An online-implementable differential evolution tuned all-aspect guidance law

This paper proposes a differential evolution based method of improving the performance of conventional guidance laws at high heading errors, without resorting to techniques from optimal control theory, which are complicated and suffer from several limitations. The basic guidance law is augmented with a term that is a polynomial function of the heading error. The values of the coefficients of the polynomial are found by applying the differential evolution algorithm. The results are compared with the basic guidance law, and the all-aspect proportional navigation laws in the literature. A scheme for online implementation of the proposed law for application in practice is also given. (c) 2010 Elsevier Ltd. All rights reserved.

A sufficient criterion for Rayleigh-Taylor instability of incompressible viscous three-layer flow

Using normal mode analysis Rayleigh-Taylor instability is investigated for three-layer viscous stratified incompressible steady flow, when the top 3rd and bottom 1st layers extend up to infinity, the middle layer has a small thickness δ. The wave Reynolds number in the middle layer is assumed to be sufficiently small. A dispersion relation (a seventh degree polynomial in wave frequency ω) valid up to the order of the maximal value of all possible Kj (j less-than-or-equals, slant 0, K is the wave number) in each coefficient of the polynomial is obtained. A sufficient condition for instability is found out for the first time, pursuing a medium wavelength analysis. It depends on ratios (α and β) of the coefficients of viscosity, the thickness of the middle layer δ, surface tension ratio T and wave number K. This is a new analytical criterion for Rayleigh-Taylor instability of three-layer fluids. It recovers the results of the corresponding problem for two-layer fluids. Among the results obtained, it is observed that taking the coefficients of viscosity of 2nd and 3rd layers same can inhibit the effect of surface tension completely. For large wave number K, the thickness of the middle layer should be correspondingly small to keep the domain of dependence of the threshold wave number Kc constant for fixed α, β and T.

Maturation of a transient outward potassium current in mouse fetal hypothalamic neurons in culture

The whole-cell voltage clamp technique was used to record potassium currents in mouse fetal hypothalamic neurons developing in culture medium from days 1 to 17. The neurons were derived from fetuses of IOPS/OF1 mice on the 14th day of gestation. The mature neurons (>six days in culture) showed both a transient potassium current and a non-inactivating delayed rectifier potassium current. These were identified pharmacologically by using the potassium channel blockers tetraethyl ammonium chloride and 4-aminopyridine, and on the basis of their kinetics and voltage sensitivities. The delayed rectifier potassium current had a threshold of −20 mV, a slow time-course of activation, and was sustained during the voltage pulse. The 4-aminopyridine-sensitive current was transient, and was activated from a holding potential more negative (−80 mV) than that required for evoking the delayed rectifier potassium current (−40 mV). The delayed rectifier potassium current was detectable from day 1 onwards, while the transient potassium current showed a distinct developmental trend. The time-constant of inactivation became faster with age in culture. The half steady-state inactivation potential showed a shift towards less negative membrane potentials with age, and the relationship was best described by a logarithmic regression equation.The developmental trend of the transient potassium current may relate functionally to the progressive morphological changes, and the appearance of synaptic connections during ontogenesis.

Entropy and dynamics of water in hydration layers of a bilayer

We compute the entropy and transport properties of water in the hydration layer of dipalmitoylphosphatidylcholine bilayer by using a recently developed theoretical scheme two-phase thermodynamic model, termed as 2PT method; S.-T. Lin et al., J. Chem. Phys. 119, 11792 (2003)] based on the translational and rotational velocity autocorrelation functions and their power spectra. The weights of translational and rotational power spectra shift from higher to lower frequency as one goes from the bilayer interface to the bulk. Water molecules near the bilayer head groups have substantially lower entropy (48.36 J/mol/K) than water molecules in the intermediate region (51.36 J/mol/K), which have again lower entropy than the molecules (60.52 J/mol/K) in bulk. Thus, the entropic contribution to the free energy change (T Delta S) of transferring an interface water molecule to the bulk is 3.65 kJ/mol and of transferring intermediate water to the bulk is 2.75 kJ/mol at 300 K, which is to be compared with 6.03 kJ/mol for melting of ice at 273 K. The translational diffusion of water in the vicinity of the head groups is found to be in a subdiffusive regime and the rotational diffusion constant increases going away from the interface. This behavior is supported by the slower reorientational relaxation of the dipole vector and OH bond vector of interfacial water. The ratio of reorientational relaxation time for Legendre polynomials of order 1 and 2 is approximately 2 for interface, intermediate, and bulk water, indicating the presence of jump dynamics in these water molecules. (C) 2010 American Institute of Physics. doi:10.1063/1.3494115]

Diffraction of a cylindrical pulse by a half plane under mixed boundary conditions

The general time dependent source problem has been solved by the method of transforms (Laplace, Lebedev–Kontorovich in succession) and the solution is obtained in the form of an infinite series involving Legendre functions. The solutions in the case of harmonic time dependence and the incident plane wave have been derived from the above solution and are presented in the form of an infinite series. In the case of an incident plane wave, the series has been summed and the final solution involves an improper integral which behaves like a complementary error function for large values of the argument. Finally, the far field evaluation has been shown. The results are compared with those of Sommerfeld's half-plane diffraction problem with unmixed boundary conditions.

A Smooth Finite Element Method Based on Reproducing Kernel DMS-Splines

The element-based piecewise smooth functional approximation in the conventional finite element method (FEM) results in discontinuous first and higher order derivatives across element boundaries Despite the significant advantages of the FEM in modelling complicated geometries, a motivation in developing mesh-free methods has been the ease with which higher order globally smooth shape functions can be derived via the reproduction of polynomials There is thus a case for combining these advantages in a so-called hybrid scheme or a `smooth FEM' that, whilst retaining the popular mesh-based discretization, obtains shape functions with uniform C-p (p >= 1) continuity One such recent attempt, a NURBS based parametric bridging method (Shaw et al 2008b), uses polynomial reproducing, tensor-product non-uniform rational B-splines (NURBS) over a typical FE mesh and relies upon a (possibly piecewise) bijective geometric map between the physical domain and a rectangular (cuboidal) parametric domain The present work aims at a significant extension and improvement of this concept by replacing NURBS with DMS-splines (say, of degree n > 0) that are defined over triangles and provide Cn-1 continuity across the triangle edges This relieves the need for a geometric map that could precipitate ill-conditioning of the discretized equations Delaunay triangulation is used to discretize the physical domain and shape functions are constructed via the polynomial reproduction condition, which quite remarkably relieves the solution of its sensitive dependence on the selected knotsets Derivatives of shape functions are also constructed based on the principle of reproduction of derivatives of polynomials (Shaw and Roy 2008a) Within the present scheme, the triangles also serve as background integration cells in weak formulations thereby overcoming non-conformability issues Numerical examples involving the evaluation of derivatives of targeted functions up to the fourth order and applications of the method to a few boundary value problems of general interest in solid mechanics over (non-simply connected) bounded domains in 2D are presented towards the end of the paper

A field-consistent and variationally correct representation of transverse shear strains in the nine-noded plate element

We present a biquadratic Lagrangian plate bending element with consistent fields for the constrained transverse shear strain functions. A technique involving expansion of the strain interpolations in terms of Legendre polynomials is used to redistribute the kinematically derived shear strain fields so that the field-consistent forms (i.e. avoiding locking) are also variationally correct (i.e. do not violate the variational norms). Also, a rational method of isoparametric Jacobian transformation is incorporated so that the constrained covariant shear strain fields are always consistent in whatever general quadrilateral form the element may take. Finally the element is compared with another formulation which was recently published. The element is subjected to several robust bench mark tests and is found to pass all the tests efficiently.

A homotopy approach for stabilizing single-input systems with control structure constraints

A linear state feedback gain vector used in the control of a single input dynamical system may be constrained because of the way feedback is realized. Some examples of feedback realizations which impose constraints on the gain vector are: static output feedback, constant gain feedback for several operating points of a system, and two-controller feedback. We consider a general class of problems of stabilization of single input dynamical systems with such structural constraints and give a numerical method to solve them. Each of these problems is cast into a problem of solving a system of equalities and inequalities. In this formulation, the coefficients of the quadratic and linear factors of the closed-loop characteristic polynomial are the variables. To solve the system of equalities and inequalities, a continuous realization of the gradient projection method and a barrier method are used under the homotopy framework. Our method is illustrated with an example for each class of control structure constraint.

An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models

In this paper we study representation of KL-divergence minimization, in the cases where integer sufficient statistics exists, using tools from polynomial algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. In particular, we also study the case of Kullback-Csiszar iteration scheme. We present implicit descriptions of these models and show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner bases method to compute an implicit representation of minimum KL-divergence models.

A Circuit-Based Proof of Toda′s Theorem

We present a simple proof of Toda′s result (Toda (1989), in "Proceedings, 30th Annual IEEE Symposium on Foundations of Computer Science," pp. 514-519), which states that circled plus P is hard for the Polynomial Hierarchy under randomized reductions. Our approach is circuit-based in the sense that we start with uniform circuit definitions of the Polynomial Hierarchy and apply the Valiant-Vazirani lemma on these circuits (Valiant and Vazirani (1986), Thoeret. Comput. Sci.47, 85-93).

A note on resolving infeasibility in linear programs by constraint relaxation

We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an infeasible linear program, make it feasible. We show the problem is NP-hard even when the constraint matrix is totally unimodular and prove polynomial-time solvability when the constraint matrix and the right-hand-side together form a totally unimodular matrix.

Minimizing total completion time on a batch processing machine with job families

We consider the problem of minimizing the total completion time on a single batch processing machine. The set of jobs to be scheduled can be partitioned into a number of families, where all jobs in the same family have the same processing time. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the processing time of the longest job in the batch. We analyze that properties of an optimal schedule and develop a dynamic programming algorithm of polynomial time complexity when the number of job families is fixed. The research is motivated by the problem of scheduling burn-in ovens in the semiconductor industry

Some new results regarding spikes and a heuristic for spike construction

his paper addresses the problem of minimizing the number of columns with superdiagonal nonzeroes (viz., spiked columns) in a square, nonsingular linear system of equations which is to be solved by Gaussian elimination. The exact focus is on a class of min-spike heuristics in which the rows and columns of the coefficient matrix are first permuted to block lower-triangular form. Subsequently, the number of spiked columns in each irreducible block and their heights above the diagonal are minimized heuristically. We show that ifevery column in an irreducible block has exactly two nonzeroes, i.e., is a doubleton, then there is exactly one spiked column. Further, if there is at least one non-doubleton column, there isalways an optimal permutation of rows and columns under whichnone of the doubleton columns are spiked. An analysis of a few benchmark linear programs suggests that singleton and doubleton columns can abound in practice. Hence, it appears that the results of this paper can be practically useful. In the rest of the paper, we develop a polynomial-time min-spike heuristic based on the above results and on a graph-theoretic interpretation of doubleton columns.

The Reproducing Kernel DMS-FEM: 3D Shape Functions and Applications to Linear Solid Mechanics

We propose a family of 3D versions of a smooth finite element method (Sunilkumar and Roy 2010), wherein the globally smooth shape functions are derivable through the condition of polynomial reproduction with the tetrahedral B-splines (DMS-splines) or tensor-product forms of triangular B-splines and ID NURBS bases acting as the kernel functions. While the domain decomposition is accomplished through tetrahedral or triangular prism elements, an additional requirement here is an appropriate generation of knotclouds around the element vertices or corners. The possibility of sensitive dependence of numerical solutions to the placements of knotclouds is largely arrested by enforcing the condition of polynomial reproduction whilst deriving the shape functions. Nevertheless, given the higher complexity in forming the knotclouds for tetrahedral elements especially when higher demand is placed on the order of continuity of the shape functions across inter-element boundaries, we presently emphasize an exploration of the triangular prism based formulation in the context of several benchmark problems of interest in linear solid mechanics. In the absence of a more rigorous study on the convergence analyses, the numerical exercise, reported herein, helps establish the method as one of remarkable accuracy and robust performance against numerical ill-conditioning (such as locking of different kinds) vis-a-vis the conventional FEM.

Guessing Revisited: A Large Deviations Approach

The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation property with a certain rate function, then the limiting guessing exponent exists and is a scalar multiple of the Legendre-Fenchel dual of the rate function. Other sufficient conditions related to certain continuity properties of the information spectrum are briefly discussed. This approach highlights the importance of the information spectrum in determining the limiting guessing exponent. All known prior results are then re-derived as example applications of our unifying approach.