移动式铁路油罐车清洗装置水循环使用与节能分析

装备节能研究对建设绿色节能型社会具有重要意义。对移动式铁路油罐车清洗装置中清洗管路和吸污管路的热损进行分析计算,提出了水掺混循环使用的节能清洗方案,对清洗工艺中的传热过程、水循环使用中水掺混比例进行了详尽的分析计算,并对节能效果进行了分析。结果表明,清洗管路系统热损较低,水掺混循环使用的节能效果明显。     

一卡通系统在实际工作中的应用及思考

随着社会信息化时代的到来,＂数字化＂在社会的各个领域中取得了重大的进展,高速网络环境已逐步覆盖各个领域。与此同时,社会的管理与资金的流通也将进入信息化的革命变革中,＂一卡通＂正是这一信息化革命的产物。介绍了＂一卡通＂的含义及功能,分析其现状及发展趋势,提出强化顶层设计,不断遏制信息孤岛滋生的措施。     

军队院校图书馆在OA模式下的发展策略

OA是一种新兴的学术信息交流模式。它促进了学术交流,免费向公众开放学术信息。简要阐述OA的发展及其现状,分析OA运动对军队院校图书馆的意义,并探讨了OA环境中军队院校图书馆的发展策略。     

装备维修社会化研究

新型装备的科技含量不断提升,战场透明度不断增大,装备的损坏率也在不断提高,如何快速抢修损坏装备,恢复其保障能力,是事关战争胜负的一个关键环节。针对装备维修力量如何满足未来信息化战争装备保障需求,分析了装备维修社会化的必要性与可行性,提出了装备维修社会化的模式构想。     

基于本体的信息与信息空间及其代数结构

实现特定信息环境下基于信息组织的信息资源服务,需要对信息、信息空间有更合适的、形式化的描述。文章基于本体层次对信息、信息的运算、信息之间的关系以及信息空间给出了数学描述并对其代数结构进行了研究。从而为特定信息环境下的信息资源服务提供理论支撑。     

Designing and pricing menus of extended warranty contracts

Extended warranties provide “piece of mind” to a consumer in that product failures which occur after the base warranty expires are rectified at little or no cost. They also provide an additional source of revenue for manufacturers or third‐party providers, such as retailers or insurance providers, and help cultivate consumer loyalty. In this article, we analyze a number of extended warranty contracts which differ in design, including restrictions on deferrals and renewals. With the use of dynamic programming, we compute the optimal strategy for a consumer with perfect information and determine the optimal pricing policy for the provider given the consumer's risk characterization. We also provide insight into when different contracts should be issued. Finally, we illustrate how profits can be dramatically increased by offering menus of warranty contracts, as opposed to stand alone contracts, with the use of integer programming. Surprisingly, risk‐taking consumers provide the greatest benefit to offering menus. These insights can help a company develop a comprehensive warranty planning strategy for given products or product lines. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Optimal control policies for an inventory system with commitment lead time

We consider a firm which faces a Poisson customer demand and uses a base‐stock policy to replenish its inventories from an outside supplier with a fixed lead time. The firm can use a preorder strategy which allows the customers to place their orders before their actual need. The time from a customer's order until the date a product is actually needed is called commitment lead time. The firm pays a commitment cost which is strictly increasing and convex in the length of the commitment lead time. For such a system, we prove the optimality of bang‐bang and all‐or‐nothing policies for the commitment lead time and the base‐stock policy, respectively. We study the case where the commitment cost is linear in the length of the commitment lead time in detail. We show that there exists a unit commitment cost threshold which dictates the optimality of either a buy‐to‐order (BTO) or a buy‐to‐stock strategy. The unit commitment cost threshold is increasing in the unit holding and backordering costs and decreasing in the mean lead time demand. We determine the conditions on the unit commitment cost for profitability of the BTO strategy and study the case with a compound Poisson customer demand.     

区块链在分队战术协同中的应用构想

从战术分队角度出发,探讨了区块链技术在作战实体之间的信息交互及智能协同方面的应用设想,分析了战术分队信息交互的相关技术及面临的挑战,阐述了区块链在未来战术分队指挥体系构建中的发展构想。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种改进的事件驱动系统框架

在给出事件驱动系统安全漏洞的基础上,指出了产生漏洞的根本原因是:系统忽视了输入系统的事件序列之间存在的相关性;系统无条件信任任何事件源产生的事件.针对这两个原因,相应提出了事件序列形式安全分析模型及基于事件源的可信度评估模型,依据这两个模型,构建了一种改进的事件驱动系统框架.