Case of a Boltzmann gas leading to the Smoluchowski coagulation equation

A special model of a rarefied hard-sphere gas is considered. The hard-sphere particles undergo absolutely elastic collisions. It is assumed that particles can collide only if their nonzero velocities are orthogonal to each other. The model makes it possible to proceed from the Boltzmann equation to the Smoluchowski coagulation equation, where coagulation means that the kinetic energies of the colliding particles are added. A Monte Carlo scheme for simulation of the phenomenon is described, and the convergence of the simulation algorithm is proved. The convergence of numerical results to exact solutions of the Smoluchowski equation and to finite-difference solutions is tested.     

Optimal production and rationing decisions in supply chains with information sharing

This paper considers a two-echelon capacitated supply chain with two non-identical retailers and information sharing. We characterize the optimal inventory policies. We also study the benefits of the optimal stock rationing policy over the first come first served (FCFS) and the modified echelon-stock rationing (MESR) policies.     

A Relaxation Scheme for Solving the Boltzmann Equation Based on the Chapman-Enskog Expansion

Abstract In [16] a visco-elastic relaxation system, called the relaxed Burnett system, was proposed by Jinand Slemrod as a moment approximation to the Boltzmann equation. The relaxed Burnett system is weaklyparabolic, has a linearly hyperbolic convection part, and is endowed with a generalized eotropy inequality. Itagrees with the solution of the Boltzmann equation up to the Burnett order via the Chapman-Enskog expansion. We develop a one-dimensional non-oscillatory numerical scheme based on the relaxed Burnett system forthe Boltzmann equation. We compare numerical results for stationary shocks based on this relaxation scheme,and those obtained by the DSMC (Direct Simulation Monte Carlo), by the Navier-Stokes equations and bythe extended thermodynamics with thirteen moments (the Grad equations). Our numerical experiments showthat the relaxed Burnett gives more accurate approximations to the shock profiles of the Boltzmann equationobtained by the DSMC, for a range of Mach numbers for hypersonic flows, th     

带跳的非线性随机微分方程的Lyapunov指数的估计

本文研究了带跳的非线性随机微分方程Lyapunov指数的估计,在适当的条件下,确定其Lyapunov指数q的值．对于给定的步长h,考虑此微分系统的Euler离散化模型,给出了的理论误差估计.     

Higher-order implicit strong numerical schemes for stochastic differential equations

Higher-order implicit numerical methods which are suitable for stiff stochastic differential equations are proposed. These are based on a stochastic Taylor expansion and converge strongly to the corresponding solution of the stochastic differential equation as the time step size converges to zero. The regions of absolute stability of these implicit and related explicit methods are also examined.     

Fully adaptive multiresolution finite volume schemes for conservation laws

The use of multiresolution decompositions in the context of finite volume schemes for conservation laws was first proposed by A. Harten for the purpose of accelerating the evaluation of numerical fluxes through an adaptive computation. In this approach the solution is still represented at each time step on the finest grid, resulting in an inherent limitation of the potential gain in memory space and computational time. The present paper is concerned with the development and the numerical analysis of fully adaptive multiresolution schemes, in which the solution is represented and computed in a dynamically evolved adaptive grid. A crucial problem is then the accurate computation of the flux without the full knowledge of fine grid cell averages. Several solutions to this problem are proposed, analyzed, and compared in terms of accuracy and complexity.

     

A Representation of a Family of Secret Sharing Matroids

Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing     

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {s_i,t_i} of G, find a minimum set of edges of G whose removal disconnects each s_i from the corresponding t_i. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.     

资源共享方式若干问题的研讨

社会公用服务系统和工程技术系统，存在共同的资源共享问题。本文通过典例就资源共享方式的若干问题加以探究：讨论广义的多用户系统中人工资源共享方式的分类；阐述常用的共享方式的特点、优缺点；分析系统时间性能及其改进与共享方式的关系等。文章还提出在系统工程范畴里，应对社会公用服务和工程技术两类系统的资源共享方式予以综合研究，并相互借鉴和移植。     

Constant Q-curvature metrics in arbitrary dimension

Working in a given conformal class, we prove existence of constant Q-curvature metrics on compact manifolds of arbitrary dimension under generic assumptions. The problem is equivalent to solving a nth-order non-linear elliptic differential (or integral) equation with variational structure, where n is the dimension of the manifold. Since the corresponding Euler functional is in general unbounded from above and below, we use critical point theory, jointly with a compactness result for the above equation.