地理信息服务系统软件架构设计

从目前我国指挥控制系统中地理信息使用存在的问题出发,结合指挥信息系统的实际工作需要和现代战争作战趋势与发展方向,应用服务化与网络化系统技术理念,提出了基于SOA的地理信息服务的软件架构,使部队现有的应用系统之间的地理信息协同与共享,为部队作战任务和决策提供地理信息的有力支撑,并给出了具体的软件模块设计。     

服务职能视域下的公安边防部队思想政治教育

服务职能是思想政治教育的一项基本职能。公安边防部队思想政治教育要服务于社会、服务于边防部队和官兵个人,以增强思想政治教育的完整性和实效性,提高边防部队的凝聚力和战斗力。在对目前公安边防部队思想政治教育服务职能的现状及原因进行分析的基础上,从坚持以人为本教育理念、紧贴现实更新教育内容、充分利用教育资源和现代手段、完善考评监督保障机制四个方面,提出了加强服务职能的对策。     

边消警文献信息资源保障体系建设构想

阐述了边消警文献信息资源保障体系建设的内涵和建设原则,从资源体系建设、服务体系建设、网络平台建设和保障体系建设等四方面对边消警文献信息资源保障体系建设的内容进行了探讨.     

构建真人图书馆 创新军校图书馆服务模式

在梳理真人图书馆发展历程的基础上,分析了真人图书馆的主要特征及军校图书馆尝试真人图书馆服务模式的意义和优势条件,探讨了军校图书馆如何利用真人图书馆创新服务模式。     

Single machine just‐in‐time scheduling problems with two competing agents

In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014     

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     

Approximation algorithms for capacitated stochastic inventory systems with setup costs

We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014     

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

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

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

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