Noise and vibration measurements in a Viking military vehicle

Noise and whole-body vibration measurements were made in a Viking military vehicle to determine the variation that should be expected during repeat measures, the effect of speed (up to 60 km/h in 5 km/h increments), and during travel over different types of terrain (comprising concrete road, gravel track and rough cross-country). Measurements were made at various crew positions (including the driver and commander) in both the front and the rear cabs in the vehicles. Three translational axes of vibration were measured in each seat. Two speeds were investigated over road (35 km/h and 55–60 km/h) and gravel (20 km/h and 35 km/h) surfaces. The effect of varying speed of the vehicle on the measured noise and vibration magnitudes was also investigated. The highest sound pressure level (L_Aeq) of 104 dB(A) was measured at the commander’s standing position during travel over concrete road at 55 km/h. Higher noise levels occurred for a standing commander compared with when sitting on the seat. A maximum single axis frequency-weighted vibration magnitude of 1.0 m/s² r.m.s. was measured on the driver’s seat during travel over track at 35 km/h. Higher vibration magnitudes occurred during travel over track compared with travel over road. Both noise and vibration exposure of crew within the Viking vehicle increased with increasing speed of the vehicle.     

舰船研制中设计余量的权衡分析

分析了舰船及其装备研制的时间特点 ,给出了用于预测的空间特性有关计算公式 .对设计余量的种类和体现方式进行了讨论 ,并对国内外现有设计实例进行了详细的得失分析和权衡 ,在此基础上提出了分析结论 .     

Incorporation dynamic aspects and uncertainty in 1‐median location problems

In this paper we present several 1‐median formulations on a tree network which incorporate dynamic evolution and/or uncertainty of node demands and transportation costs over a planning horizon. Dynamic evolution is modeled using linear demand functions for the nodes and linear length functions for the edges. Uncertainty is modeled with the use of multiple scenarios, where a scenario is a complete specification of the uncertain node demands and/or edge lengths. We formulate our objective using minimax regret like criteria. We use two different criteria, namely, robust deviation and relative robustness. We discuss what motivated the introduction of these objectives, as well as their relation to existing literature and decision making practices. For all of the models presented, we provide low‐order polynomial time algorithms. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 147–168, 1999     

Class scheduling algorithms for Navy training schools

The problem of developing good schedules for Navy C-Schools has been modeled as a combinatorial optimization problem. The only complicating feature of the problem is that classes must be grouped together into sequences known as pipelines. An ideal schedule will have all classes in a pipeline scheduled in consecutive weeks. The objective is to eliminate the nonproductive time spent by sailors at C-Schools who are waiting for the next class in a pipeline. In this investigation an implicit enumeration procedure for this problem was developed. The key component of our algorithm is a specialized greedy algorithm which is used to obtain a good initial incumbent. Often this initial incumbent is either an optimal schedule or a near optimal schedule. In an empirical analysis with the only other competing software system, our greedy heuristic found equivalent or better solutions in substantially less computer time. This greedy heuristic was extended and modified for the A-School scheduling problem and was found to be superior to its only competitor. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 533–551, 1998     

The dynamic lot size model with quantity discount: Counterexamples and correction

Federgruen and Lee ([3]) proposed an optimal algorithm for the single-item dynamic lot size model with all-unit discount. In this note we show that their algorithm fails to find the optimal solution for some special cases. We also provide a modification to the algorithm to handle them. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 419–422, 1998     

Interchange fees for bank ATM networks

Banks have found it advantageous to connect their Automated Teller Machines (ATMs) in networks so that customers of one bank may use the ATMs of any bank in the network. When this occurs, an interchange fee is paid by the customer's bank to the one that owns the ATM. These have been set by historic interbank negotiation. The paper investigates how a model based on n-player game theory concepts of Shapley value and nucleolus could be used as an alternative way of setting such fees. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 407–417, 1998     

Risk pooling in a two-period,two-echelon inventory stocking and allocation problem

The object of this article is to investigate the risk-pooling effect of depot stock in two-echelon distribution system in which the depot serves n retailers in parallel, and to develop computationally tractable optimization procedures for such systems. The depot manager has complete information about stock levels and there are two opportunities to allocate stock to the retailers within each order cycle. We identify first- and second-order aspects to the risk-pooling effect. In particular, the second-order effect is the property that the minimum stock available to any retailer after the second allocation converges in probability to a constant as the number of retailers in the system increases, assuming independence of the demands. This property is exploited in the development of efficient procedures to determine near-optimal values of the policy parameters.