Search

Graph representation learning (GRL) is a fundamental task in machine learning, aiming to encode high-dimensional graph-structured data into low-dimensional vectors. Self-supervised learning (SSL) methods are widely used in GRL because they can avoid expensive human annotation. In this work, we propose a novel Subgraph Gaussian Embedding Contrast (SGEC) method. Our approach introduces a subgraph Gaussian embedding module, which adaptively maps subgraphs to a structured Gaussian space, ensuring the preservation of graph characteristics while controlling the distribution of generated subgraphs. We employ optimal transport distances, including Wasserstein and Gromov-Wasserstein distances, to effectively measure the similarity between subgraphs, enhancing the robustness of the contrastive learning process. Extensive experiments across multiple benchmarks demonstrate that SGEC outperforms or presents competitive performance against state-of-the-art approaches. Our findings provide insights into the design of SSL methods for GRL, emphasizing the importance of the distribution of the generated contrastive pairs.

Graph Neural Networks (GNNs) have shown great promise in modeling relationships between nodes in a graph, but capturing higher-order relationships remains a challenge for large-scale networks. Previous studies have primarily attempted to utilize the information from higher-order neighbors in the graph, involving the incorporation of powers of the shift operator, such as the graph Laplacian or adjacency matrix. This approach comes with a trade-off in terms of increased computational and memory demands. Relying on graph spectral theory, we make a fundamental observation: the regular and the Hadamard power of the Laplacian matrix behave similarly in the spectrum. This observation has significant implications for capturing higher-order information in GNNs for various tasks such as node classification and semi-supervised learning. Consequently, we propose a novel graph convolutional operator based on the sparse Sobolev norm of graph signals. Our approach, known as Sparse Sobolev GNN (S2-GNN), employs Hadamard products between matrices to maintain the sparsity level in graph representations. S2-GNN utilizes a cascade of filters with increasing Hadamard powers to generate a diverse set of functions. We theoretically analyze the stability of S2-GNN to show the robustness of the model against possible graph perturbations. We also conduct a comprehensive evaluation of S2-GNN across various graph mining, semi-supervised node classification, and computer vision tasks. In particular use cases, our algorithm demonstrates competitive performance compared to state-of-the-art GNNs in terms of performance and running time.

Optical systems that combine nonlinearity with coupling between various subsystems offer a flexible platform for observing a diverse range of nonlinear dynamics. Furthermore, engineering tolerances are such that the subsystems can be identical to within a fraction of the wavelength of light; hence, such coupled systems inherently have a natural symmetry that can lead to either delocalization or symmetry breaking. We consider here an optical Kerr cavity that supports two interacting electric fields, generated by two symmetric input beams. Mathematically, this system is modeled by a four-dimensional $\mathbb{Z}_2$-equivariant vector field with the strength and detuning of the input light as control parameters. Previous research has shown that complex switching dynamics are observed both experimentally and numerically across a wide range of parameter values. Here, we show that particular switching patterns are created at specific global bifurcations through either delocalization or symmetry breaking of a chaotic attractor. We find that the system exhibits infinitely many of these global bifurcations, which are organized by $\mathbb{Z}_2$-equivariant codimension-two Belyakov transitions. We investigate these switching dynamics by means of the continuation of global bifurcations in combination with the computation of kneading invariants and Lyapunov exponents. In this way, we provide a comprehensive picture of the interplay between different switching patterns of periodic orbits and chaotic attractors.

Tropical cyclones (TCs) are powerful, natural phenomena that can severely impact populations and infrastructure. Enhancing our understanding of the mechanisms driving their intensification is crucial for mitigating these impacts. To this end, researchers are pushing the boundaries of TC simulation resolution down to scales of just a few meters. However, higher resolution simulations come with significant computational challenges, increasing both time and energy costs. Adaptive mesh refinement (AMR) is a technique widely used in computational fluid dynamics but has seen limited application in atmospheric simulations. This study explores the use of h-adaptive grids using the spectral element discretization technique to accelerate TC simulations while allowing very high resolutions in certain parts of the domain. By applying AMR to a rapidly intensifying TC test case, we demonstrate that AMR can replicate the results of uniform grid simulations in terms of mean and local wind speed maxima while dramatically reducing computational costs. We show that AMR can speed up dry TC simulations by a factor of 2 - 13 for the set of tested refinement criteria. Additionally, we show that TC intensity changes as resolution is increased and that AMR can deliver high-resolution simulations at the cost of coarser static simulations. Our findings indicate that AMR and spectral element methods are promising tools for enhancing TC simulations.

High-quality audio data is a critical prerequisite for training robust text-to-speech models, which often limits the use of opportunistic or crowdsourced datasets. This paper presents an approach to overcome this limitation by implementing a denoising pipeline on the Catalan subset of Commonvoice, a crowd-sourced corpus known for its inherent noise and variability. The pipeline incorporates an audio enhancement phase followed by a selective filtering strategy. We developed an automatic filtering mechanism leveraging Non-Intrusive Speech Quality Assessment (NISQA) models to identify and retain the highest quality samples post-enhancement. To evaluate the efficacy of this approach, we trained a state of the art diffusion-based TTS model on the processed dataset. The results show a significant improvement, with an increase of 0.4 in the UTMOS Score compared to the baseline dataset without enhancement. This methodology shows promise for expanding the utility of crowdsourced data in TTS applications, particularly for mid to low resource languages like Catalan., Comment: Submitted to Iberspeech 2024

While standardized codecs like JPEG and HEVC-intra represent the industry standard in image compression, neural Learned Image Compression (LIC) codecs represent a promising alternative. In detail, integrating attention mechanisms from Vision Transformers into LIC models has shown improved compression efficiency. However, extra efficiency often comes at the cost of aggregating redundant features. This work proposes a Graph-based Attention Block for Image Compression (GABIC), a method to reduce feature redundancy based on a k-Nearest Neighbors enhanced attention mechanism. Our experiments show that GABIC outperforms comparable methods, particularly at high bit rates, enhancing compression performance., Comment: 10 pages, 5 figures, accepted at ICIP 2024

In recent years, Graph Neural Networks (GNNs) have demonstrated strong adaptability to various real-world challenges, with architectures such as Vision GNN (ViG) achieving state-of-the-art performance in several computer vision tasks. However, their practical applicability is hindered by the computational complexity of constructing the graph, which scales quadratically with the image size. In this paper, we introduce a novel Windowed vision Graph neural Network (WiGNet) model for efficient image processing. WiGNet explores a different strategy from previous works by partitioning the image into windows and constructing a graph within each window. Therefore, our model uses graph convolutions instead of the typical 2D convolution or self-attention mechanism. WiGNet effectively manages computational and memory complexity for large image sizes. We evaluate our method in the ImageNet-1k benchmark dataset and test the adaptability of WiGNet using the CelebA-HQ dataset as a downstream task with higher-resolution images. In both of these scenarios, our method achieves competitive results compared to previous vision GNNs while keeping memory and computational complexity at bay. WiGNet offers a promising solution toward the deployment of vision GNNs in real-world applications. We publicly released the code at https://github.com/EIDOSLAB/WiGNet.

Resilience refers to the ability of systems to withstand, adapt to, and recover from disruptive events. While studies on resilience have attracted significant attention across various research domains, the precise definition of this concept within the field of cooperative artificial intelligence remains unclear. This paper addresses this gap by proposing a clear definition of `cooperative resilience' and outlining a methodology for its quantitative measurement. The methodology is validated in an environment with RL-based and LLM-augmented autonomous agents, subjected to environmental changes and the introduction of agents with unsustainable behaviors. These events are parameterized to create various scenarios for measuring cooperative resilience. The results highlight the crucial role of resilience metrics in analyzing how the collective system prepares for, resists, recovers from, sustains well-being, and transforms in the face of disruptions. These findings provide foundational insights into the definition, measurement, and preliminary analysis of cooperative resilience, offering significant implications for the broader field of AI. Moreover, the methodology and metrics developed here can be adapted to a wide range of AI applications, enhancing the reliability and effectiveness of AI in dynamic and unpredictable environments., Comment: Supplementary material in https://github.com/mavivi95/resilience/blob/main/Supplementary_File.pdf

Computing the spectrum and stability of traveling waves in spatially discrete systems quickly becomes unfeasible with increasing system size. We present a framework for effectively determining the spectrum and stability of traveling waves in discrete systems with symmetries (such as rings and lattices) by computing master stability curves. We show that wave destabilization and multi-stability between waves can be determined from the position and curvature of master stability curves independently of the number of constituents. To illustrate our framework, we compute and analyze master stability curves of traveling waves (that take the form of pulse trains) in diffusively coupled rings of FitzHugh-Nagumo oscillators., Comment: 8 pages, 3 figures

Hypergraphs are powerful mathematical structures that can model complex, high-order relationships in various domains, including social networks, bioinformatics, and recommender systems. However, generating realistic and diverse hypergraphs remains challenging due to their inherent complexity and lack of effective generative models. In this paper, we introduce a diffusion-based Hypergraph Generation (HYGENE) method that addresses these challenges through a progressive local expansion approach. HYGENE works on the bipartite representation of hypergraphs, starting with a single pair of connected nodes and iteratively expanding it to form the target hypergraph. At each step, nodes and hyperedges are added in a localized manner using a denoising diffusion process, which allows for the construction of the global structure before refining local details. Our experiments demonstrated the effectiveness of HYGENE, proving its ability to closely mimic a variety of properties in hypergraphs. To the best of our knowledge, this is the first attempt to employ deep learning models for hypergraph generation, and our work aims to lay the groundwork for future research in this area., Comment: arXiv admin note: text overlap with arXiv:2312.11529 by other authors

We study the possibility of obtaining the Standard Model (SM) of particle physics as an effective theory of a more fundamental one, whose electroweak sector includes two non-universal local $U(1)$ gauge groups, with the chiral anomaly cancellation taking place through an interplay among families. As a result of the spontaneous symmetry breaking, a massive gauge boson $Z'$ arises, which couples differently to the third family of fermions (by assumption, we restrict ourselves to the scenario in which the $Z'$ couples in the same way to the first two families). Two Higgs doublets and one scalar singlet are necessary to generate the SM fermion masses and break the gauge symmetries. We show that in our model, the flavor-changing neutral currents (FCNC) of the Higgs sector are identically zero if each right-handed SM fermion is only coupled with a single Higgs doublet. This result represents a FCNC cancellation mechanism different from the usual procedure in Two-Higgs Doublet Models~(2HDM). The non-universal nature of our solutions requires the presence of three right-handed neutrino fields, one for each family. Our model generates all elements of the Dirac mass matrix for quarks and leptons, which is quite non-trivial for non-universal models. Thus, we can fit all the masses and mixing angles with two scalar doublets. Finally, we show the distribution of solutions for the scalar boson masses in our model by scanning well-motivated intervals for the model parameters. We consider two possibilities for the scalar potential and compare these results with the Higgs-like resonant signals recently reported by the ATLAS and CMS experiments at the LHC. Finally, we also report collider, electroweak, and flavor constraints on the model parameters., Comment: 27 pages, 3 figures

Event cameras, known for low-latency operation and superior performance in challenging lighting conditions, are suitable for sensitive computer vision tasks such as semantic segmentation in autonomous driving. However, challenges arise due to limited event-based data and the absence of large-scale segmentation benchmarks. Current works are confined to closed-set semantic segmentation, limiting their adaptability to other applications. In this paper, we introduce OVOSE, the first Open-Vocabulary Semantic Segmentation algorithm for Event cameras. OVOSE leverages synthetic event data and knowledge distillation from a pre-trained image-based foundation model to an event-based counterpart, effectively preserving spatial context and transferring open-vocabulary semantic segmentation capabilities. We evaluate the performance of OVOSE on two driving semantic segmentation datasets DDD17, and DSEC-Semantic, comparing it with existing conventional image open-vocabulary models adapted for event-based data. Similarly, we compare OVOSE with state-of-the-art methods designed for closed-set settings in unsupervised domain adaptation for event-based semantic segmentation. OVOSE demonstrates superior performance, showcasing its potential for real-world applications. The code is available at https://github.com/ram95d/OVOSE., Comment: conference

TThe Period-Luminosity (PL) relation for Cepheid variable stars in the Large Magellanic Cloud (LMC) is crucial for distance measurements in astronomy. This study analyzes the impact of using the median rather than the mean on the PL relation's slope and zero point. It also examines the persistence of the break at approximately 10 days and addresses specification issues in the PL relation model. Using $VI$-band median and mean magnitudes from the OGLE-IV survey, corrected for extinction, we fit the PL relation employing robust $MM$-regression, which features a high breakdown point and robust standard errors. Statistical tests and residual analysis are conducted to identify and correct model deficiencies. Our findings indicate a significant change in the PL relation for Cepheids with periods of 10 days or longer, regardless of whether median or mean magnitudes are used. A bias in the zero point and slope estimators is observed when using median magnitudes instead of mean magnitudes, especially in the $V$-band. By identifying and correcting regression issues and considering the period break, our estimators for slope and zero point are more accurate for distance calculations. Comparative analysis of the models for each band quantifies the bias introduced by using median magnitudes, highlighting the importance of considering the Cepheids' period for accurate location measure results, similar to those obtained using mean magnitudes.

With the escalating demand for meal delivery services, this study delves into the Meal Delivery Routing Problem (MDRP) within the context of last-mile logis-tics. Focusing on the critical aspects of courier allocation and order fulfillment, we introduce a novel approach utilizing a GRASP metaheuristic. The algorithm optimizes the assignment of couriers to orders, considering dynamic factors such as courier availability, order demands, and geographical locations. Real-world in-stances from a Colombian delivery app form the basis of our computational anal-ysis. Calibration of GRASP parameters reveals a delicate trade-off between solu-tion quality and computational time. Comparative results with a simulation-optimization based study underscore GRASP's competitive performance, demon-strating strengths in fulfilling orders and routing efficiency across diverse in-stances. This research enhances operational efficiency in the burgeoning food de-livery industry, shedding light on practical algorithms for last-mile logistics opti-mization., Comment: Conference Paper, 15th Metaheuristic International Conference, MIC2024

Re-Identification systems (Re-ID) are crucial for public safety but face the challenge of having to adapt to environments that differ from their training distribution. Furthermore, rigorous privacy protocols in public places are being enforced as apprehensions regarding individual freedom rise, adding layers of complexity to the deployment of accurate Re-ID systems in new environments. For example, in the European Union, the principles of ``Data Minimization'' and ``Purpose Limitation'' restrict the retention and processing of images to what is strictly necessary. These regulations pose a challenge to the conventional Re-ID training schemes that rely on centralizing data on servers. In this work, we present a novel setting for privacy-preserving Distributed Unsupervised Domain Adaptation for person Re-ID (DUDA-Rid) to address the problem of domain shift without requiring any image transfer outside the camera devices. To address this setting, we introduce Fed-Protoid, a novel solution that adapts person Re-ID models directly within the edge devices. Our proposed solution employs prototypes derived from the source domain to align feature statistics within edge devices. Those source prototypes are distributed across the edge devices to minimize a distributed Maximum Mean Discrepancy (MMD) loss tailored for the DUDA-Rid setting. Our experiments provide compelling evidence that Fed-Protoid outperforms all evaluated methods in terms of both accuracy and communication efficiency, all while maintaining data privacy., Comment: ECCV 2024

The $^{246}$Cm(n,$\gamma$) and $^{248}$Cm(n,$\gamma$) cross-sections have been measured at the Experimental Area 2 (EAR2) of the n_TOF facility at CERN with three C$_6$D$_6$ detectors. This measurement is part of a collective effort to improve the capture cross-section data for Minor Actinides (MAs), which are required to estimate the production and transmutation rates of these isotopes in light water reactors and innovative reactor systems. In particular, the neutron capture in $^{246}$Cm and $^{248}$Cm open the path for the formation of other Cm isotopes and heavier elements such as Bk and Cf and the knowledge of (n,$\gamma$) cross-sections of these Cm isotopes plays an important role in the transport, transmutation and storage of the spent nuclear fuel. The reactions $^{246}$Cm(n,$\gamma$) and $^{248}$Cm(n,$\gamma$) have been the two first capture measurements analyzed at n_TOF EAR2. Until this experiment and two recent measurements performed at J-PARC, there was only one set of data of the capture cross-sections of $^{246}$Cm and $^{248}$Cm, that was obtained in 1969 in an underground nuclear explosion experiment. In the measurement at n_TOF a total of 13 resonances of $^{246}$Cm between 4 and 400 eV and 5 of $^{248}$Cm between 7 and 100 eV have been identified and fitted. The radiative kernels obtained for $^{246}$Cm are compatible with JENDL-5, but some of them are not with JENDL-4, which has been adopted by JEFF-3.3 and ENDF/B-VIII.0. The radiative kernels obtained for the first three $^{248}$Cm resonances are compatible with JENDL-5, however, the other two are not compatible with any other evaluation and are 20% and 60% larger than JENDL-5.

Sample Return Capsules (SRCs) entering Earth's atmosphere at hypervelocity from interplanetary space are a valuable resource for studying meteor phenomena. The 24 September 2023 arrival of the OSIRIS-REx (Origins, Spectral Interpretation, Resource Identification, and Security-Regolith Explorer) SRC provided an unprecedented chance for geophysical observations of a well-characterized source with known parameters, including timing and trajectory. A collaborative effort involving researchers from 16 institutions executed a carefully planned geophysical observational campaign at strategically chosen locations, deploying over 400 ground-based sensors encompassing infrasound, seismic, distributed acoustic sensing (DAS), and GPS technologies. Additionally, balloons equipped with infrasound sensors were launched to capture signals at higher altitudes. This campaign (the largest of its kind so far) yielded a wealth of invaluable data anticipated to fuel scientific inquiry for years to come. The success of the observational campaign is evidenced by the near-universal detection of signals across instruments, both proximal and distal. This paper presents a comprehensive overview of the collective scientific effort, field deployment, and preliminary findings. The early findings have the potential to inform future space missions and terrestrial campaigns, contributing to our understanding of meteoroid interactions with planetary atmospheres. Furthermore, the dataset collected during this campaign will improve entry and propagation models as well as augment the study of atmospheric dynamics and shock phenomena generated by meteoroids and similar sources., Comment: 87 pages, 14 figures

Individual species may experience diverse outcomes, from prosperity to extinction, in an ecological community subject to external and internal variations. Despite the wealth of theoretical results derived from random matrix ensembles, a theoretical framework still remains to be developed to understand species-level dynamical heterogeneity within a given community, hampering real-world ecosystems' theoretical assessment and management. Here, we consider empirical plant-pollinator mutualistic networks, additionally including all-to-all intragroup competition, where species abundance evolves under a Lotka-Volterra-type equation. Setting the strengths of competition and mutualism to be uniform, we investigate how individual species persist or go extinct under varying the interaction strengths. By employing bifurcation theory in tandem with numerical continuation, we elucidate transcritical bifurcations underlying species extinction and demonstrate that the Hopf bifurcation of unfeasible equilibria and degenerate transcritical bifurcations give rise to multistability, i.e., the coexistence of multiple attracting feasible equilibria. These bifurcations allow us to partition the parameter space into different regimes, each with distinct sets of extinct species, offering insights into how interspecific interactions generate one or multiple extinction scenarios within an ecological network., Comment: 16 Pages, 8 Figures

DC networks play an important role within the ongoing energy transition. In this context, simulations of designed and existing networks and their corresponding assets are a core tool to get insights and form a support to decision-making. Hereby, these simulations of DC networks are executed in the time domain. Due to the involved high frequencies and the used controllers, the equations that model these DC networks are stiff and highly oscillatory differential equations. By exploiting sparsity, we show that conventional adaptive time stepping schemes can be used efficiently for the time domain simulation of very large DC networks and that this scales linearly in the computational cost as the size of the networks increase., Comment: 17 pages, 5 figures, 3 tables. First version, all comments are welcome

Graph Neural Networks (GNNs) have advanced spatiotemporal forecasting by leveraging relational inductive biases among sensors (or any other measuring scheme) represented as nodes in a graph. However, current methods often rely on Recurrent Neural Networks (RNNs), leading to increased runtimes and memory use. Moreover, these methods typically operate within 1-hop neighborhoods, exacerbating the reduction of the receptive field. Causal Graph Processes (CGPs) offer an alternative, using graph filters instead of MLP layers to reduce parameters and minimize memory consumption. This paper introduces the Causal Graph Process Neural Network (CGProNet), a non-linear model combining CGPs and GNNs for spatiotemporal forecasting. CGProNet employs higher-order graph filters, optimizing the model with fewer parameters, reducing memory usage, and improving runtime efficiency. We present a comprehensive theoretical and experimental stability analysis, highlighting key aspects of CGProNet. Experiments on synthetic and real data demonstrate CGProNet's superior efficiency, minimizing memory and time requirements while maintaining competitive forecasting performance., Comment: 21 pages, 4 figures

Processing multidomain data defined on multiple graphs holds significant potential in various practical applications in computer science. However, current methods are mostly limited to discrete graph filtering operations. Tensorial partial differential equations on graphs (TPDEGs) provide a principled framework for modeling structured data across multiple interacting graphs, addressing the limitations of the existing discrete methodologies. In this paper, we introduce Continuous Product Graph Neural Networks (CITRUS) that emerge as a natural solution to the TPDEG. CITRUS leverages the separability of continuous heat kernels from Cartesian graph products to efficiently implement graph spectral decomposition. We conduct thorough theoretical analyses of the stability and over-smoothing properties of CITRUS in response to domain-specific graph perturbations and graph spectra effects on the performance. We evaluate CITRUS on well-known traffic and weather spatiotemporal forecasting datasets, demonstrating superior performance over existing approaches. The implementation codes are available at https://github.com/ArefEinizade2/CITRUS., Comment: 20 pages, 5 figures

The functionality of magnetoelectric multiferroics depends on the formation, size, and coupling of their magnetic and electric domains. Knowing the parameters guiding these criteria is a key effort in the emerging field of magnetoelectric domain engineering. Here we show, using a combination of piezoresponse-force microscopy, non-linear optics, and x-ray scattering, that the correlation length setting the size of the ferroelectric domains in the multiferroic hexagonal manganites can be engineered from the micron range down to a few unit cells under the substitution of Mn$^{3+}$ ions with Al$^{3+}$ ions. The magnetoelectric coupling mechanism between the antiferromagnetic Mn$^{3+}$ order and the distortive-ferroelectric order remains intact even at substantial replacement of Mn$^{3+}$ by Al$^{3+}$. Hence, chemical substitution proves to be an effective tool for domain-size engineering in one of the most studied classes of multiferroics., Comment: 10 pages, 8 figures

This paper presents a multiscale modeling framework (MMF) to model moist atmospheric limited-area weather. The MMF resolves large-scale convection using a coarse grid while simultaneously resolving local features through numerous fine local grids and coupling them seamlessly. Both large- and small-scale processes are modeled using the compressible Navier-Stokes equations within the Nonhydrostatic Unified Model of the Atmosphere (NUMA), and they are discretized using a continuous element-based Galerkin method (spectral elements) with high-order basis functions. Consequently, the large-scale and small-scale models share the same dynamical core but have the flexibility to be adjusted individually. The proposed MMF method is tested in 2D and 3D idealized limited-area weather problems involving storm clouds produced by squall line and supercell simulations. The MMF numerical results showed enhanced representation of cloud processes compared to the coarse model., Comment: 24 pages

This paper develops and tests a deep-atmosphere, nonhydrostatic dynamical core (DyCore) targeted towards ground-thermosphere atmospheric prediction using the spectral element method (SEM) with Implicit-Explicit (IMEX) and Horizontally Explicit Vertically Implicit (HEVI) time-integration. Two versions of the DyCore are presented and tested, each based on a different formulation of the specific internal energy and continuity equations, which, unlike standard potential temperature formulations, are valid for variable composition atmospheres. The first version, which uses a product-rule (PR) forms of the continuity and specific internal energy equation, contains an additional pressure dilation term and does not conserve mass. The second version, which does not use the product-rule (no-PR) in the continuity and specific internal energy, contains two terms to represent pressure dilation and conserves mass to machine precision regardless of time truncation error. The pressure gradient and gravitational forces in the momentum balance equation are reformulated to reduce numerical errors at high altitudes. These new equation sets were implemented in two SEM-based atmospheric models: the Nonhydrostatic Unified Model of the Atmosphere (NUMA) and the Navy Environmental Prediction sysTem Using a Nonhydrostatic Engine (NEPTUNE). Numerical results using both a deep-atmosphere and shallow-atmosphere baroclinic instability, a balanced zonal flow, and a high-altitude orographic gravity wave verify the fidelity of the dynamics at low and high altitudes and for constant and variable composition atmospheres. These results are compared to existing deep-atmosphere dynamical cores and a Fourier-ray code, indicating that the proposed discretized equation sets are viable DyCore candidates for next-generation ground-to-thermosphere atmospheric models., Comment: 37 pages, 14 figures, preprint

This paper examines the application of adaptive mesh refinement (AMR) in the field of numerical weather prediction (NWP). We implement and assess two distinct AMR approaches and evaluate their performance through standard NWP benchmarks. In both cases, we solve the fully compressible Euler equations, fundamental to many non-hydrostatic weather models. The first approach utilizes oct-tree cell-based mesh refinement coupled with a high-order discontinuous Galerkin method for spatial discretization. In the second approach, we employ level-based AMR with the finite difference method. Our study provides insights into the accuracy and benefits of employing these AMR methodologies for the multi-scale problem of NWP. Additionally, we explore essential properties including their impact on mass and energy conservation. Moreover, we present and evaluate an AMR solution transfer strategy for the tree-based AMR approach that is simple to implement, memory-efficient, and ensures conservation for both flow in the box and sphere. Furthermore, we discuss scalability, performance portability, and the practical utility of the AMR methodology within an NWP framework -- crucial considerations in selecting an AMR approach. The current de facto standard for mesh refinement in NWP employs a relatively simplistic approach of static nested grids, either within a general circulation model or a separately operated regional model with loose one-way synchronization. It is our hope that this study will stimulate further interest in the adoption of AMR frameworks like AMReX in NWP. These frameworks offer a triple advantage: a robust dynamic AMR for tracking localized and consequential features such as tropical cyclones, extreme scalability, and performance portability., Comment: 30 pages

Research on the operation of mobility systems so far has mostly focused on minimizing cost-centered metrics such as average travel time, distance driven, and operational costs. Whilst capturing economic indicators, such metrics do not account for transportation justice aspects. In this paper, we present an optimization model to plan the operation of Intermodal Autonomous Mobility-on-Demand (I-AMoD) systems, where self-driving vehicles provide on-demand mobility jointly with public transit and active modes, with the goal to minimize the accessibility unfairness experienced by the population. Specifically, we first leverage a previously developed network flow model to compute the I-AMoD system operation in a minimum-time manner. Second, we formally define accessibility unfairness, and use it to frame the minimum-accessibility-unfairness problem and cast it as a linear program. We showcase our framework for a real-world case-study in the city of Eindhoven, NL. Our results show that it is possible to reach an operation that is on average fully fair at the cost of a slight travel time increase compared to a minimum-travel-time solution. Thereby we observe that the accessibility fairness of individual paths is, on average, worse than the average values obtained from flows, setting the stage for a discussion on the definition of accessibility fairness itself.

Reconstructing time-varying graph signals (or graph time-series imputation) is a critical problem in machine learning and signal processing with broad applications, ranging from missing data imputation in sensor networks to time-series forecasting. Accurately capturing the spatio-temporal information inherent in these signals is crucial for effectively addressing these tasks. However, existing approaches relying on smoothness assumptions of temporal differences and simple convex optimization techniques have inherent limitations. To address these challenges, we propose a novel approach that incorporates a learning module to enhance the accuracy of the downstream task. To this end, we introduce the Gegenbauer-based graph convolutional (GegenConv) operator, which is a generalization of the conventional Chebyshev graph convolution by leveraging the theory of Gegenbauer polynomials. By deviating from traditional convex problems, we expand the complexity of the model and offer a more accurate solution for recovering time-varying graph signals. Building upon GegenConv, we design the Gegenbauer-based time Graph Neural Network (GegenGNN) architecture, which adopts an encoder-decoder structure. Likewise, our approach also utilizes a dedicated loss function that incorporates a mean squared error component alongside Sobolev smoothness regularization. This combination enables GegenGNN to capture both the fidelity to ground truth and the underlying smoothness properties of the signals, enhancing the reconstruction performance. We conduct extensive experiments on real datasets to evaluate the effectiveness of our proposed approach. The experimental results demonstrate that GegenGNN outperforms state-of-the-art methods, showcasing its superior capability in recovering time-varying graph signals., Comment: Accepted by IEEE Transactions on Neural Networks and Learning Systems (TNNLS)

As the field of AI continues to evolve, a significant dimension of this progression is the development of Large Language Models and their potential to enhance multi-agent artificial intelligence systems. This paper explores the cooperative capabilities of Large Language Model-augmented Autonomous Agents (LAAs) using the well-known Meltin Pot environments along with reference models such as GPT4 and GPT3.5. Preliminary results suggest that while these agents demonstrate a propensity for cooperation, they still struggle with effective collaboration in given environments, emphasizing the need for more robust architectures. The study's contributions include an abstraction layer to adapt Melting Pot game scenarios for LLMs, the implementation of a reusable architecture for LLM-mediated agent development - which includes short and long-term memories and different cognitive modules, and the evaluation of cooperation capabilities using a set of metrics tied to the Melting Pot's "Commons Harvest" game. The paper closes, by discussing the limitations of the current architectural framework and the potential of a new set of modules that fosters better cooperation among LAAs.

In this paper, we present two multidimensional power flow formulations based on a fixed-point iteration (FPI) algorithm to efficiently solve hundreds of thousands of power flows in distribution systems. The presented algorithms are the base for a new TensorPowerFlow (TPF) tool and shine for their simplicity, benefiting from multicore \gls{cpu} and \gls{gpu} parallelization. We also focus on the mathematical convergence properties of the algorithm, showing that its unique solution is at the practical operational point, which is the solution of high-voltage and low-current. The proof is validated using numerical simulations showing the robustness of the FPI algorithm compared to the classical \gls{nr} approach. In the case study, a benchmark with different PF solution methods is performed, showing that for applications requiring a yearly simulation at 1-minute resolution the computation time is decreased by a factor of 164, compared to the NR in its sparse formulation.

Online Unsupervised Domain Adaptation (OUDA) for person Re-Identification (Re-ID) is the task of continuously adapting a model trained on a well-annotated source domain dataset to a target domain observed as a data stream. In OUDA, person Re-ID models face two main challenges: catastrophic forgetting and domain shift. In this work, we propose a new Source-guided Similarity Preservation (S2P) framework to alleviate these two problems. Our framework is based on the extraction of a support set composed of source images that maximizes the similarity with the target data. This support set is used to identify feature similarities that must be preserved during the learning process. S2P can incorporate multiple existing UDA methods to mitigate catastrophic forgetting. Our experiments show that S2P outperforms previous state-of-the-art methods on multiple real-to-real and synthetic-to-real challenging OUDA benchmarks., Comment: WACV 2024