BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Qiang Cheng

Qiang Cheng contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Machine Learningeess.SPInformation Theorymath.ITArtificial IntelligenceComputer Visioncond-mat.supr-conphysics.opticsApplicationsComputationcs.CYSocial and Information Networks

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
20works
0followers
12topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

20 published item(s)

preprint2026arXiv

Programmable calculus operations in electromagnetic space using space-time-coding metasurface

With the rapid advancement of metasurfaces and the increasing demand for programmable metasurfaces to simplify information systems, wave-based computation using metasurfaces has emerged as an attractive research topic. To facilitate the mathematical operations in electromagnetic (EM) space, here we propose a space-time coding metasurface (STCM) system capable of directly performing calculus operations on the spatial energy distributions of EM waves. By exploiting harmonic characteristics induced by time-varying coding, the responses of meta-atoms at specific harmonics can be flexibly controlled, which enables the metasurface system to address more complex tasks. Owing to its programmability, the STCM can dynamically switch functions in real time to accommodate different calculus tasks. To fully leverage the capability of STCM, we not only present the space-time coding sequences for differentiation and integration of EM waves, but also develop and numerically simulate the space-time coding sequences that can independently and simultaneously implement different calculus operations on the same incident EM waves. To experimentally validate the feasibility of the EM calculus operations, proof-of-concept experiments are conducted using a programmable 2-bit STCM. Good agreements among the theory, numerical simulations, and experiments confirm the feasibility of performing calculus operations in the EM space and demonstrate the broad application prospects of STCM in EM wave manipulations, wireless communications, and signal processing.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Programmable radio-frequency calculations in electromagnetic-wave domain

Information metasurfaces have emerged as pivotal components in next-generation electronic systems, with significant progress in their applications to communication, radar, and sensing. However, the current researches are mainly focused on their physical structures and system functions, while radio-frequency (RF) signal processing and calculation remain constrained to digital-domain operations. This reliance on digital conversion inherently increases hardware complexity and power consumption. To address this challenge, we propose a programmable RF calculation system based on a space-time-coding metasurface (STCM), which can control the wave-matter interactions through space-time-coding (STC) strategies and achieve direct RF calculations in the electromagnetic (EM) space in a reprogrammable way. Particularly, the fundamental signal operations - Fourier transform and convolution - are implemented in the EM-wave domain successfully. We validate the RF calculation capabilities in radar scenarios, facilitating the accurate detection of target velocity and range. Theoretical analysis, numerical simulations, and experimental results collectively demonstrate that the STCM-based RF calculation system exhibits superior precision, enhanced operational efficiency, and notable cost-effectiveness, highlighting its significant potentials for the next-generation electronic system deployments.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Reasoning-Aware Training for Time Series Forecasting

Time Series Foundation Models (TSFMs) excel at numerical forecasting but operate as black boxes lacking qualitative reasoning. Conversely, applying LLMs directly to temporal data introduces a modality gap: text tokenizers fragment continuous numerical values, degrading mathematical relationships and exploding sequence lengths, leading to computational overhead. To resolve this, we introduce STRIDE (Strategic Time-series Reasoning Injected via Distilled Embeddings), a novel framework natively integrating LLM reasoning into the continuous embedding space of TSFMs. Instead of discrete tokens, STRIDE distills reasoning traces into a lightweight LLM, dynamically projecting its mean-pooled hidden states as a cross-modal prior into the target numerical encoder. The architecture is jointly optimized using cross-entropy and quantile losses. Evaluations demonstrate STRIDE establishes state-of-the-art numerical forecasting on GIFT-Eval (0.674 MASE, 0.454 CRPS) compared to TSFMs and exhibits superior in-domain and out-of-domain numerical as well as reasoning performance on TFRBench. Specifically, STRIDE acts as a plug-and-play enhancement, consistently improving diverse TSFMs (e.g., Chronos-2, Timer-S1) across various LLM configurations. Thus, injecting semantic reasoning as a continuous prior equips TSFMs with human-interpretable reasoning while fundamentally improving predictive accuracy.

0 citations0 reviewsNo code linkedOpen access
preprint2023arXiv

RIS-Assisted Joint Uplink Communication and Imaging: Phase Optimization and Bayesian Echo Decoupling

Achieving integrated sensing and communication (ISAC) via uplink transmission is challenging due to the unknown waveform and the coupling of communication and sensing echoes. In this paper, a joint uplink communication and imaging system is proposed for the first time, where a reconfigurable intelligent surface (RIS) is used to manipulate the electromagnetic signals for echo decoupling at the base station (BS). Aiming to enhance the transmission gain in desired directions and generate required radiation pattern in the region of interest (RoI), a phase optimization problem for RIS is formulated, which is high dimensional and nonconvex with discrete constraints. To tackle this problem, a back propagation based phase design scheme for both continuous and discrete phase models is developed. Moreover, the echo decoupling problem is tackled using the Bayesian method with the factor graph technique, where the problem is represented by a graph model which consists of difficult local functions. Based on the graph model, a message-passing algorithm is derived, which can efficiently cooperate with the adaptive sparse Bayesian learning (SBL) to achieve joint communication and imaging. Numerical results show that the proposed method approaches the relevant lower bound asymptotically, and the communication performance can be enhanced with the utilization of imaging echoes.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Alcohol Intake Differentiates AD and LATE: A Telltale Lifestyle from Two Large-Scale Datasets

Alzheimer's disease (AD), as a progressive brain disease, affects cognition, memory, and behavior. Similarly, limbic-predominant age-related TDP-43 encephalopathy (LATE) is a recently defined common neurodegenerative disease that mimics the clinical symptoms of AD. At present, the risk factors implicated in LATE and those distinguishing LATE from AD are largely unknown. We leveraged an integrated feature selection-based algorithmic approach, to identify important factors differentiating subjects with LATE and/or AD from Control on significantly imbalanced data. We analyzed two datasets ROSMAP and NACC and discovered that alcohol consumption was a top lifestyle and environmental factor linked with LATE and AD and their associations were differential. In particular, we identified a specific subpopulation consisting of APOE e4 carriers. We found that, for this subpopulation, light-to-moderate alcohol intake was a protective factor against both AD and LATE, but its protective role against AD appeared stronger than LATE. The codes for our algorithms are available at https://github.com/xinxingwu-uk/PFV.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Algorithmic Stability and Generalization of an Unsupervised Feature Selection Algorithm

Feature selection, as a vital dimension reduction technique, reduces data dimension by identifying an essential subset of input features, which can facilitate interpretable insights into learning and inference processes. Algorithmic stability is a key characteristic of an algorithm regarding its sensitivity to perturbations of input samples. In this paper, we propose an innovative unsupervised feature selection algorithm attaining this stability with provable guarantees. The architecture of our algorithm consists of a feature scorer and a feature selector. The scorer trains a neural network (NN) to globally score all the features, and the selector adopts a dependent sub-NN to locally evaluate the representation abilities for selecting features. Further, we present algorithmic stability analysis and show that our algorithm has a performance guarantee via a generalization error bound. Extensive experimental results on real-world datasets demonstrate superior generalization performance of our proposed algorithm to strong baseline methods. Also, the properties revealed by our theoretical analysis and the stability of our algorithm-selected features are empirically confirmed.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Deepened Graph Auto-Encoders Help Stabilize and Enhance Link Prediction

Graph neural networks have been used for a variety of learning tasks, such as link prediction, node classification, and node clustering. Among them, link prediction is a relatively under-studied graph learning task, with current state-of-the-art models based on one- or two-layer of shallow graph auto-encoder (GAE) architectures. In this paper, we focus on addressing a limitation of current methods for link prediction, which can only use shallow GAEs and variational GAEs, and creating effective methods to deepen (variational) GAE architectures to achieve stable and competitive performance. Our proposed methods innovatively incorporate standard auto-encoders (AEs) into the architectures of GAEs, where standard AEs are leveraged to learn essential, low-dimensional representations via seamlessly integrating the adjacency information and node features, while GAEs further build multi-scaled low-dimensional representations via residual connections to learn a compact overall embedding for link prediction. Empirically, extensive experiments on various benchmarking datasets verify the effectiveness of our methods and demonstrate the competitive performance of our deepened graph models for link prediction. Theoretically, we prove that our deep extensions inclusively express multiple polynomial filters with different orders.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Fractal Autoencoders for Feature Selection

Feature selection reduces the dimensionality of data by identifying a subset of the most informative features. In this paper, we propose an innovative framework for unsupervised feature selection, called fractal autoencoders (FAE). It trains a neural network to pinpoint informative features for global exploring of representability and for local excavating of diversity. Architecturally, FAE extends autoencoders by adding a one-to-one scoring layer and a small sub-neural network for feature selection in an unsupervised fashion. With such a concise architecture, FAE achieves state-of-the-art performances; extensive experimental results on fourteen datasets, including very high-dimensional data, have demonstrated the superiority of FAE over existing contemporary methods for unsupervised feature selection. In particular, FAE exhibits substantial advantages on gene expression data exploration, reducing measurement cost by about $15$\% over the widely used L1000 landmark genes. Further, we show that the FAE framework is easily extensible with an application.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Log-based Sparse Nonnegative Matrix Factorization for Data Representation

Nonnegative matrix factorization (NMF) has been widely studied in recent years due to its effectiveness in representing nonnegative data with parts-based representations. For NMF, a sparser solution implies better parts-based representation.However, current NMF methods do not always generate sparse solutions.In this paper, we propose a new NMF method with log-norm imposed on the factor matrices to enhance the sparseness.Moreover, we propose a novel column-wisely sparse norm, named $\ell_{2,\log}$-(pseudo) norm to enhance the robustness of the proposed method.The $\ell_{2,\log}$-(pseudo) norm is invariant, continuous, and differentiable.For the $\ell_{2,\log}$ regularized shrinkage problem, we derive a closed-form solution, which can be used for other general problems.Efficient multiplicative updating rules are developed for the optimization, which theoretically guarantees the convergence of the objective value sequence.Extensive experimental results confirm the effectiveness of the proposed method, as well as the enhanced sparseness and robustness.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Modeling and Measurements for Multi-path Mitigation with Reconfigurable Intelligent Surfaces

A reconfigurable intelligent surface (RIS) is capable of manipulating electromagnetic waves with its flexibly configurable unit cells, thus is an appealing technology to resist fast fading caused by multi-path in wireless communications. In this paper, a two-path propagation model for RIS-assisted wireless communications is proposed by considering both the direct path from the transmitter to the receiver and the assisted path provided by the RIS. The proposed propagation model unveils that the phase shifts of RISs can be optimized by appropriate configuration for multi-path fading mitigation. In particular, four types of RISs with different configuration capabilities are introduced and their performances on improving received signal power in virtue of the assisted path to resist fast fading are compared through extensive simulation results. In addition, an RIS operating at 35 GHz is used for experimental measurement. The experimental results verify that an RIS has the ability to combat fast fading and thus improves the receiving performance, which may lay a foundation for further researches.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

On Channel Reciprocity in Reconfigurable Intelligent Surface Assisted Wireless Network

Channel reciprocity greatly facilitates downlink precoding in time-division duplexing (TDD) multiple-input multiple-output (MIMO) communications without the need for channel state information (CSI) feedback. Recently, reconfigurable intelligent surfaces (RISs) emerge as a promising technology to enhance the performance of future wireless networks. However, since the artificial electromagnetic characteristics of RISs do not strictly follow the normal laws of nature, it brings up a question: does the channel reciprocity hold in RIS-assisted TDD wireless networks? After briefly reviewing the reciprocity theorem, in this article, we show that there still exists channel reciprocity for RIS-assisted wireless networks satisfying certain conditions. We also experimentally demonstrate the reciprocity at the sub-6 GHz and the millimeter-wave frequency bands by using two fabricated RISs. Furthermore, we introduce several RIS-assisted approaches to realizing nonreciprocal channels. Finally, potential opportunities brought by reciprocal/nonreciprocal RISs and future research directions are outlined.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Path Loss Modeling and Measurements for Reconfigurable Intelligent Surfaces in the Millimeter-Wave Frequency Band

Reconfigurable intelligent surfaces (RISs) provide an interface between the electromagnetic world of wireless propagation environments and the digital world of information science. Simple yet sufficiently accurate path loss models for RISs are an important basis for theoretical analysis and optimization of RIS-assisted wireless communication systems. In this paper, we refine our previously proposed free-space path loss model for RISs to make it simpler, more applicable, and easier to use. The impact of the antenna's directivity of the transmitter, receiver, and the unit cells of the RIS on the path loss is explicitly formulated as an angle-dependent loss factor. The refined model gives more accurate estimates of the path loss of RISs comprised of unit cells with a deep sub-wavelength size. Based on the proposed model, the properties of a single unit cell are evaluated in terms of scattering performance, power consumption, and area, which allows us to unveil fundamental considerations for deploying RISs in high frequency bands. Two fabricated RISs operating in the millimeter-wave (mmWave) band are utilized to carry out a measurement campaign. The measurement results are shown to be in good agreement with the proposed path loss model. In addition, the experimental results suggest an effective form to characterize the power radiation pattern of the unit cell for path loss modeling.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Double Andreev reflections and double normal reflections in nodal-line semimetal-superconductor junctions

We study systematically the scattering processes and the conductance spectra in nodal-line semimetalsuperconductor junctions using the extended Blonder-Tinkham-Klapwijk theory. The coexistence of peculiar quadruple reflections are found, which are the specular normal reflection, the retro-normal reflection, the specular Andreev reflection and the retro-Andreev reflection. The incident angle dependence and the quasiparticle energy dependence of the double normal reflections and the double Andreev reflections are investigated under various values of parameters such as the interfacial barrier height, the chemical potentials, and the orbital coupling strength. It is found that the appearance and the disappearance of the reflections and their magnitudes can be controlled through tuning these parameters. The scattering mechanism for the reflections are analyzed in details from the viewpoint of the band structure. We also investigate the conductance spectra for the junctions, which show distinctive features and strong anisotropy about the orientation relationships of the nodal line and interface. The unique scattering processes and conductance spectra found in the junctions are helpful in designing superconducting electronic devices and searching for the nodal line in materials experimentally.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

MIMO Transmission through Reconfigurable Intelligent Surface: System Design, Analysis, and Implementation

Reconfigurable intelligent surface (RIS) is a new paradigm that has great potential to achieve cost-effective, energy-efficient information modulation for wireless transmission, by the ability to change the reflection coefficients of the unit cells of a programmable metasurface. Nevertheless, the electromagnetic responses of the RISs are usually only phase-adjustable, which considerably limits the achievable rate of RIS-based transmitters. In this paper, we propose an RIS architecture to achieve amplitude-and-phase-varying modulation, which facilitates the design of multiple-input multiple-output (MIMO) quadrature amplitude modulation (QAM) transmission. The hardware constraints of the RIS and their impacts on the system design are discussed and analyzed. Furthermore, the proposed approach is evaluated using our prototype which implements the RIS-based MIMO-QAM transmission over the air in real time.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Structured Graph Learning for Clustering and Semi-supervised Classification

Graphs have become increasingly popular in modeling structures and interactions in a wide variety of problems during the last decade. Graph-based clustering and semi-supervised classification techniques have shown impressive performance. This paper proposes a graph learning framework to preserve both the local and global structure of data. Specifically, our method uses the self-expressiveness of samples to capture the global structure and adaptive neighbor approach to respect the local structure. Furthermore, most existing graph-based methods conduct clustering and semi-supervised classification on the graph learned from the original data matrix, which doesn't have explicit cluster structure, thus they might not achieve the optimal performance. By considering rank constraint, the achieved graph will have exactly $c$ connected components if there are $c$ clusters or classes. As a byproduct of this, graph learning and label inference are jointly and iteratively implemented in a principled way. Theoretically, we show that our model is equivalent to a combination of kernel k-means and k-means methods under certain condition. Extensive experiments on clustering and semi-supervised classification demonstrate that the proposed method outperforms other state-of-the-art methods.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Switch effect and $0$-$π$ transition in Ising superconductor Josephson junctions

We theoretically study the Josephson current in Ising superconductor-half-metal-Ising superconductor junctions. By solving the Bogoliubov-de Gennes equations, the Josephson currents contributed by the discrete Andreev levels and the continuous spectrum are obtained. For very short junctions, because the direct tunneling of the Cooper pair dominates the Josephson current, the current-phase difference relation is independent of the magnetization direction, which is the same as the conventional superconductor-ferromagnet-superconductor junctions. On the other hand, when the length of the half-metal is similar to or greater than the superconducting coherence length, the spin-triplet Josephson effect occurs and dominates the Josephson current. In this case, the current-phase difference relations show the strong magnetoanisotropic behaviors with the period π. When the magnetization direction points to the $\pm$ z directions, the current is zero regardless of the phase difference. However, the current has a large value when the magnetization direction is parallel to the junction plane, which leads to a perfect switch effect of the Josephson current. Furthermore, we find that the long junctions can host both the 0 state and πstate, and the $0$-$π$ transitions can be achieved with the change of the magnetization direction. The physical origins of the switch effect and $0$-$π$ transitions are interpreted from the perspectives of the spin-triplet Andreev reflection, the Ising pairing order parameter and the Ginzburg-Landau type of free energy. In addition, the influences of the chemical potential, the magnetization magnitude, and the strength of the Ising spin-orbit coupling on the switch effect and $0$-$π$ transitions are also investigated. Furthermore, the two-dimensional Josephson junctions are also investigated and we show that the spin-triplet Josephson effect can exist always.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Two-Dimensional Semi-Nonnegative Matrix Factorization for Clustering

In this paper, we propose a new Semi-Nonnegative Matrix Factorization method for 2-dimensional (2D) data, named TS-NMF. It overcomes the drawback of existing methods that seriously damage the spatial information of the data by converting 2D data to vectors in a preprocessing step. In particular, projection matrices are sought under the guidance of building new data representations, such that the spatial information is retained and projections are enhanced by the goal of clustering, which helps construct optimal projection directions. Moreover, to exploit nonlinear structures of the data, manifold is constructed in the projected subspace, which is adaptively updated according to the projections and less afflicted with noise and outliers of the data and thus more representative in the projected space. Hence, seeking projections, building new data representations, and learning manifold are seamlessly integrated in a single model, which mutually enhance other and lead to a powerful data representation. Comprehensive experimental results verify the effectiveness of TS-NMF in comparison with several state-of-the-art algorithms, which suggests high potential of the proposed method for real world applications.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Discriminative Ridge Machine: A Classifier for High-Dimensional Data or Imbalanced Data

We introduce a discriminative regression approach to supervised classification in this paper. It estimates a representation model while accounting for discriminativeness between classes, thereby enabling accurate derivation of categorical information. This new type of regression models extends existing models such as ridge, lasso, and group lasso through explicitly incorporating discriminative information. As a special case we focus on a quadratic model that admits a closed-form analytical solution. The corresponding classifier is called discriminative regression machine (DRM). Three iterative algorithms are further established for the DRM to enhance the efficiency and scalability for real applications. Our approach and the algorithms are applicable to general types of data including images, high-dimensional data, and imbalanced data. We compare the DRM with currently state-of-the-art classifiers. Our extensive experimental results show superior performance of the DRM and confirm the effectiveness of the proposed approach.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Wireless Communications with Programmable Metasurface: New Paradigms, Opportunities, and Challenges on Transceiver Design

Many emerging technologies, such as ultra-massive multiple-input multiple-output (UM-MIMO), terahertz (THz) communications are under active discussion as promising technologies to support the extremely high access rate and superior network capacity in the future sixth-generation (6G) mobile communication systems. However, such technologies are still facing many challenges for practical implementation. In particular, UM-MIMO and THz communication require extremely large number of radio frequency (RF) chains, and hence suffering from prohibitive hardware cost and complexity. In this article, we introduce a new paradigm to address the above issues, namely wireless communication enabled by programmable metasurfaces, by exploiting the powerful capability of metasurfaces in manipulating electromagnetic waves. We will first introduce the basic concept of programmable metasurfaces, followed by the promising paradigm shift in future wireless communication systems enabled by programmable metasurfaces. In particular, we propose two prospective paradigms of applying programmable metasurfaces in wireless transceivers: namely RF chain-free transmitter and space-down-conversion receiver, which both have great potential to simplify the architecture and reduce the hardware cost of future wireless transceivers. Furthermore, we present the design architectures, preliminary experimental results and main advantages of these new paradigms and discuss their potential opportunities and challenges toward ultra-massive 6G communications with low hardware complexity, low cost, and high energy efficiency.

0 citations0 reviewsNo code linkedOpen access
preprint2018arXiv

Wireless Communications with Programmable Metasurface: Transceiver Design and Experimental Results

Metasurfaces have drawn significant attentions due to their superior capability in tailoring electromagnetic waves with a wide frequency range, from microwave to visible light. Recently, programmable metasurfaces have demonstrated the ability of manipulating the amplitude or phase of electromagnetic waves in a programmable manner in real time, which renders them especially appealing in the applications of wireless communications. To practically demonstrate the feasibility of programmable metasurfaces in future communication systems, in this paper, we design and realize a novel metasurface-based wireless communication system. By exploiting the dynamically controllable property of programmable metasurface, we firstly introduce the fundamental principle of the metasurface-based wireless communication system design. We then present the design, implementation and experimental evaluation of the proposed metasurface-based wireless communication system with a prototype, which realizes single carrier quadrature phase shift keying (QPSK) transmission over the air. In the developed prototype, the phase of the reflected electromagnetic wave of programmable metasurface is directly manipulated in real time according to the baseband control signal, which achieves 2.048 Mbps data transfer rate with video streaming transmission over the air. Experimental result is provided to compare the performance of the proposed metasurface-based architecture against the conventional one. With the slight increase of the transmit power by 5 dB, the same bit error rate (BER) performance can be achieved as the conventional system in the absence of channel coding. Such a result is encouraging considering that the metasurface-based system has the advantages of low hardware cost and simple structure, thus leading to a promising new architecture for wireless communications.

0 citations0 reviewsNo code linkedOpen access