宇宙高能质子致单粒子翻转率的计算

通过简化半导体器件灵敏单元 ,计算得到了宇宙高能质子在器件灵敏单元内产生的能量沉积。然后利用地面重离子实验单粒子翻转数据得到的Weibull函数 ,计算了CRRES卫星轨道、 33mm铝屏蔽壳体内几种器件的单粒子翻转率 ,并与已有结果进行了比较说明。     

声腔应用于液体火箭发动机不稳定燃烧抑制中的特性研究

本文针对抑制液体火箭发动机不稳定燃烧的声学装置——赫姆霍兹声腔和四分之一波长管声腔进行了研究。讨论了在声腔设计安排中正确选择声腔的数目，且比较了不同长度声腔的阻尼特性。通过考察声吸收系数的方法来最优化系统的阻尼，得到了可供设计参考的结论。     

特大规模组合电路高速测试生成系统ATGTA-1

针对特大规模组合电路和全扫描设计电路提出了一种高速测试生成方法，并建成了相应的测试生成系统ＡＴＧＴＡ－１。该系统采用有限回溯测试模式产生方法生成测试码，采用ｎ（机器字长）个测试码并行的单故障传播方法模拟验证测试覆盖。测试生成与故障模拟为ｎ对１紧耦合集成方式。该系统运行１０个Ｂｅｎｃｈｍａｒｋ电路，取得了低测试长度、高故障覆盖、高效率的良好效果。     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

多点喷射空气酒精燃气发生器试验验证

为有效解决现有燃气引射气源存在的诸多缺点,适应一种引射系统大流量、小型化的需要,在综合分析各燃气引射气源方案的基础上,研制了一种以空气、酒精作为推进剂的多点喷射结构的燃气发生器,并开展了多种工况下的试验研究。结果表明:采用的多点喷射方案大大提高了空间利用率,有效满足了引射系统小型化的要求;喷雾性能好,喷雾锥角及粒径优于设计指标要求;点火可靠性高,解决了领域内现有燃气发生器点火可靠性低的缺点;点火迅速,燃烧平稳,可实现较为均匀的出口温度场;燃气发生器工作范围较宽,能在余气系数2.52～4.34范围内稳定燃烧;高效的火焰筒内壁空气冷却方式有效保证了燃气发生器长时间工作运行。     

基于测试码并行的同步时序电路故障模拟方法

将组合电路故障模拟的一些加速技术推广到时序电路故障模拟中,提出并实现了一个功能块级的基于测试码并行的同步时序电路故障模拟方法,对部分ISCAS89 Benchmark电路的模拟结果表明,该故障模拟方法有较好的性能.     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

A sequential auction‐bargaining procurement model

One of the most important decisions that a firm faces in managing its supply chain is a procurement decision: selecting suitable suppliers among many potential competing sellers and reducing the purchase cost. While both auctions and bargaining have been extensively studied in the literature, the research that combines auctions and bargaining is limited. In this article, we consider a combined auction‐bargaining model in a setting where a single buyer procures an indivisible good from one of many competing sellers. The procurement model that we analyze is a sequential model consisting of the auction phase followed by the bargaining phase. In the auction phase, the sellers submit bids, and the seller with the lowest bid is selected as the winning bidder. In the bargaining phase, the buyer audits the cost of the winning seller and then negotiates with him to determine the final price. For this auction‐bargaining model, we find a symmetric equilibrium bidding strategy for the sellers in a closed form, which is simple to understand and closely related to the classical results in the auction and bargaining literature. We also show that the auction‐bargaining model generates at least as much profit to the buyer as the standard auction or sequential bargaining model. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

点型火灾报警探测器保护范围对布置的影响

分析了点型火灾报警探测器＂保护半径＂与＂保护面积＂的内在关系,得出了以保护半径为主,保护面积及修正系数为辅新型计算方法,使其在不规则平面更有可操作性,能充分发挥探测器效能,给设置留下了宽裕的选择范围,使设置更趋合理;在安全性不受影响下,探测器用量最大可节省12%。     

相关系数及其应用

在相关分析中,通常利用相关系数来分析或测定变量之间的线性相关程度。相关系数是描述两个变量或随机变量之间的线性相关程度的指标。相关系数的计算与分析是科学研究中常用的一种简单分析方法,根据相关系数可以对不同事物进行简单的聚类分析等。从相关系数的概念入手,给出相关系数的计算公式,列举了相关系数的应用。