arXiv subjects

Simon Huber

Publications and source records attributed to Simon Huber.

15 recordsLinked to original sources

arXiv2024

Budget-optimal multi-robot layout design for box sorting

Robotic systems are routinely used in the logistics industry to enhance operational efficiency, but the design of robot workspaces remains a complex and manual task, which limits the system's flexibility to changing demands. This paper aims to automate robot workspace design by proposing a computational framework to generate a budget-minimizing layout by selectively placing stationary robots on a floor grid to sort packages from given input and output locations. Finding a good layout that minimizes the hardware budget while ensuring motion feasibility is a challenging combinatorial problem with nonconvex motion constraints. We propose a new optimization-based approach that models layout planning as a subgraph optimization problem subject to network flow constraints. Our core insight is to abstract away motion constraints from the layout optimization by precomputing a kinematic reachability graph and then extract the optimal layout on this ground graph. We validate the motion feasibility of our approach by proposing a simple task assignment and motion planning technique. We benchmark our algorithm on problems with various grid resolutions and number of outputs and show improvements in memory efficiency over a heuristic search algorithm.

cs.RO↗

arXiv2024

Detecting unresolved lensed SNe Ia in LSST using blended light curves

Strongly gravitationally lensed supernovae (LSNe) are promising probes for providing absolute distance measurements using gravitational-lens time delays. Spatially unresolved LSNe offer an opportunity to enhance the sample size for precision cosmology. We predict that there will be approximately three times as many unresolved as resolved LSNe Ia in the Legacy Survey of Space and Time (LSST) by the {\it Rubin} Observatory. In this article, we explore the feasibility of detecting unresolved LSNe Ia from a pool of preclassified SNe Ia light curves using the shape of the blended light curves with deep-learning techniques. We find that $\sim 30\%$ unresolved LSNe Ia can be detected with a simple 1D convolutional neural network (CNN) using well-sampled $rizy$-band light curves (with a false-positive rate of $\sim 3\%$). Even when the light curve is well observed in only a single band among $r$, $i$, and $z$, detection is still possible with false-positive rates ranging from $\sim 4$ to $7\%$ depending on the band. Furthermore, we demonstrate that these unresolved cases can be detected at an early stage using light curves up to $\sim20$ days from the first observation with well-controlled false-positive rates, providing ample opportunity to trigger follow-up observations. Additionally, we demonstrate the feasibility of time-delay estimations using solely LSST-like data of unresolved light curves, particularly for doubles, when excluding systems with low time delays and magnification ratios. However, the abundance of such systems among those unresolved in LSST poses a significant challenge. This approach holds potential utility for upcoming wide-field surveys, and overall results could significantly improve with enhanced cadence and depth in the future surveys.

astro-ph.IM↗

arXiv2024

JWST Spectroscopy of SN H0pe: Classification and Time Delays of a Triply-imaged Type Ia Supernova at z = 1.78

SN H0pe is a triply imaged supernova (SN) at redshift $z=1.78$ discovered using the James Webb Space Telescope (JWST). In order to classify the SN spectroscopically and measure the relative time delays of its three images (designated A, B, and C), we acquired NIRSpec follow-up spectroscopy spanning 0.6 to 5 microns. From the high signal-to-noise spectra of the two bright images B and C, we first classify the SN, whose spectra most closely match those of SN 1994D and SN 2013dy, as a Type Ia SN. We identify prominent blueshifted absorption features corresponding to Si II $\lambda6355$ and Ca II H $\lambda3970$ and K $\lambda3935$. We next measure the absolute phases of the three images from our spectra, which allows us to constrain their relative time delays. The absolute phases of the three images, determined by fitting the three spectra to Hsiao07 SN templates, are $6.5_{-1.8}^{+2.4}$d, $24.3_{-3.9}^{+3.9}$d, and $50.6_{-15.3}^{+16.1}$d for the brightest to faintest images. These correspond to relative time delays between Image A and Image B and between Image B and Image C of $-122.3_{-43.8}^{+43.7}$d and $49.3_{-14.7}^{+12.2}$d, respectively. The SALT3-NIR model yields phases and time delays consistent with these values. After unblinding, we additionally explored the effect of using Hsiao07 template spectra for simulations through eighty instead of sixty days past maximum, and found a small (11.5 and 1.0 days, respectively) yet statistically insignificant ($\sim$0.25$\sigma$ and $\sim$0.1$\sigma$) effect on the inferred image delays.

astro-ph.GA↗

arXiv2023

Detecting strongly-lensed type Ia supernovae with LSST

Strongly-lensed supernovae are rare and valuable probes of cosmology and astrophysics. Upcoming wide-field time-domain surveys, such as the Vera C. Rubin Observatory's Legacy Survey of Space and Time (LSST), are expected to discover an order-of-magnitude more lensed supernovae than have previously been observed. In this work, we investigate the cosmological prospects of lensed type Ia supernovae (SNIa) in LSST by quantifying the expected annual number of detections, the impact of stellar microlensing, follow-up feasibility, and how to best separate lensed and unlensed SNIa. We simulate SNIa lensed by galaxies, using the current LSST baseline v3.0 cadence, and find an expected number of 44 lensed SNIa detections per year. Microlensing effects by stars in the lens galaxy are predicted to lower the lensed SNIa detections by $\sim 8 \%$. The lensed events can be separated from the unlensed ones by jointly considering their colours and peak magnitudes. We define a `gold sample' of $\sim 10$ lensed SNIa per year with time delay $> 10$ days, $> 5$ detections before light-curve peak, and sufficiently bright ($m_i < 22.5$ mag) for follow-up observations. In three years of LSST operations, such a sample is expected to yield a $1.5\%$ measurement of the Hubble constant.

astro-ph.CO↗

arXiv2023

On the Applicability of Network Coordinate Systems for Fog Computing

Identifying the closest fog node is crucial for mobile clients to benefit from fog computing. Relying on geographical location alone us insufficient for this as it ignores real observed client access latency. In this paper, we analyze the performance of the Meridian and Vivaldi network coordinate systems in identifying nearest fog nodes. To that end, we simulate a dense fog environment with mobile clients. We find that while network coordinate systems really find fog nodes in close network proximity, a purely latency-oriented identification approach ignores the larger problem of balancing load across fog nodes.

cs.DC↗

arXiv2022

Measuring DNS over TCP in the Era of Increasing DNS Response Sizes: A View from the Edge

The Domain Name System (DNS) is one of the most crucial parts of the Internet. Although the original standard defined the usage of DNS over UDP (DoUDP) as well as DNS over TCP (DoTCP), UDP has become the predominant protocol used in the DNS. With the introduction of new Resource Records (RRs), the sizes of DNS responses have increased considerably. Since this can lead to truncation or IP fragmentation, the fallback to DoTCP as required by the standard ensures successful DNS responses by overcoming the size limitations of DoUDP. However, the effects of the usage of DoTCP by stub resolvers are not extensively studied to this date. We close this gap by presenting a view at DoTCP from the Edge, issuing 12.1M DNS requests from 2,500 probes toward Public as well as Probe DNS recursive resolvers. In our measurement study, we observe that DoTCP is generally slower than DoUDP, where the relative increase in Response Time is less than 37% for most resolvers. While optimizations to DoTCP can be leveraged to further reduce the response times, we show that support on Public resolvers is still missing, hence leaving room for optimizations in the future. Moreover, we also find that Public resolvers generally have comparable reliability for DoTCP and DoUDP. However, Probe resolvers show a significantly different behavior: DoTCP queries targeting Probe resolvers fail in 3 out of 4 cases, and, therefore, do not comply with the standard. This problem will only aggravate in the future: As DNS response sizes will continue to grow, the need for DoTCP will solidify.

cs.NI↗

arXiv2022

Differentiable Collision Avoidance Using Collision Primitives

A central aspect of robotic motion planning is collision avoidance, where a multitude of different approaches are currently in use. Optimization-based motion planning is one method, that often heavily relies on distance computations between robots and obstacles. These computations can easily become a bottleneck, as they do not scale well with the complexity of the robots or the environment. To improve performance, many different methods suggested to use collision primitives, i.e. simple shapes that approximate the more complex rigid bodies, and that are simpler to compute distances to and from. However, each pair of primitives requires its own specialized code, and certain pairs are known to suffer from numerical issues. In this paper, we propose an easy-to-use, unified treatment of a wide variety of primitives. We formulate distance computation as a minimization problem, which we solve iteratively. We show how to take derivatives of this minimization problem, allowing it to be seamlessly integrated into a trajectory optimization method. Our experiments show that our method performs favourably, both in terms of timing and the quality of the trajectory. The source code of our implementation will be released upon acceptance.

cs.RO↗

arXiv2021

The Impact of Observing Strategy on Cosmological Constraints with LSST

The generation-defining Vera C. Rubin Observatory will make state-of-the-art measurements of both the static and transient universe through its Legacy Survey for Space and Time (LSST). With such capabilities, it is immensely challenging to optimize the LSST observing strategy across the survey's wide range of science drivers. Many aspects of the LSST observing strategy relevant to the LSST Dark Energy Science Collaboration, such as survey footprint definition, single visit exposure time and the cadence of repeat visits in different filters, are yet to be finalized. Here, we present metrics used to assess the impact of observing strategy on the cosmological probes considered most sensitive to survey design; these are large-scale structure, weak lensing, type Ia supernovae, kilonovae and strong lens systems (as well as photometric redshifts, which enable many of these probes). We evaluate these metrics for over 100 different simulated potential survey designs. Our results show that multiple observing strategy decisions can profoundly impact cosmological constraints with LSST; these include adjusting the survey footprint, ensuring repeat nightly visits are taken in different filters and enforcing regular cadence. We provide public code for our metrics, which makes them readily available for evaluating further modifications to the survey design. We conclude with a set of recommendations and highlight observing strategy factors that require further research.

astro-ph.CO↗

arXiv2019

Canonicity and homotopy canonicity for cubical type theory

Cubical type theory provides a constructive justification of homotopy type theory. A crucial ingredient of cubical type theory is a path lifting operation which is explained computationally by induction on the type involving several non-canonical choices. We present in this article two canonicity results, both proved by a sconing argument: a homotopy canonicity result, every natural number is path equal to a numeral, even if we take away the equations defining the lifting operation on the type structure, and a canonicity result, which uses these equations in a crucial way. Both proofs are done internally in a presheaf model.

math.LO↗

arXiv2019

A Modular Benchmarking Infrastructure for High-Performance and Reproducible Deep Learning

We introduce Deep500: the first customizable benchmarking infrastructure that enables fair comparison of the plethora of deep learning frameworks, algorithms, libraries, and techniques. The key idea behind Deep500 is its modular design, where deep learning is factorized into four distinct levels: operators, network processing, training, and distributed training. Our evaluation illustrates that Deep500 is customizable (enables combining and benchmarking different deep learning codes) and fair (uses carefully selected metrics). Moreover, Deep500 is fast (incurs negligible overheads), verifiable (offers infrastructure to analyze correctness), and reproducible. Finally, as the first distributed and reproducible benchmarking system for deep learning, Deep500 provides software infrastructure to utilize the most powerful supercomputers for extreme-scale workloads.

cs.DC↗

arXiv2018

Optimizing the LSST Observing Strategy for Dark Energy Science: DESC Recommendations for the Wide-Fast-Deep Survey

Cosmology is one of the four science pillars of LSST, which promises to be transformative for our understanding of dark energy and dark matter. The LSST Dark Energy Science Collaboration (DESC) has been tasked with deriving constraints on cosmological parameters from LSST data. Each of the cosmological probes for LSST is heavily impacted by the choice of observing strategy. This white paper is written by the LSST DESC Observing Strategy Task Force (OSTF), which represents the entire collaboration, and aims to make recommendations on observing strategy that will benefit all cosmological analyses with LSST. It is accompanied by the DESC DDF (Deep Drilling Fields) white paper (Scolnic et al.). We use a variety of metrics to understand the effects of the observing strategy on measurements of weak lensing, large-scale structure, clusters, photometric redshifts, supernovae, strong lensing and kilonovae. In order to reduce systematic uncertainties, we conclude that the current baseline observing strategy needs to be significantly modified to result in the best possible cosmological constraints. We provide some key recommendations: moving the WFD (Wide-Fast-Deep) footprint to avoid regions of high extinction, taking visit pairs in different filters, changing the 2x15s snaps to a single exposure to improve efficiency, focusing on strategies that reduce long gaps (>15 days) between observations, and prioritizing spatial uniformity at several intervals during the 10-year survey.

astro-ph.IM↗

arXiv2018

On Higher Inductive Types in Cubical Type Theory

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly provable in the theory. This paper describes a constructive semantics, expressed in a presheaf topos with suitable structure inspired by cubical sets, of some higher inductive types. It also extends cubical type theory by a syntax for the higher inductive types of spheres, torus, suspensions,truncations, and pushouts. All of these types are justified by the semantics and have judgmental computation rules for all constructors, including the higher dimensional ones, and the universes are closed under these type formers.

cs.LO↗

arXiv2017

The univalence axiom in cubical sets

In this note we show that Voevodsky's univalence axiom holds in the model of type theory based on symmetric cubical sets. We will also discuss Swan's construction of the identity type in this variation of cubical sets. This proves that we have a model of type theory supporting dependent products, dependent sums, univalent universes, and identity types with the usual judgmental equality, and this model is formulated in a constructive metatheory.

math.LO↗

arXiv2016

Cubical Type Theory: a constructive interpretation of the univalence axiom

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways to reason about identity types, for instance, function extensionality is directly provable in the system. Further, Voevodsky's univalence axiom is provable in this system. We also explain an extension with some higher inductive types like the circle and propositional truncation. Finally we provide semantics for this cubical type theory in a constructive meta-theory.

cs.LO↗

arXiv2016

Canonicity for Cubical Type Theory

Cubical type theory is an extension of Martin-L\"of type theory recently proposed by Cohen, Coquand, M\"ortberg and the author which allows for direct manipulation of $n$-dimensional cubes and where Voevodsky's Univalence Axiom is provable. In this paper we prove canonicity for cubical type theory: any natural number in a context build from only name variables is judgmentally equal to a numeral. To achieve this we formulate a typed and deterministic operational semantics and employ a computability argument adapted to a presheaf-like setting.

cs.LO↗