Searcharxiv⌕ Search

arXiv subjects

Xiaoyi Wang

Publications and source records attributed to Xiaoyi Wang.

36 records · Page 2Linked to original sources
arXiv2025

The syntax-semantics interface in a child's path: A study of 3- to 11-year-olds' elicited production of Mandarin recursive relative clauses

There have been apparently conflicting claims over the syntax-semantics relationship in child acquisition. However, few of them have assessed the child's path toward the acquisition of recursive relative clauses (RRCs). The authors of the current paper did experiments to investigate 3- to 11-year-olds' most-structured elicited production of eight Mandarin RRCs in a 4 (syntactic types)*2 (semantic conditions) design. The four syntactic types were RRCs with a subject-gapped RC embedded in an object-gapped RC (SORRCs), RRCs with an object-gapped RC embedded in another object-gapped RC (OORRCs), RRCs with an object-gapped RC embedded in a subject-gapped RC (OSRRCs), and RRCs with a subject-gapped RC embedded in another subject-gapped RC (SSRRCs). Each syntactic type was put in two conditions differing in internal semantics: irreversible internal semantics (IIS) and reversible internal semantics (RIS). For example, "the balloon that [the girl that _ eats the banana] holds _" is SORRCs in the IIS condition; "the monkey that [the dog that _ bites the pig] hits_" is SORRCs in the RIS condition. For each target, the participants were provided with a speech-visual stimulus constructing a condition of irreversible external semantics (IES). The results showed that SSRRCs, OSRRCs and SORRCs in the IIS-IES condition were produced two years earlier than their counterparts in the RIS-IES condition. Thus, a 2-stage development path is proposed: the language acquisition device starts with the interface between (irreversible) syntax and IIS, and ends with the interface between syntax and IES, both abiding by the syntax-semantic interface principle.

cs.CL↗
arXiv2024

Children's Acquisition of Tail-recursion Sequences: A Review of Locative Recursion and Possessive Recursion as Examples

Recursion is the nature of human natural language. Since Chomsky proposed generative grammar, many scholars have studied recursion either theoretically or empirically. However, by observing children's acquisition of tail recursion sequences, we can verify the nativism of language supported by universal grammar and reveal the cognitive mechanism of human brain. To date, our understanding of children's acquisition path of recursion and influencing factors still remain controversial. This systematic review summarizes the research of tail recursive sequence by taking possessive recursion and locative recursion as examples, focusing on the experimental methods, acquisition paths, and influencing factors of tail recursive sequence. The current behavioural experiments reveal that, the debate about children's performance revolves around: 1) Gradual acquisition or synchronous acquisition. 2) symmetry or asymmetry between the acquisition of locative recursion sequences and possessive recursion sequences. We presume that children can acquire recursion quickly in a short period of time thanks to the language acquisition device, though there are also scholars who believe that a third factor also plays a role.

cs.NE↗
arXiv2024

Stochastic Kinematic Optimal Control on SO(3)

In this paper, we develop a novel method for deriving a global optimal control strategy for stochastic attitude kinematics on the special orthogonal group SO(3). We first introduce a stochastic Lie-Hamilton-Jacobi-Bellman (SL-HJB) equation on SO(3), which theoretically provides an optimality condition for the global optimal control strategy of the stochastic attitude kinematics. Then we propose a novel numerical method, the Successive Wigner-Galerkin Approximation (SWGA) method, to solve the SL-HJB equation on SO(3). The SWGA method leverages the Wigner-D functions to represent the Galerkin solution of the SL-HJB equation in a policy iteration framework, providing a computationally efficient approach to derive a global optimal control strategy for systems on SO(3). We demonstrate the effectiveness of the SWGA method through numerical simulation on stochastic attitude stabilization.

math.OC↗
arXiv2024

Automatic Tissue Traction Using Miniature Force-Sensing Forceps for Minimally Invasive Surgery

A common limitation of autonomous tissue manipulation in robotic minimally invasive surgery (MIS) is the absence of force sensing and control at the tool level. Recently, our team has developed miniature force-sensing forceps that can simultaneously measure the grasping and pulling forces during tissue manipulation. Based on this design, here we further present a method to automate tissue traction that comprises grasping and pulling stages. During this process, the grasping and pulling forces can be controlled either separately or simultaneously through force decoupling. The force controller is built upon a static model of tissue manipulation, considering the interaction between the force-sensing forceps and soft tissue. The efficacy of this force control approach is validated through a series of experiments comparing targeted, estimated, and actual reference forces. To verify the feasibility of the proposed method in surgical applications, various tissue resections are conducted on ex vivo tissues employing a dual-arm robotic setup. Finally, we discuss the benefits of multi-force control in tissue traction, evidenced through comparative analyses of various ex vivo tissue resections with and without the proposed method, and the potential generalization with traction on different tissues. The results affirm the feasibility of implementing automatic tissue traction using miniature forceps with multi-force control, suggesting its potential to promote autonomous MIS. A video demonstrating the experiments can be found at https://youtu.be/f5gXuXe67Ak.

cs.RO↗
arXiv2023

Preferential bond formation and interstitial/vacancy annihilation rate drive atomic clustering in gallium ion sputtered compound materials

The investigation of chemical reactions during the ion irradiation is a frontier for the study of the ion-material interaction. In order to derive the contribution of bond formation to chemistry of ion produced nanoclusters, the valence electron energy loss spectroscopy (VEELS) was exploited to investigate the Ga$^+$ ion damage in Al$_2$O$_3$, InP and InGaAs, where each target material has been shown to yield different process for altering the clustering of recoil atoms: metallic Ga, metallic In and InGaP clusters in Al$_2$O$_3$, InP and InGaAs respectively. Supporting simulations based on Monte Carlo and crystal orbital Hamiltonianindicate that the chemical constitution of cascade induced nano-precipitates is a result of a competition between interstitial/vacancy consumption rate and preferential bond formation.

cond-mat.mtrl-sci↗
arXiv2022

Extraction of Vascular Wall in Carotid Ultrasound via a Novel Boundary-Delineation Network

Ultrasound imaging plays an important role in the diagnosis of vascular lesions. Accurate segmentation of the vascular wall is important for the prevention, diagnosis and treatment of vascular diseases. However, existing methods have inaccurate localization of the vascular wall boundary. Segmentation errors occur in discontinuous vascular wall boundaries and dark boundaries. To overcome these problems, we propose a new boundary-delineation network (BDNet). We use the boundary refinement module to re-delineate the boundary of the vascular wall to obtain the correct boundary location. We designed the feature extraction module to extract and fuse multi-scale features and different receptive field features to solve the problem of dark boundaries and discontinuous boundaries. We use a new loss function to optimize the model. The interference of class imbalance on model optimization is prevented to obtain finer and smoother boundaries. Finally, to facilitate clinical applications, we design the model to be lightweight. Experimental results show that our model achieves the best segmentation results and significantly reduces memory consumption compared to existing models for the dataset.

eess.IV↗
arXiv2022

Adaptive Tests for Bandedness of High-dimensional Covariance Matrices

Estimation of the high-dimensional banded covariance matrix is widely used in multivariate statistical analysis. To ensure the validity of estimation, we aim to test the hypothesis that the covariance matrix is banded with a certain bandwidth under the high-dimensional framework. Though several testing methods have been proposed in the literature, the existing tests are only powerful for some alternatives with certain sparsity levels, whereas they may not be powerful for alternatives with other sparsity structures. The goal of this paper is to propose a new test for the bandedness of high-dimensional covariance matrix, which is powerful for alternatives with various sparsity levels. The proposed new test also be used for testing the banded structure of covariance matrices of error vectors in high-dimensional factor models. Based on these statistics, a consistent bandwidth estimator is also introduced for a banded high dimensional covariance matrix. Extensive simulation studies and an application to a prostate cancer dataset from protein mass spectroscopy are conducted for evaluating the effectiveness of the proposed adaptive tests blue and bandwidth estimator for the banded covariance matrix.

stat.ME↗
arXiv2021

Optimizing Memory Efficiency of Graph Neural Networks on Edge Computing Platforms

Graph neural networks (GNN) have achieved state-of-the-art performance on various industrial tasks. However, the poor efficiency of GNN inference and frequent Out-Of-Memory (OOM) problem limit the successful application of GNN on edge computing platforms. To tackle these problems, a feature decomposition approach is proposed for memory efficiency optimization of GNN inference. The proposed approach could achieve outstanding optimization on various GNN models, covering a wide range of datasets, which speeds up the inference by up to 3x. Furthermore, the proposed feature decomposition could significantly reduce the peak memory usage (up to 5x in memory efficiency improvement) and mitigate OOM problems during GNN inference.

cs.LG↗
arXiv2020

GAKP: GRU Association and Kalman Prediction for Multiple Object Tracking

Multiple Object Tracking (MOT) has been a useful yet challenging task in many real-world applications such as video surveillance, intelligent retail, and smart city. The challenge is how to model long-term temporal dependencies in an efficient manner. Some recent works employ Recurrent Neural Networks (RNN) to obtain good performance, which, however, requires a large amount of training data. In this paper, we proposed a novel tracking method that integrates the auto-tuning Kalman method for prediction and the Gated Recurrent Unit (GRU) and achieves a near-optimum with a small amount of training data. Experimental results show that our new algorithm can achieve competitive performance on the challenging MOT benchmark, and faster and more robust than the state-of-the-art RNN-based online MOT algorithms.

cs.CV↗
arXiv2020

Argus: Interactive a priori Power Analysis

A key challenge HCI researchers face when designing a controlled experiment is choosing the appropriate number of participants, or sample size. A prior power analysis examines the relationships among multiple parameters, including the complexity associated with human participants, e.g., order and fatigue effects, to calculate the statistical power of a given experiment design. We created Argus, a tool that supports interactive exploration of statistical power: Researchers specify experiment design scenarios with varying confounds and effect sizes. Argus then simulates data and visualizes statistical power across these scenarios, which lets researchers interactively weigh various trade-offs and make informed decisions about sample size. We describe the design and implementation of Argus, a usage scenario designing a visualization experiment, and a think-aloud study.

cs.HC↗
arXiv2020

DP-Net: Dynamic Programming Guided Deep Neural Network Compression

In this work, we propose an effective scheme (called DP-Net) for compressing the deep neural networks (DNNs). It includes a novel dynamic programming (DP) based algorithm to obtain the optimal solution of weight quantization and an optimization process to train a clustering-friendly DNN. Experiments showed that the DP-Net allows larger compression than the state-of-the-art counterparts while preserving accuracy. The largest 77X compression ratio on Wide ResNet is achieved by combining DP-Net with other compression techniques. Furthermore, the DP-Net is extended for compressing a robust DNN model with negligible accuracy loss. At last, a custom accelerator is designed on FPGA to speed up the inference computation with DP-Net.

cs.LG↗
arXiv2019

Spread-Spectrum Selective Camouflaging based on Time-Modulated Metasurface

This paper presents the concept of spread-spectrum selective camouflaging based on time-modulated metasurface. The spectrum spreading is realized by switching the metasurface between the reflective states of a PEC mirror and a PMC mirror, using an array of microstrip patches connected to the ground via diode switches, according to a periodic pseudo-random noise sequence. As the spectrum spreading induces a drastic reduction of the power spectral density of the signal, the level of the scattered wave falls below the noise floor of the interrogating radar, and the object covered by the metasurface is hence perfectly camouflaged to a foe radar. Moreover, the object can be detected by a friend radar possessing the spread-spectrum demodulation key corresponding to the metasurface modulation, and this detection is robust to interfering signals. The proposed system is analyzed theoretically, and demonstrated by both simulation and experimental results.

physics.app-ph↗
arXiv2018

Microwave Hilbert Transformer and its Applications in Real-time Analog Processing (RAP)

A microwave Hilbert transformer is introduced as a new component for Real-time Analog Processing (RAP). In contrast to its optical counterpart, that resort to optical fiber gratings, this Hilbert transformer is based on the combination of a branch-line coupler and a loop resonator. The transfer function of the transformer is derived using signal flow graphs, and two figures of merits are introduced to effectively characterize the device: the rotated phase and the transition bandwidth. Moreover, a detailed physical explanation of its physical operation is given, using both a steady-state regime perspective and a transient regime perspective. The microwave RAP Hilbert transformer is demonstrated experimentally, and demonstrated in three applications: edge detection, peak suppression and single sideband modulation.

eess.SP↗
arXiv2018

Real-Time Spectrum Sniffer for Cognitive Radio Based on Rotman Lens Spectrum Decomposer

We introduce the concept of a Rotman-lens spectrum decomposer (RLSD) real-time spectrum-sniffer (RTSS) for cognitive radio. Compared to a previously existing RTSS, the RLSD-RTSS offers the advantages of being 1) based an a simpler and lower-cost purely passive structure, 2) easier to design and easily amenable to tunability, 3) of much broader bandwidth, and 4) of accommodating more channels. The electrical size of the device is electrically larger, but perfectly acceptable in the millimeter-wave frequency range. The proposed RLSD-RTSS is demonstrated theoretically and experimentally, and been shown to support tunability in terms of both bandwidth-resolution and operation band. Given its unique features, this device may find wide applications in 5G UHD and 3D video systems.

physics.app-ph↗
arXiv2017

Transitively-Saturated Property, Banach Recurrence and Lyapunov Regularity

The topological entropy of various gap-sets on periodic-like recurrence and Birkhoff regularity were considered in [69] but some Banach recurrence and Lyapunov regularity are not considered. In this paper we introduce five new levels on Banach recurrence and show they all carry full topological entropy, and simultaneously combine with Lyapunov regularity to get some refined theory on mixed multifractal analysis of [8,29]. In this process, we strengthen Pfister and Sullivan's result of [58] from saturated property to transitively-saturated property (and from single-saturated property to transitively-convex-saturated property).

math.DS↗
arXiv2017

Flexible-Resolution, Arbitrary-Input and Tunable Rotman Lens Spectrum Decomposer (RL-SD)

We present an enhanced design -- in terms of resolution flexibility, input port position arbitrariness and frequency-range tunability -- of the planar Rotman lens spectrum decomposer (RL-SD). This enhancement is achieved by manipulating the output port locations through proper sampling of the frequency-position law of the RL-SD, inserting a calibration array compensating for frequency deviation induced by input modification and introducing port switching, respectively. A complete design procedure is provided and two enhanced RL-SD prototypes, with uniform port distribution and uniform frequency resolution, respectively, are numerically and experimentally demonstrated.

physics.optics↗
arXiv2017

Reducing the uncertainty in the forest volume-to-biomass relationship built from limited field plots

The method of biomass estimation based on a volume-to-biomass relationship has been applied in estimating forest biomass conventionally through the mean volume (m3 ha-1). However, few studies have been reported concerning the verification of the volume-biomass equations regressed using field data. The possible bias may result from the volume measurements and extrapolations from sample plots to stands or a unit area. This paper addresses (i) how to verify the volume-biomass equations, and (ii) how to reduce the bias while building these equations. This paper presents an applicable method for verifying the field data using reasonable wood densities, restricting the error in field data processing based on limited field plots, and achieving a better understanding of the uncertainty in building those equations. The verified and improved volume-biomass equations are more reliable and will help to estimate forest carbon sequestration and carbon balance at any large scale.

stat.AP↗