分布式态势感知一致性分析与度量方法研究

一致的态势感知,是现代武器、火力系统以及部队紧耦合协同作战的基础。本文以分布式态势感知理论为依据,从系统的角度,构建了团队达成一致态势感知过程的动力学模型;以系统内部一致性、外部一致性和一致所需最短时间为指标,给出了团队态势感知一致性的度量方法。仿真结果表明,适当地提高团队内沟通的广泛度和相互作用强度,选择合适的沟通网络,对提高一致性能力有积极的作用。     

侵华日军暴行的铁证——日军战俘及投诚官兵控诉日军暴行档案揭秘

解放军档案馆馆藏档案中,珍藏着多件抗战期间被改造日军战俘和投诚日军官兵控诉侵华日军暴行的档案,从暴行直接参与者、见证人的视角,反思、忏悔和揭露侵华日军对中国军民所犯下的累累罪行,是研究侵华日军暴行极其重要的历史文献。70多年后的今天,公布和研究这些档案史料,对于世人了解日本侵华战争的血腥历史和日本军国主义的滔天罪行,驳斥日本右翼势力刻意篡改历史、美化侵略行径的恶毒言论,警示爱好和平的人们,具有十分重要的意义。     

从村长制度到村民代表会议制度——抗战初期晋察冀边区的村政建设

村政权是抗日民主政权的基石。抗战初期,晋察冀边区改造旧村政权,建立抗日民主村政权,经历了半政权性质的村"动委会",到民选抗日村长,再到建立村民代表会议这样一个逐步改革的过程。打破了几千年的封建邻闾制,人民真正争得了当家作主人的权利和地位。历史证明,民主选举是实现基层民主政治建设的助推剂;边区村级政权"议行合一"的一元化体制,是适合中国国情的不同于英美式民主的新民主主义新路径;中国共产党的领导是保证村政权改造和健全的关键;坚持民主集中制原则,实行集体领导,民主决策,依法施政,是村政权建设的发展方向;坚持用制度机制规范和约束权力,是确保村级政权工作人员始终保持良好作风的根本方法。     

Optimal and asymptotically optimal policies for assemble‐to‐order n‐ and W‐systems

We consider two specially structured assemble‐to‐order (ATO) systems—the N‐ and W‐systems—under continuous review, stochastic demand, and nonidentical component replenishment leadtimes. Using a hybrid approach that combines sample‐path analysis, linear programming, and the tower property of conditional expectation, we characterize the optimal component replenishment policy and common‐component allocation rule, present comparative statics of the optimal policy parameters, and show that some commonly used heuristic policies can lead to significant optimality loss. The optimality results require certain symmetry in the cost parameters. In the absence of this symmetry, we show that, for systems with high demand volume, the asymptotically optimal policy has essentially the same structure; otherwise, the optimal policies have no clear structure. For these latter systems, we develop heuristic policies and show their effectiveness. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 62: 617–645, 2015     

梅花型布置双排抗滑桩合理桩位研究

结合滑坡推力作用下梅花型布置双排抗滑桩成拱机理对其合理桩位进行研究。参考前人对单排桩合理桩间距的研究成果,运用理论推导和数值模拟得到相邻前后排桩桩间土拱跨度的控制表达式。同时,考察了桩间距和桩排距对土拱效应的影响,并绘制了lx′-ly′区间分布图。利用双排桩在滑坡上的有效影响面积,结合区间分布图推导出合理的桩间距和桩排距。结果表明,合理的桩间距和桩排距能够使前后排桩桩间形成直接土拱,并催生间接土拱,进而使前后排桩相互配合,共同起到支挡作用。     

特种防护舱抗爆性能试验研究

为探讨特种防护舱抗爆性能,进行了舱内爆炸原型试验,研究不同装药量下开闭盖状态防护舱内爆炸时的空气冲击波超压和舱体位移过程。结果表明:同药量下闭盖状态的空气冲击波超压明显高于开盖状态,即封闭舱内偶然爆炸时空气冲击波超压更高;随装药量的增大,舱壁的空气冲击波超压也在增大;舱体侧壁经过多次正反射作用均未发生碎片反应,顶盖泄爆措施对降低底板的空气冲击波超压十分有利;距爆心较近处的位移均比距爆心较远处的位移大。原型试验舱体完全破坏,但结构未发生崩溃式破坏,并无碎片及内爆的二次破片飞出,舱体具有一定的抗爆性能和较好的防破片能力。     

基于犯罪预防的高层住宅小区防卫设计策略探析

过快的城市化进程引发了包括住区犯罪在内的一系列城市问题。住宅小区的规划设计虽不是导致犯罪发生的直接原因,但其在设计上的缺陷却为犯罪的实施提供了一定的便利。高层住宅小区相比于多层住宅小区,在基于犯罪预防的防卫设计层面存在更为突出的问题。从现状入手,通过实地调研,分析了高层住宅小区在防卫设计上的难点,并从车行道路的规划、半公共领域的界定、单体设计的要点、绿化设计的布局等4个方面提出了防卫设计策略,为高层住宅小区的规划设计提供参考。     

被动全向声纳浮标跟踪潜艇的优化布放方法

反潜飞机利用被动全向声纳浮标可以隐蔽地跟踪潜艇,但浮标消耗量大。在满足定位精度的条件下,如何优化布放浮标以便有效增加跟踪时间是一个亟待解决的问题。首先分析了浮标探测性能和浮标群相对位置对定位精度的影响,得到浮标布放的五种基本原则;然后结合水下目标跟踪技术提出了两种用被动全向声纳浮标跟踪潜艇的优化布放方法:一种是利用遗传算法来优化每一枚浮标的布放位置,另一种是将一批次投放2-4枚浮标的多维优化问题简单转换成一维优化问题来确定浮标的布放位置。最后仿真计算了这两种方法的跟踪性能及浮标消耗量。仿真结果表明,两种优化布放方法均能满足跟踪要求,前者的浮标消耗量比后者略少,但后者的投放批次少很多,有利于减少人员的工作量。     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Coordinated pricing and inventory control problems with capacity constraints and fixed ordering cost

This article addresses a single‐item, finite‐horizon, periodic‐review coordinated decision model on pricing and inventory control with capacity constraints and fixed ordering cost. Demands in different periods are random and independent of each other, and their distributions depend on the price in the current period. Each period's stochastic demand function is the additive demand model. Pricing and ordering decisions are made at the beginning of each period, and all shortages are backlogged. The objective is to find an optimal policy that maximizes the total expected discounted profit. We show that the profit‐to‐go function is strongly CK‐concave, and the optimal policy has an (s,S,P) ‐like structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012