Detecting Clandestine Reprocessing Activities in the Middle East

Remote monitoring of krypton-85 from undeclared reprocessing of spent nuclear fuel could be part of a fissile material cut-off treaty, could serve as an additional measure for the IAEA safeguards system to monitor compliance with the Non-Proliferation of Nuclear Weapons Treaty, and could be an important verification tool of a reprocessing moratorium or Nuclear Weapon Free Zone in the Middle East or East Asia. Atmospheric transport modelling is applied to determine the area over which krypton-85 emissions from undeclared reprocessing activities at various levels in the Middle East would still be detectable against the high krypton-85 background from reprocessing in historical weapon programs in the United States and USSR as well as more recent and ongoing commercial reprocessing in France and the U.K. Analysis of annual wind flow over Israel's Dimona facility, the only operating reprocessing site in the region, suggests that a known reprocessing plant could be monitored with one or a few fixed monitoring stations. Random air sampling for krypton-85 analysis, perhaps using drones, may be feasible for reliable and timely detection of clandestine reprocessing plants against the krypton-85 background but would require on the order of 50–100 air samples per day. Ending reprocessing at La Hague in France and at Sellafield in the UK and the resulting decline of the krypton-85 background over time would reduce to about 10 the number of daily samples required to monitor the Middle East.     

蓄电池在线检测方法研究

在对阀控铅酸蓄电池的性能指标、失效机理、检测方法研究的基础上,通过比较各种检测方法,提出了一种新的蓄电池内阻在线检测方法——四线两端法,阐述了四线两端法的测试原理,给出了该方法在蓄电池在线检测中的检测步骤,同时分析了影响测量精度的主要因素,提出了提高测量精度所采取的措施,并给出系统测量误差。     

现代反舰导弹的电子对抗技术探讨

在分析现代舰艇防御系统主要的电子对抗措施的基础上．对反舰导弹在面临新的作战要求和环境下应采取的对抗技术进行了探讨。     

Optimal sensor placement for underwater threat detection

The optimization framework for optimal sensor placement for underwater threat detection has been developed. It considers single‐period and multiperiod detection models, each of which includes two components: detection algorithm and optimization problem for sensor placement. The detection algorithms for single‐period and multiperiod models are based on likelihood ratio and sequential testing, respectively. For the both models, the optimization problems use the principle of superadditive coverage, which is closely related to energy‐based and information‐based approaches. An algorithm for quasi‐regular sensor placement approximating solutions to the optimization problems has been developed based on corresponding continuous relaxations and a criterion for its applicability has been obtained. Numerical experiments have demonstrated that the algorithm consistently outperforms existing optimization techniques for optimal sensor placement.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Application of perturbation analysis to a class of periodic review (s,S) inventory systems

In this article we apply perturbation analysis (PA), combined with conditional Monte Carlo, to obtain derivative estimators of the expected cost per period with respect to s and S, for a class of periodic review (s, S) inventory systems with full backlogging, linear holding and shortage costs, and where the arrivals of demands follow a renewal process. We first develop the general form of four different estimators of the gradient for the finite-horizon case, and prove that they are unbiased. We next consider the problem of implementing our estimators, and develop efficient methodologies for the infinite-horizon case. For the case of exponentially distributed demand interarrival times, we implement our estimators using a single sample path. Generally distributed interarrival times are modeled as phase-type distributions, and the implementation of this more general case requires a number of additional off-line simulations. The resulting estimators are still efficient and practical, provided that the number of phases is not too large. We conclude by reporting the results of simulation experiments. The results provide further validity of our methodology and also indicate that our estimators have very low variance. © 1994 John Wiley & Sons, Inc.     

A simulated annealing approach to the cyclic staff-scheduling problem

This article presents the application of a simulated annealing heuristic to an NP-complete cyclic staff-scheduling problem. The new heuristic is compared to branch-and-bound integer programming algorithms, as well as construction and linear programming-based heuristics. It is designed for use in a continuously operating scheduling environment with the objective of minimizing the number of employees necessary to satisfy forecast demand. The results indicate that the simulated annealing-based method tends to dominate the branch-and-bound algorithms and the other heuristics in terms of solution quality. Moreover, the annealing algorithm exhibited rapid convergence to a low-cost solution. The simulated annealing heuristic is executed in a single program and does not require mathematical programming software. © 1993 John Wiley & Sons, Inc.     

Cost allocation in continuous-review inventory models

A centralized inventory system serves a number of stores with common ownership, and thus reliable and timely information sharing. Each of them pays a share of the inventory cost, and the reward structure leaves the owners of individual stores rewarded for their individual performance. Appropriate selection of a cost allocation method is important if such a centralized system is to last. In this work we propose three necessary criteria—stability (core of a related cooperative game), justifiability (consistency of benefits with costs), and polynomial computability. For a concrete example we demonstrate that common allocation procedures may not meet all three tests, and we present a method that that meets all three criteria. This kind of cost allocation analysis helps the common management to evaluate the trade-offs in choosing an allocation scheme for the cost of inventory centralization. © 1996 John Wiley & Sons, Inc.     

Modeling the fatigue life of longitudinal elements

Functional equations enable us to arrive at a simple consensus model for fatigue life of longitudinal elements based on engineering principles. The model is then applied to two representative data sets. By the application of proportional hazards techniques and subsequent likelihood analysis, simple parsimonious Weibull models are derived. Inter alia attention is given to the desirability of deriving models exhibiting plausible asymptotic independence. © 1996 John Wiley & Sons, Inc.     

Note: A local-search heuristic for large set-covering problems

In this note we describe a local-search heuristic (LSH) for large non-unicost set-covering problems (SCPs). The new heuristic is based on the simulated annealing algorithm and uses an improvement routine designed to provide low-cost solutions within a reasonable amount of CPU time. The solution costs associated with the LSH compared very favorably to the best previously published solution costs for 20 large SCPs taken from the literature. In particular, the LSH yielded new benchmark solutions for 17 of the 20 test problems. We also report that, for SCPs where column cost is correlated with column coverage, the new heuristic provides solution costs competitive with previously published results for comparable problems. © 1995 John Wiley & Sons, Inc.     

Makespan minimization for m parallel identical processors

We introduce an algorithm, called TMO (Two-Machine Optimal Scheduling) which minimizes the makespan for two identical processors. TMO employs lexicographic search in conjunction with the longest-processing time sequence to derive an optimal schedule. For the m identical parallel processors problem, we propose an improvement algorithm, which improves the seed solution obtained by any existing heuristic. The improvement algorithm, called Extended TMO, breaks the original m-machine problem into a set of two-machine problems and solves them repeatedly by the TMO. A simulation study is performed to evaluate the effectiveness of the proposed algorithms by comparing it against three existing heuristics: LPT (Graham, [11]), MULTIFIT (Coffman, Garey, and Johnson, [6]), and RMG (Lee and Massey, [17]). The simulation results show that: for the two processors case, the TMO performs significantly better than LPT, MULTIFIT, and RMG, and it generally takes considerably less CPU time than MULTIFIT and RMG. For the general parallel processors case, the Extended TMO algorithm is shown to be capable of greatly improving any seed solution. © 1995 John Wiley & Sons, Inc.