Designing optimal masks for a multi-object spectrometer [IMA]

http://arxiv.org/abs/2101.03378


This paper concerns a new optimization problem arising in the management of a multi-object spectrometer with a configurable slit unit. The field of view of the spectrograph is divided into contiguous and parallel spatial bands, each one associated with two opposite sliding metal bars that can be positioned to observe one astronomical object. Thus several objects can be analyzed simultaneously within a configuration of the bars called a mask. Due to the high demand from astronomers, pointing the spectrograph’s field of view to the sky, rotating it, and selecting the objects to conform a mask is a crucial optimization problem for the efficient use of the spectrometer. The paper describes this problem, presents a Mixed Integer Linear Programming formulation for the case where the rotation angle is fixed, presents a non-convex formulation for the case where the rotation angle is unfixed, describes a heuristic approach for the general problem, and discusses computational results on real-world and randomly-generated instances.

Read this paper on arXiv…

J. Salazar-González
Tue, 12 Jan 21
16/90

Comments: The dataset is available at this http URL

Characterising the Structure of Halo Merger Trees Using a Single Parameter: The Tree Entropy [GA]

http://arxiv.org/abs/1911.11959


Linking the properties of galaxies to the assembly history of their dark matter haloes is a central aim of galaxy evolution theory. This paper introduces a dimensionless parameter $s\in[0,1]$, the “tree entropy”, to parametrise the geometry of a halo’s entire mass assembly hierarchy, building on a generalisation of Shannon’s information entropy. By construction, the minimum entropy ($s=0$) corresponds to smoothly assembled haloes without any mergers. In contrast, the highest entropy ($s=1$) represents haloes grown purely by equal-mass binary mergers. Using simulated merger trees extracted from the cosmological $N$-body simulation SURFS, we compute the natural distribution of $s$, a skewed bell curve peaking near $s=0.3$ for first generation haloes. This distribution exhibits weak dependences on halo mass $M$ and redshift $z$, which can be reduced to a single dependence of $\langle s\rangle$ on the relative peak height $\delta_{\rm c}/\sigma(M,z)$ in the matter perturbation field. By exploring the correlations between $s$ and global galaxy properties generated by the SHARK semi-analytic model, we find that $s$ contains a significant amount of information on the morphology of galaxies $-$ in fact more information than the spin, concentration and assembly time of the halo. Therefore, the tree entropy provides an information-rich link between galaxies and their dark matter haloes.

Read this paper on arXiv…

D. Obreschkow, P. Elahi, C. Lagos, et. al.
Thu, 28 Nov 19
10/70

Comments: 20 pages, 16 figures

Characterising the Structure of Halo Merger Trees Using a Single Parameter: The Tree Entropy [GA]

http://arxiv.org/abs/1911.11959


Linking the properties of galaxies to the assembly history of their dark matter haloes is a central aim of galaxy evolution theory. This paper introduces a dimensionless parameter $s\in[0,1]$, the “tree entropy”, to parametrise the geometry of a halo’s entire mass assembly hierarchy, building on a generalisation of Shannon’s information entropy. By construction, the minimum entropy ($s=0$) corresponds to smoothly assembled haloes without any mergers. In contrast, the highest entropy ($s=1$) represents haloes grown purely by equal-mass binary mergers. Using simulated merger trees extracted from the cosmological $N$-body simulation SURFS, we compute the natural distribution of $s$, a skewed bell curve peaking near $s=0.3$ for first generation haloes. This distribution exhibits weak dependences on halo mass $M$ and redshift $z$, which can be reduced to a single dependence of $\langle s\rangle$ on the relative peak height $\delta_{\rm c}/\sigma(M,z)$ in the matter perturbation field. By exploring the correlations between $s$ and global galaxy properties generated by the SHARK semi-analytic model, we find that $s$ contains a significant amount of information on the morphology of galaxies $-$ in fact more information than the spin, concentration and assembly time of the halo. Therefore, the tree entropy provides an information-rich link between galaxies and their dark matter haloes.

Read this paper on arXiv…

D. Obreschkow, P. Elahi, C. Lagos, et. al.
Thu, 28 Nov 19
35/70

Comments: 20 pages, 16 figures

GTOC X: Solution Approach of Team Sapienza-PoliTo [CL]

http://arxiv.org/abs/1909.11984


This paper summarizes the solution approach and the numerical methods developed by the joint team Sapienza University of Rome and Politecnico di Torino (Team Sapienza-PoliTo) in the context of the 10th Global Trajectory Optimization Competition. The proposed method is based on a preliminary partition of the galaxy into several small zones of interest, where partial settlement trees are developed, in order to match a (theoretical) optimal star distribution. A multi-settler stochastic Beam Best-First Search, that exploits a guided multi-star multi-vessel transition logic, is proposed for solving a coverage problem, where the number of stars to capture and their distribution within a zone is assigned. The star-to-star transfers were then optimized through an indirect procedure. A number of refinements, involving settle time re-optimization, explosion, and pruning, were also investigated. The submitted 1013-star solution, as well as an enhanced 1200-point rework, are presented.

Read this paper on arXiv…

A. Zavoli, L. Federici, B. Benedikter, et. al.
Fri, 27 Sep 19
22/64

Comments: 2019 AAS/AIAA Astrodynamics Specialist Conference, Portland, ME

Complementary Lattice Arrays for Coded Aperture Imaging [CL]

http://arxiv.org/abs/1506.02160


In this work, we consider complementary lattice arrays in order to enable a broader range of designs for coded aperture imaging systems. We provide a general framework and methods that generate richer and more flexible designs than existing ones. Besides this, we review and interpret the state-of-the-art uniformly redundant arrays (URA) designs, broaden the related concepts, and further propose some new design methods.

Read this paper on arXiv…

J. Ding, M. Noshad and V. Tarokh
Tue, 9 Jun 15
41/56

Comments: N/A