Search arXiv⌕ Search

arXiv subjects

Jian Chen

Publications and source records attributed to Jian Chen.

At least 235 records · Page 13Linked to original sources

MGTAB: A Multi-Relational Graph-Based Twitter Account Detection Benchmark

The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.

cs.CV↗

Energy-Delay Tradeoff in Helper-Assisted NOMA-MEC Systems: A Four-Sided Matching Algorithm

This paper designs a helper-assisted resource allocation strategy in non-orthogonal multiple access (NOMA)-enabled mobile edge computing (MEC) systems, in order to guarantee the quality of service (QoS) of the energy/delay-sensitive user equipments (UEs). To achieve a tradeoff between the energy consumption and the delay, we introduce a novel performance metric, called \emph{energy-delay tradeoff}, which is defined as the weighted sum of energy consumption and delay. The joint optimization of user association, resource block (RB) assignment, power allocation, task assignment, and computation resource allocation is formulated as a mixed-integer nonlinear programming problem with the aim of minimizing the maximal energy-delay tradeoff. Due to the non-convexity of the formulated problem with coupled and 0-1 variables, this problem cannot be directly solved with polynomial complexity. To tackle this challenge, we first decouple the formulated problem into a power allocation, task assignment and computation resource allocation (PATACRA) subproblem. Then, with the solution obtained from the PATACRA subproblem, we equivalently reformulate the original problem as a discrete user association and RB assignment (DUARA) problem. For the PATACRA subproblem, an iterative parametric convex approximation (IPCA) algorithm is proposed. Then, based on the solution obtained from the PATACRA subproblem, we first model the DUARA problem as a four-sided matching problem, and then propose a low-complexity four-sided UE-RB-helper-server matching (FS-URHSM) algorithm. Theoretical analysis demonstrates that the proposed algorithms are guaranteed to converge to stable solutions with polynomial complexity. Finally, simulation results are provided to show the superior performance of our proposed algorithm in terms of the energy consumption and the delay.

cs.IT↗

STARS-ISAC: How Many Sensors Do We Need?

A simultaneously transmitting and reflecting surface (STARS) enabled integrated sensing and communications (ISAC) framework is proposed, where a novel bi-directional sensing-STARS architecture is devised to facilitate the full-space communication and sensing. Based on the proposed framework, a joint optimization problem is formulated, where the Cramer-Rao bound (CRB) for estimating the 2-dimension direction-of-arrival of the sensing target is minimized. Two cases are considered for sensing performance enhancement. 1) For the two-user case, an alternating optimization algorithm is proposed. In particular, the maximum number of deployable sensors is obtained in the closed-form expressions. 2) For the multi-user case, an extended CRB (ECRB) metric is proposed to characterize the impact of the number of sensors on the sensing performance. Based on the proposed metric, a novel penalty-based double-loop (PDL) algorithm is proposed to solve the ECRB minimization problem. To tackle the coupling of the ECRB, a general decoupling approach is proposed to convert it to a tractable weighted linear summation form. Simulation results reveal that 1) the proposed PDL algorithm can achieve a near-optimal performance with consideration of sensor deployment; 2) without violating the communication under the quality of service requirements, reducing the receive antennas at the BS does not deteriorate the sensing performance; and 3) it is preferable to deploy more passive elements than sensors in terms of achieving optimal sensing performance

cs.IT↗

Timed Model-Based Mutation Operators for Simulink Models

Model-based mutation analysis is a recent research area, and real-time system testing can benefit from using model mutants. Model-based mutation testing (MBMT) is a particular branch of model-based testing. It generates faulty versions of a model using mutation operators to evaluate and improve test cases. Mutation testing is an effective way to ensure software correctness and has been applied to various application areas. Simulink is a vital modeling language for real-time systems. This paper introduces Simulink model mutation analysis to improve Model-in-the-loop (MIL) testing. We propose a set of Simulink mutation operators based on AUTOSAR, which reflects the temporal correctness when a Simulink model is mapped to Operating System tasks. We implement a mutation framework that generates mutants for implicit clock Simulink models. Finally, we demonstrate how this framework generates mutants to reveal task interference issues in the simulation. Our work integrates the Simulink model with the timed systems to better support mutation testing automation.

cs.SE↗

Boosting Semi-Supervised Learning with Contrastive Complementary Labeling

Semi-supervised learning (SSL) has achieved great success in leveraging a large amount of unlabeled data to learn a promising classifier. A popular approach is pseudo-labeling that generates pseudo labels only for those unlabeled data with high-confidence predictions. As for the low-confidence ones, existing methods often simply discard them because these unreliable pseudo labels may mislead the model. Nevertheless, we highlight that these data with low-confidence pseudo labels can be still beneficial to the training process. Specifically, although the class with the highest probability in the prediction is unreliable, we can assume that this sample is very unlikely to belong to the classes with the lowest probabilities. In this way, these data can be also very informative if we can effectively exploit these complementary labels, i.e., the classes that a sample does not belong to. Inspired by this, we propose a novel Contrastive Complementary Labeling (CCL) method that constructs a large number of reliable negative pairs based on the complementary labels and adopts contrastive learning to make use of all the unlabeled data. Extensive experiments demonstrate that CCL significantly improves the performance on top of existing methods. More critically, our CCL is particularly effective under the label-scarce settings. For example, we yield an improvement of 2.43% over FixMatch on CIFAR-10 only with 40 labeled data.

cs.CV↗

Evaluating Alternative Glyph Design for Showing Large-Magnitude-Range Quantum Spins

We present experimental results to explore a form of bivariate glyphs for representing large-magnitude-range vectors. The glyphs meet two conditions: (1) two visual dimensions are separable; and (2) one of the two visual dimensions uses a categorical representation (e.g., a categorical colormap). We evaluate how much these two conditions determine the bivariate glyphs' effectiveness. The first experiment asks participants to perform three local tasks requiring reading no more than two glyphs. The second experiment scales up the search space in global tasks when participants must look at the entire scene of hundreds of vector glyphs to get an answer. Our results support that the first condition is necessary for local tasks when a few items are compared. But it is not enough to understand a large amount of data. The second condition is necessary for perceiving global structures of examining very complex datasets. Participants' comments reveal that the categorical features in the bivariate glyphs trigger emergent optimal viewers' behaviors. This work contributes to perceptually accurate glyph representations for revealing patterns from large scientific results. We release source code, quantum physics data, training documents, participants' answers, and statistical analyses for reproducible science https://osf.io/4xcf5/?view_only=94123139df9c4ac984a1e0df811cd580.

cs.HC↗

Joint Power Allocation and Decoding Order Selection for NOMA Systems: Outage-Optimal Strategies

We investigate joint power allocation and decoding order selection (PA-DOS) aimed at enhancing the outage performance of non-orthogonal multiple access (NOMA) systems. By considering the diverse target rates of users, new important properties of NOMA are revealed: When users' target rates satisfy certain conditions, the channel state information (CSI) is not required by PA-DOS to minimize the system outage probability, and different users' outage probabilities can be minimized simultaneously; When such conditions are not satisfied, the opposite situation occurs. Following these properties, two PA-DOS strategies are designed regarding distinct user priorities, which ensure the minimization of the system outage probability and the user outage probability of the high-priority user. Especially, these strategies do not require CSI or only require one-bit CSI feedback depending on users' target rates. Analytical and numerical results are provided to demonstrate that the proposed strategies significantly outperform the existing strategies in terms of both system and user outage performance. Furthermore, the results show that although under some target rates the minimum user outage probabilities cannot be simultaneously achieved, they can be closely approached at the same time in the high-signal-to-noise-ratio regime by the proposed strategies.

cs.IT↗

A superconducting nanowire photon number resolving four-quadrant detector-based Gigabit deep-space laser communication receiver prototype

Deep space explorations require transferring huge amounts of data quickly from very distant targets. Laser communication is a promising technology that can offer a data rate of magnitude faster than conventional microwave communication due to the fundamentally narrow divergence of light. This study demonstrated a photon-sensitive receiver prototype with over Gigabit data rate, immunity to strong background photon noise, and simultaneous tracking ability. The advantages are inherited from a joint-optimized superconducting nanowire single-photon detector (SNSPD) array, designed into a four-quadrant structure with each quadrant capable of resolving six photons. Installed in a free-space coupled and low-vibration cryostat, the system detection efficiency reached 72.7%, the detector efficiency was 97.5%, and the total photon counting rate was 1.6 Gcps. Additionally, communication performance was tested for pulse position modulation (PPM) format. A series of signal processing methods were introduced to maximize the performance of the forward error correction (FEC) code. Consequently, the receiver exhibits a faster data rate and better sensitivity by about twofold (1.76 photons/bit at 800 Mbps and 3.40 photons/bit at 1.2 Gbps) compared to previously reported results (3.18 photon/bit at 622 Mbps for the Lunar Laser Communication Demonstration). Furthermore, communications in strong background noise and with simultaneous tracking ability were demonstrated aimed at the challenges of daylight operation and accurate tracking of dim beacon light in deep space scenarios.

physics.ins-det↗

Downscaled Representation Matters: Improving Image Rescaling with Collaborative Downscaled Images

Deep networks have achieved great success in image rescaling (IR) task that seeks to learn the optimal downscaled representations, i.e., low-resolution (LR) images, to reconstruct the original high-resolution (HR) images. Compared with super-resolution methods that consider a fixed downscaling scheme, e.g., bicubic, IR often achieves significantly better reconstruction performance thanks to the learned downscaled representations. This highlights the importance of a good downscaled representation in image reconstruction tasks. Existing IR methods mainly learn the downscaled representation by jointly optimizing the downscaling and upscaling models. Unlike them, we seek to improve the downscaled representation through a different and more direct way: optimizing the downscaled image itself instead of the down-/upscaling models. Specifically, we propose a collaborative downscaling scheme that directly generates the collaborative LR examples by descending the gradient w.r.t. the reconstruction loss on them to benefit the IR process. Furthermore, since LR images are downscaled from the corresponding HR images, one can also improve the downscaled representation if we have a better representation in the HR domain. Inspired by this, we propose a Hierarchical Collaborative Downscaling (HCD) method that performs gradient descent in both HR and LR domains to improve the downscaled representations. Extensive experiments show that our HCD significantly improves the reconstruction performance both quantitatively and qualitatively. Moreover, we also highlight the flexibility of our HCD since it can generalize well across diverse IR models.

cs.CV↗

Text-Aware Dual Routing Network for Visual Question Answering

Visual question answering (VQA) is a challenging task to provide an accurate natural language answer given an image and a natural language question about the image. It involves multi-modal learning, i.e., computer vision (CV) and natural language processing (NLP), as well as flexible answer prediction for free-form and open-ended answers. Existing approaches often fail in cases that require reading and understanding text in images to answer questions. In practice, they cannot effectively handle the answer sequence derived from text tokens because the visual features are not text-oriented. To address the above issues, we propose a Text-Aware Dual Routing Network (TDR) which simultaneously handles the VQA cases with and without understanding text information in the input images. Specifically, we build a two-branch answer prediction network that contains a specific branch for each case and further develop a dual routing scheme to dynamically determine which branch should be chosen. In the branch that involves text understanding, we incorporate the Optical Character Recognition (OCR) features into the model to help understand the text in the images. Extensive experiments on the VQA v2.0 dataset demonstrate that our proposed TDR outperforms existing methods, especially on the ''number'' related VQA questions.

cs.CV↗

Pareto-aware Neural Architecture Generation for Diverse Computational Budgets

Designing feasible and effective architectures under diverse computational budgets, incurred by different applications/devices, is essential for deploying deep models in real-world applications. To achieve this goal, existing methods often perform an independent architecture search process for each target budget, which is very inefficient yet unnecessary. More critically, these independent search processes cannot share their learned knowledge (i.e., the distribution of good architectures) with each other and thus often result in limited search results. To address these issues, we propose a Pareto-aware Neural Architecture Generator (PNAG) which only needs to be trained once and dynamically produces the Pareto optimal architecture for any given budget via inference. To train our PNAG, we learn the whole Pareto frontier by jointly finding multiple Pareto optimal architectures under diverse budgets. Such a joint search algorithm not only greatly reduces the overall search cost but also improves the search results. Extensive experiments on three hardware platforms (i.e., mobile device, CPU, and GPU) show the superiority of our method over existing methods.

cs.LG↗

Not As Easy As You Think -- Experiences and Lessons Learnt from Trying to Create a Bottom-Up Visualization Image Typology

We present and discuss the results of a two-year qualitative analysis of images published in IEEE Visualization (VIS) papers. Specifically, we derive a typology of 13 visualization image types, coded to distinguish visualizations and several image characteristics. The categorization process required much more time and was more difficult than we initially thought. The resulting typology and image analysis may serve a number of purposes: to study the evolution of the community and its research output over time, to facilitate the categorization of visualization images for the purpose of teaching, to identify visual designs for evaluation purposes, or to enable progress towards standardization in visualization. In addition to the typology and image characterization, we provide a dataset of 6,833 tagged images and an online tool that can be used to explore and analyze the large set of tagged images. We thus facilitate a discussion of the diverse visualizations used and how they are published and communicated in our community.

cs.GR↗

Manipulating THz Spin Current Dynamics by the Dzyaloshinskii-Moriya Interaction in Antiferromagnetic Hematite

An important vision of modern magnetic research is to use antiferromagnets as controllable and active ultrafast components in spintronic devices. Hematite is a promising model material in this respect because its pronounced Dzyaloshinskii-Moriya interaction leads to the coexistence of antiferromagnetism and weak ferromagnetism. Here, we use femtosecond laser pulses to drive terahertz spin currents from hematite into an adjacent Pt layer. We find two contributions to the generation of the spin current with distinctly different dynamics: the impulsive stimulated Raman scatting that relies on the antiferromagnetic order and the ultrafast spin Seebeck effect that relies on the net magnetization. The total THz spin current dynamics can thus be manipulated by a medium-strength magnetic field. The controllability of the THz spin current achieved in hematite opens the pathway toward controlling the exact spin current dynamics from ultrafast antiferromagnetic spin sources.

cond-mat.mes-hall↗

Multiplication formulas and isomorphism theorem of $\imath$Schur superalgebras

We introduce the notion of $\imath$Schur superalgebra, which can be regarded as a type B/C counterpart of the $q$-Schur superalgebra (of type A) formulated as centralizer algebras of certain signed $q$-permutation modules over Hecke algebras. Some multiplication formulas for $\imath$Schur superalgebra are obtained to construct their canonical bases. Furthermore, we established an isomorphism theorem between the $\imath$Scuhr superalgebras and the $q$-Schur superalgebras of type A, which helps us derive a semisimplicity criteria of the $\imath$Schur superalgebras.

math.RT↗

Security Enhancement for Coupled Phase-Shift STAR-RIS Networks

The secure transmission of the simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) aided communication system is investigated. Considering the coupled phase shifts of STAR-RISs and the fair secrecy requirement of users, a novel secure beamforming design is proposed for addressing the unique full-space mutual eavesdropping of STAR-RIS aided communication. In particular, a penalty based secrecy beamforming algorithm is developed to solve the resulting non-convex optimization problem, where the closed-form solutions of the coupled transmission/reflection coefficients are obtained in each iteration. Numerical results demonstrate that 1) the proposed scheme achieves higher secrecy capacity than conventional RIS; 2) 4-bit discrete phase shifters are sufficient for secrecy guarantee.

cs.IT↗

Fano Interference in a Single-Molecule Junction

Trends of miniaturized devices and quantum interference electronics lead to the long desire of Fano interference in single-molecule junctions, here, which is successfully demonstrated using the 2,7-di(4-pyridyl)-9,9'-spirobifluorene molecule with a long backbone group and a short side group. Experimentally, the two electrically coupled groups are found to contribute to two blurred degenerate points in the differential conductance mapping. This forms a characteristic non-centrosymmetric double-crossing feature, with distinct temperature response for each crossing. Theoretically, we describe the practical in-junction electron transmission using a new two-tunnelling-channel coupling model and obtain a working formula with a Fano term and a Breit-Wigner term. The formula is shown to provide a good fit for all the mapping data and their temperature dependence in three dimensions, identifying the Fano component. Our work thus forms a complete set of evidence of the Fano interference in a single-molecule junction induced by two-tunnelling-channel coupling transport. Density functional theory calculations are used to corroborate this new physics.

cond-mat.mes-hall↗

Physical Regimes of Electrostatic Wave-Wave nonlinear interactions generated by an Electron Beam Propagating in a Background Plasma

Electron-beam plasma interaction has long been a topic of great interest. Despite the success of Quasi-Linear (QL) theory and Weak Turbulence (WT) theory, their validities are limited by the requirement of sufficiently dense mode spectrum and small wave amplitude. In this paper, we extensively studied the collective processes of a mono-energetic electron beam emitted from a thermionic cathode propagating through a cold plasma by performing a large number of high resolution two-dimensional (2D) particle-in-cell (PIC) simulations and using analytical theories. We confirm that the initial stage of two-stream instability is saturated due to well-known wave-trapping mechanism. Further evolution occurs due to strong wave-wave nonlinear processes. We show that the beam-plasma interaction can be classified into four different physical regimes in the parameter space for the plasma and beam parameters. The differences between the different regimes are analyzed in detail. For the first time, we identified a new regime in strong Langmuir turbulence featured by what we call Electron Modulational Instability (EMI) that could create a local Langmuir wave packet growing faster than the ion plasma frequency. Ions do not have time to respond to EMI in the initial growing stage. On a longer timescale, the action of the ponderomotive force produces very strong ion density perturbations, and eventually the beam-plasma wave interaction stops being resonant due to strong ion density perturbations. Consequently, in this EMI regime, electron beam-plasma interaction occurs in a periodic (intermittent) process. The beams are strongly scattered by waves, and the Langmuir wave spectrum is significantly broadened, which in turn gives rise to strong heating of bulk electrons. A resulting kappa distribution and a wave-energy spectrum, E^2 (k)~k^(-5), are observed in the strong turbulent regime.

physics.plasm-ph↗

Electron Modulational Instability in the Strong Turbulent Regime for an Electron Beam Propagating in Background Plasma

We study collective processes for an electron beam propagating through a background plasma using simulations and analytical theory. A new regime where the instability of a Langmuir wave packet can grow locally much faster than ion frequency is clearly identified. The key feature of this new regime is an Electron Modulational Instability that rapidly creates a local Langmuir wave packet, which in its turn produces local charge separation and strong ion density perturbations because of the action of the ponderomotive force, such that the beam-plasma wave interaction stops being resonant. Three evolution stages of the process and observed periodic burst features are discussed. Different physical regimes in the plasma and beam parameter space are demonstrated for the first time.

physics.plasm-ph↗