SearcharxivSearch

arXiv subjects

Zhuo Diao

Publications and source records attributed to Zhuo Diao.

10 recordsLinked to original sources

The Breakthrough of Sleep: A Contactless Approach for Accurate Sleep Stage Detection Using the Sleepal AI Lamp

Sleep staging is essential for the assessment of sleep quality and the diagnosis of sleep-related disorders. Conventional polysomnography (PSG), while considered the gold standard, is intrusive, labor-intensive, and unsuitable for long-term monitoring. This study evaluates the performance of the Sleepal AI Lamp, a contactless, radar-based consumer-grade sleep tracker, in comparison with gold-standard polysomnography (PSG), using a large-scale dataset comprising 1022 overnight recordings. We extract multi-scale respiratory and motion-related features from radar signals to train a frequency-augmented deep learning model. For the binary sleep-wake classification task, experimental results demonstrated that the model achieved an accuracy of 92.8% alongside a macro-averaged F1 score of 0.895. For four-stage classification (wake, light NREM (N1 + N2), deep NREM (N3), REM), the model achieved an accuracy of 78.5% with a Cohen's kappa coefficient of 0.695 in healthy individuals and maintained a stable accuracy of 77.2% with a kappa of 0.677 in a heterogeneous population including patients with varying severities of obstructive sleep apnea (OSA). These experimental results demonstrate that the sleep staging performance of the contactless Sleepal AI Lamp is in high agreement with expert-labeled PSG sleep stages. Our findings suggest that non-contact radar sensing, combined with advanced temporal modeling, can provide reliable sleep staging performance without requiring physical contact or wearable devices. Owing to its unobtrusive nature, ease of deployment, and robustness to long-term use, the contactless Sleepal AI Lamp shows strong potential for clinical screening, home-based sleep assessment, and continuous longitudinal sleep monitoring in real-world medical and healthcare applications.

eess.SP

Integrating Domain-Specialized Language Models with AI Measurement Tools for Deterministic Atomic-Resolution Experimentation

Self-driving laboratories based on large language models promise to transform scientific discovery through general experimental automation. However, realizing this vision on precision platforms remains challenging, requiring deterministic execution and effective domain adaptation under strict physical constraints. We address these requirements through a framework that specializes in small language models for autonomous control of scanning probe microscopy, coordinating task-specific models with AI-driven measurement tools. We demonstrate real-time, atomic-resolution SPM experiments at room temperature, achieving instruction-level control and multi-step experimental planning. Fine-tuning reduces perplexity from 1.44 to 1.20 and improves reliability, with the adapted model reaching 99.3% and 95.2% command accuracy, outperforming OpenAI o4-mini on domain-specific tasks. This architecture achieves lower computational cost while maintaining deterministic execution and enabling deployment on consumer-grade hardware. This work bridges probabilistic language models with deterministic experimental control through a modular, domain-specialized architecture, providing a generalizable pathway toward scalable and trustworthy self-driving laboratories across diverse scientific platforms.

physics.app-ph

Leveraging Large Language Models and Social Media for Automation in Scanning Probe Microscopy

We present the development of an automated scanning probe microscopy (SPM) measurement system using an advanced large-scale language model (LLM). This SPM system can receive instructions via social networking services (SNS), and the integration of SNS and LLMs enables real-time, language-agnostic control of SPM operations, thereby improving accessibility and efficiency. The integration of LLMs with AI systems with specialized functions brings the realization of self-driving labs closer.

physics.app-ph

AI-equipped scanning probe microscopy for autonomous site-specific atomic-level characterization at room temperature

We present an advanced scanning probe microscopy system enhanced with artificial intelligence (AI-SPM) designed for self-driving atomic-scale measurements. This system expertly identifies and manipulates atomic positions with high precision, autonomously performing tasks such as spectroscopic data acquisition and atomic adjustment. An outstanding feature of AI-SPM is its ability to detect and adapt to surface defects, targeting or avoiding them as necessary. It's also engineered to address typical challenges such as positional drift and tip apex atomic variations due to the thermal effect, ensuring accurate, site-specific surface analyses. Our tests under the demanding conditions of room temperature have demonstrated the robustness of the system, successfully navigating thermal drift and tip fluctuations. During these tests on the Si(111)-(7x7) surface, AI-SPM autonomously identified defect-free regions and performed a large number of current-voltage spectroscopy measurements at different adatom sites, while autonomously compensating for thermal drift and monitoring probe health. These experiments produce extensive data sets that are critical for reliable materials characterization and demonstrate the potential of AI-SPM to significantly improve data acquisition. The integration of AI into SPM technologies represents a step toward more effective, precise and reliable atomic-level surface analysis, revolutionizing materials characterization methods.

physics.comp-ph

Machine-learning Based Extraction of the Short-Range Part of the Interaction in Non-contact Atomic Force Microscopy

A machine-learning method for extracting the short-range part of the probe-surface interaction from force spectroscopy curves is presented. Our machine-learning algorithm consists of two stages: the first stage determines a boundary that separates the region where the short-range interaction is dominantly acting on the probe, and a second stage that finds the parameters to fit the interaction over the long-range region. We successfully applied this method to force spectroscopy maps acquired over the Si(111)-(7x7) surface and found, as a result, a faint structure on the short-range interaction for one of the probes used in the experiments that would have probably been obviated using human-supervised fitting strategies.

cond-mat.mes-hall

A combinatorial property of flows on a cycle

In this paper, we prove a combinatorial property of flows on a cycle. $C(V,E)$ is an undirected cycle with two commodities: $\{s_{1},t_{1}\}, \{s_{2},t_{2}\}$;$r_1>0,r_2>0, \mathbf r=(r_i)_{i=1,2}$ and $f,f'$ are both feasible flows for $(C,(s_i,t_i)_{i=1,2},\mathbf r)$. Then $\exists i\in\{1,2\}, p\in P_i, f(p)>0, \forall e\in p, f(e)\geq f'(e)$ ; Here for each $i\in\{1,2\}$, let $P_i$ be the set of $s_i$-$t_i$ paths in $C$ and $P=\cup_{i=1,2}P_i$. This means given a two-commodity instance on a cycle, any two distinct network flow $f$ and $f'$, compared with $f'$, $f$ can't decrease every path's flow amount at the same time. This combinatorial property is a generalization from single-commodity case to two-commodity case, and we also give an instance to illustrate the combinatorial property doesn't hold on for $k-$commodity case when $k\geq 3$.

math.CO

On the feedback number of 3-uniform hypergraph

Let $H=(V,E)$ be a hypergraph with vertex set $V$ and edge set $E$. $S\subseteq V$ is a feedback vertex set (FVS) of $H$ if $H\setminus S$ has no cycle and $τ_c(H)$ denote the minimum cardinality of a FVS of $H$. In this paper, we prove $(i)$ if $H$ is a linear $3$-uniform hypergraph with $m$ edges, then $τ_c(H)\le m/3$. $(ii)$ if $H$ is a $3$-uniform hypergraph with $m$ edges, then $τ_c(H)\le m/2$ and furthermore, the equality holds on if and only if every component of $H$ is a $2-$cycle. Let $H=(V,E)$ be a hypergraph with vertex set $V$ and edge set $E$. $A\subseteq E$ is a feedback edge set (FES) of $H$ if $H\setminus A$ has no cycle and $τ_c'(H)$ denote the minimum cardinality of a FES of $H$. In this paper, we prove if $H$ is a $3$-uniform hypergraph with $p$ components, then $τ_c'(H)\le 2m-n+p$.

math.CO

Approximation algorithms on $k-$ cycle covering and $k-$ clique covering

Given a weighted graph $G(V,E)$ with weight $\mathbf w: E\rightarrow Z^{|E|}_{+}$. A $k-$cycle covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$cycle. The minimum weight of $k-$cycle covering is the weighted covering number on $k-$cycle, denoted by $τ_{k}(G_{w})$. In this paper, we design a $k-1/2$ approximation algorithm for the weighted covering number on $k-$cycle when $k$ is odd. Given a weighted graph $G(V,E)$ with weight $\mathbf w: E\rightarrow Z^{|E|}_{+}$. A $k-$clique covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$clique. The minimum weight of $k-$clique covering is the weighted covering number on $k-$clique, denoted by $\widetilde{τ_{k}}(G_{w})$. In this paper, we design a $(k^{2}-k-1)/2$ approximation algorithm for the weighted covering number on $k-$clique. Last, we discuss the relationship between $k-$clique covering and $k-$clique packing in complete graph $K_{n}$.

cs.DM

On the vertex cover number of 3 uniform hypergraph

Given a hypergraph H(V;E), a set of vertices S in V is a vertex cover if every edge has at least a vertex in S. The vertex cover number is the minimum cardinality of a vertex cover, denoted by t(H). In this paper, we prove that for every 3 uniform connected hypergraph H(V;E), t(H)<=(2m+1)/3 holds on where m is the number of edges. Furthermore, the equality holds on if and only if H(V;E) is a hypertree with perfect matching.

math.CO

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles

Given a simple graph $G=(V,E)$, a subset of $E$ is called a triangle cover if it intersects each triangle of $G$. Let $ν_t(G)$ and $τ_t(G)$ denote the maximum number of pairwise edge-disjoint triangles in $G$ and the minimum cardinality of a triangle cover of $G$, respectively. Tuza conjectured in 1981 that $τ_t(G)/ν_t(G)\le2$ holds for every graph $G$. In this paper, using a hypergraph approach, we design polynomial-time combinatorial algorithms for finding small triangle covers. These algorithms imply new sufficient conditions for Tuza's conjecture on covering and packing triangles. More precisely, suppose that the set $\mathscr T_G$ of triangles covers all edges in $G$. We show that a triangle cover of $G$ with cardinality at most $2ν_t(G)$ can be found in polynomial time if one of the following conditions is satisfied: (i) $ν_t(G)/|\mathscr T_G|\ge\frac13$, (ii) $ν_t(G)/|E|\ge\frac14$, (iii) $|E|/|\mathscr T_G|\ge2$. Keywords: Triangle cover, Triangle packing, Linear 3-uniform hypergraphs, Combinatorial algorithms

cs.GR