We have observed two kinematically offset active galactic nuclei (AGN), whose ionised gas is at a different line-of-sight velocity to their host galaxies, with the SAMI integral field spectrograph (IFS). One of the galaxies shows gas kinematics very
different to the stellar kinematics, indicating a recent merger or accretion event. We demonstrate that the star formation associated with this event was triggered within the last 100 Myr. The other galaxy shows simple disc rotation in both gas and stellar kinematics, aligned with each other, but in the central region has signatures of an outflow driven by the AGN. Other than the outflow, neither galaxy shows any discontinuity in the ionised gas kinematics at the galaxys centre. We conclude that in these two cases there is no direct evidence of the AGN being in a supermassive black hole binary system. Our study demonstrates that selecting kinematically offset AGN from single-fibre spectroscopy provides, by definition, samples of kinematically peculiar objects, but IFS or other data are required to determine their true nature.
The Sydney-AAO Multi-object Integral field spectrograph (SAMI) Galaxy Survey is an ongoing project to obtain integral field spectroscopic observations of ~3400 galaxies by mid-2016. Including the pilot survey, a total of ~1000 galaxies have been obse
rved to date, making the SAMI Galaxy Survey the largest of its kind in existence. This unique dataset allows a wide range of investigations into different aspects of galaxy evolution. The first public data from the SAMI Galaxy Survey, consisting of 107 galaxies drawn from the full sample, has now been released. By giving early access to SAMI data for the entire research community, we aim to stimulate research across a broad range of topics in galaxy evolution. As the sample continues to grow, the survey will open up a new and unique parameter space for galaxy evolution studies.
We present the Early Data Release of the Sydney-AAO Multi-object Integral field spectrograph (SAMI) Galaxy Survey. The SAMI Galaxy Survey is an ongoing integral field spectroscopic survey of ~3400 low-redshift (z<0.12) galaxies, covering galaxies in
the field and in groups within the Galaxy And Mass Assembly (GAMA) survey regions, and a sample of galaxies in clusters. In the Early Data Release, we publicly release the fully calibrated datacubes for a representative selection of 107 galaxies drawn from the GAMA regions, along with information about these galaxies from the GAMA catalogues. All datacubes for the Early Data Release galaxies can be downloaded individually or as a set from the SAMI Galaxy Survey website. In this paper we also assess the quality of the pipeline used to reduce the SAMI data, giving metrics that quantify its performance at all stages in processing the raw data into calibrated datacubes. The pipeline gives excellent results throughout, with typical sky subtraction residuals in the continuum of 0.9-1.2 per cent, a relative flux calibration uncertainty of 4.1 per cent (systematic) plus 4.3 per cent (statistical), and atmospheric dispersion removed with an accuracy of 0.09, less than a fifth of a spaxel.
We present an analysis of the optical spectra of narrow emission-line galaxies, based on mean field independent component analysis (MFICA). Samples of galaxies were drawn from the Sloan Digital Sky Survey (SDSS) and used to generate compact sets of `
continuum and `emission-line component spectra. These components can be linearly combined to reconstruct the observed spectra of a wider sample of galaxies. Only 10 components - five continuum and five emission line - are required to produce accurate reconstructions of essentially all narrow emission-line galaxies; the median absolute deviations of the reconstructed emission-line fluxes, given the signal-to-noise ratio (S/N) of the observed spectra, are 1.2-1.8 sigma for the strong lines. After applying the MFICA components to a large sample of SDSS galaxies we identify the regions of parameter space that correspond to pure star formation and pure active galactic nucleus (AGN) emission-line spectra, and produce high S/N reconstructions of these spectra. The physical properties of the pure star formation and pure AGN spectra are investigated by means of a series of photoionization models, exploiting the faint emission lines that can be measured in the reconstructions. We are able to recreate the emission line strengths of the most extreme AGN case by assuming the central engine illuminates a large number of individual clouds with radial distance and density distributions, f(r) ~ r^gamma and g(n) ~ n^beta, respectively. The best fit is obtained with gamma = -0.75 and beta = -1.4. From the reconstructed star formation spectra we are able to estimate the starburst ages. These preliminary investigations serve to demonstrate the success of the MFICA-based technique in identifying distinct emission sources, and its potential as a tool for the detailed analysis of the physical properties of galaxies in large-scale surveys.
We explore the low energy dynamics of charge two instantons and dyonic instantons in SU(2) 5-dimensional Yang-Mills. We make use of the moduli space approximation and first calculate the moduli space metric for two instantons. For dyonic instantons t
he effective action of the moduli space approximation also includes a potential term which we calculate. Using the ADHM construction we are able to understand some aspects of the topology and structure of the moduli space. We find that instantons undergo right angled scattering after a head on collision and we are able to give an analytic description of this in terms of a quotient of the moduli space by symmetries of the ADHM data. We also explore the scattering of instantons and dyonic instantons numerically in a constrained region of the moduli space. Finally we exhibit some examples of closed geodesics on the moduli space, and geodesics which hit the moduli space singularities in finite time.
Most previous studies of the sorting algorithm QuickSort have used the number of key comparisons as a measure of the cost of executing the algorithm. Here we suppose that the n independent and identically distributed (i.i.d.) keys are each represente
d as a sequence of symbols from a probabilistic source and that QuickSort operates on individual symbols, and we measure the execution cost as the number of symbol comparisons. Assuming only a mild tameness condition on the source, we show that there is a limiting distribution for the number of symbol comparisons after normalization: first centering by the mean and then dividing by n. Additionally, under a condition that grows more restrictive as p increases, we have convergence of moments of orders p and smaller. In particular, we have convergence in distribution and convergence of moments of every order whenever the source is memoryless, that is, whenever each key is generated as an infinite string of i.i.d. symbols. This is somewhat surprising; even for the classical model that each key is an i.i.d. string of unbiased (fair) bits, the mean exhibits periodic fluctuations of order n.
When the search algorithm QuickSelect compares keys during its execution in order to find a key of target rank, it must operate on the keys representations or internal structures, which were ignored by the previous studies that quantified the executi
on cost for the algorithm in terms of the number of required key comparisons. In this paper, we analyze running costs for the algorithm that take into account not only the number of key comparisons but also the cost of each key comparison. We suppose that keys are represented as sequences of symbols generated by various probabilistic sources and that QuickSelect operates on individual symbols in order to find the target key. We identify limiting distributions for the costs and derive integral and series expressions for the expectations of the limiting distributions. These expressions are used to recapture previously obtained results on the number of key comparisons required by the algorithm.
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and so count the number of bit comparisons. On the other hand, the standa
rd analyses of many other algorithms (such as Quicksort) are performed in terms of the number of key comparisons. We introduce the prospect of a fair comparison between algorithms of the two types by providing an average-case analysis of the number of bit comparisons required by Quicksort. Counting bit comparisons rather than key comparisons introduces an extra logarithmic factor to the asymptotic average total. We also provide a new algorithm, BitsQuick, that reduces this factor to constant order by eliminating needless bit comparisons.
Using a recursive approach, we obtain a simple exact expression for the L^2-distance from the limit in Regniers (1989) classical limit theorem for the number of key comparisons required by QuickSort. A previous study by Fill and Janson (2002) using a
similar approach found that the d_2-distance is of order between n^{-1} log n and n^{-1/2}, and another by Neininger and Ruschendorf (2002) found that the Zolotarev zeta_3-distance is of exact order n^{-1} log n. Our expression reveals that the L^2-distance is asymptotically equivalent to (2 n^{-1} ln n)^{1/2}.
In a continuous-time setting, Fill (2010) proved, for a large class of probabilistic sources, that the number of symbol comparisons used by QuickSort, when centered by subtracting the mean and scaled by dividing by time, has a limiting distribution,
but proved little about that limiting random variable Y -- not even that it is nondegenerate. We establish the nondegeneracy of Y. The proof is perhaps surprisingly difficult.
