一类推广后的Feigenbaum函数方程的光滑解

考虑一类推广后的Feigenbaum函数方程｛g（0）=1,-1≤g（x）≤1,x∈[-1,1],h（g（x））=g（g（h（x）））其中h（x）是[-1,1]上的递减光滑奇函数且满足h（0）=0,-1〈h’（x）〈0,z∈[-1,1]．利用构造性方法讨论上述方程的光滑解的存在性及唯一性．     

购买价格递减的在线租赁问题策略设计

运用在线问题与竞争分析的方法研究了购买价格递减的在线租赁问题。通过揭示相关费用函数的性质,先后给出了最优离线策略以及在线策略。通过竞争比分析,证明了我们给出的在线策略是该问题唯一最优策略,而且该策略的竞争比随购买价格的优惠率的增加呈严格递减趋势。竞争分析结果表明考虑购买价格递减因素能够改进在线策略的竞争比从而提高决策效率。     

星三角形识别中的选星策略及实现

构造观测星三角形时,若其中某星像不能与星表存储的导航星对应,则该三角形无法正确匹配。为避免该星像被用于构造其它星三角形影响识别速度,讨论了此时星三角形的选星策略问题。提出了一种同时考虑选星子集相似性与子集中星像亮度两个条件的选星策略,给出了基于相似性排序和权值渐消的实现算法,得到了相邻星三角形选星子集差别最大的结果子集序列。仿真比较了6个星像(内含4颗导航星)时,采用该序列选星与采用参考序列选星,完成正确星图识别所需的最大选择次数,结果表明两者最大相差6,平均相差1。设定不同星像个数和导航星个数时两序列相差结果,平均约为1。说明该子集序列对提高星图识别速度是有价值的。     

单调函数的列表判别法

本文讨论了单调函数和函数的最小列表，在此基础上提出单调函数、单调递增函数和单调递减函的列表判别方法，并举例说明了判别过程。     

Enhanced Compression of Fundamental Solitons in Dispersion Decreasing Fibers with Negative Third-order Dispersion Ⅱ. Effects of Fiber Characteristics and Initial Soliton Width

Previous work have shown that the combined effects of negative third-order dispersion (TOD) and Raman self-scattering (RSS) can significantly enhance soliton compression in dispersion decreasing fibers (DDFs). In this paper, the effects of the negative TOD coefficient and the effective amplification of DDF′s on the performance of soliton compression are investigated. It is shown that for a given initial soliton width and a given effective amplification, there exists an optimum value of the negative TOD coefficient of the DDF at which the enhancement in soliton compression is maximum. It is also shown that the compression enhancement saturates when the effective amplification exceeds a certain value, which has been explained as a compromise between the higher-order effects induced increase of the ratio of input to output group-velocity dispersion coefficients of the DDF and the TOD induced non-adiabatic compression characteristics. The dependence of the compression enhancement on the initial soliton width have also be studied and the scheme is found works well for solitons with initial widths less than 3 ps.     

乘积空间中减算子不动点的存在唯一性定理

研究了乘积空间中严格集压缩减算子不动点存在唯一性问题,在弱连续的条件下,得到了不动点的存在唯一性和迭代收敛性.并给出了它的应用.     

Bounds to optimal burn‐in and optimal work size

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd.     

线性规划的约束条件“滚雪球”算法

为使线性规划的每个约束条件部分或全部地拥有原整个约束条件所包含的信息,将线性规划的约束条件“滚雪球”后得到与原约束条件等价的新约束条件,对新约束条件所构成的线性规划采用目标函数最速递减算法.有一定规模的随机数值算例显示了该算法只需进行m(约束条件数)次迭代即可求得最优解.