arXiv subjects

Wei Wei

Publications and source records attributed to Wei Wei.

At least 361 records · Page 20Linked to original sources

arXiv2021

Context-aware Entity Typing in Knowledge Graphs

Knowledge graph entity typing aims to infer entities' missing types in knowledge graphs which is an important but under-explored issue. This paper proposes a novel method for this task by utilizing entities' contextual information. Specifically, we design two inference mechanisms: i) N2T: independently use each neighbor of an entity to infer its type; ii) Agg2T: aggregate the neighbors of an entity to infer its type. Those mechanisms will produce multiple inference results, and an exponentially weighted pooling method is used to generate the final inference result. Furthermore, we propose a novel loss function to alleviate the false-negative problem during training. Experiments on two real-world KGs demonstrate the effectiveness of our method. The source code and data of this paper can be obtained from https://github.com/CCIIPLab/CET.

cs.CL↗

arXiv2021

Scalable massively parallel computing using continuous-time data representation in nanoscale crossbar array

The growth of connected intelligent devices in the Internet of Things has created a pressing need for real-time processing and understanding of large volumes of analogue data. The difficulty in boosting the computing speed renders digital computing unable to meet the demand for processing analogue information that is intrinsically continuous in magnitude and time. By utilizing a continuous data representation in a nanoscale crossbar array, parallel computing can be implemented for the direct processing of analogue information in real time. Here, we propose a scalable massively parallel computing scheme by exploiting a continuous-time data representation and frequency multiplexing in a nanoscale crossbar array. This computing scheme enables the parallel reading of stored data and the one-shot operation of matrix-matrix multiplications in the crossbar array. Furthermore, we achieve the one-shot recognition of 16 letter images based on two physically interconnected crossbar arrays and demonstrate that the processing and modulation of analogue information can be simultaneously performed in a memristive crossbar array.

cond-mat.mtrl-sci↗

arXiv2021

Storage and Transmission Capacity Requirements of a Remote Solar Power Generation System

Large solar power stations usually locate in remote areas and connect to the main grid via a long transmission line. Energy storage unit is deployed locally with the solar plant to smooth its output. Capacities of the grid-connection transmission line and the energy storage unit have a significant impact on the utilization rate of solar energy, as well as the investment cost. This paper characterizes the feasible set of capacity parameters under a given solar spillage rate and a fixed investment budget. A linear programming based projection algorithm is proposed to obtain such a feasible set, offering valuable references for system planning and policy making.

eess.SY↗

arXiv2021

Multi-granularity Textual Adversarial Attack with Behavior Cloning

Recently, the textual adversarial attack models become increasingly popular due to their successful in estimating the robustness of NLP models. However, existing works have obvious deficiencies. (1) They usually consider only a single granularity of modification strategies (e.g. word-level or sentence-level), which is insufficient to explore the holistic textual space for generation; (2) They need to query victim models hundreds of times to make a successful attack, which is highly inefficient in practice. To address such problems, in this paper we propose MAYA, a Multi-grAnularitY Attack model to effectively generate high-quality adversarial samples with fewer queries to victim models. Furthermore, we propose a reinforcement-learning based method to train a multi-granularity attack agent through behavior cloning with the expert knowledge from our MAYA algorithm to further reduce the query times. Additionally, we also adapt the agent to attack black-box models that only output labels without confidence scores. We conduct comprehensive experiments to evaluate our attack models by attacking BiLSTM, BERT and RoBERTa in two different black-box attack settings and three benchmark datasets. Experimental results show that our models achieve overall better attacking performance and produce more fluent and grammatical adversarial samples compared to baseline models. Besides, our adversarial attack agent significantly reduces the query times in both attack settings. Our codes are released at https://github.com/Yangyi-Chen/MAYA.

cs.CL↗

arXiv2021

Flexibility Requirement when Tracking Renewable Power Fluctuation with Peer-to-Peer Energy Sharing

Flexible load at the demand-side has been regarded as an effective measure to cope with volatile distributed renewable generations. To unlock the demand-side flexibility, this paper proposes a peer-to-peer energy sharing mechanism that facilitates energy exchange among users while preserving privacy. We prove the existence and partial uniqueness of the energy sharing market equilibrium and provide a centralized optimization to obtain the equilibrium. The centralized optimization is further linearized by a convex combination approach, turning into a multi-parametric linear program (MP-LP) with renewable output deviations being the parameters. The flexibility requirement of individual users is calculated based on this MP-LP. To be specific, an adaptive vertex generation algorithm is established to construct a piecewise linear estimator of the optimal total cost subject to a given error tolerance. Critical regions and optimal strategies are retrieved from the obtained approximate cost function to evaluate the flexibility requirement. The proposed algorithm does not rely on the exact characterization of optimal basis invariant sets and thus is not influenced by model degeneracy, a common difficulty faced by existing approaches. Case studies validate the theoretical results and show that the proposed method is scalable.

math.OC↗

arXiv2021

Targetting Kollo Skewness with Random Orthogonal Matrix Simulation

Modelling multivariate systems is important for many applications in engineering and operational research. The multivariate distributions under scrutiny usually have no analytic or closed form. Therefore their modelling employs a numerical technique, typically multivariate simulations, which can have very high dimensions. Random Orthogonal Matrix (ROM) simulation is a method that has gained some popularity because of the absence of certain simulation errors. Specifically, it exactly matches a target mean, covariance matrix and certain higher moments with every simulation. This paper extends the ROM simulation algorithm presented by Hanke et al. (2017), hereafter referred to as HPSW, which matches the target mean, covariance matrix and Kollo skewness vector exactly. Our first contribution is to establish necessary and sufficient conditions for the HPSW algorithm to work. Our second contribution is to develop a general approach for constructing admissible values in the HPSW. Our third theoretical contribution is to analyse the effect of multivariate sample concatenation on the target Kollo skewness. Finally, we illustrate the extensions we develop here using a simulation study.

stat.CO↗

arXiv2021

Graphical Representation and Hierarchical Decomposition Mechanism for Vertex-Cover Solution Space

In this paper, solution space organization of minimum vertex-cover problem is deeply investigated using the König-Egérvary (KE) graph and theorem, in which a hierarchical decomposition mechanism named KE-layer structure of general graphs is proposed to reveal the complexity of vertex-cover. An algorithm to verify the KE graph is given by the solution space expression of vertex-cover, and the relation between multi-layer KE graphs and maximal matching is illustrated and proved. Furthermore, a framework to calculate the KE-layer number and approximate the minimal vertex-cover is provided, with different strategies of switching nodes and counting energy. The phase transition phenomenon between different KE-layers are studied with the transition points located, and searching of vertex-cover got by this strategy presents comparable advantage against several other methods. The graphical representation and hierarchical decomposition provide a new perspective to illustrate the intrinsic complexity for large-scale graphs/systems recognition.

cs.SI↗

arXiv2021

A Data-Centric Framework for Composable NLP Workflows

Empirical natural language processing (NLP) systems in application domains (e.g., healthcare, finance, education) involve interoperation among multiple components, ranging from data ingestion, human annotation, to text retrieval, analysis, generation, and visualization. We establish a unified open-source framework to support fast development of such sophisticated NLP workflows in a composable manner. The framework introduces a uniform data representation to encode heterogeneous results by a wide range of NLP tasks. It offers a large repository of processors for NLP tasks, visualization, and annotation, which can be easily assembled with full interoperability under the unified representation. The highly extensible framework allows plugging in custom processors from external off-the-shelf NLP and deep learning libraries. The whole framework is delivered through two modularized yet integratable open-source projects, namely Forte (for workflow infrastructure and NLP function processors) and Stave (for user interaction, visualization, and annotation).

cs.CL↗

arXiv2021

DARNet: Dual-Attention Residual Network for Automatic Diagnosis of COVID-19 via CT Images

The ongoing global pandemic of Coronavirus Disease 2019 (COVID-19) poses a serious threat to public health and the economy. Rapid and accurate diagnosis of COVID-19 is crucial to prevent the further spread of the disease and reduce its mortality. Chest Computed tomography (CT) is an effective tool for the early diagnosis of lung diseases including pneumonia. However, detecting COVID-19 from CT is demanding and prone to human errors as some early-stage patients may have negative findings on images. Recently, many deep learning methods have achieved impressive performance in this regard. Despite their effectiveness, most of these methods underestimate the rich spatial information preserved in the 3D structure or suffer from the propagation of errors. To address this problem, we propose a Dual-Attention Residual Network (DARNet) to automatically identify COVID-19 from other common pneumonia (CP) and healthy people using 3D chest CT images. Specifically, we design a dual-attention module consisting of channel-wise attention and depth-wise attention mechanisms. The former is utilized to enhance channel independence, while the latter is developed to recalibrate the depth-level features. Then, we integrate them in a unified manner to extract and refine the features at different levels to further improve the diagnostic performance. We evaluate DARNet on a large public CT dataset and obtain superior performance. Besides, the ablation study and visualization analysis prove the effectiveness and interpretability of the proposed method.

eess.IV↗

arXiv2021

Energy equality in the isentropic compressible Navier-Stokes equations allowing vacuum

It is well-known that a Leray-Hopf weak solution in $L^4 (0,T; L^4(Ω))$ for the incompressible Navier-Stokes system is persistence of energy due to Lions [19]. In this paper, it is shown that Lions's condition for energy balance is also valid for the weak solutions of the isentropic compressible Navier-Stokes equations allowing vacuum under suitable integrability conditions on the density and its derivative. This allows us to establish various sufficient conditions implying energy equality for the compressible flow as well as the non-homogenous incompressible Navier-Stokes equations. This is an improvement of corresponding results obtained by Yu in [32, Arch. Ration. Mech. Anal., 225 (2017)], and our criterion via the gradient of the velocity partially answers a question posed by Liang in [18, Proc. Roy. Soc. Edinburgh Sect. A (2020)].

math.AP↗

arXiv2021

BESS Aided Reconfigurable Energy Supply using Deep Reinforcement Learning for 5G and Beyond

The year of 2020 has witnessed the unprecedented development of 5G networks, along with the widespread deployment of 5G base stations (BSs). Nevertheless, the enormous energy consumption of BSs and the incurred huge energy cost have become significant concerns for the mobile operators. As the continuous decline of the renewable energy cost, equipping the power-hungry BSs with renewable energy generators could be a sustainable solution. In this work, we propose an energy storage aided reconfigurable renewable energy supply solution for the BS, which could supply clean energy to the BS and store surplus energy for backup usage. Specifically, to flexibly reconfigure the battery's discharging/charging operations, we propose a deep reinforcement learning based reconfiguring policy, which can adapt to the dynamical renewable energy generations as well as the varying power demands. Our experiments using the real-world data on renewable energy generations and power demands demonstrate that, our reconfigurable power supply solution can achieve an energy saving ratio of 74.8%, compared to the case with traditional power grid supply.

cs.DC↗

arXiv2021

Star Cluster Classification in the PHANGS-HST Survey: Comparison between Human and Machine Learning Approaches

When completed, the PHANGS-HST project will provide a census of roughly 50,000 compact star clusters and associations, as well as human morphological classifications for roughly 20,000 of those objects. These large numbers motivated the development of a more objective and repeatable method to help perform source classifications. In this paper we consider the results for five PHANGS-HST galaxies (NGC 628, NGC 1433, NGC 1566, NGC 3351, NGC 3627) using classifications from two convolutional neural network architectures (RESNET and VGG) trained using deep transfer learning techniques. The results are compared to classifications performed by humans. The primary result is that the neural network classifications are comparable in quality to the human classifications with typical agreement around 70 to 80$\%$ for Class 1 clusters (symmetric, centrally concentrated) and 40 to 70$\%$ for Class 2 clusters (asymmetric, centrally concentrated). If Class 1 and 2 are considered together the agreement is 82 $\pm$ 3$\%$. Dependencies on magnitudes, crowding, and background surface brightness are examined. A detailed description of the criteria and methodology used for the human classifications is included along with an examination of systematic differences between PHANGS-HST and LEGUS. The distribution of data points in a colour-colour diagram is used as a 'figure of merit' to further test the relative performances of the different methods. The effects on science results (e.g., determinations of mass and age functions) of using different cluster classification methods are examined and found to be minimal.

astro-ph.GA↗

arXiv2021

Locality Relationship Constrained Multi-view Clustering Framework

In most practical applications, it's common to utilize multiple features from different views to represent one object. Among these works, multi-view subspace-based clustering has gained extensive attention from many researchers, which aims to provide clustering solutions to multi-view data. However, most existing methods fail to take full use of the locality geometric structure and similarity relationship among samples under the multi-view scenario. To solve these issues, we propose a novel multi-view learning method with locality relationship constraint to explore the problem of multi-view clustering, called Locality Relationship Constrained Multi-view Clustering Framework (LRC-MCF). LRC-MCF aims to explore the diversity, geometric, consensus and complementary information among different views, by capturing the locality relationship information and the common similarity relationships among multiple views. Moreover, LRC-MCF takes sufficient consideration to weights of different views in finding the common-view locality structure and straightforwardly produce the final clusters. To effectually reduce the redundancy of the learned representations, the low-rank constraint on the common similarity matrix is considered additionally. To solve the minimization problem of LRC-MCF, an Alternating Direction Minimization (ADM) method is provided to iteratively calculate all variables LRC-MCF. Extensive experimental results on seven benchmark multi-view datasets validate the effectiveness of the LRC-MCF method.

cs.CV↗

arXiv2021

Accelerated, Scalable and Reproducible AI-driven Gravitational Wave Detection

The development of reusable artificial intelligence (AI) models for wider use and rigorous validation by the community promises to unlock new opportunities in multi-messenger astrophysics. Here we develop a workflow that connects the Data and Learning Hub for Science, a repository for publishing AI models, with the Hardware Accelerated Learning (HAL) cluster, using funcX as a universal distributed computing service. Using this workflow, an ensemble of four openly available AI models can be run on HAL to process an entire month's worth (August 2017) of advanced Laser Interferometer Gravitational-Wave Observatory data in just seven minutes, identifying all four all four binary black hole mergers previously identified in this dataset and reporting no misclassifications. This approach combines advances in AI, distributed computing, and scientific data infrastructure to open new pathways to conduct reproducible, accelerated, data-driven discovery.

gr-qc↗

arXiv2021

Gagliardo-Nirenberg inequalities in Lorentz type spaces and energy equality for the Navier-Stokes system

In this paper, we derive some new Gagliardo-Nirenberg type inequalities in Lorentz type spaces without restrictions on the second index of Lorentz norms, which generalize almost all known corresponding results. Our proof mainly relies on the Bernstein inequalities in Lorentz spaces, the embedding relation among various Lorentz type spaces, and Littlewood-Paley decomposition techniques. In addition, we establish several novel criteria in terms of the velocity or the gradient of the velocity in Lorentz spaces for energy conservation of the 3D Navier-Stokes equations. Particularly, we improve the classical Shinbrot's condition for energy balance to allow both the space-time directions of the velocity to be in Lorentz spaces.

math.AP↗

arXiv2021

Overcoming Catastrophic Forgetting by Generative Regularization

In this paper, we propose a new method to overcome catastrophic forgetting by adding generative regularization to Bayesian inference framework. Bayesian method provides a general framework for continual learning. We could further construct a generative regularization term for all given classification models by leveraging energy-based models and Langevin-dynamic sampling to enrich the features learned in each task. By combining discriminative and generative loss together, we empirically show that the proposed method outperforms state-of-the-art methods on a variety of tasks, avoiding catastrophic forgetting in continual learning. In particular, the proposed method outperforms baseline methods over 15% on the Fashion-MNIST dataset and 10% on the CUB dataset

cs.LG↗

arXiv2021

Bias-dependent intrinsic RF thermal noise modeling and characterization of single layer graphene FETs

In this article, the bias-dependence of intrinsic channel thermal noise of single-layer graphene field-effect transistors (GFETs) is thoroughly investigated by experimental observations and compact modeling. The findings indicate an increase of the specific noise as drain current increases whereas a saturation trend is observed at very high carrier density regime. Besides, short-channel effects like velocity saturation also result in an increment of noise at higher electric fields. The main goal of this work is to propose a physics-based compact model that accounts for and accurately predicts the above experimental observations in short-channel GFETs. In contrast to long-channel MOSFET based models adopted previously to describe thermal noise in graphene devices without considering the degenerate nature of graphene, in this work a model for short-channel GFETs embracing the 2D materials underlying physics and including a bias dependency is presented. The implemented model is validated with de-embedded high frequency data from two short-channel devices at Quasi-Static region of operation. The model precisely describes the experimental data for a wide range of low to high drain current values without the need of any fitting parameter. Moreover, the consideration of the degenerate nature of graphene reveals a significant decrease of noise in comparison with the non degenerate case and the model accurately captures this behavior. This work can also be of outmost significance from circuit designers aspect, since noise excess factor, a very important figure of merit for RF circuits implementation, is defined and characterized for the first time in graphene transistors.

cond-mat.mes-hall↗

arXiv2021

Global Context Enhanced Graph Neural Networks for Session-based Recommendation

Session-based recommendation (SBR) is a challenging task, which aims at recommending items based on anonymous behavior sequences. Almost all the existing solutions for SBR model user preference only based on the current session without exploiting the other sessions, which may contain both relevant and irrelevant item-transitions to the current session. This paper proposes a novel approach, called Global Context Enhanced Graph Neural Networks (GCE-GNN) to exploit item transitions over all sessions in a more subtle manner for better inferring the user preference of the current session. Specifically, GCE-GNN learns two levels of item embeddings from session graph and global graph, respectively: (i) Session graph, which is to learn the session-level item embedding by modeling pairwise item-transitions within the current session; and (ii) Global graph, which is to learn the global-level item embedding by modeling pairwise item-transitions over all sessions. In GCE-GNN, we propose a novel global-level item representation learning layer, which employs a session-aware attention mechanism to recursively incorporate the neighbors' embeddings of each node on the global graph. We also design a session-level item representation learning layer, which employs a GNN on the session graph to learn session-level item embeddings within the current session. Moreover, GCE-GNN aggregates the learnt item representations in the two levels with a soft attention mechanism. Experiments on three benchmark datasets demonstrate that GCE-GNN outperforms the state-of-the-art methods consistently.

cs.IR↗