一个新的最优模糊存储模型

提出一个新的具有积压定单的关于模糊订购量的模糊存储模型.在模糊函数原理下,给出了模糊总存储成本.为了寻找最优解,把最优模糊存储模型转化为双目标最优化模型,利用L ingo8.0求解不等式约束问题,我们发现最优解都是确定的实数.此外,当模糊订购量和模糊总需求都是三角形(或权重均为1/2梯形)模糊数时,我们提出模型的最优解与经典的具有积压定单存储模型具有相同的结果.     

Lie Symmetry and Conserved Quantities for Nonholonomic Vacco Dynamical Systems

In this paper the Lie symmetry and conserved quantities for nonholonomic Vacco dynamical systems are studied. The determining equation of the Lie symmetry for the system is given. The general Hojman conserved quantity and the Lutzky conserved quantity deduced from the symmetry are obtained.     

Single-period Two-product Inventory Model with Reorder and Substitution

In market, excess demands for many products can be met by reorder even during one period, and retailers usually adopt substitution strategy for more benefit. Under the retailer's substitution strategy and permission of reorder, we develop the profits maximization model for the two-substitutable-product inventory problem with stochastic demands and proportional costs and revenues. We show that the objective function is concave and submodular, and therefore the optimal policy exists. We present the optimal conditions for order quantity and provide some properties of the optimal order quantities. Comparing our model with Netessine and Rudi's, we prove that reorder and adoption of the substitution strategy can raise the general profits and adjust down the general stock level.     

Decision methods for linearly ordered Heyting algebras

The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable; a simple solution is here presented, inspired by related ideas in Gödel-Dummett logic.     

Tiled Orders and Frobenius Rings

Mathematical Notes -     

OnQ-order andR-order of convergence

We give sufficient conditions for a sequence to have theQ-order and/or theR-order of convergence greater than one. If an additional condition is satisfied, then the sequence has an exactQ-order of convergence. We show that our results are sharp and we compare them with older results.This work was supported in part by the National Science Foundation under Grant No. DMS-85-03365. The author wishes to thank J. E. Dennis and R. A. Tapia for helpful comments, and the referee for pointing out a number of typographical and mathematical errors in the original version of this paper.     

基于顺序形态变换的生物芯片图像网格化

生物芯片图像网格化是对由生物芯片扫描得到的荧光成像中的信号(Foreground)和背景(Background)进行划分,以便提取各点的吸光度值、面积和吸光度比等荧光点的数据。网格化的准确与否决定了数据提取的正确性。提出了一种运用顺序形态变换理论实现生物芯片荧光图像网格化的方法,通过对百分位值在0~1之间的顺序形态进行变换,可实现像素灰度的极小值、中间值等多刻度值的灰度取值运算。理论分析表明,该算法能够识别信号与背景的边界,可去除噪声等非边界信息,能判断信号区域,可确定荧光点的边界和范围,可实现荧光点阵图像的网格化。试验结果表明,该算法对不同信噪比的荧光图像来说有很强的适应性,可用于高密度生物芯片图像的处理。     

线性规划问题的一种新的摄动法

在用单纯形方法解线性规划的问题时，不可避免会出现退化情况，而某些退化情况会导致循环。目前采用的避免循环的方法一共有两类：传统的摄动法（字典序）和Bland方法。本分析了传统摄动法的一些不足，给出了一种新的摄动法。     

对G.Ladas的一个开问题的解答

本文获得了一个高阶非线性差分方程具有无界正解的充分条件，所得结果解决了G.Ladas提出的一个开问题。     

一类非线性常微分方程振荡解的渐近表示

在本文中,我们讨论了非线性常微分方程y"=a0|x|αy3 a1|x|βy2 α2|x|γy α3|x|δ振荡解的渐近表示．在这个方程中将α0,α,α1,β,α2,γ,α3,δ分别换成0,0,6,0,0,0,sgn(x),1就是著名的第一类Painleve方程,而将α0,α,α1,β,α2,γ,α3,δ分别换成2,0,0,0,sgn(x),1,α0,就是著名的第二类Painleve方程．当α0,α,α1,β,α2,γ,α3,δ分别换成-β/3γ,0,0,0,1/γ,1,α,0时,可用于组合KdV方程孤立子解的化简．