Search

The classic theorem of Vizing (Diskret. Analiz.'64) asserts that any graph of maximum degree $\Delta$ can be edge colored (offline) using no more than $\Delta+1$ colors (with $\Delta$ being a trivial lower bound). In the online setting, Bar-Noy, Motwani and Naor (IPL'92) conjectured that a $(1+o(1))\Delta$-edge-coloring can be computed online in $n$-vertex graphs of maximum degree $\Delta=\omega(\log n)$. Numerous algorithms made progress on this question, using a higher number of colors or assuming restricted arrival models, such as random-order edge arrivals or vertex arrivals (e.g., AGKM FOCS'03, BMM SODA'10, CPW FOCS'19, BGW SODA'21, KLSST STOC'22). In this work, we resolve this longstanding conjecture in the affirmative in the most general setting of adversarial edge arrivals. We further generalize this result to obtain online counterparts of the list edge coloring result of Kahn (J. Comb. Theory. A'96) and of the recent "local" edge coloring result of Christiansen (STOC'23)., Comment: 38 pages, to appear in STOC'24

Noise-contrastive estimation (NCE) is a popular method for estimating unnormalised probabilistic models, such as energy-based models, which are effective for modelling complex data distributions. Unlike classical maximum likelihood (ML) estimation that relies on importance sampling (resulting in ML-IS) or MCMC (resulting in contrastive divergence, CD), NCE uses a proxy criterion to avoid the need for evaluating an often intractable normalisation constant. Despite apparent conceptual differences, we show that two NCE criteria, ranking NCE (RNCE) and conditional NCE (CNCE), can be viewed as ML estimation methods. Specifically, RNCE is equivalent to ML estimation combined with conditional importance sampling, and both RNCE and CNCE are special cases of CD. These findings bridge the gap between the two method classes and allow us to apply techniques from the ML-IS and CD literature to NCE, offering several advantageous extensions., Comment: Accepted to AISTATS 2024

Recently we have proposed a new concept of a thermal neutron detector based on resistive plate chambers and 10B4C solid neutron converters, enabling to readout with high resolution in both the 3D position of neutron capture and the neutron time of flight (ToF). In this paper, we report the results of the first beam tests conducted with a new neutron RPC detection module, coupled to the position readout units of a new design. The main focus is on the measurements of the neutron ToF and identification of the converter layer where the neutron is captured, giving the position along the beam direction.

The Multi-Blade (MB) Boron-10-based neutron detector is the chosen technology for three instruments at the European Spallation Source (ESS): the two ESS reflectometers, ESTIA and FREIA, and the Test Beam Line. A fourth MB detector has been built, installed and commissioned for the user operation of the reflectometer Amor at PSI (Switzerland). Amor can be considered a downscaled version of the ESS reflectometer ESTIA. They are based on the same Selene guide concept, optimized for performing focusing reflectometry on small samples. The experience gained at Amor is invaluable for the future deployment of the MB detector at the ESS. This manuscript describes the MB detector construction and installation at Amor along with the readout electronics chain based on the VMM3a ASIC. The readout chain deployed at Amor is equivalent of that of the ESS, including the readout master module (RMM), event-formation-units (EFUs), Kafka, FileWriter and live visualisation tools., Comment: 16 pages, 12 figures

Contemporary wireless communication systems rely on Multi-User Multiple-Input Multiple-Output (MU-MIMO) techniques. In such systems, each Access Point (AP) is equipped with multiple antenna elements and serves multiple devices simultaneously. Notably, traditional systems utilize fixed antennas, i.e., antennas without any movement capabilities, while the idea of movable antennas has recently gained traction among the research community. By moving in a confined region, movable antennas are able to exploit the wireless channel variation in the continuous domain. This additional degree of freedom may enhance the quality of the wireless links, and consequently the communication performance. However, movable antennas for MU-MIMO proposed in the literature are complex, bulky, expensive and present a high power consumption. In this paper, we propose an alternative to such systems that has lower complexity and lower cost. More specifically, we propose the incorporation of rotation capabilities to APs equipped with Uniform Linear Arrays (ULAs) of antennas. We consider the uplink of an indoor scenario where the AP serves multiple devices simultaneously. The optimal rotation of the ULA is computed based on estimates of the positions of the active devices and aiming at maximizing the per-user mean achievable Spectral Efficiency (SE). Adopting a spatially correlated Rician channel model, our numerical results show that the rotation capabilities of the AP can bring substantial improvements in the SE in scenarios where the line-of-sight component of the channel vectors is strong. Moreover, our proposed system is robust against imperfect positioning estimates., Comment: 6 pages, 7 figures. Manuscript submitted to the IEEE Wireless Communications and Networking Conference (WCNC), Milan, Italy, 2025

EU directives stipulate a systematic follow-up of train delays. In Sweden, the Swedish Transport Administration registers and assigns an appropriate delay attribution code. However, this delay attribution code is assigned manually, which is a complex task. In this paper, a machine learning-based decision support for assigning delay attribution codes based on event descriptions is investigated. The text is transformed using TF-IDF, and two models, Random Forest and Support Vector Machine, are evaluated against a random uniform classifier and the classification performance of the Swedish Transport Administration. Further, the problem is modeled as both a hierarchical and flat approach. The results indicate that a hierarchical approach performs better than a flat approach. Both approaches perform better than the random uniform classifier but perform worse than the manual classification., Comment: 22 pages, 7 figures

Millimeter wave (mmWave) multiple-input-multi-output (MIMO) is now a reality with great potential for further improvement. We study full-duplex transmissions as an effective way to improve mmWave MIMO systems. Compared to half-duplex systems, full-duplex transmissions may offer higher data rates and lower latency. However, full-duplex transmission is hindered by self-interference (SI) at the receive antennas, and SI channel estimation becomes a crucial step to make the full-duplex systems feasible. In this paper, we address the problem of channel estimation in full-duplex mmWave MIMO systems using neural networks (NNs). Our approach involves sharing pilot resources between user equipments (UEs) and transmit antennas at the base station (BS), aiming to reduce the pilot overhead in full-duplex systems and to achieve a comparable level to that of a half-duplex system. Additionally, in the case of separate antenna configurations in a full-duplex BS, providing channel estimates of transmit antenna (TX) arrays to the downlink UEs poses another challenge, as the TX arrays are not capable of receiving pilot signals. To address this, we employ an NN to map the channel from the downlink UEs to the receive antenna (RX) arrays to the channel from the TX arrays to the downlink UEs. We further elaborate on how NNs perform the estimation with different architectures, (e.g., different numbers of hidden layers), the introduction of non-linear distortion (e.g., with a 1-bit analog-to-digital converter (ADC)), and different channel conditions (e.g., low-correlated and high-correlated channels). Our work provides novel insights into NN-based channel estimators.

Resonant inelastic x-ray scattering (RIXS) is a widely used spectroscopic technique, providing access to the electronic structure and dynamics of atoms, molecules, and solids. However, RIXS requires a narrow bandwidth x-ray probe to achieve high spectral resolution. The challenges in delivering an energetic monochromated beam from an x-ray free electron laser (XFEL) thus limit its use in few-shot experiments, including for the study of high energy density systems. Here we demonstrate that by correlating the measurements of the self-amplified spontaneous emission (SASE) spectrum of an XFEL with the RIXS signal, using a dynamic kernel deconvolution with a neural surrogate, we can achieve electronic structure resolutions substantially higher than those normally afforded by the bandwidth of the incoming x-ray beam. We further show how this technique allows us to discriminate between the valence structures of Fe and Fe$_2$O$_3$, and provides access to temperature measurements as well as M-shell binding energies estimates in warm-dense Fe compounds.

By a bifurcation argument we prove that the capillary-gravity Whitham equation features asymmetrical periodic travelling wave solution of arbitrarily small amplitude. Such waves exist only in the weak surface tension regime $0

Multi-object tracking (MOT) is the task of estimating the state trajectories of an unknown and time-varying number of objects over a certain time window. Several algorithms have been proposed to tackle the multi-object smoothing task, where object detections can be conditioned on all the measurements in the time window. However, the best-performing methods suffer from intractable computational complexity and require approximations, performing suboptimally in complex settings. Deep learning based algorithms are a possible venue for tackling this issue but have not been applied extensively in settings where accurate multi-object models are available and measurements are low-dimensional. We propose a novel DL architecture specifically tailored for this setting that decouples the data association task from the smoothing task. We compare the performance of the proposed smoother to the state-of-the-art in different tasks of varying difficulty and provide, to the best of our knowledge, the first comparison between traditional Bayesian trackers and DL trackers in the smoothing problem setting.

This report introduces a new family of multimodal models, Gemini, that exhibit remarkable capabilities across image, audio, video, and text understanding. The Gemini family consists of Ultra, Pro, and Nano sizes, suitable for applications ranging from complex reasoning tasks to on-device memory-constrained use-cases. Evaluation on a broad range of benchmarks shows that our most-capable Gemini Ultra model advances the state of the art in 30 of 32 of these benchmarks - notably being the first model to achieve human-expert performance on the well-studied exam benchmark MMLU, and improving the state of the art in every one of the 20 multimodal benchmarks we examined. We believe that the new capabilities of the Gemini family in cross-modal reasoning and language understanding will enable a wide variety of use cases. We discuss our approach toward post-training and deploying Gemini models responsibly to users through services including Gemini, Gemini Advanced, Google AI Studio, and Cloud Vertex AI.

This paper considers a batch solution to the multi-object tracking problem based on sets of trajectories. Specifically, we present two offline implementations of the trajectory Poisson multi-Bernoulli mixture (TPMBM) filter for batch data based on Markov chain Monte Carlo (MCMC) sampling of the data association hypotheses. In contrast to online TPMBM implementations, the proposed offline implementations solve a large-scale, multi-scan data association problem across the entire time interval of interest, and therefore they can fully exploit all the measurement information available. Furthermore, by leveraging the efficient hypothesis structure of TPMBM filters, the proposed implementations compare favorably with other MCMC-based multi-object tracking algorithms. Simulation results show that the TPMBM implementation using the Metropolis-Hastings algorithm presents state-of-the-art multiple trajectory estimation performance., Comment: Accepted for publication in IEEE Transactions on Aerospace and Electronic Systems. MATLAB implementation available at https://github.com/yuhsuansia/Batch-TPMBM-using-MCMC-sampling

Neural radiance fields (NeRFs) have gained popularity in the autonomous driving (AD) community. Recent methods show NeRFs' potential for closed-loop simulation, enabling testing of AD systems, and as an advanced training data augmentation technique. However, existing methods often require long training times, dense semantic supervision, or lack generalizability. This, in turn, hinders the application of NeRFs for AD at scale. In this paper, we propose NeuRAD, a robust novel view synthesis method tailored to dynamic AD data. Our method features simple network design, extensive sensor modeling for both camera and lidar -- including rolling shutter, beam divergence and ray dropping -- and is applicable to multiple datasets out of the box. We verify its performance on five popular AD datasets, achieving state-of-the-art performance across the board. To encourage further development, we will openly release the NeuRAD source code. See https://github.com/georghess/NeuRAD .

In this paper we review recent advances in statistical methods for the evaluation of the heterogeneity of treatment effects (HTE), including subgroup identification and estimation of individualized treatment regimens, from randomized clinical trials and observational studies. We identify several types of approaches using the features introduced in Lipkovich, Dmitrienko and D'Agostino (2017) that distinguish the recommended principled methods from basic methods for HTE evaluation that typically rely on rules of thumb and general guidelines (the methods are often referred to as common practices). We discuss the advantages and disadvantages of various principled methods as well as common measures for evaluating their performance. We use simulated data and a case study based on a historical clinical trial to illustrate several new approaches to HTE evaluation.

The properties of a nanosecond isomer in $^{32}$Si, disputed in previous studies, depend on the evolution of proton and neutron shell gaps near the `island of inversion'. We have placed the isomer at 5505.2(2) keV with $J^{\pi} = 5^-$, decaying primarily via an $E3$ transition to the $2^+_1$ state. The $E3$ strength of 0.0841(10) W.u. is unusually small and suggests that this isomer is dominated by the $(\nu d_{3/2})^{-1} \otimes (\nu f_{7/2})^{1}$ configuration, which is sensitive to the $N=20$ shell gap. A newly observed $4^+_1$ state is placed at 5881.4(13) keV; its energy is enhanced by the $Z=14$ subshell closure. This indicates that the isomer is located in a `yrast trap', a feature rarely seen at low mass numbers., Comment: Accepted, Physical Review C

This paper proposes a metric to measure the dissimilarity between graphs that may have a different number of nodes. The proposed metric extends the generalised optimal subpattern assignment (GOSPA) metric, which is a metric for sets, to graphs. The proposed graph GOSPA metric includes costs associated with node attribute errors for properly assigned nodes, missed and false nodes and edge mismatches between graphs. The computation of this metric is based on finding the optimal assignments between nodes in the two graphs, with the possibility of leaving some of the nodes unassigned. We also propose a lower bound for the metric, which is also a metric for graphs and is computable in polynomial time using linear programming. The metric is first derived for undirected unweighted graphs and it is then extended to directed and weighted graphs. The properties of the metric are demonstrated via simulated and empirical datasets., Comment: Accepted in IEEE Transactions on Signal Processing. The code is available at https://github.com/JinhaoGu/The-graph-GOSPA-metric

We provide a simple online $\Delta(1+o(1))$-edge-coloring algorithm for bipartite graphs of maximum degree $\Delta=\omega(\log n)$ under adversarial vertex arrivals on one side of the graph. Our algorithm slightly improves the result of (Cohen, Peng and Wajc, FOCS19), which was the first, and currently only, to obtain an asymptotically optimal $\Delta(1+o(1))$ guarantee for an adversarial arrival model. More importantly, our algorithm provides a new, simpler approach for tackling online edge coloring., Comment: 7 pages, to appear in SOSA 2024

One of the most popular clustering algorithms is the celebrated $D^\alpha$ seeding algorithm (also know as $k$-means++ when $\alpha=2$) by Arthur and Vassilvitskii (2007), who showed that it guarantees in expectation an $O(2^{2\alpha}\cdot \log k)$-approximate solution to the ($k$,$\alpha$)-means cost (where euclidean distances are raised to the power $\alpha$) for any $\alpha\ge 1$. More recently, Balcan, Dick, and White (2018) observed experimentally that using $D^\alpha$ seeding with $\alpha>2$ can lead to a better solution with respect to the standard $k$-means objective (i.e. the $(k,2)$-means cost). In this paper, we provide a rigorous understanding of this phenomenon. For any $\alpha>2$, we show that $D^\alpha$ seeding guarantees in expectation an approximation factor of $$ O_\alpha \left((g_\alpha)^{2/\alpha}\cdot \left(\frac{\sigma_{\mathrm{max}}}{\sigma_{\mathrm{min}}}\right)^{2-4/\alpha}\cdot (\min\{\ell,\log k\})^{2/\alpha}\right)$$ with respect to the standard $k$-means cost of any underlying clustering; where $g_\alpha$ is a parameter capturing the concentration of the points in each cluster, $\sigma_{\mathrm{max}}$ and $\sigma_{\mathrm{min}}$ are the maximum and minimum standard deviation of the clusters around their means, and $\ell$ is the number of distinct mixing weights in the underlying clustering (after rounding them to the nearest power of $2$). We complement these results by some lower bounds showing that the dependency on $g_\alpha$ and $\sigma_{\mathrm{max}}/\sigma_{\mathrm{min}}$ is tight. Finally, we provide an experimental confirmation of the effects of the aforementioned parameters when using $D^\alpha$ seeding. Further, we corroborate the observation that $\alpha>2$ can indeed improve the $k$-means cost compared to $D^2$ seeding, and that this advantage remains even if we run Lloyd's algorithm after the seeding., Comment: Abstract shortened to meet ArXiv requirements

The possibility to engineer a Kitaev chain in quantum dots coupled via superconductors has recently emerged as a promising path toward topological superconductivity and possibly nonabelian physics. Here, we show that it is possible to avoid some of the main experimental hurdles on this path by using only local proximity effect on each quantum dot in a geometry that resembles a two-dot version of the proposal in New J. Phys. 15 045020 (2013). There is no need for narrow superconducting couplers, additional Andreev bound states, or spatially varying magnetic fields; it suffices with spin-orbit interaction and a constant magnetic field, in combination with control of the superconducting phase to tune the relative strengths of elastic cotunneling and an effective crossed-Andreev-reflection-like process generated by higher-order tunneling. We use a realistic spinful, interacting model and show that high-quality Majorana bound states can be generated already in a double quantum dot., Comment: 11 pages, 5 figures, v2: slightly revised argument in section III (results unchanged), minor correction to Fig. 2, minor improvements in the text, title changed (matches published version)

6G promises a paradigm shift by integrating positioning and sensing, enhancing not only the communication performance but also enabling location- and context-aware services. Historically, positioning and sensing were focused on cost and performance tradeoffs, implying an escalated demand for resources, such as radio, physical, and computational resources, for improved performance. However, 6G expands this perspective, embracing a set of broader values, namely sustainability, inclusiveness, and trustworthiness. From a joint industrial/academic perspective, this paper aims to shed light on these important value indicators and their relationship with the conventional key performance indicators in the context of positioning and sensing., Comment: Accepted to IEEE Wireless Communications

Ensembles of independently trained deep neural networks yield uncertainty estimates that rival Bayesian networks in performance. They also offer sizable improvements in terms of predictive performance over single models. However, deep ensembles are not commonly used in environments with limited computational budget -- such as autonomous driving -- since the complexity grows linearly with the number of ensemble members. An important observation that can be made for robotics applications, such as autonomous driving, is that data is typically sequential. For instance, when an object is to be recognized, an autonomous vehicle typically observes a sequence of images, rather than a single image. This raises the question, could the deep ensemble be spread over time? In this work, we propose and analyze Deep Ensembles Spread Over Time (DESOT). The idea is to apply only a single ensemble member to each data point in the sequence, and fuse the predictions over a sequence of data points. We implement and experiment with DESOT for traffic sign classification, where sequences of tracked image patches are to be classified. We find that DESOT obtains the benefits of deep ensembles, in terms of predictive and uncertainty estimation performance, while avoiding the added computational cost. Moreover, DESOT is simple to implement and does not require sequences during training. Finally, we find that DESOT, like deep ensembles, outperform single models for out-of-distribution detection.

Increased capacity in the access network poses capacity challenges on the transport network due to the aggregated traffic. However, there are spatial and time correlation in the user data demands that could potentially be utilized. To that end, we investigate a wireless transport network architecture that integrates beamforming and coded-caching strategies. Especially, our proposed design entails a server with multiple antennas that broadcasts content to cache nodes responsible for serving users. Traditional caching methods face the limitation of relying on the individual memory with additional overhead. Hence, we develop an efficient genetic algorithm-based scheme for beam optimization in the coded-caching system. By exploiting the advantages of beamforming and coded-caching, the architecture achieves gains in terms of multicast opportunities, interference mitigation, and reduced peak backhaul traffic. A comparative analysis of this joint design with traditional, un-coded caching schemes is also conducted to assess the benefits of the proposed approach. Additionally, we examine the impact of various buffering and decoding methods on the performance of the coded-caching scheme. Our findings suggest that proper beamforming is useful in enhancing the effectiveness of the coded-caching technique, resulting in significant reduction in peak backhaul traffic., Comment: Submitted to IEEE Future Networks World Forum, 2023

Band gap is known as an effective parameter for tuning the Lande $g$-factor in semiconductors and can be manipulated in a wide range through the bowing effect in ternary alloys. In this work, using the recently developed virtual substrate technique, high-quality InAsSb alloys throughout the whole Sb composition range are fabricated and a large $g$-factor of $g\approx -90$ at the minimum band gap of $\sim 0.1$ eV, which is almost twice that in bulk InSb is found. Further analysis to the zero gap limit reveals a possible gigantic $g$-factor of $g\approx -200$ with a peculiar relativistic Zeeman effect that disperses as the square root of magnetic field. Such a $g$-factor enhancement toward the narrow gap limit cannot be quantitatively described by the conventional Roth formula, as the orbital interaction effect between the nearly triply degenerated bands becomes the dominant source for the Zeeman splitting. These results may provide new insights into realizing large $g$-factors and spin polarized states in semiconductors and topological materials.

Evaporation of cloud droplets accelerates when turbulence mixes dry air into the cloud, affecting droplet-size distributions in atmospheric clouds, combustion sprays, and jets of exhaled droplets. The challenge is to model local correlations between droplet numbers, sizes, and supersaturation, which determine supersaturation fluctuations along droplet paths (Lagrangian fluctuations). We derived a statistical model that accounts for these correlations. Its predictions are in quantitative agreement with results of direct numerical simulations, and it explains the key mechanisms at play., Comment: 6 pages, 3 figures, supplemental material