Scattering of membrane coupled gravity waves in deep water by partial vertical barriers is investigated by the recently developed expansion formulae for wave structure interaction problems. The horizontal thin membrane is considered to be under uniform tension and is covering the free surface. The analysis is based on the linearized theory of water waves, and by combining the kinematic and dynamic conditions at the membrane covered surface, one may derive a not so well-posed mixed boundary value problem for Laplace’s equation with third-order boundary condition. The flexible membrane is attached by a spring to the surface piercing barrier, giving suitable edge conditions for the unique solution. The boundary value problem has been converted into dual integral equations with kernels composed of trigonometric functions, which are then solved analytically. The important physical quantities such as reflection and transmission coefficients for both cases of submerged and surface piercing barriers are obtained analytically in terms of modified Bessel functions. It is found that complete reflection or transmission is possible at certain resonant frequencies for the incident membrane coupled waves. Numerical results are plotted and discussed for different values of the nondimensional membrane tension parameter.

Steady magnetohydrodynamic flow of an incompressible micropolar fluid through a pipe of circular cross-section is studied by considering Hall and ionic effects. The fluid motion is due to a constant pressure gradient, and an external uniform magnetic field directed perpendicular to the flow direction is applied. Expressions for the velocity, microrotation, skin friction and flow rate are obtained. The effects of the micropolar parameter, magnetic parameter, Hall parameter and ion-slip parameter on the velocity, microrotation, skin friction and flow rate are discussed.

This paper investigates American puts on a dividend-paying underlying whose volatility is a function of both time and underlying asset price. The asymptotic behaviour of the critical price near expiry is deduced by means of singular perturbation methods. It turns out that if the underlying dividend is greater than the risk-free interest rate, the behaviour of the critical price is parabolic, otherwise an extra logarithmic factor appears, which is similar to the constant volatility case. The results of this paper complement numerical approaches used to calculate the option values and the optimal exercise price at times that are not close to expiry.

The inadequacy of the traditional sliding mode variable structure (SMVS) control method for cruise missiles is addressed. An improved SMVS control method is developed, in which the reaching mode segment of the SMVS control is decomposed into an acceleration accessing segment, a speed keeping segment, and a deceleration buffer segment. A time-fuel optimal control problem is formulated as an optimal control problem involving a switched system with unknown switching times and subject to a continuous state inequality constraint. The new design method is developed based on a control parametrization, a time scaling transform and the constraint transcription method. A sequence of approximate optimal parameter selection problems is obtained with fixed switching time points and a canonical state inequality constraint. Each approximate optimal parameter selection problem can be solved effectively by using existing gradient-based optimization techniques. The convergence of these approximate optimal solutions to the true optimal solution is assured. Simulation results show that the proposed method is highly effective. The response speed of the missile under the control law obtained by the proposed method is improved significantly, while the elevator of the missile is constrained to operate within its permitted range.

In this paper, an efficient computation method is developed for solving a general class of minmax optimal control problems, where the minimum deviation from the violation of the continuous state inequality constraints is maximized. The constraint transcription method is used to construct a smooth approximate function for each of the continuous state inequality constraints. We then obtain an approximate optimal control problem with the integral of the summation of these smooth approximate functions as its cost function. A necessary condition and a sufficient condition are derived showing the relationship between the original problem and the smooth approximate problem. We then construct a violation function from the solution of the smooth approximate optimal control problem and the original continuous state inequality constraints in such a way that the optimal control of the minmax problem is equivalent to the largest root of the violation function, and hence can be solved by the bisection search method. The control parametrization and a time scaling transform are applied to these optimal control problems. We then consider two practical problems: the obstacle avoidance optimal control problem and the abort landing of an aircraft in a windshear downburst.

In this paper we consider an initial-value problem for the nonlinear fourth-order partial differential equation ut+uux+γuxxxx=0, −∞<x<∞, t>0, where x and t represent dimensionless distance and time respectively and γ is a negative constant. In particular, we consider the case when the initial data has a discontinuous expansive step so that u(x,0)=u0(>0) for x≥0 and u(x,0)=0 for x<0. The method of matched asymptotic expansions is used to obtain the large-time asymptotic structure of the solution to this problem which exhibits the formation of an expansion wave. Whilst most physical applications of this type of equation have γ>0, our calculations show how it is possible to infer the large-time structure of a whole family of solutions for a range of related equations.

In this note, we study deterministic and stochastic models for the spread of cholera. The deterministic model for the total number of cholera cases fits the observed total number of cholera cases in some recent outbreaks. The stochastic model for the total number of cholera cases leads to a binomial type distribution with a mean that agrees with the deterministic model.

We consider an iterated form of Lavrentiev regularization, using a null sequence (αk) of positive real numbers to obtain a stable approximate solution for ill-posed nonlinear equations of the form F(x)=y, where F:D(F)⊆X→X is a nonlinear operator and X is a Hilbert space. Recently, Bakushinsky and Smirnova [“Iterative regularization and generalized discrepancy principle for monotone operator equations”, Numer. Funct. Anal. Optim.28 (2007) 13–25] considered an a posteriori strategy to find a stopping index kδ corresponding to inexact data yδ with resulting in the convergence of the method as δ→0. However, they provided no error estimates. We consider an alternate strategy to find a stopping index which not only leads to the convergence of the method, but also provides an order optimal error estimate under a general source condition. Moreover, the condition that we impose on (αk) is weaker than that considered by Bakushinsky and Smirnova.

Determining amino acid sequences of protein molecules is one of the most important issues in molecular biology. These sequences determine protein structure and functionality. Unfortunately, direct biochemical methods for reading amino acid sequences can be used for reading short sequences only. This is the reason, which makes peptide assembly algorithms an important complement of these methods. In this paper, a genetic algorithm solving the problem of short amino acid sequence assembly is presented. The algorithm has been tested in computational experiment and compared with an existing tabu search method for the same problem. The results clearly show that the genetic algorithm outperformed the tabu search approach.

This paper studies scheduling problems which include a combination of nonlinear job deterioration and a time-dependent learning effect. We use past sequence dependent (p-s-d) setup times, which is first introduced by Koulamas and Kyparisis [Eur. J. Oper. Res.187 (2008) 1045–1049]. They considered a new form of setup times which depend on all already scheduled jobs from the current batch. Job deterioration and learning co-exist in various real life scheduling settings. By the effects of learning and deterioration, we mean that the processing time of a job is defined by increasing function of its execution start time and a function of the total normal processing time of jobs scheduled prior to it. The following objectives are considered: single machine makespan and sum of completion times (square) and the maximum lateness. For the single-machine case, we derive polynomial-time optimal solutions.

In the last decade, several robustness approaches have beendeveloped to deal with uncertainty. In decision problems, andparticularly in location problems, the most used robustnessapproach rely either on maximal cost or on maximal regretcriteria. However, it is well known that these criteria are tooconservative. In this paper, we present a new robustness approach,called lexicographic α-robustness, which compensatesfor the drawbacks of criteria based on the worst case. We applythis approach to the 1-median location problem under uncertaintyon node weights and we give a specific algorithm to determinerobust solutions in the case of a tree. We also show that thisalgorithm can be extended to the case of a general network.

The VIKOR method was introduced as a Multi-Attribute Decision Making (MADM) method to solve discrete decision-making problems with incommensurable and conflicting criteria. This method focuses on ranking and selecting from a set of alternatives based on the particular measure of “closeness” to the “ideal” solution. The multi-criteria measure for compromise ranking is developed from the l–p metric used as an aggregating function in a compromise programming method. In this paper, the VIKOR method is extended to solve Multi-Objective Large-Scale Non-Linear Programming (MOLSNLP) problems with block angular structure. In the proposed approach, the Y-dimensional objective space is reduced into a one-dimensional space by applying the Dantzig-Wolfe decomposition algorithm as well as extending the concepts of VIKOR method for decision-making in continues environment. Finally, a numerical example is given to illustrate and clarify the main results developed in this paper.

This paper deals with two-species convolution diffusion-competition models of Lotka–Volterra type with delays which describe more accurate information than the Laplacian diffusion-competition models. We first investigate the existence of travelling wave solutions of a class of nonlocal convolution diffusion systems with weak quasimonotonicity or weak exponential quasimonotonicity by a cross-iteration technique and Schauder’s fixed point theorem. When the results are applied to the convolution diffusion-competition models with delays, we establish the existence of travelling wave solutions as well as asymptotic behaviour.

It is shown that a simple deduction engine can be developed for a propositional logic that follows the normal rules of classical logic in symbolic form, but the description of what is known about a proposition uses two numeric state variables that conveniently describe unknown and inconsistent, as well as true and false. Partly true and partly false can be included in deductions. The multi-valued logic is easily understood as the state variables relate directly to true and false. The deduction engine provides a convenient standard method for handling multiple or complicated logical relations. It is particularly convenient when the deduction can start with different propositions being given initial values of true or false. It extends Horn clause based deduction for propositional logic to arbitrary clauses. The logic system used has potential applications in many areas. A comparison with propositional logic makes the paper self-contained.

This paper deals with the problem of discrete and distributed time-delay exponential stability for deterministic and uncertain stochastic high-order neural networks. The concept of a parameter weak coupling linear matrix inequality set (PWCLMIS) is developed. New results are derived in terms of PWCLMIS. Large mixed time delays can be obtained by using this approach. Furthermore, these results are more general than some previous existence results. Two numerical examples are given to show the merit of the approach.

A general analytic approach is proposed for nonlinear eigenvalue problems governed by nonlinear differential equations with variable coefficients. This approach is based on the homotopy analysis method for strongly nonlinear problems. As an example, a beam with arbitrary variable cross section acted on by a compressive axial load is used to show its validity and effectiveness. This approach provides us with great freedom to transfer the original nonlinear buckling equation with variable coefficients into an infinite number of linear differential equations with constant coefficients that are much easier to solve. More importantly, it provides us with a convenient way to guarantee the convergence of solution series. As an example, the beam displacement and the critical buckling load can be obtained for arbitrary variable cross sections. The influence of nonuniformity of moment of inertia is investigated in detail and the optimal distributions of moment of inertia are studied. It is found that the critical buckling load of a beam with the optimal distribution of moment of inertia can be approximately 21–22% larger than that of a uniform beam with the same average moment of inertia. Mathematically, this approach is rather general and thus can be used to solve many other linear/nonlinear differential equations with variable coefficients.

We consider families of general two-point quadrature formulae, using the extension of Montgomery’s identity via Taylor’s formula. The formulae obtained are used to present a number of inequalities for functions whose derivatives are from Lp spaces and Bullen-type inequalities.