A stochastic neighborhood search approach for airport gate assignment problem

An appropriate and efficient gate assignment is of great importance in airports since it plays a major role in the revenue obtained from the airport operations. In this study, we have focused mainly on maximum gate employment, or in other words minimize the total duration of un-gated flights. Here, we propose a method that combines the benefits of heuristic approaches with some stochastic approach instead of using a purely probabilistic approach to top-down solution of the problem. The heuristic approaches are usually used in order to provide a fast solution of the problem and later stochastic searches are used in order to ameliorate the previous results of the heuristic approach whenever possible. The proposed method generates an assignment order for the whole planes that corresponds to assignment priority. The ordering process is followed by the allocation step. Since, in practice, each airport has its own physical architecture, there have been arisen many constraints mainly concerning airplane types and parking lots in this step. Sequentially handling the plane ordering and allocation phases provides us great modularity in handling the constraints. The effectiveness of the proposed methodology has been tried to be illustrated firstly on fictively generated flight schedule data and secondly on the real world data obtained from a real world application developed for ?stanbul Atatürk Airport.     

Model Inadequacy and Residuals Control Charts for Autocorrelated Processes

As a result of time series parameter estimation based on previous data, the probability content of residuals control charts may vary when standard control limits are used. In this paper, we consider the AR(1) process with the autoregressive parameter being estimated from a sample of observations. The performance of the exponentially weighted moving average (EWMA) control chart for residuals is investigated. Modified control limits that account for the uncertainty in the parameter estimate are provided. Comparisons through simulation signify the importance of the modified control limits. Copyright © 2004 John Wiley & Sons, Ltd.     

Estimation of Length Limits for Integral Bridges Built on Clay

In this paper, the maximum length limits for integral bridges built on clay are determined as a function of the ability of steel H-piles supporting the abutments to sustain thermal-induced cyclic displacements and the flexural capacity of the abutment. First, H-pile sections that can accommodate large plastic deformations are determined considering their local buckling instability. Then, a low-cycle fatigue damage model is used to determine the maximum cyclic deformations that such piles can sustain. Next, nonlinear static pushover analyses of two typical integral bridges are conducted to study the effect of various geometric, structural, and geotechnical parameters on the performance of integral bridges subjected to uniform temperature variations. Using the pushover analyses results, design guidelines are developed to enhance and determine the maximum length limits for integral bridges built on clay. It is recommended that the maximum length of concrete integral bridges be limited to 210 m (689 ft) in cold climates and 260 m (853 ft) in moderate climates and that of steel integral bridges be limited to 120 m (394 ft) in cold climates and 180 m (590 ft) in moderate climates.     

Estimation of missing observations in two‐level split‐plot designs

Inserting estimates for the missing observations from split‐plot designs restores their balanced or orthogonal structure and alleviates the difficulties in the statistical analysis. In this article, we extend a method due to Draper and Stoneman to estimate the missing observations from unreplicated two‐level factorial and fractional factorial split‐plot (FSP and FFSP) designs. The missing observations, which can either be from the same whole plot, from different whole plots, or comprise entire whole plots, are estimated by equating to zero a number of specific contrast columns equal to the number of the missing observations. These estimates are inserted into the design table and the estimates for the remaining effects (or alias chains of effects as the case with FFSP designs) are plotted on two half‐normal plots: one for the whole‐plot effects and the other for the subplot effects. If the smaller effects do not point at the origin, then different contrast columns to some or all of the initial ones should be discarded and the plots re‐examined for bias. Using examples, we show how the method provides estimates for the missing observations that are very close to their actual values. Copyright © 2007 John Wiley & Sons, Ltd.     

Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection

Mobile devices with global positioning capabilities allow users to retrieve points of interest (POI) in their proximity. To protect user privacy, it is important not to disclose exact user coordinates to un-trusted entities that provide location-based services. Currently, there are two main approaches to protect the location privacy of users: (i) hiding locations inside cloaking regions (CRs) and (ii) encrypting location data using private information retrieval (PIR) protocols. Previous work focused on finding good trade-offs between privacy and performance of user protection techniques, but disregarded the important issue of protecting the POI dataset D. For instance, location cloaking requires large-sized CRs, leading to excessive disclosure of POIs (O(|D|) in the worst case). PIR, on the other hand, reduces this bound to \(O(\sqrt{|D|})\), but at the expense of high processing and communication overhead. We propose hybrid, two-step approaches for private location-based queries which provide protection for both the users and the database. In the first step, user locations are generalized to coarse-grained CRs which provide strong privacy. Next, a PIR protocol is applied with respect to the obtained query CR. To protect against excessive disclosure of POI locations, we devise two cryptographic protocols that privately evaluate whether a point is enclosed inside a rectangular region or a convex polygon. We also introduce algorithms to efficiently support PIR on dynamic POI sub-sets. We provide solutions for both approximate and exact NN queries. In the approximate case, our method discloses O(1) POI, orders of magnitude fewer than CR- or PIR-based techniques. For the exact case, we obtain optimal disclosure of a single POI, although with slightly higher computational overhead. Experimental results show that the hybrid approaches are scalable in practice, and outperform the pure-PIR approach in terms of computational and communication overhead.     

Review and comparative evaluation of symbolic dynamic filtering for detection of anomaly patterns

Symbolic dynamic filtering (SDF) has been recently reported in literature as a pattern recognition tool for early detection of anomalies (i.e., deviations from the nominal behavior) in complex dynamical systems. This paper presents a review of SDF and its performance evaluation relative to other classes of pattern recognition tools, such as Bayesian Filters and Artificial Neural Networks, from the perspectives of: (i) anomaly detection capability, (ii) decision making for failure mitigation and (iii) computational efficiency. The evaluation is based on analysis of time series data generated from a nonlinear active electronic system. This work has been supported in part by the U.S. Army Research Laboratory and the U.S. Army Research Office under Grant No. W911NF-07-1-0376, by the U.S. Office of Naval Research under Grant No. N00014-08-1-380, and by NASA under Cooperative Agreement No. NNX07AK49A.     

Synchronization of diffusively-coupled limit cycle oscillators

We develop analytical and numerical conditions to determine whether limit cycle oscillations synchronize in diffusively coupled systems. We examine two classes of systems: reaction–diffusion PDEs with Neumann boundary conditions, and compartmental ODEs, where compartments are interconnected through diffusion terms with adjacent compartments. In both cases the uncoupled dynamics are governed by a nonlinear system that admits an asymptotically stable limit cycle. We provide two-time scale averaging methods for certifying stability of spatially homogeneous time-periodic trajectories in the presence of sufficiently small or large diffusion and develop methods using the structured singular value for the case of intermediate diffusion. We highlight cases where diffusion stabilizes or destabilizes such trajectories.