Global Moran’s I and local Moran’s Ii are the most commonly used test statistics for spatial autocorrelation in univariate map patterns or in regression residuals. They belong to the general class of ratios of quadratic forms for whom a whole array of approximation techniques has been proposed in the statistical literature, such as the prominent saddlepoint approximation by Offer Lieberman (199...

In this paper, we examine the eeects of noise on both local search and genetic search. Understanding the potential eeects of noise on a search space may explain why some search techniques fail and why others succeed in the presence of noise. We discuss two eeects that are the result of adding noise to a search space: the annealing of peaks in the search space and the introduction of false local...

In recent decade, development of telecommunications infrastructure has led to rapid exchange of data between the distribution network components and the control center in many developed countries. These changes, considering the numerous benefits of the Distributed Generators (DGs), have made more motivations for distribution companies to utilize these kinds of generators more than ever before. ...

An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...

A dense sensor network consisting of passive infrared motion detectors was developed and used to record human activity in hallways and rooms in a large campus building. Algorithms were developed that: (a) automatically determine the topology of the network from the sensor data, so that manual mapping is not required, (b) automatically learn patterns of sensor readings in local spatial and tempo...

A number of algorithms have been proposed for the Minimum Vertex Cover problem. However, they are far from satisfactory, especially on hard instances. In this paper, we introduce Edge Weighting Local Search (EWLS), a new local search algorithm for the Minimum Vertex Cover problem. EWLS is based on the idea of extending a partial vertex cover into a vertex cover. A key point of EWLS is to find a...

Bayesian optimization is renowned for its sample efficiency but its application to higher dimensional tasks is impeded by its focus on global optimization. To scale to higher dimensional problems, we leverage the sample efficiency of Bayesian optimization in a local context. The optimization of the acquisition function is restricted to the vicinity of a Gaussian search distribution which is mov...

The high teletraac demand of local loop customers as compared to cellular mobile customers requires a cellular system to have a higher capacity if used for wireless local loop access. To cope with this fact Space Division Multiple Access is proposed to be implemented on top of a cellular F/TDMA system. SDMA allows the spatial user distribution to be exploited for multiple access. Thus, the prop...