Investigation of Air Transportation Technology at Princeton University, 1989-1990

The Air Transportation Technology Program at Princeton University proceeded along six avenues during the past year: microburst hazards to aircraft; machine-intelligent, fault tolerant flight control; computer aided heuristics for piloted flight; stochastic robustness for flight control systems; neural networks for flight control; and computer aided control system design. These topics are briefly discussed, and an annotated bibliography of publications that appeared between January 1989 and June 1990 is given

Swarm Intelligence Based Multi-phase OPF For Peak Power Loss Reduction In A Smart Grid

Recently there has been increasing interest in improving smart grids efficiency using computational intelligence. A key challenge in future smart grid is designing Optimal Power Flow tool to solve important planning problems including optimal DG capacities. Although, a number of OPF tools exists for balanced networks there is a lack of research for unbalanced multi-phase distribution networks. In this paper, a new OPF technique has been proposed for the DG capacity planning of a smart grid. During the formulation of the proposed algorithm, multi-phase power distribution system is considered which has unbalanced loadings, voltage control and reactive power compensation devices. The proposed algorithm is built upon a co-simulation framework that optimizes the objective by adapting a constriction factor Particle Swarm optimization. The proposed multi-phase OPF technique is validated using IEEE 8500-node benchmark distribution system.Comment: IEEE PES GM 2014, Washington DC, US

Unravelling the size distribution of social groups with information theory on complex networks

The minimization of Fisher's information (MFI) approach of Frieden et al. [Phys. Rev. E {\bf 60} 48 (1999)] is applied to the study of size distributions in social groups on the basis of a recently established analogy between scale invariant systems and classical gases [arXiv:0908.0504]. Going beyond the ideal gas scenario is seen to be tantamount to simulating the interactions taking place in a network's competitive cluster growth process. We find a scaling rule that allows to classify the final cluster-size distributions using only one parameter that we call the competitiveness. Empirical city-size distributions and electoral results can be thus reproduced and classified according to this competitiveness, which also allows to correctly predict well-established assessments such as the "six-degrees of separation", which is shown here to be a direct consequence of the maximum number of stable social relationships that one person can maintain, known as Dunbar's number. Finally, we show that scaled city-size distributions of large countries follow the same universal distribution

A survey of kernel and spectral methods for clustering

Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with a special interest in two recent approaches: kernel and spectral methods. The aim of this paper is to present a survey of kernel and spectral clustering methods, two approaches able to produce nonlinear separating hypersurfaces between clusters. The presented kernel clustering methods are the kernel version of many classical clustering algorithms, e.g., K-means, SOM and neural gas. Spectral clustering arise from concepts in spectral graph theory and the clustering problem is configured as a graph cut problem where an appropriate objective function has to be optimized. An explicit proof of the fact that these two paradigms have the same objective is reported since it has been proven that these two seemingly different approaches have the same mathematical foundation. Besides, fuzzy kernel clustering methods are presented as extensions of kernel K-means clustering algorithm. (C) 2007 Pattem Recognition Society. Published by Elsevier Ltd. All rights reserved