Miracle-dz/UniFAR-FTUs huggingface dataset:
Realizing temporal transportation trees

In this paper, we study the complexity of the \textit{periodic temporal graph realization} problem with respect to upper bounds on the fastest path durations among its vertices. This constraint with respect to upper bounds appears naturally in transportation network design applications where, for example, a road network is given, and the goal is to appropriately schedule periodic travel routes, while not exceeding some desired upper bounds on the travel times. This approach is in contrast to verification applications of the graph realization problems, where exact values for the distances (respectively, fastest travel times) are given, following some kind of precise measurement. In our work, we focus only on underlying tree topologies, which are fundamental in many transportation network applications. As it turns out, the periodic upper-bounded temporal tree realization problem (TTR) has a very different computational complexity behavior than both (i) the classic graph realization problem with respect to shortest path distances in static graphs and (ii) the periodic temporal graph realization problem with exact given fastest travel times (which was recently introduced). First, we prove that, surprisingly, TTR is NP-hard, even for a constant period $\Delta$ and when the input tree $G$ satisfies at least one of the following conditions: (a) $G$ has a constant diameter, or (b) $G$ has constant maximum degree. In contrast, when we are given exact values of the fastest travel delays, the problem is known to be solvable in polynomial time. Second, we prove that TTR is fixed-parameter tractable (FPT) with respect to the number of leaves in the input tree $G$, via a novel combination of techniques for totally unimodular matrices and mixed integer linear programming.
Don't Look into the Dark: Latent Codes for Pluralistic Image Inpainting

We present a method for large-mask pluralistic image inpainting based on the generative framework of discrete latent codes. Our method learns latent priors, discretized as tokens, by only performing computations at the visible locations of the image. This is realized by a restrictive partial encoder that predicts the token label for each visible block, a bidirectional transformer that infers the missing labels by only looking at these tokens, and a dedicated synthesis network that couples the tokens with the partial image priors to generate coherent and pluralistic complete image even under extreme mask settings. Experiments on public benchmarks validate our design choices as the proposed method outperforms strong baselines in both visual quality and diversity metrics.
Optimal Control Synthesis of Markov Decision Processes for Efficiency with Surveillance Tasks

We investigate the problem of optimal control synthesis for Markov Decision Processes (MDPs), addressing both qualitative and quantitative objectives. Specifically, we require the system to fulfill a qualitative surveillance task in the sense that a specific region of interest can be visited infinitely often with probability one. Furthermore, to quantify the performance of the system, we consider the concept of efficiency, which is defined as the ratio between rewards and costs. This measure is more general than the standard long-run average reward metric as it aims to maximize the reward obtained per unit cost. Our objective is to synthesize a control policy that ensures the surveillance task while maximizes the efficiency. We provide an effective approach to synthesize a stationary control policy achieving $\epsilon$-optimality by integrating state classifications of MDPs and perturbation analysis in a novel manner. Our results generalize existing works on efficiency-optimal control synthesis for MDP by incorporating qualitative surveillance tasks. A robot motion planning case study is provided to illustrate the proposed algorithm.
Biome-Scale Forest Properties in Amazonia Based on Field and Satellite Observations

Amazonian forests are extremely heterogeneous at different spatial scales. This review intends to present the large-scale patterns of the ecosystem properties of Amazonia, and focuses on two parts of the main components of the net primary production: the long-lived carbon pools (wood) and short-lived pools (leaves). First, the focus is on forest biophysical properties, and secondly, on the macro-scale leaf phenological patterns of these forests, looking at field measurements and bringing into discussion the recent findings derived from remote sensing dataset. Finally, I discuss the results of the three major droughts that hit Amazonia in the last 15 years. The panorama that emerges from this review suggests that slow growing forests in central and eastern Amazonia, where soils are poorer, have significantly higher above ground biomass and higher wood density, trees are higher and present lower proportions of large-leaved species than stands in northwest and southwest Amazonia. However, the opposite pattern is observed in relation to forest productivity and dynamism, which is higher in western Amazonia than in central and eastern forests. The spatial patterns on leaf phenology across Amazonia are less marked. Field data from different forest formations showed that new leaf production can be unrelated to climate seasonality, timed with radiation, timed with rainfall and/or river levels. Oppositely, satellite images exhibited a large-scale synchronized peak in new leaf production during the dry season. Satellite data and field measurements bring contrasting results for the 2005 drought. Discussions on data processing and filtering, aerosols effects and a combined analysis with field and satellite images are presented. It is suggested that to improve the understanding of the large-scale patterns on Amazonian forests, integrative analyses that combine new technologies in remote sensing and long-term field ecological data are imperative.
Decoy Effect In Search Interaction: Understanding User Behavior and Measuring System Vulnerability

This study examines the decoy effect's underexplored influence on user search interactions and methods for measuring information retrieval (IR) systems' vulnerability to this effect. It explores how decoy results alter users' interactions on search engine result pages, focusing on metrics like click-through likelihood, browsing time, and perceived document usefulness. By analyzing user interaction logs from multiple datasets, the study demonstrates that decoy results significantly affect users' behavior and perceptions. Furthermore, it investigates how different levels of task difficulty and user knowledge modify the decoy effect's impact, finding that easier tasks and lower knowledge levels lead to higher engagement with target documents. In terms of IR system evaluation, the study introduces the DEJA-VU metric to assess systems' susceptibility to the decoy effect, testing it on specific retrieval tasks. The results show differences in systems' effectiveness and vulnerability, contributing to our understanding of cognitive biases in search behavior and suggesting pathways for creating more balanced and bias-aware IR evaluations.
Structuration géo-temporelle incrémentale hiérarchique d'une collection d'images pour sa gestion sur un mobile

L'usage de mobiles equipes d'appareil photographique dans la vie courante entraine un besoin d'organisation de larges collections d'images personnelles. En tenant compte d'etudes realisees sur les besoins des utilisateurs, nous proposons un critere statistique associe a un algorithme d'optimisation pour construire une classification geo-temporelle hierarchique d'une collection. En se basant sur les modeles de melange, les particularites de notre application et la configuration des donnees sont prises en compte pour definir notre technique (incrementalite, robustesse face aux donnees gaussiennes et gestion des petits echantillons). Des experiences sur une collection d'images reelles sont proposees pour valider notre approche.
Leveraging Large Language Models for Fuzzy String Matching in Political Science

Fuzzy string matching remains a key issue when political scientists combine data from different sources. Existing matching methods invariably rely on string distances, such as Levenshtein distance and cosine similarity. As such, they are inherently incapable of matching strings that refer to the same entity with different names such as ''JP Morgan'' and ''Chase Bank'', ''DPRK'' and ''North Korea'', ''Chuck Fleischmann (R)'' and ''Charles Fleischmann (R)''. In this letter, we propose to use large language models to entirely sidestep this problem in an easy and intuitive manner. Extensive experiments show that our proposed methods can improve the state of the art by as much as 39% in terms of average precision while being substantially easier and more intuitive to use by political scientists. Moreover, our results are robust against various temperatures. We further note that enhanced prompting can lead to additional performance improvements.
Characterization of Spatial-Temporal Channel Statistics from Indoor Measurement Data at D Band

Millimeter-wave (mmWave) and D Band (110--170~GHz) frequencies are poised to play a pivotal role in the advancement of sixth-generation (6G) systems and beyond, owing to their ability to enhance performance metrics such as capacity, ultra-low latency, and spectral efficiency. This paper concentrates on deriving statistical insights into power, delay, and the number of paths based on measurements conducted across four distinct locations at a center frequency of 143.1 GHz. The findings underscore the suitability of various distributions in characterizing power behavior in line-of-sight (LOS) scenarios, including lognormal, Nakagami, gamma, and beta distributions, whereas the loglogistic distribution gives the optimal fit for power distribution in non-line-of-sight (NLOS) scenarios. Moreover, the exponential distribution shows to be the most appropriate model for the delay distribution in both LOS and NLOS scenarios. In terms of the number of paths, observations indicate a tendency for the highest concentration within the 10 m to 30 m distance range between the transmitter (Tx) and receiver (Rx). These insights shed light on the statistical nature of D band propagation characteristics, which are vital for informing the design and optimization of future 6G communication systems
Bayesian Learned Models Can Detect Adversarial Malware For Free

The vulnerability of machine learning-based malware detectors to adversarial attacks has prompted the need for robust solutions. Adversarial training is an effective method but is computationally expensive to scale up to large datasets and comes at the cost of sacrificing model performance for robustness. We hypothesize that adversarial malware exploits the low-confidence regions of models and can be identified using epistemic uncertainty of ML approaches -- epistemic uncertainty in a machine learning-based malware detector is a result of a lack of similar training samples in regions of the problem space. In particular, a Bayesian formulation can capture the model parameters' distribution and quantify epistemic uncertainty without sacrificing model performance. To verify our hypothesis, we consider Bayesian learning approaches with a mutual information-based formulation to quantify uncertainty and detect adversarial malware in Android, Windows domains and PDF malware. We found, quantifying uncertainty through Bayesian learning methods can defend against adversarial malware. In particular, Bayesian models: (1) are generally capable of identifying adversarial malware in both feature and problem space, (2) can detect concept drift by measuring uncertainty, and (3) with a diversity-promoting approach (or better posterior approximations) lead to parameter instances from the posterior to significantly enhance a detectors' ability.
Spectral effects of space weathering on Mercury: The role of composition and environment

The unique composition and space environment of Mercury provides an opportunity to test models of space weathering and can potentially provide constraints on the relative importance of physical and chemical processes involved in space weathering. In this work we apply a space weathering model to multispectral images of Mercury and incorporate the geologic context of spectra into the interpretation of the model results. We find that albedo variations on Mercury's surface cannot be explained by the addition of an opaque mineral alone. Instead, differential accumulation of space weathering products, related to composition, contributes significantly to albedo variations on Mercury's surface. Even relatively immature crater ejecta on Mercury have several times more space weathering derived iron than mature lunar soils, complicating interpretations of Mercury's surface composition.
Global convergence of iterative solvers for problems of nonlinear magnetostatics

We consider the convergence of iterative solvers for problems of nonlinear magnetostatics. Using the equivalence to an underlying minimization problem, we can establish global linear convergence of a large class of methods, including the damped Newton-method, fixed-point iteration, and the Kacanov iteration, which can all be interpreted as generalized gradient descent methods. Armijo backtracking isconsidered for an adaptive choice of the stepsize. The general assumptions required for our analysis cover inhomogeneous, nonlinear, and anisotropic materials, as well as permanent magnets. The main results are proven on the continuous level, but they carry over almost verbatim to various approximation schemes, including finite elements and isogeometric analysis, leading to bounds on the iteration numbers, which are independent of the particular discretization. The theoretical results are illustrated by numerical tests for a typical benchmark problem.
Vulnerability Detection with Code Language Models: How Far Are We?

In the context of the rising interest in code language models (code LMs) and vulnerability detection, we study the effectiveness of code LMs for detecting vulnerabilities. Our analysis reveals significant shortcomings in existing vulnerability datasets, including poor data quality, low label accuracy, and high duplication rates, leading to unreliable model performance in realistic vulnerability detection scenarios. Additionally, the evaluation methods used with these datasets are not representative of real-world vulnerability detection. To address these challenges, we introduce PrimeVul, a new dataset for training and evaluating code LMs for vulnerability detection. PrimeVul incorporates a novel set of data labeling techniques that achieve comparable label accuracy to human-verified benchmarks while significantly expanding the dataset. It also implements a rigorous data de-duplication and chronological data splitting strategy to mitigate data leakage issues, alongside introducing more realistic evaluation metrics and settings. This comprehensive approach aims to provide a more accurate assessment of code LMs' performance in real-world conditions. Evaluating code LMs on PrimeVul reveals that existing benchmarks significantly overestimate the performance of these models. For instance, a state-of-the-art 7B model scored 68.26% F1 on BigVul but only 3.09% F1 on PrimeVul. Attempts to improve performance through advanced training techniques and larger models like GPT-3.5 and GPT-4 were unsuccessful, with results akin to random guessing in the most stringent settings. These findings underscore the considerable gap between current capabilities and the practical requirements for deploying code LMs in security roles, highlighting the need for more innovative research in this domain.
Sort&Slice: A Simple and Superior Alternative to Hash-Based Folding for Extended-Connectivity Fingerprints

Extended-connectivity fingerprints (ECFPs) are a ubiquitous tool in current cheminformatics and molecular machine learning, and one of the most prevalent molecular feature extraction techniques used for chemical prediction. Atom features learned by graph neural networks can be aggregated to compound-level representations using a large spectrum of graph pooling methods; in contrast, sets of detected ECFP substructures are by default transformed into bit vectors using only a simple hash-based folding procedure. We introduce a general mathematical framework for the vectorisation of structural fingerprints via a formal operation called substructure pooling that encompasses hash-based folding, algorithmic substructure-selection, and a wide variety of other potential techniques. We go on to describe Sort&Slice, an easy-to-implement and bit-collision-free alternative to hash-based folding for the pooling of ECFP substructures. Sort&Slice first sorts ECFP substructures according to their relative prevalence in a given set of training compounds and then slices away all but the $L$ most frequent substructures which are subsequently used to generate a binary fingerprint of desired length, $L$. We computationally compare the performance of hash-based folding, Sort&Slice, and two advanced supervised substructure-selection schemes (filtering and mutual-information maximisation) for ECFP-based molecular property prediction. Our results indicate that, despite its technical simplicity, Sort&Slice robustly (and at times substantially) outperforms traditional hash-based folding as well as the other investigated methods across prediction tasks, data splitting techniques, machine-learning models and ECFP hyperparameters. We thus recommend that Sort&Slice canonically replace hash-based folding as the default substructure-pooling technique to vectorise ECFPs for supervised molecular machine learning.
Hierarchical software landscape visualization for system comprehension: A controlled experiment

In many enterprises the number of deployed applications is constantly increasing. Those applications - often several hundreds - form large software landscapes. The comprehension of such landscapes is frequently impeded due to, for instance, architectural erosion, personnel turnover, or changing requirements. Therefore, an efficient and effective way to comprehend such software landscapes is required. The current state of the art often visualizes software landscapes via flat graph-based representations of nodes, applications, and their communication. In our ExplorViz visualization, we introduce hierarchical abstractions aiming at solving typical system comprehension tasks fast and accurately for large software landscapes. To evaluate our hierarchical approach, we conduct a controlled experiment comparing our hierarchical landscape visualization to a flat, state-of-the-art visualization. In addition, we thoroughly analyze the strategies employed by the participants and provide a package containing all our experimental data to facilitate the verifiability, reproducibility, and further extensibility of our results. We observed a statistically significant increase of 14 % in task correctness of the hierarchical visualization group compared to the flat visualization group in our experiment. The time spent on the system comprehension tasks did not show any significant differences. The results backup our claim that our hierarchical concept enhances the current state of the art in landscape visualization.
$\mathrm{F^2Depth}$: Self-supervised Indoor Monocular Depth Estimation via Optical Flow Consistency and Feature Map Synthesis

Self-supervised monocular depth estimation methods have been increasingly given much attention due to the benefit of not requiring large, labelled datasets. Such self-supervised methods require high-quality salient features and consequently suffer from severe performance drop for indoor scenes, where low-textured regions dominant in the scenes are almost indiscriminative. To address the issue, we propose a self-supervised indoor monocular depth estimation framework called $\mathrm{F^2Depth}$. A self-supervised optical flow estimation network is introduced to supervise depth learning. To improve optical flow estimation performance in low-textured areas, only some patches of points with more discriminative features are adopted for finetuning based on our well-designed patch-based photometric loss. The finetuned optical flow estimation network generates high-accuracy optical flow as a supervisory signal for depth estimation. Correspondingly, an optical flow consistency loss is designed. Multi-scale feature maps produced by finetuned optical flow estimation network perform warping to compute feature map synthesis loss as another supervisory signal for depth learning. Experimental results on the NYU Depth V2 dataset demonstrate the effectiveness of the framework and our proposed losses. To evaluate the generalization ability of our $\mathrm{F^2Depth}$, we collect a Campus Indoor depth dataset composed of approximately 1500 points selected from 99 images in 18 scenes. Zero-shot generalization experiments on 7-Scenes dataset and Campus Indoor achieve $\delta_1$ accuracy of 75.8% and 76.0% respectively. The accuracy results show that our model can generalize well to monocular images captured in unknown indoor scenes.
Natural Metric-Affine Inflation

We consider here natural inflation in the low energy (two-derivative) metric-affine theory containing only the minimal degrees of freedom in the inflationary sector, i.e. the massless graviton and the pseudo-Nambu-Goldstone boson (PNGB). This theory contains the Ricci-like and parity-odd Holst invariants together with non-minimal couplings between the PNGB and the above-mentioned invariants. The Palatini and Einstein-Cartan realizations of natural inflation are particular cases of our construction. Explicit models of this type are shown to admit an explicit UV completion in a QCD-like theory with a Planckian confining scale. Moreover, for these models, we find regions of the parameter space where the inflationary predictions agree with the most recent observations at the $2\sigma$ level. We find that in order to enter the $1\sigma$ region it is necessary (and sufficient) to have a finite value of the Barbero-Immirzi parameter and a sizable non-minimal coupling between the inflaton and the Holst invariant (with sign opposite to the Barbero-Immirzi parameter). Indeed, in this case the potential of the canonically normalized inflaton develops a plateau as shown analytically.
Evaluation of 5G Waveform Candidates Considering Hardware Impairments and above 6 GHz Operation

Frequency bands above 6GHz are receiving great attention for 5G mobile radio communications due to the potential availability of enormous channel bandwidths. Various multi-carrier and single-carrier waveforms are being considered as potential candidates for 5G radio interface. When evaluating the waveform performance at high carrier frequency and large bandwidths, the inclusion of realistic hardware impairments is of great importance. In this paper, various 5G candidate waveforms (OFDM, DFTS-OFDM, W/P-OFDM, UF-OFDM, FBMC) are evaluated under hardware impairments (i.e., oscillator phase noise and non-linear amplifier) for above 6GHz mobile communications. It is observed that low out-of-band emission advantage of frequency localized waveforms (W/P-OFDM, UF-OFDM, FBMC) over OFDM and DFTS-OFDM may degrade or even vanish when hardware impairments are considered.