Miracle-dz/UniFAR-FTUs huggingface dataset:
Ask and You Shall Receive (a Graph Drawing): Testing ChatGPT's Potential to Apply Graph Layout Algorithms

Large language models (LLMs) have recently taken the world by storm. They can generate coherent text, hold meaningful conversations, and be taught concepts and basic sets of instructions - such as the steps of an algorithm. In this context, we are interested in exploring the application of LLMs to graph drawing algorithms by performing experiments on ChatGPT. These algorithms are used to improve the readability of graph visualizations. The probabilistic nature of LLMs presents challenges to implementing algorithms correctly, but we believe that LLMs' ability to learn from vast amounts of data and apply complex operations may lead to interesting graph drawing results. For example, we could enable users with limited coding backgrounds to use simple natural language to create effective graph visualizations. Natural language specification would make data visualization more accessible and user-friendly for a wider range of users. Exploring LLMs' capabilities for graph drawing can also help us better understand how to formulate complex algorithms for LLMs; a type of knowledge that could transfer to other areas of computer science. Overall, our goal is to shed light on the exciting possibilities of using LLMs for graph drawing while providing a balanced assessment of the challenges and opportunities they present. A free copy of this paper with all supplemental materials required to reproduce our results is available on https://osf.io/n5rxd/? view_only=f09cbc2621f44074810b7d843f1e12f9
Wireless Sensor Networks anomaly detection using Machine Learning: A Survey

Wireless Sensor Networks (WSNs) have become increasingly valuable in various civil/military applications like industrial process control, civil engineering applications such as buildings structural strength monitoring, environmental monitoring, border intrusion, IoT (Internet of Things), and healthcare. However, the sensed data generated by WSNs is often noisy and unreliable, making it a challenge to detect and diagnose anomalies. Machine learning (ML) techniques have been widely used to address this problem by detecting and identifying unusual patterns in the sensed data. This survey paper provides an overview of the state of the art applications of ML techniques for data anomaly detection in WSN domains. We first introduce the characteristics of WSNs and the challenges of anomaly detection in WSNs. Then, we review various ML techniques such as supervised, unsupervised, and semi-supervised learning that have been applied to WSN data anomaly detection. We also compare different ML-based approaches and their performance evaluation metrics. Finally, we discuss open research challenges and future directions for applying ML techniques in WSNs sensed data anomaly detection.
On the Dynamical Heating of Dwarf Galaxies in a Fuzzy Dark Matter Halo

Fuzzy dark matter (FDM), consisting of ultralight bosons, is an intriguing alternative to cold dark matter. Numerical simulations solving the Schrödinger–Poisson (SP) equation, which governs FDM dynamics, show that FDM halos consist of a central solitonic core (representing the ground state of the SP equation), surrounded by a large envelope of excited states. Wave interference gives rise to density fluctuations of order unity throughout the envelope and causes the soliton to undergo density oscillations and execute a confined random walk in the central region of the halo. The resulting gravitational potential perturbations are an efficient source of dynamical heating. Using high-resolution numerical simulations of a 6.6 × 109 M ⊙ FDM halo with boson mass m b = 8 × 10−23 eV, we investigate the impact of this dynamical heating on the structure and kinematics of spheroidal dwarf galaxies of a fixed mass but different initial sizes and ellipticities. The galaxies are set up in equilibrium in the time-and-azimuthally averaged halo potential and evolved for 10 Gyr in the live FDM halo. We find that they continuously increase their sizes and central velocity dispersions. In addition, their kinematic structures become strongly radially anisotropic, especially in the outskirts. Dynamical heating also causes initially ellipsoidal galaxies to become more spherical over time from the inside out and gives rise to distorted, nonconcentric isodensity contours. These telltale characteristics of dynamical heating of dwarf galaxies in FDM halos can potentially be used to constrain the boson mass.
Shortest Paths in Portalgons

Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric. We refer to such a representation as a portalgon, and we call two portalgons equivalent if the surfaces they represent are isometric. We analyze the complexity of shortest paths in portalgons. We call a fragment happy if any shortest path on the portalgon visits it at most a constant number of times. A portalgon is happy if all of its fragments are happy. We present an efficient algorithm to compute shortest paths on happy portalgons. The number of times that a shortest path visits a fragment is unbounded in general. We contrast this by showing that the intrinsic Delaunay triangulation of any polyhedral surface corresponds to a happy portalgon. Since computing the intrinsic Delaunay triangulation may be inefficient, we provide an efficient algorithm to compute happy portalgons for a restricted class of portalgons.
Existence and Uniqueness Theorems for Differential Equations with Proportional Delay

The differential equation (DE) with proportional delay is a particular case of the time-dependent delay differential equation (DDE). In this paper, we solve non-linear DEs with proportional delay using the successive approximation method (SAM). We prove the existence, uniqueness of theorems, and stability for DEs with proportional delay using SAM. We derive convergence results for these equations by using the Lipschitz condition. We generalize these results to the fractional differential equations (FDEs) and system of FDEs containing Caputo fractional derivative. Further, we obtain the series solution of the pantograph equation and Ambartsumian equation in the form of a power series which are convergent for all reals. Finally, we illustrate the efficacy of the SAM by example. The results obtained by SAM are compared with exact solutions and other iterative methods. It is observed that SAM is simpler compared to other methods and the solutions obtained using SAM are consistent with the exact solution.
An Approximate Bayesian Approach to Covariate-dependent Graphical Modeling

Gaussian graphical models typically assume a homogeneous structure across all subjects, which is often restrictive in applications. In this article, we propose a weighted pseudo-likelihood approach for graphical modeling which allows different subjects to have different graphical structures depending on extraneous covariates. The pseudo-likelihood approach replaces the joint distribution by a product of the conditional distributions of each variable. We cast the conditional distribution as a heteroscedastic regression problem, with covariate-dependent variance terms, to enable information borrowing directly from the data instead of a hierarchical framework. This allows independent graphical modeling for each subject, while retaining the benefits of a hierarchical Bayes model and being computationally tractable. An efficient embarrassingly parallel variational algorithm is developed to approximate the posterior and obtain estimates of the graphs. Using a fractional variational framework, we derive asymptotic risk bounds for the estimate in terms of a novel variant of the $\alpha$-R\'{e}nyi divergence. We theoretically demonstrate the advantages of information borrowing across covariates over independent modeling. We show the practical advantages of the approach through simulation studies and illustrate the dependence structure in protein expression levels on breast cancer patients using CNV information as covariates.
The Nature of LoBAL QSOs. II. HST/WFC3 Observations Reveal Host Galaxies Dominated by Mergers

Low-ionization broad absorption line QSOs (LoBALs) are suspected to be merging systems in which extreme, active galactic nucleus-driven outflows have been triggered. Whether or not LoBALs are uniquely associated with mergers, however, has yet to be established. To characterize the morphologies of LoBALs, we present the first high-resolution morphological analysis of a volume-limited sample of 22 Sloan Digital Sky Survey (SDSS)-selected LoBALs at 0.5 < z < 0.6 from Hubble Space Telescope Wide Field Camera 3 observations. Host galaxies are resolved in 86% of the systems in F125W, which is sensitive to old stellar populations, while only 18% are detected in F475W, which traces young, unobscured stellar populations. Signs of recent or ongoing tidal interaction are present in 45%–64% of the hosts, including double nuclei, tidal tails, bridges, plumes, shells, and extended debris. Ongoing interaction with a companion is apparent in 27%−41% of the LoBALs, with as much as 1/3 of the sample representing late-stage mergers at projected nuclear separations <10 kpc. Detailed surface brightness modeling indicates that 41% of the hosts are bulge dominated while only 18% are disks. We discuss trends in various properties as a function of merger stage and parametric morphology. Notably, mergers are associated with slower, dustier winds than those seen in undisturbed/unresolved hosts. Our results favor an evolutionary scenario in which quasar-level accretion during various merger stages is associated with the observed outflows in low-z LoBALs. We discuss differences between LoBALs and FeLoBALs and show that selection via the traditional balnicity index would have excluded all but one of the mergers.
ViTO: Vision Transformer-Operator

We combine vision transformers with operator learning to solve diverse inverse problems described by partial differential equations (PDEs). Our approach, named ViTO, combines a U-Net based architecture with a vision transformer. We apply ViTO to solve inverse PDE problems of increasing complexity, namely for the wave equation, the Navier-Stokes equations and the Darcy equation. We focus on the more challenging case of super-resolution, where the input dataset for the inverse problem is at a significantly coarser resolution than the output. The results we obtain are comparable or exceed the leading operator network benchmarks in terms of accuracy. Furthermore, ViTO`s architecture has a small number of trainable parameters (less than 10% of the leading competitor), resulting in a performance speed-up of over 5x when averaged over the various test cases.
Magnetic fields in inhomogeneous axion stars

We study the time evolution of magnetic fields in various configurations of spatially inhomogeneous pseudoscalar fields, which are the coherent superposition of axions. The new induction equation for the magnetic field, which accounts for this inhomogeneity, is derived for such systems. Based on this equation, we study, first, the evolution of two Chern-Simons (CS) waves interacting with a linearly decreasing pseudoscalar field. The nonzero gradient of the pseudoscalar field results in the mixing between these CS waves. Then, we consider the problem in a compact domain, when an initial CS wave is mirror symmetric. In this situation, the inhomogeneity of a pseudoscalar field acts as the effective modification of the $\alpha$-dynamo parameter. Thus, we conclude that the influence of a spatially inhomogeneous pseudoscalar field on the magnetic field evolution strongly depends on the geometry of the system.
NeRFtrinsic Four: An End-To-End Trainable NeRF Jointly Optimizing Diverse Intrinsic and Extrinsic Camera Parameters

Novel view synthesis using neural radiance fields (NeRF) is the state-of-the-art technique for generating high-quality images from novel viewpoints. Existing methods require a priori knowledge about extrinsic and intrinsic camera parameters. This limits their applicability to synthetic scenes, or real-world scenarios with the necessity of a preprocessing step. Current research on the joint optimization of camera parameters and NeRF focuses on refining noisy extrinsic camera parameters and often relies on the preprocessing of intrinsic camera parameters. Further approaches are limited to cover only one single camera intrinsic. To address these limitations, we propose a novel end-to-end trainable approach called NeRFtrinsic Four. We utilize Gaussian Fourier features to estimate extrinsic camera parameters and dynamically predict varying intrinsic camera parameters through the supervision of the projection error. Our approach outperforms existing joint optimization methods on LLFF and BLEFF. In addition to these existing datasets, we introduce a new dataset called iFF with varying intrinsic camera parameters. NeRFtrinsic Four is a step forward in joint optimization NeRF-based view synthesis and enables more realistic and flexible rendering in real-world scenarios with varying camera parameters.
Mimic3D: Thriving 3D-Aware GANs via 3D-to-2D Imitation

Generating images with both photorealism and multiview 3D consistency is crucial for 3D-aware GANs, yet existing methods struggle to achieve them simultaneously. Improving the photorealism via CNN-based 2D super-resolution can break the strict 3D consistency, while keeping the 3D consistency by learning high-resolution 3D representations for direct rendering often compromises image quality. In this paper, we propose a novel learning strategy, namely 3D-to-2D imitation, which enables a 3D-aware GAN to generate high-quality images while maintaining their strict 3D consistency, by letting the images synthesized by the generator's 3D rendering branch mimic those generated by its 2D super-resolution branch. We also introduce 3D-aware convolutions into the generator for better 3D representation learning, which further improves the image generation quality. With the above strategies, our method reaches FID scores of 5.4 and 4.3 on FFHQ and AFHQ-v2 Cats, respectively, at 512×512 resolution, largely outperforming existing 3D-aware GANs using direct 3D rendering and coming very close to the previous state-of-the-art method that leverages 2D super-resolution. Project website: https://seanchenxy.github. io/Mimic3DWeb.
Extreme stability margins of interval systems

The paper deals with the problem of calculating exact extreme stability margins of interval systems consisting of interval plants and fixed controllers based on Bode envelopes. Algorithms are first presented to find the exact extreme phases of an interval real-rational function at a given frequency under the constraint that its module is equal to a given constant. These algorithms are computationally tractable since we need only to calculate phases for six or fewer cases. Then the results on the extreme phases of an interval real-rational function are applied to calculate the extreme case phase and gain margins of an interval system based on its Bode envelope, and to give a new method to find the Nyquist envelope of an interval system.
Integrating Temporality and Causality into Acyclic Argumentation Frameworks using a Transition System

In the context of abstract argumentation, we present the benefits of considering temporality, i.e. the order in which arguments are enunciated, as well as causality. We propose a formal method to rewrite the concepts of acyclic abstract argumentation frameworks into an action language, that allows us to model the evolution of the world, and to establish causal relationships between the enunciation of arguments and their consequences, whether direct or indirect. An Answer Set Programming implementation is also proposed, as well as perspectives towards explanations.
A NONPARAMETRIC ESTIMATOR FOR THE COVARIANCE FUNCTION OF FUNCTIONAL DATA

Many quantities of interest in economics and finance can be represented as partially observed functional data. Examples include structural business cycle estimation, implied volatility smile, the yield curve. Having embedded these quantities into continuous random curves, estimation of the covariance function is needed to extract factors, perform dimensionality reduction, and conduct inference on the factor scores. A series expansion for the covariance function is considered. Under summability restrictions on the absolute values of the coefficients in the series expansion, an estimation procedure that is resilient to overfitting is proposed. Under certain conditions, the rate of consistency for the resulting estimator achieves the minimax rate, allowing the observations to be weakly dependent. When the domain of the functional data is K(>1) dimensional, the absolute summability restriction of the coefficients avoids the so called curse of dimensionality. As an application, a Box–Pierce statistic to test independence of partially observed functional data is derived. Simulation results and an empirical investigation of the efficiency of the Eurodollar futures contracts on the Chicago Mercantile Exchange are included.
Panoptic Mapping with Fruit Completion and Pose Estimation for Horticultural Robots

Monitoring plants and fruits at high resolution play a key role in the future of agriculture. Accurate 3D information can pave the way to a diverse number of robotic applications in agriculture ranging from autonomous harvesting to precise yield estimation. Obtaining such 3D information is non-trivial as agricultural environments are often repetitive and cluttered, and one has to account for the partial observability of fruit and plants. In this paper, we address the problem of jointly estimating complete 3D shapes of fruit and their pose in a 3D multi-resolution map built by a mobile robot. To this end, we propose an online multi-resolution panoptic mapping system where regions of interest are represented with a higher resolution. We exploit data to learn a general fruit shape representation that we use at inference time together with an occlusion-aware differentiable rendering pipeline to complete partial fruit observations and estimate the 7 DoF pose of each fruit in the map. The experiments presented in this paper, evaluated both in the controlled environment and in a commercial greenhouse, show that our novel algorithm yields higher completion and pose estimation accuracy than existing methods, with an improvement of 41 % in completion accuracy and 52 % in pose estimation accuracy while keeping a low inference time of 0.6 s in average.
The Geometry of Causality

We provide a unified operational framework for the study of causality, non-locality and contextuality, in a fully device-independent and theory-independent setting. We define causaltopes, our chosen portmanteau of"causal polytopes", for arbitrary spaces of input histories and arbitrary choices of input contexts. We show that causaltopes are obtained by slicing simpler polytopes of conditional probability distributions with a set of causality equations, which we fully characterise. We provide efficient linear programs to compute the maximal component of an empirical model supported by any given sub-causaltope, as well as the associated causal fraction. We introduce a notion of causal separability relative to arbitrary causal constraints. We provide efficient linear programs to compute the maximal causally separable component of an empirical model, and hence its causally separable fraction, as the component jointly supported by certain sub-causaltopes. We study causal fractions and causal separability for several novel examples, including a selection of quantum switches with entangled or contextual control. In the process, we demonstrate the existence of"causal contextuality", a phenomenon where causal inseparability is clearly correlated to, or even directly implied by, non-locality and contextuality.
No eigenstate of the critical transverse-field Ising chain satisfies the area law

We argue that, in a basis common to all one-site shift invariant conserved charges, there is no eigenstate of a noninteracting local spin-1/2 chain Hamiltonian that satisfies the area law if the ground state has half-integer central charge. That is to say, in those models all (quasi)local one-site shift invariant conserved operators are gapless. From the standpoint of bipartite entanglement properties, we show indeed that there are three distinct one-site shift invariant noninteracting models, two of which are equivalent to the XX model (for one of them the transformation breaks one-site shift invariance) and the other to the critical Ising model. The former class has two locally distinct one-site shift invariant excited states satisfying the area law; the latter two classes have none.
Goal-conditioned Offline Reinforcement Learning through State Space Partitioning

Offline reinforcement learning (RL) aims to create policies for sequential decision-making using exclusively offline datasets. This presents a significant challenge, especially when attempting to accomplish multiple distinct goals or outcomes within a given scenario while receiving sparse rewards. Prior methods using advantage weighting for offline goal-conditioned learning improve policies monotonically. However, they still face challenges from distribution shift and multi-modality that arise due to conflicting ways to reach a goal. This issue is especially challenging in long-horizon tasks, where the presence of multiple, often conflicting, solutions makes it hard to identify a single optimal policy for transitioning from a state to a desired goal. To address these challenges, we introduce a complementary advantage-based weighting scheme that incorporates an additional source of inductive bias. Given a value-based partitioning of the state space, the contribution of actions expected to lead to target regions that are easier to reach, compared to the final goal, is further increased. Our proposed approach, Dual-Advantage Weighted Offline Goal-conditioned RL, outperforms several competing offline algorithms in widely used benchmarks. Furthermore, we provide a theoretical guarantee that the learned policy will not be inferior to the underlying behavior policy.
Speech Modeling with a Hierarchical Transformer Dynamical VAE

The dynamical variational autoencoders (DVAEs) are a family of latent-variable deep generative models that extends the VAE to model a sequence of observed data and a corresponding sequence of latent vectors. In almost all the DVAEs of the literature, the temporal dependencies within each sequence and across the two sequences are modeled with recurrent neural networks. In this paper, we propose to model speech signals with the Hierarchical Transformer DVAE (HiT-DVAE), which is a DVAE with two levels of latent variable (sequence-wise and frame-wise) and in which the temporal dependencies are implemented with the Transformer architecture. We show that HiT-DVAE outperforms several other DVAEs for speech spectrogram modeling, while enabling a simpler training procedure, revealing its high potential for downstream low-level speech processing tasks such as speech enhancement.