四边固定变厚度正交各向异性矩形板的非线性非对称弯曲问题的一致有效渐近解

利用“修正的两变量法”和“混合摄动法”,引进4个小参数,对厚度线性变化的正交各向异性矩形板的非线性非对称弯曲问题进行了研究,得到了挠度函数W(x,y)和应力函数Φ(x,y)对ε1为N阶及对ε2为M阶的一致有效渐近解．     

具非线性边界条件的半线性时滞微分方程边值问题奇摄动

利用微分不等式理论研究了一类具非线性边界条件的半线性时滞微分方程边值问题.采用新的方法构造上下解,得到了此边值问题解的存在性的充分条件,并给出了解的一致有效渐近展开式.     

非线性奇摄动边值问题的渐近展开

本文用上下解方法给出了含小参数ε＞０的非线性奇摄动边界问题（１．１）－（１．２）（周期边界问题为其特例）解的一致有效的渐近展开式．     

四边固定正交各向异性矩形板的非线性弯曲问题

本文利用“两变量法”［１］和“混和摄动法”［２］研究了正交各向异性矩形板在非均布横向载荷作用下的非线性弯曲问题，在四边固定条件下，得到了一致有效渐近解．     

Efficient MIP formulation for optimal 1-for-N diversity coding

In the paper we consider a communication network that uses diversity coding in order to achieve reliability. Having a set of demands and a network topology we face a problem of optimal routing of the demands and backup trees, and associations between the demands and the backup trees. We present a compact mixed integer programming (MIP) formulation for the optimization problem, which proves to be more efficient than other approaches that can be found in the literature.     

基于倾向值匹配的干扰数据检测方法

数据中掺杂干扰数据的现象十分常见,对于随机出现的干扰数据处理,目前已有很多方法可以借鉴,但对于人为的干扰数据,若继续使用传统方法,则可能不会达到很好的效果.倾向值可以用一维数值来描述多维数据的特征,且当数据具有相近的倾向值时,其本身常常也很相似,并可能来自同一总体.因此,文章提出一种应用倾向值匹配检测干扰数据的新方法,...     

几何外形和疏密分布对弹簧有效弹性常数的影响

本文首先通过理论推导,建立了计其本身质量的旋转体弹簧所满足的波动方程,运用能量法给出振动弹簧的有效弹性常数。然后导出了弹簧本身质量忽略不计的极限情况下弹簧有效弹性常数的表达式。最后运用泛函极值原理简单讨论了在固定材料以及外形下弹簧圈的疏密如何分布,使弹簧达到最大有效弹性常数的最优化模型。     

The problem of the non-linear unsymmetrical bending for cylindrically orthotropic circular thin plate with variable thickness

I-Intr0ducti0nThebendingproblemofcircularthinplateisimriartantbothintheoryandinengineeringpractice,butbecausethebasicequationsoftheproblemsofnon-linearunsymmetricalbendingf0rcircularthinplate'arenonlineardifferentialequations,itisquitedifficulttoobtainana…     

A recursive procedure to generate all cuts for 0–1 mixed integer programs

We study several ways of obtaining valid inequalities for mixed integer programs. We show how inequalities obtained from a disjunctive argument can be represented by superadditive functions and we show how the superadditive inequalities relate to Gomory's mixed integer cuts. We also show how all valid inequalities for mixed 0–1 programs can be generated recursively from a simple subclass of the disjunctive inequalities.The research of this author was supported by NSF Contract No. ECS-8540898.