Identification of Young Stellar Object candidates in the GaiaGaia DR2 x AllWISE catalogue with machine learning methods

The second $Gaia$ Data Release (DR2) contains astrometric and photometric data for more than 1.6 billion objects with mean $Gaia$ $G$ magnitude $<$20.7, including many Young Stellar Objects (YSOs) in different evolutionary stages. In order to explore the YSO population of the Milky Way, we combined the $Gaia$ DR2 database with WISE and Planck measurements and made an all-sky probabilistic catalogue of YSOs using machine learning techniques, such as Support Vector Machines, Random Forests, or Neural Networks. Our input catalogue contains 103 million objects from the DR2xAllWISE cross-match table. We classified each object into four main classes: YSOs, extragalactic objects, main-sequence stars and evolved stars. At a 90% probability threshold we identified 1,129,295 YSO candidates. To demonstrate the quality and potential of our YSO catalogue, here we present two applications of it. (1) We explore the 3D structure of the Orion A star forming complex and show that the spatial distribution of the YSOs classified by our procedure is in agreement with recent results from the literature. (2) We use our catalogue to classify published $Gaia$ Science Alerts. As $Gaia$ measures the sources at multiple epochs, it can efficiently discover transient events, including sudden brightness changes of YSOs caused by dynamic processes of their circumstellar disk. However, in many cases the physical nature of the published alert sources are not known. A cross-check with our new catalogue shows that about 30% more of the published $Gaia$ alerts can most likely be attributed to YSO activity. The catalogue can be also useful to identify YSOs among future $Gaia$ alerts.Comment: 19 pages, 12 figures, 3 table

Human dirofilaria repens infection in Hungary: A case in the spermatic cord and a review of the literature

Orchiectomy was performed in a 37-year-old Hungarian man exhibiting a swelling in his right testicle. Histology revealed a nodule attached to the spermatic cord, consisting of a granulomatous tissue around sections of a nematode. The worm was identified asDirofilaria repens, an uncommon parasite in Hungary. As the patient had been abroad only in Italy where cases of dirofilariosis in dogs and humans are relatively frequent, it is assumed that the infection might have been acquired in that country 5 years earlier. This is the fifth case, published so far in the world, of such a localization in a human. The human cases of dirofilariosis reported in Hungary are reviewed

Notions of Infinity in Quantum Physics

In this article we will review some notions of infiniteness that appear in Hilbert space operators and operator algebras. These include proper infiniteness, Murray von Neumann's classification into type I and type III factors and the class of F{/o} lner C*-algebras that capture some aspects of amenability. We will also mention how these notions reappear in the description of certain mathematical aspects of quantum mechanics, quantum field theory and the theory of superselection sectors. We also show that the algebra of the canonical anti-commutation relations (CAR-algebra) is in the class of F{/o} lner C*-algebras.Comment: 11 page

Filaments of The Slime Mold Cosmic Web And How They Affect Galaxy Evolution

We present a novel method for identifying cosmic web filaments using the IllustrisTNG (TNG100) cosmological simulations and investigate the impact of filaments on galaxies. We compare the use of cosmic density field estimates from the Delaunay Tessellation Field Estimator (DTFE) and the Monte Carlo Physarum Machine (MCPM), which is inspired by the slime mold organism, in the DisPerSE structure identification framework. The MCPM-based reconstruction identifies filaments with higher fidelity, finding more low-prominence/diffuse filaments and better tracing the true underlying matter distribution than the DTFE-based reconstruction. Using our new filament catalogs, we find that most galaxies are located within 1.5-2.5 Mpc of a filamentary spine, with little change in the median specific star formation rate and the median galactic gas fraction with distance to the nearest filament. Instead, we introduce the filament line density, {\Sigma}fil(MCPM), as the total MCPM overdensity per unit length of a local filament segment, and find that this parameter is a superior predictor of galactic gas supply and quenching. Our results indicate that most galaxies are quenched and gas-poor near high-line density filaments at z10.5 galaxies is mainly driven by mass, while lower-mass galaxies are significantly affected by the filament line density. In high-line density filaments, satellites are strongly quenched, whereas centrals have reduced star formation, but not gas fraction, at z<=0.5. We discuss the prospect of applying our new filament identification method to galaxy surveys with SDSS, DESI, Subaru PFS, etc. to elucidate the effect of large-scale structure on galaxy formation.Comment: Submitted to ApJ, comments welcome. Data available at https://github.com/farhantasy/CosmicWeb-Galaxies

On Quasi-biennial oscillations in chromospheric macrospicules and their potential relation to global solar magnetic field

This study aims to provide further evidence for the potential influence of the global solar magnetic field on localised chromospheric jets, the macrospicules (MS). To find a connection between the long-term variation of properties of MS and other solar activity proxies, including e.g. the temporal variation of the frequency shift of solar global oscillations, sunspot area, etc., a database overarching seven years of observations was built up. This database contains 362 MS, based on observations at the 30.4 nm of the Atmospheric Imaging Assembly (AIA) on-board the Solar Dynamics Observatory (SDO). Three of the five investigated physical properties of MS show a clear long-term temporal variation after smoothing the raw data. Wavelet analysis of the temporal variation of maximum length, maximum area and average velocity is carried out. The results reveal a strong pattern of periodicities at around 2-year (also referred to as Quasi-Biennial Oscillations -- QBOs). Comparison to solar activity proxies, that also possess the properties of QBOs, provides some interesting features: the minima and maxima of QBOs of MS properties occur at around the same epoch as the minima and maxima of these activity proxies. For most of the time span investigated, the oscillations are out-of-phase. This out-of-phase behaviour was also corroborated by a cross-correlation analysis. These results suggest that the physical processes, that generate and drive the long-term evolution of the global solar activity proxies, may be coupled to the short-term local physical processes driving the macrospicules, and, therefore modulate the properties of local dynamics

An Efficient Partitioning Oracle for Bounded-Treewidth Graphs

Partitioning oracles were introduced by Hassidim et al. (FOCS 2009) as a generic tool for constant-time algorithms. For any epsilon > 0, a partitioning oracle provides query access to a fixed partition of the input bounded-degree minor-free graph, in which every component has size poly(1/epsilon), and the number of edges removed is at most epsilon*n, where n is the number of vertices in the graph. However, the oracle of Hassidimet al. makes an exponential number of queries to the input graph to answer every query about the partition. In this paper, we construct an efficient partitioning oracle for graphs with constant treewidth. The oracle makes only O(poly(1/epsilon)) queries to the input graph to answer each query about the partition. Examples of bounded-treewidth graph classes include k-outerplanar graphs for fixed k, series-parallel graphs, cactus graphs, and pseudoforests. Our oracle yields poly(1/epsilon)-time property testing algorithms for membership in these classes of graphs. Another application of the oracle is a poly(1/epsilon)-time algorithm that approximates the maximum matching size, the minimum vertex cover size, and the minimum dominating set size up to an additive epsilon*n in graphs with bounded treewidth. Finally, the oracle can be used to test in poly(1/epsilon) time whether the input bounded-treewidth graph is k-colorable or perfect.Comment: Full version of a paper to appear in RANDOM 201