Artificial boundary conditions for Petrovsky systems of second order in exterior domains and in other domains of conical type

The approximation of solutions to boundary value problems on unbounded domains by those on bounded domains is one of the main applications for artificial boundary conditions. Based on asymptotic analysis, here a new method is presented to construct local artificial boundary conditions for a very general class of elliptic problems where the main asymptotic term is not known explicitly. Existence and uniqueness of approximating solutions are proved together with asymptotically precise error estimates. One class of important examples includes boundary value problems for anisotropic elasticity and piezoelectricity. Copyright © 2004 John Wiley & Sons, Ltd.     

Covering vertices of a graph by k disjoint cycles

Let d, k and n be three integers with k3, d4k−1 and n3k. We show that if d(x)+d(y)d for each pair of nonadjacent vertices x and y of a graph G of order n, then G contains k vertex-disjoint cycles converting at least min{d,n} vertices of G.     

多小波子空间上的单小波表示

本文在较弱的条件下,建立了2重多小波子空间与单小波子空间的关系.即由2重多小波构造出单小波.一方面,这种单小波的平移伸缩与2重多小波的平移伸缩生成的子空间是完全相同的;另一方面,它具有插值性.因此通过构造出的单小波建立了多小波子空间上的Shannon型采样定理.     

Mean curvature flows and isotopy of maps between spheres

Let f be a smooth map between unit spheres of possibly different dimensions. We prove the global existence and convergence of the mean curvature flow of the graph of f under various conditions. A corollary is that any area‐decreasing map between unit spheres (of possibly different dimensions) is isotopic to a constant map. © 2004 Wiley Periodicals, Inc.     

Nowhere zero 4‐flow in regular matroids

Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K₅‐minor has a nowhere zero 4‐flow. Walton and Welsh 19 proved that if a coloopless regular matroid M does not have a minor in {M(K_3,3), M*(K₅)}, then M admits a nowhere zero 4‐flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K₅), M*(K₅)}, then M admits a nowhere zero 4‐flow. Our result implies the Jensen and Toft conjecture. © 2005 Wiley Periodicals, Inc. J Graph Theory     

A grid‐free upwind relaxation scheme for inviscid compressible flows

A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd.     

神经网络法计算镉（Ⅱ）,羟基及碳酸根三元体系的形态分布

采用前馈线笥网络ＢＰ算法，计算了Ｃｄ６２＋－ＯＨ＾－ＣＯ＾２－３三元体系的累积稳定常数。用Ｈｏｐｆｉｅｌｄ反馈网络研究了体系中络合物的形态分布。溶液中溶解的ＣＯ２对ｌｇβ１的计算结果有重要影响，对ｌｇβ２，ｌｇβ３，ｌｇβ４的结果影响不大。     

A Faster Deterministic Maximum Flow Algorithm

Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with n nodes and m edges in O(mn + n² log²n) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We give a version of their algorithm where a general version of their game arises. Then we give a strategy for the game that yields a deterministic algorithm for computing the maximum flow in a directed graph with n nodes and m edges that runs in time O(mn(log_{m/n log n}n)). Our algorithm gives an O(mn) deterministic algorithm for all m/n = Ω(n^ε) for any positive constant ε, and is currently the fastest deterministic algorithm for computing maximum flow as long as m/n = ω(log n).