卫星数传调度模型研究

卫星数传调度问题是一个具有多时间窗口、多资源约束的优化问题。针对该问题,建立了卫星数传需求模型、任务模型和调度模型。在建模过程中,采用了框架模型形式,把问题中的主要约束封闭于每个数传任务中,这在降低调度模型复杂度的同时,也降低了调度算法设计难度。还提出了调度算法设计思想,并设计了一基于灵活度的调度算法。仿真表明,所建立的模型及算法对解决卫星数传调度问题是可行的。     

两种选址问题的算法及有关结论

本文提出两种选址问题,对其局部最优性建立了充要条件,并在此基础上提出了该类问题的有效算法。     

坦克火控首发命中率试验脱靶弹数据处理方法

通过对出现脱靶弹情况下的散布特征参数估计方法的研究 ,建立了正态双边截尾样本均值和方差估计数学模型 ,并给出了数值计算方法 ,为坦克火控系统首发命中概率试验脱靶弹数据处理提供了理论依据。     

兵团少数民族教师双语培训中存在的问题与对策

兵团中小学少数民族教师双语培训工程自2005年实施以来,已进行五期学员培训,在取得成绩获得经验的同时,也出现了不少值得思考的问题。本文从兵团少数民族教师双语培训的教学管理,日常管理,教育实习,学员自身等几个方面进行详细分析,针对主要问题及其成因进行客观深入地分析并提出相应的对策,在全面推行少数民族双语教育的今天,具有非常重要的现实意义。     

日-地(月)系拉格朗日L1点及晕(Halo)轨道应用

日-地(月)系统拉格朗日L1点及L1点附近的晕(Halo)轨道在"夸父"工程中有重要的应用价值,可用于对太阳实施持续观测.利用数值分析方法,找到了日-地(月)-探测器三者构成的圆限制性三体问题中L1点附近的周期晕(Halo)轨道,分析了轨道的特性.研究结果对"夸父"工程中的目标轨道设计有一定的参考价值.     

基于ML-Ⅱ的指数分布可靠性多层Bayes估计

Bayes估计法是可靠性评估中应用最为广泛的方法之一,指数分布的Bayes验前概率密度函数中的重要参数主要依靠Reformulation法和Box-Tiao法确定,具有较强的主观经验性。基于Beyes估计的基本思想,以试验数据为依据,利用第二类极大似然估计法(ML-Ⅱ估计法)确定Bayes方法中的相关参数,避免了参数确定的主观性。实例表明结果合理,方法客观、可行。     

二次型极小化问题的迭代算法

在新的控制条件下,证明了二次型极小化问题的迭代算法的有效性,所得结果改进了徐洪坤关于二次型优化的最新结果。     

A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Iterative coloring extension of a maximum clique

In this paper we present an improved branch and bound algorithm for the vertex coloring problem. The idea is to try to extend the coloring of a maximum clique to its adjacent vertices. If this succeeds, its successive neighbors are considered; in case of failure (i.e., in the case the initial colors are not sufficient), working on the subgraph induced by the maximum clique and its neighborhood, the lower bound is improved by seeking for an optimal coloring of this subgraph by branch and bound. The process is repeated iteratively until the whole graph is examined. The iterative scheme exploits a further lower bound obtained by integrating a simple algorithm into the maximum clique search, and a new method to compute upper bounds on subgraphs. Furthermore, a new branching rule and a method for the selection of the initial maximum clique are presented. Extensive computational results and comparisons with existing exact coloring algorithms on random graphs and benchmarks are given. © 2001 John Wiley & Sons, Inc. Naval Research Logistic 48: 518–550, 2001     

关于U算子有界性的证明

利用Hardy Littlewood极大算子及性质与分数次极大算子及性质 ,证明了u(x)在Lq(Rn) ,L∝ ,Lq(E)空间上是有界的 ,Coσoπeβ定理应予以推广。