An analysis is developed for the behaviour of a cloud of cavitation bubbles during both the growth and collapse phases. The theory is based on a multipole method exploiting a modified variational principle developed by Miles [“Nonlinear surface waves in closed basins”, J. Fluid Mech.75 (1976) 418–448] for water waves. Calculations record that bubbles grow approximately spherically, but that a staggered collapse ensues, with the outermost bubbles in the cloud collapsing first of all, leading to a cascade of bubble collapses with very high pressures developed near the cloud centroid. A more complex phenomenon occurs for bubbles of variable radius with local zones of collapse, with a complex frequency spectrum associated with each individual bubble, leading to both local and global collective behaviour.

In this paper, we study the Steiner 2-edge connected subgraph polytope.We introduce a large class of valid inequalities for this polytope calledthe generalized Steiner F-partition inequalities, that generalizesthe so-called Steiner F-partition inequalities. We show that theseinequalities together with the trivial and the Steiner cutinequalities completely describe the polytope on a class of graphsthat generalizes the wheels. We also describe necessary conditions forthese inequalities to be facet defining, and as a consequence, weobtain that the separation problem over the Steiner 2-edge connectedsubgraph polytope for that class of graphs can be solved in polynomialtime. Moreover, we discuss that polytope in the graphs that decomposeby 3-edge cutsets. And we show that the generalized SteinerF-partition inequalities together with the trivial and the Steinercut inequalities suffice to describe the polytope in a class of graphsthat generalizes the class of Halin graphs when the terminals have aparticular disposition. This generalizes a result of Barahona andMahjoub [4] for Halin graphs. This also yields apolynomial time cutting plane algorithm for the Steiner 2-edgeconnected subgraph problem in that class of graphs.


We deal here with a scheduling problem GPPCSP (Generalized Parallelism and Preemption Constrained Scheduling Problem) which is an extension of both the well-known Resource Constrained Scheduling Problem and the Scheduling Problem with Disjunctive Constraints. We first propose a reformulation of GPPCSP: according to it, solving GPPCSP means finding a vertex of the Feasible Vertex Subset of an Antichain Polyhedron. Next, we state several theoretical results related to this reformulation process and to structural properties of this specific Feasible Vertex Subset (connectivity, ...). We end by focusing on the preemptive case of GPPCSP and by identifying specific instances of GPPCSP which are such that any vertex of the related Antichain Polyhedron may be projected on its related Feasible Vertex Subset without any deterioration of the makespan. For such an instance, the GPPCSP problem may be solved in a simple way through linear programming.

The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast O(m⋅log(n)) time complexity algorithm for solving this problem is presented, where m is the number of arcs and n is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The algorithm proposed can be adapted to solve this problem, too. The inverse minimum flow problem considering l ∞ norm is also studied.

Some new Gronwall–Ou-Iang type integral inequalities in two independent variables are established. We also present some of its application to the study of certain classes of integral and differential equations.

In this note, we strengthen the inapproximation bound of O(logn) for the labeled perfect matching problem established in J.Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters96 (2005) 81–88, using aself improving operation in some hard instances. It is interestingto note that this self improving operation does not work for allinstances. Moreover, based on this approach we deduce that theproblem does not admit constant approximation algorithms forconnected planar cubic bipartite graphs.

Dans cet article nous proposons une nouvelleméthode d'initialisation du problème de transportclassique. Cette méthode est basée sur le principe d'uneaffectation seulement si nécessaire. Elle donne de bonsrésultats etsouvent la solution optimale.

We study the finite projective planes with linear programmingmodels. We give a complete description of the convex hull of thefinite projective planes of order 2. We give some integer linearprogramming models whose solution are, either a finiteprojective (or affine) plane of order n, or a (n+2)-arc.

A Riesz space-fractional reaction–dispersion equation (RSFRDE) is obtained from the classical reaction–dispersion equation (RDE) by replacing the second-order space derivative with a Riesz derivative of order β∈(1,2]. In this paper, using Laplace and Fourier transforms, we obtain the fundamental solution for a RSFRDE. We propose an explicit finite-difference approximation for a RSFRDE in a bounded spatial domain, and analyse its stability and convergence. Some numerical examples are presented.

The finite difference solution of the Dirichlet problem on rectangles when a boundary function is given from C1,1 is analyzed. It is shown that the maximum error for a nine-point approximation is of the order of O(h2(|ln  h|+1)) as a five-point approximation. This order can be improved up to O(h2) when the nine-point approximation in the grids which are a distance h from the boundary is replaced by a five-point approximation (“five and nine”-point scheme). It is also proved that the class of boundary functions C1,1 used to obtain the error estimations essentially cannot be enlarged. We provide numerical experiments to support the analysis made. These results point at the importance of taking the smoothness of the boundary functions into account when choosing the numerical algorithms in applied problems.

A new sharp L2 inequality of Ostrowski type is established, which provides some other interesting results as special cases. Applications in numerical integration are also given.

The computation of leastcore and prenucleolus is an efficient way ofallocating a common resource among n players. It has, however,the drawback being a linear programming problem with2n - 2 constraints. In this paper we showhow, in the case of convex production games, generate constraints by solving small sizelinear programming problems,with both continuous and integer variables. The approach is extended to games with symmetries (identical players), and to games with partially continuous coalitions. We also study thecomputation of prenucleolus, and display encouraging numerical results.

In this paper we establish necessary as well assufficient conditions for a given feasible point to be a globalminimizer of smooth minimization problems with mixed variables.These problems, for instance, cover box constrained smooth minimizationproblems and bivalent optimization problems. In particular, ourresults provide necessary global optimality conditions for differenceconvex minimization problems, whereas our sufficient conditionsgive easily verifiable conditions for global optimality of variousclasses of nonconvex minimization problems, including the class ofdifference of convex and quadratic minimization problems. Wediscuss numerical examples to illustrate the optimalityconditions

Let M be an n-dimensional space-like hypersurface in a locally symmetric Lorentz space, with n(n−1)R=κH(κ>0) and satisfying certain additional conditions on the sectional curvature. Denote by S and H the squared norm of the second fundamental form and the mean curvature of M, respectively. We show that if the mean curvature is nonnegative and attains its maximum on M, then:

1. (1) if H2<4(n−1)c/n2, M is totally umbilical;

2. (2) if H2=4(n−1)c/n2, M is totally umbilical or is an isoparametric hypersurface;

3. (3) if H2>4(n−1)c/n2 and S satisfies some pinching conditions, M is totally umbilical or is an isoparametric hypersurface.

The hyper-Wiener index of a connected graph G is defined as , where V (G) is the set of all vertices of G and d(u,v) is the distance between the vertices u,v∈V (G). In this paper we find an exact expression for the hyper-Wiener index of TUHC6[2p,q], the zigzag polyhex nanotube.

An algorithm for enumerating all nondominated vectors of multiple objectiveinteger linear programs is presented. The method tests different regionswhere candidates can be found using an auxiliary binary problem for trackingthe regions already explored. An experimental comparision with our previousefforts shows the method has relatively good time performance.

The steady response of the free surface of a fluid in a porous medium is considered during extraction of the fluid through a line sink. A conformal-mapping approach is used to derive exact solutions to a family of problems in which the line sink is placed at the apex of a wedge-shaped impermeable base, including the limiting cases of an unbounded aquifer and a flat-bottomed aquifer of finite depth. Both critical cusp solutions and sub-critical solutions are computed exactly as Fourier sine series.

We give here some extensions of inequalities of Popoviciu and Rado. The idea is to use an inequality [C. P. Niculescu and L. E. Persson, Convex functions. Basic theory and applications (Universitaria Press, Craiova, 2003), Page 4] which gives an approximation of the arithmetic mean of n values of a given convex function in terms of the value at the arithmetic mean of the arguments. We also give more general forms of this inequality by replacing the arithmetic mean with others. Finally we use these inequalities to establish similar inequalities of Popoviciu and Rado type.

There has recently been considerable interest in the stability of stochastic differential equations with Markovian switching, and a number of results have been achieved. However, due to the exponential sojourn time of Markovian chain at each state, there are many restrictions on existing results for practical application. In this paper, we explore the problem of stability in distribution of nonlinear systems with time-varying delays and semi-Markov switching. Unlike existing models, the new model takes into account noise, time-varying delays and semi-Markov switching. By means of stochastic analysis, functional analysis and inequality techniques, sufficient conditions are obtained to guarantee the stability of the systems concerned. The proposed results are new and extend existing ones.

We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic with A0,A1∈𝒞n×n and (where or H). The perturbation of eigenvalues in the context of general matrix polynomials, palindromic pencils, (semi-Schur) anti-triangular canonical forms and differentiation is discussed.