Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
47works
0followers
34topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

47 published item(s)

preprint2026arXiv

AOT-POT: Adaptive Operator Transformation for Large-Scale PDE Pre-training

Pre-training neural operators on diverse partial differential equation (PDE) datasets has emerged as a promising direction for building general-purpose surrogate models in scientific machine learning. However, the inherent complexity and structural diversity of PDE solution operators make multi-PDE pre-training fundamentally challenging. Existing methods mainly address this by increasing model capacity, while leaving the target solution operators unchanged. Inspired by classical numerical analysis, we instead propose to transform complex and diverse solution operators into simpler, better-aligned forms that are easier to model jointly. Since the optimal transformation varies across PDE types, it must be adaptive and input-dependent, allowing a single neural operator to approximate an entire family of operators. We instantiate this idea as AOT-POT (adaptive operator-transformation for pre-training operator transformer), which expands hidden representations into multiple parallel streams, adaptively aggregates and redistributes them before and after each sub-layer, and mixes streams through Sinkhorn-projected doubly stochastic matrices for stable training. These mechanisms together reshape diverse solution operators into a unified form that can be effectively modeled by a single architecture. Empirically, AOT-POT achieves state-of-the-art performance on 12 PDE benchmarks with only 3\% additional parameters, reducing relative L2 error by up to 77.6\% (40.9\% on average). Fine-tuning AOT-POT further reduces L2 error by up to 92\% on in-domain PDEs and 89\% on out-of-domain PDEs (unseen types during pre-training), demonstrating that adaptive operator transformation is an effective and complementary direction for advancing PDE foundation models beyond simply scaling model capacity.

preprint2026arXiv

DeepSight: Long-Horizon World Modeling via Latent States Prediction for End-to-End Autonomous Driving

End-to-end autonomous driving systems are increasingly integrating Vision-Language Model (VLM) architectures, incorporating text reasoning or visual reasoning to enhance the robustness and accuracy of driving decisions. However, the reasoning mechanisms employed in most methods are direct adaptations from general domains, lacking in-depth exploration tailored to autonomous driving scenarios, particularly within visual reasoning modules. In this paper, we propose a driving world model that performs parallel prediction of latent semantic features for consecutive future frames in the bird's-eye-view (BEV) space, thereby enabling long-horizon modeling of future world states. We also introduce an efficient and adaptive text reasoning mechanism that utilizes additional social knowledge and reasoning capabilities to further improve driving performance in challenging long-tail scenarios. We present a novel, efficient, and effective approach that achieves state-of-the-art (SOTA) results on the closed-loop Bench2drive benchmark. Codes are available at: https://github.com/hotdogcheesewhite/DeepSight.

preprint2026arXiv

GAPO: Robust Advantage Estimation for Real-World Code LLMs

Reinforcement learning (RL) is widely used for post-training large language models (LLMs) in code editing, where group-relative methods, such as GRPO, are popular due to their critic-free and normalized advantage estimation. However, in real-world code-editing scenarios, reward distributions are often skewed with unpredictable noise, leading to distorted advantage computation and increased rollout outliers. To address this issue, we propose Group Adaptive Policy Optimization (GAPO), which adaptively finds an interval with the highest SNR (Signal to Noise Ratio) per prompt and uses the median of that interval as an adaptive Q to replace the group mean in advantage calculation to reduce noise further. This adaptive Q robustly handles rollout noise while remaining plug-and-play and efficient. We evaluate GAPO on nine instruction-tuned LLMs (3B-14B) using a collected large dataset of 51,844 real-world, history-aware code-editing tasks spanning 10 programming languages. GAPO yields up to 4.35 in-domain (ID) and 5.30 out-of-domain (OOD) exact-match improvements over GRPO and its variant DAPO, while achieving lower clipping ratios and higher GPU throughput. Code: https://github.com/TsingZ0/verl-GAPO.

preprint2026arXiv

PDEAgent-Bench: A Multi-Metric, Multi-Library Benchmark for PDE Solver Generation

PDE-to-solver code generation aims to automatically synthesize executable numerical solvers from partial differential equation (PDE) specifications. This task requires not only understanding the mathematical structure of PDEs, but also selecting appropriate discretization schemes and solver configurations, and correctly implementing the resulting formulations in finite-element method (FEM) libraries. Existing code generation benchmarks mainly evaluate syntactic correctness, or success on predefined test cases. To our knowledge, there is currently no publicly available benchmark specifically for PDE-to-solver code generation, and general-purpose code benchmarks do not fully capture the unique challenges of numerical PDE solution, such as ensuring solver accuracy, efficiency, and compatibility with professional FEM libraries. We introduce PDEAgent-Bench, to the best of our knowledge, the first multi-metric, multi-library benchmark for PDE-to-solver code generation. PDEAgent-Bench contains 645 instances across 6 mathematical categories and 11 PDE families, with common FEM libraries for DOLFINx, Firedrake, and deal.II. Each instance provides an agent-facing problem specification, a reference solution on a prescribed evaluation grid, and case-specific accuracy and runtime targets. PDEAgent-Bench adopts a staged evaluation framework in which generated solvers must sequentially pass executability, numerical accuracy, and computational efficiency checks. Experiments with representative LLMs and code agents show that models can often produce runnable code, but their pass rate drops substantially once accuracy and efficiency requirements are enforced. These results indicate that current agents remain limited in producing numerically reliable and efficient PDE solvers, and that PDEAgent-Bench provides a reproducible testbed grounded in the practical requirements of numerical PDE solving.

preprint2026arXiv

Volume-Consistent Kneading-Based Deformation Manufacturing for Material-Efficient Shaping

Conventional subtractive manufacturing inevitably involves material loss during geometric realization, while additive manufacturing still suffers from limitations in surface quality, process continuity, and productivity when fabricating complex geometries. To address these challenges, this paper proposes a volume-consistent kneading-based forming method for plastic materials, enabling continuous and controllable three-dimensional deformation under mass conservation. An integrated kneading-based manufacturing system is developed, in which geometry-aware kneading command generation, layer-wise kneading execution, and in-process point-cloud scanning are tightly coupled to form a closed-loop workflow of scanning, forming, and feedback compensation. Target geometries are analyzed through layer-wise point-cloud processing and classified into enveloping and non-enveloping types. Accordingly, an Envelope Shaping First strategy and a Similar Gradient Method are adopted to ensure stable material flow and continuous deformation. An RMSE-based compensation scheme is further introduced to correct systematic geometric deviations induced by elastic rebound and material redistribution. Experimental validation on five representative geometries demonstrates high geometric fidelity, with material utilization consistently exceeding 98%. The results indicate that kneading-based forming provides a promising alternative manufacturing paradigm for low-waste, customizable production.

preprint2026arXiv

WISE-Flow: Workflow-Induced Structured Experience for Self-Evolving Conversational Service Agents

Large language model (LLM)-based agents are widely deployed in user-facing services but remain error-prone in new tasks, tend to repeat the same failure patterns, and show substantial run-to-run variability. Fixing failures via environment-specific training or manual patching is costly and hard to scale. To enable self-evolving agents in user-facing service environments, we propose WISE-Flow, a workflow-centric framework that converts historical service interactions into reusable procedural experience by inducing workflows with prerequisite-augmented action blocks. At deployment, WISE-Flow aligns the agent's execution trajectory to retrieved workflows and performs prerequisite-aware feasibility reasoning to achieve state-grounded next actions. Experiments on ToolSandbox and $τ^2$-bench show consistent improvement across base models.

preprint2023arXiv

How Does Traffic Environment Quantitatively Affect the Autonomous Driving Prediction?

An accurate trajectory prediction is crucial for safe and efficient autonomous driving in complex traffic environments. In recent years, artificial intelligence has shown strong capabilities in improving prediction accuracy. However, its characteristics of inexplicability and uncertainty make it challenging to determine the traffic environmental effect on prediction explicitly, posing significant challenges to safety-critical decision-making. To address these challenges, this study proposes a trajectory prediction framework with the epistemic uncertainty estimation ability that outputs high uncertainty when confronting unforeseeable or unknown scenarios. The proposed framework is used to analyze the environmental effect on the prediction algorithm performance. In the analysis, the traffic environment is considered in terms of scenario features and shifts, respectively, where features are divided into kinematic features of a target agent, features of its surrounding traffic participants, and other features. In addition, feature correlation and importance analyses are performed to study the above features' influence on the prediction error and epistemic uncertainty. Further, a cross-dataset case study is conducted using multiple intersection datasets to investigate the impact of unavoidable distributional shifts in the real world on trajectory prediction. The results indicate that the deep ensemble-based method has advantages in improving prediction robustness and estimating epistemic uncertainty. The consistent conclusions are obtained by the feature correlation and importance analyses, including the conclusion that kinematic features of the target agent have relatively strong effects on the prediction error and epistemic uncertainty. Furthermore, the prediction failure caused by distributional shifts and the potential of the deep ensemble-based method are analyzed.

preprint2022arXiv

A Holistic Robust Motion Controller Framework for Autonomous Platooning

Safety is the foremost concern for autonomous platooning. The vehicle-to-vehicle (V2V) communication delay and the sudden appearance of obstacles will trigger the safety of the intended functionality (SOTIF) issues for autonomous platooning. This research proposes a holistic robust motion controller framework (MCF) for an intelligent and connected vehicle platoon system. The MCF utilizes a hierarchical structure to resolve the longitudinal string stability and the lateral control problem under the complex driving environment and time-varying communication delay. Firstly, the H-infinity feedback controller is developed to ensure the robustness of the platoon under time-varying communication delay in the upper-level coordination layer (UCL). The output from UCL will be delivered to the lower-level motion-planning layer (LML) as reference signals. Secondly, the model predictive control (MPC) algorithm is implemented in the LML to achieve multi-objective control, which comprehensively considers the reference signals, the artificial potential field, and multiple vehicle dynamics constraints. Furthermore, three critical scenarios are co-simulated for case studies, including platooning under time-varying communication delay, merging, and obstacle avoidance scenarios. The simulation results indicate that, compared with single-structure MPC, the proposed MCF can offer a better suppression on position error propagation, and get improvements on maximum position error in the three scenarios by $19.2\%$, $59.8\%$, and $15.3\%$, respectively. Last, the practicability and effectiveness of the proposed MCF are verified via hardware-in-the-loop experiment. The average conducting time of the proposed method on Speedgoat real-time target machine is 1.1 milliseconds, which meets the real-time requirements.

preprint2022arXiv

CAMO-MOT: Combined Appearance-Motion Optimization for 3D Multi-Object Tracking with Camera-LiDAR Fusion

3D Multi-object tracking (MOT) ensures consistency during continuous dynamic detection, conducive to subsequent motion planning and navigation tasks in autonomous driving. However, camera-based methods suffer in the case of occlusions and it can be challenging to accurately track the irregular motion of objects for LiDAR-based methods. Some fusion methods work well but do not consider the untrustworthy issue of appearance features under occlusion. At the same time, the false detection problem also significantly affects tracking. As such, we propose a novel camera-LiDAR fusion 3D MOT framework based on the Combined Appearance-Motion Optimization (CAMO-MOT), which uses both camera and LiDAR data and significantly reduces tracking failures caused by occlusion and false detection. For occlusion problems, we are the first to propose an occlusion head to select the best object appearance features multiple times effectively, reducing the influence of occlusions. To decrease the impact of false detection in tracking, we design a motion cost matrix based on confidence scores which improve the positioning and object prediction accuracy in 3D space. As existing multi-object tracking methods only consider a single category, we also propose to build a multi-category loss to implement multi-object tracking in multi-category scenes. A series of validation experiments are conducted on the KITTI and nuScenes tracking benchmarks. Our proposed method achieves state-of-the-art performance and the lowest identity switches (IDS) value (23 for Car and 137 for Pedestrian) among all multi-modal MOT methods on the KITTI test dataset. And our proposed method achieves state-of-the-art performance among all algorithms on the nuScenes test dataset with 75.3% AMOTA.

preprint2022arXiv

Context-Consistent Semantic Image Editing with Style-Preserved Modulation

Semantic image editing utilizes local semantic label maps to generate the desired content in the edited region. A recent work borrows SPADE block to achieve semantic image editing. However, it cannot produce pleasing results due to style discrepancy between the edited region and surrounding pixels. We attribute this to the fact that SPADE only uses an image-independent local semantic layout but ignores the image-specific styles included in the known pixels. To address this issue, we propose a style-preserved modulation (SPM) comprising two modulations processes: The first modulation incorporates the contextual style and semantic layout, and then generates two fused modulation parameters. The second modulation employs the fused parameters to modulate feature maps. By using such two modulations, SPM can inject the given semantic layout while preserving the image-specific context style. Moreover, we design a progressive architecture for generating the edited content in a coarse-to-fine manner. The proposed method can obtain context-consistent results and significantly alleviate the unpleasant boundary between the generated regions and the known pixels.

preprint2022arXiv

Designing thermal radiation metamaterials via hybrid adversarial autoencoder and Bayesian optimization

Designing thermal radiation metamaterials is challenging especially for problems with high degrees of freedom and complex objective. In this letter, we have developed a hybrid materials informatics approach which combines the adversarial autoencoder and Bayesian optimization to design narrowband thermal emitters at different target wavelengths. With only several hundreds of training data sets, new structures with optimal properties can be quickly figured out in a compressed 2-dimensional latent space. This enables the optimal design by calculating far less than 0.001\% of the total candidate structures, which greatly decreases the design period and cost. The proposed design framework can be easily extended to other thermal radiation metamaterials design with higher dimensional features.

preprint2022arXiv

Efficient Algorithms and Implementation of a Semiparametric Joint Model for Longitudinal and Competing Risks Data: With Applications to Massive Biobank Data

Semiparametric joint models of longitudinal and competing risks data are computationally costly and their current implementations do not scale well to massive biobank data. This paper identifies and addresses some key computational barriers in a semiparametric joint model for longitudinal and competing risks survival data. By developing and implementing customized linear scan algorithms, we reduce the computational complexities from $O(n^2)$ or $O(n^3)$ to $O(n)$ in various components including numerical integration, risk set calculation, and standard error estimation, where $n$ is the number of subjects. Using both simulated and real world biobank data, we demonstrate that these linear scan algorithms generate drastic speed-up of up to hundreds of thousands fold when $n>10^4$, sometimes reducing the run-time from days to minutes. We have developed an R-package, FastJM, based on the proposed algorithms for joint modeling of longitudinal and time-to-event data with and without competing risks, and made it publicly available on the Comprehensive R Archive Network (CRAN).

preprint2022arXiv

Enhancing thermoelectric properties of isotope graphene nanoribbons via machine learning guided manipulation of disordered antidots and interfaces

Structural manipulation at the nanoscale breaks the intrinsic correlations among different energy carrier transport properties, achieving high thermoelectric performance. However, the coupled multifunctional (phonon and electron) transport in the design of nanomaterials makes the optimization of thermoelectric properties challenging. Machine learning brings convenience to the design of nanostructures with large degree of freedom. Herein, we conducted comprehensive thermoelectric optimization of isotopic armchair graphene nanoribbons (AGNRs) with antidots and interfaces by combining Green's function approach with machine learning algorithms. The optimal AGNR with ZT of 0.894 by manipulating antidots was obtained at the interfaces of the aperiodic isotope superlattices, which is 5.69 times larger than that of the pristine structure. The proposed optimal structure via machine learning provides physical insights that the carbon-13 atoms tend to form a continuous interface barrier perpendicular to the carrier transport direction to suppress the propagation of phonons through isotope AGNRs. The antidot effect is more effective than isotope substitution in improving the thermoelectric properties of AGNRs. The proposed approach coupling energy carrier transport property analysis with machine learning algorithms offers highly efficient guidance on enhancing the thermoelectric properties of low-dimensional nanomaterials, as well as to explore and gain non-intuitive physical insights.

preprint2022arXiv

Geometric Reductions, Dynamics and Controls for Hamiltonian System with Symmetry

This is a survey article, from the viewpoint of the completeness of the Marsden- Weinstein reduction, to introduce briefly some recent developments of the symmetric reductions and Hamilton-Jacobi theory of the regular controlled Hamiltonian systems, the nonholonomic controlled Hamiltonian systems and the controlled magnetic Hamiltonian systems. These research reveal the deeply internal relationships of the geometrical structures of phase spaces, the nonholonomic constraint, the dynamical vector fields and the controls of these systems.

preprint2022arXiv

Hamilton-Jacobi Equations of Controlled Magnetic Hamiltonian System with Nonholonomic Constraint

In order to describe the impact of different geometric structures and constraints for the dynamics of a regular controlled Hamiltonian system, in this paper, we first define a kind of controlled magnetic Hamiltonian (CMH) system, and give a good expression of the dynamical vector field of the CMH system, such that we can describe the magnetic vanishing condition and the CMH-equivalence, and derive precisely the geometric constraint conditions of the magnetic symplectic form for the dynamical vector field of the CMH system, which are called the Type I and Type II of Hamilton-Jacobi equation. Secondly, we prove that the CMH-equivalence for the CMH systems leaves the solutions of corresponding to Hamilton-Jacobi equations invariant, if the associated magnetic Hamiltonian systems are equivalent. Thirdly, we consider the CMH system with nonholonomic constraint, and derive a distributional CMH system, which is determined by a non-degenerate distributional two-form induced from the magnetic symplectic form. Then we drive precisely two types of Hamilton-Jacobi equation for the distributional CMH system. Moreover, we generalize the above results for the nonholonomic reducible CMH system with symmetry, and prove two types of Hamilton-Jacobi theorems for the nonholonomic reduced distributional CMH system. These research works reveal the deeply internal relationships of the magnetic symplectic forms, the nonholonomic constraints, the dynamical vector fields and controls of the CMH systems.

preprint2022arXiv

Hamilton-Jacobi Equations of Nonholonomic Magnetic Hamiltonian Systems

In order to describe the impact of different geometric structures and constraints for the dynamics of a Hamiltonian system, in this paper, for a magnetic Hamiltonian system defined by a magnetic symplectic form, we first drive precisely the geometric constraint conditions of magnetic symplectic form for the magnetic Hamiltonian vector field.which are called the Type I and Type II of Hamilton-Jacobi equation. Secondly, for the magnetic Hamiltonian system with nonholonomic constraint, we first define a distributional magnetic Hamiltonian system, then derive its two types of Hamilton-Jacobi equation. Moreover, we generalize the above results to nonholonomic reducible magnetic Hamiltonian system with symmetry. We define a nonholonomic reduced distributional magnetic Hamiltonian system, and prove two types of Hamilton-Jacobi theorem. These research work reveal the deeply internal relationships of the magnetic symplectic structure, nonholonomic constraint, the distributional two-form, and the dynamical vector field of the nonholonomic magnetic Hamiltonian system.

preprint2022arXiv

Limitations of Language Models in Arithmetic and Symbolic Induction

Recent work has shown that large pretrained Language Models (LMs) can not only perform remarkably well on a range of Natural Language Processing (NLP) tasks but also start improving on reasoning tasks such as arithmetic induction, symbolic manipulation, and commonsense reasoning with increasing size of models. However, it is still unclear what the underlying capabilities of these LMs are. Surprisingly, we find that these models have limitations on certain basic symbolic manipulation tasks such as copy, reverse, and addition. When the total number of symbols or repeating symbols increases, the model performance drops quickly. We investigate the potential causes behind this phenomenon and examine a set of possible methods, including explicit positional markers, fine-grained computation steps, and LMs with callable programs. Experimental results show that none of these techniques can solve the simplest addition induction problem completely. In the end, we introduce LMs with tutor, which demonstrates every single step of teaching. LMs with tutor is able to deliver 100% accuracy in situations of OOD and repeating symbols, shedding new insights on the boundary of large LMs in induction.

preprint2022arXiv

Low-light Image Enhancement by Retinex Based Algorithm Unrolling and Adjustment

Motivated by their recent advances, deep learning techniques have been widely applied to low-light image enhancement (LIE) problem. Among which, Retinex theory based ones, mostly following a decomposition-adjustment pipeline, have taken an important place due to its physical interpretation and promising performance. However, current investigations on Retinex based deep learning are still not sufficient, ignoring many useful experiences from traditional methods. Besides, the adjustment step is either performed with simple image processing techniques, or by complicated networks, both of which are unsatisfactory in practice. To address these issues, we propose a new deep learning framework for the LIE problem. The proposed framework contains a decomposition network inspired by algorithm unrolling, and adjustment networks considering both global brightness and local brightness sensitivity. By virtue of algorithm unrolling, both implicit priors learned from data and explicit priors borrowed from traditional methods can be embedded in the network, facilitate to better decomposition. Meanwhile, the consideration of global and local brightness can guide designing simple yet effective network modules for adjustment. Besides, to avoid manually parameter tuning, we also propose a self-supervised fine-tuning strategy, which can always guarantee a promising performance. Experiments on a series of typical LIE datasets demonstrated the effectiveness of the proposed method, both quantitatively and visually, as compared with existing methods.

preprint2022arXiv

Nonholonomic Controlled Hamiltonian System: Symmetric Reduction and Hamilton-Jacobi Equations

In order to describe the impact of nonholonomic constraints for the dynamics of a regular controlled Hamiltonian (RCH) system, in this paper, for an RCH system with nonholonomic constraint, we first derive its distributional RCH system, by analyzing carefully the structure of dynamical vector field of the nonholonomic RCH system. Secondly, we derive precisely the geometric constraint conditions of the induced distributional two-form for the dynamical vector field of the distributional RCH system, which are called the Type I and Type II of Hamilton-Jacobi equations. Thirdly, we generalize the above results for the nonholonomic reducible RCH system with symmetry, and prove two types of Hamilton-Jacobi theorems for the nonholonomic reduced distributional RCH system. Moreover, we consider the nonholonomic reducible RCH system with momentum map, by combining with the regular point and regular orbit reduction theory and the analysis of dynamics of RCH system, we give the geometric formulations of the nonholonomic regular point reduced and orbit reduced distributional RCH systems, and prove two types of Hamilton-Jacobi theorems for these reduced distributional RCH systems. These researches reveal the deeply internal relationships of the nonholonomic constraints, the induced (resp. reduced) distributional two-forms, the dynamical vector fields and controls of the nonholonomic RCH system and its (reduced) distributional RCH systems.

preprint2022arXiv

Predicting Kidney Transplant Survival using Multiple Feature Representations for HLAs

Kidney transplantation can significantly enhance living standards for people suffering from end-stage renal disease. A significant factor that affects graft survival time (the time until the transplant fails and the patient requires another transplant) for kidney transplantation is the compatibility of the Human Leukocyte Antigens (HLAs) between the donor and recipient. In this paper, we propose 4 new biologically-relevant feature representations for incorporating HLA information into machine learning-based survival analysis algorithms. We evaluate our proposed HLA feature representations on a database of over 100,000 transplants and find that they improve prediction accuracy by about 1%, modest at the patient level but potentially significant at a societal level. Accurate prediction of survival times can improve transplant survival outcomes, enabling better allocation of donors to recipients and reducing the number of re-transplants due to graft failure with poorly matched donors.

preprint2022arXiv

Quantum cosmology of the flat universe via closed real-time path integral

Quantum cosmology is crucial to understand the evolution of the early universe. Despite significant progress, challenges still remain. For example, the role of time in quantum cosmology is unclear. Furthermore, the influence of the environment on the evolution of the quantum universe is challenging. In this work, we studied the evolution of the quantum universe non-perturbatively using the closed real-time path integral. The environments coupled to the quantum universe being considered are the radiation, the non-relativistic matter, or the dark matter. We evaluated the influence functional of the massless scalar field coupled with the flat FRW universe. We studied the evolution of the quantum universe by setting the initial state of spacetime as a Gaussian wave packet. In different scenarios, we show that the classical trajectory of the universe is consistent with the quantum evolution of the wave packet. The coherence, the absolute quantum fluctuation and the Gibbs entropy all monotonically increase with time, yet the relative quantum fluctuation decreases with time. We show that for a given size of the radiation dominated universe, the lower temperature corresponds to a more quantum universe. We find that the minimal coupling of the free massless scalar field with the flat FRW spacetime generally gives rise to the memory characterized via non-Markovian correlations. Finally, we show that under higher radiation temperatures, a small universe has a higher chance of a transition to a bigger universe.

preprint2022arXiv

Searching for Variable Stars in the Open Cluster NGC 2355 and Its Surrounding Region

We have investigated the variable stars in the field surrounding NGC 2355 based on the time-series photometric observation data. More than 3000 CCD frames were obtained in the V band spread over 13 nights with the Nanshan One-meter Wide-field Telescope. We have detected 88 variable stars, containing 72 new variable stars and 16 known variable stars. By analyzing these light curves, we classified the variable stars as follows: 26 eclipsing binaries, 52 pulsating stars, 4 rotating variables, and 6 unclear type variable stars for which their periods are much longer than the time baseline chosen. Employing Gaia DR2 parallax, kinematics, and photometry, the cluster membership of these variable stars were also analyzed for NGC 2355. In addition to the 11 variable members reported by Cantat-Gaudin et al. (2018), we identify 4 more variable member candidates located at the outer region of NGC 2355 and showed homogeneity in space positions and kinematic properties with the cluster members. The main physical parameters of NGC 2355 estimated from the two-color and color-magnitude diagrams are log(age/yr) = 8.9, E(B - V) = 0.24 mag, and [Fe/H] = - 0.07 dex.

preprint2022arXiv

SIND: A Drone Dataset at Signalized Intersection in China

Intersection is one of the most challenging scenarios for autonomous driving tasks. Due to the complexity and stochasticity, essential applications (e.g., behavior modeling, motion prediction, safety validation, etc.) at intersections rely heavily on data-driven techniques. Thus, there is an intense demand for trajectory datasets of traffic participants (TPs) in intersections. Currently, most intersections in urban areas are equipped with traffic lights. However, there is not yet a large-scale, high-quality, publicly available trajectory dataset for signalized intersections. Therefore, in this paper, a typical two-phase signalized intersection is selected in Tianjin, China. Besides, a pipeline is designed to construct a Signalized INtersection Dataset (SIND), which contains 7 hours of recording including over 13,000 TPs with 7 types. Then, the behaviors of traffic light violations in SIND are recorded. Furthermore, the SIND is also compared with other similar works. The features of the SIND can be summarized as follows: 1) SIND provides more comprehensive information, including traffic light states, motion parameters, High Definition (HD) map, etc. 2) The category of TPs is diverse and characteristic, where the proportion of vulnerable road users (VRUs) is up to 62.6% 3) Multiple traffic light violations of non-motor vehicles are shown. We believe that SIND would be an effective supplement to existing datasets and can promote related research on autonomous driving.The dataset is available online via: https://github.com/SOTIF-AVLab/SinD

preprint2021arXiv

A cone restriction estimate using polynomial partitioning

We obtain improved Fourier restriction estimate for the truncated cone using the method of polynomial partitioning in dimension $n\geq 3$, which in particular solves the cone restriction conjecture for $n=5$, and recovers the sharp range for $3\leq n\leq 4$. The main ingredient of the proof is a $k$-broad estimate for the cone extension operator, which is a weak version of the $k$-linear cone restriction estimate for $2\leq k\leq n$.

preprint2021arXiv

NBSearch: Semantic Search and Visual Exploration of Computational Notebooks

Code search is an important and frequent activity for developers using computational notebooks (e.g., Jupyter). The flexibility of notebooks brings challenges for effective code search, where classic search interfaces for traditional software code may be limited. In this paper, we propose, NBSearch, a novel system that supports semantic code search in notebook collections and interactive visual exploration of search results. NBSearch leverages advanced machine learning models to enable natural language search queries and intuitive visualizations to present complicated intra- and inter-notebook relationships in the returned results. We developed NBSearch through an iterative participatory design process with two experts from a large software company. We evaluated the models with a series of experiments and the whole system with a controlled user study. The results indicate the feasibility of our analytical pipeline and the effectiveness of NBSearch to support code search in large notebook collections.

preprint2021arXiv

Progressively Pretrained Dense Corpus Index for Open-Domain Question Answering

To extract answers from a large corpus, open-domain question answering (QA) systems usually rely on information retrieval (IR) techniques to narrow the search space. Standard inverted index methods such as TF-IDF are commonly used as thanks to their efficiency. However, their retrieval performance is limited as they simply use shallow and sparse lexical features. To break the IR bottleneck, recent studies show that stronger retrieval performance can be achieved by pretraining a effective paragraph encoder that index paragraphs into dense vectors. Once trained, the corpus can be pre-encoded into low-dimensional vectors and stored within an index structure where the retrieval can be efficiently implemented as maximum inner product search. Despite the promising results, pretraining such a dense index is expensive and often requires a very large batch size. In this work, we propose a simple and resource-efficient method to pretrain the paragraph encoder. First, instead of using heuristically created pseudo question-paragraph pairs for pretraining, we utilize an existing pretrained sequence-to-sequence model to build a strong question generator that creates high-quality pretraining data. Second, we propose a progressive pretraining algorithm to ensure the existence of effective negative samples in each batch. Across three datasets, our method outperforms an existing dense retrieval method that uses 7 times more computational resources for pretraining.

preprint2020arXiv

A Fast Radio Burst discovered in FAST drift scan survey

We report the discovery of a highly dispersed fast radio burst, FRB~181123, from an analysis of $\sim$1500~hr of drift-scan survey data taken using the Five-hundred-meter Aperture Spherical radio Telescope (FAST). The pulse has three distinct emission components, which vary with frequency across our 1.0--1.5~GHz observing band. We measure the peak flux density to be $>0.065$~Jy and the corresponding fluence $>0.2$~Jy~ms. Based on the observed dispersion measure of 1812~cm$^{-3}$~pc, we infer a redshift of $\sim 1.9$. From this, we estimate the peak luminosity and isotropic energy to be $\lesssim 2\times10^{43}$~erg~s$^{-1}$ and $\lesssim 2\times10^{40}$~erg, respectively. With only one FRB from the survey detected so far, our constraints on the event rate are limited. We derive a 95\% confidence lower limit for the event rate of 900 FRBs per day for FRBs with fluences $>0.025$~Jy~ms. We performed follow-up observations of the source with FAST for four hours and have not found a repeated burst. We discuss the implications of this discovery for our understanding of the physical mechanisms of FRBs.

preprint2020arXiv

A Model-driven Deep Neural Network for Single Image Rain Removal

Deep learning (DL) methods have achieved state-of-the-art performance in the task of single image rain removal. Most of current DL architectures, however, are still lack of sufficient interpretability and not fully integrated with physical structures inside general rain streaks. To this issue, in this paper, we propose a model-driven deep neural network for the task, with fully interpretable network structures. Specifically, based on the convolutional dictionary learning mechanism for representing rain, we propose a novel single image deraining model and utilize the proximal gradient descent technique to design an iterative algorithm only containing simple operators for solving the model. Such a simple implementation scheme facilitates us to unfold it into a new deep network architecture, called rain convolutional dictionary network (RCDNet), with almost every network module one-to-one corresponding to each operation involved in the algorithm. By end-to-end training the proposed RCDNet, all the rain kernels and proximal operators can be automatically extracted, faithfully characterizing the features of both rain and clean background layers, and thus naturally lead to its better deraining performance, especially in real scenarios. Comprehensive experiments substantiate the superiority of the proposed network, especially its well generality to diverse testing scenarios and good interpretability for all its modules, as compared with state-of-the-arts both visually and quantitatively. The source codes are available at \url{https://github.com/hongwang01/RCDNet}.

preprint2020arXiv

Asymptotic Outage Analysis of Spatially Correlated Rayleigh MIMO Channels

The outage performance of multiple-input multiple-output (MIMO) technique has received intense attention in order to ensure the reliability requirement for mission-critical machine-type communication (cMTC) applications. In this paper, the outage probability is asymptotically studied for MIMO channels to thoroughly investigate the transmission reliability. To fully capture the spatial correlation effects, the MIMO fading channel matrix is modelled according to three types of Kronecker correlation structure, i.e., independent, semi-correlated and full-correlated Rayleigh MIMO channels. The outage probabilities under all three Kronecker models are expressed as representations of the weighted sum of the generalized Fox's H functions. The simple analytical results empower the asymptotic outage analyses at high signal-to-noise ratio (SNR), which are conducted not only to reveal helpful insights into understanding the behavior of fading effects, but also to offer useful design guideline for MIMO configurations. Particularly, the asymptotic outage probability is proved to be a monotonically increasing and convex function of the transmission rate. In the absence of the channel state information (CSI), the transmitter tends to equally allocate the total transmit power among its antennas to enhance the system reliability especially in high SNR regime. In the end, the analytical results are validated through extensive numerical experiments.

preprint2020arXiv

Digital Quadruplets for Cyber-Physical-Social Systems based Parallel Driving: From Concept to Applications

Digital quadruplets aiming to improve road safety, traffic efficiency, and driving cooperation for future connected automated vehicles are proposed with the enlightenment of ACP based parallel driving. The ACP method denotes Artificial societies, Computational experiments, and Parallel execution modules for cyber-physical-social systems. Four agents are designed in the framework of digital quadruplets: descriptive vehicles, predictive vehicles, prescriptive vehicles, and real vehicles. The three virtual vehicles (descriptive, predictive, and prescriptive) dynamically interact with the real one in order to enhance the safety and performance of the real vehicle. The details of the three virtual vehicles in the digital quadruplets are described. Then, the interactions between the virtual and real vehicles are presented. The experimental results of the digital quadruplets demonstrate the effectiveness of the proposed framework.

preprint2020arXiv

Dueling Deep Q Network for Highway Decision Making in Autonomous Vehicles: A Case Study

This work optimizes the highway decision making strategy of autonomous vehicles by using deep reinforcement learning (DRL). First, the highway driving environment is built, wherein the ego vehicle, surrounding vehicles, and road lanes are included. Then, the overtaking decision-making problem of the automated vehicle is formulated as an optimal control problem. Then relevant control actions, state variables, and optimization objectives are elaborated. Finally, the deep Q-network is applied to derive the intelligent driving policies for the ego vehicle. Simulation results reveal that the ego vehicle could safely and efficiently accomplish the driving task after learning and training.

preprint2020arXiv

Dynamical Equations of Controlled Rigid Spacecraft with a Rotor

In this paper, we consider the controlled rigid spacecraft with an internal rotor as a regular point reducible regular controlled Hamiltonian (RCH) system. In the cases of coincident and non-coincident centers of buoyancy and gravity, we first give the regular point reduction and the dynamical vector field of the reduced controlled rigid spacecraft-rotor system, respectively. Then, we derive precisely the geometric constraint conditions of the reduced symplectic form for the dynamical vector field of the regular point reducible controlled spacecraft-rotor system, that is, the two types of Hamilton-Jacobi equation for the reduced controlled spacecraft-rotor system by calculation in detail. These researches reveal the deeply internal relationships of the geometrical structures of phase spaces, the dynamical vector fields and controls of the system.

preprint2020arXiv

Hamilton-Jacobi Theorems for Regular Controlled Hamiltonian System and Its Reduced Systems

In this paper, we give precisely the geometric constraint conditions of canonical symplectic form and regular reduced symplectic forms for the dynamical vector fields of a regular controlled Hamiltonian (RCH) system and its regular reduced systems, which are called the Type I and Type II of Hamilton-Jacobi equations. At first, we first prove two types of Hamilton-Jacobi theorem for an RCH system on cotangent bundle of a configuration manifold, by using the canonical symplectic form and the dynamical vector field, which are the development of the two types of geometric version of Hamilton-Jacobi theorem for a Hamiltonian system given in Wang \cite{wa17}. Moreover, we also prove two types of Hamilton-Jacobi theorem for a controlled magnetic Hamiltonian (CMH) system by using the magnetic symplectic form and the magnetic Hamiltonian vector field. Secondly, we generalize the above results for a regular reducible RCH system with symmetry and momentum map, and prove two types of Hamilton-Jacobi theorems for the regular point reduced RCH system and the regular orbit reduced RCH system. Thirdly, we prove that the RCH-equivalence for the RCH system, and RpCH-equivalence and RoCH- equivalence for the regular reducible RCH systems with symmetries, leave the solutions of corresponding Hamilton-Jacobi equations invariant. Finally, as an application of the theoretical results, we show the Type I and Type II of Hamilton-Jacobi equations for the $R_p$-reduced controlled rigid body-rotor system and the $R_p$-reduced controlled heavy top-rotor system on the generalizations of rotation group SO(3) and Euclidean group SE(3), respectively. These researches reveal the deeply internal relationships of the geometrical structures of phase spaces, the dynamical vector fields and controls of the RCH system.

preprint2020arXiv

Knowledge Federation: A Unified and Hierarchical Privacy-Preserving AI Framework

With strict protections and regulations of data privacy and security, conventional machine learning based on centralized datasets is confronted with significant challenges, making artificial intelligence (AI) impractical in many mission-critical and data-sensitive scenarios, such as finance, government, and health. In the meantime, tremendous datasets are scattered in isolated silos in various industries, organizations, different units of an organization, or different branches of an international organization. These valuable data resources are well underused. To advance AI theories and applications, we propose a comprehensive framework (called Knowledge Federation - KF) to address these challenges by enabling AI while preserving data privacy and ownership. Beyond the concepts of federated learning and secure multi-party computation, KF consists of four levels of federation: (1) information level, low-level statistics and computation of data, meeting the requirements of simple queries, searching and simplistic operators; (2) model level, supporting training, learning, and inference; (3) cognition level, enabling abstract feature representation at various levels of abstractions and contexts; (4) knowledge level, fusing knowledge discovery, representation, and reasoning. We further clarify the relationship and differentiation between knowledge federation and other related research areas. We have developed a reference implementation of KF, called iBond Platform, to offer a production-quality KF platform to enable industrial applications in finance, insurance et al. The iBond platform will also help establish the KF community and a comprehensive ecosystem and usher in a novel paradigm shift towards secure, privacy-preserving and responsible AI. As far as we know, knowledge federation is the first hierarchical and unified framework for secure multi-party computing and learning.

preprint2020arXiv

Optimal Petrov-Galerkin spectral approximation method for the fractional diffusion, advection, reaction equation on a bounded interval

In this paper we investigate the numerical approximation of the fractional diffusion, advection, reaction equation on a bounded interval. Recently the explicit form of the solution to this equation was obtained. Using the explicit form of the boundary behavior of the solution and Jacobi polynomials, a Petrov-Galerkin approximation scheme is proposed and analyzed. Numerical experiments are presented which support the theoretical results, and demonstrate the accuracy and optimal convergence of the approximation method.

preprint2020arXiv

Quantum enhanced optical phase estimation with a squeezed thermal state

Quantum phase estimation protocols can provide a measuring method of phase shift with precision superior to standard quantum limit (SQL) due to the application of a nonclassical state of light. A squeezed vacuum state, whose variance in one quadrature is lower than the corresponding SQL, has been pointed out a sensitive resource for quantum phase estimation and the estimation accuracy is directly influenced by the properties of the squeezed state. Here we detailedly analyze the influence of the purity and squeezing level of the squeezed state on the accuracy of quantum phase estimation. The maximum precision that can be achieved for a squeezed thermal state is evaluated, and the experimental results are in agreement with the theoretical analyses. It is also found that the width of the phase estimation interval $Δθ$ beyond SQL is correlated with the purity of the squeezed state.

preprint2020arXiv

Small cap decouplings

We develop a toolbox for proving decouplings into boxes with diameter smaller than the canonical scale. As an application of this new technique, we solve three problems for which earlier methods have failed. We start by verifying the small cap decoupling for the parabola. Then we find sharp estimates for exponential sums with small frequency separation on the moment curve in $\mathbb{R}^3$. This part of the work relies on recent improved Kakeya-type estimates for planar tubes, as well as on new multilinear incidence bounds for plates and planks. We also combine our method with the recent advance on the reverse square function estimate, in order to prove small cap decoupling into square-like caps for the two dimensional cone. The Appendix by Roger Heath-Brown contains an application of the new exponential sum estimates for the moment curve, to the Riemann zeta-function.

preprint2020arXiv

Structural Residual Learning for Single Image Rain Removal

To alleviate the adverse effect of rain streaks in image processing tasks, CNN-based single image rain removal methods have been recently proposed. However, the performance of these deep learning methods largely relies on the covering range of rain shapes contained in the pre-collected training rainy-clean image pairs. This makes them easily trapped into the overfitting-to-the-training-samples issue and cannot finely generalize to practical rainy images with complex and diverse rain streaks. Against this generalization issue, this study proposes a new network architecture by enforcing the output residual of the network possess intrinsic rain structures. Such a structural residual setting guarantees the rain layer extracted by the network finely comply with the prior knowledge of general rain streaks, and thus regulates sound rain shapes capable of being well extracted from rainy images in both training and predicting stages. Such a general regularization function naturally leads to both its better training accuracy and testing generalization capability even for those non-seen rain configurations. Such superiority is comprehensively substantiated by experiments implemented on synthetic and real datasets both visually and quantitatively as compared with current state-of-the-art methods.

preprint2020arXiv

Symmetric Reduction and Hamilton-Jacobi Equations of the Controlled Underwater Vehicle-Rotor System

In this paper, we first give the regular point reduction and the two types of Hamilton-Jacobi equation for a regular controlled Hamiltonian (RCH) system with symmetry and momentum map on the generalization of a semidirect product Lie group. Next, as an application of the theoretical results, we consider the underwater vehicle with two internal rotors as a regular point reducible RCH system, in the cases of coincident and non-coincident centers of buoyancy and gravity, we derive precisely the geometric constraint conditions of the reduced symplectic form for the dynamical vector field of the regular point reducible controlled underwater vehicle-rotor system, that is, the two types of Hamilton-Jacobi equation for the reduced controlled underwater vehicle-rotor system by calculation in detail, respectively. These researches reveal the deeply internal relationships of the geometrical structures of phase spaces, the dynamical vector fields and controls of the system.

preprint2020arXiv

TabFact: A Large-scale Dataset for Table-based Fact Verification

The problem of verifying whether a textual hypothesis holds based on the given evidence, also known as fact verification, plays an important role in the study of natural language understanding and semantic representation. However, existing studies are mainly restricted to dealing with unstructured evidence (e.g., natural language sentences and documents, news, etc), while verification under structured evidence, such as tables, graphs, and databases, remains under-explored. This paper specifically aims to study the fact verification given semi-structured data as evidence. To this end, we construct a large-scale dataset called TabFact with 16k Wikipedia tables as the evidence for 118k human-annotated natural language statements, which are labeled as either ENTAILED or REFUTED. TabFact is challenging since it involves both soft linguistic reasoning and hard symbolic reasoning. To address these reasoning challenges, we design two different models: Table-BERT and Latent Program Algorithm (LPA). Table-BERT leverages the state-of-the-art pre-trained language model to encode the linearized tables and statements into continuous vectors for verification. LPA parses statements into programs and executes them against the tables to obtain the returned binary value for verification. Both methods achieve similar accuracy but still lag far behind human performance. We also perform a comprehensive analysis to demonstrate great future opportunities. The data and code of the dataset are provided in \url{https://github.com/wenhuchen/Table-Fact-Checking}.

preprint2020arXiv

Transferred Energy Management Strategies for Hybrid Electric Vehicles Based on Driving Conditions Recognition

Energy management strategies (EMSs) are the most significant components in hybrid electric vehicles (HEVs) because they decide the potential of energy conservation and emission reduction. This work presents a transferred EMS for a parallel HEV via combining the reinforcement learning method and driving conditions recognition. First, the Markov decision process (MDP) and the transition probability matrix are utilized to differentiate the driving conditions. Then, reinforcement learning algorithms are formulated to achieve power split controls, in which Q-tables are tuned by current driving situations. Finally, the proposed transferred framework is estimated and validated in a parallel hybrid topology. Its advantages in computational efficiency and fuel economy are summarized and proved.

preprint2019arXiv

Uniqueness of determining the variable fractional order in variable-order time-fractional diffusion equations

We study an initial-boundary value problem of variable-order time-fractional diffusion equations in one space dimension. Based on the wellposedness of the proposed model and the smoothing properties of its solutions, which are shown to be determined by the behavior of the variable order at the initial time, a uniqueness result for an important inverse problem of determination of the variable order in the time-fractional derivative contained in the proposed model from observations of its solutions is obtained.

preprint2018arXiv

An Accurate and Efficient Algorithm for The Time-fractional Molecular Beam Epitaxy Model with Slope Selection

In this paper, we propose a time-fractional molecular beam epitaxy (MBE) model with slope selection and its efficient, accurate, full discrete, linear numerical approximation. The numerical scheme utilizes the fast algorithm for the Caputo fractional derivative operator in time discretization and Fourier spectral method in spatial discretization. Refinement tests are conducted to verify the $2-α$ order of time convergence, with $α\in (0, 1]$ the fractional order of derivative. Several numerical simulations are presented to demonstrate the accuracy and efficiency of our newly proposed scheme. By exploring the fast algorithm calculating the Caputo fractional derivative, our numerical scheme makes it practice for long time simulation of MBE coarsening, which is essential for MBE model in practice. With the proposed fractional MBE model, we observe that the scaling law for the energy decays as $ O(t^{-\fracα{3}})$ and the roughness increases as $O(t^{\fracα{3}})$, during the coarsening dynamics with random initial condition. That is to say, the coarsening rate of MBE model could be manipulated by the fractional order $α$, and it is linearly proportional to $α$. This is the first time in literature to report/discover such scaling correlation. It provides a potential application field for fractional differential equations. Besides, the numerical approximation strategy proposed in this paper can be readily applied to study many classes of time-fractional and high dimensional phase field models.