六角形石墨烯的输运性质研究

研究六角形石墨烯纳米结构的量子输运性质,利用基于紧束缚近似的非平衡格林函数方法计算得到体系的透射系数。由于透射率强烈地依赖于所研究区域的结构,可以看到,体系的透射率随电子能量变化发生剧烈的扰动,并得到了一些有用的结论,并且我们认为,这些结论对于未来的纳米器件设计具有指导意义。     

基于距离和定位的双/多基地雷达定位精度分析

对双基地制导雷达距离解算精度进行系统仿真,针对在基线附近无法高精度定位的问题,介绍了利用多站距离信息数据融合算法。通过多站定位和数据融合,仿真结果表明这种优化算法可获得较高的距离解算精度,很大程度上提高了基线附近距离定位精度,提高了系统的定位性能和抗干扰能力。     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

The stochastic joint replenishment problem: A new policy,analysis, and insights

In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single‐location, N‐item setting. The replenishment decisions are based on both group reorder point‐group order quantity and the time since the last decision epoch. We derive the expressions for the key operating characteristics of the inventory system for both unit and compound Poisson demands. In a comprehensive numerical study, we compare the performance of the proposed policy with that of existing ones over a standard test bed. Our numerical results indicate that the proposed policy dominates the existing ones in 100 of 139 instances with comparably significant savings for unit demands. With batch demands, the savings increase as the stochasticity of demand size gets larger. We also observe that it performs well in environments with low demand diversity across items. The inventory system herein also models a two‐echelon setting with a single item, multiple retailers, and cross docking at the upper echelon. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于改进卡尔曼滤波方法的机动目标跟踪研究

针对在机动目标跟踪中当目标作高度机动飞行时卡尔曼滤波可能会出现严重发散的情况,提出利用BP神经网络校正其滤波结果,并将遗传算法应用于BP网络的训练过程,以解决BP网络训练速度慢的缺陷,提高算法的实时性。仿真表明该方法是可行的、有效的。     

进化计算在机器人轨迹规划中的应用研究

本文介绍了采用进化计算思想研制的机器人轨迹规划系统ＲＴＰ－１，提出多层次动态结构化编码方案，利用低中高三层进化算法分别优化距离、路径和关节角度偏差，基于多层综合优化策略解决多目标多约束工程优化问题，建立了次序相关问题求解的通用框架。在进化算法中，利用拉马克效应加快轨迹规划速度，在ＲＭ－５０１机械手上实现的任意空间直线和空间曲线轨迹规划具有良好的鲁棒性，规划轨迹的相邻臂构型间具有良好的柔顺性，规划轨迹的臂构型序列具有良好的平滑性。本文所采用的机器人轨迹规划方法具有通用性，可推广应用于各种动力学系统的研制。     

进化计算在机器学习中的应用研究

采用进化计算思想研制机器学习实际系统，利用隐含并行机制及并行规则触发策略实现多目标优化技术。针对航天员模拟训练评分标准具体任务，采取灵活的多层次动态编码方案，建立多种简洁且完备的进化操作。利用信度分配组桶策略实现竞争机制，依赖进化算法搜索、发现并选择适当规则，引入启发知识产生缺省规则层次以实现多种隐式目标。设计并实现了遗传进化机器学习系统ＧＥＭＬ－１，该系统具有良好的鲁棒性和柔顺性。本文的遗传进化机器学习方法，可推广应用于各种军用专家系统和军事决策支持系统的研制，从而为人工智能在军事上的应用提供新的设计方法和实现途径。     

多Agent系统中Agent计算的能力理论

能力是规范Ａｇｅｎｔ的一个重要抽象概念。本文提出了规划树概念以刻划在动态、不确定的多Ａ－ｇｅｎｔ系统中Ａｇｅｎｔ如何通过对其规划进行合理、有效的组织来实现其任务、维护某些条件。基于规划树概念,本文给出了能力概念的形式化语义定义,获取和描述了它的一些重要属性。     

多因子动态加权威胁估计方法

在分析了以往威胁估计方法不足的基础上,提出了多因子动态加权威胁估计方法,该方法中给出了诸因子新的有作战背景的威胁隶属度函数,并运用层次分析法（ＡＨＰ）计算出权系数,而且随着作战环境的变化可动态调整之。     

面向应用的分布式多机联合计算的系统设计问题

随着计算机应用向分布和异构发展，如何建立一个具有良好性能价格比的分布式多机联合计算系统是当前计算机应用开发者遇到的重要课题。文中结合分布式仿真应用实例，对多计算机联合计算的系统划分、数据通讯机制和高性能并行计算问题进行了论述。