雷达信号的计算机测量

复杂多变的雷达信号环境要求雷达侦察系统能快速、准确地测量各被测雷达的信号参数。结合当今的计算机技术,研究了雷达信号参数的计算机测量原理和方法,并实现了其测量系统。     

超短波数据调制解调器的研究与实现

超短波数据通信在国内日趋发展,迫切需要专门用于超短波的数据调制解调器。本文将有线、短波数据通信的理论和方法有机地结合在一起,研究和设计了多速率的超短波数据modem 的方案,对系统的性能和关键技术作了分析,并给出了计算机模拟结果。     

潮流与风对单点系泊系统运动稳定性的影响研究

应用时域仿真的方法研究了风与潮流作用下单点系泊系统的非线性动力学特性。以三阶操纵运动方程为基础,引入定常的风力、潮流作用力和二阶波浪力,建立了系泊系统三自由度运动微分方程,据此建立了系泊系统的多自由度计算机仿真模型。风与潮流联合作用的情形下,对一艘单点系泊油轮的动力学行为进行了数值仿真研究。以潮流速度和系缆长度为分岔控制参数,在参数平面上给出了油轮系泊运动的Hopf分岔集,它将参数平面分为两个系统动力学行为本质不同的区域。研究表明,与潮流(顶流)单独作用的情形相比,顶风条件增加了油轮静止系泊位置的Liapunov稳定性。     

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

通过简化半导体器件灵敏单元 ,计算得到了宇宙高能质子在器件灵敏单元内产生的能量沉积。然后利用地面重离子实验单粒子翻转数据得到的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     

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

将组合电路故障模拟的一些加速技术推广到时序电路故障模拟中,提出并实现了一个功能块级的基于测试码并行的同步时序电路故障模拟方法,对部分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