饱和系统的线性最优容错不变集

针对饱和系统的容错控制问题,提出了一种D稳定约束下系统吸引域的估计方法。分别以不变集和参考集的容量为优化目标,给出了两个优化容错不变集的充分条件。为解决不变集优化中出现的双线性矩阵不等式(BMI)问题,通过构造包含线性矩阵不等式(LMI)的目标函数,将它转化为非线性规划的形式进行求解。通过一个仿真实例对该方法进行验证。     

Optimal switchover times between two activities utilizing the same resource

The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

无线认知网络中一种分布式最大频谱分配算法

无线认知网络被认为是下一代无线网络的核心架构之一。该网络能解决日益增长的频谱使用需求和低下的频谱使用率之间的矛盾。通过伺机接入临时可用频谱资源,其频谱利用率能得到大幅的提高。由于频谱资源分配是影响频谱资源利用率的关键,因此如何对频谱资源进行高效的分配一直是无线认知网络的重要研究领域之一。我们证明了在异构频谱使用概率条件下的最优频谱分配是NP难的问题。为了有效解决该问题,本文提出了一种基于分布式最大加权独立集的频谱分配算法——DMWIS。该算法的时间复杂度为O(V2/2)。通过大量的仿真实验,验证了在90%以上的不同随机网络环境下算法能在3轮内收敛,并且该算法一般能获得最优解90%的性能。     

石河子移民文化对当地少数民族文化的影响

文化通性使不同民族文化之间的学习和交融成为可能，新疆石河子是以汉族移民为主体的移民地区，不同地域移民带来的文化互相碰撞交融，与兵团文化结合形成了独具特色的石河子多元一体地域文化。本文从经济生活、宗教信仰和民俗习惯、教育观和生育观几个方面来分析石河子特殊的移民文化对当地少数民族文化产生的影响。     

海洋环境中基于WVD的LFM信号检测方法

海洋环境中弱信号的谱与海杂波的谱相混叠 ,目标和背景的位置差异很小 ,经典的频域或空域处理对海杂波中弱信号的检测难以奏效。鉴于Wigner-Ville分布 (WVD)对线性调频信号 (LFM )具有时频聚集性这一特点 ,提出了一种海洋环境中基于WVD的LFM信号检测方法。利用雷达采集的真实海杂波数据 ,在不同信杂比的条件下 ,研究了该方法与经典频域法在信号检测中的差别。通过实验分析 ,与经典方法相比 ,该方法具有明显的优越性 ,且信杂比达到 -14 . 3dB时 ,其仍能很好地对信号进行检测。     

一种新的基于粗糙集的连续属性离散化算法

粗糙集理论作为一种新的处理含糊和不确定性问题的数学工具,已成为国际学术界的一个前沿的研究领域.传统的粗糙集理论只能对数据库中的离散属性进行处理,而绝大多数现实的数据库既包含了离散属性,又包含了连续属性.针对传统粗糙集理论的这一缺陷,提出了一种改进的基于断点重要性的属性离散化方法.最后,通过实例分析说明该方法是有效的.     

A computation procedure for the exact solution of location-allocation problems with rectangular distances

A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem.     

空战关键信息与战术规则提取算法

将粗糙集理论引入到空战研究中 ,提出了一种通过属性约简提取空战决策的关键信息和战术规则的算法 ,以便对空战过程中的冗余信息进行约简 ,提高决策实时性。通过一个空战战术选择示例对该算法进行了验证 ,结果表明 :在保证空战战术分类结果不变的情况下 ,该算法可提取出对空战决策起关键作用的信息以及最小简化战术规则。     

关于分形插值函数的积分

用反例说明在 [1 ,2 ]中关于分形插值函数的积分公式是错误的 ,并建立了关于分形插值函数积分的正确公式。