对加强公安边防部队基层党支部能力建设的几点思考

为加强公安边防部队基层党支部能力建设,必须着力提高基层党支部从政治上思想上建设部队、管边控边、强化自身建设、领导决策和依法办事的能力,在执勤执法和推进＂爱民固边＂中发挥战斗堡垒作用。     

光电坐标传感器在光幕靶中的应用

针对光电报靶系统的标校问题,以及可见光光幕靶光电接收器检测灵敏度的一致性和与海量数据的高速采集问题,采用大发射角的LED发光管,设计了光电开关电路和高速采样保持电路,实现了基于光电开关和取样电阻网络的光电坐标传感器,提高了系统的检测灵敏度和一致性,降低了系统设计的难度和成本。试验证明：该方法精度较高,具有良好的应用前景。     

高校学生党支部建在班上的SWOT分析与实践

高校学生党支部建在班上拥有坚实的理论基础和实践基础,然而,高校学生党支部建在班上在实践中也存在一系列问题。本文采用SWOT分析分法,对高校学生党支部建在班上的优势、劣势、机遇、威胁进行了较为详细的研究,并在此基础上,有针对性地提出了高校学生党支部建在班上的实践方案。研究结果有助于我们对“学生党支部建在班上”有更加客观、全面的认识,并更好地加以改造和利用。     

基于QFD的维修质量管理部门设计

介绍了质量功能展开(quality function dep loym ent,QFD)的基本原理,分析了维修质量管理的目标和维修质量环,并结合具体案例,阐述了QFD在维修质量管理部门设计中的应用方法。     

Dual‐ascent and primal heuristics for production‐assembly‐distribution system design

This article proposes two dual‐ascent algorithms and uses each in combination with a primal drop heuristic embedded within a branch and bound framework to solve the uncapacitated production assembly distribution system (i.e., supply chain) design problem, which is formulated as a mixed integer program. Computational results indicate that one approach, which combines primal drop and dual‐ascent heuristics, can solve instances within reasonable time and prescribes solutions with gaps between the primal and dual solution values that are less than 0.15%, an efficacy suiting it for actual large‐scale applications. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

基于支路屏蔽思想的模拟电路故障字典的自动建立方法

通过分析传统的故障字典法存在的问题,提出了一种完全不同于传统方法的新的故障字典法。该方法依据支路屏蔽的思想,通过逐一屏蔽电路的各支路,建立起能诊断软、硬两类故障的故障字典。详细阐述了该字典的自动建立方法和原理,并通过诊断例子,证明了该方法的有效性。     

地网对垂直偶极子天线辐射特性的影响

研究地网对垂直偶极子天线辐射特性的影响。建立了该天线的仿真模型,采用基于矩量法的仿真软件计算了铺设地网后垂直偶极子天线增益、输入阻抗、最大辐射仰角、3 dB波瓣宽度等辐射特性。结果表明,地网中心偏离天线振子正下方0.75λ时能显著提高天线的增益,改变地网大小和铺设密度也能在一定程度上提高天线的增益。     

Cyclic preference scheduling for nurses using branch and price

This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

鱼雷气幕屏蔽和降噪的实验研究

利用气流提高鱼雷螺旋桨叶片处的压力,减少螺旋桨的空泡,从而降低鱼雷辐射噪声,以及利用人工气幕屏蔽螺旋桨噪声,可以大大减小在鱼雷基阵处的自噪声。实验研究表明,在鱼雷自导工作的频率范围,可降低自噪声约１０ｄＢ以上。     

Scheduling deteriorating jobs to minimize makespan

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J_j grows by w_j with each time unit its start is delayed beyond a given common critical date d. This processing time is p_j if J_j starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n²d(D − d) time and O(nd(D − d)) space, the other runs in p_j)²) time and p_j) space. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 511–523, 1998