驱动线圈极性排列方式对多级同步感应线圈发射器加速性能的影响

为提高多级同步感应线圈发射器的加速性能,以5级同步感应线圈发射器为例,在定义驱动线圈极性相对排列方式的基础上,基于场-路耦合的时步有限元分析方法,研究了驱动线圈极性排列方式对其加速性能的影响,结果表明:驱动线圈同极性相对排列方式更有助于提高发射效率。通过分析内部磁场的分布规律,探讨了驱动线圈同极性相对排列方式改善加速性能的原因,最后通过比较电枢内的感应电流密度的方法验证了分析的正确性。     

Rent‐seeking models of international competition: An experimental investigation*

This paper experimentally tests a number of hypotheses that follow from models of international competition that are based on Tullock style rent‐seeking models. Specifically, we designed and performed experiments to see how variations in the degree of publicness in the prize as well as changes in the values assigned to the prize affect alliances in terms of individual nation contributions, total contributions, burden sharing, and the likelihood of winning the prize. While there was substantial variation in individual behavior, the results of the experiments generally conform to the theoretical predictions of the rent‐seeking model of international competition and alliances.     

NUCLEAR ISLANDS

Current International Atomic Energy Agency safeguards do not provide adequate protection against the diversion to military use of materials or technology from certain types of sensitive nuclear fuel cycle facilities. In view of highly enriched uranium's relatively greater ease of use as a nuclear explosive material than plutonium and the significant diseconomies of commercial spent fuel reprocessing, this article focuses on the need for improved international controls over uranium enrichment facilities as the proximate justification for creation of an International Nuclear Fuel Cycle Association (INFCA). In principle, the proposal is equally applicable to alleviating the proliferation concerns provoked by nuclear fuel reprocessing plants and other sensitive nuclear fuel cycle facilities. The INFCA would provide significantly increased nonproliferation assurance to its member states and the wider international community by holding long-term leasehold contracts to operate secure restricted zones containing such sensitive nuclear facilities.     

The parallel machine min-max weighted absolute lateness scheduling problem

Given a set of jobs, a processing time and a weight for each job, several parallel and identical machines, and a common due date that is not too early to constrain the scheduling decision, we want to find an optimal job schedule so as to minimize the maximum weighted absolute lateness. We show that this problem is NP-complete even for the single-machine case, and is strongly NP-complete for the general case. We present a polynomial time heuristic for this problem and analyze its worst-case performance. Empirical testing of the heuristic is reported, and the results suggest that the performance is asymptotically optimal as the number of jobs tends to infinity. © 1994 John Wiley & Sons, Inc.     

Queueing processes and trade-offs during ship-to-shore transfer of cargo

This article examines the ship-to-shore transfer of cargo from ships that are located offshore. In these situations, cargo is transferred from the ships to smaller craft, which in turn transport the cargo the remaining distance to shore. These craft cycle back and forth from the ship to the shore until the transfer is complete. Queueing of these craft often occurs, as they must wait at either the ship or the shore for a loading or unloading position to become free. Two different methods of modeling this ship-to-shore transfer of cargo are developed and applied. One is an analytic queueing model and the other is a more traditional simulation model. The analytic model is found to produce results quite similar to the simulation model. Examples are shown that use these models to analyze trade-offs between variables affecting the ship-to-shore transfer of cargo and the total time to transfer a given amount of cargo ashore. © 1994 John Wiley & Sons, Inc.