Searcharxiv⌕ Search

arXiv subjects

Ning Yang

Publications and source records attributed to Ning Yang.

At least 91 records · Page 5Linked to original sources

Many Field Packet Classification with Decomposition and Reinforcement Learning

Scalable packet classification is a key requirement to support scalable network applications like firewalls, intrusion detection, and differentiated services. With ever increasing in the line-rate in core networks, it becomes a great challenge to design a scalable packet classification solution using hand-tuned heuristics approaches. In this paper, we present a scalable learning-based packet classification engine by building an efficient data structure for different ruleset with many fields. Our method consists of the decomposition of fields into subsets and building separate decision trees on those subsets using a deep reinforcement learning procedure. To decompose given fields of a ruleset, we consider different grouping metrics like standard deviation of individual fields and introduce a novel metric called diversity index (DI). We examine different decomposition schemes and construct decision trees for each scheme using deep reinforcement learning and compare the results. The results show that the SD decomposition metrics results in 11.5% faster than DI metrics, 25% faster than random 2 and 40% faster than random 1. Furthermore, our learning-based selection method can be applied to varying rulesets due to its ruleset independence.

cs.NI↗

Global-and-Local Collaborative Learning for Co-Salient Object Detection

The goal of co-salient object detection (CoSOD) is to discover salient objects that commonly appear in a query group containing two or more relevant images. Therefore, how to effectively extract inter-image correspondence is crucial for the CoSOD task. In this paper, we propose a global-and-local collaborative learning architecture, which includes a global correspondence modeling (GCM) and a local correspondence modeling (LCM) to capture comprehensive inter-image corresponding relationship among different images from the global and local perspectives. Firstly, we treat different images as different time slices and use 3D convolution to integrate all intra features intuitively, which can more fully extract the global group semantics. Secondly, we design a pairwise correlation transformation (PCT) to explore similarity correspondence between pairwise images and combine the multiple local pairwise correspondences to generate the local inter-image relationship. Thirdly, the inter-image relationships of the GCM and LCM are integrated through a global-and-local correspondence aggregation (GLA) module to explore more comprehensive inter-image collaboration cues. Finally, the intra- and inter-features are adaptively integrated by an intra-and-inter weighting fusion (AEWF) module to learn co-saliency features and predict the co-saliency map. The proposed GLNet is evaluated on three prevailing CoSOD benchmark datasets, demonstrating that our model trained on a small dataset (about 3k images) still outperforms eleven state-of-the-art competitors trained on some large datasets (about 8k-200k images).

cs.CV↗

Learning from Atypical Behavior: Temporary Interest Aware Recommendation Based on Reinforcement Learning

Traditional robust recommendation methods view atypical user-item interactions as noise and aim to reduce their impact with some kind of noise filtering technique, which often suffers from two challenges. First, in real world, atypical interactions may signal users' temporary interest different from their general preference. Therefore, simply filtering out the atypical interactions as noise may be inappropriate and degrade the personalization of recommendations. Second, it is hard to acquire the temporary interest since there are no explicit supervision signals to indicate whether an interaction is atypical or not. To address this challenges, we propose a novel model called Temporary Interest Aware Recommendation (TIARec), which can distinguish atypical interactions from normal ones without supervision and capture the temporary interest as well as the general preference of users. Particularly, we propose a reinforcement learning framework containing a recommender agent and an auxiliary classifier agent, which are jointly trained with the objective of maximizing the cumulative return of the recommendations made by the recommender agent. During the joint training process, the classifier agent can judge whether the interaction with an item recommended by the recommender agent is atypical, and the knowledge about learning temporary interest from atypical interactions can be transferred to the recommender agent, which makes the recommender agent able to alone make recommendations that balance the general preference and temporary interest of users. At last, the experiments conducted on real world datasets verify the effectiveness of TIARec.

cs.IR↗

Multi-Sparse-Domain Collaborative Recommendation via Enhanced Comprehensive Aspect Preference Learning

Cross-domain recommendation (CDR) has been attracting increasing attention of researchers for its ability to alleviate the data sparsity problem in recommender systems. However, the existing single-target or dual-target CDR methods often suffer from two drawbacks, the assumption of at least one rich domain and the heavy dependence on domain-invariant preference, which are impractical in real world where sparsity is ubiquitous and might degrade the user preference learning. To overcome these issues, we propose a Multi-Sparse-Domain Collaborative Recommendation (MSDCR) model for multi-target cross-domain recommendation. Unlike traditional CDR methods, MSDCR treats the multiple relevant domains as all sparse and can simultaneously improve the recommendation performance in each domain. We propose a Multi-Domain Separation Network (MDSN) and a Gated Aspect Preference Enhancement (GAPE) module for MSDCR to enhance a user's domain-specific aspect preferences in a domain by transferring the complementary aspect preferences in other domains, during which the uniqueness of the domain-specific preference can be preserved through the adversarial training offered by MDSN and the complementarity can be adaptively determined by GAPE. Meanwhile, we propose a Multi-Domain Adaptation Network (MDAN) for MSDCR to capture a user's domain-invariant aspect preference. With the integration of the enhanced domain-specific aspect preference and the domain-invariant aspect preference, MSDCR can reach a comprehensive understanding of a user's preference in each sparse domain. At last, the extensive experiments conducted on real datasets demonstrate the remarkable superiority of MSDCR over the state-of-the-art single-domain recommendation models and CDR models.

cs.IR↗

Local large temperature difference and ultra-wideband photothermoelectric response of the silver nanostructure film/carbon nanotube film heterostructure

Photothermoelectric materials have important applications in many fields. Here, we joined a silver nanostructure film (AgNSF) and a carbon nanotube film (CNTF) by van der Waals force to form a AgNSF/CNTF heterojunction, which shows excellent photothermal and photoelectric conversion properties. The local temperature difference and the output photovoltage increase rapidly when the heterojunction is irradiated by lasers with wavelengths ranging from ultraviolet to terahertz. The maximum of the local temperature difference reaches 205.9 K, which is significantly higher than that of other photothermoelectric materials reported in literatures. The photothermal and photoelectric responsivity depend on the wavelength of lasers, which are 175-601 K/W and 9.35-40.4 mV/W, respectively. We demonstrate that light absorption of the carbon nanotube is enhanced by local surface plasmons, and the output photovoltage is dominated by Seebeck effect. The AgNSF/CNTF heterostructure can be used as high-efficiency sensitive photothermal materials or as ultra-wideband fast-response photoelectric material.

physics.app-ph↗

Realization of ultrabroadband THz/IR photoresponse in a bias-tunable ratchet photodetector

High performance Terahertz (THz) photodetector has drawn wide attention and got great improvement due to its significant application in biomedical, astrophysics, nondestructive inspection, 6th generation communication system as well as national security application. Here we demonstrate a novel broadband photon-type THz/infrared (IR) photodetector based on the GaAs/AlxGa1-xAs ratchet structure. This kind of photodetector realizes a THz photon-response based on the electrically pumped hot hole injection and overcomes the internal workfunction related spectral response limit. An ultrabroadband photoresponse from 4 THz to 300 THz and a peak responsivity of 50.3 mA/W are realized at negative bias voltage of -1 V. The photodetector also presents a bias-tunable photon-response characteristic due to the asymmetric structure. The ratchet structure also induces an evident photocurrent even at zero bias voltage, which indicates the detector can be regard as a broadband photovoltaic-like detector. The rectification characteristic and high temperature operation possibility of the photodetector are also discussed. This work not only demonstrates a novel ultrabroadband THz/IR photodetector, but also provides a new method to study the light-responsive ratchet.

physics.app-ph↗

Dual Adversarial Variational Embedding for Robust Recommendation

Robust recommendation aims at capturing true preference of users from noisy data, for which there are two lines of methods have been proposed. One is based on noise injection, and the other is to adopt the generative model Variational Auto-encoder (VAE). However, the existing works still face two challenges. First, the noise injection based methods often draw the noise from a fixed noise distribution given in advance, while in real world, the noise distributions of different users and items may differ from each other due to personal behaviors and item usage patterns. Second, the VAE based models are not expressive enough to capture the true preference since VAE often yields an embedding space of a single modal, while in real world, user-item interactions usually exhibit multi-modality on user preference distribution. In this paper, we propose a novel model called Dual Adversarial Variational Embedding (DAVE) for robust recommendation, which can provide personalized noise reduction for different users and items, and capture the multi-modality of the embedding space, by combining the advantages of VAE and adversarial training between the introduced auxiliary discriminators and the variational inference networks. The extensive experiments conducted on real datasets verify the effectiveness of DAVE on robust recommendation.

cs.IR↗

AI Enlightens Wireless Communication: Analyses, Solutions and Opportunities on CSI Feedback

In this paper, we give a systematic description of the 1st Wireless Communication Artificial Intelligence (AI) Competition (WAIC) which is hosted by IMT-2020(5G) Promotion Group 5G+AI Work Group. Firstly, the framework of full channel state information (F-CSI) feedback problem and its corresponding channel dataset are provided. Then the enhancing schemes for DL-based F-CSI feedback including i) channel data analysis and preprocessing, ii) neural network design and iii) quantization enhancement are elaborated. The final competition results composed of different enhancing schemes are presented. Based on the valuable experience of 1st WAIC, we also list some challenges and potential study areas for the design of AI-based wireless communication systems.

eess.SP↗

MLANE: Meta-Learning Based Adaptive Network Embedding

Most existing random walk based network embedding methods often follow only one of two principles, homophily or structural equivalence. In real world networks, however, nodes exhibit a mixture of homophily and structural equivalence, which requires adaptive network embedding that can adaptively preserve both homophily and structural equivalence for different nodes in different down-stream analysis tasks. In this paper, we propose a novel method called Meta-Learning based Adaptive Network Embedding (MLANE), which can learn adaptive sampling strategy for different nodes in different tasks by incorporating sampling strategy learning with embedding learning into one optimization problem that can be solved via an end-to-end meta-learning framework. In extensive experiments on real datasets, MLANE shows significant performance improvements over the baselines. The source code of MLANE and the datasets used in experiments and all the hyperparameter settings for baselines are available at https://github.com/7733com/MLANE.

cs.SI↗

Mechatronics-Driven Musical Expressivity for Robotic Percussionists

Musical expressivity is an important aspect of musical performance for humans as well as robotic musicians. We present a novel mechatronics-driven implementation of Brushless Direct Current (BLDC) motors in a robotic marimba player, named Shimon, designed to improve speed, dynamic range (loudness), and ultimately perceived musical expressivity in comparison to state-of-the-art robotic percussionist actuators. In an objective test of dynamic range, we find that our implementation provides wider and more consistent dynamic range response in comparison with solenoid-based robotic percussionists. Our implementation also outperforms both solenoid and human marimba players in striking speed. In a subjective listening test measuring musical expressivity, our system performs significantly better than a solenoid-based system and is statistically indistinguishable from human performers.

cs.RO↗

Long-Range Gesture Recognition Using Millimeter Wave Radar

Millimeter wave (mmWave) based gesture recognition technology provides a good human computer interaction (HCI) experience. Prior works focus on the close-range gesture recognition, but fall short in range extension, i.e., they are unable to recognize gestures more than one meter away from considerable noise motions. In this paper, we design a long-range gesture recognition model which utilizes a novel data processing method and a customized artificial Convolutional Neural Network (CNN). Firstly, we break down gestures into multiple reflection points and extract their spatial-temporal features which depict gesture details. Secondly, we design a CNN to learn changing patterns of extracted features respectively and output the recognition result. We thoroughly evaluate our proposed system by implementing on a commodity mmWave radar. Besides, we also provide more extensive assessments to demonstrate that the proposed system is practical in several real-world scenarios.

cs.HC↗

Hybrid Deep Embedding for Recommendations with Dynamic Aspect-Level Explanations

Explainable recommendation is far from being well solved partly due to three challenges. The first is the personalization of preference learning, which requires that different items/users have different contributions to the learning of user preference or item quality. The second one is dynamic explanation, which is crucial for the timeliness of recommendation explanations. The last one is the granularity of explanations. In practice, aspect-level explanations are more persuasive than item-level or user-level ones. In this paper, to address these challenges simultaneously, we propose a novel model called Hybrid Deep Embedding (HDE) for aspect-based explainable recommendations, which can make recommendations with dynamic aspect-level explanations. The main idea of HDE is to learn the dynamic embeddings of users and items for rating prediction and the dynamic latent aspect preference/quality vectors for the generation of aspect-level explanations, through fusion of the dynamic implicit feedbacks extracted from reviews and the attentive user-item interactions. Particularly, as the aspect preference/quality of users/items is learned automatically, HDE is able to capture the impact of aspects that are not mentioned in reviews of a user or an item. The extensive experiments conducted on real datasets verify the recommending performance and explainability of HDE. The source code of our work is available at \url{https://github.com/lola63/HDE-Python}

cs.IR↗

Deep Collaborative Embedding for information cascade prediction

Recently, information cascade prediction has attracted increasing interest from researchers, but it is far from being well solved partly due to the three defects of the existing works. First, the existing works often assume an underlying information diffusion model, which is impractical in real world due to the complexity of information diffusion. Second, the existing works often ignore the prediction of the infection order, which also plays an important role in social network analysis. At last, the existing works often depend on the requirement of underlying diffusion networks which are likely unobservable in practice. In this paper, we aim at the prediction of both node infection and infection order without requirement of the knowledge about the underlying diffusion mechanism and the diffusion network, where the challenges are two-fold. The first is what cascading characteristics of nodes should be captured and how to capture them, and the second is that how to model the non-linear features of nodes in information cascades. To address these challenges, we propose a novel model called Deep Collaborative Embedding (DCE) for information cascade prediction, which can capture not only the node structural property but also two kinds of node cascading characteristics. We propose an auto-encoder based collaborative embedding framework to learn the node embeddings with cascade collaboration and node collaboration, in which way the non-linearity of information cascades can be effectively captured. The results of extensive experiments conducted on real-world datasets verify the effectiveness of our approach.

cs.SI↗

Secure Communications in NOMA System: Subcarrier Assignment and Power Allocation

Secure communication is a promising technology for wireless networks because it ensures secure transmission of information. In this paper, we investigate the joint subcarrier (SC) assignment and power allocation problem for non-orthogonal multiple access (NOMA) amplify-and-forward two-way relay wireless networks, in the presence of eavesdroppers. By exploiting cooperative jamming (CJ) to enhance the security of the communication link, we aim to maximize the achievable secrecy energy efficiency by jointly designing the SC assignment, user pair scheduling and power allocation. Assuming the perfect knowledge of the channel state information (CSI) at the relay station, we propose a low-complexity subcarrier assignment scheme (SCAS-1), which is equivalent to many-to-many matching games, and then SCAS-2 is formulated as a secrecy energy efficiency maximization problem. The secure power allocation problem is modeled as a convex geometric programming problem, and then solved by interior point methods. Simulation results demonstrate that the effectiveness of the proposed SSPA algorithms under scenarios of using and not using CJ, respectively.

cs.IT↗

Collaborative Inference of Coexisting Information Diffusions

Recently, \textit{diffusion history inference} has become an emerging research topic due to its great benefits for various applications, whose purpose is to reconstruct the missing histories of information diffusion traces according to incomplete observations. The existing methods, however, often focus only on single information diffusion trace, while in a real-world social network, there often coexist multiple information diffusions over the same network. In this paper, we propose a novel approach called Collaborative Inference Model (CIM) for the problem of the inference of coexisting information diffusions. By exploiting the synergism between the coexisting information diffusions, CIM holistically models multiple information diffusions as a sparse 4th-order tensor called Coexisting Diffusions Tensor (CDT) without any prior assumption of diffusion models, and collaboratively infers the histories of the coexisting information diffusions via a low-rank approximation of CDT with a fusion of heterogeneous constraints generated from additional data sources. To improve the efficiency, we further propose an optimal algorithm called Time Window based Parallel Decomposition Algorithm (TWPDA), which can speed up the inference without compromise on the accuracy by utilizing the temporal locality of information diffusions. The extensive experiments conducted on real world datasets and synthetic datasets verify the effectiveness and efficiency of CIM and TWPDA.

cs.SI↗

One-step synthesis of van der Waals heterostructures of graphene and 2D superconducting a-Mo2C

Assembling different two-dimensional (2D) crystals, covering a very broad range of properties, into van der Waals (vdW) heterostructures enables the unprecedented possibilities for combining the best of different ingredients in one objective material. So far, metallic, semiconducting, and insulating 2D crystals have been used successfully in making functional vdW heterostructures with properties by design. Here, we expand 2D superconducting crystals as a building block of the vdW hererostructures. A one-step growth of large-scale high-quality vdW heterostructures of graphene and 2D superconducting a-Mo2C by using chemical vapor deposition (CVD) method is reported. The superconductivity and its 2D nature of the heterostructures are characterized by our scanning tunneling microscopy (STM) measurements. This adds the 2D superconductivity, the most attractive property of condensed matter physics, to the vdW heterostructures.

cond-mat.mtrl-sci↗

Bound States in Nanoscale Graphene Quantum Dots in a Continuous Graphene Sheet

Considerable efforts have been made to trap massless Dirac fermions in graphene monolayer, but only quasi-bound states are realized in continuous graphene sheets up to now. Here, we demonstrate the realization of bound states in nanoscale graphene quantum dots (GQDs) in a continuous graphene sheet. The GQDs are electronically isolated from the surrounding continuous graphene sheet by circular boundaries, which are generated by strong coupling between graphene and substrate. By using scanning tunneling microscopy (STM), we observe single-electron charging states of the GQDs, seen as Coulomb oscillations in the tunneling conductance. Evolution of single-electron tunneling of the GQDs between the Coulomb blockade regime and the Coulomb staircase regime is observed by tuning the STM tip-sample distances. Spatial maps of the local electronic densities reveal concentric rings inside the GQDs with each ring corresponding to a single Coulomb oscillation of the tunneling spectra. These results indicate explicitly that the electrons are completely trapped inside the nanoscale GQDs.

cond-mat.mes-hall↗