Uniqueness for Cesàro summable double Walsh series

We prove a Tauberian theorem for Walsh series of two variables, and use it to obtain several results about uniqueness of Cesàro summable double Walsh series. Namely, we show that up to sets of measure zero, Cesàro summability of double Walsh series is the same as convergence of the square dyadic partial sums and, under a suitable growth condition, that uniqueness holds for Cesàro summable double Walsh series.     

Maximizing revenue in the airline industry under one-way pricing

The paper describes a methodology that has been implemented in a major British airline to find the optimal price to charge for airline tickets under one-way pricing. An analytical model has been developed to describe the buying behaviour of customers for flights over the selling period. Using this model and a standard analytical method for constrained optimization, we can find an expression for the optimal price structure for a flight. The expected number of bookings made on each day of the selling period and in each fare class given these prices can then be easily calculated. A simulation model is used to find the confidence ranges on the numbers of bookings and these ranges can be used to regulate the sale of tickets. A procedure to update the price structure based on the remaining capacity has also been developed.     

Depth profile analysis of polyimide film treated by potassium hydroxide

The structural change in the depth direction of a polyimide (UPILEX‐S) film treated in alkaline solution, which was a representative surface treatment used to form a seed layer for plating and to improve the adhesive strength, was analyzed by means of micro Fourier transform infrared attenuated total reflection (FTIR‐ATR) line analysis with gradient shaving preparation. The polyimide film was treated with KOH. The imide ring opened through the alkaline treatment, and the amide structure and carboxylic acid salt were formed. The attainment depth of this structural change was almost proportional to the treatment time, and it reached about 8 μm after a 30‐min treatment. The degree of structural change through the alkaline treatment was almost constant after it reached a considerably degraded stage, and the chemically changed region penetrated into the inner part of the film from the surface. An intermediate layer before the final degraded stage appeared in the treated layer, and its thickness increased with the treatment time. The region that was changed chemically by the alkaline treatment progressed to the inner part simultaneously and continuously as the treatment time increased. The combined use of gradient shaving preparation and micro FTIR‐ATR line analysis was found to be extremely effective for the depth profiling of organic materials. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 41: 2071–2078, 2003     

A Multidimensional Branch-and-Prune Method for Interval Global Optimization

In this paper a new multidimensional extension of the recently developed one-dimensional enclosure method called kite is given for interval global optimization. A more sophisticated version of the pruning technique based on the kite method is introduced. By the new componentwise approach all the one-dimensional theoretical results and procedures can be used in the higher-dimensional case. The possibilities in the implementation of the new algorithm together with numerical results on 40 standard test problems are presented.     

Exact Solutions of Extended Boussinesq Equations

The problem addressed in this paper is the verification of numerical solutions of nonlinear dispersive wave equations such as Boussinesq-like system of equations. A practical verification tool for numerical results is to compare the numerical solution to an exact solution if available. In this work, we derive some exact solitary wave solutions and several invariants of motion for a wide range of Boussinesq-like equations using Maple software. The exact solitary wave solutions can be used to specify initial data for the incident waves in the Boussinesq numerical model and for the verification of the associated computed solution. The invariants of motions can be used as verification tools for the conservation properties of the numerical model.     

Nonlocality of Reaction-Diffusion Equations Induced by Delay: Biological Modeling and Nonlinear Dynamics

We present a short survey on the biological modeling, dynamics analysis, and numerical simulation of nonlocal spatial effects, induced by time delays, in diffusion models for a single species confined to either a finite or an infinite domain. The nonlocality, a weighted average in space, arises when account is taken of the fact that individuals have been at different points in space at previous times. We discuss and compare two existing approaches to correctly derive the spatial averaging kernels, and we summarize some of the recent developments in both qualitative and numerical analysis of the nonlinear dynamics, including the existence, uniqueness (up to a translation), and stability of traveling wave fronts and periodic spatio-temporal patterns of the model equations in unbounded domains and the linear stability, boundedness, global convergence of solutions and bifurcations of the model equations in finite domains.     

Theory of Linear Dissipative Scattering Systems with Discrete Time and with Space States of the Class π k

An arbitrary operator-valued function from the generalized Shur class is realized as the transfer function of a minimal optimal and minimal *-optimal dissipative scattering system with the Pontryagin state space. These results generalize Arov's results for the case of the Hilbert state space. Bibliography: 11 titles.     

Computation of the Morse Spectrum

The Morse spectrum is a limit set of Lyapunov exponents of periodic pseudo-trajectories. This notion is especially important in the case where a dynamical system has infinitely many periodic trajectories of large period. A method for estimating the Morse spectrum was suggested by the first author in J. Math. Anal. Appl., 252 (2000). This method is based on ideas of symbolic dynamics which reduces the study of a dynamical system to the study of a certain graph, called a symbolic image. Within the framework of this method, the computation of the Morse spectrum is connected with searching simple closed paths and extracting contours with suitable characteristics. However, under iterations of the symbolic image, the number of such paths sharply increases, which leads to huge expenses of memory and time. We suggest an algorithm for constructing contours with the maximal and minimal mean values. This algorithm is based on a special version of the simplex method. Numerical tests are also described. Bibliography: 13 titles. Illustrations: 3 figures.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.