差分PSK安控指令解调系统的设计与实现

针对导弹安全遥控指令系统,提出采用差分PSK的解调体制.基于高速数字处理系统,运用正交相干采样消除副载波信号转变成基带数字信号的设计思想,从全数字化和易于软件实现的角度进行遥控指令解调系统的设计,实现在硬件设备不作任何改动的情况下,通过更换不同的软件完成多种体制全数字安控指令的调制与解调.给出了实现的方法和步骤,通过实验证明了设计的合理性.     

反导武器抗击顺序对舰艇反导能力影响的研究

根据舰艇的反导作战过程,结合不同武器的特点,分析了舰载反导武器不同的抗击顺序对舰艇反导能力的影响,给出了评价函数,计算了在一定的作战条件下,舰载反导武器的使用顺序,对舰艇反导作战有一定的参考价值.     

改革开放以来党对军队绝对领导的理论与实践

坚持党对军队的绝对领导是人民军队建军治军的根本原则和根本制度.伴随改革开放伟大历史进程的不断推进,党的历代领导集体毫不动摇地坚持党对军队的绝对领导,并在各个历史时期的国防和军队建设中丰富发展了这一根本原则的理论与实践.改革开放初期,党对军队绝对领导原则在拨乱反正中得以强调和坚持;改革深化时期,党对军队绝对领导原则在继承发扬中得以丰富和发展;新世纪新阶段,党对军队绝对领导原则在开拓创新中得以巩固和完善.     

“和声”词义的历史辨析

“和声学”作为音乐专业的骨干理论课程,涉及到音乐的各个领域。本文从音乐发展的不同时期,探讨“和声”词义的演变过程及具体内涵。     

陆军师进攻战术演习机动处置能力评估模型

依据现行的陆军军事训练大纲、战术机动理论对陆军师进攻战斗中机动能力处置阶段需评估的重点问题进行定量分析,主要是通过对克服敌侦察迟滞、兵力迟滞、火力迟滞、障碍迟滞中评估要点的定性、定量分析,建立相应的评估规则和数学模型。     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

豪华游艇用双层减振（浮筏式）装置研究

本文介绍了我国首套实用浮筏式减振装置的设计要点,尤其对中间浮筏体的模态进行了理论分析;对实艇安装后的实测减振效果进行了分析和讨论,特别对管路传递结构声的影响作出了分析。     

12150L发动机工作状况监测系统

介绍了12150L发动机工作状况监测系统的组成,各参数的检测原理、应用,控制系统和数据处理的工作原理.     

柴油机燃油喷油量的试验计算方法研究

介绍了一种根据外卡式传感器测量的电压波和几何供油规律计算循环喷油量的新方法,并在12150L发动机用喷油泵试验台上进行了验证.试验表明该方法能实现对喷油量的不解体测量.     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017