Search

Let $I$ be a monomial ideal in two variables generated by three monomials and let $\mathcal{R}(I)$ be its Rees ideal. We describe an algorithm to compute the minimal generating set of $\mathcal{R}(I)$. Based on the data obtained by this algorithm, we build a graph that encodes the minimal free resolution of $\mathcal{R}(I)$. We explicitly describe the modules and differentials on the minimal free resolution of $\mathcal{R}(I)$.

Quadratic systems with lossless quadratic terms arise in many applications, including models of atmosphere and incompressible fluid flows. Such systems have a trapping region if all trajectories eventually converge to and stay within a bounded set. Conditions for the existence and characterization of trapping regions have been established in prior works for boundedness analysis. However, prior solutions have used non-convex optimization methods, resulting in conservative estimates. In this paper, we build on this prior work and provide a convex semidefinite programming condition for the existence of a trapping region. The condition allows precise verification or falsification of the existence of a trapping region. If a trapping region exists, then we provide a second semidefinite program to compute the least conservative trapping region in the form of a ball. Two low-dimensional systems are provided as examples to illustrate the results. A third high-dimensional example is also included to demonstrate that the computation required for the analysis can be scaled to systems of up to $\sim O(100)$ states. The proposed method provides a precise and computationally efficient numerical approach for computing trapping regions. We anticipate this work will benefit future studies on modeling and control of lossless quadratic dynamical systems.

In many recent works, the potential of Exploratory Landscape Analysis (ELA) features to numerically characterize, in particular, single-objective continuous optimization problems has been demonstrated. These numerical features provide the input for all kinds of machine learning tasks on continuous optimization problems, ranging, i.a., from High-level Property Prediction to Automated Algorithm Selection and Automated Algorithm Configuration. Without ELA features, analyzing and understanding the characteristics of single-objective continuous optimization problems is -- to the best of our knowledge -- very limited. Yet, despite their usefulness, as demonstrated in several past works, ELA features suffer from several drawbacks. These include, in particular, (1.) a strong correlation between multiple features, as well as (2.) its very limited applicability to multi-objective continuous optimization problems. As a remedy, recent works proposed deep learning-based approaches as alternatives to ELA. In these works, e.g., point-cloud transformers were used to characterize an optimization problem's fitness landscape. However, these approaches require a large amount of labeled training data. Within this work, we propose a hybrid approach, Deep-ELA, which combines (the benefits of) deep learning and ELA features. Specifically, we pre-trained four transformers on millions of randomly generated optimization problems to learn deep representations of the landscapes of continuous single- and multi-objective optimization problems. Our proposed framework can either be used out-of-the-box for analyzing single- and multi-objective continuous optimization problems, or subsequently fine-tuned to various tasks focussing on algorithm behavior and problem understanding.

Complex-valued Gaussian processes are commonly used in Bayesian frequency-domain system identification as prior models for regression. If each realization of such a process were an $H_\infty$ function with probability one, then the same model could be used for probabilistic robust control, allowing for robustly safe learning. We investigate sufficient conditions for a general complex-domain Gaussian process to have this property. For the special case of processes whose Hermitian covariance is stationary, we provide an explicit parameterization of the covariance structure in terms of a summable sequence of nonnegative numbers. We then establish how an $H_\infty$ Gaussian process can serve as a prior for Bayesian system identification and as a probabilistic uncertainty model for probabilistic robust control. In particular, we compute formulas for refining the uncertainty model by conditioning on frequency-domain data and for upper-bounding the probability that the realizations of the process satisfy a given integral quadratic constraint., Comment: 20 pages, 2 figures. Submission to SICON. arXiv admin note: substantial text overlap with arXiv:2211.15923

Exploiting the infrared area of the spectrum for classification problems is getting increasingly popular, because many materials have characteristic absorption bands in this area. However, sensors in the short wave infrared (SWIR) area and even higher wavelengths have a very low spatial resolution in comparison to classical cameras that operate in the visible wavelength area. Thus, in this paper an upsampling method for SWIR images guided by a visible image is presented. For that, the proposed guided upsampling network (GUNet) uses a graph-regularized optimization problem based on learned affinities is presented. The evaluation is based on a novel synthetic near-field visible-SWIR stereo database. Different guided upsampling methods are evaluated, which shows an improvement of nearly 1 dB on this database for the proposed upsampling method in comparison to the second best guided upsampling network. Furthermore, a visual example of an upsampled SWIR image of a real-world scene is depicted for showing real-world applicability.

Since camera modules become more and more affordable, multispectral camera arrays have found their way from special applications to the mass market, e.g., in automotive systems, smartphones, or drones. Due to multiple modalities, the registration of different viewpoints and the required cross-spectral disparity estimation is up to the present extremely challenging. To overcome this problem, we introduce a novel spectral image synthesis in combination with a color agnostic transform. Thus, any recently published stereo matching network can be turned to a cross-spectral disparity estimator. Our novel algorithm requires only RGB stereo data to train a cross-spectral disparity estimator and a generalization from artificial training data to camera-captured images is obtained. The theoretical examination of the novel color agnostic method is completed by an extensive evaluation compared to state of the art including self-recorded multispectral data and a reference implementation. The novel color agnostic disparity estimation improves cross-spectral as well as conventional color stereo matching by reducing the average end-point error by 41% for cross-spectral and by 22% for mono-modal content, respectively.

In this paper, we consider the learning of a Reduced-Order Linear Parameter-Varying Model (ROLPVM) of a nonlinear dynamical system based on data. This is achieved by a two-step procedure. In the first step, we learn a projection to a lower dimensional state-space. In step two, an LPV model is learned on the reduced-order state-space using a novel, efficient parameterization in terms of neural networks. The improved modeling accuracy of the method compared to an existing method is demonstrated by simulation examples., Comment: Accepted to the 20th IFAC Symposium on System Identification (SYSID 2024)

Controlling the bandstructure of Dirac materials is of wide interest in current research but has remained an outstanding challenge for systems such as monolayer graphene. In contrast, Bernal bilayer graphene (BLG) offers a highly flexible platform for tuning the bandstructure, featuring two distinct regimes. In one regime, which is well established and widely used, a tunable bandgap is induced by a large enough transverse displacement field. Another is a gapless metallic band occurring near charge neutrality and at not too strong fields, featuring rich 'fine structure' consisting of four linearly-dispersing Dirac cones with opposite chiralities in each valley and van Hove singularities. Even though BLG was extensively studied experimentally in the last two decades, the evidence of this exotic bandstructure is still elusive, likely due to insufficient energy resolution. Here, rather than probing the bandstructure by direct spectroscopy, we use Landau levels as markers of the energy dispersion and carefully analyze the Landau level spectrum in a regime where the cyclotron orbits of electrons or holes in momentum space are small enough to resolve the distinct mini Dirac cones. We identify the presence of four distinct Dirac cones and map out complex topological transitions induced by electric displacement field. These findings introduce a valuable addition to the toolkit for graphene electronics.

This paper introduces a novel method for RGB-Guided Resolution Enhancement of infrared (IR) images called Guided IR Resolution Enhancement (GIRRE). In the area of single image super resolution (SISR) there exists a wide variety of algorithms like interpolation methods or neural networks to improve the spatial resolution of images. In contrast to SISR, even more information can be gathered on the recorded scene when using multiple cameras. In our setup, we are dealing with multi image super resolution, especially with stereo super resolution. We consider a color camera and an IR camera. Current IR sensors have a very low resolution compared to color sensors so that recent color sensors take up 100 times more pixels than IR sensors. To this end, GIRRE increases the spatial resolution of the low-resolution IR image. After that, the upscaled image is filtered with the aid of the high-resolution color image. We show that our method achieves an average PSNR gain of 1.2 dB and at best up to 1.8 dB compared to state-of-the-art methods, which is visually noticeable.

Modern control theory provides us with a spectrum of methods for studying the interconnection of dynamic systems using input-output properties of the interconnected subsystems. Perhaps the most advanced framework for such input-output analysis is the use of Integral Quadratic Constraints (IQCs), which considers the interconnection of a nominal linear system with an unmodelled nonlinear or uncertain subsystem with known input-output properties. Although these methods are widely used for Ordinary Differential Equations (ODEs), there have been fewer attempts to extend IQCs to infinite-dimensional systems. In this paper, we present an IQC-based framework for Partial Differential Equations (PDEs) and Delay Differential Equations (DDEs). First, we introduce infinite-dimensional signal spaces, operators, and feedback interconnections. Next, in the main result, we propose a formulation of hard IQC-based input-output stability conditions, allowing for infinite-dimensional multipliers. We then show how to test hard IQC conditions with infinite-dimensional multipliers on a nominal linear PDE or DDE system via the Partial Integral Equation (PIE) state-space representation using a sufficient version of the Kalman-Yakubovich-Popov lemma (KYP). The results are then illustrated using four example problems with uncertainty and nonlinearity.

In this paper we study invasion probabilities and invasion times of cooperative parasites spreading in spatially structured host populations. The spatial structure of the host population is given by a random geometric graph on $[0,1]^n$, $n\in \mathbb{N}$, with a Poisson($N$)-distributed number of vertices and in which vertices are connected over an edge when they have a distance of at most $r_N\in \Theta\left(N^{\frac{\beta-1}{n}}\right)$ for some $0<\beta<1$ and $N\rightarrow \infty$. At a host infection many parasites are generated and parasites move along edges to neighbouring hosts. We assume that parasites have to cooperate to infect hosts, in the sense that at least two parasites need to attack a host simultaneously. We find lower and upper bounds on the invasion probability of the parasites in terms of survival probabilities of branching processes with cooperation. Furthermore, we characterize the asymptotic invasion time. An important ingredient of the proofs is a comparison with infection dynamics of cooperative parasites in host populations structured according to a complete graph, i.e. in well-mixed host populations. For these infection processes we can show that invasion probabilities are asymptotically equal to survival probabilities of branching processes with cooperation. Furthermore, we build in the proofs on techniques developed in [BP22], where an analogous invasion process has been studied for host populations structured according to a configuration model. We substantiate our results with simulations.

Bernal bilayer graphene has recently been discovered to exhibit a wide range of unique ordered phases resulting from interaction-driven effects and encompassing spin and valley magnetism, correlated insulators, correlated metals, and superconductivity. This letter reports on a novel family of correlated phases characterized by spin and valley ordering, observed in electron-doped bilayer graphene. The novel correlated phases demonstrate an intriguing non-linear current-bias behavior at ultralow currents that is sensitive to the onset of the phases and is accompanied by an insulating temperature dependence, providing strong evidence for the presence of unconventional charge carrying degrees of freedom originating from ordering. These characteristics cannot be solely attributed to any of the previously reported phases, and are qualitatively different from the behavior seen previously on the hole-doped side. Instead, our observations align with the presence of charge- or spin-density-waves state that open a gap on a portion of the Fermi surface or fully gapped Wigner crystals. The resulting new phases, quasi-insulators in which part of the Fermi surface remains intact or valley-polarized and valley-unpolarized Wigner crystals, coexist with previously known Stoner phases, resulting in an exceptionally intricate phase diagram.