arXiv subjects

Wei Tang

Publications and source records attributed to Wei Tang.

At least 145 records · Page 8Linked to original sources

arXiv2023

A simplified method characterizing magnetic ordering modulated photo-thermoelectric response in noncentrosymmetric semimetal Ca3Ru2O7

Photo-Thermoelectric (PTE) response is usually one of the main working mechanisms for photodetectors. However, as another fast and easier way to measure thermoelectric characteristics of materials, it can also reveal important physics such as electric-phonon coupling, electron-electron correlation, etc. Recently, the spin entropy related to magnetic order transition which contributes to thermoelectric power is attracting more and more attention. Here, we demonstrate the PTE response can be reshaped when Ca3Ru2O7 undergoes meta-magnetic phase (MMP) transition driven by both temperature and magnetic field. Firstly, a sign change is observed crossing TS = 48 K and the linear polarization angle dependent PTE current maximizes along a-axis above TS while maximizes along b-axis below TS, which indicates that the antiferromagnetic spin order contributes to such spatial anisotropy. Secondly, in the temperature range of around 40 ~ 50 K, the PTE current is found to be sharply suppressed when external magnetic field is applied in plane along a-axis but is only gradually suppressed when applied field is along b-axis which gives out two critical fields. We attribute such suppression of PTE current under magnetic field to the suppression of the spin entropy in the phase transition between the antiferromagnetic state and the MMP state and the H-T phase diagrams of Ca3Ru2O7 is redrawn accordingly. Compared to previously work which trying to understand the magnetic phase transition in Ca3Ru2O7, such as neutron scattering, specific heat, and other advanced transport measurements, our work provides a more convenient yet efficient method, which may also find applications in other correlated spin materials in general.

cond-mat.str-el↗

arXiv2023

Highly tunable lateral homojunction formed in 2D layered CuInP2S6 via in-plane ionic migration

As basic building blocks for next-generation information technologies devices, high-quality p-n junctions based on van der Waals (vdW) materials have attracted widespread interest.Compared to traditional two dimensional (2D) heterojunction diodes, the emerging homojunctions are more attractive owing to their intrinsic advantages, such as continuous band alignments and smaller carrier trapping. Here, utilizing the long-range migration of Cu + ions under in-plane electric field, a novel lateral p-n homojunction was constructed in the 2D layered copper indium thiophosphate (CIPS). The symmetric Au/CIPS/Au devices demonstrate an electric-field-driven resistance switching (RS) accompanying by a rectification behavior without any gate control. Moreover, such rectification behavior can be continuously modulated by poling voltage. We deduce that the reversable rectifying RS behavior is governed by the effective lateral build-in potential and the change of the interfacial barrier during the poling process. Furthermore, the CIPS p-n homojuction is evidenced by the photovoltaic effect, with the spectral response extending up to visible region due to the better photogenerated carrier separation efficiency. Our study provides a facile route to fabricate homojuctions through electric-field-driven ionic migration and paves the way towards the use of this method in other vdW materials.

cond-mat.mes-hall↗

arXiv2023

Microarchitectures for Heterogeneous Superconducting Quantum Computers

Noisy Intermediate-Scale Quantum Computing (NISQ) has dominated headlines in recent years, with the longer-term vision of Fault-Tolerant Quantum Computation (FTQC) offering significant potential albeit at currently intractable resource costs and quantum error correction (QEC) overheads. For problems of interest, FTQC will require millions of physical qubits with long coherence times, high-fidelity gates, and compact sizes to surpass classical systems. Just as heterogeneous specialization has offered scaling benefits in classical computing, it is likewise gaining interest in FTQC. However, systematic use of heterogeneity in either hardware or software elements of FTQC systems remains a serious challenge due to the vast design space and variable physical constraints. This paper meets the challenge of making heterogeneous FTQC design practical by introducing HetArch, a toolbox for designing heterogeneous quantum systems, and using it to explore heterogeneous design scenarios. Using a hierarchical approach, we successively break quantum algorithms into smaller operations (akin to classical application kernels), thus greatly simplifying the design space and resulting tradeoffs. Specializing to superconducting systems, we then design optimized heterogeneous hardware composed of varied superconducting devices, abstracting physical constraints into design rules that enable devices to be assembled into standard cells optimized for specific operations. Finally, we provide a heterogeneous design space exploration framework which reduces the simulation burden by a factor of 10^4 or more and allows us to characterize optimal design points. We use these techniques to design superconducting quantum modules for entanglement distillation, error correction, and code teleportation, reducing error rates by 2.6x, 10.7x, and 3.0x compared to homogeneous systems.

quant-ph↗

arXiv2023

MotionTrack: Learning Robust Short-term and Long-term Motions for Multi-Object Tracking

The main challenge of Multi-Object Tracking~(MOT) lies in maintaining a continuous trajectory for each target. Existing methods often learn reliable motion patterns to match the same target between adjacent frames and discriminative appearance features to re-identify the lost targets after a long period. However, the reliability of motion prediction and the discriminability of appearances can be easily hurt by dense crowds and extreme occlusions in the tracking process. In this paper, we propose a simple yet effective multi-object tracker, i.e., MotionTrack, which learns robust short-term and long-term motions in a unified framework to associate trajectories from a short to long range. For dense crowds, we design a novel Interaction Module to learn interaction-aware motions from short-term trajectories, which can estimate the complex movement of each target. For extreme occlusions, we build a novel Refind Module to learn reliable long-term motions from the target's history trajectory, which can link the interrupted trajectory with its corresponding detection. Our Interaction Module and Refind Module are embedded in the well-known tracking-by-detection paradigm, which can work in tandem to maintain superior performance. Extensive experimental results on MOT17 and MOT20 datasets demonstrate the superiority of our approach in challenging scenarios, and it achieves state-of-the-art performances at various MOT metrics.

cs.CV↗

arXiv2023

Universal scaling of Klein bottle entropy near conformal critical points

We show that the Klein bottle entropy [Phys. Rev. Lett. 119, 261603 (2017)] for conformal field theories (CFTs) perturbed by a relevant operator is a universal function of the dimensionless coupling constant. The universal scaling of the Klein bottle entropy near criticality provides an efficient approach to extract the scaling dimension of lattice operators via data collapse. As paradigmatic examples, we validate the universal scaling of the Klein bottle entropy for Ising and Z3 parafermion CFTs with various perturbations using numerical simulation with continuous matrix product operator approach.

cond-mat.str-el↗

arXiv2023

Vehicle Sequencing at Signal-Free Intersections: Analytical Performance Guarantees Based on PDMP Formulation

Signal-free intersections are a representative application of smart and connected vehicle technologies. Although extensive results have been developed for trajectory planning and autonomous driving, the formulation and evaluation of vehicle sequencing have not been well understood.In this paper, we consider theoretical guarantees of macroscopic performance (i.e., capacity and delay) of typical sequencing policies at signal-free intersections. We model intersection traffic as a piecewise-deterministic Markov process (PDMP). We analytically characterize the intersection capacity regions and provide upper bounds on travel delay under three typical policies, viz. first-in-first-out, min-switchover, and longer-queue-first. We obtain these results by constructing policy-specific Lyapunov functions and computing mean drift of the PDMP. We also validate the results via a series of micro-simulation-based experiments.

eess.SY↗

arXiv2023

Thermodynamically consistent non-isothermal phase-field modelling of elastocaloric effect: indirect vs direct method

Modelling elastocaloric effect (eCE) is crucial for the design of environmentally friendly and energy-efficient eCE based solid-state cooling devices. Here, a thermodynamically consistent non-isothermal phase-field model (PFM) coupling martensitic transformation with mechanics and heat transfer is developed and applied for simulating eCE. The model is derived from a thermodynamic framework which invokes the microforce theory and Coleman--Noll procedure. To avoid the numerical issue related to the non-differentiable energy barrier function across the transition point, the austenite-martensite transition energy barrier in PFM is constructed as a smooth function of temperature. Both the indirect method using isothermal PFM with Maxwell relations and the direct method using non-isothermal PFM are applied to calculate the elastocaloric properties. The former is capable of calculating both isothermal entropy change and adiabatic temperature change ($ΔT_{\text{ad}}$), but induces high computation cost. The latter is computationally efficient, but only yields $ΔT_{\text{ad}}$. In a model Mn-22Cu alloy, the maximum $ΔT_{\text{ad}}$ ($ΔT_{\text{ad}}^{\text{max}}$) under a compressive stress of 100 MPa is calculated as 9.5 and 8.5 K in single crystal (3.5 and 3.8 K in polycrystal) from the indirect and direct method, respectively. It is found that the discrepancy of $ΔT_{\text{ad}}^{\text{max}}$ by indirect and direct method is within 10% at stress less than 150 MPa, confirming the feasibility of both methods in evaluating eCE at low stress. The results demonstrate the developed PFM herein, combined with both indirect and direct method for eCE calculations, as a practicable toolkit for the computational design of elastocaloric devices.

cond-mat.mtrl-sci↗

arXiv2023

Inverse Ising effect and Ising magnetoresistance

Ising (Zeeman-type) spin-orbit coupling (SOC) generated by in-plane inverse asymmetry has attracted considerable attention, especially in Ising superconductors and spin-valley coupling physics. However, many unconventional observations and emerging physical phenomena remain to be elucidated. Here, we theoretically study the spin texture of σ_z (spin angular momentum projection along z) induced by Ising SOC in 1Td WTe2, and propose an unconventional spin-to-charge conversion named inverse Ising effect, in which the directions of the spin current, spin polarization and charge current are not orthogonal. In particular, we predict the Ising magnetoresistance, whose resistance depends on the out-of-plane magnetic momentum in WTe2/ferromagnetic heterostructure. The Ising magnetoresistance is believed to be an interesting counterpart to the well studied spin Hall magnetoresistance. Our predictions provide promising way to spin-momentum locking and spin-charge conversion based on emerging Ising SOC.

cond-mat.mtrl-sci↗

arXiv2022

Equivalence and automorphism groups of two families of maximum scattered linear sets

Linear set in projective spaces over finite fields plays central roles in the study of blocking sets, semifields, rank-metric codes and etc. A linear set with the largest possible cardinality and the maximum rank is called maximum scattered. Despite two decades of study, there are only a few number of known maximum scattered linear sets in projective lines, including the family constructed by Csajbók, Marino, Polverino and Zanella 2018, and the family constructed by Csajbók, Marino, Zullo 2018 (also Marino, Montanucci, and Zullo 2020). This paper aims to solve the equivalence problem of the linear sets in each of these families and to determine their automorphism groups.

math.CO↗

arXiv2022

Multi-Instance Partial-Label Learning: Towards Exploiting Dual Inexact Supervision

Weakly supervised machine learning algorithms are able to learn from ambiguous samples or labels, e.g., multi-instance learning or partial-label learning. However, in some real-world tasks, each training sample is associated with not only multiple instances but also a candidate label set that contains one ground-truth label and some false positive labels. Specifically, at least one instance pertains to the ground-truth label while no instance belongs to the false positive labels. In this paper, we formalize such problems as multi-instance partial-label learning (MIPL). Existing multi-instance learning algorithms and partial-label learning algorithms are suboptimal for solving MIPL problems since the former fail to disambiguate a candidate label set, and the latter cannot handle a multi-instance bag. To address these issues, a tailored algorithm named MIPLGP, i.e., Multi-Instance Partial-Label learning with Gaussian Processes, is proposed. MIPLGP first assigns each instance with a candidate label set in an augmented label space, then transforms the candidate label set into a logarithmic space to yield the disambiguated and continuous labels via an exclusive disambiguation strategy, and last induces a model based on the Gaussian processes. Experimental results on various datasets validate that MIPLGP is superior to well-established multi-instance learning and partial-label learning algorithms for solving MIPL problems. Our code and datasets will be made publicly available.

cs.LG↗

arXiv2022

Fully Digital Second-order Level-crossing Sampling ADC for Data Saving in Sensing Sparse Signals

This paper presents a fully integrated second-order level-crossing sampling data converter for real-time data compression and feature extraction. Compared with level-sampling ADCs which sample at fixed voltage levels, the proposed circuits updates tracking thresholds using linear extrapolation, which forms a second-order level-crossing sampling ADC that has sloped sampling levels. The computing is done digitally and is implemented by modifying the digital control logic of a conventional SAR ADC. The system selects only the turning points in the input waveform for quantization. The output of the proposed data converter consists of both the digital value of the selected sampling points and the timestamp between the selected sampling points. The main advantages are data savings and power savings for the data converter and the following digital signal processing or communication circuits, which are ideal for low-power sensors. The test chip was fabricated using a 180nm CMOS process. The proposed ADC saves 30% compared to a conventional SAR ADC and achieves a compression factor of 6.17 for tracking ECG signals.

eess.SP↗

arXiv2022

Architectures for Multinode Superconducting Quantum Computers

Many proposals to scale quantum technology rely on modular or distributed designs where individual quantum processors, called nodes, are linked together to form one large multinode quantum computer (MNQC). One scalable method to construct an MNQC is using superconducting quantum systems with optical interconnects. However, a limiting factor of these machines will be internode gates, which may be two to three orders of magnitude noisier and slower than local operations. Surmounting the limitations of internode gates will require a range of techniques, including improvements in entanglement generation, the use of entanglement distillation, and optimized software and compilers, and it remains unclear how improvements to these components interact to affect overall system performance, what performance from each is required, or even how to quantify the performance of each. In this paper, we employ a `co-design' inspired approach to quantify overall MNQC performance in terms of hardware models of internode links, entanglement distillation, and local architecture. In the case of superconducting MNQCs with microwave-to-optical links, we uncover a tradeoff between entanglement generation and distillation that threatens to degrade performance. We show how to navigate this tradeoff, lay out how compilers should optimize between local and internode gates, and discuss when noisy quantum links have an advantage over purely classical links. Using these results, we introduce a roadmap for the realization of early MNQCs which illustrates potential improvements to the hardware and software of MNQCs and outlines criteria for evaluating the landscape, from progress in entanglement generation and quantum memory to dedicated algorithms such as distributed quantum phase estimation. While we focus on superconducting devices with optical interconnects, our approach is general across MNQC implementations.

quant-ph↗

arXiv2022

Be Careful with Rotation: A Uniform Backdoor Pattern for 3D Shape

For saving cost, many deep neural networks (DNNs) are trained on third-party datasets downloaded from internet, which enables attacker to implant backdoor into DNNs. In 2D domain, inherent structures of different image formats are similar. Hence, backdoor attack designed for one image format will suite for others. However, when it comes to 3D world, there is a huge disparity among different 3D data structures. As a result, backdoor pattern designed for one certain 3D data structure will be disable for other data structures of the same 3D scene. Therefore, this paper designs a uniform backdoor pattern: NRBdoor (Noisy Rotation Backdoor) which is able to adapt for heterogeneous 3D data structures. Specifically, we start from the unit rotation and then search for the optimal pattern by noise generation and selection process. The proposed NRBdoor is natural and imperceptible, since rotation is a common operation which usually contains noise due to both the miss match between a pair of points and the sensor calibration error for real-world 3D scene. Extensive experiments on 3D mesh and point cloud show that the proposed NRBdoor achieves state-of-the-art performance, with negligible shape variation.

cs.CV↗

arXiv2022

Global Meets Local: Effective Multi-Label Image Classification via Category-Aware Weak Supervision

Multi-label image classification, which can be categorized into label-dependency and region-based methods, is a challenging problem due to the complex underlying object layouts. Although region-based methods are less likely to encounter issues with model generalizability than label-dependency methods, they often generate hundreds of meaningless or noisy proposals with non-discriminative information, and the contextual dependency among the localized regions is often ignored or over-simplified. This paper builds a unified framework to perform effective noisy-proposal suppression and to interact between global and local features for robust feature learning. Specifically, we propose category-aware weak supervision to concentrate on non-existent categories so as to provide deterministic information for local feature learning, restricting the local branch to focus on more high-quality regions of interest. Moreover, we develop a cross-granularity attention module to explore the complementary information between global and local features, which can build the high-order feature correlation containing not only global-to-local, but also local-to-local relations. Both advantages guarantee a boost in the performance of the whole network. Extensive experiments on two large-scale datasets (MS-COCO and VOC 2007) demonstrate that our framework achieves superior performance over state-of-the-art methods.

cs.CV↗

arXiv2022

Dynamic Predictive Sampling Analog to Digital Converter for Sparse Signal Sensing

This paper presents a dynamic predictive sampling (DPS) based analog-to-digital converter (ADC) that provides a non-uniform sampling of input analog continuous-time signals. The processing unit generates a dynamic prediction of the input signal using two prior-quantized samplings to compute digital values of an upper threshold and a lower threshold. The digital threshold values are converted to analog thresholds to form a tracking window. A comparator compares the input analog signal with the tracking window to determine if the prediction is successful. A counter records timestamps between the unsuccessful predictions, which are the selected sampling points for quantization. No quantization is performed for successfully predicted sampling points so that the data throughput and power can be saved. The proposed circuits were designed as a 10-bit ADC using 0.18 micro CMOS process sampling at 1 kHz. The results show that the proposed system can achieve a data compression factor of 6.17 and a power saving factor of 31% compared to a Nyquist rate SAR ADC for ECG monitoring.

eess.SP↗

arXiv2022

UniRel: Unified Representation and Interaction for Joint Relational Triple Extraction

Relational triple extraction is challenging for its difficulty in capturing rich correlations between entities and relations. Existing works suffer from 1) heterogeneous representations of entities and relations, and 2) heterogeneous modeling of entity-entity interactions and entity-relation interactions. Therefore, the rich correlations are not fully exploited by existing works. In this paper, we propose UniRel to address these challenges. Specifically, we unify the representations of entities and relations by jointly encoding them within a concatenated natural language sequence, and unify the modeling of interactions with a proposed Interaction Map, which is built upon the off-the-shelf self-attention mechanism within any Transformer block. With comprehensive experiments on two popular relational triple extraction datasets, we demonstrate that UniRel is more effective and computationally efficient. The source code is available at https://github.com/wtangdev/UniRel.

cs.CL↗

arXiv2022

LACV-Net: Semantic Segmentation of Large-Scale Point Cloud Scene via Local Adaptive and Comprehensive VLAD

Large-scale point cloud semantic segmentation is an important task in 3D computer vision, which is widely applied in autonomous driving, robotics, and virtual reality. Current large-scale point cloud semantic segmentation methods usually use down-sampling operations to improve computation efficiency and acquire point clouds with multi-resolution. However, this may cause the problem of missing local information. Meanwhile, it is difficult for networks to capture global information in large-scale distributed contexts. To capture local and global information effectively, we propose an end-to-end deep neural network called LACV-Net for large-scale point cloud semantic segmentation. The proposed network contains three main components: 1) a local adaptive feature augmentation module (LAFA) to adaptively learn the similarity of centroids and neighboring points to augment the local context; 2) a comprehensive VLAD module (C-VLAD) that fuses local features with multi-layer, multi-scale, and multi-resolution to represent a comprehensive global description vector; and 3) an aggregation loss function to effectively optimize the segmentation boundaries by constraining the adaptive weight from the LAFA module. Compared to state-of-the-art networks on several large-scale benchmark datasets, including S3DIS, Toronto3D, and SensatUrban, we demonstrated the effectiveness of the proposed network.

cs.CV↗

arXiv2022

On the automorphism groups of Lunardon-Polverino scattered linear sets

Lunardon and Polverino introduced in 2001 a new family of maximum scattered linear sets in $\mathrm{PG}(1,q^n)$ to construct linear minimal Rédei blocking sets. This family has been extended first by Lavrauw, Marino, Trombetti and Polverino in 2015 and then by Sheekey in 2016 in two different contexts (semifields and rank metric codes). These linear sets are called Lunardon-Polverino linear sets and this paper aims to determine their automorphism groups, to solve the equivalence issue among Lunardon-Polverino linear sets and to establish the number of inequivalent linear sets of this family. We then elaborate on this number, providing explicit bounds and determining its asymptotics.

math.CO↗