Miracle-dz/UniFAR-FTUs huggingface dataset:
Algebraic Connectivity Characterization of Ensemble Random Hypergraphs

Random hypergraph is a broad concept used to describe probability distributions over hypergraphs, which are mathematical structures with applications in various fields, e.g., complex systems in physics, computer science, social sciences, and network science. Ensemble methods, on the other hand, are crucial both in physics and machine learning. In physics, ensemble theory helps bridge the gap between the microscopic and macroscopic worlds, providing a statistical framework for understanding systems with a vast number of particles. In machine learning, ensemble methods are valuable because they improve predictive accuracy, reduce overfitting, lower prediction variance, mitigate bias, and capture complex relationships in data. However, there is limited research on applying ensemble methods to a set of random hypergraphs. This work aims to study the connectivity behavior of an ensemble of random hypergraphs. Specifically, it focuses on quantifying the random behavior of the algebraic connectivity of these ensembles through tail bounds. We utilize Laplacian tensors to represent these ensemble random hypergraphs and establish mathematical theorems, such as Courant-Fischer and Lieb-Seiringer theorems for tensors, to derive tail bounds for the algebraic connectivity. We derive three different tail bounds, i.e., Chernoff, Bennett, and Bernstein bounds, for the algebraic connectivity of ensemble hypergraphs with respect to different random hypergraphs assumptions.
BrainVoxGen: Deep learning framework for synthesis of Ultrasound to MRI

The study presents a deep learning framework aimed at synthesizing 3D MRI volumes from three-dimensional ultrasound images of the brain utilizing the Pix2Pix GAN model. The process involves inputting a 3D volume of ultrasounds into a UNET generator and patch discriminator, generating a corresponding 3D volume of MRI. Model performance was evaluated using losses on the discriminator and generator applied to a dataset of 3D ultrasound and MRI images. The results indicate that the synthesized MRI images exhibit some similarity to the expected outcomes. Despite challenges related to dataset size, computational resources, and technical complexities, the method successfully generated MRI volume with a satisfactory similarity score meant to serve as a baseline for further research. It underscores the potential of deep learning-based volume synthesis techniques for ultrasound to MRI conversion, showcasing their viability for medical applications. Further refinement and exploration are warranted for enhanced clinical relevance.
Nonlinear-cost random walk: Exact statistics of the distance covered for fixed budget.

We consider the nonlinear-cost random-walk model in discrete time introduced in Phys. Rev. Lett. 130, 237102 (2023)10.1103/PhysRevLett.130. 237102, where a fee is charged for each jump of the walker. The nonlinear cost function is such that slow or short jumps incur a flat fee, while for fast or long jumps the cost is proportional to the distance covered. In this paper we compute analytically the average and variance of the distance covered in n steps when the total budget C is fixed, as well as the statistics of the number of long or short jumps in a trajectory of length n, for the exponential jump distribution. These observables exhibit a very rich and nonmonotonic scaling behavior as a function of the variable C/n, which is traced back to the makeup of a typical trajectory in terms of long or short jumps, and the resulting entropy thereof. As a by-product, we compute the asymptotic behavior of ratios of Kummer hypergeometric functions when both the first and last arguments are large. All our analytical results are corroborated by numerical simulations.
Soil contamination and land subsidence raise concern in the Venice watershed, Italy

The southern catchment of the Venice watershed is threatened by shallow aquifer salinization and anthropogenic land subsidence due primarily to the microbial oxidation of organic soils that outcrop in the coastal farmland reclaimed from the Adriatic Sea over the last century. Recent hydrogeological and geophysical surveys provide documentary evidence that saltwater intrusion may extend inshore up to 20 km away from the Adriatic coastline with the contaminant plume from near ground surface down to 100 m depth in some areas. The actual salt distribution is the outcome of a number of factors, including the ground elevation markedly below the mean sea level (down to -4 m locally), the seawater encroachment along the final 10-15 km of the regional watercourses (Brenta, Bacchiglione, Adige, Gorzone), and the drainage practices implemented in the reclaimed area. The fresh-salt water interface is generally between 2 and 30 m deep and exhibits a pronounced seasonal variation. At the same time an ongoing settlement due to peat oxidation promoted by farming activities is observed in most of the area south of the Venice Lagoon that was reclaimed from 1892 to 1967 and is rich in organic matter. Overall land subsidence over the last 70 years ranges between 1.5-2 m and is still in progress at a rate of 1.5-2 cm/y. As a major result a large fraction of the reclaimed land lies below the mean sea level with an increasing exposure to flooding during severe winter storms and saltwater intrusion from the Adriatic Sea, the nearby Venice Lagoon, and the river beds that locally lie above the surrounding ground surface. To mitigate both hazards the implementation of a drainage strategy of the reclaimed area intended to maintain the water table as high as possible would be required. This could decelerate the peat oxidation (hence the related land subsidence) and oppose the inland subsurface salt convection and dispersion. Moreover the design of mobile gates at a few river mouths (e.g. the Brenta river) could create an effective barrier against the seawater migration upstream the watercourses in the hottest and driest summers.
Cell-Free Massive MIMO for ISAC: Access Point Operation Mode Selection and Power Control

This paper considers a cell-free massive multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) system, where distributed MIMO access points (APs) are used to jointly serve the communication users and detect the presence of a single target. We investigate the problem of AP operation mode selection, wherein some APs are dedicated for downlink communication, while the remaining APs are used for sensing purposes. Closed-form expressions for the individual spectral efficiency (SE) and mainlobe-to-average-sidelobe ratio (MASR) are derived, which are respectively utilized to assess the communication and sensing performances. Accordingly, a max-min fairness problem is formulated and solved, where the minimum SE of the users is maximized, subject to the per-AP power constraints as well as sensing MASR constraint. Our numerical results show that the proposed AP operation mode selection with power control can significantly improve the communication performance for given sensing requirements.
Analyzing Textual Data for Fatality Classification in Afghanistan's Armed Conflicts: A BERT Approach

Afghanistan has witnessed many armed conflicts throughout history, especially in the past 20 years; these events have had a significant impact on human lives, including military and civilians, with potential fatalities. In this research, we aim to leverage state-of-the-art machine learning techniques to classify the outcomes of Afghanistan armed conflicts to either fatal or non-fatal based on their textual descriptions provided by the Armed Conflict Location&Event Data Project (ACLED) dataset. The dataset contains comprehensive descriptions of armed conflicts in Afghanistan that took place from August 2021 to March 2023. The proposed approach leverages the power of BERT (Bidirectional Encoder Representations from Transformers), a cutting-edge language representation model in natural language processing. The classifier utilizes the raw textual description of an event to estimate the likelihood of the event resulting in a fatality. The model achieved impressive performance on the test set with an accuracy of 98.8%, recall of 98.05%, precision of 99.6%, and an F1 score of 98.82%. These results highlight the model's robustness and indicate its potential impact in various areas such as resource allocation, policymaking, and humanitarian aid efforts in Afghanistan. The model indicates a machine learning-based text classification approach using the ACLED dataset to accurately classify fatality in Afghanistan armed conflicts, achieving robust performance with the BERT model and paving the way for future endeavors in predicting event severity in Afghanistan.
IMU Preintegration for Multi-Robot Systems in the Presence of Bias and Communication Constraints

This document is in supplement to the paper titled"Multi-Robot Relative Pose Estimation and IMU Preintegration Using Passive UWB Transceivers", available at [1]. The purpose of this document is to show how IMU biases can be incorporated into the framework presented in [1], while maintaining the differential Sylvester equation form of the process model.
Pushing the limits of ab-initio-NEGF transport using efficient dissipative Mode-Space algorithms for realistic simulations of low-dimensional semiconductors including their oxide interfaces

We investigate the trade-offs between accuracy and efficiency for several flavors of the dissipative mode-space NEGF algorithm with the self-consistent Born approximation for DFT Hamiltonians. Using these models, we then demonstrate the dissipative self-consistent DFT-NEGF simulations of realistic 2D-material devices including their oxide interfaces with large slab dimensions (up to 1000 atoms) and up to several 100,000 atoms in the full device, pushing the limit of ab-initio transport.
Direct Observation of Sub-Poissonian Temporal Statistics in a Continuous Free-Electron Beam with Subpicosecond Resolution

We present a novel method to measure the arrival time statistics of continuous electron beams with sub-ps resolution, based on the combination of an RF deflection cavity and fast single electron imaging. We observe Poissonian statistics within time bins from 100~ns to 2~ns and increasingly pronounced sub-Poissonian statistics as the time bin decreases from 2~ps to 340~fs. This 2D streak-camera in principle enables femtosecond-level arrival time measurements, paving the way to observing Pauli blocking effects in electron beams and thus serving as an essential diagnostic tool towards degenerate electron beam sources for free electron quantum optics.
A Hybrid Data-driven Model of Ship Roll

A hybrid data-driven method, which combines low-fidelity physics with machine learning (ML) to model nonlinear forces and moments at a reduced computational cost, is applied to predict the roll motions of an appended ONR Tumblehome (ONRT) hull in waves. The method is trained using CFD data of unforced roll decay time series--a common data set used in parameter identification for ship roll damping and restoring moments. The trained model is then used to predict wave excited roll responses in a range of wave frequencies and the results are compared to CFD validation data. The predictions show that the method improves predictions of roll responses, especially near the natural frequency.
"Kelly is a Warm Person, Joseph is a Role Model": Gender Biases in LLM-Generated Reference Letters

Large Language Models (LLMs) have recently emerged as an effective tool to assist individuals in writing various types of content, including professional documents such as recommendation letters. Though bringing convenience, this application also introduces unprecedented fairness concerns. Model-generated reference letters might be directly used by users in professional scenarios. If underlying biases exist in these model-constructed letters, using them without scrutinization could lead to direct societal harms, such as sabotaging application success rates for female applicants. In light of this pressing issue, it is imminent and necessary to comprehensively study fairness issues and associated harms in this real-world use case. In this paper, we critically examine gender biases in LLM-generated reference letters. Drawing inspiration from social science findings, we design evaluation methods to manifest biases through 2 dimensions: (1) biases in language style and (2) biases in lexical content. We further investigate the extent of bias propagation by analyzing the hallucination bias of models, a term that we define to be bias exacerbation in model-hallucinated contents. Through benchmarking evaluation on 2 popular LLMs- ChatGPT and Alpaca, we reveal significant gender biases in LLM-generated recommendation letters. Our findings not only warn against using LLMs for this application without scrutinization, but also illuminate the importance of thoroughly studying hidden biases and harms in LLM-generated professional documents.
Price of Stability in Quality-Aware Federated Learning

Federated Learning (FL) is a distributed machine learning scheme that enables clients to train a shared global model without exchanging local data. The presence of label noise can severely degrade the FL performance, and some existing studies have focused on algorithm design for label denoising. However, they ignored the important issue that clients may not apply costly label denoising strategies due to them being self-interested and having heterogeneous valuations on the FL performance. To fill this gap, we model the clients' interactions as a novel label denoising game and characterize its equilibrium. We also analyze the price of stability, which quantifies the difference in the system performance (e.g., global model accuracy, social welfare) between the equilibrium outcome and the socially optimal solution. We prove that the equilibrium outcome always leads to a lower global model accuracy than the socially optimal solution does. We further design an efficient algorithm to compute the socially optimal solution. Numerical experiments on MNIST dataset show that the price of stability increases as the clients' data become noisier, calling for an effective incentive mechanism.
Retro-fallback: retrosynthetic planning in an uncertain world

Retrosynthesis is the task of proposing a series of chemical reactions to create a desired molecule from simpler, buyable molecules. While previous works have proposed algorithms to find optimal solutions for a range of metrics (e.g. shortest, lowest-cost), these works generally overlook the fact that we have imperfect knowledge of the space of possible reactions, meaning plans created by the algorithm may not work in a laboratory. In this paper we propose a novel formulation of retrosynthesis in terms of stochastic processes to account for this uncertainty. We then propose a novel greedy algorithm called retro-fallback which maximizes the probability that at least one synthesis plan can be executed in the lab. Using in-silico benchmarks we demonstrate that retro-fallback generally produces better sets of synthesis plans than the popular MCTS and retro* algorithms.
Scalarization for Multi-Task and Multi-Domain Learning at Scale

Training a single model on multiple input domains and/or output tasks allows for compressing information from multiple sources into a unified backbone hence improves model efficiency. It also enables potential positive knowledge transfer across tasks/domains, leading to improved accuracy and data-efficient training. However, optimizing such networks is a challenge, in particular due to discrepancies between the different tasks or domains: Despite several hypotheses and solutions proposed over the years, recent work has shown that uniform scalarization training, i.e., simply minimizing the average of the task losses, yields on-par performance with more costly SotA optimization methods. This raises the issue of how well we understand the training dynamics of multi-task and multi-domain networks. In this work, we first devise a large-scale unified analysis of multi-domain and multi-task learning to better understand the dynamics of scalarization across varied task/domain combinations and model sizes. Following these insights, we then propose to leverage population-based training to efficiently search for the optimal scalarization weights when dealing with a large number of tasks or domains.
<inline-formula><tex-math notation="LaTeX">$\mu$</tex-math><alternatives><mml:math><mml:mi>μ</mml:mi></mml:math><inline-graphic xlink:href="goudarzi-ieq1-3332308.gif"/></alternatives></inline-formula>-DDRL: A QoS-Aware Distributed Deep Reinforcement Learning Technique for Service Offloading in Fog C

Fog and Edge computing extend cloud services to the proximity of end users, allowing many Internet of Things (IoT) use cases, particularly latency-critical applications. Smart devices, such as traffic and surveillance cameras, often do not have sufficient resources to process computation-intensive and latency-critical services. Hence, the constituent parts of services can be offloaded to nearby Edge/Fog resources for processing and storage. However, making offloading decisions for complex services in highly stochastic and dynamic environments is an important, yet difficult task. Recently, Deep Reinforcement Learning (DRL) has been used in many complex service offloading problems; however, existing techniques are most suitable for centralized environments, and their convergence to the best-suitable solutions is slow. In addition, constituent parts of services often have predefined data dependencies and quality of service constraints, which further intensify the complexity of service offloading. To solve these issues, we propose a distributed DRL technique following the actor-critic architecture based on Asynchronous Proximal Policy Optimization (APPO) to achieve efficient and diverse distributed experience trajectory generation. Also, we employ PPO clipping and V-trace techniques for off-policy correction for faster convergence to the most suitable service offloading solutions. The results obtained demonstrate that our technique converges quickly, offers high scalability and adaptability, and outperforms its counterparts by improving the execution time of heterogeneous services.
A Parallel Feature-preserving Mesh Variable Offsetting Method with Dynamic Programming

Mesh offsetting plays an important role in discrete geometric processing. In this paper, we propose a parallel feature-preserving mesh offsetting framework with variable distance. Different from the traditional method based on distance and normal vector, a new calculation of offset position is proposed by using dynamic programming and quadratic programming, and the sharp feature can be preserved after offsetting. Instead of distance implicit field, a spatial coverage region represented by polyhedral for computing offsets is proposed. Our method can generate an offsetting model with smaller mesh size, and also can achieve high quality without gaps, holes, and self-intersections. Moreover, several acceleration techniques are proposed for the efficient mesh offsetting, such as the parallel computing with grid, AABB tree and rays computing. In order to show the efficiency and robustness of the proposed framework, we have tested our method on the quadmesh dataset, which is available at [https://www.quadmesh. cloud]. The source code of the proposed algorithm is available on GitHub at [https://github.com/iGame-Lab/PFPOffset].
UniParser: Multi-Human Parsing with Unified Correlation Representation Learning

Multi-human parsing is an image segmentation task necessitating both instance-level and fine-grained category-level information. However, prior research has typically processed these two types of information through separate branches and distinct output formats, leading to inefficient and redundant frameworks. This paper introduces UniParser, which integrates instance-level and category-level representations in three key aspects: 1) we propose a unified correlation representation learning approach, allowing our network to learn instance and category features within the cosine space; 2) we unify the form of outputs of each modules as pixel-level segmentation results while supervising instance and category features using a homogeneous label accompanied by an auxiliary loss; and 3) we design a joint optimization procedure to fuse instance and category representations. By virtual of unifying instance-level and category-level output, UniParser circumvents manually designed post-processing techniques and surpasses state-of-the-art methods, achieving 49.3% AP on MHPv2.0 and 60.4% AP on CIHP. We will release our source code, pretrained models, and online demos to facilitate future studies.
Constrained Bayesian Optimization with Adaptive Active Learning of Unknown Constraints

Optimizing objectives under constraints, where both the objectives and constraints are black box functions, is a common scenario in real-world applications such as scientific experimental design, design of medical therapies, and industrial process optimization. One popular approach to handling these complex scenarios is Bayesian Optimization (BO). In terms of theoretical behavior, BO is relatively well understood in the unconstrained setting, where its principles have been well explored and validated. However, when it comes to constrained Bayesian optimization (CBO), the existing framework often relies on heuristics or approximations without the same level of theoretical guarantees. In this paper, we delve into the theoretical and practical aspects of constrained Bayesian optimization, where the objective and constraints can be independently evaluated and are subject to noise. By recognizing that both the objective and constraints can help identify high-confidence regions of interest (ROI), we propose an efficient CBO framework that intersects the ROIs identified from each aspect to determine the general ROI. The ROI, coupled with a novel acquisition function that adaptively balances the optimization of the objective and the identification of feasible regions, enables us to derive rigorous theoretical justifications for its performance. We showcase the efficiency and robustness of our proposed CBO framework through empirical evidence and discuss the fundamental challenge of deriving practical regret bounds for CBO algorithms.
Impact of hydraulic tortuosity on micro/nanoporous flow

Using the porous structures made up of homogeneously arranged solid obstacles, we examine the effects of rarefaction on the hydraulic tortuosity in the slip and early transition flow regimes via extended lattice Boltzmann method. We observed that modification in either the obstacle's arrangement or the porosity led to a power-law relation between the porosity-tortuosity. Along with this, we also found that in the slip flow regime, the exponent of this relation contains the effect of finite Knudsen number (Kn). In addition, we observed that on properly scaling Kn with porosity and hydraulic tortuosity, a generalized correlation can be obtained for apparent permeability.