基于R-树索引的Map-Reduce空间连接聚集操作

空间连接聚集是一种常用并且非常耗时的空间数据库操作,特别是在面对大规模空间数据集时,单机运行环境难以满足其对时空开销的需求,如何设计高效的面向云计算环境中的分布式空间连接聚集算法越来越受到人们关注。Map-Reduce作为云计算的核心模式受限于其扁平化的串行扫描操作模型,常被用来加速非索引的空间连接操作,现有工作尚无将Map-Reduce和R-树索引结合来处理空间连接聚集。因此,提出了基于R-树索引的Map-Reduce空间连接聚集算法(RSJA-MR)来更高效地返回连接聚集结果。提出一种分布式R-树索引结构以支持大规模空间数据的索引,RSJA-MR算法利用分布式R-树生成任务集,任务集的执行满足无依赖并行计算模式,很容易在Map-Reduce框架中进行表达。文中提出一种实时缓存策略以支持索引并发访问。实验结果表明:相比非索引的Map-Reduce连接聚集算法,在空间交叠连接聚集查询上,时间性能最少提升8%,在空间包含连接聚集查询上,时间性能最少提升近35%。     

求解分层介质结构空域格林函数的固定实镜像法

空域格林函数的求解是矩量法分析分层介质结构的主要困难 ,也是关键所在。在离散复镜像技术的基础上 ,注意到逆问题解的不唯一性 ,提出了一种新方法———固定实镜像法 (FRIM ) ,即在用一组空域复镜像 (表示为复指数级数和 )来拟合谱域格林函数时 ,根据经典镜像理论给定镜像的实位置 ,然后用简单的点匹配法来求出相应实镜像的复幅度。该方法避免了复镜像法中用Prony法或广义函数束法 (GPOF)拟合的复杂计算过程 ,提高了计算速度 ,且物理含义也更加明确。文中给出了该方法的基本原理 ,给出一组数值模拟结果 ,与复镜像法吻合得很好 ,证实了该方法的有效性     

贝叶斯参数估计在雷区范围估计中的应用

提出了以发现水雷位置信息为抽样点,在给定估计误差的条件下,使用贝叶斯参数估计方法进行雷区范围估计的思路。详细讨论了水雷服从均匀分布时使用贝叶斯参数估计方法估计雷区范围的问题,给出了相关公式的推导过程,并设法解决仿真中存在的中间数值过大的问题。仿真结果均在允许误差范围之内,这验证了算法的可行性。     

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     

The dynamic transshipment problem

We investigate the strategy of transshipments in a dynamic deterministic demand environment over a finite planning horizon. This is the first time that transshipments are examined in a dynamic or deterministic setting. We consider a system of two locations which replenish their stock from a single supplier, and where transshipments between the locations are possible. Our model includes fixed (possibly joint) and variable replenishment costs, fixed and variable transshipment costs, as well as holding costs for each location and transshipment costs between locations. The problem is to determine how much to replenish and how much to transship each period; thus this work can be viewed as a synthesis of transshipment problems in a static stochastic setting and multilocation dynamic deterministic lot sizing problems. We provide interesting structural properties of optimal policies which enhance our understanding of the important issues which motivate transshipments and allow us to develop an efficient polynomial time algorithm for obtaining the optimal strategy. By exploring the reasons for using transshipments, we enable practitioners to envision the sources of savings from using this strategy and therefore motivate them to incorporate it into their replenishment strategies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:386–408, 2001     

Analysis of a new vehicle scheduling and location problem

We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001     

Variables inspection for SPC‐quarantined production

When a control chart signals an out‐of‐control condition for a production process, it may be desirable to “quarantine” all units produced since the last in‐control SPC sample. This paper presents an efficient procedure for variables inspection of such “SPC quarantined” product. A Bayesian sequential inspection procedure is developed which determines whether the out of control production is of acceptable quality. By inspecting the units in reverse of the order in which they were produced, the procedure is also capable of detecting the point at which the process went out of control, thus eliminating the need to inspect units produced prior to the onset of the out of control condition. Numerical examples are presented, and the performance characteristics of the procedure are demonstrated using Monte Carlo simulation. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 159–171, 2001     

具有空间坐标耦合的二阶集群模型分析

在空间坐标耦合的情形下建立一种改进的二阶分布式集群模型。分析结果显示,如果系统的拓扑结构不变,当其确定的有向图具有有向支撑树并且速度的伴随系数大于某一临界值时,整个群体将随着耦合矩阵的旋转角的变化而呈现出三种集群样式——直线模式、圆柱螺线模式以及对数螺线模式。最后给出了这三种样式所对应的数值仿真结果。     

Military expenditures,economic growth and spatial spillovers

The relationship between economic growth and military expenditure has been the subject of a large literature in defence economics. This study analyses the influence of military expenditures on economic growth in a global perspective for the time period 2000–2010 taking spatial dimension into account. The augmented Solow model is employed to investigate the defence-growth nexus using the cross-sectional data relating to 128 countries. Following a traditional regression analysis, spatial variations in the relationships are examined utilizing different spatial econometric specifications estimated by maximum likelihood. The regressions are compared with each other via likelihood ratio tests, and the spatial Durbin model is found to be the most appropriate one suggesting that the typical least-squares model is misspecified. Empirical evidence indicates that military expenditure has a positive effect on economic growth with a significant spatial dependence for the time period under consideration.     

A spatial rank‐based multivariate EWMA control chart

Nonparametric control charts are useful in statistical process control when there is a lack of or limited knowledge about the underlying process distribution, especially when the process measurement is multivariate. This article develops a new multivariate self‐starting methodology for monitoring location parameters. It is based on adapting the multivariate spatial rank to on‐line sequential monitoring. The weighted version of the rank‐based test is used to formulate the charting statistic by incorporating the exponentially weighted moving average control scheme. It is robust to non‐normally distributed data, easy to construct, fast to compute and also very efficient in detecting multivariate process shifts, especially small or moderate shifts which occur when the process distribution is heavy‐tailed or skewed. As it avoids the need for a lengthy data‐gathering step before charting and it does not require knowledge of the underlying distribution, the proposed control chart is particularly useful in start‐up or short‐run situations. A real‐data example from white wine production processes shows that it performs quite well. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 91–110, 2012     

An analytical minefield evaluation model without space averages

The paper describes an approach to the evaluation of the effectiveness of a minefield in terms of the number of mines that are detonated by a convoy of sweepers and ships and the corresponding number of vessels that are immobilized. The positions of the mines and the tracks of the vessels are assumed to be known, which means that the evaluation measures are dependent on a large number of disjoint events, each event being the immobilization of particular vessels by particular mines. This may render combinatorial methods computationally infeasible, but by introducing approximations in the assumptions, the difficulty can be overcome, specifically by modelling the arrival of each individual vessel in the neighborhood of a mine by an inhomogeneous Poisson stream for which the arrival rate is nonzero only over a short time interval. The plausibility of the approach is supported by results of a critical-event simulation model.     

缓动点目标的流水线检测算法

讨论了复杂背景下缓动点目标的流水线检测算法。通过两个流水线,分割流水线和检测流水线,可以用１５帧图像满意地检测出目标。对算法的性能和实验结果作了分析。     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

弹道导弹落点预报的雷达系统仿真

根据弹道理论建立了雷达探测弹道导弹的仿真模型 ,并对仿真的雷达探测跟踪弹道数据给出了处理方法 ,预报了导弹落点范围 ,并与理论落点进行了比较 ,给出落点精度。仿真结果表明 :雷达对导弹的探测数据经过一定数据处理 ,可得到预定的落点精度 ,说明该种仿真方法是可行的     

舰炮一维弹道修正弹射击误差分离和校正研究

由于工作原理不同,传统无控弹射击校正方法不适用于一维弹道修正弹。分析了舰炮使用一维弹道修正弹射击误差构成和射击观测特点,提出一维弹道修正弹射击校正新方法,首先通过修正机构不工作,利用观测弹着点相对预测弹着点偏差平均值校正火控设备预测弹着点误差;然后利用修正弹正常工作时观测弹着点相对目标（或提前点）偏差平均值校正修正机构误差。假设各误差值,通过解弹道方程仿真计算表明,按新方法射击校正能够显著提高射击精度。     

概率条件下雷区范围估计研究

为更正现有雷区范围估计算法因搜扫率处置不当而存在的矛盾与不足,研究了搜扫率条件下的雷区范围估计问题。分不规则雷区和规则雷线两种情况,依据极大似然估计的原理,推导出搜扫率条件下的雷区范围估计算法,并对改进算法与现有算法进行了分析比较和仿真示例验证。分析和示例表明新算法克服了现有算法的缺陷,能够更符合实际地解决雷区范围估计问题。     

Puzzle‐based storage systems

We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Crane scheduling with spatial constraints

In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Defence budgets in the post-Cold War era: a spatial econometrics approach

This paper examines the determinants of national defence budgets in the post-Cold War era employing a spatial econometric framework. Using data for 124 countries over a 16-year time period, I examine spatial relationships in defence spending to investigate how countries account for the military spending of other countries when setting their budgets. Using specially developed weighting matrices, the regression results indicate that defence budgets are positively spatially correlated. These results provide support for the use of ‘external’ factors when examining defence budgets over this time period. The importance of a country’s spatial location when setting its budget is further examined through the identification of regions of high and low defence spending.     

矢量多边形并行栅格化数据划分方法

针对多边形并行栅格化中的负载不均衡问题提出一种新的数据划分方法,主要包括:迭代计算划分线的位置,在每次迭代中保证分块间的计算量大致均衡,完成数据划分、实现负载均衡;提出基于二叉树的划分结果融合策略,以解决跨边界多边形的融合问题。在多核CPU环境下实现并行算法,选用多个典型土地利用现状数据集进行测试。结果表明:针对不同类型多边形数据集,所提方法较传统方法可获得更高的并行加速比和更好的负载均衡;针对大数据量数据集,以多边形节点数为度量标准可更精确地估算分块计算量,从而更好地实现负载均衡。