中温石墨流态床热处理炉的加热装置与电极设计

本文以笔者早年设计的小型石墨流态床热处理炉(LTR)和随后研制大功率炉的经验,讨论加热装置的最佳方案和电极设计的有关问题,通过理论分析和试验,给出950℃以下的温度-电阻曲线和屏蔽电极区间的电压-幂次和电阻-幂次曲线。     

运用分子场论对金属间化合物Nd_2Fe_(17)Hx(0≤x<5)的磁性分析

将二亚点阵分子场理论(MFT)用于渗氢化合物Nd_2Fe_(17)H_x系列,分析其磁性与温度的关系。通过与实验比较,确定分子场系数n_(RR)、n_(RF)和n_(FF),计算居里温度T_c得到了总磁矩M(T)、交换场H_(Nd)(T)和H_(Fe)(T)随温度变化的关系曲线。计算结果表明,对于渗氢化合物Nd_2Fe_(17)H_(X~y)随着氢含量的增加,引起分子场系数n_(FF)明显增大,同时H_(Nd)、H_(Fe)(T)增大,居里温度T_c相应升高。     

任意长二维 DFT 的多项式变换算法及其并行算法

本文给出任意长二维ＤＰＴ的ＦＰＴ算法及其并行算法,详细地讨论了Ｎ＝ｐ￣ｅ的情况（ｐ为素数）。与通常二维ＤＦＴ的行列算法比较,乘法量减少约５０％,加法量略有增加。     

1,4-双(氯甲基)-2-甲氧基-5-烷氧基苯的合成研究

用Ⅰ（ｎ＝２,４,７,８）的氯甲基化反应合成出相应的四种氯甲基化产物Ⅱ（ｎ＝２,４,７,８）,讨论了反应条件对产率的影响,产物结构由ＩＲ和１ＨＮＭＲ确定,并讨论了反应机理。ＣＨ３ＯＯ（ＣＨ２）ｎＨ（Ⅰ）ＣＨ３ＯＣＨ２Ｃ１Ｏ（ＣＨ２）ｎＨＣＨ２Ｃ１（Ⅱ     

集值广义(S)_+型映射之一致极限的广义度理论及其应用

本文构造了集值(S)+型映射之一致极限的广义度,所得结果统一并加强了文献〔1～4〕的相应结果。运用拓扑度方法获得了一些新的满值性定理与某些新的不动点定理。     

聚苯乙炔的合成及其表征——用无水AlCl3和(Ph3P)2PdCl2二种催化剂

本文用无水AlCl_3和(Ph_3P)_2PdCl_2二种催化剂催化苯乙炔聚合,得到共轭聚合物聚苯乙炔(PPA)。对PPA 的微结构分析表明:用无水AlCl_3催化苯乙炔,得到顺-反式PPA;用(Ph_3P)_2PdCl_2催化苯乙炔得到反-顺式PPA.因此,作者认为用无水AlCl_3催化苯乙炔聚合时可能按络合催化机理反应;用(Ph_3P)_2PdCl_2催化苯乙炔聚合时可能按易位催化机理反应。     

An exact analysis of a joint production‐inventory problem in two‐echelon inventory systems

We consider a two‐echelon inventory system with a manufacturer operating from a warehouse supplying multiple distribution centers (DCs) that satisfy the demand originating from multiple sources. The manufacturer has a finite production capacity and production times are stochastic. Demand from each source follows an independent Poisson process. We assume that the transportation times between the warehouse and DCs may be positive which may require keeping inventory at both the warehouse and DCs. Inventory in both echelons is managed using the base‐stock policy. Each demand source can procure the product from one or more DCs, each incurring a different fulfilment cost. The objective is to determine the optimal base‐stock levels at the warehouse and DCs as well as the assignment of the demand sources to the DCs so that the sum of inventory holding, backlog, and transportation costs is minimized. We obtain a simple equation for finding the optimal base‐stock level at each DC and an upper bound for the optimal base‐stock level at the warehouse. We demonstrate several managerial insights including that the demand from each source is optimally fulfilled entirely from a single distribution center, and as the system's utilization approaches 1, the optimal base‐stock level increases in the transportation time at a rate equal to the demand rate arriving at the DC. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

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     

Inventory management with advance capacity information

An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Multi‐period maintenance scheduling of tree networks with minimum flow disruption

We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011