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     

Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

A queueing system characterized by the discrete batch Markovian arrival process (D-BMAP) and a probability of phase type distribution for the service time is one that arises frequently in the area of telecommunications. Under this arrival process and service time distribution we derive the waiting time distribution for three queue disciplines: first in first out (FIFO), last in first out (LIFO), and service in random order (SIRO). We also outline efficient algorithmic procedures for computing the waiting time distributions under each discipline. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 559–576, 1997     

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     

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     

Stage life testing

In progressive censoring, items are removed at certain times during the life test. Commonly, it is assumed that the removed items are used for further testing. In order to take into account information about these additional testing in inferential procedures, we propose a two‐step model of stage life testing with one fixed stage‐change time which incorporates information about both the removed items (further tested under different conditions) and those remaining in the current life test. We show that some marginal distributions in our model correspond either to progressive censoring with a fixed censoring time or to a simple‐step stress model. Furthermore, assuming a cumulative exposure model, we establish exact inferential results for the distribution parameters when the lifetimes are exponentially distributed. An extension to Weibull distributed lifetimes is also discussed.     

不可能差分分析时间复杂度通用计算公式的改进

研究Boura等和Derbez分别提出的不可能差分分析时间复杂度计算公式,根据实际攻击过程优化密钥排除的步骤,给出不可能差分分析实际攻击的时间复杂度计算的改进公式,进而利用两个分组密码算法模型将改进后公式计算的实际结果分别与Boura等的公式和Derbez的公式的计算结果进行对比,结果表明Boura等的公式计算结果既可能高于优化公式的实际分析计算的结果,也可能低于优化公式的实际分析计算的结果,而在轮子密钥独立时改进后公式的实际计算结果是Derbez公式的计算结果的2-1.2倍。     

机体/推进一体化飞行器动导数频域计算方法

运用Etkin非定常气动力模型,将谐波平衡法应用于复杂外形动导数辨识。计算结果表明:谐波平衡法和时域方法的动导数辨识结果一致,与实验值吻合,验证了程序的正确性和谐波平衡法的可靠性。采用谐波平衡法对类X-51高超声速机体/推进一体化飞行器WR-A进行动导数辨识,并与时域方法的计算结果比较,考察了该方法在复杂外形下数值模拟非定常流动和动导数辨识的能力。实验结果表明:对于WR-A这种复杂外形飞行器,谐波平衡法也能在保证精度的同时具有较高的计算效率。     

Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management

In this article, we analyze a discrete‐time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count has no explicit form and is difficult to compute in certain parameter regimes. Using the Stein's method framework, we identify a continuous random variable to approximate the steady‐state customer count. The continuous random variable corresponds to the stationary distribution of a diffusion process with state‐dependent diffusion coefficients. We characterize the error bounds of this approximation under a variety of system load conditions—from lightly loaded to heavily loaded. We also identify the critical role that the service rate plays in the convergence rate of the error bounds. We perform extensive numerical experiments to support the theoretical findings and to demonstrate the approximation quality. In particular, we show that our approximation performs better than those based on constant diffusion coefficients when the number of servers is small, which is relevant to decision making in a single hospital ward.     

三轴磁强计晃动对测量结果的影响分析及校正

三轴磁强计的主要误差有零偏误差、灵敏度误差以及三轴非正交误差。通过在三轴正交坐标体系下对传感器的三轴非正交误差进行分析,建立了传感器误差模型,分析了误差对传感器晃动所产生的影响。晃动1°产生的误差最大可达109.5 nT,晃动误差随着晃动角度的增加而增加。为控制晃动误差,通过对误差模型分析建立误差校正模型,并通过非线性曲线拟合对校正模型参数准确估计,将估计参数代入校正模型,可以实现对传感器输出校正,使其输出误差大大减小,晃动1°产生的误差范围可控制在0.03 nT以内。这表明该校正方法有效地降低了晃动对传感器输出产生的影响。