两栖型指控车非线性横摇安全盆侵蚀研究

采用单自由度系统研究了两栖型指控车在规则波激励下的非线性横摇和倾覆,非线性横摇控制方程应用四阶龙格库塔法进行数值积分;以波浪扰动力矩的幅值和波浪的频率作为变量,研究了两栖型指控车的安全盆侵蚀问题。以波浪扰动力矩的幅值为变量的安全盆侵蚀研究结果表明:当波浪扰动力矩大于0.01时,安全盆开始出现侵蚀现象,当波浪扰动力矩大于1.84时,安全盆的安全域已经变成了几个离散的点,随着波浪扰动力矩继续增大,安全盆的安全域将继续严重侵蚀,直到消失为止。以波浪频率为变量的安全盆侵蚀研究结果表明:两栖型指控车的安全盆侵蚀对波浪的频率敏感,安全盆出现明显的侵蚀;随着频率的增大,安全盆侵蚀将不会发生,表明两栖型指控车对高频波浪是安全的。     

基于随机冲击的相关竞争失效可靠性评估

针对电子产品在工程实践中受随机冲击应力的影响及多失效模式的问题,以累积冲击和极限冲击来描述产品的冲击过程,考虑失效模式相关性并建立了随机冲击下产品竞争失效模型。以具有自然耗损和突发耗损特点金属化膜脉冲电容器为对象,进行了可靠性对比分析,验证了模型的合理性和有效性,为遭受复合应力影响的电子产品的可靠性评估提供了一种新方法。     

语用学理论在影视对白翻译中的应用

影视对白与影视剧中的情境紧密相连,而语用学正是研究在不同的语言交际环境下如何理解和运用语言的。因此将语用学理论应用到影视对白翻译中,对提高影视对白翻译质量、准确生动地再现原剧作的思想性和艺术性、让目的语观众产生与原文观众相同的感受具有重要的指导意义。在翻译实践中,应坚持等效原则、会话合作原则及关联原则。     

罗兰-C 地波传播海岸效应中驻波扰动现象的空间分析

为了提高海岸区域低频地波传播特性预测精度,研究了基于 J．R．Wait 及 FDTD 全波分析算法的罗兰-C 信号海岸效应预测模型;对罗兰-C 信号传播至海岸线时的电场幅度与相位的空间驻波状扰动现象进行了仿真比较;分析了突变和线性渐变两种陆海分界模型下,该扰动在近海岸区域的地／海面及其上空的分布规律,并指出该扰动存在波前倾斜现象。仿真分析表明：该研究进一步克服了 J．R．Wait 算法的局限,限定了驻波扰动变化量级与其在三维空间的分布范围,有助于同时提高罗兰-C 系统在海岸区域地／海面及空中的导航授时精度。     

Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process

Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014     

正反向量子斯特林循环有限时间热力学性能界限和优化准则

研究了正反向量子斯特林循环的最优性能.在经典极限下,导出了循环的有限时间热力学性能界限和优化准则.得到了斯特林热机、制冷机和热泵特性参数之间的优化关系.     

连续求解样本协方差矩阵迹的快速递推算法

为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004