Numerical treatment of a class of semi-infinite programming problems

Many optimization problems occur in both theory and practice when one has to optimize an objective function while an infinite number of constraints must be satisfied. The aim of this paper in to describe methods of handling such problems numerically in an effective manner. We also indicate a number of applications.     

超精密铣削的三维微加工工艺

本研究旨在对用于获取有雕刻表面金属工件的超精密微加工工艺进行探讨。研究中使用的是车床型的超精密铣床,由分辨率为1nm的X和Z向运动工作台及分辨率为0.0001度的可定位的C轴组成。作为一种铣削工具,一种改进型的由一颗水晶钻构成的“仿球尖铣刀”被放置在X轴的高速气浮轴承之上。这样一来,X轴和C轴的协调运动就可产生三维铣削的效果。为提高表面粗糙度,通过模拟我们研究的刀具边沿和工件表面的接触情况,结果发现,刀具低速进给时切削比较有效。作为三维微加工工艺的一个例子,运用数字仪提供的扫描数据在一个直径为3mm的铜表面上制作一个传统的NOH面罩。经证明,超精密铣床有潜力加工出表面粗糙度为69nm(P—V值)的工件。     

Preserving defense technologies: A strategy for economic conversion†

This paper presents a model for converting legacy defense production facilities into private‐sector economic resources. Specifically, this paper will examine as a case study the first successful conversion of a former U.S. Department of Energy nuclear weapons production installation, including reasons for its success, its costs and benefits, and lessons for public policy. It is envisioned that this model may be useful for mitigating local economic hardship resulting from defense “downsizing” and for privatizing production capacities critical for national defense.     

Scheduling jobs,with exponentially distributed processing times,on two machines of a flow shop

This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution.     

The winds of change: the transition from armed forces for peace to new missions for the Bundeswehr and its impact on civil–military relations

The debate on the civil–military gap and especially the TISS findings are viewed with a focus on Germany. After outlining the historical development of civil–military relations, the question of a civil–military gap is explored with data from 2001. The study finds similarities and differences in the attitudes of the civilian and the military population on several issues. Overall, there is a broad overlap of attitudes, yet differences do exist, especially on issues of foreign policy and things military. It is argued that at the beginning of the twenty-first century, civil–military relations in Germany are largely uncontested, but will become more strained.     

A note on the constrained shortest-path problem

The subject of this note is the validity of the algorithm described by Aneja and Nair to solve the constrained shortest-path problem.     

Scheduling stochastic jobs on a single machine subject to breakdowns

A single machine is available to process a collection of stochastic jobs. There may be technological constraints on the job set. The machine sometimes breaks down. Costs are incurred and rewards are earned during processing. We seek strategies for processing the jobs which maximize the total expected reward earned.