List coloring with requests

Let be a graph with a list assignment . Suppose a preferred color is given for some of the vertices; how many of these preferences can be respected when -coloring ? We explore several natural questions arising in this context, and propose directions for further research.     

集群移动通信系统漫游联网结构的研究

通过对过去集群系统中联网结构的分析，基于比较常用的集中式联网结构和分布式联网结构，提出了一种全新的漫游联网结构：综合联网结构。在应用的基础上给出了基于这种新的联网结构的漫游策略。同时进行对比、分析了新的联网结构的利弊。     

无约束最优化锥模型拟牛顿信赖域方法的收敛性(英)

本文研究无约束最优化雄模型拟牛顿信赖域方法的全局收敛性．文章给出了确保这类方法全局收敛的条件．文章还证明了，当用拆线法来求这类算法中锥模型信赖域子问题的近似解时，确保全局收敛的条件得到满足     

List multicolorings of graphs with measurable sets

In an ordinary list multicoloring of a graph, the vertices are “colored” with subsets of pre‐assigned finite sets (called “lists”) in such a way that adjacent vertices are colored with disjoint sets. Here we consider the analog of such colorings in which the lists are measurable sets from an arbitrary atomless, semifinite measure space, and the color sets are to have prescribed measures rather than prescribed cardinalities. We adapt a proof technique of Bollobás and Varopoulos to prove an analog of one of the major theorems about ordinary list multicolorings, a generalization and extension of Hall's marriage theorem, due to Cropper, Gyárfás, and Lehel. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 179–193, 2007     

SoC软硬件自动划分系统设计

设计了一种将IP核复用和多目标优化相结合的SoC软硬件自动划分系统，详细探讨了系统各个模块的功能，重点论述了系统实现的关键技术，包括基于遗传算法的软硬件划分方法和基于表调度的系统性能评估方法，实验结果表明，该系统满足了SoC软硬件协同设计中对软硬件自动划分的要求，为开发SoC系统级仿真验证平台奠定了基础．     

广义指派问题及其在军事装备运输中的推广应用

军事装备中的运输问题复杂多样,如何建立数学模型是寻求优化方案的关键.本文首先将最优线性指派模型推广到广义指派模型并给出其两种算法,其次对带有时间约束的运输问题进行建模,并设法将其转化为广义指派问题来处理,从而为这类运输问题提供了一种有效可行的算法.     

Spherical minimax location problem using the Euclidean norm: Formulation and optimization

The minimax spherical location problem is formulated in the Cartesian coordinate system using the Euclidean norm, instead of the spherical coordinate system using spherical arc distance measures. It is shown that minimizing the maximum of the spherical arc distances between the facility point and the demand points on a sphere is equivalent to minimizing the maximum of the corresponding Euclidean distances. The problem formulation in this manner helps to reduce Karush-Kuhn-Tucker necessary optimality conditions into the form of a set of coupled nonlinear equations, which is solved numerically by using a method of factored secant update with a finite difference approximation to the Jacobian. For a special case when the set of demand points is on a hemisphere and one or more point-antipodal point pair(s) are included in the demand points, a simplified approach gives a minimax point in a closed form.     

基于主成分分析的投资决策

本文首先运用多元统计分析中的主成分分析法对上市公司投资价值的多项指标进行了综合聚集，其次在理想点的基础上建立了综合优化决策模型，并对通讯行业上市公司进行了投资分析，从而为管理者和决策者提供了一种科学而合理的决策依据和决策方法。     

Arms races as iterated prisoner's dilemma games

Many important aspects of arms races are captured by the iterated prisoner's dilemma (IPD) game. In this analysis, strategies are developed and analyzed for IPD games which most resemble arms races; those which are finite, uncertain and time varying in length. It is shown that, under certain conditions, it can be rational to unilaterally cooperate following a series of mutual defection. A number of conclusions concerning arms race behavior are drawn.