Large-scale structures from infrared surveys

To use the AKARI All-Sky Survey Point Source Catalogue as a validation sample for future missions such as Planck and to study large-scale structure, we first investigate the AKARI point source detection limit at 90 μm and the nature of bright spurious sources. Due to the degradation of the sensitivity of the AKARI All-Sky Survey and formidable difficulties in filtering out excessive noise, we return to the IRAS Faint Source Catalog to construct a redshift catalogue of over 60,000 galaxies selected at 60 μm, the Imperial IRAS-FSC Redshift Catalogue (IIFSCz). Around 50% of the sources in the IIFSCz have spectroscopic redshifts and a further 20% have photometric redshifts. The luminosity and selection functions are obtained for the IIFSCz flux-limited at 0.36 Jy at 60 μm. The dependence of galaxy clustering on spectral type and luminosity is studied using correlation statistics. A possible detection of the baryon acoustic oscillations in the power spectrum of the flux-limited sample of the IIFSCz is discussed. Finally, we present future research directions which include the FIR-radio correlation, ultraluminous and hyperluminous infrared galaxies, galaxy bias in the SWIRE Photometric Redshift Catalogue and convergence of the cosmological dipole

Conditions implying regularity of the three dimensional Navier-Stokes equation

We obtain logarithmic improvements for conditions for regularity of the Navier-Stokes equation, similar to those of Prodi-Serrin or Beale-Kato-Majda. Some of the proofs make use of a stochastic approach involving Feynman-Kac like inequalities. As part of the our methods, we give a different approach to a priori estimates of Foias, Guillope and Temam.Comment: Also available at http://www.math.missouri.edu/~stephen/preprints/ (Changes: this is a substantial rewrite of the previous version.

On the blow up criterion for the 2-D compressible Navier-Stokes equations

summary:Motivated by [10], we prove that the upper bound of the density function $\rho$ controls the finite time blow up of the classical solutions to the 2-D compressible isentropic Navier-Stokes equations. This result generalizes the corresponding result in [3] concerning the regularities to the weak solutions of the 2-D compressible Navier-Stokes equations in the periodic domain

Novel Forms of Rewriting Aristophanes’ Comedies: Comic Book Adaptations and Their Translations

Prikaz knjige: Asimakoulas, Dimitris. Rewriting Humour in Comic Books: Cultural Transfer and Translation of Aristophanic Adaptations. Palgrave Macmillan, 2019, pp. 189

Principal Component Analysis and Radiative Transfer modelling of Spitzer IRS Spectra of Ultra Luminous Infrared Galaxies

The mid-infrared spectra of ultraluminous infrared galaxies (ULIRGs) contain a variety of spectral features that can be used as diagnostics to characterise the spectra. However, such diagnostics are biased by our prior prejudices on the origin of the features. Moreover, by using only part of the spectrum they do not utilise the full information content of the spectra. Blind statistical techniques such as principal component analysis (PCA) consider the whole spectrum, find correlated features and separate them out into distinct components. We further investigate the principal components (PCs) of ULIRGs derived in Wang et al.(2011). We quantitatively show that five PCs is optimal for describing the IRS spectra. These five components (PC1-PC5) and the mean spectrum provide a template basis set that reproduces spectra of all z<0.35 ULIRGs within the noise. For comparison, the spectra are also modelled with a combination of radiative transfer models of both starbursts and the dusty torus surrounding active galactic nuclei. The five PCs typically provide better fits than the models. We argue that the radiative transfer models require a colder dust component and have difficulty in modelling strong PAH features. Aided by the models we also interpret the physical processes that the principal components represent. The third principal component is shown to indicate the nature of the dominant power source, while PC1 is related to the inclination of the AGN torus. Finally, we use the 5 PCs to define a new classification scheme using 5D Gaussian mixtures modelling and trained on widely used optical classifications. The five PCs, average spectra for the four classifications and the code to classify objects are made available at: http://www.phys.susx.ac.uk/~pdh21/PCA/Comment: 11 pages, 12 figures, accepted for publication in MNRA

BinGold: Towards robust binary analysis by extracting the semantics of binary code as semantic flow graphs (SFGs)

AbstractBinary analysis is useful in many practical applications, such as the detection of malware or vulnerable software components. However, our survey of the literature shows that most existing binary analysis tools and frameworks rely on assumptions about specific compilers and compilation settings. It is well known that techniques such as refactoring and light obfuscation can significantly alter the structure of code, even for simple programs. Applying such techniques or changing the compiler and compilation settings can significantly affect the accuracy of available binary analysis tools, which severely limits their practicability, especially when applied to malware. To address these issues, we propose a novel technique that extracts the semantics of binary code in terms of both data and control flow. Our technique allows more robust binary analysis because the extracted semantics of the binary code is generally immune from light obfuscation, refactoring, and varying the compilers or compilation settings. Specifically, we apply data-flow analysis to extract the semantic flow of the registers as well as the semantic components of the control flow graph, which are then synthesized into a novel representation called the semantic flow graph (SFG). Subsequently, various properties, such as reflexive, symmetric, antisymmetric, and transitive relations, are extracted from the SFG and applied to binary analysis. We implement our system in a tool called BinGold and evaluate it against thirty binary code applications. Our evaluation shows that BinGold successfully determines the similarity between binaries, yielding results that are highly robust against light obfuscation and refactoring. In addition, we demonstrate the application of BinGold to two important binary analysis tasks: binary code authorship attribution, and the detection of clone components across program executables. The promising results suggest that BinGold can be used to enhance existing techniques, making them more robust and practical