Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

Commuting and stable feedback design for switched linear systems

In the paper, commuting and stable feedback design for switched linear systems is investigated. This problem is formulated as to build up suitable state feedback controller for each subsystem such that the closed-loop systems are not only asymptotically stable but also commuting each other. A new concept, common admissible eigenvector set (CAES), is introduced to establish necessary/sufficient conditions for commuting and stable feedback controllers. For second-order systems, a necessary and sufficient condition is established. Moreover, a parametrization of the CAES is also obtained. The motivation comes from stabilization of switched linear systems which consist of a family of LTI systems and a switching law specifying the switching between them, where if all the subsystems are stable and commuting each other, then the total system is stable under arbitrary switching.     

Localization effects and measure source terms in numerical schemes for balance laws

This paper investigates the behavior of numerical schemes for nonlinear conservation laws with source terms. We concentrate on two significant examples: relaxation approximations and genuinely nonhomogeneous scalar laws. The main tool in our analysis is the extensive use of weak limits and nonconservative products which allow us to describe accurately the operations achieved in practice when using Riemann-based numerical schemes. Some illustrative and relevant computational results are provided.

     

Probability Interpretation of the Integral of Fractional Order

We establish a relation between stable distributions in probability theory and the fractional integral. Moreover, it turns out that the parameter of the stable distribution coincides with the exponent of the fractional integral. It follows from an analysis of the obtained results that equations with the fractional time derivative describe the evolution of some physical system whose time degree of freedom becomes stochastic, i.e., presents a sum of random time intervals subject to a stable probability distribution. We discuss relations between the fractal Cantor set (Cantor strips) and the fractional integral. We show that the possibility to use this relation as an approximation of the fractional integral is rather limited.     

Stable Ergodicity and Frame Flows

In this note we show that all diffeomorphisms close enough to the time-one map of the frame flow on certain negatively curved manifolds are ergodic. As a simple corollary we deduce that the frame flows are ergodic for all compact manifolds with curvature pinched sufficiently close to –1, thus providing results in the case of manifolds of dimension 7 or 8 which were missing from the results of Brin and Karcher.     

The asymptotic behaviors of a stage-structured autonomous predator-prey system with time delay

In this paper, we consider an autonomous predator-prey Lotka-Volterra system in which individuals in the population may belong to one of two classes: the immatures and the matures, the age to maturity is represented by a time delay. By using eigenvalue analysis, principal term analyze method, reduction to absurdity, and iterative method, we obtain some simple conditions for global asymptotic stability of the unique positive equilibrium point. Moreover, a condition that the prey population in the system get extinction and the predator population in the system get permanence will be obtained. Meanwhile the theorems extend the corresponding conclusions in which there have no two stage structures.     

凸合成模糊对策的模糊稳定集

本建立了凸合成模糊对策的模型，并得到了凸合成模糊对策的模糊稳定集，可由子对策的模糊稳定集表达出来。从而解决了凸合成模糊对策的解的结构问题。     

LES of turbulent heat transfer: proper convection numerical schemes for temperature transport

Large eddy simulations of two basic configurations (decay of isotropic turbulence, and the academic plane channel flow) with heat transfer have been performed comparing several convection numerical schemes, in order to discuss their ability to evaluate temperature fluctuations properly. Results are compared with the available incompressible heat transfer direct numerical simulation data. It is shown that the use of regularizing schemes (such as high order upwind type schemes) for the temperature transport equation in combination with centered schemes for momentum transport equation gives better results than the use of centred schemes for both equations. Copyright © 2004 John Wiley & Sons, Ltd.     

High‐order accurate numerical solutions of incompressible flows with the artificial compressibility method

A high‐order accurate, finite‐difference method for the numerical solution of incompressible flows is presented. This method is based on the artificial compressibility formulation of the incompressible Navier–Stokes equations. Fourth‐ or sixth‐order accurate discretizations of the metric terms and the convective fluxes are obtained using compact, centred schemes. The viscous terms are also discretized using fourth‐order accurate, centred finite differences. Implicit time marching is performed for both steady‐state and time‐accurate numerical solutions. High‐order, spectral‐type, low‐pass, compact filters are used to regularize the numerical solution and remove spurious modes arising from unresolved scales, non‐linearities, and inaccuracies in the application of boundary conditions. The accuracy and efficiency of the proposed method is demonstrated for test problems. Copyright © 2004 John Wiley & Sons, Ltd.