A simple three‐wave approximate Riemann solver for the Saint‐Venant‐Exner equations

Erosion and sediments transport processes have a great impact on industrial structures and on water quality. Despite its limitations, the Saint‐Venant‐Exner system is still (and for sure for some years) widely used in industrial codes to model the bedload sediment transport. In practice, its numerical resolution is mostly handled by a splitting technique that allows a weak coupling between hydraulic and morphodynamic distinct softwares but may suffer from important stability issues. In recent works, many authors proposed alternative methods based on a strong coupling that cure this problem but are not so trivial to implement in an industrial context. In this work, we then pursue 2 objectives. First, we propose a very simple scheme based on an approximate Riemann solver, respecting the strong coupling framework, and we demonstrate its stability and accuracy through a number of numerical test cases. However, second, we reinterpret our scheme as a splitting technique and we extend the purpose to propose what should be the minimal coupling that ensures the stability of the global numerical process in industrial codes, at least, when dealing with collocated finite volume method. The resulting splitting method is, up to our knowledge, the only one for which stability properties are fully demonstrated.     

全球3G市场管制政策分析

主要对各国3G许可证与使用技术标准的抽绑政策．各国对2G／3G网络漫游的管制规定。以及3G网络之间共享的种类及实施方式等方面做了详尽的讲解，并进行比较和分析。     

Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002     

Regular population monotonic allocation schemes

The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets.     

Numerical analysis of the spiral Couette flow of a rarefied gas between coaxial cylinders

An implicit quasi-monotone second-order accurate method is proposed for analyzing the spiral Couette flow of a rarefied gas between coaxial cylinders. The basic advantages of the method over the conventional method of stationry iterations are that the former is conservative with respect to the collision integral, has a simple software implementation for any types of boundary conditions, and applies to a wide range of Knudsen numbers.     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005     

奇异摄动罗宾问题在Bakhvalov-Shishkin网格上的一致收敛有限差分法

考虑一个奇异摄动罗宾问题在Bakhvalov-Shishkin网格上的迎风差分策略,得到在改进的Shishkin网格上迎风策略是关于ε一致的一阶L∞模收敛的.数值实验证实了此理论结果,显示估计是稳健的.     

一种小波域音频信息隐藏方法

提出了一种基于量化的小波域音频隐藏算法，将保密语音隐藏到载体音频中．为提高隐藏重和保密语音传输的安全性，对保密语音进行了小波域压缩编码和m序列的扩频调制，生成待隐藏的比特序列；通过量化方法，将编码和调制后的保密语音隐藏到载体音频的小波系数中；保密语音的恢复过程不需要使用原始音频、仿真结果表明，隐藏有保密语音的载体音频听觉质量没有明显下降，提取的保密语音感知质量较好；该算法对重量化、加噪、低通滤波等攻击均有良好的鲁棒性．     

国内3G网络共享问题之研究

随着国内3G时代的来临，3G网络共享问题越来越受到人们的关注。本文结合国内移动通信的现状，着重分析了3G网络共享的模式及经济效益，论述了3G网络共享的相应策略。     

非线性Schrdinger方程的高精度守恒差分格式

本文首先分析线性Schrodinger方程一种高阶差分格式的构造方法,得到方程的耗散项.在此基础上对三次非线性Schrodinger方程,提出了一种精度为O(r2 h2)的差分格式,证明了该格式保持了连续方程的两个守恒量,且是收敛的与稳定的.并通过数值例子与已有隐格式进行了比较,结果表明,本文格式在计算量类似的情况下,提高了数值精度.