Facility location on a grid with a diagonal line

This article extends the traditional median problem on a grid to include a diagonal line (e.g., a street). In contrast to the traditional median problem, this generalized problem is nonconvex and nonseparable, invalidating some of the properties on which well-known median-seeking algorithms are based. This work presents an algorithm for finding the median on this generalized grid and discusses the relationship between it and the traditional median.     

Relation between continuous and discrete time markovian decision problems

An associated discrete (continuous) time Markovian decision problem for any given continuous (discrete) time Markovian decision model is formulated. A relationship between the continuous and associated discrete time discounted returns is obtained. This result is used to show the existence of a deterministic stationary policy that optimizes both discounted return functions. It is also proved that the same policy optimizes the average expected return for both continuous and the associated discrete time processes. The results obtained in this paper can be used to solve the continuous time Markovian decision problem by using the discrete time algorithms or vice versa.     

LFM脉冲雷达测距偏差分析与估计

研究了线性调频(LFM)脉冲体制雷达由于距离-多普勒耦合效应造成的测距偏差问题。推导、分析了该测距偏差的产生机理,指出了偏差中被大多数研究者遗漏的非线性余项,并分析了该余项与雷达发射信号及目标运动参数的关系;利用无约束优化方法对该偏差余项进行估计。最后,计算机仿真实验验证了分析结论和估计算法的正确性。     

Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems

Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the length of the shortest augmenting path from the node to the sink. In this article we develop two distance-directed augmenting path algorithms for the maximum flow problem. Both the algorithms run in O(n²m) time on networks with n nodes and m arcs. We also point out the relationship between the distance labels and layered networks. Using a scaling technique, we improve the complexity of our distance-directed algorithms to O(nm log U), where U denotes the largest arc capacity. We also consider applications of these algorithms to unit capacity maximum flow problems and a class of parametric maximum flow problems.     

冲激电源作用于动态电路后初始值的求法

总结了冲激电源作用于动态电路后初始值求法的一些常见算法。针对这些算法的不足,论述了一种新的算法。     

自适应滤波算法的新进展

本文综述了自适应滤波算法研究的进展情况;指出了现有方法存在的问题。最后,对进一步研究的趋势提出了展望。     

Optimal schedules for special structure flowshops

This paper considers the problem of scheduling a given number of jobs on a specified number of machines in a flowshop where the objective function is to minimize the total throughput time in which all jobs complete processing on all machines. Based on the combinatorial analysis of the problem, several simple algorithms are developed for solving special structure flowshop scheduling problems where the process times are not completely random, but bear a well-defined relationship to one another. The proposed algorithms are both simple and computationally efficient and can optimally solve large-sized problems even with manual computational devices.     

Luenberger观测器与LADRC在稳瞄系统中的应用

针对稳瞄系统的性能有一定改进空间,而对象机械特性又改善受限的问题,试图从电气控制角度寻求更好的解决方法。为此,以某上反稳瞄系统为平台,对Luenberger观测器和LADRC(线性自抗扰控制器)两种能提高系统性能的先进控制算法进行了半实物仿真研究。首先,介绍了Luenberger观测器和LADRC的基本原理。其次,对某上反稳瞄系统的对象特性进行了分析,设计了基于两种控制模型的控制器参数。然后,运用MATLAB/Simulink工具和d SPACE半实物仿真系统,对某上反稳瞄系统进行了两种控制算法的对比研究。Luenberger观测器的控制性能相对较好,受噪声的影响,离工程实现还有一段距离。如何有效抑制噪声有待进一步研究。     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

AWGN信道中Turbo码的性能和仿真

主要对Turbo码的解码算法进行了研究,分析了常用的MAP解码算法,对Turbo码在AWGN信道中应用不同的解码算法进行了仿真,针对不同解码算法和解码迭代次数等因素对Turbo码性能影响进行分析,结果表明Turbo码在AWGN信道中和低信噪比条件下具有优良的性能。     

基于地形差分矩的 TERCOM 地图性能估计

提出了一种非平稳地形中TERCOM地图匹配性能的估计方法。首先利用地形差分过程研究相关匹配算法度量值的统计特性 ,获得度量值的均值和方差关于地形差分矩的解析表达。然后讨论度量值统计特性与局部匹配搜索截获概率的关系 ,建议用地形差分矩和局部搜索截获概率作为TERCOM地图匹配性能的估计。通过对实际地形的试验 ,说明基于地形差分矩的匹配性能估计方法是有效的。     

给定降质约束下一类DCT域图像水印算法的拉伸系数估计

数字水印是数字作品版权保护的重要技术手段。与噪声污染类似,数字水印的嵌入必然会损失原作品的质量。数字图像的质量直接关系其商业价值,在给定降质约束下自适应地调节嵌入深度是符合产业化标准的数字水印关键技术之一。根据DCT交流系数的拉普拉斯分布模型,推导了DCT域典型水印算法中拉伸系数与信噪比和峰值信噪比之间的理论关系。依据该理论关系,得到了在给定降质约束下一类典型图像水印算法的拉伸系数估计方法,实验结果表明该估计方法具有较高的精度。     

地形相关算法度量值的统计特性

考虑到地形相关匹配算法度量值统计特性与二维地形自相关系数的关系，本文提出一种改进的约翰逊方法——相关地形下的匹配算法度量值统计特性分析方法。首先，基于约翰逊方法的问题框架，修改其中基准数据的相邻像元值相互独立的假设，导出了地形相关 Ｍ Ｓ Ｄ 算法度量值的统计分布的解析函数。然后，讨论了约翰逊方法与本文方法的适用性，指出了约翰逊方法的不足之处。最后，给出了本文方法在地形可匹配性分析中的一种应用。     

武器-目标分配(WTA)问题研究进展

对武器-目标分配(WTA)问题的研究现状与进展进行了总结与述评.介绍了WTA问题的概念、基本模型、数学性质以及WTA问题研究的基本内容.目前WTA问题的研究内容主要集中在模型研究与算法研究两个方面.模型研究以静态模型的研究为主,但动态模型的研究还不够深入;算法研究则主要采用智能算法对WTA问题进行求解.目前基本上已经解决了小规模的静态WTA问题,但尚未有效解决大规模的动态WTA问题.     

Decomposition algorithms for finding the shortest path between a source node and a sink node of a network

Decomposition algorithms for finding a shortest path between a source node and a sink node of an arbitrary distance network are developed. Different decomposition algorithms are proposed for different network topologies. Since Shier's algorithm compares very favorably with other decomposition algorithms in all the network topologies, we compare our algorithms against Shier's algorithm. It is shown that the efficiency of the proposed algorithms compares very favorably with Shier's algorithm. For special types of networks the computational requirements of the proposed algorithm is a polynomial of O(n²).     

An n-step, 2-variable search algorithm for the component placement problem

The component placement problem is a specialization of the quadratic assignment problem that has been extensively studied for a decade and which is of considerable practical value. Recently, interest in component placement algorithms has risen primarily as a result of increased activity in the field of computer-aided design automation. This paper deals with the methodology of component placement and is based on the results of considerable operational experience. A tutorial presentation of tree search placement algorithms is provided, and an improved placement procedure is described which is demonstrated to be effective in generating near optimal solutions to the component placement problem. These solutions are completely reproducible and are obtained at an acceptable expenditure of computational resources. An additional objective is an assessment of performance of the class of near optimal algorithms. In particular, the question- how close to optimal are the near optimal solutions- is examined.     

A vertex-closing approach to the p-center problem

This article uses a vertex-closing approach to investigate the p-center problem. The optimal set of vertices to close are found in imbedded subgraphs of the original graph. Properties of these subgraphs are presented and then used to characterize the optimal solution, to establish a priori upper and lower bounds, to establish refined lower bounds, and to verify the optimality of solutions. These subgraphs form the foundation of two polynomial algorithms of complexity O(|E| log |E|) and O(|E|²). The algorithms are proven to converge to an optimum for special cases, and computational evidence is provided which suggests that they produce very good solutions more generally. Both algorithms perform very well on problems where p is large relative to the number of vertices n, specifically, when p/n ≥ 0.30. One of the algorithms is especially efficient for solving a sequence of problems on the same graph.     

图论中独立支配集的最佳求解算法研究

通过对图论中独立集和支配集的深入研究,提出了独立支配集的概念,论证了独立支配集同极大独立集及极小支配集之间的内在联系,并在此基础上给出了独立支配集的最佳求解算法,从而圆满地解决了图论中独立集及支配集的求解问题,对图的着色及匹配等问题的研究均有相当重要的借鉴意义。     

Two exact algorithms for the vehicle routing problem on trees

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time‐constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 75–89, 1999     

两种解相关算法的DOA估计性能研究

MUSIC算法能对独立信号的波达方向（DOA）进行有效估计,但该算法对相干信号或强相关信号进行DOA估计时,算法性能会随着相关系数的增加而急剧恶化甚至失效．针对该问题,利用前后向空间平滑技术与修正MU—SIC算法进行去相关,研究了它们去相关的基本原理及优缺点;利用MUSIC算法通过实验仿真对相关信号的波达方向估计性能进行了研究,分析了信号间相关系数对前后向空间平滑算法与修正MUSIC算法的测向性能的影响,并验证了算法去相关的有效性．