SearcharxivSearch

arXiv subjects

Ruiqi Huang

Publications and source records attributed to Ruiqi Huang.

6 recordsLinked to original sources

On-chip nanoplasma for adaptive electromagnetic protection

Over the past decade, semiconductor diodes have served as the primary switching elements in adaptive electromagnetic (EM) protection, yet their performance has been compromised by parasitic effects and thermal accumulation, rendering them inadequate against the rapidly evolving landscape of high-power microwave (HPM) threats. Here we show that on-chip nanoplasma switches (NPMS), composed of gallium nitride electrodes on silicon carbide substrates, exhibit superior radio frequency (RF) and thermal characteristics, positioning them as ideal field-driven switches in RF front-end protectors. By integrating NPMS into metasurfaces, antennas and circuit limiters, we achieve an adaptive response that ensures low-loss transmission for normal signals and high shielding against HPMs, while offering extended operating bandwidth and substantially higher tolerance than conventional solid-state devices. This robust, nanoscale structure has significant potential for protecting unmanned aerial vehicles, radars, satellites and other highly integrated platforms requiring strength and stability in EM environments. The findings of this study open up new routes to support EM safety of high-precision detection and imaging for next-generation RF front ends, with straightforward scalability to millimetre-wave and terahertz frequencies.

physics.app-ph

Approximating Periodic Orbits with Algebraic Curves and Related Minimal Problems

The Circular Restricted Three-Body Problem (CR3BP) models the motion of a massless body under the gravitational influence of two primaries. We present a method for approximating a given family of periodic orbits by low-degree implicit algebraic curves, producing one-parameter families of algebraic orbit models. These models enable the construction of minimal problems motivated by liaison navigation, where spacecraft states are inferred from inter-spacecraft measurements. Relevant applications include initial orbit determination and spacecraft positioning. Each minimal problem defines a parameterized family of instances; for generic parameters, the number of solutions equals the degree of the associated branched covering map. We compute these degrees using both symbolic and numerical methods, and we outline a homotopy-continuation-based solver construction that can be practical for low-degree cases.

math.AG

Physically Realistic Sequence-Level Adversarial Clothing for Robust Human-Detection Evasion

Deep neural networks used for human detection are highly vulnerable to adversarial manipulation, creating safety and privacy risks in real surveillance environments. Wearable attacks offer a realistic threat model, yet existing approaches usually optimize textures frame by frame and therefore fail to maintain concealment across long video sequences with motion, pose changes, and garment deformation. In this work, a sequence-level optimization framework is introduced to generate natural, printable adversarial textures for shirts, trousers, and hats that remain effective throughout entire walking videos in both digital and physical settings. Product images are first mapped to UV space and converted into a compact palette and control-point parameterization, with ICC locking to keep all colors printable. A physically based human-garment pipeline is then employed to simulate motion, multi-angle camera viewpoints, cloth dynamics, and illumination variation. An expectation-over-transformation objective with temporal weighting is used to optimize the control points so that detection confidence is minimized across whole sequences. Extensive experiments demonstrate strong and stable concealment, high robustness to viewpoint changes, and superior cross-model transferability. Physical garments produced with sublimation printing achieve reliable suppression under indoor and outdoor recordings, confirming real-world feasibility.

cs.CV

Projective Plane Subdivision Method For Initial Orbit Determination

Initial Orbit Determination (IOD) is the classical problem of estimating the orbit of a body in space without any presumed information about the orbit. The geometric formulation of the ''angles-only'' IOD in three-dimensional space: find a conic curve with a given focal point meeting the given lines of sight (LOS). We provide an algebraic reformulation of this problem and confirm that five is the minimal number of lines necessary to have a finite number of solutions in a non-special case, and the number of complex solutions is 66. We construct a subdivision method to search for the normal direction to the orbital plane as a point on the real projective plane. The resulting algorithm is fast as it discovers only a handful of the solutions that are real and physically meaningful.

math.AG

VF-Plan: Bridging the Art Gallery Problem and Static LiDAR Scanning with Visibility Field Optimization

Viewpoint planning is critical for efficient 3D data acquisition in applications such as 3D reconstruction, building life-cycle management, navigation, and interior decoration. However, existing methods often neglect key optimization objectives specific to static LiDAR systems, resulting in redundant or disconnected viewpoint networks. The viewpoint planning problem (VPP) extends the classical Art Gallery Problem (AGP) by requiring full coverage, strong registrability, and coherent network connectivity under constrained sensor capabilities. To address these challenges, we introduce a novel Visibility Field (VF) that accurately captures the directional and range-dependent visibility properties of static LiDAR scanners. We further observe that visibility information naturally converges onto a 1D skeleton embedded in the 2D space, enabling significant searching space reduction. Leveraging these insights, we develop a greedy optimization algorithm tailored to the VPP, which constructs a minimal yet fully connected Viewpoint Network (VPN) with low redundancy. Experimental evaluations across diverse indoor and outdoor scenarios confirm the scalability and robustness of our method. Compared to expert-designed VPNs and existing state-of-the-art approaches, our algorithm achieves comparable or fewer viewpoints while significantly enhancing connectivity. In particular, it reduces the weighted average path length by approximately 95%, demonstrating substantial improvements in compactness and structural efficiency. Code is available at https://github.com/xiongbiaostar/VFPlan.

cs.RO

Goal-oriented Feature Extraction: a novel approach for enhancing data-driven surrogate model

Surrogate model can replace the parametric full-order model (FOM) by an approximation model, which can significantly improve the efficiency of optimization design and reduce the complexity of engineering systems. However, due to limitations in efficiency and accuracy, the applications of high-dimensional surrogate models are still challenging. In the present study, we propose a method for extracting hidden features to simplify high-dimensional problems, thereby improving the accuracy and robustness of surrogate models. We establish a goal-oriented feature extraction (GFE) neural network through indirect supervised learning. We constrained the distance between hidden features based on the differences in the target output. This means that in the hidden feature space, cases that are closer in distance output approximately the same, and vice versa. The proposed hidden feature learning method can significantly reduce the dimensionality and nonlinearity of the surrogate model, thereby improving modeling accuracy and generalization capability. To demonstrate the efficiency of our proposed ideas, We conducted numerical experiments on three popular surrogate models. The modeling results of typical high-dimensional mathematical cases and aerodynamic performance cases of ONERA M6 wings show that goal-oriented feature extraction significantly improves the modeling accuracy. Goal-oriented feature extraction can effectively reduce the error distribution of predicting cases and reduce the convergence and robustness differences caused by various data-driven surrogate models.

physics.flu-dyn