孙吴益州战略论析

益州战略是孙吴建国初期即定下的图取天下的基本战略。赤壁之战后,孙吴着手实施益州战略,由于复杂的三国政治、军事、外交以及地理形势等因素的作用,刘备集团占据益州,孙吴最终无法实现益州战略。基于现实,孙吴修正了益州战略,以略取、经营益州为主变为防御、联合益州为主,从而与蜀汉形成矛盾统一的关系。益州战略贯穿孙吴历史,深刻影响三国政局。     

西方传统武德文化中的德性之维

西方文明虽有崇尚战争、赞美胜利的倾向,但这并不影响其传统武德文化放射注重战争正义和军人德性的光芒。西方传统武德文化的“正义必胜”战略思想、以“爱国主义”为核心的道德规范体系、“注重自然法和重视精神力量作用”的传统在当代军人武德建设中仍有积极意义。     

古代军人利益观述评

本文对古代中外一些国家不同时代的军人利益观进行了梳理,并作了简要的评论,指出了这些军队的军人利益观之阶级特点、民族特征,且与我军军人利益观作了粗浅的比较。希冀此文能起到抛砖引玉的作用,引发对军人利益观问题的深入研究。     

一种新型直流电网短路限流装置的设计与分析

针对直流电网短路故障时迅速产生的短路电流,利用IGBT器件为核心,设计出一种新型的直流短路电网限流装置并阐述了其工作原理.在分析了该装置的各种工作状态后,给出了对应的数学解析模型,为直流电网短路限流装置各参数的设计提供了理论依据.研制出小功率实验样机,并经过实验验证了解析模型的正确性和所设计的限流装置工作的快速有效性.     

螺旋桨桨叶计算机实体造型方法研究

提出了一种螺旋桨桨叶造型的新方法———采用UG软件对螺旋桨桨叶进行精确实体缝合造型法,充分利用Matlab与UG的接口技术,对桨叶截面曲线的形成进行了优化,提高了造型精度,得到了光顺的螺旋桨桨叶的三维实体模型,为螺旋桨的性能优化及数控精加工创造了条件.     

直接免疫PCR方法的建立

免疫PCR基本原理与ELISA相似,即用一段可扩增的DNA分子代替ELISA中酶放大检出信号,建立了直接免疫PCR的检测蓖麻毒素技术,实验结果表明,其灵敏度达1pg／ml,比ELISA方法灵敏度高10^3倍.     

Manpower allocation with time windows and job‐teaming constraints

In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

On parallel machine replacement problems with general replacement cost functions and stochastic deterioration

The parallel machine replacement problem consists of finding a minimum cost replacement policy for a finite population of economically interdependent machines. In this paper, we formulate a stochastic version of the problem and analyze the structure of optimal policies under general classes of replacement cost functions. We prove that for problems with arbitrary cost functions, there can be optimal policies where a machine is replaced only if all machines in worse states are replaced (Worse Cluster Replacement Rule). We then show that, for problems with replacement cost functions exhibiting nonincreasing marginal costs, there are optimal policies such that, in any stage, machines in the same state are either all kept or all replaced (No‐Splitting Rule). We also present an example that shows that economies of scale in replacement costs do not guarantee optimal policies that satisfy the No‐Splitting Rule. These results lead to the fundamental insight that replacement decisions are driven by marginal costs, and not by economies of scale as suggested in the literature. Finally, we describe how the optimal policy structure, i.e., the No‐Splitting and Worse Cluster Replacement Rules, can be used to reduce the computational effort required to obtain optimal replacement policies. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

电晕放电辐射信号分析的小波基函数选取

研究电晕放电辐射信号既有利于消除其危害又有助于加强对其利用。针对小波变换提出在不同情况下对不同类型的电晕放电进行分析时,选取小波基函数的方法,理论上可以通过信号与小波波形的匹配或者通过计算信号与小波相关系数的方法来确定,而在不确定放电类型时可进行实际分析。