改进的移动最小二乘法

近年来发展的无网格方法大多采用移动员小二乘法来构造试函数，而应用移动最小二乘法形成的方程组有时会是病态的甚至奇异的，从而限制了它的发展和应用。本文采用带权正交函数作为基函数对移动最小二乘法做了改进，避免出现病态方程组，且在计算过程中不需要进行短阵求逆运算，提高了计算速度。之后，借鉴牛顿法、平衡法和摄动法对由移动最小二乘法得到的非线性代数方程组提出了新的求解方法。     

图的邻点全和可区别全染色

设f:V(G)∪E(G)→{1,2,…,k}是图G的一个正常k-全染色。令■其中N(x)={y∈V(G)|xy∈E(G)}。对任意的边uv∈E(C),若有Φ(u)≠Φ(v)成立,则称f是图G的一个邻点全和可区别k-全染色。图G的邻点全和可区别全染色中最小的颜色数k叫做G的邻点全和可区别全色数,记为f tndi∑(G)。本文确定了路、圈、星、轮、完全二部图、完全图以及树的邻点全和可区别全色数,同时猜想:简单图G(≠K2)的邻点全和可区别全色数不超过△(G)+2。     

A note on a result by M. Bognár concerning the Hahn--Mazurkiewicz Theorem

Summary In this note we use Theorem 2.4 in<span lang=EN-US style='font-size:10.0pt;mso-ansi-language:EN-US'>[1]to give a very short proof of a recent result due to M. Bognár (Theorem A in [3]). We also prove that Bognár's result is in fact equivalent to the classical Hahn-Mazurkiewicz Theorem. Finally we give generalizations in the non-compact setting.     

The categoricity of the group of all computable automorphisms of the rational numbers

We prove that there is a first-order sentence ϕ such that the group of all computable automorphisms of the ordering of the rational numbers is its only model among the groups that are embeddable in the group of all computable permutations. Supported by a Scheme 2 grant from the London Mathematical Society. __________ Translated from Algebra i Logika, Vol. 46, No. 5, pp. 649–662, September–October, 2007.     

Strict inequalities for the derivatives of functions satisfying certain boundary conditions

For functions satisfying the boundary conditions

Approximate first-order and second-order directional derivatives of a marginal function in convex optimization

Given a convex functionf: ^p × ^q (–, +], the marginal function is defined on ^p by (x)=inf{f(x, y)|y ^q }. Our purpose in this paper is to express the approximate first-order and second-order directional derivatives of atx ₀ in terms of those off at (x ₀,y ₀), wherey ₀ is any element for which (x ₀)=f(x ₀,y ₀).The author is indebted to one referee for pointing out an inaccuracy in an earlier version of Theorem 4.1.     

Relationship between the 2-body Parameters of the Biswas-Hamann and the Bauer-Maysenholder-Seeger Potential Functions

A theoretical relation between the Bauer-Maysenholder-Seeger (BMS) and the Biswas-Hamann (BH) potential function has been developed herein for the case of 2-body interaction. By equating derivatives of these two potential functions for the 2-body part, a loose form of BMS is expressed in terms of BH parameters with a scaling factor. The validity of the developed parametric relationships has been graphically demonstrated, and the suitability discussed with reference to the extent and direction of bond distortion.     

四维相空间中非中心势动力学系统的Poisson 结构和Casimir 函数

将非中心势动力学系统的运动微分方程写成Ermakov形式，得到Ermakov不变量. 运用Hamilton理论，把Ermakov不变量当作Hamiltonian 函数，在四维相空间中建立了非中心势动力学系统的Poisson 结构。结果表明：此Poisson 结构是一退化的结构，而系统具有四个不变量，即Hamiltonian 函数，Ermakov不变量及两个Casimir函数。     

Contracted polarization functions for B to Ar

Using optimal exponents for B through Ne given by Dunning and those for Al through Ar by Woon and Dunning, d-type contracted polarization functions (2d/1d), (3d/1d), and (3d/2d) are generated from natural orbitals of atomic single and double excitation configuration interaction (SDCI) calculations, where the numbers before and after the slash are those of the primitive and contracted Gaussian type functions. The resulting contracted functions are tested on N₂ and P₂ molecules by self-consistent field and SDCI calculations, which clarify characteristics of the present polarization functions. Received: 5 June 1997 / Accepted: 20 August 1997     

Control of multi-node mobile communications networks with time-varying channels via stability methods

Consider a communications network consisting of mobiles and random external data processes, each destined to a particular destination. Each mobile can serve as a node in the multi-hop path from source to destination. At each mobile the data is queued according to the source destination pair. The quality of the connecting channels are randomly varying. Time is divided into small scheduling intervals. At the beginning of each interval, the channels are estimated and this information is used for the decisions concerning allocation of transmission power and/or time, bandwidth, and perhaps antennas, in a queue and channel-state dependent way. Under a natural (and “almost” necessary) “average flow” condition, stochastic stability methods are used to develop scheduling policies that assure stability. The policies are readily implementable and allow a range of tradeoffs between current rates and queue lengths, under very weak conditions. Because of the non-Markovian nature of the problem, we use the perturbed Stochastic Liapunov function method. The choice of Liapunov function allows a choice of the effective performance criteria. All essential factors are incorporated into a “mean rate” function, so that the results cover many different systems. Extensions concerning acknowledgments, multicasting, non-unique routes, and others are given to illustrate the versatility of the method, and a useful method for getting the a priori routes is discussed.