坦克兵力行为智能体模型研究

为了有效模拟兵力物理行为和智能行为的不同特性,提出了一个复合结构坦克兵力智能体模型,该模型综合了反应式行为和慎思行为两方面的优点。采用层次化组合方法建立了基于行为模式的兵力物理行为模型,使兵力智能体能对动态战场环境作出灵活的反应。结合兵力不同类型任务的分析,设计了基于规划的兵力智能行为模拟方法,使兵力智能体能按照战术原则进行作战任务规划。     

基于MAXSIM平台的巡逻战法仿真建模

MAXSIM平台具有良好的二次开发性,通过MAXSIM平台进行战法研究将更好地满足战术战役级的军事仿真需求。目前MAXSIM平台中巡逻战法只具备发现报告对方目标及返港能力、未能列出不同巡逻战法,通过行为编辑器（ BE）编写常用的巡逻战法,完善了MAXSIM平台的行为知识库（ BKB）,使水面舰艇具备发现敌方目标后进行追逐、攻击的能力,并提出根据Bezier曲线算法对目标航行轨迹进行预判的追逐方式,对进一步研究巡逻战法的应用具有借鉴意义。     

Minimal LST representations of MAP(n)s: Moment fittings and queueing approximations

A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n² for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016     

虚拟行为机制下的恶意代码检测与预防

Cohen证明了不存在一个算法可以精确地检测出所有可能的计算机病毒。MCDPM是一种基于虚拟行为机制的恶意代码检测方法,其目的是避开Cohen结论的限制,从而实现对恶意代码的有效检测和预防。MCDPM将传统的代码行为过程分解为虚拟行为发生和实际行为发生两个部分,通过对虚拟行为及其结果的监视和分析,实现对代码行为的精确检测。由于MCDPM的分析结果是建立在代码的确切行为之上,因此其判断结果是真实和准确的。对于非恶意代码,MCDPM则可以通过实际行为发生函数将其运行结果反映到系统真实环境,保持系统状态的一致性。MCDPM可以用于对未知恶意代码的检测,并为可信计算平台技术的信任传递机制提供可信来源支持。     

关于半鞅的可料表示性

利用鞅空间H1的泛函表示定理、泛函分析中的Hahn-Banach定理、半鞅向量随机积分的Girsanov定理,获得了半鞅可料表示性的特征。由于使用的是半鞅的向量随机积分,它推广了经典的结论。     

对警察执法与人权保护的思考

根据我国加入WTO以后面临的国际国内形势 ,客观分析了中国警察在人权保护领域的现状、存在的问题并提出了相应的对策 ,旨在提高中国警察的人权保护意识 ,优化我国的执法环境     

在越轨行为之外:大学生隐性逃课的社会学分析

隐性逃课是指学生上课时消极参与课堂教学的精神旷课行为,多被认为是越轨行为的一种表现。从社会学视角切入,对大学生隐性逃课问题进行分析,发现将隐性逃课视作越轨行为实际上是学术研究和教学实践过程中简单定性的结果,是对隐性逃课性质的片面反映。这种越轨定性导致了对隐性逃课功能认识、原因分析和应对路径设计的偏离。大学生隐性逃课具有社会根源,是多元社会与高校统一管理之间的张力以及大学无用论和信任危机的产物。在越轨属性之外,大学生隐性逃课还是一种去学校化的反抗和师生之间的默契妥协。因此,对于大学生隐性逃课,应将其置放在社会背景中加以思考,引发人们对社会根源和社会规则本身的关注。     

马克思主义人性观对思想政治教育的启示

马克思主义人性观有利于我们更加科学地、全面地认识人和分析人,对思想政治教育有着重要的指导意义:正确对待人的自然性,尊重官兵的物质利益诉求,发挥利益积极的调控作用;充分认识人的社会性,实施开放式思想政治教育,加强教育的整体性和针对性;发挥人的主体性,构建双向互动的主体性教育模式,激发官兵在教育中的积极性和创造性。     

合理情绪行为疗法在士兵情绪疏导中的应用

合理情绪行为疗法强调认知对人的行为的决定作用,它提供了一种帮助战胜不合理信念、改变不良情绪的有效方式。把合理情绪行为疗法应用于士兵的情绪疏导工作中,对部队的稳定和发展具有积极的现实意义。     

Designing rewards-based crowdfunding campaigns for strategic (but distracted) contributors

In rewards-based crowdfunding, entrepreneurs solicit donations from a large number of individual contributors. If total donations exceed a prespecified funding target, the entrepreneur distributes nonmonetary rewards to contributors; otherwise, their donations are refunded. We study how to design such campaigns when contributors choose not just whether to contribute, but also when to contribute. We show that strategic contribution behavior—when contributors intentionally delay until campaign success is likely—can arise from the combination of nonrefundable (potentially very small) hassle costs and the risk of campaign failure, and can explain pledging patterns commonly observed in crowdfunding. Furthermore, such delays do not hurt the entrepreneur if contributors are perfectly rational, but they do if contributors are distracted, that is, if they might fail to return to the campaign after an intentional delay. To mitigate this, we find that an entrepreneur can use a simple menu of rewards with a fixed number of units sold at a low price, and an unlimited number sold at a higher price; this segments contributors over time based on the information they observe upon arrival. We show that, despite its simplicity, such a menu performs well compared to a theoretically optimal menu consisting of an infinite number of different rewards and price levels under many conditions.