Optimal source placement for point coverage in active multistatic sonar networks

The allocation of underwater sensors for tracking, localization, and surveillance purposes is a fundamental problem in anti-submarine warfare. Inexpensive passive receivers have been heavily utilized in recent years; however, modern submarines are increasingly quiet and difficult to detect with receivers alone. Recently, the idea of deploying noncollocated sources and receivers has emerged as a promising alternative to purely passive sensor fields and to traditional sonar fields composed of collocated sources and receivers. Such a multistatic sonar network carries a number of advantages, but it also brings increased system complexity resulting from its unusual coverage patterns. In this work, we study the problem of optimally positioning active multistatic sonar sources for a point coverage application where all receivers and points of interest are fixed and stationary. Using a definite range sensor model, we formulate exact methods and approximation algorithms for this problem and compare these algorithms via computational experiments. We also examine the performance of these algorithms on a discrete approximation of a continuous area coverage problem and find that they offer a significant improvement over two types of random sensor deployment.     

Clustered coverage orienteering problem of unmanned surface vehicles for water sampling

This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites.     

基于视频叠加的心理暗示信息生成和影响机制研究

针对心理战中潜移默化影响对象国民众的需求,提出了基于视频叠加的心理暗示(PSBOVS)的构想,从心理依据和视频基础两个方面研究了视频叠加暗示信息的生成和影响机制。给出了基于视频叠加的心理暗示效应过程模型,并结合心理因素对信息生成进行了视频建模和参数分析,从暗示信息被接收、注意、理解和接受的角度,对信息内容和形式的确定进行了论述。为暗示信息有效编码进而有效影响受众心理提供了理论依据和决策支持。     

公安派出所消防监督工作现状及问题分析

结合公安派出所消防监督工作现状,深入分析了当前在落实派出所消防监督管理职责方面存在的突出问题,就进一步提高和加强基层公安派出所消防监督管理工作提出了具体意见和建议。     

部队基层思想政治教育中亟待解决的几个问题

贯彻落实新的《军队思想政治教育大纲》,部队基层必须着力解决重视不够、摆位不正的问题,转变与时代不相符的思想政治教育观念,创新和改进思想政治教育的内容和手段,提升思想政治教育队伍的综合素质,创新和完善思想政治教育机制,进一步优化思想政治教育环境。     

公安警卫部队青年警官心理压力的社会学分析

由于职业性质的特殊性,公安警卫部队青年警官在工作中都承受着一定的心理压力。过度的心理压力不仅影响青年警官个人身心健康,同时也直接影响公安警卫部队的各项建设及警卫任务的圆满完成。分析公安警卫部队青年警官承受的心理压力,研究缓解其压力的途径与对策,对发挥公安警卫部队青年警官工作积极性与创造性,提高部队战斗力具有重要的现实意义。     

求解旅行商问题的两步法

基于度约束最小树算法提出了一个解决旅行商问题的算法（即两步法）,针对这一算法我们进行了大量的数据实验,数据实验表明算法是非常有效的。     

天基预警系统资源调度方法

对面向导弹预警任务的天基预警系统中的低轨卫星资源调度问题进行了研究.对预警任务的特性进行分析,提出了一种预警任务规划与分解方法以减少任务对资源占用时间的需求;在此基础上建立了该问题的约束满足CSP调度模型;针对该模型变量多、解空间规模庞大的特点以及对求解算法时效性的要求,设计了一种基于局部解空间跳出机制的改进型遗传算法MGA.仿真表明该模型与算法在给定时间内能够得到满意的调度方案.     

装甲装备战斗毁伤模拟策略研究

战损规律数据是装备寿命周期各项BDAR工作的重要依据,结合物理试验数据进行战斗毁伤模拟是获取战损数据的重要途径,随着新技术手段的不断出现为探索毁伤模拟方法提供了新的契机.为此归纳总结了装甲装备战斗毁伤模拟的问题特征,综述了国内外的研究现状并剖析了现行方法对问题的解决程度,在此基础上提出了引入复杂系统的研究方法,基于三维元胞自动机和Agent技术建立了模型的仿真框架,说明了依据该方法进行问题研究的有效性和前瞻性.     

大学生常见心理问题与防治

当代大学生心理健康问题日益凸现,涉及到生活、学习、社交、恋爱、就业等方方面面。教育者要积极对大学生进行抗挫折教育、人际关系教育、适应性教育、心理健康教育,创造良好的校园文化环境,提供心理咨询帮助,使大学生能健康成长。