坦克分队行军中技术保障的概率模型

为了评价技术保障在行军中的作用,本文建立了在没有敌人炮火作用下,坦克在行军过程中所处状态的数学模型,该数学模型对合理运用技术保障的力量具有指导意义,并通过实例评价了技术保障对装备完好性及长距离行军后战斗能力的影响。     

基于分布式对象技术的CAD集成框架的模型与结构

分布式对象技术是当前实现企业应用集成的主流技术。本文首先介绍了基于分布式对象技术的ＣＡＤ集成框架支撑平台的总体结构，以此为基础，设计了大型电子设备并行设计ＣＡＤ集成框架的体系结构，提出“框架总线＋软构件”的框架模型，最终探讨了集成框架具体的实现方法和技术。     

求截交线与相贯线的新方法

类似性法、近似对抗性法是笔者归纳的求解截交线、相贯线的一种实用方法,使学生在求对截交线、相贯线之前即可判断答案图形及投影特点,并能验证结果的正确性,提高了学生解题的正确率.     

军械仓库的物资发放研究

用仿真模型研究了仓库物资的发放过程,定量解决了如何科学合理地分配一条作业线中作业机械的使用问题。根据这一结果,研究了在给定作业量的情况下如何确定作业机械数量的方法。     

54／74HC高速CMOS逻辑电路的接口电路

本文主要讨论了５４／７４ＨＣ高速ＣＭＯＳ逻辑电路的性能特．点及接口电路。     

扭力轴头的堆焊修复加激光强化

本文对某重载车辆扭力轴轴头的堆焊修复加激光强化工艺进行了试验研究.优选了激光强化的工艺参数;分析了堆焊及激光强化层的组织;并进行了硬度及接触疲劳试验.试验结果表明:堆焊加激光强化层的硬度高,其接触疲劳性能比原材料高频淬火略有提高;堆焊加激光强化修复扭力轴轴头具有较高的经济效益.     

Design of a process control scheme for defects per 100 units based on aoql

A process control scheme is developed in which decisions as to the frequency of sampling are made based upon the choice of an Average Outgoing Quality Limit. The scheme utilizes plotted points on a U-control chart for defects and the theory of runs to determine when to switch among Reduced, Normal, Tightened, and 100 percent inspection. The scheme is formulated as a semi-Markov process to derive steady stale equations for the probabilities of being in Reduced, Normal, Tightened, or 100 percent inspection and for Average Outgoing Quality and Average Fraction Inspected. The resulting system and the computer programs used to derive it are discussed.     

Damage calculations for unreliable warheads

For large numbers of perfectly reliable, optimally targeted warheads the square-root law approximates the expected fraction damage achieved on an area target. In this paper a more exact expression is derived for this damage fraction which Holds for all numbers of warheads. This expression is shown to converge to the square-root law when a large number of warheads are fired. The more exact expression is used in a procedure to calculate expected damage when warheads are unreliable, and this procedure is shown to be superior to a modified square-root approximation which has been used previously.     

Computational results with a branch-and-bound algorithm for the general knapsack problem

In this paper, a branch-and-bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size.     

A note on sojourn times in M/G/1 queues with instantaneous,bernoulli feedback

Queueing systems which include the possibility for a customer to return to the same server for additional service are called queueing systems with feedback. Such systems occur in computer networks for example. In these systems a chosen customer will wait in the queue, be serviced and then, with probability p, return to wait again, be serviced again and continue this process until, with probability (1 – p) = q, it departs the system never to return. The time of waiting plus service time, the nth time the customer goes through, we will call his nth sojourn time. The (random) sum of these sojourn times we will call the total sojourn time (abbreviated, sojourn time when there is no confusion which sojourn time we are talking about). In this paper we study the total sojourn time in a queueing system with feedback. We give the details for M/G/1 queues in which the decision to feedback or not is a Bernoulli process. While the details of the computations can be more difficult, the structure of the sojourn time process is unchanged for the M/G/1 queue with a more general decision process as will be shown. We assume the reader is familiar with Disney, McNickle and Simon [1].