Miracle-dz/UniFAR-FTUs huggingface dataset:
i-Rebalance: Personalized Vehicle Repositioning for Supply Demand Balance

Ride-hailing platforms have been facing the challenge of balancing demand and supply. Existing vehicle reposition techniques often treat drivers as homogeneous agents and relocate them deterministically, assuming compliance with the reposition. In this paper, we consider a more realistic and driver-centric scenario where drivers have unique cruising preferences and can decide whether to take the recommendation or not on their own. We propose i-Rebalance, a personalized vehicle reposition technique with deep reinforcement learning (DRL). i-Rebalance estimates drivers' decisions on accepting reposition recommendations through an on-field user study involving 99 real drivers. To optimize supply-demand balance and enhance preference satisfaction simultaneously, i-Rebalance has a sequential reposition strategy with dual DRL agents: Grid Agent to determine the reposition order of idle vehicles, and Vehicle Agent to provide personalized recommendations to each vehicle in the pre-defined order. This sequential learning strategy facilitates more effective policy training within a smaller action space compared to traditional joint-action methods. Evaluation of real-world trajectory data shows that i-Rebalance improves driver acceptance rate by 38.07% and total driver income by 9.97%.
SiN-on-SOI Optical Phased Array LiDAR for Ultra-Wide Field of View and 4D Sensing

Three-dimensional (3D) imaging techniques are facilitating the autonomous vehicles to build intelligent system. Optical phased arrays (OPAs) featured by all solid-state configurations are becoming a promising solution for 3D imaging. However, majority of state-of-art OPAs commonly suffer from severe power degradation at the edge of field of view (FoV), resulting in limited effective FoV and deteriorating 3D imaging quality. Here, we synergize chained grating antenna and vernier concept to design a novel OPA for realizing a record wide 160{\deg}-FoV 3D imaging. By virtue of the chained antenna, the OPA exhibits less than 3-dB beam power variation within the 160{\deg} FoV. In addition, two OPAs with different pitch are integrated monolithically to form a quasi-coaxial Vernier OPA transceiver. With the aid of flat beam power profile provided by the chained antennas, the OPA exhibits uniform beam quality at an arbitrary steering angle. The superior beam steering performance enables the OPA to accomplish 160{\deg} wide-FoV 3D imaging based on the frequency-modulated continuous-wave (FMCW) LiDAR scheme. The ranging accuracy is 5.5-mm. Moreover, the OPA is also applied to velocity measurement for 4D sensing. To our best knowledge, it is the first experimental implementation of a Vernier OPA LiDAR on 3D imaging to achieve a remarkable FoV.
MobileAgent: enhancing mobile control via human-machine interaction and SOP integration

Agents centered around Large Language Models (LLMs) are now capable of automating mobile device operations for users. After fine-tuning to learn a user's mobile operations, these agents can adhere to high-level user instructions online. They execute tasks such as goal decomposition, sequencing of sub-goals, and interactive environmental exploration, until the final objective is achieved. However, privacy concerns related to personalized user data arise during mobile operations, requiring user confirmation. Moreover, users' real-world operations are exploratory, with action data being complex and redundant, posing challenges for agent learning. To address these issues, in our practical application, we have designed interactive tasks between agents and humans to identify sensitive information and align with personalized user needs. Additionally, we integrated Standard Operating Procedure (SOP) information within the model's in-context learning to enhance the agent's comprehension of complex task execution. Our approach is evaluated on the new device control benchmark AitW, which encompasses 30K unique instructions across multi-step tasks, including application operation, web searching, and web shopping. Experimental results show that the SOP-based agent achieves state-of-the-art performance in LLMs without incurring additional inference costs, boasting an overall action success rate of 66.92\%. The code and data examples are available at https://github.com/alipay/mobile-agent.
Minimal criteria for continuous-variable genuine multipartite entanglement

We derive a set of genuine multi-mode entanglement criteria for second moments of the quadrature operators. The criteria have a common form of the uncertainty relation between sums of variances of position and momentum quadrature combinations. A unique feature of the criteria is that the sums contain the least possible number of variances of at most two-mode combinations. The number of second moments we need to know to apply the criteria thus scales only linearly with the number of modes, as opposed to the quadratic scaling of the already existing criteria. Each criterion is associated with a tree graph, which allowed us to develop a direct method of construction of the criteria based solely on the structure of the underlying tree. The practicality of the proposed criteria is demonstrated by finding a number of examples of Gaussian states of up to six modes, whose genuine multi-mode entanglement is detected by them. The designed criteria are particularly suitable for verification of genuine multipartite entanglement in large multi-mode states or when only a set of two-mode nearest-neighbour marginal covariance matrices of the investigated state is available.
Effects of latitude, longitude and altitude on angelica growth and early bolting in medicine formation period.

Based on field investigations of growth and early bolting rate of biennial angelica cultivated in 31 ecoregions of 4 counties of Gansu Province,the effects of altitude,longitude and latitude on angelica growth and early bolting at medicine formation period were investigated to provide theoretic evidence for determining Angelica planting ecoregion properly.Results showed significant geographical effects on both early bolting and growth of Angelica.Heteromorphosis was classified into following rank order: bolting rateplant heightleaf numbers.Plant height,leaf numbers and bolting rate had significantly negative correlations with altitude and longitude.However,all were significantly positive for latitude correlations.Multiple regression analysis showed that plant height,leaves and bolting rate had significant linear regression relationships with altitude.Results showed altitude as the main ecological factor influencing angelica growth and early bolting.Both height and bolting rate of angelica plants decreased significantly in high altitude areas.
Plasmoid formation and strong radiative cooling in a driven magnetic reconnection experiment

We present results from the first experimental study of strongly radiatively-cooled magnetic reconnection. Two exploding aluminum wire arrays, driven simultaneously by the Z machine ($I_{max} = 20 \, \text{MA}$, $t_{\text{rise}} = 300 \, \text{ns}$), generate a radiatively-cooled reconnection layer ($S_L \approx 120$) in which the total cooling rate exceeds the hydrodynamic transit rate ($\tau_{\text{hydro}}/\tau_{\text{cool}}>100$). Measurements of X-ray emission from the reconnection layer using a filtered diode ($>1$ keV) show a narrow (50 ns FWHM) burst of emission at 220 ns after current start, consistent with the formation and subsequent rapid cooling of the reconnection layer. Time-gated X-ray images of the reconnection layer show fast-moving (up to 50 km/s) hotspots inside the layer, consistent with the presence of plasmoids observed in 3D resistive magnetohydrodynamic simulations. X-ray spectroscopy shows that these hotspots generate the majority of Al K-shell emission (at around 1.6 keV) prior to the onset of cooling, and exhibit temperatures of 170 eV, much greater than the temperature of the plasma inflows and the rest of the reconnection layer.
FTLE for Flow Ensembles by Optimal Domain Displacement

FTLE (Finite Time Lyapunov Exponent) computation is one of the standard approaches to Lagrangian flow analysis. The main features of interest in FTLE fields are ridges that represent hyperbolic Lagrangian Coherent Structures. FTLE ridges tend to become sharp and crisp with increasing integration time, where the sharpness of the ridges is an indicator of the strength of separation. The additional consideration of uncertainty in flows leads to more blurred ridges in the FTLE fields. There are multiple causes for such blurred ridges: either the locations of the ridges are uncertain, or the strength of the ridges is uncertain, or there is low uncertainty but weak separation. Existing approaches for uncertain FTLE computation are unable to distinguish these different sources of uncertainty in the ridges. We introduce a new approach to define and visualize FTLE fields for flow ensembles. Before computing and comparing FTLE fields for the ensemble members, we compute optimal displacements of the domains to mutually align the ridges of the ensemble members as much as possible. We do so in a way that an explicit geometry extraction and alignment of the ridges is not necessary. The additional consideration of these displacements allows for a visual distinction between uncertainty in ridge location, ridge sharpness, and separation strength. We apply the approach to several synthetic and real ensemble data sets.
Secure Synthesis of Distributed Cryptographic Applications (Technical Report)

Developing secure distributed systems is difficult, and even harder when advanced cryptography must be used to achieve security goals. Following prior work, we advocate using secure program partitioning to synthesize cryptographic applications: instead of implementing a system of communicating processes, the programmer implements a centralized, sequential program, which is automatically compiled into a secure distributed version that uses cryptography. While this approach is promising, formal results for the security of such compilers are limited in scope. In particular, no security proof yet simultaneously addresses subtleties essential for robust, efficient applications: multiple cryptographic mechanisms, malicious corruption, and asynchronous communication. In this work, we develop a compiler security proof that handles these subtleties. Our proof relies on a novel unification of simulation-based security, information-flow control, choreographic programming, and sequentialization techniques for concurrent programs. While our proof targets hybrid protocols, which abstract cryptographic mechanisms as idealized functionalities, our approach offers a clear path toward leveraging Universal Composability to obtain end-to-end, modular security results with fully instantiated cryptographic mechanisms. Finally, following prior observations about simulation-based security, we prove that our result guarantees robust hyperproperty preservation, an important criterion for compiler correctness that preserves all source-level security properties in target programs.
UBfuzz: Finding Bugs in Sanitizer Implementations

In this paper, we propose a testing framework for validating sanitizer implementations in compilers. Our core components are (1) a program generator specifically designed for producing programs containing undefined behavior (UB), and (2) a novel test oracle for sanitizer testing. The program generator employs Shadow Statement Insertion, a general and effective approach for introducing UB into a valid seed program. The generated UB programs are subsequently utilized for differential testing of multiple sanitizer implementations. Nevertheless, discrepant sanitizer reports may stem from either compiler optimization or sanitizer bugs. To accurately determine if a discrepancy is caused by sanitizer bugs, we introduce a new test oracle called crash-site mapping. We have incorporated our techniques into UBfuzz, a practical tool for testing sanitizers. Over a five-month testing period, UBfuzz successfully found 31 bugs in both GCC and LLVM sanitizers. These bugs reveal the serious false negative problems in sanitizers, where certain UBs in programs went unreported. This research paves the way for further investigation in this crucial area of study.
Privacy-Preserving Sequential Recommendation with Collaborative Confusion

Sequential recommendation has attracted a lot of attention from both academia and industry, however the privacy risks associated to gathering and transferring users' personal interaction data are often underestimated or ignored. Existing privacy-preserving studies are mainly applied to traditional collaborative filtering or matrix factorization rather than sequential recommendation. Moreover, these studies are mostly based on differential privacy or federated learning, which often leads to significant performance degradation, or has high requirements for communication. In this work, we address privacy-preserving from a different perspective. Unlike existing research, we capture collaborative signals of neighbor interaction sequences and directly inject indistinguishable items into the target sequence before the recommendation process begins, thereby increasing the perplexity of the target sequence. Even if the target interaction sequence is obtained by attackers, it is difficult to discern which ones are the actual user interaction records. To achieve this goal, we propose a CoLlaborative-cOnfusion seqUential recommenDer, namely CLOUD, which incorporates a collaborative confusion mechanism to edit the raw interaction sequences before conducting recommendation. Specifically, CLOUD first calculates the similarity between the target interaction sequence and other neighbor sequences to find similar sequences. Then, CLOUD considers the shared representation of the target sequence and similar sequences to determine the operation to be performed: keep, delete, or insert. We design a copy mechanism to make items from similar sequences have a higher probability to be inserted into the target sequence. Finally, the modified sequence is used to train the recommender and predict the next item.
Exploring the Quenching of Bipolar Magnetic Region Tilts using AutoTAB

The tilt of the bipolar magnetic region (BMR) is crucial in the Babcock-Leighton process for the generation of the poloidal magnetic field in the Sun. We extend the work of Jha et al. (2020) and analyze the recently reported tracked BMR catalogue based on AutoTAB Sreedevi et al. (2023) from Michelson Doppler Imager (1996-2011) and Helioseismic and Magnetic Imager (2010-2018). Using the tracked information of BMRs based on AutoTAB, we confirm that the distribution of bmax reported by Jha et al. (2020) is not because of the BMRs are picked multiple times at the different phases of their evolution instead it is also present if we consider each BMRs only once. Moreover, we find that the slope of Joy's law initially increases slowly with the increase of bmax. However, when bmax>2.5 kG, gamma_0 decreases. The decrease of observed $gamma_0$ with bmax provides a hint to a nonlinear tilt quenching in the Babcock-Leighton process.
Hypercomplex neural network in time series forecasting of stock data

The goal of this paper is to test three classes of neural network (NN) architectures based on four-dimensional (4D) hypercomplex algebras for time series prediction. We evaluate different architectures, varying the input layers to include convolutional, Long Short-Term Memory (LSTM), or dense hypercomplex layers for 4D algebras. Four related Stock Market time series are used as input data, with the prediction focused on one of them. Hyperparameter optimization for each architecture class was conducted to compare the best-performing neural networks within each class. The results indicate that, in most cases, architectures with hypercomplex dense layers achieve similar Mean Absolute Error (MAE) accuracy compared to other architectures, but with significantly fewer trainable parameters. Consequently, hypercomplex neural networks demonstrate the ability to learn and process time series data faster than the other tested architectures. Additionally, it was found that the ordering of the input time series have a notable impact on effectiveness.
Meta-forests: Domain generalization on random forests with meta-learning

Domain generalization is a popular machine learning technique that enables models to perform well on the unseen target domain, by learning from multiple source domains. Domain generalization is useful in cases where data is limited, difficult, or expensive to collect, such as in object recognition and biomedicine. In this paper, we propose a novel domain generalization algorithm called"meta-forests", which builds upon the basic random forests model by incorporating the meta-learning strategy and maximum mean discrepancy measure. The aim of meta-forests is to enhance the generalization ability of classifiers by reducing the correlation among trees and increasing their strength. More specifically, meta-forests conducts meta-learning optimization during each meta-task, while also utilizing the maximum mean discrepancy as a regularization term to penalize poor generalization performance in the meta-test process. To evaluate the effectiveness of our algorithm, we test it on two publicly object recognition datasets and a glucose monitoring dataset that we have used in a previous study. Our results show that meta-forests outperforms state-of-the-art approaches in terms of generalization performance on both object recognition and glucose monitoring datasets.
Learn Once Plan Arbitrarily (LOPA): Attention-Enhanced Deep Reinforcement Learning Method for Global Path Planning

Deep reinforcement learning (DRL) methods have recently shown promise in path planning tasks. However, when dealing with global planning tasks, these methods face serious challenges such as poor convergence and generalization. To this end, we propose an attention-enhanced DRL method called LOPA (Learn Once Plan Arbitrarily) in this paper. Firstly, we analyze the reasons of these problems from the perspective of DRL's observation, revealing that the traditional design causes DRL to be interfered by irrelevant map information. Secondly, we develop the LOPA which utilizes a novel attention-enhanced mechanism to attain an improved attention capability towards the key information of the observation. Such a mechanism is realized by two steps: (1) an attention model is built to transform the DRL's observation into two dynamic views: local and global, significantly guiding the LOPA to focus on the key information on the given maps; (2) a dual-channel network is constructed to process these two views and integrate them to attain an improved reasoning capability. The LOPA is validated via multi-objective global path planning experiments. The result suggests the LOPA has improved convergence and generalization performance as well as great path planning efficiency.
Unbiased Atomistic Predictions of Crystal Dislocation Dynamics using Bayesian Force Fields

Crystal dislocation dynamics, especially at high temperatures, represents a subject where experimental phenomenological input is commonly required, and parameter-free predictions, starting from quantum methods, have been beyond reach. This is especially true for phenomena like stacking faults and dislocation cross-slip, which are computationally intractable with methods like density functional theory, as $\sim 10^5-10^6$ atoms are required to reliably simulate such systems. Hence, this work extends quantum-mechanical accuracy to mesoscopic molecular dynamics simulations and opens unprecedented possibilities in material design for extreme mechanical conditions with direct atomistic insight at the deformation mesoscale. To accomplish this, we construct a Bayesian machine-learned force field (MLFF) from ab initio quantum training data, enabling direct observations of high-temperature and high-stress dislocation dynamics in single-crystalline Cu with atomistic resolution. In doing so, a generalizable training protocol is developed for construction of MLFFs for dislocation kinetics, with wide-ranging applicability to other single element systems and alloys. The resulting FLARE MLFF provides excellent predictions of static bulk elastic properties, stacking fault widths and energies, dynamic evolutions and mobilities of edge and screw dislocations, as well as cross-slip energy barriers for screw dislocations, all of which are compared to available experimental measurements. This work marks the first reliable quantitative determination of dislocation mobilities and cross-slip barriers, demonstrating a substantial advancement over previous empirical and machine learned force field models.
Spatio-Temporal Turbulence Mitigation: A Translational Perspective

Recovering images distorted by atmospheric turbulence is a challenging inverse problem due to the stochastic nature of turbulence. Although numerous turbulence mitigation (TM) algorithms have been proposed, their efficiency and generalization to real-world dynamic scenarios remain severely limited. Building upon the intuitions of classical TM algorithms, we present the Deep Atmospheric TUrbulence Mitigation network (DATUM). DATUM aims to overcome major challenges when transitioning from classical to deep learning approaches. By carefully integrating the merits of classical multi-frame TM methods into a deep network structure, we demonstrate that DATUM can efficiently perform long-range temporal aggregation using a recurrent fashion, while deformable attention and temporal-channel attention seamlessly facilitate pixel registration and lucky imaging. With additional supervision, tilt and blur degradation can be jointly mitigated. These inductive biases empower DATUM to significantly outperform existing methods while delivering a tenfold increase in processing speed. A large-scale training dataset, ATSyn, is presented as a co-invention to enable generalization in real turbulence. Our code and datasets will be available at \href{https://xg416.github. io/DATUM}{\textcolor{pink}{https://xg416.github. io/DATUM}}
Spin current leakage and Onsager reciprocity in interfacial spin-charge interconversion

Experimental investigations of spin-charge interconversion in magnetic bilayers comprising a ferromagnet adjacent to a topological insulator have reported scattered results on the spin-charge and charge-spin conversion efficiency. Attempting to reconcile these contradicting experimental results, we develop a phenomenological theory of spin-charge interconversion accounting for both interfacial interconversion through the spin galvanic effect, also called the Rashba-Edelstein effect, as well as bulk interconversion via the spin Hall effect. We find that the spin current leakage into the nonmagnetic metal plays a central role during the spin-to-charge and charge-to-spin conversion, leading to dissymmetric interconversion processes. In particular, spin-to-charge conversion is much less sensitive to the spin current absorption in the nonmagnetic metal than charge-to-spin conversion. This suggests that spin pumping is a more trustable technique to extract the interfacial Rashba parameter than spin-orbit torque.
A semi-smooth Newton method for general projection equations applied to the nearest correlation matrix problem

In this paper, we extend and investigate the properties of the semi-smooth Newton method when applied to a general projection equation in finite dimensional spaces. We first present results concerning Clarke's generalized Jacobian of the projection onto a closed and convex cone. We then describe the iterative process for the general cone case and establish two convergence theorems. We apply these results to the constrained quadratic conic programming problem, emphasizing its connection to the projection equation. To illustrate the performance of our method, we conduct numerical experiments focusing on semidefinite least squares, in particular the nearest correlation matrix problem. In the latter scenario, we benchmark our outcomes against previous literature, presenting performance profiles and tabulated results for clarity and comparison.