师生心理场探析

教育、教学的双边活动构成了师生心理场。本文从心理学与社会学的角度对师生心理场的运行机制作了简单的介绍,进而从"教"与"学"的双向活动中对师生心理场的诸多因素进行分析和评价,并就"教"与"学"活动在理论与实践的结合上做了一定的探索。     

基于人工神经网络的操作手IKP 求解

人工神经网络以其信息的并行处理与分布式存储、自组织和自适应等特点,在机器人领域显示了极大的应用潜力。本文探讨人工神经网络在机器人操作手ＩＫＰ求解中的应用,试图求得操作手ＩＫＰ的一组或所有可行解。文章利用ＢＰ网络对操作手ＩＫＰ的求解进行了讨论和分析,并给出了具体的求解实例。     

Did the Panamanian Defense Forces conduct infiltration operations at the Arraijan Tank Farm in 1988?

This article reviews the circumstances surrounding a relatively obscure and almost forgotten US Marine Corps and Army security enhancement operation undertaken in Panama that commenced in early April of 1988. Marines were sent to Panama to protect oil and ammunition storage facilities from potential saboteurs. By April 1989 they had reported sighting armed, uniformed intruders on at least 43 occasions and receiving gunfire or discharging their own weapons during 16 incidents. Yet despite the repeated barrages of small arms fire over the course of a year, they failed to recover enemy ammunition, bodies or body parts and their own equipment and positions displayed no signs of suffering from hostile fire. This article analyzes the events from the point of view of a veteran of the operation and highlights the role that psychological operations may have played in generating the situation.     

基于多假设跟踪弹道导弹主动段跟踪算法

针对弹道导弹主动段防御中多枚弹道导弹同时跟踪问题,提出了基于多假设思想的主动段跟踪算法.重点阐述了该算法中假设生成、假设概率计算、假设约简以及假设剪枝等环节.从工程实用的角度出发,采用求解一个线性分配问题(LAP)方法得到M个最优假设,大大减少了假设数量,并运用N-scan回溯剪枝方法对假设进行剪枝,确定要输出的航迹,提高了算法的效率和实用性.仿真实验表明,该算法能够对主动段多枚弹道导弹目标准确关联跟踪.     

面向多最优解组合优化问题的决策求解算法

针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mⁿ)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。     

海警部队执勤训练中官兵心理问题探析

公安边防海警部队官兵在海上训练、执勤、执法实践中,由于种种因素诱发出多种心理问题。着重探析海警部队海上执勤训练中官兵心理问题的主要表现及其主要原因,旨在探讨解决官兵心理问题的主要途径。     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

Transformations of node‐balanced routing problems

This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015     

政治警官个性心理特征与岗位匹配初探

提升工作效率和促进人生成功是个性心理特征与岗位匹配的逻辑起点,在部队政治工作中实现政治警官个性心理特征与岗位匹配,对于提高政治工作效益有着十分重要的现实意义.更新选用理念,创新测量技术,完善选用制度是实现政治警官个性心理特征与岗位匹配的有效路径.