印刷对数周期天线的FDTD分析与实验

采用非均匀网格时域有限差分(NU FDTD)方法,对单层印刷对数周期阵子天线(PLPDA)进行了电磁仿真,分析了单面和双面介质盖板对PLPDA性能的影响,得到了PLPDA的驻波和方向图特性,并进行了实验验证,分析结果与实验结果吻合得较好。     

Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility

In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

A note on scheduling parallel machines subject to breakdown and repair

In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ C_j, the makespan C_max, and the maximum lateness L_max. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

基于交叉熵和新转移函数的模糊神经网络分类器

针对目前普遍采用的误差平方和准则及Sigmoid转移函数在BP算法应用中存在的缺陷和不足,提出了基于交叉熵准则和新的S型转移函数构建的模糊神经网络分类器,并将这种分类器应用于心肌梗死的定位诊断,结果表明其训练效率和识别性能都明显优于传统的模糊神经网络。     

车用再制造发动机验收检验台架磨合规范试验研究

对未经磨合的再制造发动机新品进行动力性能试验,试验结果与原机标准相差较大,经分析后认为未进行充分磨合是性能不达标的主要原因。针对再制造发动机的出厂验收技术特点,制定了小负荷循环磨合规范,并对起初推断进行了试验验证。根据磨合过程中发动机动力性能的变化规律,通过试验对磨合规范进行了优化,总结出了快速有效的台架磨合规范。试验结果表明：快速磨合规范不仅能够提高磨合效率,而且保证了磨合效果。     

水面舰艇攻势防御的效能评估及优势论证

进攻是最好的防守。针对水面舰艇攻势防御问题,对水面舰艇攻势防御的概念及使用前提进行了讨论,通过与守势防御的比较,从理论上对攻势防御的优势进行了论证。最后,根据论证结果、数据仿真及作战实际,给出了攻势防御的使用原则。     

战场多级核生化态势生成方法研究

详细介绍和描述了核生化态势的分类问题,提出了战场多级核生化态势的概念,分别对作业级、作战指挥级、作战筹划级核生化态势的要素及生成方式进行了研究,并进行了对比分析.多级核生化态势可以为不同层级的用户提供专业、有效的态势信息,满足核生化作战的技术需求.     

Influences of different crossing types on dynamic response of underground cavern subjected to ground shock

An intersecting cavern is a common structural form used in underground engineering, and its safety and stability performance directly control the service performance of the whole project. The dynamic re-sponses of the three kinds of crossing type (+-shaped, T-shaped, L-shaped) caverns subjected to ground shock were studied by numerical simulation. The velocity plus force mode boundary setting method was proposed in the coupled static and dynamic analysis of a deep underground cavern. The results show that, among the three types of crossing caverns, the+-shaped cavern is the most significantly affected by the dynamic action, followed by T-shaped, and then L-shaped caverns. The vault settlement, straight wall deformation, vault peak particle velocity, effective plastic strain of surrounding rock, and maximum principal stress and strain at the bottom of the lining of the straight wall increase with the increase of cavern span. The vault settlement, straight wall deformation, effective plastic strain of surrounding rock, and the maximum principal stress and strain at the bottom of lining to the straight wall decrease with the increase of lateral pressure coefficient, and the peak particle velocity at the vault increases. The variation is small compared with the change of cavern span. The influence range of the underground cavern intersection is two cavern diameters from the intersection centre. The bottom of the straight wall at the intersection is the weak part. It is suggested to thicken the support locally to improve the stability of the cavern.     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 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