An intelligent assistant for exploratory data analysis

In this paper we present an account of the main features of SNOUT, an intelligent assistant for exploratory data analysis (EDA) of social science survey data that incorporates a range of data mining techniques. EDA has much in common with existing data mining techniques: its main objective is to help an investigator reach an understanding of the important relationships ina data set rather than simply develop predictive models for selectd variables. Brief descriptions of a number of novel techniques developed for use in SNOUT are presented. These include heuristic variable level inference and classification, automatic category formation, the use of similarity trees to identify groups of related variables, interactive decision tree construction and model selection using a genetic algorithm

Dynamical Evolution of Elliptical Galaxies with Central Singularities

We study the effect of a massive central singularity on the structure of a triaxial galaxy using N-body simulations. Starting from a single initial model, we grow black holes with various final masses Mh and at various rates, ranging from impulsive to adiabatic. In all cases, the galaxy achieves a final shape that is nearly spherical at the center and close to axisymmetric throughout. However, the rate of change of the galaxy's shape depends strongly on the ratio Mh/Mg of black hole mass to galaxy mass. When Mh/Mg < 0.3%, the galaxy evolves in shape on a timescale that exceeds 100 orbital periods, or roughly a galaxy lifetime. When Mh/Mg > 2%, the galaxy becomes axisymmetric in little more than a crossing time. We propose that the rapid evolution toward axisymmetric shapes that occurs when Mh/Mg > 2% provides a negative feedback mechanism which limits the mass of central black holes by cutting off their supply of fuel.Comment: 27 Latex pages, 9 Postscript figures, uses aastex.sty. Accepted for Publication in The Astrophysical Journal, Nov. 26, 199

Far-Term Exploration of Advanced Single-Aisle Subsonic Transport Aircraft Concepts

Far-term single-aisle class aircraft concepts for potential entry-into-service of 2045 were investigated using an Interactive Reconfigurable Matrix of Alternatives (IRMA) approach. The configurations identified through this design space exploration were then distilled into three advanced aircraft concepts best characterizing the prominent features identified through the IRMA exploration. These three aircraft concepts were then configured and sized for a 150-passenger capacity and a 3,500 nautical mile design mission. Mission block fuel burn was estimated and compared to a far-term conventional configuration baseline concept and a 2005 l. These comparisons suggest considerable potential improvements in fuel efficiency from the investigated advanced concepts

Modular Unmanned Aerial System with Multi-Mode Propulsion

A modular Unmanned Aerial System (UAS) includes an Unmanned Aerial Vehicle (UAV) parent module and UAV child modules. A main wing extends from a respective fuselage of the modules. The UAS includes docking mechanisms coupled to wingtips of the main wings. The child modules dock with the wingtips of the parent or an adjacent child module. Docking forms a linked-flight configuration, with undocking and separation from the parent or adjacent child module achieving an independent-flight configuration. The modules have booms arranged transverse to the main wings and parallel to the longitudinal axis, as well as front and rear rotors/propellers. The front and rear propellers have axes of rotation that are normal to a plane of the longitudinal axis in a vertical takeoff and landing (VTOL) configuration, with the axis of rotation of the rear propellers parallel to the longitudinal axis in a forward-flight configuration

A Hybrid N-body--Coagulation Code for Planet Formation

We describe a hybrid algorithm to calculate the formation of planets from an initial ensemble of planetesimals. The algorithm uses a coagulation code to treat the growth of planetesimals into oligarchs and explicit N-body calculations to follow the evolution of oligarchs into planets. To validate the N-body portion of the algorithm, we use a battery of tests in planetary dynamics. Several complete calculations of terrestrial planet formation with the hybrid code yield good agreement with previously published calculations. These results demonstrate that the hybrid code provides an accurate treatment of the evolution of planetesimals into planets.Comment: Astronomical Journal, accepted; 33 pages + 11 figure

Infrared conductivity of a d_{x^2-y^2}-wave superconductor with impurity and spin-fluctuation scattering

Calculations are presented of the in-plane far-infrared conductivity of a d_{x^2-y^2}-wave superconductor, incorporating elastic scattering due to impurities and inelastic scattering due to spin fluctuations. The impurity scattering is modeled by short-range potential scattering with arbitrary phase shift, while scattering due to spin fluctuations is calculated within a weak-coupling Hubbard model picture. The conductivity is characterized by a low-temperature residual Drude feature whose height and weight are controlled by impurity scattering, as well as a broad peak centered at 4 Delta_0 arising from clean-limit inelastic processes. Results are in qualitative agreement with experiment despite missing spectral weight at high energies.Comment: 29 pages (11 tar-compressed-uuencoded Postscript figures), REVTeX 3.0 with epsf macro

Collisional Dark Matter and the Origin of Massive Black Holes

If the cosmological dark matter is primarily in the form of an elementary particle which has cross section and mass for self-interaction having a ratio similar to that of ordinary nuclear matter, then seed black holes (formed in stellar collapse) will grow in a Hubble time, due to accretion of the dark matter, to a mass range 10^6 - 10^9 solar masses. Furthermore, the dependence of the final black hole mass on the galaxy velocity dispersion will be approximately as observed and the growth rate will show a time dependence consistent with observations. Other astrophysical consequences of collisional dark matter and tests of the idea are noted.Comment: 7 pages, no figures, LaTeX2e, Accepted for publication in Phys. Rev. Lett. Changed conten

Robust Machine Learning Applied to Astronomical Datasets I: Star-Galaxy Classification of the SDSS DR3 Using Decision Trees

We provide classifications for all 143 million non-repeat photometric objects in the Third Data Release of the Sloan Digital Sky Survey (SDSS) using decision trees trained on 477,068 objects with SDSS spectroscopic data. We demonstrate that these star/galaxy classifications are expected to be reliable for approximately 22 million objects with r < ~20. The general machine learning environment Data-to-Knowledge and supercomputing resources enabled extensive investigation of the decision tree parameter space. This work presents the first public release of objects classified in this way for an entire SDSS data release. The objects are classified as either galaxy, star or nsng (neither star nor galaxy), with an associated probability for each class. To demonstrate how to effectively make use of these classifications, we perform several important tests. First, we detail selection criteria within the probability space defined by the three classes to extract samples of stars and galaxies to a given completeness and efficiency. Second, we investigate the efficacy of the classifications and the effect of extrapolating from the spectroscopic regime by performing blind tests on objects in the SDSS, 2dF Galaxy Redshift and 2dF QSO Redshift (2QZ) surveys. Given the photometric limits of our spectroscopic training data, we effectively begin to extrapolate past our star-galaxy training set at r ~ 18. By comparing the number counts of our training sample with the classified sources, however, we find that our efficiencies appear to remain robust to r ~ 20. As a result, we expect our classifications to be accurate for 900,000 galaxies and 6.7 million stars, and remain robust via extrapolation for a total of 8.0 million galaxies and 13.9 million stars. [Abridged]Comment: 27 pages, 12 figures, to be published in ApJ, uses emulateapj.cl

Service differentiated drop code unit for metro ring optical networks

The authors demonstrate using both simulation and experiment, a drop code unit for metro ring optical networks with service differentiation capability. This is achieved by means of a spectral amplitude coding technique whereby the code weight in a particular channel is varied to provide different signal quality levels. Transmission of three channels with different weights operating at 10 Gbps per channel was simulated over a 68 km unamplified and 185 km amplified links of dispersion compensated fibre. Services are perfectly dropped at bit error rates from 10−9 to 10−3, leaving the through service free from accumulated noise. The authors also present a 2.5 Gbps per channel proof-of-concept experiment over 40 km of single-mode fibre (SMF)

Inducing safer oblique trees without costs

Decision tree induction has been widely studied and applied. In safety applications, such as determining whether a chemical process is safe or whether a person has a medical condition, the cost of misclassification in one of the classes is significantly higher than in the other class. Several authors have tackled this problem by developing cost-sensitive decision tree learning algorithms or have suggested ways of changing the distribution of training examples to bias the decision tree learning process so as to take account of costs. A prerequisite for applying such algorithms is the availability of costs of misclassification. Although this may be possible for some applications, obtaining reasonable estimates of costs of misclassification is not easy in the area of safety. This paper presents a new algorithm for applications where the cost of misclassifications cannot be quantified, although the cost of misclassification in one class is known to be significantly higher than in another class. The algorithm utilizes linear discriminant analysis to identify oblique relationships between continuous attributes and then carries out an appropriate modification to ensure that the resulting tree errs on the side of safety. The algorithm is evaluated with respect to one of the best known cost-sensitive algorithms (ICET), a well-known oblique decision tree algorithm (OC1) and an algorithm that utilizes robust linear programming