arXiv subjects

Xiao Hu

Publications and source records attributed to Xiao Hu.

At least 145 records · Page 8Linked to original sources

arXiv2024

SQUWA: Signal Quality Aware DNN Architecture for Enhanced Accuracy in Atrial Fibrillation Detection from Noisy PPG Signals

Atrial fibrillation (AF), a common cardiac arrhythmia, significantly increases the risk of stroke, heart disease, and mortality. Photoplethysmography (PPG) offers a promising solution for continuous AF monitoring, due to its cost efficiency and integration into wearable devices. Nonetheless, PPG signals are susceptible to corruption from motion artifacts and other factors often encountered in ambulatory settings. Conventional approaches typically discard corrupted segments or attempt to reconstruct original signals, allowing for the use of standard machine learning techniques. However, this reduces dataset size and introduces biases, compromising prediction accuracy and the effectiveness of continuous monitoring. We propose a novel deep learning model, Signal Quality Weighted Fusion of Attentional Convolution and Recurrent Neural Network (SQUWA), designed to learn how to retain accurate predictions from partially corrupted PPG. Specifically, SQUWA innovatively integrates an attention mechanism that directly considers signal quality during the learning process, dynamically adjusting the weights of time series segments based on their quality. This approach enhances the influence of higher-quality segments while reducing that of lower-quality ones, effectively utilizing partially corrupted segments. This approach represents a departure from the conventional methods that exclude such segments, enabling the utilization of a broader range of data, which has great implications for less disruption when monitoring of AF risks and more accurate estimation of AF burdens. Our extensive experiments show that SQUWA outperform existing PPG-based models, achieving the highest AUCPR of 0.89 with label noise mitigation. This also exceeds the 0.86 AUCPR of models trained with using both electrocardiogram (ECG) and PPG data.

eess.SP↗

arXiv2024

Reservoir Sampling over Joins

Sampling over joins is a fundamental task in large-scale data analytics. Instead of computing the full join results, which could be massive, a uniform sample of the join results would suffice for many purposes, such as answering analytical queries or training machine learning models. In this paper, we study the problem of how to maintain a random sample over joins while the tuples are streaming in. Without the join, this problem can be solved by some simple and classical reservoir sampling algorithms. However, the join operator makes the problem significantly harder, as the join size can be polynomially larger than the input. We present a new algorithm for this problem that achieves a near-linear complexity. The key technical components are a generalized reservoir sampling algorithm that supports a predicate, and a dynamic index for sampling over joins. We also conduct extensive experiments on both graph and relational data over various join queries, and the experimental results demonstrate significant performance improvement over the state of the art.

cs.DB↗

arXiv2024

Finding Smallest Witnesses for Conjunctive Queries

A witness is a sub-database that preserves the query results of the original database but of much smaller size. It has wide applications in query rewriting and debugging, query explanation, IoT analytics, multi-layer network routing, etc. In this paper, we study the smallest witness problem (SWP) for the class of conjunctive queries (CQs) without self-joins. We first establish the dichotomy that SWP for a CQ can be computed in polynomial time if and only if it has {\em head-cluster property}, unless $\texttt{P} = \texttt{NP}$. We next turn to the approximated version by relaxing the size of a witness from being minimum. We surprisingly find that the {\em head-domination} property - that has been identified for the deletion propagation problem \cite{kimelfeld2012maximizing} - can also precisely capture the hardness of the approximated smallest witness problem. In polynomial time, SWP for any CQ with head-domination property can be approximated within a constant factor, while SWP for any CQ without such a property cannot be approximated within a logarithmic factor, unless $\texttt{P} = \texttt{NP}$. We further explore efficient approximation algorithms for CQs without head-domination property: (1) we show a trivial algorithm which achieves a polynomially large approximation ratio for general CQs; (2) for any CQ with only one non-output attribute, such as star CQs, we show a greedy algorithm with a logarithmic approximation ratio; (3) for line CQs, which contain at least two non-output attributes, we relate SWP problem to the directed steiner forest problem, whose algorithms can be applied to line CQs directly. Meanwhile, we establish a much higher lower bound, exponentially larger than the logarithmic lower bound obtained above. It remains open to close the gap between the lower and upper bound of the approximated SWP for CQs without head-domination property.

cs.DB↗

arXiv2024

On Reporting Durable Patterns in Temporal Proximity Graphs

Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding durable patterns, such as triangles and paths, which persist over a long time. While there has been work on finding durable simple patterns, existing algorithms do not have provable guarantees and run in strictly super-linear time. The paper leverages the observation that many graphs arising in practice are naturally proximity graphs or can be approximated as such, where nodes are embedded as points in some high-dimensional space, and two nodes are connected by an edge if they are close to each other. We work with an implicit representation of the proximity graph, where nodes are additionally annotated by time intervals, and design near-linear-time algorithms for finding (approximately) durable patterns above a given durability threshold. We also consider an interactive setting where a client experiments with different durability thresholds in a sequence of queries; we show how to compute incremental changes to result patterns efficiently in time near-linear to the size of the changes.

cs.DB↗

arXiv2024

2023 Low-Power Computer Vision Challenge (LPCVC) Summary

This article describes the 2023 IEEE Low-Power Computer Vision Challenge (LPCVC). Since 2015, LPCVC has been an international competition devoted to tackling the challenge of computer vision (CV) on edge devices. Most CV researchers focus on improving accuracy, at the expense of ever-growing sizes of machine models. LPCVC balances accuracy with resource requirements. Winners must achieve high accuracy with short execution time when their CV solutions run on an embedded device, such as Raspberry PI or Nvidia Jetson Nano. The vision problem for 2023 LPCVC is segmentation of images acquired by Unmanned Aerial Vehicles (UAVs, also called drones) after disasters. The 2023 LPCVC attracted 60 international teams that submitted 676 solutions during the submission window of one month. This article explains the setup of the competition and highlights the winners' methods that improve accuracy and shorten execution time.

cs.CV↗

arXiv2024

SiamAF: Learning Shared Information from ECG and PPG Signals for Robust Atrial Fibrillation Detection

Atrial fibrillation (AF) is the most common type of cardiac arrhythmia. It is associated with an increased risk of stroke, heart failure, and other cardiovascular complications, but can be clinically silent. Passive AF monitoring with wearables may help reduce adverse clinical outcomes related to AF. Detecting AF in noisy wearable data poses a significant challenge, leading to the emergence of various deep learning techniques. Previous deep learning models learn from a single modality, either electrocardiogram (ECG) or photoplethysmography (PPG) signals. However, deep learning models often struggle to learn generalizable features and rely on features that are more susceptible to corruption from noise, leading to sub-optimal performances in certain scenarios, especially with low-quality signals. Given the increasing availability of ECG and PPG signal pairs from wearables and bedside monitors, we propose a new approach, SiamAF, leveraging a novel Siamese network architecture and joint learning loss function to learn shared information from both ECG and PPG signals. At inference time, the proposed model is able to predict AF from either PPG or ECG and outperforms baseline methods on three external test sets. It learns medically relevant features as a result of our novel architecture design. The proposed model also achieves comparable performance to traditional learning regimes while requiring much fewer training labels, providing a potential approach to reduce future reliance on manual labeling.

cs.LG↗

arXiv2024

Open RL Benchmark: Comprehensive Tracked Experiments for Reinforcement Learning

In many Reinforcement Learning (RL) papers, learning curves are useful indicators to measure the effectiveness of RL algorithms. However, the complete raw data of the learning curves are rarely available. As a result, it is usually necessary to reproduce the experiments from scratch, which can be time-consuming and error-prone. We present Open RL Benchmark, a set of fully tracked RL experiments, including not only the usual data such as episodic return, but also all algorithm-specific and system metrics. Open RL Benchmark is community-driven: anyone can download, use, and contribute to the data. At the time of writing, more than 25,000 runs have been tracked, for a cumulative duration of more than 8 years. Open RL Benchmark covers a wide range of RL libraries and reference implementations. Special care is taken to ensure that each experiment is precisely reproducible by providing not only the full parameters, but also the versions of the dependencies used to generate it. In addition, Open RL Benchmark comes with a command-line interface (CLI) for easy fetching and generating figures to present the results. In this document, we include two case studies to demonstrate the usefulness of Open RL Benchmark in practice. To the best of our knowledge, Open RL Benchmark is the first RL benchmark of its kind, and the authors hope that it will improve and facilitate the work of researchers in the field.

cs.LG↗

arXiv2024

Higher-order topology in honeycomb lattice with Y-Kekulé distortions

We investigate higher-order topological states in honeycomb lattice with Y-Kekulé distortions that preserve $C_{6v}$ crystalline symmetry. The gapped states in expanded and shrunken distortions are adiabatically connected to isolated hexamers and Y-shaped tetramer states, respectively, where the former possesses nontrivial higher-order topology characterized by a $\mathbb{Z}_6$ invariant. Topological corner states exist in a flake structure with expanded distortion where the hexamers are broken at the corners. Our work reveals that honeycomb lattice with Y-Kekulé distortions serves as a promising platform to study higher-order topological states.

cond-mat.mes-hall↗

arXiv2024

Evaluation of General Large Language Models in Contextually Assessing Semantic Concepts Extracted from Adult Critical Care Electronic Health Record Notes

The field of healthcare has increasingly turned its focus towards Large Language Models (LLMs) due to their remarkable performance. However, their performance in actual clinical applications has been underexplored. Traditional evaluations based on question-answering tasks don't fully capture the nuanced contexts. This gap highlights the need for more in-depth and practical assessments of LLMs in real-world healthcare settings. Objective: We sought to evaluate the performance of LLMs in the complex clinical context of adult critical care medicine using systematic and comprehensible analytic methods, including clinician annotation and adjudication. Methods: We investigated the performance of three general LLMs in understanding and processing real-world clinical notes. Concepts from 150 clinical notes were identified by MetaMap and then labeled by 9 clinicians. Each LLM's proficiency was evaluated by identifying the temporality and negation of these concepts using different prompts for an in-depth analysis. Results: GPT-4 showed overall superior performance compared to other LLMs. In contrast, both GPT-3.5 and text-davinci-003 exhibit enhanced performance when the appropriate prompting strategies are employed. The GPT family models have demonstrated considerable efficiency, evidenced by their cost-effectiveness and time-saving capabilities. Conclusion: A comprehensive qualitative performance evaluation framework for LLMs is developed and operationalized. This framework goes beyond singular performance aspects. With expert annotations, this methodology not only validates LLMs' capabilities in processing complex medical data but also establishes a benchmark for future LLM evaluations across specialized domains.

cs.CL↗

arXiv2023

Massive Klein Tunneling in Topological Photonic Crystals

Klein's paradox refers to the transmission of a relativistic particle through a high potential barrier. Although it has a simple resolution in terms of particle-to-antiparticle tunneling (Klein tunneling), debates on its physical meaning seem lasting partially due to the lack of direct experimental verification. In this article, we point out that honeycomb-type photonic crystals (PhCs) provide an ideal platform to investigate the nature of Klein tunneling, where the effective Dirac mass can be tuned in a relatively easy way from a positive value (trivial PhC) to a negative value (topological PhC) via a zero-mass case (PhC graphene). Especially, we show that analysis of the transmission between domains with opposite Dirac masses -- a case hardly be treated within the scheme available so far -- sheds new light on the understanding of the Klein tunneling.

cond-mat.mes-hall↗

arXiv2023

Possible gapless helical edge states in hydrogenated graphene

Electronic band structures in hydrogenated graphene are theoretically investigated by means of first-principle calculations and an effective tight-binding model. It is shown that regularly designed hydrogenation to graphene gives rise to a large band gap about 1 eV. Remarkably, by changing the spatial pattern of the hydrogenation, topologically distinct states can be realized, where the topological nontriviality is detected by $C_2$ parity indices in bulk and confirmed by the existence of gapless edge/interface states as protected by the mirror and sublattice symmetries. The analysis of the wave functions reveals that the helical edge states in hydrogenated graphene with the appropriate design carry pseudospin currents that are reminiscent of the quantum spin Hall effect. Our work shows the potential of hydrogenated graphene in pseudospin-based device applications.

cond-mat.mes-hall↗

arXiv2023

Reconsideration on evaluation of machine learning models in continuous monitoring using wearables

This paper explores the challenges in evaluating machine learning (ML) models for continuous health monitoring using wearable devices beyond conventional metrics. We state the complexities posed by real-world variability, disease dynamics, user-specific characteristics, and the prevalence of false notifications, necessitating novel evaluation strategies. Drawing insights from large-scale heart studies, the paper offers a comprehensive guideline for robust ML model evaluation on continuous health monitoring.

cs.LG↗

arXiv2023

Change Propagation Without Joins

We revisit the classical change propagation framework for query evaluation under updates. The standard framework takes a query plan and materializes the intermediate views, which incurs high polynomial costs in both space and time, with the join operator being the culprit. In this paper, we propose a new change propagation framework without joins, thus naturally avoiding this polynomial blowup. Meanwhile, we show that the new framework still supports constant-delay enumeration of both the deltas and the full query results, the same as in the standard framework. Furthermore, we provide a quantitative analysis of its update cost, which not only recovers many recent theoretical results on the problem, but also yields an effective approach to optimizing the query plan. The new framework is also easy to be integrated into an existing streaming database system. Experimental results show that our system prototype, implemented using Flink DataStream API, significantly outperforms other systems in terms of space, time, and latency.

cs.DB↗

arXiv2023

Interference and switching effect of topological interfacial modes with geometric phase

We investigate interference between topological interfacial modes in a semiconductor photonic crystal platform with Dirac frequency dispersions, which can be exploited for interferometry switch. It is showcased that, in a two-in/two-out structure with four topological waveguides, geometric phases of the two-component spinor wavefunctions of topological photonic modes accumulate at turning points of waveguides, which govern the interferences and split the electromagnetic energy into two output ports with relative power ratio tunable by the relative phase of inputs. We unveil that this brand-new photonic phenomenon is intimately related to the spin-momentum locking property of quantum spin Hall effect, and results from the symphonic contributions of three phase variables: the spinor phase and geometric phase upon design, and the global phase controlled from outside. The present findings open the door for manipulating topological interfacial modes, thus exposing a new facet of topological physics. The topology-driven interference can be incorporated into other devices which is expected to leave far-reaching impacts to advanced photonics, optomechanics and phononics applications.

physics.optics↗

arXiv2023

Learning From Alarms: A Robust Learning Approach for Accurate Photoplethysmography-Based Atrial Fibrillation Detection using Eight Million Samples Labeled with Imprecise Arrhythmia Alarms

Atrial fibrillation (AF) is a common cardiac arrhythmia with serious health consequences if not detected and treated early. Detecting AF using wearable devices with photoplethysmography (PPG) sensors and deep neural networks has demonstrated some success using proprietary algorithms in commercial solutions. However, further advancement of this paradigm of continuous AF detection in ambulatory settings, towards a population-wide screening use case, still faces several challenges, one of which is the lack of large-scale labeled training data. To address this challenge, in this study, we propose to leverage AF alarms from bedside patient monitors to label concurrent PPG signals, resulting in the largest PPG-AF dataset so far (8.5M 30-second records from 24100 patients) and demonstrating a practical approach to build large labeled PPG datasets. Furthermore, we recognize that the AF labels thus obtained contain errors because of false AF alarms generated from imperfect built-in algorithms from bedside monitors. Dealing with label noise with unknown distribution characteristics in this case requires advanced algorithms. We, therefore, introduce and open source a novel loss design, the cluster membership consistency (CMC) loss, to mitigate label errors. By comparing CMC with state-of-the-art methods selected from a noisy label competition, we demonstrate its superiority in multiple aspects including handling label noise in PPG data, resilience to poor-quality signals, and computational efficiency.

eess.SP↗

arXiv2023

Enhancing Grasping Performance of Novel Objects through an Improved Fine-Tuning Process

Grasping algorithms have evolved from planar depth grasping to utilizing point cloud information, allowing for application in a wider range of scenarios. However, data-driven grasps based on models trained on basic open-source datasets may not perform well on novel objects, which are often required in different scenarios, necessitating fine-tuning using new objects. The data driving these algorithms essentially corresponds to the closing region of the hand in 6D pose, and due to the uniqueness of 6D pose, synthetic annotation or real-machine annotation methods are typically employed. Acquiring large amounts of data with real-machine annotation is challenging, making synthetic annotation a common practice. However, obtaining annotated 6D pose data using conventional methods is extremely time-consuming. Therefore, we propose a method to quickly acquire data for novel objects, enabling more efficient fine-tuning. Our method primarily samples grasp orientations to generate and annotate grasps. Experimental results demonstrate that our fine-tuning process for a new object is 400 \% faster than other methods. Furthermore, we propose an optimized grasp annotation framework that accounts for the effects of the gripper closing, making the annotations more reasonable. Upon acceptance of this paper, we will release our algorithm as open-source.

cs.RO↗

arXiv2023

Topological electronic states in holey graphyne

We unveil that the holey graphyne (HGY), a two-dimensional carbon allotrope where benzene rings are connected by two $-$C$\equiv$C$-$ bonds fabricated recently in a bottom-up way, exhibits topological electronic states. Using first-principles calculations and Wannier tight-binding modeling, we discover a higher-order topological invariant associated with $C_2$ symmetry of the material, and show that the resultant corner modes appear in nanoflakes matching to the structure of precursor reported previously, which are ready for direct experimental observations. In addition, we find that a band inversion between emergent $g$-like and $h$-like orbitals gives rise to a nontrivial topology characterized by $\mathbb{Z}_2$ invariant protected by an energy gap as large as 0.52 eV, manifesting helical edge states mimicking those in the prominent quantum spin Hall effect, which can be accessed experimentally after hydrogenation in HGY. We hope these findings trigger interests towards exploring the topological electronic states in HGY and related future electronics applications.

cond-mat.mes-hall↗

arXiv2023

Photoplethysmography based atrial fibrillation detection: an updated review from July 2019

Atrial fibrillation (AF) is a prevalent cardiac arrhythmia associated with significant health ramifications, including an elevated susceptibility to ischemic stroke, heart disease, and heightened mortality. Photoplethysmography (PPG) has emerged as a promising technology for continuous AF monitoring for its cost-effectiveness and widespread integration into wearable devices. Our team previously conducted an exhaustive review on PPG-based AF detection before June 2019. However, since then, more advanced technologies have emerged in this field. This paper offers a comprehensive review of the latest advancements in PPG-based AF detection, utilizing digital health and artificial intelligence (AI) solutions, within the timeframe spanning from July 2019 to December 2022. Through extensive exploration of scientific databases, we have identified 59 pertinent studies. Our comprehensive review encompasses an in-depth assessment of the statistical methodologies, traditional machine learning techniques, and deep learning approaches employed in these studies. In addition, we address the challenges encountered in the domain of PPG-based AF detection. Furthermore, we maintain a dedicated website to curate the latest research in this area, with regular updates on a regular basis.

eess.SP↗