PAH emission from Nova Cen 1986

The discovery of broad emission features between 3.2 and 3.6 microns were reported in the spectrum of Nova Cen 1986 (V842 Cen) some 300 days following outburst and remaining prominent for several months. The general characteristics of these features are similar to those attributed to polycyclic hydrocarbon (PAH) molecules in other dusty sources, although the relative strengths are different, and these observations provide the first clear evidence for molecular constituents other than graphite particles in the ejecta of novae

On Randomized Algorithms for Matching in the Online Preemptive Model

We investigate the power of randomized algorithms for the maximum cardinality matching (MCM) and the maximum weight matching (MWM) problems in the online preemptive model. In this model, the edges of a graph are revealed one by one and the algorithm is required to always maintain a valid matching. On seeing an edge, the algorithm has to either accept or reject the edge. If accepted, then the adjacent edges are discarded. The complexity of the problem is settled for deterministic algorithms. Almost nothing is known for randomized algorithms. A lower bound of $1.693$ is known for MCM with a trivial upper bound of $2$. An upper bound of $5.356$ is known for MWM. We initiate a systematic study of the same in this paper with an aim to isolate and understand the difficulty. We begin with a primal-dual analysis of the deterministic algorithm due to McGregor. All deterministic lower bounds are on instances which are trees at every step. For this class of (unweighted) graphs we present a randomized algorithm which is $\frac{28}{15}$-competitive. The analysis is a considerable extension of the (simple) primal-dual analysis for the deterministic case. The key new technique is that the distribution of primal charge to dual variables depends on the "neighborhood" and needs to be done after having seen the entire input. The assignment is asymmetric: in that edges may assign different charges to the two end-points. Also the proof depends on a non-trivial structural statement on the performance of the algorithm on the input tree. The other main result of this paper is an extension of the deterministic lower bound of Varadaraja to a natural class of randomized algorithms which decide whether to accept a new edge or not using independent random choices

Radio-Excess IRAS Galaxies: IV. Optical Spectroscopy

This is the fourth in our series of papers investigating radio-excess galaxies, which have radio emission associated with an active nucleus but which do not fit into the traditional categories of either radio-loud or radio-quiet active galaxies. In this paper, we present optical spectra of our sample of FIR-luminous radio-excess galaxies. Optical emission line diagnostics are used to determine the dominant source of the ionizing radiation. We find that radio excess is an excellent indicator of the presence of an active nucleus: the radio-excess sample contains a much higher fraction of AGN than samples selected on FIR luminosity alone, or using other criteria such as warm FIR colors. Several objects have ambiguous classifications and are likely to be composite objects with mixed excitation. The type of optical spectrum appears to be associated with the radio-loudness: radio-loud objects may be more `pure' AGN than radio-intermediate objects. We find strong evidence for interaction between the radio plasma and the surrounding gas. The jet energy fluxes of the radio-excess objects, inferred from the [O III] luminosities, are lower than in powerful radio sources, consistent with our previous results. We conclude that the jets of radio-intermediate sources are intrinsically weaker than those in sources with more powerful radio emission. A significant fraction of the sample spectra show post-starburst stellar continuum, with A-star absorption lines, consistent with the large fraction of merging or disturbed host galaxies in the sample. The ages of the radio sources are significantly less than those of A stars indicating that, if the radio sources are associated with merging activity, there is a delay between the interaction and the initiation of the radio activity. (Abridged.)Comment: Accepted for publication in AJ; version with high resolution figures available from http://www.cis.rit.edu/~clbsps/papers/paper4.pd

Grid-connected renewables, storage and the UK electricity market

This article is a critical counterpoint to an article by published by Swift-Hook in the journal of Renewable Energy entitled "Grid-connected intermittent renewables are the last to be stored". In contrast to Swift-Hook we found evidence that "grid-connected intermittent renewables" have been, and will continue to be stored when it suits the "UK market" to do so.  This article is important to policy makers as energy storage (through EV battery demand side management for example) may well have an important role to play in facilitating the integration of high wind penetrations

Sublinear Estimation of Weighted Matchings in Dynamic Data Streams

This paper presents an algorithm for estimating the weight of a maximum weighted matching by augmenting any estimation routine for the size of an unweighted matching. The algorithm is implementable in any streaming model including dynamic graph streams. We also give the first constant estimation for the maximum matching size in a dynamic graph stream for planar graphs (or any graph with bounded arboricity) using $\tilde{O}(n^{4/5})$ space which also extends to weighted matching. Using previous results by Kapralov, Khanna, and Sudan (2014) we obtain a $\mathrm{polylog}(n)$ approximation for general graphs using $\mathrm{polylog}(n)$ space in random order streams, respectively. In addition, we give a space lower bound of $\Omega(n^{1-\varepsilon})$ for any randomized algorithm estimating the size of a maximum matching up to a $1+O(\varepsilon)$ factor for adversarial streams

The radial evolution of solar wind speeds

The WSA-ENLIL model predicts significant evolution of the solar wind speed. Along a flux tube the solar wind speed at 1.0 AU and beyond is found to be significantly altered from the solar wind speed in the outer corona at 0.1 AU, with most of the change occurring within a few tenths of an AU from the Sun. The evolution of the solar wind speed is most pronounced during solar minimum for solar wind with observed speeds at 1.0 AU between 400 and 500 km/s, while the fastest and slowest solar wind experiences little acceleration or deceleration. Solar wind ionic charge state observations made near 1.0 AU during solar minimum are found to be consistent with a large fraction of the intermediate-speed solar wind having been accelerated or decelerated from slower or faster speeds. This paper sets the groundwork for understanding the evolution of wind speed with distance, which is critical for interpreting the solar wind composition observations near Earth and throughout the inner heliosphere. We show from composition observations that the intermediate-speed solar wind (400-500 km/s) represents a mix of what was originally fast and slow solar wind, which implies a more bimodal solar wind in the corona than observed at 1.0 AU

Submodular Maximization Meets Streaming: Matchings, Matroids, and More

We study the problem of finding a maximum matching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges. This problem, which we call maximum submodular-function matching (MSM), is a natural generalization of maximum weight matching (MWM), which is in turn a generalization of maximum cardinality matching (MCM). We give two incomparable algorithms for this problem with space usage falling in the semi-streaming range---they store only $O(n)$ edges, using $O(n\log n)$ working memory---that achieve approximation ratios of $7.75$ in a single pass and $(3+\epsilon)$ in $O(\epsilon^{-3})$ passes respectively. The operations of these algorithms mimic those of Zelke's and McGregor's respective algorithms for MWM; the novelty lies in the analysis for the MSM setting. In fact we identify a general framework for MWM algorithms that allows this kind of adaptation to the broader setting of MSM. In the sequel, we give generalizations of these results where the maximization is over "independent sets" in a very general sense. This generalization captures hypermatchings in hypergraphs as well as independence in the intersection of multiple matroids.Comment: 18 page