微极各向同性弹性板中的Rayleigh-Lamb波

研究了无应力作用条件下，均匀、各向同性、圆柱形微极结构弹性板中波的传播．导出了对称和斜对称模式下波传播的特征方程．对短波这一极端情况，无应力圆板中对称和斜对称模态波的特征方程退化为Pmyle曲表面波频率方程．并得到薄板的计算结果．给出了位移和微转动分量，并绘制了相应图形．给出了若干特殊情况的研究结果及对称和斜对称模态特征方程的图示．     

Dirac constraint analysis and symplectic structure of anti-self-dual Yang-Mills equations

We present the explicit form of the symplectic structure of anti-self-dual Yang-Mills (ASDYM) equations in Yang’s J- and K-gauges in order to establish the bi-Hamiltonian structure of this completely integrable system. Dirac’s theory of constraints is applied to the degenerate Lagrangians that yield the ASDYM equations. The constraints are second class as in the case of all completely integrable systems which stands in sharp contrast to the situation in full Yang-Mills theory. We construct the Dirac brackets and the symplectic 2-forms for both J- and K-gauges. The covariant symplectic structure of ASDYM equations is obtained using the Witten-Zuckerman formalism. We show that the appropriate component of the Witten-Zuckerman closed and conserved 2-form vector density reduces to the symplectic 2-form obtained from Dirac’s theory. Finally, we present the Bäcklund transformation between the J- and K-gauges in order to apply Magri’s theorem to the respective two Hamiltonian structures.     

脉冲中立型时滞抛物方程的振动性

本文研究了一类脉冲中立型时滞抛物方程解的振动性及强振动性,获得了此类脉冲中立型时滞抛物方程解振动和强振动的代数判据.     

Kuhn-Tucker条件与线性规划的对偶性

证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系.     

高非线性度向量弹性函数

利用已知弹性函数级联上高非线性度多输出布尔函数的方法构造（n,m,t）弹性函数,其非线性度为2^n-1-2^n-l/2-1＋2^l/2.nlmax（n-l,m,t）,在相同条件下改进了Kurosawa的非线性度2^n-1-2^n-l/2-1.特别地,本文构造了两类具体的向量弹性函数,得到两个不同的非线性度.本文所得函数的非线性度在大多数情况下是比较好的.     

多元线性回归法在互联网网间结算中的应用

本文建立一个理论模型研究互联网互联结算的问题。文章利用多元线性回归法对互联网骨干网运营商(IBPs:Internet Backbone Providers)的网络价值进行评估,利用IBPs各自的网络价值对其交换速率进行加权,从而得出网络价值加权速率,依据这个速率进行结算既可以反映了每个网络对互联的贡献程度,又反映了在互联中对网络资源的被占用程度。     

A new approach based on the surrogating method in the project time compression problems

This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables, and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared by several numerical examples. Computational experience with these data shows the superiority of the new approach.     

Some results on quasipolyhedral convexity

The objective of this paper is to analyze under what well-known operations the class of quasipolyhedral convex functions, which can be regarded as an extension of that of polyhedral convex functions, is closed. The operations that will be considered are those that preserve polyhedral convexity, such that the image and the inverse image under linear transformations, right scalar multiplication (including the case where λ=0⁺) and pointwise addition.      

On the solution of Maxwell's equations in polygonal domains

This paper is concerned with the structure of the singular and regular parts of the solution of time‐harmonic Maxwell's equations in polygonal plane domains and their effective numerical treatment. The asymptotic behaviour of the solution near corner points of the domain is studied by means of discrete Fourier transformation and it is proved that the solution of the boundary value problem does not belong locally to H² when the boundary of the domain has non‐acute angles. A splitting of the solution into a regular part belonging to the space H², and an explicitly described singular part is presented. For the numerical treatment of the boundary value problem, we propose a finite element discretization which combines local mesh grading and the singular field methods and derive a priori error estimates that show optimal convergence as known for the classical finite element method for problems with regular solutions. Copyright © 2006 John Wiley & Sons, Ltd.     

确定线性偏微分方程组可积系统的对合特征集方法

基于Ritt-Wu特征集方法和Riquier-Janet理论,给出一种将线性微分方程组化成简单标准形式的有效算法．该算法通过消去冗余和添加可积条件获得线性微分方程组的完全可积系统(有形式幂级数解)或不相容判定．该算法不仅适用于常系数的线性偏微分方程组,而且对于变系数(以函数为系数)仍然有效．作者还给出了完全可积系统判定定理及其严格证明．