航炮吊舱与飞机发动机相容性试验

航炮吊舱与飞机发动机地面相容性试验,是为进行空中首次实弹射击是否会引起飞机发动机空中停车事故而进行的摸底试验,涉及到航炮发射时炮口产生的压力场、温度场、所形成的流动变化是否会影响到发动机吞恶劣气流能力。重点介绍了试验过程中所采取的方法和测试手段。通过分析保障空中实弹射击成功的全过程。     

利用矩阵求极大相容类的一种方法

寻找相容关系的极大相容类和简单图的极大完全子图，在解决二元关系与数据挖掘和管理决策中的具体问题时有重要作用。利用相容关系的极大相容类与简单图的极大完全子图之间的对应关系，对极大完全子图的路径长度进行分析，得到了关于极大完全子图路径长度的一个定理。并根据该定理构造了一个用矩阵的路径长度搜索简单图的极大完全子图的方法，进而利用该方法找出了对应相容关系的极大相容类。     

一种基于兼容度的组合评估方法

分析了单一评估方法的局限性,基于兼容度准则提出一种将综合指数法和功效评分法等常用评估方法组合而成的一种综合评估方法,采用该方法对潜艇声纳的作战性能进行了评估分析.算例分析表明,该方法对于提高评估结果的可信性具有明显的作用.     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

一种解决知识不相容的方法

介绍了知识库更新的基本概念,并且在命题知识库的范围内研究了知识库更新的方法,结合实际应用给出了一种特殊情况下知识不相容的判定方法。