一种固体导弹最大射程评定方法

本文提出了一种基于固体火箭发动机性能散布分析的固体导弹最大射程评定方法，将系统辨识、性能散布分析和统计分析有机结合，实用性强，对固体导弹试验鉴定技术研究具有重要意义。     

Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017     

广义逆指数分布元件的可靠性分析

在II型混合截尾样本下,得到了广义逆指数分布未知参数的最大似然估计。利用最大似然估计的渐近正态性构造了参数的渐近置信区间,运用Lindley's逼近方法和TierneyKadane's逼近方法计算出了参数的Bayes估计。最后,运用Monte-Carlo方法对上述估计方法结果作了模拟比较。     

Scheduling with variable time slot costs

In this article, we study a class of new scheduling models where time slot costs have to be taken into consideration. In such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial‐time algorithms for special cases with non‐increasing time slot costs.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Optimizing fishbone aisles for dual‐command operations in a warehouse

Unit‐load warehouses store and retrieve unit‐loads, typically pallets. When storage and retrieval operations are not coordinated, travel is from a pickup and deposit (P&D) point to a pallet location and back again. In some facilities, workers interleave storage and retrieval operations to form a dual‐command cycle. Two new aisle designs proposed by Gue and Meller (“Improving the unit‐load warehouse.” In Progress in Material Handling Research: 2006. Material Handling Industry of America, Charlotte, NC, 2006) use diagonal aisles to reduce the travel distance to a single pallet location by approximately 10 and 20[percnt] for the two designs, respectively. We develop analytical expressions for travel between pallet locations for one of these—the fishbone design. We then compare fishbone warehouses that have been optimized for dual‐command to traditional warehouses that have been optimized in the same manner, and show that an optimal fishbone design reduces dual‐command travel by 10–15%. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 54: 389–403, 2009     

Statistical analysis of exponential lifetimes under an adaptive Type‐II progressive censoring scheme

In this article, a mixture of Type‐I censoring and Type‐II progressive censoring schemes, called an adaptive Type‐II progressive censoring scheme, is introduced for life testing or reliability experiments. For this censoring scheme, the effective sample size m is fixed in advance, and the progressive censoring scheme is provided but the number of items progressively removed from the experiment upon failure may change during the experiment. If the experimental time exceeds a prefixed time T but the number of observed failures does not reach m, we terminate the experiment as soon as possible by adjusting the number of items progressively removed from the experiment upon failure. Computational formulae for the expected total test time are provided. Point and interval estimation of the failure rate for exponentially distributed failure times are discussed for this censoring scheme. The various methods are compared using Monte Carlo simulation. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

履带车辆动力性仿真研究

为仿真履带车辆动力性,建立了动力性评价指标的仿真模型,并以某型车为实例,应用Matlab语言编程计算得出理论值,通过与试验值比较验证了模型的有效性和准确性。     

Revisiting the justification for an all-volunteer force

In 1968, President Nixon established the Commission on an All-Volunteer Armed Force, or the Gates Commission, which served as the impetus and justification for an All-Volunteer Force (AVF). At the end of its deliberations, the commission recommended abolishing the draft and transforming the U.S. military into a force of volunteers beginning in 1973. Interestingly, the debate regarding the merits of both systems appeared to be largely economic – with cost–benefit analysis playing the primary role. Lately, we are beginning to see a new, politically-motivated impetus for returning to a “system of national service.” The ideas spurring this debate are many: the need to reaffirm the nation state, the commitment of citizens to the state, political ownership and oversight of the forces, the need for social equity in serving the nation, limiting the support for armed conflict by burden-sharing among citizens, and equitably spreading the personal cost of war.     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

基于星座图恢复的MQAM信号调制方式识别算法*

针对MQAM信号调制方式的识别问题,提出了一种基于星座图恢复的算法。该算法首先估计信号载频及信噪比等参数,并依据波特率和符号定时完成对接收信号的波特率采样。随后采用一种非判决辅助载频偏差估计方法,以消除载频偏差及相位偏移对星座图恢复的影响。最后利用平均似然比检测的方法,完成MQAM信号调制方式的识别。仿真结果表明,与仅考虑信号幅值分布的极大似然算法相比,该算法具有更优的识别性能。