Almost-Kähler Deformation Quantization

We use a natural affine connection with nontrivial torsion on an arbitrary almost-Kähler manifold which respects the almost-Kähler structure in order to construct a Fedosov-type deformation quantization on this manifold.     

一种抗光扰动的矢量纠偏方法研究

在半球成像系统实时跟踪目标的过程中,从受到光扰动影响的圆环像中迅速准确地提取圆环的中心是一个关键,为了适应半球成像系统跟踪目标的实时性和抗扰性能要求,根据圆的几何对称性,提出了一种矢量纠偏的抗光扰动的圆环中心确定方法,实验结果表明,对于无扰动的圆环图像其误差小于1个像素;对于有扰动的图环像误差不超过5个像素。     

石油基电流变液中链结构的显微观察

利用显微观察技术连续记录了直流与交流电场下石油基电流变液中的显微结构变化,比较了两种电场下成链、链生长、断链的差异,这种差异包括颗粒的运动、链的形状以及断链时有无崩裂现象,并且分析了造成这种差异的原因,认为交流场下出现的链崩裂现象是由约翰逊-拉贝克效应造成的,通过石油基电流变液在直流、20Hz、50Hz三种电场条件下显微链结构的对比,得出结论横跨两极的链总的横截面积是影响剪应力大小的一个重要因素。     

模拟心电原理与变化电场的紧密联系

论述了心电向量环与模拟心电的紧密联系,突出了实验装置盘中心电向量环的医学意义及模拟心电的物理含义,论述了模拟心电原理与变化电场的紧密联系,阐述了实验盘综合变化电场形成的过程,详述了模拟心电图形成的物理机制。     

求解稳恒磁场的谐函数展开法

推导出稳恒磁场矢势的谐函数展开式,当稳恒电流的分布适宜于用直角坐标系表示时,可应用该展开式求解磁场,给出了应用该展开式求解稳恒磁场的例子。     

层次分析法中模糊判断的简化排序方法

本给出了AHP中一种判断为模糊型问题的判断矩阵的建立及排序权重的简化计算方法。     

Study of the stability of polarization mode dispersion in fibre

Polarization mode dispersion (PMD) is the ultimate limitation to high bit-rate fibre communication system. The stability of PMD is very important to its measurement and compensation. This paper puts forward a method to measure the stability of PMD by measuring the stability of the state of polarization (SOP) and introduces the conception of time evolution vector (TEV) of SOP. We observe the fact that the regularity of the principal state of polarization changing with time is the same as other SOPs‘‘, if we neglect the dependence of TEV on wavelength. We also measure the SOP‘‘s stability of some fibres with different lengths, and obtain results of PMD changing with time.     

捷联惯导系统圆锥补偿算法优化设计

高速、高速度的圆锥偿补算法是提高捷联惯性导航系统（ＳＩＮＳ）性能的重要环节。本文对Ｃｈａｎ Ｇｏｏｋ Ｐａｒｋ等提出的新圆锥补偿方法进行了进一步的研究。文中给出了经典圆锥运动的角速度模型,推导出了经典圆锥运动的角增量公式、角增量叉乘公式、圆锥补偿系数方程和误差公式,并将该方法拓展至利用前一圆锥补偿周期角增量和的圆锥补偿算法。     

Game-Theoretic Approach to the Optimization of FDDI Computer Networks1

The problem of maximizing the performance in a fiber distributed data interface (FDDI) computer network is formulated as a cooperative n-player game. Solutions of this game can be obtained by solving special optimization problems. Using the models and formulas developed by Tangemann (Ref. 1) and Klehmet (Ref. 2) for the mean waiting times, the resulting optimization problems are presented and numerical results are given.     

Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming

One way of solving multiple objective mathematical programming problems is finding discrete representations of the efficient set. A modified goal of finding good discrete representations of the efficient set would contribute to the practicality of vector maximization algorithms. We define coverage, uniformity and cardinality as the three attributes of quality of discrete representations and introduce a framework that includes these attributes in which discrete representations can be evaluated, compared to each other, and judged satisfactory or unsatisfactory by a Decision Maker. We provide simple mathematical programming formulations that can be used to compute the coverage error of a given discrete representation. Our formulations are practically implementable when the problem under study is a multiobjective linear programming problem. We believe that the interactive algorithms along with the vector maximization methods can make use of our framework and its tools. Received April 7, 1998 / Revised version received March 1999?Published online November 9, 1999