KdV方程对称李代数的伴随表示及其killing型

本文利用群的开拓理论得出了 Kd V方程对称李代数的伴随表示及其 Killing型 .     

On optimal polling policies

In a single-server polling system, the server visits the queues according to a routing policy and while at a queue, serves some or all of the customers there according to a service policy. A polling (or scheduling) policy is a sequence of decisions on whether to serve a customer, idle the server, or switch the server to another queue. The goal of this paper is to find polling policies that stochastically minimize the unfinished work and the number of customers in the system at all times. This optimization problem is decomposed into three subproblems: determine the optimal action (i.e., serve, switch, idle) when the server is at a nonempty queue; determine the optimal action (i.e., switch, idle) when the server empties a queue; determine the optimal routing (i.e., choice of the queue) when the server decides to switch. Under fairly general assumptions, we show for the first subproblem that optimal policies are greedy and exhaustive, i.e., the server should neither idle nor switch when it is at a nonempty queue. For the second subproblem, we prove that in symmetric polling systems patient policies are optimal, i.e., the server should stay idling at the last visited queue whenever the system is empty. When the system is slotted, we further prove that non-idling and impatient policies are optimal. For the third subproblem, we establish that in symmetric polling systems optimal policies belong to the class of Stochastically Largest Queue (SLQ) policies. An SLQ policy is one that never routes the server to a queue known to have a queue length that is stochastically smaller than that of another queue. This result implies, in particular, that the policy that routes the server to the queue with the largest queue length is optimal when all queue lengths are known and that the cyclic routing policy is optimal in the case that the only information available is the previous decisions.This work was supported in part by NSF under Contract ASC-8802764.     

准坐标下完整力学系统的非Noether守恒量——Hojman定理的推广

利用时间不变的无限小变换下的Lie对称性，研究准坐标下完整力学系统的一类新守恒量.建立系统的运动微分方程，给出无限小变换下的Lie对称性确定方程.将Hojman定理推广，并举例说明结果的应用. 关键词： 准坐标 完整力学系统 Lie对称性 非Noether守恒量 Hojman定理     

超高速炸药加速器炮口弹丸速度的测量

炸药驱动器超高速(>3000m/s)弹丸速度的测量是超高速发生器及超高速碰撞现象研究等领域内一个必不可少的环节,本文在传统电测法及X光闪先照相技术的基础上,提出了改进的测量技术,使测量中尽量避免各种因素对测试的干扰,成功地获得了弹丸的炮口速度。实验表明,该技术为超高速驱动器及超高速撞击现象研究提供了一种可靠而方便的测试手段。     

醋酸铜和多氮杂环配体配合物的低热固相合成

室温下 ,醋酸铜分别与 1,2 ,4 三氮唑和苯并三氮唑充分研磨 ,能发生固相配位反应 ,研磨过程有醋酸逸出 ,杂氮配体取代了醋酸与Cu (Ⅱ )配位形成混配配合物 ,元素分析表征表明产物的组成为Cu(C2 H2 N3) (Ac)·H2 O和Cu (C6 H4 N3) (Ac)·H2 O。红外光谱图显示了杂氮配体的 CN ,醋酸的 CO 和水的O—H特征吸收。固相反应为合成新配合物提供了一条快速、温和及不需溶剂的途径。     

可迁图的超常边连通度的最优性

图的超常边连通度是图的边连通度概念的推广,对于n阶点可迁或正则边可迁的简单连通图来说,它的h阶超常边连通度λ_h一定存在(1≤h≤n/2)。本文证明了:当d_-正则的n_-阶点可迁简单连通图满足n≥6,d≥4且围长g≥5时,或d_-正则的n_-阶边可迁简单连通图满足n≥6,d≥4且围长g≥4时,对于任何的h:1≤h≤min{g-1,n/2},λ_h达到其最大可能值,即λ_h=hd-2(h-1)。     

核磁共振磷谱在克林霉素磷酸酯合成中的应用研究

通过核磁共振磷谱对克林霉素磷酸酯合成反应过程进行跟踪，尤其是对克林霉素一氯代磷酸酯的水解情况进行了较为细致的分析，了解了反应中的一些机理问题，并依此确定了反应的最佳条件.     

基态和激发态氧振动光谱的量子力学计算

利用分子势能函数的Murrell-Sorbie和PG函数形式,将时域有限差分法应用基态和激发态氧分子的振动能级的量子力学计算,计算结果令人满意.     

ICP－AES法分析水质的探讨

本文用ＩＣＰ－ＡＥＳ（电感耦合等离子体－原子发射光谱法）测定水中Ａｌ、Ｂ、Ｂａ、Ｂｅ、Ｃａ、Ｃｄ、Ｃｏ、Ｃｒ、Ｃｕ、Ｆｅ、Ｍｇ、Ｍｏ、Ｍｎ、Ｎｉ、Ｐｂ、Ｓｒ、Ｖ、Ｚｎ等１８种微量元素。方法简便、快速，只将样品简单酸化，即可测定。方法检出限为０．０００５－０．５μｇ／ｍＬ。相对标准偏差＜１８％