分解炉内煤粉燃烧和CaCO3分解流场的数值模拟

针对国内某大型水泥高性能分解炉,基于Fluent软件,采用有限速率/涡耗散模型模拟了炉内煤粉燃烧和生料分解的湍动多相流场,给出了炉内速度矢量、温度、压力和组分分布,结果显示,炉内流动趋势合理,可为分解炉的研究提供参考.     

损耗地面上线天线的一种近似计算方法

在普遍镜像法分析地面上垂直天线特性的基础上,提出了一种修正的镜像法,该方法能提高计算的速度.通过仿真计算以及对测量结果的比较,发现VLF天线输入阻抗随着地面电导率的改变而明显变化,而且大地的形状和地质在一定程度上影响VLF天线的发射效率.     

低速圆管流动的粒子仿真

运用信息保存法对低速圆管的流动现象进行了模拟,并与实验结果进行了比较,粒子仿真结果与实验结果吻合较好,且优于NS方程的结果。研究表明,在对低速圆管的模拟过程中,运用IP法在获得较好的结果的同时,具有比DSMC方法更高的计算效率。IP算法是解决低速圆管流动问题的有效途径。     

线性方程组二级迭代法的收敛速度

二级迭代法由内、外迭代和内迭代次数三部分组成。给出了线性方程组二级迭代法R1-收敛因子的一个上界,这个上界由内、外迭代的R1-收敛因子和内迭代次数所决定,其主部为外迭代的R1-收敛因子。在矩阵单调性条件下,对于任何内迭代方法和任意内迭代次数,证明了外迭代的R1-收敛因子也是二级迭代法R1-收敛因子的下界。所得结果反映了内、外迭代的收敛速度以及内迭代次数对于二级迭代法收敛速度的综合影响。     

Algorithms for solving the conditional covering problem on paths

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Outsourcing warranty repairs: Dynamic allocation

In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens of millions of dollars, even a small relative cost reduction from the use of dynamic (rather than static) allocation may be practically significant. However, due to the size of the state space, the resulting dynamic programming problem is not exactly solvable in practice. Furthermore, standard routing heuristics, such as join‐the‐shortest‐queue, are simply not good enough to identify potential cost savings of any significance. We use two different approaches to develop effective, simply structured index policies for the dynamic allocation problem. The first uses dynamic programming policy improvement while the second deploys Whittle's proposal for restless bandits. The closed form indices concerned are new and the policies sufficiently close to optimal to provide cost savings over static allocation. All results of this paper are demonstrated using a simulation study. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

On parallel machine replacement problems with general replacement cost functions and stochastic deterioration

The parallel machine replacement problem consists of finding a minimum cost replacement policy for a finite population of economically interdependent machines. In this paper, we formulate a stochastic version of the problem and analyze the structure of optimal policies under general classes of replacement cost functions. We prove that for problems with arbitrary cost functions, there can be optimal policies where a machine is replaced only if all machines in worse states are replaced (Worse Cluster Replacement Rule). We then show that, for problems with replacement cost functions exhibiting nonincreasing marginal costs, there are optimal policies such that, in any stage, machines in the same state are either all kept or all replaced (No‐Splitting Rule). We also present an example that shows that economies of scale in replacement costs do not guarantee optimal policies that satisfy the No‐Splitting Rule. These results lead to the fundamental insight that replacement decisions are driven by marginal costs, and not by economies of scale as suggested in the literature. Finally, we describe how the optimal policy structure, i.e., the No‐Splitting and Worse Cluster Replacement Rules, can be used to reduce the computational effort required to obtain optimal replacement policies. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

正交投影法的飞机效能-费用系统评价

飞机效能-费用系统评价是飞机研制早期一个非常重要的问题,需要从数个替代方案中找出所需的最优方案,然而要决定哪个方案“最优”却未必容易。TOPS IS法对与理想解距离更近可能与负理想解的距离也更近的这一类方案排序的结果并不能完全反映各方案的优劣性。针对TOPS IS法的不足,提出将基于“垂面”距离的TOPS IS法-正交投影法应用于飞机效能-费用系统评价,对其基本原理进行了解释,给出了简化的计算步骤,并在随后的实例评估中取得了良好的效果。     

高校学生宿舍楼火灾危险性的模糊综合评价

依据高校学生宿舍楼火灾危险性的影响因素,应用模糊识别理论构建了高校学生宿舍楼火灾危险性评价指标体系,并利用层次分析和多级模糊评价相结合的方法对某高校学生宿舍楼火灾危险性进行综合评价。研究表明:该方法的评估结果符合实际情况,且简便可行,具有较强的实际应用性。     

复杂非线性隔冲减振系统计算分析

基于结构动力学理论,提出了一种用于分析计算复杂非线性隔冲减振系统的双模型两步计算法。该方法将冲击振动分成2个阶段:冲击作用阶段和自由振动阶段。冲击作用阶段,采用两自由度模型进行响应计算,该两自由度模型可有效地解决基础冲击输入问题;自由振动阶段,采用单自由度模型进行响应计算,设备在该阶段以冲击终了时刻的速度和位移为初始条件进行振动。文中还对一个典型的复杂非线性系统的冲击过程进行了数值计算.该方法亦可用于线性隔冲减振系统的计算分析.