子集和问题的分治求解

介绍了求解子集和问题的一个分治算法。设给定的n个正整数为A(1),A(2),…,A(n-1),A(n),给定的子集和为正整数M,算法的时间复杂性为O(nlog2(M+1)+1),空间复杂性为O(n)。当M较小时,算法复杂性优于二表算法的复杂性。     

The gradual covering problem

In this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility. This formulation can be converted to the Weber problem by imposing a special structure on its cost function. The cost is zero (negligible) up to a certain minimum distance, and it is a constant beyond a certain maximum distance. Between these two extreme distances the cost is linear in the distance. The problem is analyzed and a branch and bound procedure is proposed for its solution. Computational results are presented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

极大单调算子零点的逼近问题

设H为实Hilbert空间,C为H的非空闭凸子集,T:C→2H为极大单调算子,假设S(T)={x∈H:0∈Tx}≠Φ。 xk∈H,βk>0,求 xk及ek满足( )　　xk+ek∈ xk+βkT( xk),‖ek‖≤ηk‖xk- xk‖, k≥0,其中,ηk≥0,supk>0ηk<1,βk≥β>0。设PC:H→C为H到C上的最近点投影算子,定义xk+1=PC( xk-ek),k≥0,证明了若T满足(S)型条件,则{xk}k≥0强收敛于T的某个零点。     

BBO晶体II型相位匹配光参量振荡器的输出线宽

采用355nm脉冲激光作为泵浦源,对影响BBO晶体II型相位匹配光参量振荡器输出线宽的各种物理机制进行了数值模拟计算和分析。结果表明,II型相位匹配是光参量振荡器获得窄线宽的有效而简单的手段。     

Newsvendor problems with sequentially revealed demand information

This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012     

A standardized scan statistic for detecting spatial clusters with estimated parameters

The scan statistic based on likelihood ratios (LRs) have been widely discussed for detecting spatial clusters. When developing the scan statistic, it uses the maximum likelihood estimates of the incidence rates inside and outside candidate clusters to substitute the true values in the LR statistic. However, the parameter estimation has a significant impact on the sensitivity of the scan statistic, which favors the detection of clusters in areas with large population sizes. By presenting the effects of parameter estimation on Kulldorff's scan statistic, we suggest a standardized scan statistic for spatial cluster detection. Compared to the traditional scan statistic, the standardized scan statistic can account for the varying mean and variance of the LR statistic due to inhomogeneous background population sizes. Extensive simulations have been performed to compare the power of the two cluster detection methods with known or/and estimated parameters. The simulation results show that the standardization can help alleviate the effects of parameter estimation and improve the detection of localized clusters. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于预测命中点的机动目标最优制导方法

针对导弹攻击机动目标的情况,提出了一种基于"当前"统计模型的预测命中点方法。首先对目标进行实时机动检测,并预测了拦截时刻目标的位置。基于预测命中点的结果,推导得到导弹攻击机动目标最优制导方法的解析解。该方法无需提前假设目标机动模式,适用性好。在多个假想的攻击场景下对制导方法进行了仿真,仿真结果验证了该方法是有效的。     

基于时延的宽带LFM信号DOA估计算法

针对常用宽带LFM信号DOA估计算法采样数据量大、运算量大的特点,提出了一种基于时延的宽带LFM信号DOA估计算法。先把阵元接收到的信号变换到频域,而后用极值频率点进行时延估计,并对各极值频率点的时延估计值进行加权平均,进而估计出宽带LFM信号的来波方位。仿真验证了该算法的合理性和有效性。     

灵巧噪声干扰本质及相关基本问题探讨

为正确理解和实施灵巧噪声干扰,基于匹配滤波器理论对灵巧噪声干扰的本质含义进行了分析。指出,灵巧噪声干扰的本质含义是使干扰由多个分量组成,并且使干扰中的每一个分量的频谱都与雷达发射信号的频谱相同,从而使干扰中的每一个分量的功率利用效率都达到最大。最后,从理论和实践2个角度,阐述了与灵巧噪声干扰相关的基本问题,并进行了相应的分析。