Miracle-dz/UniFAR-FTUs huggingface dataset:
Buoyancy-driven attraction of active droplets.

For dissolving active oil droplets in an ambient liquid, it is generally assumed that the Marangoni effect results in repulsive interactions, while the buoyancy effects caused by the density difference between the droplets, diffusing product and the ambient fluid are usually neglected. However, it has been observed in recent experiments that active droplets can form clusters due to buoyancy-driven convection (Krüger et al. Eur. Phys. J. E, vol. 39, 2016, pp. 1-9). In this study, we numerically analyze the buoyancy effect, in addition to the propulsion caused by Marangoni flow (with its strength characterized by Péclet number Pe). The buoyancy effects have their origin in (i) the density difference between the droplet and the ambient liquid, which is characterized by Galileo number Ga, and (ii) the density difference between the diffusing product (i.e. filled micelles) and the ambient liquid, which can be quantified by a solutal Rayleigh number Ra. We analyze how the attracting and repulsing behaviour of neighbouring droplets depends on the control parameters Pe, Ga, and Ra. We find that while the Marangoni effect leads to the well-known repulsion between the interacting droplets, the buoyancy effect of the reaction product leads to buoyancy-driven attraction. At sufficiently large Ra, even collisions between the droplets can take place. Our study on the effect of Ga further shows that with increasing Ga, the collision becomes delayed. Moreover, we derive that the attracting velocity of the droplets, which is characterized by a Reynolds number Red, is proportional to Ra1/4/(ℓ/R), where ℓ/R is the distance between the neighbouring droplets normalized by the droplet radius. Finally, we numerically obtain the repulsive velocity of the droplets, characterized by a Reynolds number Rerep, which is proportional to PeRa-0.38. The balance of attractive and repulsive effect leads to Pe ~ Ra0.63, which agrees well with the transition curve between the regimes with and without collision.
Dirichlet-based Uncertainty Calibration for Active Domain Adaptation

Active domain adaptation (DA) aims to maximally boost the model adaptation on a new target domain by actively selecting limited target data to annotate, whereas traditional active learning methods may be less effective since they do not consider the domain shift issue. Despite active DA methods address this by further proposing targetness to measure the representativeness of target domain characteristics, their predictive uncertainty is usually based on the prediction of deterministic models, which can easily be miscalibrated on data with distribution shift. Considering this, we propose a \textit{Dirichlet-based Uncertainty Calibration} (DUC) approach for active DA, which simultaneously achieves the mitigation of miscalibration and the selection of informative target samples. Specifically, we place a Dirichlet prior on the prediction and interpret the prediction as a distribution on the probability simplex, rather than a point estimate like deterministic models. This manner enables us to consider all possible predictions, mitigating the miscalibration of unilateral prediction. Then a two-round selection strategy based on different uncertainty origins is designed to select target samples that are both representative of target domain and conducive to discriminability. Extensive experiments on cross-domain image classification and semantic segmentation validate the superiority of DUC.
Comparing Sentence-Level Suggestions to Message-Level Suggestions in AI-Mediated Communication

Traditionally, writing assistance systems have focused on short or even single-word suggestions. Recently, large language models like GPT-3 have made it possible to generate significantly longer natural-sounding suggestions, offering more advanced assistance opportunities. This study explores the trade-offs between sentence- vs. message-level suggestions for AI-mediated communication. We recruited 120 participants to act as staffers from legislators’ offices who often need to respond to large volumes of constituent concerns. Participants were asked to reply to emails with different types of assistance. The results show that participants receiving message-level suggestions responded faster and were more satisfied with the experience, as they mainly edited the suggested drafts. In addition, the texts they wrote were evaluated as more helpful by others. In comparison, participants receiving sentence-level assistance retained a higher sense of agency, but took longer for the task as they needed to plan the flow of their responses and decide when to use suggestions. Our findings have implications for designing task-appropriate communication assistance systems.
Knowledge Graph Completion with Counterfactual Augmentation

Graph Neural Networks (GNNs) have demonstrated great success in Knowledge Graph Completion (KGC) by modeling how entities and relations interact in recent years. However, most of them are designed to learn from the observed graph structure, which appears to have imbalanced relation distribution during the training stage. Motivated by the causal relationship among the entities on a knowledge graph, we explore this defect through a counterfactual question: “would the relation still exist if the neighborhood of entities became different from observation? ”. With a carefully designed instantiation of a causal model on the knowledge graph, we generate the counterfactual relations to answer the question by regarding the representations of entity pair given relation as context, structural information of relation-aware neighborhood as treatment, and validity of the composed triplet as the outcome. Furthermore, we incorporate the created counterfactual relations with the GNN-based framework on KGs to augment their learning of entity pair representations from both the observed and counterfactual relations. Experiments on benchmarks show that our proposed method outperforms existing methods on the task of KGC, achieving new state-of-the-art results. Moreover, we demonstrate that the proposed counterfactual relations-based augmentation also enhances the interpretability of the GNN-based framework through the path interpretations of predictions.
Multi-Modality in Music: Predicting Emotion in Music from High-Level Audio Features and Lyrics

This paper aims to test whether a multi-modal approach for music emotion recognition (MER) performs better than a uni-modal one on high-level song features and lyrics. We use 11 song features retrieved from the Spotify API, combined lyrics features including sentiment, TF-IDF, and Anew to predict valence and arousal (Russell, 1980) scores on the Deezer Mood Detection Dataset (DMDD) (Delbouys et al., 2018) with 4 different regression models. We find that out of the 11 high-level song features, mainly 5 contribute to the performance, multi-modal features do better than audio alone when predicting valence. We made our code publically available.
Improving Fairness in Information Exposure by Adding Links

Fairness in influence maximization has been a very active research topic recently. Most works in this context study the question of how to find seeding strategies (deterministic or probabilistic) such that nodes or communities in the network get their fair share of coverage. Different fairness criteria have been used in this context. All these works assume that the entity that is spreading the information has an inherent interest in spreading the information fairly, otherwise why would they want to use the developed fair algorithms? This assumption may however be flawed in reality -- the spreading entity may be purely efficiency-oriented. In this paper we propose to study two optimization problems with the goal to modify the network structure by adding links in such a way that efficiency-oriented information spreading becomes automatically fair. We study the proposed optimization problems both from a theoretical and experimental perspective, that is, we give several hardness and hardness of approximation results, provide efficient algorithms for some special cases, and more importantly provide heuristics for solving one of the problems in practice. In our experimental study we then first compare the proposed heuristics against each other and establish the most successful one. In a second experiment, we then show that our approach can be very successful in practice. That is, we show that already after adding a few edges to the networks the greedy algorithm that purely maximizes spread surpasses all fairness-tailored algorithms in terms of ex-post fairness. Maybe surprisingly, we even show that our approach achieves ex-post fairness values that are comparable or even better than the ex-ante fairness values of the currently most efficient algorithms that optimize ex-ante fairness.
Suspension Analysis and Selective Continuation-Passing Style for Higher-Order Probabilistic Programming Languages

Probabilistic programming languages (PPLs) make encoding and automatically solving statistical inference problems relatively easy by separating models from the inference algorithm. A popular choice for solving inference problems is to use Monte Carlo inference algorithms. For higher-order functional PPLs, these inference algorithms rely on execution suspension to perform inference, most often enabled through a full continuation-passing style (CPS) transformation. However, standard CPS transformations for PPL compilers introduce significant overhead, a problem the community has generally overlooked. State-of-the-art solutions either perform complete CPS transformations with performance penalties due to unnecessary closure allocations or use efficient, but complex, low-level solutions that are often not available in high-level languages. In contrast to prior work, we develop a new approach that is both efficient and easy to implement using higher-order languages. Specifically, we design a novel static suspension analysis technique that determines the parts of a program that require suspension, given a particular inference algorithm. The analysis result allows selectively CPS transforming the program only where necessary. We formally prove the correctness of the suspension analysis and implement both the suspension analysis and selective CPS transformation in the Miking CorePPL compiler. We evaluate the implementation for a large number of Monte Carlo inference algorithms on real-world models from phylogenetics, epidemiology, and topic modeling. The evaluation results demonstrate significant improvements across all models and inference algorithms.
Autonomous Search of Semantic Objects in Unknown Environments

This paper addresses the problem of enabling a robot to search for a semantic object, i.e., an object with a semantic label, in an unknown and GPS-denied environment. For the robot in the unknown environment to detect and find the target semantic object, it must perform simultaneous localization and mapping (SLAM) at both geometric and semantic levels using its onboard sensors while planning and executing its motion based on the ever-updated SLAM results. In other words, the robot must be able to conduct simultaneous localization, semantic mapping, motion planning, and execution in real-time in the presence of sensing and motion uncertainty. This is an open problem as it combines semantic SLAM based on perception and real-time motion planning and execution under uncertainty. Moreover, the goals of the robot motion change on the fly depending on whether and how the robot can detect the target object. We propose a novel approach to tackle the problem, leveraging semantic SLAM, Bayesian Networks, Markov Decision Process, and Real-Time Dynamic Programming. The results in simulation and real experiments demonstrate the effectiveness and efficiency of our approach.
Nonreciprocal slow or fast light in anti-$\mathcal{PT}$-symmetric optomechanics

Non-Hermitian systems with anti-parity-time ($\mathcal{APT}$) symmetry have revealed rich physics beyond conventional systems. Here, we study optomechanics in an $\mathcal{APT}$-symmetric spinning resonator and show that, by tuning the rotating speed to approach the exceptional point (EP) or the non-Hermitian spectral degeneracy, nonreciprocal light transmission with a high isolation ratio can be realized. Accompanying this process, nonreciprocal group delay or advance is also identified in the vicinity of EP. Our work sheds new light on manipulating laser propagation with optomechanical EP devices and, in a broader view, can be extended to explore a wide range of $\mathcal{APT}$-symmetric effects, such as $\mathcal{APT}$-symmetric phonon lasers, $\mathcal{APT}$-symmetric topological effects, and $\mathcal{APT}$-symmetric force sensing or accelerator.
A batch least squares lattice algorithm

A fast square root batch least squares algorithm for autoregressive model structures that requires only seven floating point operations per sample per estimated parameter is derived. Memory requirements, as well as the number of floating point operations, are of order n, where n is the model order. The method is based on estimation of the top block row of the QR transform of the data regression matrix. This is used to derive the parameters using an order-recursive lattice algorithm, after all samples have been processed. <<ETX>>
Winning through Collaboration by Applying Federated Learning in Manufacturing Industry

In manufacturing settings, data collection and analysis is often a time-consuming, challenging, and costly process. It also hinders the use of advanced machine learning and data-driven methods which requires a substantial amount of offline training data to generate good results. It is particularly challenging for small manufacturers who do not share the resources of a large enterprise. Recently, with the introduction of the Internet of Things (IoT), data can be collected in an integrated manner across the factory in real-time, sent to the cloud for advanced analysis, and used to update the machine learning model sequentially. Nevertheless, small manufacturers face two obstacles in reaping the benefits of IoT: they may be unable to afford or generate enough data to operate a private cloud, and they may be hesitant to share their raw data with a public cloud. Federated learning (FL) is an emerging concept of collaborative learning that can help small-scale industries address these issues and learn from each other without sacrificing their privacy. It can bring together diverse and geographically dispersed manufacturers under the same analytics umbrella to create a win-win situation. However, the widespread adoption of FL across multiple manufacturing organizations remains a significant challenge. This work aims to identify and illustrate these challenges and provide potential solutions to overcome them.
Impact of reconstruction schemes on interpreting lattice Boltzmann results -- A study using the Taylor-Green vortex problem

In this note, we show how reconstruction schemes can have a significant impact on interpreting lattice Boltzmann simulation data. To reconstruct turbulence quantities, e.g., the kinetic energy dissipation rate and enstrophy, schemes higher than second-order for spatial derivatives can greatly improve the prediction of these quantities in the Taylor-Green vortex problem. In contrast, a second-order reconstruction of the time series data indicates very good accuracy for the kinetic energy dissipation rate. The present findings can be considered as further numerical evidence of the capability of the lattice Boltzmann method to simulate turbulent flows, which is consistent with its proven feature of low numerical diffusion.
First-principles based semi-classical model for transport in magnetic layered structures

We present a first principles based semiclassical model for transport in an inhomogeneous magnetic layered structure. The approach solves the Boltzmann transport equation using the band structure, Bloch wave velocities and scattering matrices, describing the reflection and transmission of Bloch waves from interfaces, derived from ab-initio local spin density electronic structure calculations. The model has been tested for thick Co and Cu films as well as for a set of Co/Cu/Co spin valves.
Reinforcement Learning based Autonomous Multi-Rotor Landing on Moving Platforms

Multi-rotor UAVs suffer from a restricted range and flight duration due to limited battery capacity. Autonomous landing on a 2D moving platform offers the possibility to replenish batteries and offload data, thus increasing the utility of the vehicle. Classical approaches rely on accurate, complex and difficult-to-derive models of the vehicle and the environment. Reinforcement learning (RL) provides an attractive alternative due to its ability to learn a suitable control policy exclusively from data during a training procedure. However, current methods require several hours to train, have limited success rates and depend on hyperparameters that need to be tuned by trial-and-error. We address all these issues in this work. First, we decompose the landing procedure into a sequence of simpler, but similar learning tasks. This is enabled by applying two instances of the same RL based controller trained for 1D motion for controlling the multi-rotor's movement in both the longitudinal and the lateral direction. Second, we introduce a powerful state space discretization technique that is based on i) kinematic modeling of the moving platform to derive information about the state space topology and ii) structuring the training as a sequential curriculum using transfer learning. Third, we leverage the kinematics model of the moving platform to also derive interpretable hyperparameters for the training process that ensure sufficient maneuverability of the multi-rotor vehicle. The training is performed using the tabular RL method Double Q-Learning. Through extensive simulations we show that the presented method significantly increases the rate of successful landings, while requiring less training time compared to other deep RL approaches. Finally, we deploy and demonstrate our algorithm on real hardware. For all evaluation scenarios we provide statistics on the agent's performance.
Topological or not? A unified pattern description in the one-dimensional anisotropic quantum XY model with a transverse field

The nature of phase transitions involving the questions why and how phase transitions take place has not been sufficiently touched in the literature. In contrast, the current attention to certain extent still focus on the description of critical phenomena and the classification of the associated phase transition along with the Ginzburg-Landau-Wilson paradigm, where the key issue is to identify phenomenologically order parameters and related symmetries. This brings the question to topological phase transitions (TPTs), where no obvious order parameter and the broken symmetry are identified. Here we present a unified pattern description of the second-order quantum phase transition (QPT) and TPT, both involved in the one-dimensional anisotropic quantum XY model in a transverse field, which contains the transverse Ising model (TIM) as a limit case. Away from the TIM, the XY model enters the ferromagnetic phase (marked by a second-order QPT or a direct TPT) as increasing ferromagentic exchange coupling, a series of TPTs occur, which are absent in the TIM. The TPTs behave like the first-order QPTs. In the isotropic and large exchange coupling cases, the ground state of the XY model is dominated by two topologically different vortices along positive and negative direction of the transverse field. We confirm the above conclusion by analyzing the energy contributions of the patterns to the ground state and calculating the ground state pattern occupations of the XY model. The results have been obtained in a unified and self-evident way and answer the questions why and how the QPT and TPTs take place in the XY model.
PDIWS: Thermal Imaging Dataset for Person Detection in Intrusion Warning Systems

In this paper, we present a synthetic thermal imaging dataset for Person Detection in Intrusion Warning Systems (PDIWS). The dataset consists of a training set with 2000 images and a test set with 500 images. Each image is synthesized by compounding a subject (intruder) with a background using the modified Poisson image editing method. There are a total of 50 different backgrounds and nearly 1000 subjects divided into five classes according to five human poses: creeping, crawling, stooping, climbing and other. The presence of the intruder will be confirmed if the first four poses are detected. Advanced object detection algorithms have been implemented with this dataset and give relatively satisfactory results, with the highest mAP values of 95.5% and 90.9% for IoU of 0.5 and 0.75 respectively. The dataset is freely published online for research purposes at https://github.com/thuan-researcher/Intruder-Thermal-Dataset.
Diagonally Square Root Integrable Kernels in System Identification

In recent years, the reproducing kernel Hilbert space (RKHS) theory has played a crucial role in linear system identification. The core of a RKHS is the associated kernel characterizing its properties. Accordingly, this work studies the class of diagonally square root integrable (DSRI) kernels. We demonstrate that various well-known stable kernels introduced in system identification belong to this category. Moreover, it is shown that any DSRI kernel is also stable and integrable. We look into certain topological features of the RKHSs associated with DSRI kernels, particularly the continuity of linear operators defined on the respective RKHSs. For the stability of a Gaussian process centered at a stable impulse response, we show that the necessary and sufficient condition is the diagonally square root integrability of the corresponding kernel. Furthermore, we elaborate on this result by providing proper interpretations.
Self-supervised and supervised deep learning for PET image reconstruction

A unified self-supervised and supervised deep learning framework for PET image reconstruction is presented, including deep-learned filtered backprojection (DL-FBP) for sinograms, deep-learned backproject then filter (DL-BPF) for backprojected images, and a more general mapping using a deep network in both the sinogram and image domains (DL-FBP-F). The framework allows varying amounts and types of training data, from the case of having only one single dataset to reconstruct through to the case of having numerous measured datasets, which may or may not be paired with high-quality references. For purely self-supervised mappings, no reference or ground truth data are needed. The self-supervised deep-learned reconstruction operators all use a conventional image reconstruction objective within the loss function (e.g. maximum Poisson likelihood, maximum a posteriori). If it is desired for the reconstruction networks to generalise (i.e. to need either no or minimal retraining for a new measured dataset, but to be fast, ready to reuse), then these self-supervised networks show potential even when previously trained from just one single dataset. For any given new measured dataset, finetuning is however often necessary, and of course the initial training set should ideally go beyond just one dataset if a generalisable network is sought. Example results for the purely self-supervised single-dataset case are shown, but the networks can be i) trained uniquely for any measured dataset to reconstruct from, ii) pretrained on multiple datasets and then used with no retraining for new measured data, iii) pretrained and then finetuned for new measured data, iv) optionally trained with high-quality references. The framework, with its optional inclusion of supervised learning, provides a spectrum of reconstruction approaches by making use of whatever (if any) training data quantities and types are available.