穿浪双体船尾板减阻数值分析

基于RANS方程,采用RNG k-ε湍流模型和VOF两相流模型,研究了尾板长度与安装角度对穿浪双体船总阻力的影响规律.计算结果表明:尾板可以调整穿浪双体船的航态,达到有效降低阻力的目的;减阻在一定速度范围内有效,减阻的效果取决于尾板安装角度和长度,但阻力的减少并不与安装角度和长度成比例,最佳的安装角度约为3°～6°,长度约为1％～2％ LWL.     

反潜鱼雷两雷平行航向齐射最小齐射距离计算方法研究

提出了2种计算反潜鱼雷两雷平行航向齐射最小齐射距离的方法———几何法和概率法,并对2种方法进行了比较.结果表明,概率法比几何法更加实用.所提出的计算方法对今后有关部门设计或改进舰艇指控系统软件具有重要参考价值.     

基于非齐次线性方程组的认证协议的研究

认证技术是信息安全理论与技术的一个重要方面.认证技术主要包括用户认证和信息认证2个方面.前者用于鉴别用户身份,后者用于保证信息的真实来源.本文基于线性代数的方程组的解的理论建立了一种身份认证协议和一种消息认证协议.通过安全性分析结果表明这个新的身份认证协议能够保证用户身份的正确认证,新的信息认证协议能够保证数据的机密性、完整性,同时能够防止重传攻击认证信息来源.     

Approximations and empirics for stochastic war equations

The article develops a theorem which shows that the Lanchester linear war equations are not in general equal to the Kolmogorov linear war equations. The latter are time‐consuming to solve, and speed is important when a large number of simulations must be run to examine a large parameter space. Run times are provided, where time is a scarce factor in warfare. Four time efficient approximations are presented in the form of ordinary differential equations for the expected sizes and variances of each group, and the covariance, accounting for reinforcement and withdrawal of forces. The approximations are compared with “exact” Monte Carlo simulations and empirics from the WWII Ardennes campaign. The band spanned out by plus versus minus the incremented standard deviations captures some of the scatter in the empirics, but not all. With stochastically varying combat effectiveness coefficients, a substantial part of the scatter in the empirics is contained. The model is used to forecast possible futures. The implications of increasing the combat effectiveness coefficient governing the size of the Allied force, and injecting reinforcement to the German force during the Campaign, are evaluated, with variance assessments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

非定常超音速流动数值计算方法比较

为适用于非定常流场计算 ,在保证时、空二阶精度的前提下 ,通过引入变系数残值光顺技术 ,提高了四步Runge Kutta方法的计算效率 ;并针对球锥简谐振动过程 ,数值比较Runge Kutta多步法和“双时间法”的计算精度。     

三对角方程组的分布式SPP算法

发展了单向并行分裂法(SPP)用于求解三对角和块三对角线性方程组,算法考虑了三对角线性系统求解中文件IO及结果传输通信所占时间比例较大的特点,充分利用了计算、文件IO与通信三者之间的重叠。分析了SPP算法的计算与通信开销。在工作站机群上进行了测试分析,结果表明SPP算法适合于分布式计算     

正扰动下一类RN上临界增长的椭圆型方程的正解的存在性

本文讨论了如下方程:并得到了它的正解的存在性,其中g(x,U)为U~(P-1)的低阶扰动。它是文[1]的继续。     

Applying Lanchester's linear law to model the Ardennes campaign

In modern warfare, many believe the decisive factor in winning a battle is seizing the right moment to shift from defense to attack, or vice versa. This paper attempts to bring that perspective to Lanchester's differential equations of warfare, and continues the application of Lanchester's linear law to the analysis of the World War II battle of Ardennes, as reported in earlier issues of Naval Research Logistics by Bracken and by Fricker. A new variable, shift time, accounting for the timing of the shift between defense and attack is explicitly included in our version of the model, and it helps obtain improved goodness of fit to historical data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:653–661, 2001     

Minimal LST representations of MAP(n)s: Moment fittings and queueing approximations

A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n² for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016     

Effective attacks in the salvo combat model: Salvo sizes and quantities of targets

This article considers two related questions of tactics in the context of the salvo model for naval missile combat. For a given set of targets, how many missiles should be fired to produce an effective attack? For a given available salvo size, how many enemy targets should be fired at? In the deterministic version of the model I derive a simple optimality relationship between the number of missiles to fire and the number of targets to engage. In the stochastic model I employ the expected loss inflicted and the probability of enemy elimination as the main performance measures and use these to derive salvo sizes that are in some sense “optimal.” I find that the offensive firepower needed for an effective attack depends not only on a target's total strength but also on the relative balance between its active defensive power and passive staying power. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007