BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Rong Hu

Rong Hu contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
math.OCComputer Visioncond-mat.mes-hallcond-mat.mtrl-scieess.IVeess.SPMachine Learning

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
9works
0followers
7topics
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

9 published item(s)

preprint2026arXiv

Annotation-free deep learning for detection and segmentation of fetal germinal matrix-intraventricular hemorrhage in brain MRI

Background: Prenatal germinal matrix-intraventricular hemorrhage (GMH-IVH) is a leading cause of infant mortality and neurodevelopmental impairment. Manual diagnosis and lesion segmentation are labor-intensive and error-prone. Deep learning models offer potential for automation but typically require large annotated datasets, which are challenging to obtain. Purpose: To develop and validate an annotation-free deep learning framework for automated detection and segmentation of GMH-IVH on brain MRI. Materials and Methods: This retrospective study analyzed 2D T2-weighted MRI data from pregnant women collected from October 2015 to October 2023 at one hospital (internal validation) and two hospitals (external validation). Eligible participants included healthy fetuses and those with GMH-IVH. FreeHemoSeg was developed and trained using pseudo GMH-IVH images synthesized from normal fetal data guided by medical priors. Primary outcomes included diagnostic accuracy (area under the ROC curve [AUROC], sensitivity, specificity) and segmentation accuracy (Dice similarity coefficient [DSC]). A reader study evaluated clinical utility. Results: A total of 1674 stacks from 558 pregnant women were analyzed. FreeHemoSeg achieved the highest performance in both internal (sensitivity: 0.914, 95% CI 0.869-0.945; specificity: 0.966, 95% CI 0.946-0.978; DSC: 0.559, 95% CI 0.546-0.571) and external validation (sensitivity: 0.824, 95% CI 0.739-0.885; specificity: 0.943, 95% CI 0.913-0.964; DSC: 0.512, 95% CI 0.497-0.526), outperforming supervised and unsupervised methods. FreeHemoSeg assistance improved radiologists' sensitivity (from 0.882 to 0.941-1.000) and diagnostic confidence while reducing interpretation time by 16.0-52.7%. Conclusion: FreeHemoSeg accurately detects and localizes fetal brain hemorrhages without annotated training data, enabling earlier diagnosis and supporting timely clinical management.

0 citations0 reviewsNo code linkedOpen access
preprint2025arXiv

Interface-Controlled Antiferromagnetic Tunnel Junctions based on a metallic van der Waals A-type Antiferromagnet

Magnetic tunnel junctions (MTJs) are crucial components in high-performance spintronic devices. Traditional MTJs rely on ferromagnetic (FM) materials but significant improvements in speed and packing density could be enabled by exploiting antiferromagnetic (AFM) compounds instead. Here, we report all-collinear AFM tunnel junctions (AFMTJs) fabricated with van der Waals A-type AFM metal (Fe0.6Co0.4)5GeTe2 (FCGT) electrodes and nonmagnetic semiconducting WSe2 tunnel barriers. The AFMTJ heterostructure device achieves a tunneling magnetoresistance (TMR) ratio of up to 75% in response to magnetic field switching. Our results demonstrate that the TMR exclusively emerges in the AFM state of FCGT, rather than during the AFM-to-FM transition. By engineering FCGT electrodes with either even- or odd-layer configurations, volatile or non-volatile TMR could be selected, consistent with an entirely interfacial effect. TMR in the even-layer devices arose by Néel vector switching. In the odd-layer devices, TMR stemmed from interfacial spin-flipping. Experimental and theoretical analyses reveal a new TMR mechanism associated with interface-driven spin-polarized transport, despite the spin-independent nature of bulk FCGT. Our work demonstrates that collinear AFMTJs can provide comparable performance to conventional MTJs and introduces a new paradigm for AFM spintronics, in which the spin-dependent properties of AFM interfaces are harnessed.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

"Second-Order Primal'' + "First-Order Dual'' Dynamical Systems with Time Scaling for Linear Equality Constrained Convex Optimization Problems

Second-order dynamical systems are important tools for solving optimization problems, and most of existing works in this field have focused on unconstrained optimization problems. In this paper, we propose an inertial primal-dual dynamical system with constant viscous damping and time scaling for the linear equality constrained convex optimization problem, which consists of a second-order ODE for the primal variable and a first-order ODE for the dual variable. When the scaling satisfies certain conditions, we prove its convergence property without assuming strong convexity. Even the convergence rate can become exponential when the scaling grows exponentially. We also show that the obtained convergence property of the dynamical system is preserved under a small perturbation.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem

By time discretization of a second-order primal-dual dynamical system with damping $α/t$ where an inertial construction in the sense of Nesterov is needed only for the primal variable, we propose a fast primal-dual algorithm for a linear equality constrained convex optimization problem. Under a suitable scaling condition, we show that the proposed algorithm enjoys a fast convergence rate for the objective residual and the feasibility violation, and the decay rate can reach $\mathcal{O}(1/k^{α-1})$ at the most. We also study convergence properties of the corresponding primal-dual dynamical system to better understand the acceleration scheme. Finally, we report numerical experiments to demonstrate the effectiveness of the proposed algorithm.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

SALIENCE: An Unsupervised User Adaptation Model for Multiple Wearable Sensors Based Human Activity Recognition

Unsupervised user adaptation aligns the feature distributions of the data from training users and the new user, so a well-trained wearable human activity recognition (WHAR) model can be well adapted to the new user. With the development of wearable sensors, multiple wearable sensors based WHAR is gaining more and more attention. In order to address the challenge that the transferabilities of different sensors are different, we propose SALIENCE (unsupervised user adaptation model for multiple wearable sensors based human activity recognition) model. It aligns the data of each sensor separately to achieve local alignment, while uniformly aligning the data of all sensors to ensure global alignment. In addition, an attention mechanism is proposed to focus the activity classifier of SALIENCE on the sensors with strong feature discrimination and well distribution alignment. Experiments are conducted on two public WHAR datasets, and the experimental results show that our model can yield a competitive performance.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

A linesearch projection algorithm for solving equilibrium problems without monotonicity in Hilbert spaces

We propose a linesearch projection algorithm for solving non-monotone and non-Lipschitzian equilibrium problems in Hilbert spaces. It is proved that the sequence generated by the proposed algorithm converges strongly to a solution of the equilibrium problem under the assumption that the solution set of the associated Minty equilibrium problem is nonempty. Compared with existing methods, we do not employ Fejér monotonicity in the strategy of proving the convergence. This comes from projecting a fixed point instead of the current point onto a subset of the feasible set at each iteration. Moreover, employing an Armijo-linesearch without subgradient has a great advantage in CPU-time. Some numerical experiments demonstrate the efficiency and strength of the presented algorithm.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Solvability of a Regular Polynomial Vector Optimization Problem without Convexity

In this paper we consider the solvability of a non-convex regular polynomial vector optimization problem on a nonempty closed set. We introduce regularity conditions for the polynomial vector optimization problem and study properties and characterizations of the regularity conditions. Under the regularity conditions, we study nonemptiness and boundedness of the solution sets of the problem. As a consequence, we establish two Frank-Wolfe type theorems for the non-convex polynomial vector optimization problem. Finally, we investigate the solution stability of the non-convex regular polynomial vector optimization problem.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Asymptotic behavior of a nonautonomous evolution equation governed by a quasi-nonexpansive operator

We study the asymptotic behavior of the trajectory of a nonautonomous evolution equation governed by a quasi-nonexpansive operator in Hilbert spaces. We prove the weak convergence of the trajectory to a fixed point of the operator by relying on Lyapunov analysis. Under a metric subregularity condition, we further derive a flexible global exponential-type rate for the distance of the trajectory to the set of fixed points. The results obtained are applied to analyze the asymptotic behavior of the trajectory of an adaptive Douglas-Rachford dynamical system, which is applied for finding a zero of the sum of two operators, one of which is strongly monotone while the other one is weakly monotone.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Convergence Rates of Inertial Primal-Dual Dynamical Methods for Separable Convex Optimization Problems

In this paper, we propose a second-order continuous primal-dual dynamical system with time-dependent positive damping terms for a separable convex optimization problem with linear equality constraints. By the Lyapunov function approach, we investigate asymptotic properties of the proposed dynamical system as the time $t\to+\infty$. The convergence rates are derived for different choices of the damping coefficients. We also show that the obtained results are robust under external perturbations.

0 citations0 reviewsNo code linkedOpen access