arXiv subjects

Longfei Wang

Publications and source records attributed to Longfei Wang.

16 recordsLinked to original sources

arXiv2026

The brachistochrone problem for a constant velocity traveler in static and spherically symmetric spacetimes

This work investigates the brachistochrone problem for a traveler with constant local velocity within static and spherically symmetric (SSS) spacetimes. The brachistochrone trajectory (BT) equations for ultra-relativistic travelers are derived for general SSS metrics, and the solution is formally obtained in an integral form. We then apply the result to two representative spacetimes corresponding to the singular isothermal sphere (SIS) with a finite boundary and the relativistic Plummer mass profile, respectively. For the SIS spacetime, the BT inside the boundary is solved analytically and found always to bend. As the equation of state index $w$ increases, the turning radius $r_0$ of the BT, and consequently the total time, also increase. For the BT outside the boundary, it is found that the heavier the central object, the larger the $r_0$ and the total travel time. For the relativistic Plummer model, the BT will be a straight line passing through the origin when the initial and final points' radii are comparable or smaller than the size of the core region of the mass distribution. When the end points lie well outside the core region, the BT bends, exhibiting a larger turning radius for a more concentrated core. We then extend the consideration to travelers with subluminal constant velocity $v$ and show through the generalized Fermat's principle that the BT will be the same geodesic in the optical metric as ultra-relativistic travelers, with the total travel time scaled by a factor of $1/v$.

gr-qc↗

arXiv2026

BRIGHT: A Collaborative Generalist-Specialist Foundation Model for Breast Pathology

Generalist pathology foundation models (PFMs), pretrained on large-scale multi-organ datasets, have demonstrated remarkable predictive capabilities across diverse clinical applications. However, their proficiency on the full spectrum of clinically essential tasks within a specific organ system remains an open question due to the lack of large-scale validation cohorts for a single organ as well as the absence of a tailored training paradigm that can effectively translate broad histomorphological knowledge into the organ-specific expertise required for specialist-level interpretation. In this study, we propose BRIGHT, the first PFM specifically designed for breast pathology, trained on over 51,000 breast whole-slide images derived from a cohort of over 40,000 patients across 19 hospitals. BRIGHT employs a collaborative generalist-specialist framework to capture both universal and organ-specific features. To comprehensively evaluate the performance of PFMs on breast oncology, we curate the largest multi-institutional cohorts to date for downstream task development and evaluation, comprising over 25,000 WSIs across 10 hospitals. The validation cohorts cover the full spectrum of breast pathology across 25 distinct clinical tasks spanning diagnosis, biomarker prediction, treatment response and survival prediction. Extensive experiments demonstrate that BRIGHT outperforms five leading generalist PFMs, achieving state-of-the-art (SOTA) performance in 25 of 25 internal validation tasks and in 4 of 11 external validation tasks with excellent heatmap interpretability. By evaluating on large-scale validation cohorts, this study not only demonstrates BRIGHT's clinical utility in breast oncology but also validates a collaborative generalist-specialist paradigm, providing a scalable template for developing PFMs on a specific organ system, accelerating the translation of foundation models into ...

cs.CV↗

arXiv2025

N2N: A Parallel Framework for Large-Scale MILP under Distributed Memory

Parallelization has emerged as a promising approach for accelerating MILP solving. However, the complexity of the branch-and-bound (B&B) framework and the numerous effective algorithm components in MILP solvers make it difficult to parallelize. In this study, a scalable parallel framework, N2N (a node-to-node framework that maps the B&B nodes to distributed computing nodes), was proposed to solve large-scale problems in a distributed memory computing environment. Both deterministic and nondeterministic modes are supported, and the framework is designed to be easily integrated with existing solvers. Regarding the deterministic mode, a novel sliding-window-based algorithm was designed and implemented to ensure that tasks are generated and solved in a deterministic order. Moreover, several advanced techniques, such as the utilization of CP search and general primal heuristics, have been developed to fully utilize distributed computing resources and capabilities of base solvers. Adaptive solving and data communication optimization were also investigated. A popular open-source MILP solver, SCIP, was integrated into N2N as the base solver, yielding N2N-SCIP. Extensive computational experiments were conducted to evaluate the performance of N2N-SCIP compared to ParaSCIP, which is a state-of-the-art distributed parallel MILP solver under the UG framework. The nondeterministic N2N-SCIP achieves speedups of 22.52 and 12.71 with 1,000 MPI processes on the Kunpeng and x86 computing clusters, which is 1.98 and 2.08 times faster than ParaSCIP, respectively. In the deterministic mode, N2N-SCIP also shows significant performance improvements over ParaSCIP across different process numbers and computing clusters. To validate the generality of N2N, HiGHS, another open-source solver, was integrated into N2N. The related results are analyzed, and the requirements of N2N on base solvers are also concluded.

cs.AI↗

arXiv2025

Semi-distributed Cross-modal Air-Ground Relative Localization

Efficient, accurate, and flexible relative localization is crucial in air-ground collaborative tasks. However, current approaches for robot relative localization are primarily realized in the form of distributed multi-robot SLAM systems with the same sensor configuration, which are tightly coupled with the state estimation of all robots, limiting both flexibility and accuracy. To this end, we fully leverage the high capacity of Unmanned Ground Vehicle (UGV) to integrate multiple sensors, enabling a semi-distributed cross-modal air-ground relative localization framework. In this work, both the UGV and the Unmanned Aerial Vehicle (UAV) independently perform SLAM while extracting deep learning-based keypoints and global descriptors, which decouples the relative localization from the state estimation of all agents. The UGV employs a local Bundle Adjustment (BA) with LiDAR, camera, and an IMU to rapidly obtain accurate relative pose estimates. The BA process adopts sparse keypoint optimization and is divided into two stages: First, optimizing camera poses interpolated from LiDAR-Inertial Odometry (LIO), followed by estimating the relative camera poses between the UGV and UAV. Additionally, we implement an incremental loop closure detection algorithm using deep learning-based descriptors to maintain and retrieve keyframes efficiently. Experimental results demonstrate that our method achieves outstanding performance in both accuracy and efficiency. Unlike traditional multi-robot SLAM approaches that transmit images or point clouds, our method only transmits keypoint pixels and their descriptors, effectively constraining the communication bandwidth under 0.3 Mbps. Codes and data will be publicly available on https://github.com/Ascbpiac/cross-model-relative-localization.git.

cs.RO↗

arXiv2025

Collaborative Learning of Scattering and Deep Features for SAR Target Recognition with Noisy Labels

The acquisition of high-quality labeled synthetic aperture radar (SAR) data is challenging due to the demanding requirement for expert knowledge. Consequently, the presence of unreliable noisy labels is unavoidable, which results in performance degradation of SAR automatic target recognition (ATR). Existing research on learning with noisy labels mainly focuses on image data. However, the non-intuitive visual characteristics of SAR data are insufficient to achieve noise-robust learning. To address this problem, we propose collaborative learning of scattering and deep features (CLSDF) for SAR ATR with noisy labels. Specifically, a multi-model feature fusion framework is designed to integrate scattering and deep features. The attributed scattering centers (ASCs) are treated as dynamic graph structure data, and the extracted physical characteristics effectively enrich the representation of deep image features. Then, the samples with clean and noisy labels are divided by modeling the loss distribution with multiple class-wise Gaussian Mixture Models (GMMs). Afterward, the semi-supervised learning of two divergent branches is conducted based on the data divided by each other. Moreover, a joint distribution alignment strategy is introduced to enhance the reliability of co-guessed labels. Extensive experiments have been done on the Moving and Stationary Target Acquisition and Recognition (MSTAR) dataset, and the results show that the proposed method can achieve state-of-the-art performance under different operating conditions with various label noises.

cs.CV↗

arXiv2025

Towards Computation- and Communication-efficient Computational Pathology

Despite the impressive performance across a wide range of applications, current computational pathology models face significant diagnostic efficiency challenges due to their reliance on high-magnification whole-slide image analysis. This limitation severely compromises their clinical utility, especially in time-sensitive diagnostic scenarios and situations requiring efficient data transfer. To address these issues, we present a novel computation- and communication-efficient framework called Magnification-Aligned Global-Local Transformer (MAG-GLTrans). Our approach significantly reduces computational time, file transfer requirements, and storage overhead by enabling effective analysis using low-magnification inputs rather than high-magnification ones. The key innovation lies in our proposed magnification alignment (MAG) mechanism, which employs self-supervised learning to bridge the information gap between low and high magnification levels by effectively aligning their feature representations. Through extensive evaluation across various fundamental CPath tasks, MAG-GLTrans demonstrates state-of-the-art classification performance while achieving remarkable efficiency gains: up to 10.7 times reduction in computational time and over 20 times reduction in file transfer and storage requirements. Furthermore, we highlight the versatility of our MAG framework through two significant extensions: (1) its applicability as a feature extractor to enhance the efficiency of any CPath architecture, and (2) its compatibility with existing foundation models and histopathology-specific encoders, enabling them to process low-magnification inputs with minimal information loss. These advancements position MAG-GLTrans as a particularly promising solution for time-sensitive applications, especially in the context of intraoperative frozen section diagnosis where both accuracy and efficiency are paramount.

eess.IV↗

arXiv2023

Flow Dynamics of a Dodecane Jet in Oxygen Crossflow at Supercritical Pressures

In advanced aero-propulsion engines, kerosene is often injected into the combustor at supercritical pressures, where flow dynamics is distinct from the subcritical counterpart. Large-eddy simulation combined with real-fluid thermodynamics and transport theories of a N-dodecane jet in oxygen crossflow at supercritical pressures is presented. Liquid dodecane at 600 K is injected into a supercritical oxygen environment at 700 K at different supercritical pressures and jet-to-crossflow momentum flux ratios (J). Various vortical structures are discussed in detail. The results shown that, with the same jet-to-crossflow velocity ratio of 0.75, the upstream shear layer (USL) is absolutely unstable at 6.0 MPa (J = 7.1) and convectively unstable at 3.0 MPa (J = 13.2). This trend is consistent with the empirical criterion for the stability characteristics of a jet in crossflow at subcritical pressures (Jcr = 10). While decreasing J to 7.1 at 3.0 MPa, however, the dominant Strouhal number of the USL varies along the upstream jet trajectory, and the USL becomes convectively unstable. Such abnormal change in stability behavior can be attributed to the real-fluid effect induced by strong density stratification at pressure of 3.0 MPa, under which a point of inflection in the upstream mixing layer renders large density gradient and tends to stabilize the USL. The stability behavior with varying pressure and J is further corroborated by linear stability analysis. The analysis of spatial mixing deficiencies reveals that the mixing efficiency is enhanced at a higher jet-to-crossflow momentum flux ratio.

physics.flu-dyn↗

arXiv2021

Inverse Kinematics and Dexterous Workspace Formulation for 2-Segment Continuum Robots with Inextensible Segments

The inverse kinematics (IK) problem of continuum robots has been investigated in depth in the past decades. Under the constant-curvature bending assumption, closed-form IK solution has been obtained for continuum robots with variable segment lengths. Attempting to close the gap towards a complete solution, this paper presents an efficient solution for the IK problem of 2-segment continuum robots with one or two inextensible segments (a.k.a, constant segment lengths). Via representing the robot's shape as piecewise line segments, the configuration variables are separated from the IK formulation such that solving a one-variable nonlinear equation leads to the solution of the entire IK problem. Furthermore, an in-depth investigation of the boundaries of the dexterous workspace of the end effector caused by the configuration variables limits as well as the angular velocity singularities of the continuum robots was established. This dexterous workspace formulation, which is derived for the first time to the best of the authors' knowledge, is particularly useful to find the closest orientation to a target pose when the target orientation is out of the dexterous workspace. In the comparative simulation studies between the proposed method and the Jacobian-based IK method involving 500,000 cases, the proposed variable separation method solved 100% of the IK problems with much higher computational efficiency.

cs.RO↗

arXiv2020

Voltage regulator assisted lightweight countermeasure against fault injection attacks

The impeccable design of sensitive and cryptographic circuits (CC) against fault injection attacks is essential for modern data storage, communication, and computation systems that are susceptible to fault injection attacks. The robustness of a CC against voltage glitch attacks increases with an on-chip voltage regulator that considers the impact of topology and component selection on the fault injection robustness. With an emphasis on increasing the number of phases in a multiphase voltage regulator and component selection, an on-chip voltage regulator with multiphase configuration and an optimal operating point is proposed as a lightweight countermeasure to minimize injected glitches. Furthermore, an infective countermeasure is added to the on-chip multiphase voltage regulator that contaminates the computation of the cryptographic algorithm when a voltage glitch reaches to the CC. By increasing the number of phases from 1 to 16, the confrontation with fault attacks increases by 52.45%, which is equal to 91.82% if the number of phases increases to 32. Using the infective countermeasure for fault resiliency, the security-enhanced CC provides a robust and resilient solution against fault attacks that improve the security and availability of the device.

cs.CR↗

arXiv2019

A Two-stream End-to-End Deep Learning Network for Recognizing Atypical Visual Attention in Autism Spectrum Disorder

Eye movements have been widely investigated to study the atypical visual attention in Autism Spectrum Disorder (ASD). The majority of these studies have been focused on limited eye movement features by statistical comparisons between ASD and Typically Developing (TD) groups, which make it difficult to accurately separate ASD from TD at the individual level. The deep learning technology has been highly successful in overcoming this issue by automatically extracting features important for classification through a data-driven learning process. However, there is still a lack of end-to-end deep learning framework for recognition of abnormal attention in ASD. In this study, we developed a novel two-stream deep learning network for this recognition based on 700 images and corresponding eye movement patterns of ASD and TD, and obtained an accuracy of 0.95, which was higher than the previous state-of-the-art. We next characterized contributions to the classification at the single image level and non-linearly integration of this single image level information during the classification. Moreover, we identified a group of pixel-level visual features within these images with greater impacts on the classification. Together, this two-stream deep learning network provides us a novel and powerful tool to recognize and understand abnormal visual attention in ASD.

eess.IV↗

arXiv2018

A Novel Bin Design Problem and High Performance Algorithm for E-commerce Logistics System

Packing cost accounts for a large part of the e-commerce logistics cost. Mining the patterns of customer orders and designing suitable packing bins help to reduce operating cost. In the classical bin packing problem, a given set of cuboid-shaped items should be packed into bins with given and fixed-sizes (length, width and height) to minimize the number of bins that are used. However, a novel bin design problem is proposed in this paper. The decision variables are the geometric sizes of bins, and the objective is to minimize the total surface area. To solve the problem, a low computational-complexity, high-performance heuristic algorithm based on dynamic programming and depth-first tree search, named DPTS, is developed. Based on real historical data that are collected from logistics scenario, numerical experiments show that the DPTS out-performed 5.8% than the greedy local search (GLS) algorithm in the total cost. What's more, DPTS algorithm requires only about 1/50 times of the computational resources compared to the GLS algorithm. This demonstrates that DPTS algorithm is very efficient in bin design problem and can help logistics companies to make appropriate design.

cs.DS↗

arXiv2018

A fast algorithm for globally solving Tikhonov regularized total least squares problem

The total least squares problem with the general Tikhonov regularization can be reformulated as a one-dimensional parametric minimization problem (PM), where each parameterized function evaluation corresponds to solving an n-dimensional trust region subproblem. Under a mild assumption, the parametric function is differentiable and then an efficient bisection method has been proposed for solving (PM) in literature. In the first part of this paper, we show that the bisection algorithm can be greatly improved by reducing the initially estimated interval covering the optimal parameter. It is observed that the bisection method cannot guarantee to find the globally optimal solution since the nonconvex (PM) could have a local non-global minimizer. The main contribution of this paper is to propose an efficient branch-and-bound algorithm for globally solving (PM), based on a novel underestimation of the parametric function over any given interval using only the information of the parametric function evaluations at the two endpoints. We can show that the new algorithm(BTD Algorithm) returns a global ε-approximation solution in a computational effort of at most O(n^3/ε) under the same assumption as in the bisection method. The numerical results demonstrate that our new global optimization algorithm performs even much faster than the improved version of the bisection heuristic algorithm.

math.OC↗

arXiv2018

An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients

Maximizing the sum of two generalized Rayleigh quotients (SRQ) can be reformulated as a one-dimensional optimization problem, where the function value evaluations are reduced to solving semi-definite programming (SDP) subproblems. In this paper, we first use the dual SDP subproblem to construct an explicit overestimation and then propose a branch-and-bound algorithm to globally solve (SRQ). Numerical results demonstrate that it is even more efficient than the recent SDP-based heuristic algorithm.

math.OC↗

arXiv2017

Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning Method

In this paper, a new type of 3D bin packing problem (BPP) is proposed, in which a number of cuboid-shaped items must be put into a bin one by one orthogonally. The objective is to find a way to place these items that can minimize the surface area of the bin. This problem is based on the fact that there is no fixed-sized bin in many real business scenarios and the cost of a bin is proportional to its surface area. Our research shows that this problem is NP-hard. Based on previous research on 3D BPP, the surface area is determined by the sequence, spatial locations and orientations of items. Among these factors, the sequence of items plays a key role in minimizing the surface area. Inspired by recent achievements of deep reinforcement learning (DRL) techniques, especially Pointer Network, on combinatorial optimization problems such as TSP, a DRL-based method is applied to optimize the sequence of items to be packed into the bin. Numerical results show that the method proposed in this paper achieve about 5% improvement than heuristic method.

cs.AI↗

arXiv2016

Spike-Threshold Variability Originated from Separatrix-Crossing in Neuronal Dynamics

The threshold voltage for action potential generation is a key regulator of neuronal signal transduction, yet the mechanism of its dynamic variation is still not well described. In this paper, we propose that threshold phenomena can be classified as parameter thresholds and state thresholds. Voltage thresholds which belong to the state threshold are determined by the `general separatrix' in state space. We demonstrate that the separatrix generally exists in the state space of neuron models. The general form of separatrix was assumed as the function of both states and stimuli and the previously assumed threshold evolving equation versus time is naturally deduced from the separatrix. In terms of neuron dynamics, the threshold voltage variation, which is affected by different stimuli, is determined by crossing the separatrix at different points in state space. We suggest that the separatrix-crossing mechanism in state space is the intrinsic dynamic mechanism for threshold voltages and post-stimulus threshold phenomena. These proposals are also systematically verified in example models, three of which have analytic separatrices and one is the classic Hodgkin-Huxley model. The separatrix-crossing framework provides an overview of the neuronal threshold and will facilitate understanding of the nature of threshold variability.

q-bio.NC↗

arXiv2015

Stimulus-Dependent Frequency Modulation of Information Transmission in Neural Systems

Neural oscillations are universal phenomena and can be observed at different levels of neural systems, from single neuron to macroscopic brain. The frequency of those oscillations are related to the brain functions. However, little is know about how the oscillating frequency of neural system affects neural information transmission in them. In this paper, we investigated how the signal processing in single neuron is modulated by subthreshold membrane potential oscillation generated by upstream rhythmic neural activities. We found that the high frequency oscillations facilitate the transferring of strong signals, whereas slow oscillations the weak signals. Though the capacity of information convey for weak signal is low in single neuron, it is greatly enhanced when weak signals are transferred by multiple pathways with different oscillation phases. We provided a simple phase plane analysis to explain the mechanism for this stimulus-dependent frequency modulation in the leakage integrate-and-fire neuron model. Those results provided a basic understanding of how the brain could modulate its information processing simply through oscillating frequency.

q-bio.NC↗