用时序展开法求解瞬时无耗传输线方程

本文用时序展开法直接在时域中求解了任意终端和输入端时无耗时变传输线方程。给出了这个问题的一般解。此方法简单,结果的物理意义明确,对分析准行波系统的时域问题具有一定的参考价值。     

保形的Hermite插值样条函数

本文讨论一种满足Hermite 插值条件的保形样条函数,文中构造了一个保单调的样条函数q(x),且q(x)满足下列条件:1)q(x_i)=y_i,i=0,1,2,…,n,n+1;2)q'(x_i)=y'_ii=0,1,2,…,n,n+1.该方法对凸数组及相应的导数也适合。     

高阶累积量自适应波束形成的改进算法

针对线性约束最小方差(LCMV)算法在自适应波束形成时,存在的对噪声敏感、信噪比(SNR)较高时波束形成受小特征值扰动影响较大的情况。在基于高阶累积量的LCMV算法的基础上提出改进方法。该方法首先计算阵列接收数据的高阶累积量,然后对高阶累积量构造数据增广矩阵,进行奇异值分解求出伪逆,再用伪逆修正LCMV算法的权值,形成波束。仿真结果表明,相比于传统LCMV算法与基于高阶累积量的LCMV算法。算法能够有效地克服信噪比升高时小特征值扰动对波束形成的不良影响,且在较低快拍数下仍能有效形成波束。     

Approximation methods for the analysis of a multicomponent,multiproduct assemble‐to‐order system

In this article, we consider the performance evaluation of a multicomponent, multiproduct assemble‐to‐order (ATO) system. Each component is managed independently using a base‐stock policy at a supply facility with limited production capacity and an infinite buffer. The arrivals of demands follow a multivariate Poisson process and unfilled demands are backlogged. Because exact analysis of the proposed system is not feasible, we propose two approximation methods which provide upper and lower bounds for various performance measures such as fill rate, average waiting time, and average number of backorders of the proposed system. Our computational experiments demonstrate the effectiveness of the two approximation methods under various system settings. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

锆酸铅PbZrO3序参量的量子饱和

在503 K反铁电体PbZrO3发生立方-正交相变,序参量是反平行离子位移引起的超晶格;在低温相时,PbZrO3的反铁电超晶格反射强度随温度的变化成正比,可以由考虑量子效应的Landau唯象理论加以描述;高于室温时,Γ25超晶格反射强度显示了不同的温度依赖性。     

Dynamic order acceptance and capacity planning on a single bottleneck resource

We present a tactical decision model for order acceptance and capacity planning that maximizes the expected profits from accepted orders, allowing for aggregate regular as well as nonregular capacity. The stream of incoming order arrivals is the main source of uncertainty in dynamic order acceptance and the company only has forecasts of the main properties of the future incoming projects. Project proposals arrive sequentially with deterministic interarrival times and a decision on order acceptance and capacity planning needs to be made each time a proposal arrives and its project characteristics are revealed. We apply stochastic dynamic programming to determine a profit threshold for the accept/reject decision as well as to deterministically allocate a single bottleneck resource to the accepted projects, both with an eye on maximizing the expected revenues within the problem horizon. We derive a number of managerial insights based on an analysis of the influence of project and environmental characteristics on optimal project selection and aggregate capacity usage. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

The impact of component commonality on composite assembly policies

Assemble in Advance (AIA) policy reduces assembly cost due to advance planning, while Assemble to Order (ATO) policy eliminates assembly of excessive (more than demanded) units. The tradeoffs between the two policies have been studied in the past for single product environments. Moreover, it was shown that it is beneficial to employ AIA and ATO simultaneously. In this article, we study the employment of such a composite assembly policy in a multiproduct environment with component commonality. When common components are used, ATO may also enable us to benefit from the risk pooling effect. We provide important managerial insights such as: the multiperiod problem is myopic and changes in inventory levels due to the use of common components, and demonstrate the potential profit increase compared to other policies.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Optimal burn‐in procedure for periodically inspected systems

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we study burn‐in procedure for a system that is maintained under periodic inspection and perfect repair policy. Assuming that the underlying lifetime distribution of a system has an initially decreasing and/or eventually increasing failure rate function, we derive upper and lower bounds for the optimal burn‐in time, which maximizes the system availability. Furthermore, adopting an age replacement policy, we derive upper and lower bounds for the optimal age parameter of the replacement policy for each fixed burn‐in time and a uniform upper bound for the optimal burn‐in time given the age replacement policy. These results can be used to reduce the numerical work for determining both optimal burn‐in time and optimal replacement policy. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

一类多维双重时序 AR(1)-MA(q) 模型的平稳性

讨论了一类多维双重时序ＡＲ（１）－ＭＡ（ｑ）模型的二阶平稳性问题。通过导出一组线性方程组，给出了这类模型二阶平稳的显式充分条件和必要条件，为验证模型的二阶平稳性提供了一个可行的途径。     

环形区域极点/协方差约束下的模型简化设计

提出离散随机系统模型简化的一种新方法,即环形区域极点／协方差约束下的模型简化方法。这种设计方法的基本思路是构造指定维数的降阶模型,使其匹配给定的环形区域极点和稳态协方差参数,在系统的动态特性和稳态特性方面逼近给定的满阶模型。文中导出了期望的简化模型的存在条件及解析表达式,并提供了一个数值算例。