Q∝T~n时不可逆卡诺热泵的最优性能

非线性传热条件下的内可逆卡诺热机最优性能有了一些讨论,本文将导出不可逆卡诺热泵工作于非线性传热 Q■条件下,最佳供热系数д与泵热率π的关系。据此可确定任意泵热率时所对应的供热系数界限。最后,讨论了这一关系的一些应用,所得结果包含了经典热力学及内可逆线性传热情况下的有关结论,为实际热泵设计提供新的理论依据。     

Designing a degradation experiment

Degradation experiments are widely used to assess the reliability of highly reliable products which are not likely to fail under the traditional life tests. In order to conduct a degradation experiment efficiently, several factors, such as the inspection frequency, the sample size, and the termination time, need to be considered carefully. These factors not only affect the experimental cost, but also affect the precision of the estimate of a product's lifetime. In this paper, we deal with the optimal design of a degradation experiment. Under the constraint that the total experimental cost does not exceed a predetermined budget, the optimal decision variables are solved by minimizing the variance of the estimated 100pth percentile of the lifetime distribution of the product. An example is provided to illustrate the proposed method. Finally, a simulation study is conducted to investigate the robustness of this proposed method. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 689–706, 1999     

光电对抗在对巡航导弹分层防御中的应用

针对现代防空体系的特点,介绍了巡航导弹及其制导方式,并从巡航导弹自身弱点、实战中的不足以及技术上的可对抗性进行了各方面分析,提出了巡航导弹是可以进行对抗的,尤其是利用光电对抗手段进行对抗的可行性、重要性.目前对巡航导弹的分层防御相对来说费用相当昂贵,而采用光电对抗手段是廉价而又有效的.通过对光电对抗的可行性分析,列出了以侦察告警、定向红外干扰、高重频激光干扰、激光致盲、激光摧毁、烟幕干扰、光电隐身等光电对抗手段进行对抗巡航导弹的方法,并进行探讨.最后对光电技术及光电对抗装备技术的发展趋势作了描述.     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

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     

Impacts of logistics information on sales: Evidence from Alibaba

Facing fierce competition from rivals, sellers in online marketplaces are eager to improve their sales by delivering items faster and more reliably. Because logistics quality can be known only after a transaction, sellers must identify effective ways to communicate logistics information to consumers. Drawing on the accessibility-diagnosticity framework, we theorize that the sales impacts of logistics information depend on its relative diagnostic value. Using data on 1493 items with 505,785 consumer reviews from an online marketplace, we examine how sales are affected by three information sources for logistics services: online word of mouth (WOM) about logistics, self-reported logistics services, and expected delivery time. We use an instrumental variable method to address the endogeneity issue between sales and WOM. We find that, ceteris paribus, consumers give more weight to WOM about logistics and delivery time when they make purchase decisions but less weight to self-reported logistics service. The effects of logistics information on sales are asymmetric for large and small sellers.     

“打击时敏目标”任务的Petri网建模方法

对武器装备体系而言,作为现代战争中的重要样式"打击时敏目标"任务可分为获取时间窗口和利用时间窗口打击目标两个阶段。首先分析了打击时敏目标任务的过程,然后提出使用广义随机Petri网(GSPN)描述时间窗口的获取过程的方法,引入了负位置和负令牌的概念,最后提出用改进的GSPN描述利用时间窗口打击目标的过程的方法,并建立了一个"打击时敏目标"任务的Petri网模型。     

并行时域自适应算法在电大目标瞬态散射中的应用

基于电磁场时域积分方程(TDIE)数值技术计算复杂目标的瞬态散射特性,其计算量和内存需求大,采用时域自适应算法(TDAIM)降低了TDIE的计算规模。在研究TDAIM并行算法的基础上,开发了基于.NET Remoting的电磁场分布式数值计算方案。数值结果表明,该方案显著提高了TDAIM的计算效率,为解决电大目标瞬态电磁散射问题提供了一条有效途径。     

MLFMA在运动目标多普勒回波数值仿真中的应用

提出了一种应用准静态技术,结合快速多级子算法计算任意形状的运动目标多普勒信号的方法,对目标的几种典型的微动多普勒信号进行了仿真,并应用高分辨时频分析算法对仿真得到的微多普勒信号进行了分析,提取出了微多普勒瞬时频率,并与相应微动规律的点目标微多普勒瞬时频率进行对比。结果表明,二者具有相同的变化规律,从而证明本文提出的方法是有效的。     

星地距离变化对星地双向时间比对的影响及改正

星地时间同步是卫星导航系统的关键技术,星地双向时间比对能有效提高星地时间同步的精度。在分析了星地距离变化对星地双向时间比对可引起百纳秒量级误差后,提出了前后历元观测数据差分改正方法,通过数学仿真验证该方法能达到纳秒量级精度。