基于介数中心性重要节点的能量均衡机制

针对无线传感器网络中瓶颈节点和准瓶颈节点对网络影响的特例性问题,将重要节点的概念推广到对节点介数的研究,提出了基于介数中心性重要节点的能量均衡机制。该机制将介数值大于网络平均介数值的节点判定为重要节点,并利用重要节点的邻居节点建立缓冲机制来减少其数据的转发次数,在牺牲较少数据传输延时的情况下节省了介数中心性重要节点的能量消耗。仿真实验表明该机制能够较好地均衡无线传感器网络中的节点能耗,提高了网络生命周期。     

武器装备体系结构描述方法

在明确武器装备体系相关概念、特点的基础上,总结比较了目前体系结构描述方法和工具的优缺点,针对新形式对武器装备体系结构描述方法的选择提出了要求,并指出了武器装备体系要解决的“短板”问题.     

农村公共产品供给与农民增收的关联研究

目前我国城乡差距突出表现为公共产品差距,公共产品有效供给不足已成为当前制约农民增收的瓶颈。无论从理论分析还是从国内外实践看,公共产品的有效供给与农民的增收呈现正相关关系。因此,提高公共产品的有效供给是促进农民增收的有效途径,针对公共产品供给实践中存在的影响农民增收的问题而采取相应的对策是当前促进农民增收的理性选择。     

The bottleneck problem with minimum quantity commitments

Given an edge‐distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introduce minimum quantity commitments to balance workloads of suppliers, provide the best possible approximation algorithm, and study its generalizations and specializations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

并行程序中同步瓶颈的检测和优化方法

针对并发程序中锁的不当使用可能导致性能瓶颈的问题,提出检测和优化并发程序中同步瓶颈的方法IdeSync。IdeSync使用静态分析方法获取同步方法和同步块,构建静态同步依赖图,采用基于执行路径的动态分析技术进行同步依赖关系分析,构建同步依赖图。为了暴露性能瓶颈,在同步依赖图上通过增加程序工作负载的方式,监测临界区的性能变化,并针对检测到的同步瓶颈给出优化建议。在实验中通过HSQLDB、SPECjbb2005和RxJava等12个大型实际应用程序对IdeSync的有效性进行验证,共检测到72个同步瓶颈,根据优化建议进行优化后程序性能均有所提升。实验表明,IdeSync能够有效地检测和优化同步瓶颈。     

瓶颈指派问题的一种多项式时间算法

本文对瓶颈指派问题给出了一种新的算法,该算法不需要利用最大流算法,而类似于解经典指派问题的匈牙利算法。该算法是一个多项式时间算法,其复杂性为Ｏ（ｎ３）     

同步感应线圈炮的技术瓶颈与应用前景分析研究

介绍多级同步感应线圈炮的工作原理,分析目前同步感应线圈炮在储能电源小型化、位置触发及驱动线圈寿命等方面的技术瓶颈,得出同步感应线圈炮更适用于中低初速载荷发射的结论．同时,研究同步感应线圈炮在电磁线圈迫击炮、大质量载荷弹射和引信动态试验等方面的应用前景,为科学制定同步感应线圈炮发展战略奠定了基础．     

Quadratic bottleneck problems

We study the quadratic bottleneck problem (QBP) which generalizes several well‐studied optimization problems. A weak duality theorem is introduced along with a general purpose algorithm to solve QBP. An example is given which illustrates duality gap in the weak duality theorem. It is shown that the special case of QBP where feasible solutions are subsets of a finite set having the same cardinality is NP‐hard. Likewise the quadratic bottleneck spanning tree problem (QBST) is shown to be NP‐hard on a bipartite graph even if the cost function takes 0–1 values only. Two lower bounds for QBST are derived and compared. Efficient heuristic algorithms are presented for QBST along with computational results. When the cost function is decomposable, we show that QBP is solvable in polynomial time whenever an associated linear bottleneck problem can be solved in polynomial time. As a consequence, QBP with feasible solutions form spanning trees, s‐t paths, matchings, etc., of a graph are solvable in polynomial time with a decomposable cost function. We also show that QBP can be formulated as a quadratic minsum problem and establish some asymptotic results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Using real options analysis to value reoptimization options in the shifting bottleneck heuristic

The reoptimization procedure within the shifting bottleneck (SB) involves reevaluation of all previously scheduled toolgroup subproblems at each iteration of the SB heuristic. A real options analysis (ROA) model is developed to value the option to reoptimize in the SB heuristic, such that reoptimization only occurs when it is most likely to lead to a schedule with a lower objective function. To date, all ROA models have sought to value options financially (i.e., in terms of monetary value). The ROA model developed in this paper is completely original in that it has absolutely no monetary basis. The ROA methodologies presented are shown to greatly outperform both full and no reoptimization approaches with respect to both computation time and total weighted tardiness. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

高速三维地形显示系统的体系结构

从自行设计的专用三维地形显示的硬件和软件系统的观点出发,讨论了高速三维地形显示系统的体系结构、关键技术及其实现方法。以新一代的高速处理器ＩＮＴＥＬｉ８６０为核心,采用分配树技术,解决多路并行输出产生的竞争和瓶颈问题;实现Ｚ－缓冲硬件算法,提高系统的图形消隐速度;设计多帧存体结构,支持多通道、多画面信息的快速显示。