着眼为维护国家利益提供战略支撑大力加强海军部队党委班子能力建设

我军新的历史使命为军队党组织加强能力建设提出了新的更高要求。着眼履行新使命,加强海军部队党委班子能力建设,应当把提高战略筹划能力摆在突出位置,把提高未来作战指挥能力作为重中之重,把提高科学管理能力作为关键环节,努力为维护国家利益提供有力的战略支撑。     

考虑可信度时导弹最大射程的Bayes评估

首先讨论了一种验前数据和现场试验数据相容性检验的新方法, 考虑验前信息可信度, 研究了导弹最大射程的 Ｂａｙｅｓ 评定和 Ｂａｙｅｓ 估计。最后给出了数据分析的例子。     

基于Internet的虚拟博物馆自动生成系统

采用通用的VRML生成器和QuickTime播放器,基于Internet国际互联网环境,通过对国际现有的VRML生成器性能的对比,应用VRML语言,构造出一个虚拟的境界。虚拟博物馆自动生成系统的各个参数均存储在数据库中,需要时可以随时设计博物馆的虚拟场景并与其他应用程序挂接。利用该系统构造的虚拟的境界,使参观者获得与真实博物馆一样的感觉。     

基于查找表的像素处理器新算法

本文在基本的像素处理算法的基础上，提出了一种基于查找表的快速平滑插值算法。该算法不仅运算量小、精度较高，而且易于硬件实现，适合于高速显示处理系统中。     

科学构建信息时代我军舆论战基本理论

科学构建信息时代我军舆论战基本理论,主要包括基础理论、指挥理论、法规理论和战法理论,对我军加强军事斗争准备、打赢未来信息化战争具有重要的理论价值和现实意义。     

离散小波变换在被动声目标识别中的应用

研究了战场被动声目标鲁棒特征参数的提取,分析了战场声信号与语音信号特征的相似性,提出基于MFCC参数的战场声目标识别方法。针对战场环境存在强噪声干扰情况,提出一种改进的MFCC特征参数(DWTMFCC)提取方法,该方法将小波分析和MEL倒谱分析结合,提高了特征参数的鲁棒性。仿真结果表明:在噪声条件下,利用DWTMFCC参数进行声目标识别,平均识别率比MFCC参数高出3.134个百分点,信噪比为5dB时,识别率仍达到93.67%。     

外语教师也能搞科研——教学行动研究与大学英语教学

教学行动研究是语言教学研究的一种重要形式,它来源于教学,服务于教学,是一种适合教师从事教学研究的方法。本文简介了教学行动研究的概念和特征,实施教学行动研究的基本步骤和研究方法,以及其在大学英语教学中的应用。     

Statistical analysis for masked system life data from Marshall‐Olkin Weibull distribution under progressive hybrid censoring

This paper considers the statistical analysis of masked data in a series system, where the components are assumed to have Marshall‐Olkin Weibull distribution. Based on type‐I progressive hybrid censored and masked data, we derive the maximum likelihood estimates, approximate confidence intervals, and bootstrap confidence intervals of unknown parameters. As the maximum likelihood estimate does not exist for small sample size, Gibbs sampling is used to obtain the Bayesian estimates and Monte Carlo method is employed to construct the credible intervals based on Jefferys prior with partial information. Numerical simulations are performed to compare the performances of the proposed methods and one data set is analyzed.     

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014