Searcharxiv⌕ Search

arXiv subjects

Xin Hu

Publications and source records attributed to Xin Hu.

At least 73 records · Page 4Linked to original sources

Dynamic Event-Triggered Discrete-Time Linear Time-Varying System with Privacy-Preservation

This paper focuses on discrete-time wireless sensor networks with privacy-preservation. In practical applications, information exchange between sensors is subject to attacks. For the information leakage caused by the attack during the information transmission process, privacy-preservation is introduced for system states. To make communication resources more effectively utilized, a dynamic event-triggered set-membership estimator is designed. Moreover, the privacy of the system is analyzed to ensure the security of the real data. As a result, the set-membership estimator with differential privacy is analyzed using recursive convex optimization. Then the steady-state performance of the system is studied. Finally, one example is presented to demonstrate the feasibility of the proposed distributed filter containing privacy-preserving analysis.

eess.SY↗

Electrical manipulation of plasmon-phonon polaritons in heterostructures of graphene on biaxial crystals

Phonon polaritons in natural anisotropic crystals hold great promise for infrared nano-optics. However, the direct electrical control of these polaritons is difficult, preventing the development of active polaritonic devices. Here we propose the heterostructures of graphene on a biaxial crystal (α-phase molybdenum trioxide) slab and theoretically study the hybridized plasmon-phonon polaritons with dependence on the Fermi level of graphene from three aspects: dispersion relationships, iso-frequency contours, and the quantum spin Hall effects. We demonstrate the distinct wavelength tunability of the plasmon-phonon polaritons modes and the optical topologic transitions from open (hyperbolic) to closed (bow-tie-like) iso-frequency contours as the increase of the Fermi level of graphene. Furthermore, we observe the tunable quantum spin Hall effects of the plasmon-phonon polaritons, manifesting propagation direction switching by the Fermi level tuning of the graphene. Our findings open opportunities for novel electrically tunable polaritonic devices and programmable quantum optical networks.

cond-mat.mes-hall↗

Hetero-interface of electrolyte/2D materials

Electrochemical gating has been demonstrated as a powerful tool to tune the physical properties of two-dimensional (2D) materials, leading to lots of fascinating quantum phenomena. However, the reported liquid-nature electrolytes (e.g, ionic liquid and ion-gel) cover the top surface of 2D materials, introduce the strain at the hetero-interface, and present sensitivity to humidity, which strongly limits the further exploration of the hetero-interface between electrolyte and 2D materials, and their wide applications for electronics and optoelectronics. Herein, by introducing a lithium-ion solid-state electrolyte, the character of the electric double layer (EDL) at hetero-interface and its effect on the optical property of transition metal chalcogenides (TMDs) have been revealed by Kelvin probe force microscopy (KPFM) and (time-resolved) photoluminescence measurements. The work function of TMDs can be strongly tailored by electrochemical gating, up to 0.7eV for WSe2 and 0.3 eV for MoS2, respectively. Besides, from the gate-dependent surface potential of TMDs with different thicknesses, the potential drop across the EDL has been quantitatively revealed. Furthermore, from the gate-dependent PL emission at room temperature, monolayer WS2 exhibits only neutral exciton emission in the whole range of gate voltage applied, which also exhibits exciton-exciton annihilation. Our results demonstrate that lithium-ion substrate is a promising alternative to explore the physics of 2D materials and the hetero-interface of electrolyte/2D materials by easily integrating both scanning probe and optical techniques.

physics.app-ph↗

Contrastive Learning of Subject-Invariant EEG Representations for Cross-Subject Emotion Recognition

EEG signals have been reported to be informative and reliable for emotion recognition in recent years. However, the inter-subject variability of emotion-related EEG signals still poses a great challenge for the practical applications of EEG-based emotion recognition. Inspired by recent neuroscience studies on inter-subject correlation, we proposed a Contrastive Learning method for Inter-Subject Alignment (CLISA) to tackle the cross-subject emotion recognition problem. Contrastive learning was employed to minimize the inter-subject differences by maximizing the similarity in EEG signal representations across subjects when they received the same emotional stimuli in contrast to different ones. Specifically, a convolutional neural network was applied to learn inter-subject aligned spatiotemporal representations from EEG time series in contrastive learning. The aligned representations were subsequently used to extract differential entropy features for emotion classification. CLISA achieved state-of-the-art cross-subject emotion recognition performance on our THU-EP dataset with 80 subjects and the publicly available SEED dataset with 15 subjects. It could generalize to unseen subjects or unseen emotional stimuli in testing. Furthermore, the spatiotemporal representations learned by CLISA could provide insights into the neural mechanisms of human emotion processing.

cs.HC↗

Learning First-Order Rules with Relational Path Contrast for Inductive Relation Reasoning

Relation reasoning in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant paradigm is learning the embeddings of relations and entities, which is limited to a transductive setting and has restriction on processing unseen entities in an inductive situation. Previous inductive methods are scalable and consume less resource. They utilize the structure of entities and triples in subgraphs to own inductive ability. However, in order to obtain better reasoning results, the model should acquire entity-independent relational semantics in latent rules and solve the deficient supervision caused by scarcity of rules in subgraphs. To address these issues, we propose a novel graph convolutional network (GCN)-based approach for interpretable inductive reasoning with relational path contrast, named RPC-IR. RPC-IR firstly extracts relational paths between two entities and learns representations of them, and then innovatively introduces a contrastive strategy by constructing positive and negative relational paths. A joint training strategy considering both supervised and contrastive information is also proposed. Comprehensive experiments on three inductive datasets show that RPC-IR achieves outstanding performance comparing with the latest inductive reasoning methods and could explicitly represent logical rules for interpretability.

cs.LO↗

A Feature Fusion-Net Using Deep Spatial Context Encoder and Nonstationary Joint Statistical Model for High Resolution SAR Image Classification

Convolutional neural networks (CNNs) have been applied to learn spatial features for high-resolution (HR) synthetic aperture radar (SAR) image classification. However, there has been little work on integrating the unique statistical distributions of SAR images which can reveal physical properties of terrain objects, into CNNs in a supervised feature learning framework. To address this problem, a novel end-to-end supervised classification method is proposed for HR SAR images by considering both spatial context and statistical features. First, to extract more effective spatial features from SAR images, a new deep spatial context encoder network (DSCEN) is proposed, which is a lightweight structure and can be effectively trained with a small number of samples. Meanwhile, to enhance the diversity of statistics, the nonstationary joint statistical model (NS-JSM) is adopted to form the global statistical features. Specifically, SAR images are transformed into the Gabor wavelet domain and the produced multi-subbands magnitudes and phases are modeled by the log-normal and uniform distribution. The covariance matrix is further utilized to capture the inter-scale and intra-scale nonstationary correlation between the statistical subbands and make the joint statistical features more compact and distinguishable. Considering complementary advantages, a feature fusion network (Fusion-Net) base on group compression and smooth normalization is constructed to embed the statistical features into the spatial features and optimize the fusion feature representation. As a result, our model can learn the discriminative features and improve the final classification performance. Experiments on four HR SAR images validate the superiority of the proposed method over other related algorithms.

cs.CV↗

WHU-Hi: UAV-borne hyperspectral with high spatial resolution (H2) benchmark datasets for hyperspectral image classification

Classification is an important aspect of hyperspectral images processing and application. At present, the researchers mostly use the classic airborne hyperspectral imagery as the benchmark dataset. However, existing datasets suffer from three bottlenecks: (1) low spatial resolution; (2) low labeled pixels proportion; (3) low degree of subclasses distinction. In this paper, a new benchmark dataset named the Wuhan UAV-borne hyperspectral image (WHU-Hi) dataset was built for hyperspectral image classification. The WHU-Hi dataset with a high spectral resolution (nm level) and a very high spatial resolution (cm level), which we refer to here as H2 imager. Besides, the WHU-Hi dataset has a higher pixel labeling ratio and finer subclasses. Some start-of-art hyperspectral image classification methods benchmarked the WHU-Hi dataset, and the experimental results show that WHU-Hi is a challenging dataset. We hope WHU-Hi dataset can become a strong benchmark to accelerate future research.

eess.IV↗

RL-CSDia: Representation Learning of Computer Science Diagrams

Recent studies on computer vision mainly focus on natural images that express real-world scenes. They achieve outstanding performance on diverse tasks such as visual question answering. Diagram is a special form of visual expression that frequently appears in the education field and is of great significance for learners to understand multimodal knowledge. Current research on diagrams preliminarily focuses on natural disciplines such as Biology and Geography, whose expressions are still similar to natural images. Another type of diagrams such as from Computer Science is composed of graphics containing complex topologies and relations, and research on this type of diagrams is still blank. The main challenges of graphic diagrams understanding are the rarity of data and the confusion of semantics, which are mainly reflected in the diversity of expressions. In this paper, we construct a novel dataset of graphic diagrams named Computer Science Diagrams (CSDia). It contains more than 1,200 diagrams and exhaustive annotations of objects and relations. Considering the visual noises caused by the various expressions in diagrams, we introduce the topology of diagrams to parse topological structure. After that, we propose Diagram Parsing Net (DPN) to represent the diagram from three branches: topology, visual feature, and text, and apply the model to the diagram classification task to evaluate the ability of diagrams understanding. The results show the effectiveness of the proposed DPN on diagrams understanding.

cs.CV↗

Inertial Sensing Meets Artificial Intelligence: Opportunity or Challenge?

The inertial navigation system (INS) has been widely used to provide self-contained and continuous motion estimation in intelligent transportation systems. Recently, the emergence of chip-level inertial sensors has expanded the relevant applications from positioning, navigation, and mobile mapping to location-based services, unmanned systems, and transportation big data. Meanwhile, benefit from the emergence of big data and the improvement of algorithms and computing power, artificial intelligence (AI) has become a consensus tool that has been successfully applied in various fields. This article reviews the research on using AI technology to enhance inertial sensing from various aspects, including sensor design and selection, calibration and error modeling, navigation and motion-sensing algorithms, multi-sensor information fusion, system evaluation, and practical application. Based on the over 30 representative articles selected from the nearly 300 related publications, this article summarizes the state of the art, advantages, and challenges on each aspect. Finally, it summarizes nine advantages and nine challenges of AI-enhanced inertial sensing and then points out future research directions.

eess.SP↗

A General Architecture for Behavior Modeling of Nonlinear Power Amplifier using Deep Convolutional Neural Network

Nonlinearity of power amplifier is one of the major limitations to the achievable capacity in wireless transmission systems. Nonlinear impairments are determined by the nonlinear distortions of the power amplifier and modulator imperfections. The Volterra model, several compact Volterra models and neural network models to establish a nonlinear model of power amplifier have all been demonstrated. However, the computational cost of these models increases and their implementation demands more signal processing resources as the signal bandwidth gets wider or the number of carrier aggregation. A completely different approach uses deep convolutional neural network to learn from the training data to figure out the nonlinear distortion. In this work, a low complexity, general architecture based on the deep real-valued convolutional neural network (DRVCNN) is proposed to build the nonlinear behavior of the power amplifier. With each of the multiple inputs equivalent to an input vector, the DRVCNN tensor weights are constructed from training data thanks to the current and historical envelope-dependent terms, I, and Q, which are components of the input. The effectiveness of the general framework in modeling single-carrier and multi-carrier power amplifiers is verified.

eess.SP↗

Convolutional Neural Network for Behavioral Modeling and Predistortion of Wideband Power Amplifiers

In this paper, we propose a novel behavior model for wideband PAs using a real-valued time-delay convolutional neural network (RVTDCNN). The input data of the model are sorted and arranged as the graph composed of the in-phase and quadrature (I/Q) components and envelope-dependent terms of current and past signals. We design a pre-designed filter using the convolutional layer to extract the basis functions required for the PA forward or reverse modeling. The generated rich basis functions are modeled using a simple fully connected layer. Because of the weight sharing characteristics of the convolutional structure, the strong memory effect does not lead to a obvious increase in the complexity of the model. Meanwhile, the extraction effect of the pre-designed filter also reduces the training complexity of the model. The experimental results show that the performance of the RVTDCNN model is almost the same as the NN models and the multilayer NN models.

eess.SP↗

Deep Reinforcement Learning (DRL): Another Perspective for Unsupervised Wireless Localization

Location is key to spatialize internet-of-things (IoT) data. However, it is challenging to use low-cost IoT devices for robust unsupervised localization (i.e., localization without training data that have known location labels). Thus, this paper proposes a deep reinforcement learning (DRL) based unsupervised wireless-localization method. The main contributions are as follows. (1) This paper proposes an approach to model a continuous wireless-localization process as a Markov decision process (MDP) and process it within a DRL framework. (2) To alleviate the challenge of obtaining rewards when using unlabeled data (e.g., daily-life crowdsourced data), this paper presents a reward-setting mechanism, which extracts robust landmark data from unlabeled wireless received signal strengths (RSS). (3) To ease requirements for model re-training when using DRL for localization, this paper uses RSS measurements together with agent location to construct DRL inputs. The proposed method was tested by using field testing data from multiple Bluetooth 5 smart ear tags in a pasture. Meanwhile, the experimental verification process reflected the advantages and challenges for using DRL in wireless localization.

cs.LG↗

Location-Enabled IoT (LE-IoT): A Survey of Positioning Techniques, Error Sources, and Mitigation

The Internet of Things (IoT) has started to empower the future of many industrial and mass-market applications. Localization techniques are becoming key to add location context to IoT data without human perception and intervention. Meanwhile, the newly-emerged Low-Power Wide-Area Network (LPWAN) technologies have advantages such as long-range, low power consumption, low cost, massive connections, and the capability for communication in both indoor and outdoor areas. These features make LPWAN signals strong candidates for mass-market localization applications. However, there are various error sources that have limited localization performance by using such IoT signals. This paper reviews the IoT localization system through the following sequence: IoT localization system review -- localization data sources -- localization algorithms -- localization error sources and mitigation -- localization performance evaluation. Compared to the related surveys, this paper has a more comprehensive and state-of-the-art review on IoT localization methods, an original review on IoT localization error sources and mitigation, an original review on IoT localization performance evaluation, and a more comprehensive review of IoT localization applications, opportunities, and challenges. Thus, this survey provides comprehensive guidance for peers who are interested in enabling localization ability in the existing IoT systems, using IoT systems for localization, or integrating IoT signals with the existing localization sensors.

cs.NI↗

Mining Maximal Dynamic Spatial Co-Location Patterns

A spatial co-location pattern represents a subset of spatial features whose instances are prevalently located together in a geographic space. Although many algorithms of mining spatial co-location pattern have been proposed, there are still some problems: 1) they miss some meaningful patterns (e.g., {Ganoderma_lucidumnew, maple_treedead} and {water_hyacinthnew(increase), algaedead(decrease)}), and get the wrong conclusion that the instances of two or more features increase/decrease (i.e., new/dead) in the same/approximate proportion, which has no effect on prevalent patterns. 2) Since the number of prevalent spatial co-location patterns is very large, the efficiency of existing methods is very low to mine prevalent spatial co-location patterns. Therefore, first, we propose the concept of dynamic spatial co-location pattern that can reflect the dynamic relationships among spatial features. Second, we mine small number of prevalent maximal dynamic spatial co-location patterns which can derive all prevalent dynamic spatial co-location patterns, which can improve the efficiency of obtaining all prevalent dynamic spatial co-location patterns. Third, we propose an algorithm for mining prevalent maximal dynamic spatial co-location patterns and two pruning strategies. Finally, the effectiveness and efficiency of the method proposed as well as the pruning strategies are verified by extensive experiments over real/synthetic datasets.

cs.DB↗

Gevrey smoothing effect for the spatially inhomogeneous Boltzmann equations without cut-off

In this article we study the Gevrey regularization effect for the spatially inhomogeneous Boltzmann equation without angular cutoff. This equation is partially elliptic in the velocity direction and degenerates in the spatial variable. We consider the nonlinear Cauchy problem for the fluctuation around the Maxwellian distribution and prove that any solution with mild regularity will become smooth in Gevrey class at positive time, with Gevrey index depending on the angular singularity. Our proof relies on the symbolic calculus for the collision operator and the global subelliptic estimate for the Cauchy problem of linearized Boltzmann operator.

math.AP↗

Natural Language Aggregate Query over RDF Data

Natural language question-answering over RDF data has received widespread attention. Although there have been several studies that have dealt with a small number of aggregate queries, they have many restrictions (i.e., interactive information, controlled question or query template). Thus far, there has been no natural language querying mechanism that can process general aggregate queries over RDF data. Therefore, we propose a framework called NLAQ (Natural Language Aggregate Query). First, we propose a novel algorithm to automatically understand a users query intention, which mainly contains semantic relations and aggregations. Second, to build a better bridge between the query intention and RDF data, we propose an extended paraphrase dictionary ED to obtain more candidate mappings for semantic relations, and we introduce a predicate-type adjacent set PT to filter out inappropriate candidate mapping combinations in semantic relations and basic graph patterns. Third, we design a suitable translation plan for each aggregate category and effectively distinguish whether an aggregate item is numeric or not, which will greatly affect the aggregate result. Finally, we conduct extensive experiments over real datasets (QALD benchmark and DBpedia), and the experimental results demonstrate that our solution is effective.

cs.DB↗

Android Malware Clustering through Malicious Payload Mining

Clustering has been well studied for desktop malware analysis as an effective triage method. Conventional similarity-based clustering techniques, however, cannot be immediately applied to Android malware analysis due to the excessive use of third-party libraries in Android application development and the widespread use of repackaging in malware development. We design and implement an Android malware clustering system through iterative mining of malicious payload and checking whether malware samples share the same version of malicious payload. Our system utilizes a hierarchical clustering technique and an efficient bit-vector format to represent Android apps. Experimental results demonstrate that our clustering approach achieves precision of 0.90 and recall of 0.75 for Android Genome malware dataset, and average precision of 0.98 and recall of 0.96 with respect to manually verified ground-truth.

cs.CR↗

Explosive oscillation death in coupled Stuart-Landau oscillators

Recently, the explosive phase transitions, such as explosive percolation and explosive synchronization, have attracted extensive research interest. So far, most existing works investigate Kuramoto-type models, where only phase variables are involved. Here, we report the occurrence of explosive oscillation quenching in a system of coupled Stuart-Landau oscillators that incorporates both phase and amplitude dynamics. We observe three typical scenarios with distinct microscopic mechanism of occurrence, i.e., ordinary, hierarchical, and cluster explosive oscillation death, corresponding to different frequency distributions of oscillators, respectively. We carry out theoretical analyses and obtain the backward transition point, which is shown to be independent of the specific frequency distributions. Numerical results are consistent with the theoretical prediction.

nlin.AO↗