On air traffic flow management with rerouting. Part II: Stochastic case

We present a framework for modeling multistage mixed 0-1 problems for the air traffic flow management problem with rerouting (ATFMRP) under uncertainty in the airport arrival and departure capacity, the air sector capacity and the flight demand. The model allows for flight cancelation, if necessary. It considers several types of objective functions to minimize, namely, total ground and air holding cost, penalization of the alternative routes to the scheduled one for each flight, delay cost for the flights to arrive to the airports and the air sector nodes, and penalization for advancing the arrival of the flights to the airport over the scheduled period. A scenario tree based scheme is used to represent the Deterministic Equivalent Model (DEM) of the stochastic mixed 0-1 program with full recourse. The nonanticipativity constraints that equate the so named common 0-1 and continuous variables from the same group of scenarios in each period are implicitly satisfied in the compact representation of DEM. Some computational experience is reported for medium-scale instances. The model is so tight that none of the instances of the testbed but two of them requires to execute the branch-and-cut phase of the MIP optimization engine of choice.     

The heat equation and reflected Brownian motion in time-dependent domains.: II. Singularities of solutions

We study the space-time Brownian motion and the heat equation in non-cylindrical domains. The paper is mostly devoted to singularities of the heat equation near rough points of the boundary. Two types of singularities are identified—heat atoms and heat singularities. A number of explicit geometric conditions are given for the existence of singularities. Other properties of the heat equation solutions are analyzed as well.     

New exact solutions to the (2 + 1)-dimensional Ito equation: Extended homoclinic test technique

Exact soliton solutions to the (2 + 1)-dimensional Ito equation are studied based on the idea of extended homoclinic test and bilinear method. Some explicit solutions, such as triangle function solutions, soliton solutions, doubly-periodic wave solutions and periodic solitary wave solutions, are obtained. It shows that the (2 + 1)-dimensional Ito equation has richer solutions. Besides, the elastic interactions of the solutions and their corresponding physical meaning are discussed.     

On nonatomic submeasures on . II

It is shown that if two submeasures on that are lim sup's of sequences of measures have the same zero sets, and one is nonatomic, so is the other, and they are (ε-δ)-equivalent. Moreover, if a submeasure η is the lim sup of a sequence of lower semi-continuous (lsc) submeasures and is 0-dominated by the so-called core γ^• of an lsc submeasure γ, then η is also (ε-δ)-dominated by γ^•. And if a submeasure η of this type is 0-dominated by a nonatomic submeasure, then it is nonatomic as well.     

Stochastic functional differential equations with infinite delay

The stability and boundedness of the solution for stochastic functional differential equation with finite delay have been studied by several authors, but there is almost no work on the stability of the solutions for stochastic functional differential equations with infinite delay. The main aim of this paper is to close this gap. We establish criteria of pth moment ψγ(t)-bounded for neutral stochastic functional differential equations with infinite delay and exponentially stable criteria for stochastic functional differential equations with infinite delay, and we also illustrate the result with an example.     

Recursive algorithm for the reliability of a connected-(1, 2)-or-(2, 1)-out-of-(m, n):F lattice system

The connected-(1, 2)-or-(2, 1)-out-of-(m, n):F lattice system is included by the connected-X-out-of-(m, n):F lattice system defined by Boehme et al. [Boehme, T.K., Kossow, A., Preuss, W., 1992. A generalization of consecutive-k-out-of-n:F system. IEEE Transactions on Reliability 41, 451–457]. This system fails if and only if at least one subset of connected failed components occurs which includes at least a (1, 2)-matrix (that is, a row and two columns) or a (2, 1)-matrix(that is, two rows and a column) of failed components. This system is applied to two-dimensional network problems with adjacent constraints, and various systems, for example, a supervision system, etc.     

Lump solutions and interaction solutions for (2+1)-dimensional KPI equation

The lump solutions and interaction solutions are mainly investigated for the (2+1)-dimensional KPI equation. According to relations of the undetermined parameters of the test functions, the N-soliton solutions are showed by computations of the Maple using the Hirota bilinear form for(2+1)-dimensional KPI equation. One type of the lump solutions for (2+1)-dimensional KPI equation has been deduced by the limit method of the N-soliton solutions. In addition, the interaction solutions between the lump and N-soliton solutions of it are studied by the undetermined interaction functions. The sufficient conditions for the existence of the interaction solutions are obtained. Furthermore, the new breather solutions for the (2+1)-dimensional KPI equation are considered by the homoclinic test method via new test functions including more parameters than common test functions.     

Solutions for an operator equation under the conditions of pairs of paralleled lower and upper solutions

In this paper, under the condition of two pairs of strict lower and upper solutions and using the concept of (e₁,B)-limit increasing operator, some multiplicity results for an operator equation are obtained by the method of the fixed point index.     

Asymptotic approximations for second-order linear difference equations in Banach algebras, II

A Liouville-Green (WKB) asymptotic approximation theory is developed for some classes of linear second-order difference equations in Banach algebras. The special case of linear matrix difference equations (or, equivalently, of second-order systems) is emphasized. Rigorous and explicitly computable bounds for the error terms are obtained, and this when both, the sequence index and some parameter that may enter the coefficients, go to infinity. A simple application is made to orthogonal matrix polynomials in the Nevai class.     

Schurian vector space categories, hereditary algebras and Roiter's norm

We associate a positive real number to any vector space K-category over a field K. Generalizing a result of Nazarova and Roiter, we show that a schurian vector space K-category is representation-finite if and only if is finite and . Such vector space categories are quasilinear, i.e. its indecomposables are simple modules over their endomorphism ring. Recently, Nazarova and Roiter introduced the concept of -faithful poset in order to clarify the structure of critical posets. Their conjecture on the precise form of -faithful posets was established by Zeldich. We generalize these results and characterize -faithful quasilinear vector space K-categories in terms of a class of hereditary algebras H_ρ(D) parametrized by a skew-field D and a rational number ρ1.     

The expected discounted penalty function under a risk model with stochastic income

Quantities of interest in ruin theory are investigated under the general framework of the expected discounted penalty function, assuming a risk model where both premiums and claims follow compound Poisson processes. Both a defective renewal equation and an integral equation satisfied by the expected discounted penalty function are established. Some implications that these equations have on particular quantities such as the discounted deficit and the probability of ultimate ruin are illustrated. Finally, the case when premiums have Erlang(n,β) distribution and the distribution of the claims is arbitrary is investigated in more depth. Throughout the paper specific examples where claims and premiums have particular distributions are provided.     

The behavior of best -approximations as . A counterexample of convergence

In the space of summable sequences we give an example of a one-dimensional affine subspace C such that the best L_p-approximations of 0 from C fail to converge as p↓1. We thus give an answer to this problem of convergence in infinite measure spaces.     

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Let be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear equality constraints. In this paper, we present QCR, a general method to reformulate into an equivalent 0-1 program with a convex quadratic objective function. The reformulated problem can then be efficiently solved by a classical branch-and-bound algorithm, based on continuous relaxation. This idea is already present in the literature and used in standard solvers such as CPLEX. Our objective in this work was to find a convex reformulation whose continuous relaxation bound is, moreover, as tight as possible. From this point of view, we show that QCR is optimal in a certain sense. State-of-the-art reformulation methods mainly operate a perturbation of the diagonal terms and are valid for any {0,1} vector. The innovation of QCR comes from the fact that the reformulation also uses the equality constraints and is valid on the feasible solution domain only. Hence, the superiority of QCR holds by construction. However, reformulation by QCR requires the solution of a semidefinite program which can be costly from the running time point of view. We carry out a computational experience on three different combinatorial optimization problems showing that the costly computational time of reformulation by QCR can however result in a drastically more efficient branch-and-bound phase. Moreover, our new approach is competitive with very specific methods applied to particular optimization problems.     

Full-rank representations of {2, 4}, {2, 3}-inverses and successive matrix squaring algorithm

We present the full-rank representations of {2, 4} and {2, 3}-inverses (with given rank as well as with prescribed range and null space) as particular cases of the full-rank representation of outer inverses. As a consequence, two applications of the successive matrix squaring (SMS) algorithm from [P.S. Stanimirovi?, D.S. Cvetkovi?-Ili?, Successive matrix squaring algorithm for computing outer inverses, Appl. Math. Comput. 203 (2008) 19-29] are defined using the full-rank representations of {2, 4} and {2, 3}-inverses. The first application is used to approximate {2, 4}-inverses. The second application, after appropriate modifications of the SMS iterative procedure, computes {2, 3}-inverses of a given matrix. Presented numerical examples clarify the purpose of the introduced methods.     

Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs

A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H of G. A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection receive the same color equals the maximum number of cliques of H with a common vertex, for every induced subgraph H of G. Coordinated graphs are a subclass of perfect graphs. The complete lists of minimal forbidden induced subgraphs for the classes of clique-perfect and coordinated graphs are not known, but some partial characterizations have been obtained. In this paper, we characterize clique-perfect and coordinated graphs by minimal forbidden induced subgraphs when the graph is either paw-free or {gem, W₄, bull}-free, both superclasses of triangle-free graphs.     

Observer synthesis method for Lipschitz nonlinear discrete-time systems with time-delay: An LMI approach

In this paper, we address the problem of observer design for a class of Lipschitz nonlinear discrete-time systems with time-delay. The main contribution lies in the use of a new structure of the proposed observer with a novel Lyapunov-Krasovskii functional. Thanks to these designs, new nonrestrictive synthesis conditions, expressed in terms of linear matrix inequalities (LMIs), are obtained. Indeed, the obtained LMIs contain more degree of freedom than those established by the approaches available in the literature which consider a simple Luenberger observer with a simple Lyapunov function for the stability analysis. An extension of the presented result to H_∞ performance analysis is given in order to take into account the noise (if it exists) affecting the considered system.     

The global Cauchy problem for the NLS and NLKG with small rough data

By using the unit-cube decomposition to the frequency spaces, we study the Cauchy problem for the nonlinear Schrödinger equation and the nonlinear Klein-Gordon equation. Some global well posedness results are obtained for the small Cauchy data in some modulation spaces .     

Letter to the Editor: A note on the preconditioned Gauss-Seidel (GS) method for linear systems

Wen Li (J. Comput. Appl. Math., 182 (2005) 81-90) asserted that there are some errors in article by Hiroshi Niki, Kyouji Harada, Munenori Morimoto and Michio Sakakihara (J. Comput. Appl. Math., 164-165 (2004) 587-600). And Li presented a new proof for the corresponding results in H. Niki et al. In this paper, we point out some errors in Li’s assertion. Moreover, we show that a new proof presented by Li is imperfect.