潜艇交流电力推进中的变频技术

采用交流电力推进是潜艇发展的方向 .交流推进主要采用变频调速 ,文中对潜艇中使用的变频技术做了比较详细地论述 ,对其发展趋势进行了展望并对其应用情况作了简单介绍 .     

基于工控机的导弹指令系数测量方法

指令系数是防空导弹测试中比较重要的参数之一 ,通过对指令系数计算方法的分析 ,得出舵控信号起始采样时刻不会影响测量结果的结论 ,从而大大简化了测量系统的硬件结构和数据采集过程 ,提高了测量系统的稳定性 ,经过较长时间的应用表明 ,测量结果稳定性高 ,一致性好。     

General multiprocessor task scheduling

Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one‐job‐on‐one‐machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocation, and manufacturing systems that may require several resources simultaneously to process a job, we study the problem with a one‐job‐on‐multiple‐machine model. In our model, there are several alternatives that can be used to process a job. In each alternative, several machines need to process simultaneously the job assigned. Our purpose is to select an alternative for each job and then to schedule jobs to minimize the completion time of all jobs. In this paper, we provide a pseudopolynomial algorithm to solve optimally the two‐machine problem, and a combination of a fully polynomial scheme and a heuristic to solve the three‐machine problem. We then extend the results to a general m‐machine problem. Our algorithms also provide an effective lower bounding scheme which lays the foundation for solving optimally the general m‐machine problem. Furthermore, our algorithms can also be applied to solve a special case of the three‐machine problem in pseudopolynomial time. Both pseudopolynomial algorithms (for two‐machine and three‐machine problems) are much more efficient than those in the literature. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 57–74, 1999     

基于模糊推理的目标对潜发现问题研究

基于模糊推理基本思想,针对潜艇水下收集目标信息的特点,在目标对潜艇威胁信息存在不确定性因素的基础上,建立了判断潜艇被发现与否的指标体系,应用模糊推理方法建立了判断规则,并给出了推导过程和实现方式,在把模糊推理方法应用于潜艇威胁判断模型的研究上做了初步尝试。     

弹炮结合武器系统作战效能评估

弹炮结合系统是一种有效的防空武器系统,但以往对该武器系统的作战效能评估存在两方面不足:一是较少考虑攻防双方的对抗以及环境对作战效能的影响,使得出的指标可信度降低;二是不同国度、类别、型号的武器系统没有构建统一的价值可比空间,使获得的指标缺乏横向可比性.为此利用灰色关联综合优化法有关原理,给出弹炮结合防空系统作战效能的评价指标体系,确立了相关的隶属函数,进而通过六种弹炮结合防空系统作战效能的优劣排序,验证了该方法有效可行,初步解决了上述问题.     

Franchising cooperation through chance cross‐constrained games

This paper explores the role of franchising arrangements in the context of game theory. We assume a single franchisor and a single franchisee channel and address the impact of fixed lump‐sum fees, royalties, wholesale price, and retail price on the franchise contracts. We start with the chance cross‐constrained noncooperative situation where the franchisor, as the leader, first specifies his/her strategies. The franchisee, as the follower, then decides on his/her decision. We then relax the assumption of franchisee's inability to influence the franchisor's decisions and discuss cooperative situation between the franchisor and the franchisee. Nash's bargaining model is utilized to select the best Pareto‐efficient payment scheme for the franchisor and the franchisee to achieve their cooperation. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 669–685, 2000     

支持向量机规则提取

支持向量机是一种黑箱模型,其学习到的知识蕴含在决策函数中,不仅影响了用户对利用支持向量机技术构建智能系统的信心,还阻碍了支持向量机技术在数据挖掘领域的应用。由于对支持向量机规则提取进行研究有助于解决上述问题,因此该领域正成为机器学习和智能计算界的研究热点。分析了具有代表性的支持向量机规则提取算法,并提出该领域未来的研究重点。     

一种循环队列的判定定理

首尾相接的循环队列是一种动态的数据结构。本文给出了在并发进程环境下,使用循环队列的判定定理,本定理已在银河机软件实现中得到应用。     

对DES密码的一种新的线性分析

首先推广了变换的线性偏差的概念,然后利用它把密码体制线性偏差的数学描述也进行了推广,给出了DES密码的线性偏差与轮函数F的线性偏差的关系,确定了DES密码16轮以内各轮的线性偏差上界。     

Scheduling jobs and maintenance activities on parallel machines

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000