Explicit solution of partitioning problems over a 1‐dimensional parameter space

We consider a class of partitioning problems where the partitioned set is a finite set of real numbers and the objective function of a partition is a function of the vector whose coordinates are the sums of the elements in each part of the given partition (the number of such parts is assumed given). We obtain an explicit solution of such partitioning problem with polynomial complexity bounds. © John Wiley & Sons, Inc. Naval Research Logistics 47: 531–540, 2000     

Optimal scheduling of reader—systems

We consider a reader—writer system consisting of a single server and a fixed number of jobs (or customers) belonging to two classes. Class one jobs are called readers and any number of them can be processed simultaneously. Class two jobs are called writers and they have to be processed one at a time. When a writer is being processed no other writer or readers can be processed. A fixed number of readers and writers are ready for processing at time 0. Their processing times are independent random variables. Each reader and writer has a fixed waiting cost rate. We find optimal scheduling rules that minimize the expected total waiting cost (expected total weighted flowtime). We consider both nonpreemptive and preemptive scheduling. The optimal nonpreemptive schedule is derived by a variation of the usual interchange argument, while the optimal schedule in the preemptive case is given by a Gittins index policy. These index policies continue to be optimal for systems in which new writers enter the system in a Poisson fashion. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 483–495, 1998     

Real-time prediction of projectile penetration to laminates by training machine learning models withfinite element solver as the trainer

Studies on ballistic penetration to laminates is complicated, but important for design effective protection of structures. Experimental means of study is expensive and can often be dangerous. Numerical simu-lation has been an excellent supplement, but the computation is time-consuming. Main aim of this thesis was to develop and test an effective tool for real-time prediction of projectile penetrations to laminates by training a neural network and a decision tree regression model. A large number of finite element models were developed;the residual velocities of projectiles fromfinite element simulations were used as the target data and processed to produce sufficient number of training samples. Study focused on steel 4340tpolyurea laminates with various configurations. Four different 3D shapes of the projectiles were modeled and used in the training. The trained neural network and decision tree model was tested using independently generated test samples using finite element models. The predicted projectile velocity values using the trained machine learning models are then compared with thefinite element simulation to verify the effectiveness of the models. Additionally, both models were trained using a published experimental data of projectile impacts to predict residual velocity of projectiles for the unseen samples. Performance of both the models was evaluated and compared. Models trained with Finite element simulation data samples were found capable to give more accurate predication, compared to the models trained with experimental data, becausefinite element modeling can generate much larger training set, and thus finite element solvers can serve as an excellent teacher. This study also showed that neural network model performs better with small experimental dataset compared to decision tree regression model.     

Field test and probabilistic analysis of irregular steel debris casualty risks from a person-borne improvised explosive device

Person-borne improvised explosive devices (PBIEDs) are often used in terrorist attacks in Western countries. This study aims to predict the trajectories of PBIED fragments and the subsequent safety risks for people exposed to this hazard. An explosive field test with a typical PBIED composed of a plastic explosive charge and steel nut enhancements was performed to record initial fragment behaviour, including positions, velocity, and trajectory angles. These data were used to predict the full trajectory of PBIED fragments using a probabilistic analysis. In the probabilistic analyses a probability of fatality or serious injury was computed. Based on the results presented, many practical conclusions can be drawn, for instance, regarding safe evacuation distances if a person were exposed to a suspected PBIED.     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Maximizing project cash availability

Consider a project during the life cycle of which there are cash payouts and in‐flows. To better meet his financial commitments, the project owner would like to meet all deadlines without running out of cash. We show that the cash availability objective is similar to the total weighted flowtime used to measure work‐in‐progress performance in the scheduling and inventory control literatures. In this article we provide several specialized solution methods for the problem of minimizing total weighted flowtime in an arbitrary acyclic project network, subject to activity release times and due dates, where the activity weights may be positive or negative and represent cash in‐ and out‐flows. We describe the structure of an optimal solution and provide several efficient algorithms and their complexity based on mincost and maxflow formulations. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

RETROSPECT AND PROSPECT: TRENDS IN COST AND THEIR IMPLICATIONS FOR UK AEROSPACE

This paper, intended to stimulate debate, suggests that we are at a turning point in the history of the UK military aerospace industry. It argues that there is urgent need for a fresh vision as to how the UK military aerospace industry can both prosper and make its maximum contribution to the defence of Britain. Further, the resulting plans and policies must emphasise the robustness of defence capabilities in a future in which the only thing we can be certain is that it will be very different from the present – especially whenever defence most matters.     

Deferred verification: verifiable declarations of fissile-material stocks for disarmament purposes

ABSTRACT

Nuclear disarmament is often seen as eventually requiring access to nuclear warheads or to the warhead-dismantlement process to verify that a state has not hidden weapons or weapon-materials despite promising to disarm. This article suggests this view is misplaced, and that what is needed is a verification mechanism able to provide reliable assurances of the absence of fissile materials available for use in weapons after a state has disarmed. Such a mechanism will need an initial declaration of the amount of fissile materials held by a state for all purposes, military and civilian. In a state with a nuclear arsenal awaiting elimination, this declaration would have to include materials that may not be available for verification because they are in nuclear weapons or are in other classified or proliferation-sensitive forms. This article describes a verification arrangement that does not require access to materials in weapons and in sensitive forms while still allowing checks on the overall accuracy of the declaration. Verification of the completeness and correctness of the declaration is deferred to the time when the weapons-relevant material enters the disposition process, at which point it no longer has any sensitive attributes. By removing the focus on monitoring warheads and dismantlement, this new approach could provide a more manageable path to nuclear disarmament.     

Models of scientific and technological review for the Biological and Toxin Weapons Convention

ABSTRACT

Science and technology (S&T) review is key to anticipating developments in the life sciences that may benefit or run contrary to the aims of the 1972 Biological and Toxin Weapons Convention. It serves as a mechanism for both preparing against novel biological threats and identifying the best opportunities for developing and sharing the life sciences to the fullest extent. In the age of rapidly advancing biotechnology, S&T review needs to be wide ranging, involve a diverse set of inputs, and be transparent about its methods and data. This viewpoint considers four models of S&T review and their capacity to respond to the challenge of the life sciences: standing advisory boards; ad hoc working groups; peer review; and wikis. It then identifies a hybrid model that is suitably broad, diverse, and transparent.     

Concept costing for defence projects: the problem and its solution

It is intrinsic to the nature of military competition that the unit acquisition costs of defence systems rise generation by generation. Traditional “bottom‐up” methods of cost‐estimating cannot meet the increasing demands for extensive studies of many options before commencing design and, while “top‐down” estimating techniques are an improvement, in particular by reducing the time required for preparing estimates, they also are inadequate to meet current requirements. A new method has been devised, therefore, further developing “top‐down” methods using Bayesian techniques to make best use of the available information, whether certain or uncertain, and its accuracy established by example.