基于种群分类的变尺度免疫克隆选择算法

提出了一种基于种群分类的变尺度免疫克隆选择算法.该算法通过对目标函数进行非线性尺度变换,突出了全局最优解的优势地位;建立记忆子群实现了种群代际进化信息的交换;依据亲和度将抗体分为精英子群、普通子群、劣等子群,并对其分别执行自适应高斯变异、均匀变异和消亡更新等策略,增强了算法的局部和全局搜索能力.引入小生境技术提高了抗体...     

测试性增长中资源优化配置模型及求解

良好的测试性设计对系统维修性具有重要意义,测试性增长试验通过一系列测试性设计缺陷发现和纠正措施,可保证系统测试性指标达到设计要求。针对基于延缓纠正的测试性增长过程中的资源配置问题进行研究,基于增长试验目标是否明确和试验资源是否受限制问题构建资源优化配置模型,并提出一种基于拉格朗日松弛和本地搜索的快速优化算法。仿真结果表明:该模型能够有效指导测试性增长中的资源优化配置问题,所提混合优化方法能够高效、准确地求解整数规划问题。     

可测试性技术中的图论问题及其求解

近 2 0年来 ,为了解决结构日益复杂的电路测试问题 ,可测试性技术得到了迅速发展。在可测试性技术中 ,针对不同的测试对象 ,如何对可测试性设计方案以及测试策略进行优化 ,降低总体代价 ,是亟待解决的问题。为了解决这两类典型的优化问题 ,首先应用图论方法建立问题的拓扑描述模型 ,然后通过构造相应的逻辑求解函数 ,给出问题最优解的求解算法 ,并通过简单实例演     

基于非独立测试的诊断策略优化生成

诊断策略优化设计是测试性设计中的一项重要内容.实际中的测试彼此间并非独立,即测试费用依赖于测试的先后顺序,针对这一问题,提出将测试划分成不同的测试模式,规定当一个测试序列中存在模式变换时必须考虑附加的转换费用.建立了同时考虑测试费用和模式转换费用启发式评估函数,并基于该启发式评估函数设计了近似最优的搜索算法,应用案例验证了本算法.试验表明该方法有效地解决了非独立测试的诊断策略优化生成问题.     

一种基于混沌粒子群改进的果蝇优化算法

针对基本果蝇算法在优化过程中收敛速度慢,无法解决复杂的优化问题,引入混沌搜索和粒子群算法(PSO)来修正基本果蝇算法(FOA)。利用混沌搜索初始化果蝇群位置,提高了初始解的随机性和遍历性,从而提高FOA初始种群的多样性;引入PSO算法以减少最优解更新过程中的盲目搜索;选取5种不同的非线性函数作为测试函数,并将改进后的果蝇算法(IFOA)与其他算法相比较,实验结果表明,IFOA的鲁棒性较强,且收敛速度与收敛精度有了明显的提高。     

改进ICP的编队预定目标选择方法

如何对编队预定目标进行自动选择,是超视反舰导弹亟待解决的一个问题.基于ICP(Iterated Closest Point)的预定目标选择方法利用了编队形状信息,获得了比传统方法更好的预定目标选择概率.但ICP算法易受干扰点的影响,且因受初始点选取的影响容易收敛到局部最优值.为了提高预定目标选择概率,提出了基于改进ICP算法的预定目标选择方法.改进ICP算法相对标准ICP算法增加了以下两点改进策略:利用加权距离函数削弱干扰点影响;利用随机扰动控制收敛过程跳出局部收敛域.仿真计算表明改进措施的有效性,特别是在干扰情况下预定目标选择概率显著提高.     

基于战例数据的制胜要素选择方法

针对战争制胜机理定量研究需求,提出了一种基于混合评估的制胜要素选择算法。针对战例数据特点,该算法选择两种过滤方法分别从不同方面对要素全集进行评估排序而后加权得到综合排序结果;将结果作为遗传算法的初始种群,而后以分类精度作为个体适应度函数。选择几种典型的分类器综合比较,筛选出规模较小、性能较好的要素子集。测试结果表明,该算法不仅能有效地减少要素子集规模,还可以进一步提高制胜机理分析模型的准确率和效率。     

基于改进粒子群算法的复杂地况下雷达布站优化

针对现有雷达布站数学模型不能解决复杂地况下的雷达布站问题,提出了一种复杂地况下的雷达布站数学模型,该模型解决了雷达在复杂地况下布站位置受限的问题。在此基础上,提出了基于改进粒子群算法的复杂地况下的雷达布站优化算法,该算法改善了现有粒子群算法中期搜索性能不强的缺陷。仿真结果验证了提出的改进雷达布站数学模型的可行性和基于改进粒子群算法的复杂地况下雷达布站优化方法的有效性。     

一种基于克隆选择原理的空战目标分配算法

针对空战目标分配问题,在以优势函数为空战模型的基础上,提出了一种基于克隆选择原理的目标分配算法,并引入混沌算子,增强了算法中个体的多样性和稳定性,减少算法的盲目性,提高了算法的收敛速度。根据克隆选择原理,分析了算法的编码方式、克隆选择算子对算法的影响,给出了算法的流程。最后进行了仿真,结果表明了算法的有效性。     

基于改进遗传算法的测试性优化分配方法

测试性优化分配是在测试性分配中合理配置各项测试资源,以满足测试性分配要求和资源约束条件。一般的遗传算法存在最优解不易求解、初始参数值不易设置等缺陷,因此,为了更加高效合理地进行测试性优化分配,在传统遗传算法中引入迁移技术来优化遗传迭代过程,并运用AHP法对算法初始参数进行调整,从而提出了基于改进的遗传算法的测试性优化分配方法。算例分析表明该方法可快速有效地求得测试性优化分配问题的最优解。     

Control-variate selection criteria

For multiresponse simulations requiring point and confidence-region estimators of the mean response, we propose control-variate selection criteria that minimize mean-square confidence-region volume in two situations: (a) Only the mean control vector is known, and standard linear control-variate estimation procedures are used. (b) Covariances among controls are also known and are incorporated into new linear control-variate estimation procedures. An example illustrates the performance of these selection criteria.     

Optimal selection with alternative information

This article examines the problem of optimally selecting from several unknown rewards when there are given alternative, costly sources of information. The optimal rule, indicating the information to be purchased and the reward to be selected, is specified as a function of the decision maker's prior probabilities regarding the value of each alternative. The rule is surprisingly complex, balancing prior beliefs, the “informativeness” of the relevant information system, and the cost of acquiring information.     

Further light on nonparametric selection efficiency

A nonparametric selection procedure ??bs was proposed by Bechhofer and Sobel (1958) and studied by Dudewicz (1971) in comparison with other procedures under normal and uniform alternatives. He found ??BS always required larger sample sizes, sometimes substantially so. For 2-point populations we find more extreme results. We also find that ??BS may be substantially better than reasonable competitors designed specifically for 2-point populations. Finally, a new nonparametric selection procedure (conjectured to be better than ??BS) is proposed.     

合作定位节点选择策略

合作定位是指接收机之间通过合作网络交换关键定位信息实现协同定位的新技术,接收机进行合作定位过程中可供使用的辅助节点包括可视卫星和已定位邻居接收机。接收机之间的合作增加定位过程中的可用辅助节点数量,进而增加位置估计的计算量和计算时间,在可用辅助节点较多时,定位实时性很难得到保证。提出改进次优节点选择算法,计算备选节点之间单位向量差作为节点价值,选择拥有最大价值的节点作为辅助节点。将新算法与4种典型的节点选择算法进行了对比,仿真实验证明该算法能够在较短时间内选择出接近最优算法得到的组合,综合性能优于现有节点选择算法。     

Strategy selection: an info-gap methodology

The evaluation and selection of military strategy requires consideration of myriad factors – social, historical, political, geographical and technological – together with vast uncertainties encompassing all these domains. Info-gap decision theory is a conceptual framework that can support these deliberations and that has substantive implications for the formulation, evaluation and selection of strategic goals and of the means to attain them. In particular, while the analyst may desire to reliably achieve the best possible outcome, info-gap theory provides a critique of, and alternative to, the paradigm of optimizing the outcome of a decision. In selecting between strategy alternatives, the analyst must sometimes choose between one alternative that is purportedly better than another, but also more uncertain. Such a choice is a dilemma whose resolution requires the analyst to balance between the different predicted qualities of each alternative and their different vulnerabilities to uncertainty. The dilemma can be managed with the info-gap methodology of robustly satisfying critical requirements.     

Sequential bid selection by stochastic approximation

Suppose that a contractor is faced with a sequence of “minimum bid wins contract” competitions. Assuming that a contractor knows his cost to fulfill the contract at each competition and that competitors are merely informed whether or not they have won, bids may be selected sequentially via a tailored stochastic approximation procedure. The efficacy of this approach in certain bidding environments is investigated.     

Information theory for ranking and selection

We study the classical ranking and selection problem, where the ultimate goal is to find the unknown best alternative in terms of the probability of correct selection or expected opportunity cost. However, this paper adopts an alternative sampling approach to achieve this goal, where sampling decisions are made with the objective of maximizing information about the unknown best alternative, or equivalently, minimizing its Shannon entropy. This adaptive learning is formulated via a Bayesian stochastic dynamic programming problem, by which several properties of the learning problem are presented, including the monotonicity of the optimal value function in an information-seeking setting. Since the state space of the stochastic dynamic program is unbounded in the Gaussian setting, a one-step look-ahead approach is used to develop a policy. The proposed policy seeks to maximize the one-step information gain about the unknown best alternative, and therefore, it is called information gradient (IG). It is also proved that the IG policy is consistent, that is, as the sampling budget grows to infinity, the IG policy finds the true best alternative almost surely. Later, a computationally efficient estimate of the proposed policy, called approximated information gradient (AIG), is introduced and in the numerical experiments its performance is tested against recent benchmarks alongside several sensitivity analyses. Results show that AIG performs competitively against other algorithms from the literature.     

平稳小波去噪算法中的参数选择

为研究平稳小波变换去噪算法在工程应用时如何选择小波基、小波系数处理方法和阈值计算方法的参数以取得最优去噪效果，通过仿真实验，对比不同小波基、不同小波系数处理方法及不同阈值计算方法对平稳小波变换去噪算法去噪效果的影响，对算法的参数选择问题进行研究。实验结果表明：相比其他滤波器组，大部分情况下Daubechies 小波基对应的滤波器组去噪效果更好；信号信噪比较低时选用软阈值法，信噪比较高时选用硬阈值法；使用阈值法处理小波系数，信号信噪比不高的情况下应采取固定阈值法来确定阈值，信号信噪比较高时应采取无偏风险估计法。     

Test selection for a mass screeening program

Periodic mass screening is the scheduled application of a test to all members of a population to provide early detection of a randomly occurring defect or disease. This paper considers periodic mass screening with particular reference to the imperfect capacity of the test to detect an existing defect and the associated problem of selecting the kind of test to use. Alternative kinds of tests differ with respect to their reliability characteristics and their cost per application. Two kinds of imperfect test reliability are considered. In the first case, the probability that the test will detect an existing defect is constant over all values of elapsed time since the incidence of the defect. In the second case, the test will detect the defect if, and only if, the lapsed time since incidence exceeds a critical threshold T which characterizes the test. The cost of delayed detection is an arbitrary increasing function (the “disutility function”) of the duration of the delay. Expressions for the long-run expected disutility per unit time are derived for the above two cases along with results concerning the best choice of type of test (where the decision rules make reference to characteristics of the disutility function).     

频谱感知次序的在线最优选择

动态频谱接入是解决无线电频谱资源短缺和频谱使用效率低下问题的有效方法,它允许次级用户在授权频谱空闲时动态地接入,以进行数据传输。而频谱感知是实现动态频谱接入的关键挑战之一。由于次级用户的感知能力有限,为了获得更多的频谱接入机会,需要尽快找到频谱空闲概率最大的频段,并研究频谱感知次序问题。考虑到频谱空闲概率对次级用户是不可知的,并且会随时间变化,提出了在线学习框架,把频谱感知次序问题归纳成经典多摇臂赌博机问题,并利用在线学习方法——满意折现汤普森抽样算法处理优化问题。仿真结果表明,和其他算法相比,所提算法可以获得更多的频谱接入机会并且能够跟踪频谱空闲概率的变化。