Searcharxiv⌕ Search

arXiv subjects

Ying Wang

Publications and source records attributed to Ying Wang.

At least 127 records · Page 7Linked to original sources

Physiological-model-based neural network for modeling the metabolic-heart rate relationship during physical activities

Heart failure (HF) poses a significant global health challenge, with early detection offering opportunities for improved outcomes. Abnormalities in heart rate (HR), particularly during daily activities, may serve as early indicators of HF risk. However, existing HR monitoring tools for HF detection are limited by their reliability on population-based averages. The estimation of individualized HR serves as a dynamic digital twin, enabling precise tracking of cardiac health biomarkers. Current HR estimation methods, categorized into physiologically-driven and purely data-driven models, struggle with efficiency and interpretability. This study introduces a novel physiological-model-based neural network (PMB-NN) framework for HR estimation based on oxygen uptake (VO2) data during daily physical activities. The framework was trained and tested on individual datasets from 12 participants engaged in activities including resting, cycling, and running. By embedding physiological constraints, which were derived from our proposed simplified human movement physiological model (PM), into the neural network training process, the PMB-NN model adheres to human physiological principles while achieving high estimation accuracy, with a median R$^2$ score of 0.8 and an RMSE of 8.3 bpm. Comparative statistical analysis demonstrates that the PMB-NN achieves performance on par with the benchmark neural network model while significantly outperforming traditional physiological model (p=0.002). In addition, our PMB-NN is adept at identifying personalized parameters of the PM, enabling the PM to generate reasonable HR estimation. The proposed framework with a precise VO2 estimation system derived from body movements enables the future possibilities of personalized and real-time cardiac monitoring during daily life physical activities.

cs.LG↗

Dual-IRS Aided Near-/Hybrid-Field SWIPT: Passive Beamforming and Independent Antenna Power Splitting Design

This paper proposes a novel dual-intelligent reflecting surface (IRS) aided interference-limited simultaneous wireless information and power transfer (SWIPT) system with independent power splitting (PS), where each receiving antenna applies different PS factors to offer an advantageous trade-off between the useful information and harvested energy. We separately establish the near- and hybrid-field channel models for IRS-reflected links to evaluate the performance gain more precisely and practically. Specifically, we formulate an optimization problem of maximizing the harvested power by jointly optimizing dual-IRS phase shifts, independent PS ratio, and receive beamforming vector in both near- and hybrid-field cases. In the near-field case, the alternating optimization algorithm is proposed to solve the non-convex problem by applying the Lagrange duality method and the difference-of-convex (DC) programming. In the hybrid-field case, we first present an interesting result that the AP-IRS-user channel gains are invariant to the phase shifts of dual-IRS, which allows the optimization problem to be transformed into a convex one. Then, we derive the asymptotic performance of the combined channel gains in closed-form and analyze the characteristics of the dual-IRS. Numerical results validate our analysis and indicate the performance gains of the proposed scheme that dual-IRS-aided SWIPT with independent PS over other benchmark schemes.

eess.SP↗

DS-HGCN: A Dual-Stream Hypergraph Convolutional Network for Predicting Student Engagement via Social Contagion

Student engagement is a critical factor influencing academic success and learning outcomes. Accurately predicting student engagement is essential for optimizing teaching strategies and providing personalized interventions. However, most approaches focus on single-dimensional feature analysis and assessing engagement based on individual student factors. In this work, we propose a dual-stream multi-feature fusion model based on hypergraph convolutional networks (DS-HGCN), incorporating social contagion of student engagement. DS-HGCN enables accurate prediction of student engagement states by modeling multi-dimensional features and their propagation mechanisms between students. The framework constructs a hypergraph structure to encode engagement contagion among students and captures the emotional and behavioral differences and commonalities by multi-frequency signals. Furthermore, we introduce a hypergraph attention mechanism to dynamically weigh the influence of each student, accounting for individual differences in the propagation process. Extensive experiments on public benchmark datasets demonstrate that our proposed method achieves superior performance and significantly outperforms existing state-of-the-art approaches.

cs.MM↗

Distribution Network Restoration with Mobile Resources Dispatch: A Simulation-Based Online Dynamic Programming Approach

Dispatching mobile resources such as repair crews and mobile emergency generators is essential for the rapid restoration of distribution systems after extreme events. However, the restoration process is affected by various uncertain factors including repair time, road condition, and newly observed failures, necessitating online decision-making in response to real-time information. This paper proposes a simulation-based online dynamic programming approach to provide real-time restoration actions considering the dispatch of mobile resources. Using an index-based priority rule as the base policy, the remaining cumulative loss at the current state and a given action is evaluated from online simulation. As the base policy is explicit, the simulation is efficient. Then, the action leading to the minimum cumulative loss is chosen. It is proven that such a strategy improves the performance of base policy. The proposed policy adapts to real-time information updates and does not rely on offline training, so incurs no data and convergence-related issues, which is important in restoration tasks where the historical data of extreme events is rare. The rolling optimization approach may not meet the requirement of online use, because routing mobile resources gives rise to large-scale discrete optimization problems. Case studies on 123-bus and 8500-bus systems demonstrate that the proposed method achieves higher efficiency and better performance compared with rolling horizon optimization.

eess.SY↗

Equation of the Perfect Fluid in the FRW Universe

In this paper, we study the equation of state and its properties of the perfect fluid in the $D$-dimensional FRW universe under Einstein gravity, Gauss-Bonnet gravity and Lovelock gravity. In Einstein gravity, we get the equation of state and find that it has no critical point in the $P$-$V$ diagram, but its isothermal lines have minima in the $4$-dimensional case and are always negative in higher dimensions. In Gauss-Bonnet gravity, we get the equation of state and find that it has a critical point in the $5,6,7,8$-dimensional cases with phase transitions above the critical temperature. In Lovelock gravity, we get the equation of state and conditions of the critical points. Our work shows that both the theories of gravity and the dimensions of the FRW universe affect the existence of the critical point of the perfect fluid. Interestingly, if the critical point exists, phase transition always occures above the critical temperature.

gr-qc↗

A Digital SRAM-Based Compute-In-Memory Macro for Weight-Stationary Dynamic Matrix Multiplication in Transformer Attention Score Computation

Compute-in-memory (CIM) techniques are widely employed in energy-efficient artificial intelligent (AI) processors. They alleviate power and latency bottlenecks caused by extensive data movements between compute and storage units. To extend these benefits to Transformer, this brief proposes a digital CIM macro to compute attention score. To eliminate dynamic matrix multiplication (MM), we reconstruct the computation as static MM using a combined QK-weight matrix, so that inputs can be directly fed to a single CIM macro to obtain the score results. However, this introduces a new challenge of 2-input static MM. The computation is further decomposed into four groups of bit-serial logical and addition operations. This allows 2-input to directly activate the word line via AND gate, thus realizing 2-input static MM with minimal overhead. A hierarchical zero-value bit skipping mechanism is introduced to prioritize skipping zero-value bits in the 2-input case. This mechanism effectively utilizes data sparsity of 2-input, significantly reducing redundant operations. Implemented in a 65-nm process, the 0.35 mm2 macro delivers 42.27 GOPS at 1.24 mW, yielding 34.1 TOPS/W energy and 120.77 GOPS/mm2 area efficiency. Compared to CPUs and GPUs, it achieves ~25x and ~13x higher efficiency, respectively. Against other Transformer-CIMs, it demonstrates at least 7x energy and 2x area efficiency gains, highlighting its strong potential for edge intelligence.

cs.AR↗

PMB-NN: Physiology-Centred Hybrid AI for Personalized Hemodynamic Monitoring from Photoplethysmography

Continuous monitoring of blood pressure (BP) and hemodynamic parameters such as peripheral resistance (R) and arterial compliance (C) are critical for early vascular dysfunction detection. While photoplethysmography (PPG) wearables has gained popularity, existing data-driven methods for BP estimation lack interpretability. We advanced our previously proposed physiology-centered hybrid AI method-Physiological Model-Based Neural Network (PMB-NN)-in blood pressure estimation, that unifies deep learning with a 2-element Windkessel based model parameterized by R and C acting as physics constraints. The PMB-NN model was trained in a subject-specific manner using PPG-derived timing features, while demographic information was used to infer an intermediate variable: cardiac output. We validated the model on 10 healthy adults performing static and cycling activities across two days for model's day-to-day robustness, benchmarked against deep learning (DL) models (FCNN, CNN-LSTM, Transformer) and standalone Windkessel based physiological model (PM). Validation was conducted on three perspectives: accuracy, interpretability and plausibility. PMB-NN achieved systolic BP accuracy (MAE: 7.2 mmHg) comparable to DL benchmarks, diastolic performance (MAE: 3.9 mmHg) lower than DL models. However, PMB-NN exhibited higher physiological plausibility than both DL baselines and PM, suggesting that the hybrid architecture unifies and enhances the respective merits of physiological principles and data-driven techniques. Beyond BP, PMB-NN identified R (ME: 0.15 mmHg$\cdot$s/ml) and C (ME: -0.35 ml/mmHg) during training with accuracy similar to PM, demonstrating that the embedded physiological constraints confer interpretability to the hybrid AI framework. These results position PMB-NN as a balanced, physiologically grounded alternative to purely data-driven approaches for daily hemodynamic monitoring.

physics.med-ph↗

IF-Bench: Benchmarking and Enhancing MLLMs for Infrared Images with Generative Visual Prompting

Recent advances in multimodal large language models (MLLMs) have led to impressive progress across various benchmarks. However, their capability in understanding infrared images remains unexplored. To address this gap, we introduce IF-Bench, the first high-quality benchmark designed for evaluating multimodal understanding of infrared images. IF-Bench consists of 499 images sourced from 23 infrared datasets and 680 carefully curated visual question-answer pairs, covering 10 essential dimensions of image understanding. Based on this benchmark, we systematically evaluate over 40 open-source and closed-source MLLMs, employing cyclic evaluation, bilingual assessment, and hybrid judgment strategies to enhance the reliability of the results. Our analysis reveals how model scale, architecture, and inference paradigms affect infrared image comprehension, providing valuable insights for this area. Furthermore, we propose a training-free generative visual prompting (GenViP) method, which leverages advanced image editing models to translate infrared images into semantically and spatially aligned RGB counterparts, thereby mitigating domain distribution shifts. Extensive experiments demonstrate that our method consistently yields significant performance improvements across a wide range of MLLMs. The benchmark and code are available at https://github.com/casiatao/IF-Bench.

cs.CV↗

A New Solution for Cooperative Game with Public Externalities

This study proposes a novel solution concept--the w-value--for cooperative games with public externalities. The w-value is axiomatically founded on three principles: Pareto Optimality (PO), Market Equilibrium (ME), and Fiscal Balance (FB), which together ensure a fair and economically sound distribution of gains. We establish its existence, uniqueness, and an accompanying implementation mechanism. A key theoretical advantage is its strong stability: the w-value lies within the core, specifically the γ-core making it resistant to coalitional deviations. Moreover, its computational efficiency facilitates practical application to complex real-world problems, offering a clear advantage over more cumbersome alternatives. These properties make the w-value a superior framework for analyzing cooperation under public externalities. A numerical illustration demonstrates the step-by-step calculation process. Finally, we apply the concept to international climate negotiations, showing how it provides a theoretical rationale for the shift from rigid mandatory emission reduction systems toward the flexible structure of Nationally Determined Contributions.

econ.TH↗

Quantized Distributed Estimation with Event-triggered Communication and Packet Loss

This paper focuses on the problem of quantized distributed estimation with event-triggered communication and packet loss, aiming to reduce the number of transmitted bits. The main challenge lies in the inability to differentiate between an untriggered event and a packet loss occurrence. This paper proposes an event-triggered distributed estimation algorithm with quantized communication and quantized measurement, in which it introduces a one-bit information reconstruction method to deal with packet loss. The almost sure convergence and convergence rate of the proposed algorithm are established. Besides, it is demonstrated that the global average communication bit-rate decreases to zero over time. Moreover, the trade-off between communication rate and convergence rate is revealed, providing guidance for designing the communication rate required to achieve the algorithm's convergence rate. A numerical example is supplied to validate the findings.

eess.SY↗

Peregrine: One-Shot Fine-Tuning for FHE Inference of General Deep CNNs

We address two fundamental challenges in adapting general deep CNNs for FHE-based inference: approximating non-linear activations such as ReLU with low-degree polynomials while minimizing accuracy degradation, and overcoming the ciphertext capacity barrier that constrains high-resolution image processing on FHE inference. Our contributions are twofold: (1) a single-stage fine-tuning (SFT) strategy that directly converts pre-trained CNNs into FHE-friendly forms using low-degree polynomials, achieving competitive accuracy with minimal training overhead; and (2) a generalized interleaved packing (GIP) scheme that is compatible with feature maps of virtually arbitrary spatial resolutions, accompanied by a suite of carefully designed homomorphic operators that preserve the GIP-form encryption throughout computation. These advances enable efficient, end-to-end FHE inference across diverse CNN architectures. Experiments on CIFAR-10, ImageNet, and MS COCO demonstrate that the FHE-friendly CNNs obtained via our SFT strategy achieve accuracy comparable to baselines using ReLU or SiLU activations. Moreover, this work presents the first demonstration of FHE-based inference for YOLO architectures in object detection leveraging low-degree polynomial activations.

cs.CV↗

Can LLMs Help Allocate Public Health Resources? A Case Study on Childhood Lead Testing

Public health agencies face critical challenges in identifying high-risk neighborhoods for childhood lead exposure with limited resources for outreach and intervention programs. To address this, we develop a Priority Score integrating untested children proportions, elevated blood lead prevalence, and public health coverage patterns to support optimized resource allocation decisions across 136 neighborhoods in Chicago, New York City, and Washington, D.C. We leverage these allocation tasks, which require integrating multiple vulnerability indicators and interpreting empirical evidence, to evaluate whether large language models (LLMs) with agentic reasoning and deep research capabilities can effectively allocate public health resources when presented with structured allocation scenarios. LLMs were tasked with distributing 1,000 test kits within each city based on neighborhood vulnerability indicators. Results reveal significant limitations: LLMs frequently overlooked neighborhoods with highest lead prevalence and largest proportions of untested children, such as West Englewood in Chicago, while allocating disproportionate resources to lower-priority areas like Hunts Point in New York City. Overall accuracy averaged 0.46, reaching a maximum of 0.66 with ChatGPT 5 Deep Research. Despite their marketed deep research capabilities, LLMs struggled with fundamental limitations in information retrieval and evidence-based reasoning, frequently citing outdated data and allowing non-empirical narratives about neighborhood conditions to override quantitative vulnerability indicators.

cs.CY↗

Centralized Group Equitability and Individual Envy-Freeness in the Allocation of Indivisible Items

We study the fair allocation of indivisible items for groups of agents from the perspectives of the agents and a centralized allocator. In our setting, the centralized allocator is interested in ensuring the allocation is fair among the groups and between agents. This setting applies to many real-world scenarios, including when a school administrator wants to allocate resources (e.g., office spaces and supplies) to staff members in departments and when a city council allocates limited housing units to various families in need across different communities. To ensure fair allocation between agents, we consider the classical envy-freeness (EF) notion. To ensure fairness among the groups, we define the notion of centralized group equitability (CGEQ) to capture the fairness for the groups from the allocator's perspective. Because an EF or CGEQ allocation does not always exist in general, we consider their corresponding natural relaxations of envy-freeness to one item (EF1) and centralized group equitability up to one item (CGEQ1). For different classes of valuation functions of the agents and the centralized allocator, we show that allocations satisfying both EF1 and CGEQ1 always exist and design efficient algorithms to compute these allocations. We also consider the centralized group maximin share (CGMMS) from the centralized allocator's perspective as a group-level fairness objective with EF1 for agents and present several results.

cs.GT↗

Radar-APLANC: Unsupervised Radar-based Heartbeat Sensing via Augmented Pseudo-Label and Noise Contrast

Frequency Modulated Continuous Wave (FMCW) radars can measure subtle chest wall oscillations to enable non-contact heartbeat sensing. However, traditional radar-based heartbeat sensing methods face performance degradation due to noise. Learning-based radar methods achieve better noise robustness but require costly labeled signals for supervised training. To overcome these limitations, we propose the first unsupervised framework for radar-based heartbeat sensing via Augmented Pseudo-Label and Noise Contrast (Radar-APLANC). We propose to use both the heartbeat range and noise range within the radar range matrix to construct the positive and negative samples, respectively, for improved noise robustness. Our Noise-Contrastive Triplet (NCT) loss only utilizes positive samples, negative samples, and pseudo-label signals generated by the traditional radar method, thereby avoiding dependence on expensive ground-truth physiological signals. We further design a pseudo-label augmentation approach featuring adaptive noise-aware label selection to improve pseudo-label signal quality. Extensive experiments on the Equipleth dataset and our collected radar dataset demonstrate that our unsupervised method achieves performance comparable to state-of-the-art supervised methods. Our code, dataset, and supplementary materials can be accessed from https://github.com/RadarHRSensing/Radar-APLANC.

cs.CV↗

Learning-Based Blockage-Resilient Beam Training in Near-Field Terahertz Communications

Terahertz (THz) band is considered a promising candidate to meet the high-throughput requirement for future sixth-generation (6G) wireless communications due to its ultrawide bandwidth. However, due to the high penetration loss at high-frequencies, blockage becomes a serious problem in THz communications, especially in near-field indoor communications with numerous obstacles. To address this issue, this paper investigates blockage-resilient near-field beam training based on self-accelerating Airy beam, which can propagate along a curved trajectory to circumvent obstacles. Specifically, we first analyze the trajectory of the Airy beam and the beam pattern at the receiver using a discrete Fourier transform (DFT) codebook in the presence of obstacles. Interestingly, we reveal that the beam pattern not only captures the receiver's location information but also implicitly encodes the spatial relationship between the receiver and obstacle, which facilitates identifying the optimal Airy beam configuration. Based on this insight, we formulate the blockage-resilient beam training task as a multitask learning problem and propose a lightweight attention-based multi-parameter beam training network (AMPBT-Net) to jointly predict the angle, distance, and curvature parameters of the optimal Airy beam based on the beam pattern. Finally, simulation results demonstrate that the Airy beam effectively mitigates blockage effects and the proposed scheme achieves comparable performance to exhaustive beam sweeping while significantly reducing training overhead.

eess.SP↗

Non-Archimedean Calabi-Yau Potentials on Certain Affine Varieties

We solve a non-Archimedean Monge-Ampère equation on the Berkovich analytification of a complex log Calabi-Yau pair whose dual complex is a standard simplex, answering a question of Collins-Li and offering a non-Archimedean analog of Ricci-flat metric potentials on complex affine varieties. This work builds on the solution to a complex Monge-Ampère equation obtained by Collins-Li and Collins-Tong-Yau. We also show the suitably rescaled limits of the complex potentials coincide with their non-Archimedean counterparts in some situations, strengthening their connections.

math.AG↗

Knowledge-based Visual Question Answer with Multimodal Processing, Retrieval and Filtering

Knowledge-based visual question answering (KB-VQA) requires visual language models (VLMs) to integrate visual understanding with external knowledge retrieval. Although retrieval-augmented generation (RAG) achieves significant advances in this task by combining knowledge-base querying, it still struggles with the quality of multimodal queries and the relevance of retrieved results. To overcome these challenges, we propose a novel three-stage method, termed Wiki-PRF, including Processing, Retrieval and Filtering stages. The processing stage dynamically invokes visual tools to extract precise multimodal information for retrieval. The retrieval stage integrates visual and text features to achieve multimodal knowledge retrieval. The filtering stage performs relevance filtering and concentration on retrieval results. To this end, we introduce a visual language model trained with answer accuracy and format consistency as reward signals via a reinforcement learning manner. This enhances the model's reasoning, tool invocation for accurate queries, and filtering of irrelevant content. Experiments on benchmark datasets (E-VQA and InfoSeek) show significant improvements~(36.0 and 42.8) in answer quality, achieving state-of-the-art performance. Code is available at https://github.com/cqu-student/Wiki-PRF

cs.CV↗

A Unified Recursive Identification Algorithm with Quantized Observations Based on Weighted Least-Squares Type Criteria

This paper investigates system identification problems with Gaussian inputs and quantized observations under fixed thresholds. By reinterpreting the nonlinear effects induced by quantization as the product of the unknown parameter and an unknown nonlinear coefficient, this work establishes a novel weighted least-squares criterion that enables linear estimation of unknown parameters under quantized observations. Subsequently, a two-step recursive identification algorithm is constructed by estimating two unknown terms, which is capable of handling both Gaussian noisy and noise-free linear systems. Convergence analysis of this identification algorithm is conducted, demonstrating convergence in both almost sure and $L^{p}$ senses under mild conditions, with respective rates of $O(\sqrt{ \log \log k/k})$ and $O(1/k^{p/2})$, where $k$ denotes the time step. In particular, this algorithm offers an asymptotically efficient estimation of the variance of Gaussian variables using quantized observations. Furthermore, extensions to output-error systems are discussed, enhancing the applicability and relevance of the proposed methods. Two numerical examples are provided to validate these theoretical advancements.

math.OC↗