Elliptic fibers over non-perfect residue fields

Kodaira and Néron classified and described the geometry of the special fibers of the Néron model of an elliptic curve defined over a discrete valuation ring with a perfect residue field. Tate described an algorithm to determine the special fiber type by manipulating the Weierstrass equation. In the case of non-perfect residue fields, we discover new fiber types which are not on the Kodaira-Néron list. We describe these new types and extend Tate's algorithm to deal with all discrete valuation rings. Specifically, we show how to translate a Weierstrass equation into a form where the reduction type may be easily determined. Having determined the special fiber type, we construct the regular model of the curve with explicit blow-up calculations. We also provide tables that serve as a simple reference for the algorithm and which succinctly summarize the results.     

线性规划的符号跟踪算法

分析了只含一个约束条件的线性规划最优基变量的特征，将其运用到搜寻含m个约束条件的线性规划的最优基变量，从而提出了线性规划的符号跟踪算法，为线性规划求解提供了新途径。     

Five-step phase-shifting algorithms with unknown values of phase shift

The presented work offers new algorithms for phase evaluation in interferometric measurements. Several phase-shifting algorithms with an arbitrary but constant phase-shift between captured intensity frames are proposed. These phase calculation algorithms need to measure five frames of the intensity of the interference field. The algorithms are similarly derived as so called Carré algorithm. The phase evaluation process then does not depend on the linear phase shift errors. Furthermore, the detailed analysis of the algorithms with respect to most important factors, which affect interferometric measurements, is carried out. It is also studied the dependency of the evaluation algorithms on the phase shift values, and the proposed phase calculation algorithms are compared with respect to the resulting phase errors. The influence of most important factors in the measurement and evaluation process was simulated as systematic and random errors using a proposed mathematical model.     

光学工程分析中的镜面面形处理新方法

光学系统在载荷的作用下会发生变形。基于干涉检验理论,提出了一种先调整后再拟合的处理方法。首先利用下山法计算光学镜面在法线方向的变形;然后利用Zernike多项式拟合变形曲面得到Zernike系数;最后去除刚体位移,作等高线图。新的数据处理方法可以更好的与干涉检验保持一致。对某相机的主镜进行仿真试验,结果表明,下山法计算效率较高,先调整后再拟合的处理结果与干涉检验结果的一致性较好。     

多周期公用工程系统运行的模型,优化方法与应用

针对多周期公用工程系统的运行优化问题，考虑了设备的启停费用的情况下。建立了混合整数非线性规划模型并证明了最优解的存在性。针对该运行优化问题本将其分解成若干子问题，然后利用改进的Hooke-Jeeves优化算法求解每个子问题。应用于具体实例，其数值结果与其它方法得到的相比。运行时间短，且更适合多周期公用工程问题的求解。     

Flow Search Approach and New Bounds for the m-Step Linear Conjugate Gradient Algorithm

A flow search approach is presented in this paper. In the approach, each iterative process involves a subproblem, whose variables are the stepsize parameters. Every feasible solution of the subproblem corresponds to some serial search stages, the stepsize parameters in different search stages may interact mutually, and their optimal values are determined by evaluating the total effect of the interaction. The main idea of the flow search approach is illustrated via the minimization of a convex quadratic function. Based on the flow search approach, some properties of the m-step linear conjugate gradient algorithm are analyzed and new bounds on its convergence rate are also presented. Theoretical and numerical results indicate that the new bounds are better than the well-known ones.     

A fully linear-time approximation algorithm for grammar-based compression

A linear-time approximation algorithm for the grammar-based compression is presented. This is an optimization problem to minimize the size of a context-free grammar deriving a given string. For each string of length n, the algorithm guarantees approximation ratio without suffix tree construction.     

最小费用k度限制树对策

本在Glover—Klingman算法及最小费用支撑树对策的基础上，讨论了最小费用k度限制树对策问题．利用威胁、旁支付理论制订了两种规则，并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解，从而证明了在这两种规则下其核心非空．     

红外图像掠海小目标的检测算法研究

针对红外图像掠海小目标信噪比低，且易受到水天线和背景杂波干扰的特点，提出了一种红外掠海小目标的提取与检测算法。该方法的特点是：首先采用中值滤波来减小噪声，并提出了差方和算法，用以抑制背景噪声并对目标增强；再采用了图像行扫描法有效地滤除水天线；最后通过弱化背景边缘和阈值分割等综合算法得到候选小目标。仿真结果表明，该算法达到了较好的效果。     

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.