资源结构映像异步更新策略及其在JBCM中的应用

使基于构件的软件配置管理系统支持对配置资源的并发访问是一种必然要求,为此提出了一种资源结构映像异步更新策略用以实现这一目标.这种方法已由北京大学软件工程国家工程中心应用于青鸟软件配置管理系统(JBCM).     

案例教学在《化学事故应急救援》课程中的应用

案例教学首先要了解“案例教学法”的含义及特点,在此基础上介绍《化学事故应急救援》的课程特点,并就该课程案例教学实施过程中案例的选取、课堂案例讨论、案例总结与评价等问题进行分析,最后对案例教学实施中应注意的问题提出三点意见。     

多核数字信号处理卷积算法并行优化

针对国防科技大学自主研发的异构多核数字信号处理(digital signal processing, DSP)芯片的特征以及卷积算法自身特点,提出了一种面向多核DSP架构的高性能多核并行卷积实现方案。针对1×1卷积提出了特征图级多核并行方案;针对卷积核大于1的卷积提出了窗口级多核并行优化设计,同时提出了逐元素向量化计算的核内并行优化实现。实验结果表明,所提并行优化方法实现单核计算效率最高能达到64.95%,在带宽受限情况下,多核并行扩展效率可达到48.36%～88.52%,在典型网络ResNet50上的执行性能与E5-2640 CPU相比,获得了5.39倍性能加速。     

面向复杂几何模型的多级并行四面体网格生成算法

高性能计算机的快速发展为数值模拟提供了必需的硬件环境,数值模拟领域对网格的需求已高达数十亿到数百亿量级,而网格生成作为数值模拟的重要一环,其发展则相对滞后,很难满足并行数值模拟求解器对大规模网格的需求。本文面向复杂几何模型提出一种多级并行四面体网格生成算法,该算法首先基于模型的几何特征建立网格的尺寸场,并基于尺寸场和几何实体间的邻接关系对几何实体进行分组,将分组后的几何实体分配到不同的计算节点,在计算节点间采用前沿推进法实现三角形面网格的并行生成,然后在计算节点内对三角形面网格进行二级区域分解,将分解后的子网格分配到各进程中,最后在进程内采用多线程并行方法实现四面体网格的并行生成。通过实际应用三峡大坝模型进行验证,该算法具有良好的并行效率和可扩展性,可以在数千处理器核上实现十亿规模高质量四面体网格的并行生成。     

A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities

This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

光学系统的副像及其消除方法的探讨

视准式光学系统瞄准具的成像有主像和副像两种情形,主像是对目标瞄准的必要标志,副像则对目标的瞄准产生不良影响,为消除或减弱光学系统所成的副像对瞄准精度的影响,主要分析了光学系统中中心反射镜的反射和有无平行差时产生副像的原因.提出了消除或减弱副像的多项措施,并针对中心反射镜提出了两种截然相反地改进方法.可有效地消除或减弱副像所引起的不良干扰对飞行人员视觉的影响,有效地提高了观察效果和瞄准精度.     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

略论国防专利在专利制度中的优先性

通过摘取法律法规中体现国防专利优先性的法律规范,阐明国防专利分别在国防专利申请阶段和国防专利实施阶段的优先性。对国防专利在专利制度中的优先性进行法理学分析,从国内国防建设的角度论证国防专利优先性的原因,通过研究美国和俄罗斯的国防专利制度来分析国防专利具有一定优先地位的合理性。文章对我国国防专利在专利制度的优先性提出发展建议,在国防专利申请阶段,国防专利要加大对国防专利权人的补偿力度,同时设立专门机构对普通专利进行国防专利审查。国防专利实施阶段要完善定密解密制度,发挥市场在国防专利向普通专利转换中的关键作用。     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

网格方程组并行计算预条件迭代若干性质及应用

对网格方程组作区域分裂并行计算 ;分析了预条件迭代谱条件的若干性质及其对算法收敛性的影响 ,为构造预处理提供了理论依据 ,并应用于区域分裂并行计算