Search arXiv⌕ Search

arXiv subjects

Min Yang

Publications and source records attributed to Min Yang.

At least 343 records · Page 19Linked to original sources
arXiv2018

A Multi-sentiment-resource Enhanced Attention Network for Sentiment Classification

Deep learning approaches for sentiment classification do not fully exploit sentiment linguistic knowledge. In this paper, we propose a Multi-sentiment-resource Enhanced Attention Network (MEAN) to alleviate the problem by integrating three kinds of sentiment linguistic knowledge (e.g., sentiment lexicon, negation words, intensity words) into the deep neural network via attention mechanisms. By using various types of sentiment resources, MEAN utilizes sentiment-relevant information from different representation subspaces, which makes it more effective to capture the overall semantics of the sentiment, negation and intensity words for sentiment prediction. The experimental results demonstrate that MEAN has robust superiority over strong competitors.

cs.CL↗
arXiv2018

Leveraging Long and Short-term Information in Content-aware Movie Recommendation

Movie recommendation systems provide users with ranked lists of movies based on individual's preferences and constraints. Two types of models are commonly used to generate ranking results: long-term models and session-based models. While long-term models represent the interactions between users and movies that are supposed to change slowly across time, session-based models encode the information of users' interests and changing dynamics of movies' attributes in short terms. In this paper, we propose an LSIC model, leveraging Long and Short-term Information in Content-aware movie recommendation using adversarial training. In the adversarial process, we train a generator as an agent of reinforcement learning which recommends the next movie to a user sequentially. We also train a discriminator which attempts to distinguish the generated list of movies from the real records. The poster information of movies is integrated to further improve the performance of movie recommendation, which is specifically essential when few ratings are available. The experiments demonstrate that the proposed model has robust superiority over competitors and sets the state-of-the-art. We will release the source code of this work after publication.

cs.IR↗
arXiv2018

Virtual trions in the photoluminescence of monolayer transition-metal dichalcogenides

Photoluminescence experiments from monolayer transition-metal dichalcogenides often show that the binding energy of trions is conspicuously similar to the energy of optical phonons. This enigmatic coincidence calls into question whether phonons are involved in the radiative recombination process. We address this problem, unraveling an intriguing optical transition mechanism. Its initial state is a localized charge (electron or hole) and delocalized exciton. The final state is the localized charge, phonon and photon. In between, the intermediate state of the system is a virtual trion formed when the localized charge captures the exciton through emission of the phonon. We analyze the difference between radiative recombinations that involve real and virtual trions (i.e., with and without a phonon), providing useful ways to distinguish between the two in experiment.

cond-mat.mtrl-sci↗
arXiv2018

GPSP: Graph Partition and Space Projection based Approach for Heterogeneous Network Embedding

In this paper, we propose GPSP, a novel Graph Partition and Space Projection based approach, to learn the representation of a heterogeneous network that consists of multiple types of nodes and links. Concretely, we first partition the heterogeneous network into homogeneous and bipartite subnetworks. Then, the projective relations hidden in bipartite subnetworks are extracted by learning the projective embedding vectors. Finally, we concatenate the projective vectors from bipartite subnetworks with the ones learned from homogeneous subnetworks to form the final representation of the heterogeneous network. Extensive experiments are conducted on a real-life dataset. The results demonstrate that GPSP outperforms the state-of-the-art baselines in two key network mining tasks: node classification and clustering.

cs.SI↗
arXiv2017

Generative Adversarial Network for Abstractive Text Summarization

In this paper, we propose an adversarial process for abstractive text summarization, in which we simultaneously train a generative model G and a discriminative model D. In particular, we build the generator G as an agent of reinforcement learning, which takes the raw text as input and predicts the abstractive summarization. We also build a discriminator which attempts to distinguish the generated summary from the ground truth summary. Extensive experiments demonstrate that our model achieves competitive ROUGE scores with the state-of-the-art methods on CNN/Daily Mail dataset. Qualitatively, we show that our model is able to generate more abstractive, readable and diverse summaries.

cs.CL↗
arXiv2017

Information-Based Optimal Subdata Selection for Big Data Linear Regression

Extraordinary amounts of data are being produced in many branches of science. Proven statistical methods are no longer applicable with extraordinary large data sets due to computational limitations. A critical step in big data analysis is data reduction. Existing investigations in the context of linear regression focus on subsampling-based methods. However, not only is this approach prone to sampling errors, it also leads to a covariance matrix of the estimators that is typically bounded from below by a term that is of the order of the inverse of the subdata size. We propose a novel approach, termed information-based optimal subdata selection (IBOSS). Compared to leading existing subdata methods, the IBOSS approach has the following advantages: (i) it is significantly faster; (ii) it is suitable for distributed parallel computing; (iii) the variances of the slope parameter estimators converge to 0 as the full data size increases even if the subdata size is fixed, i.e., the convergence rate depends on the full data size; (iv) data analysis for IBOSS subdata is straightforward and the sampling distribution of an IBOSS estimator is easy to assess. Theoretical results and extensive simulations demonstrate that the IBOSS approach is superior to subsampling-based methods, sometimes by orders of magnitude. The advantages of the new approach are also illustrated through analysis of real data.

stat.ME↗
arXiv2017

Load Balancing using Hilbert Space-filling Curves for Parallel Reservoir Simulations

The goal of load balancing (grid partitioning) is to minimize overall computations and communications, and to make sure that all processors have a similar workload. Geometric methods divide a grid by using a location of a cell while topological methods work with connectivity of cells, which is generally described as a graph. This paper introduces a Hilbert space-filling curve method. A space-filling curve is a continuous curve and defines a map between a one-dimensional space and a multi-dimensional space. A Hilbert space-filling curve is one special space-filling curve discovered by Hilbert and has many useful characteristics, such as good locality, which means that two objects that are close to each other in a multi-dimensional space are also close to each other in a one dimensional space. This property can model communications in grid-based parallel applications. The idea of the Hilbert space-filling curve method is to map a computational domain into a one-dimensional space, partition the one-dimensional space to certain intervals, and assign all cells in a same interval to a MPI. To implement a load balancing method, a mapping kernel is required to convert high-dimensional coordinates to a scalar value and an efficient one-dimensional partitioning module that divides a one-dimensional space and makes sure that all intervals have a similar workload. The Hilbert space-filling curve method is compared with ParMETIS, a famous graph partitioning package. The results show that our Hilbert space-filling curve method has good partition quality. It has been applied to grids with billions of cells, and linear scalability has been obtained on IBM Blue Gene/Q.

cs.DC↗
arXiv2017

A Hybrid Data Association Framework for Robust Online Multi-Object Tracking

Global optimization algorithms have shown impressive performance in data-association based multi-object tracking, but handling online data remains a difficult hurdle to overcome. In this paper, we present a hybrid data association framework with a min-cost multi-commodity network flow for robust online multi-object tracking. We build local target-specific models interleaved with global optimization of the optimal data association over multiple video frames. More specifically, in the min-cost multi-commodity network flow, the target-specific similarities are online learned to enforce the local consistency for reducing the complexity of the global data association. Meanwhile, the global data association taking multiple video frames into account alleviates irrecoverable errors caused by the local data association between adjacent frames. To ensure the efficiency of online tracking, we give an efficient near-optimal solution to the proposed min-cost multi-commodity flow problem, and provide the empirical proof of its sub-optimality. The comprehensive experiments on real data demonstrate the superior tracking performance of our approach in various challenging situations.

cs.CV↗
arXiv2016

Context-aware System Service Call-oriented Symbolic Execution of Android Framework with Application to Exploit Generation

Android Framework is a layer of software that exists in every Android system managing resources of all Android apps. A vulnerability in Android Framework can lead to severe hacks, such as destroying user data and leaking private information. With tens of millions of Android devices unpatched due to Android fragmentation, vulnerabilities in Android Framework certainly attract attackers to exploit them. So far, enormous manual effort is needed to craft such exploits. To our knowledge, no research has been done on automatic generation of exploits that take advantage of Android Framework vulnerabilities. We make a first step towards this goal by applying symbolic execution of Android Framework to finding bugs and generating exploits. Several challenges have been raised by the task. (1) The information of an app flows to Android Framework in multiple intricate steps, making it difficult to identify symbolic inputs. (2) Android Framework has a complex initialization phase, which exacerbates the state space explosion problem. (3) A straightforward design that builds the symbolic executor as a layer inside the Android system will not work well: not only does the implementation have to ensure the compatibility with the Android system, but it needs to be maintained whenever Android gets updated. We present novel ideas and techniques to resolve the challenges, and have built the first system for symbolic execution of Android Framework. It fundamentally changes the state of the art in exploit generation on the Android system, and has been applied to constructing new techniques for finding vulnerabilities.

cs.CR↗
arXiv2016

Self-ordered Mo-oxide Nanotube Arrays as Precursor for Aligned MoOx/MoS2 Core-Shell Nanotubular Structures with a High Density of Reactive Sites

In the present work we demonstrate the self-organized formation of anodic Mo-oxide nanotube arrays grown on a Mo sheet under suitable electrochemical conditions in glycerol/NH4F electrolytes. The resulting amorphous tubes can be crystallized by annealing to MoO2 or MoO3. The tube walls then can be further sulfurized fully or partially to Mo-sulfide to form well-ordered arrays of vertically aligned MoOx/MoS2 nanotubes. Under optimized conditions, defined MoS2 sheets form on the oxide walls in a layer by layer low angle zig-zag arrangement that provide a high density of reactive stacking faults. These core-shell nanotube arrays, consisting of tubes with a conductive suboxide core and a functional high defect density MoS2 coating, are highly promising for applications such as electrocatalysis (hydrogen evolution) or ion insertion devices.

cond-mat.mtrl-sci↗
arXiv2016

Acoustic Coherent Perfect Absorbers as Sensitive Null Detectors

We report the experimental realization of acoustic coherent perfect absorption (CPA) of four symmetric scatterers of very different structures. The only conditions necessary for these scatterers to exhibit CPA are that both the reflection and transmission amplitudes of the scatterers are 0.5 under one incident wave, and there are two collinear and counter-propagating incident waves with appropriate relative amplitude and phase. Nearly 1000 times in the modulation of output power has been demonstrated by changing the relative phase of the incident waves over 180°. We further demonstrate that these scatterers are sensitive devices to detect the small differences between two nearly equal incident waves. A 27 % change in the strength of the scattering wave has been demonstrated for every degree of phase deviation from the optimum condition between the incident waves.

physics.class-ph↗
arXiv2016

Hybrid membrane resonators for multiple frequency asymmetric absorption and reflection in large waveguide

We report that Hybrid membrane resonators (HMRs) made of a decorated membrane resonator backed by a shallow cavity can function as Helmholtz resonators (HRs) when mounted on the sidewall of a clear waveguide for air ventilation. When two single-frequency HMRs are used in the same scheme as two frequency-detuned HRs, asymmetric total absorption/reflection is demonstrated at 286.7 Hz with absorption coefficient over 97 % in a waveguide 9 cm x 9 cm in cross section. When two multiple-frequency HMRs are used, absorption in the range of near 60 % to above 80 % is observed at 403 Hz, 450 Hz, 688 Hz, 863 Hz and 945 Hz. Theoretical predictions agree well with the experimental data. The HMRs may replace HRs in duct noise reduction applications in that at a single operation frequency they have stronger strength to cover a much larger cross section area than that of HRs with similar cavity volume, and they can be designed to provide multiple frequency absorption band.

physics.class-ph↗
arXiv2016

Optimal Sound Absorbing Structures

Causal nature of the acoustic response, for any materials or structures, dictates an inequality that relates the absorption spectrum of the sample to its thickness. We present a general recipe for constructing sound-absorbing structures that can attain near-equality for the causal relation with very high absorption performance; such structures are denoted optimal. Our strategy involves using carefully designed acoustic metamaterials as backing to a thin layer of conventional sound absorbing material, e.g., acoustic sponge. By using this design approach, we have realized a 12 cm-thick structure that exhibits broadband, near-perfect flat absorption spectrum starting at around 400 Hz. From the causal relation, the calculated minimum sample thickness is 11.5 cm for the observed absorption spectrum. We present the theory that underlies such absorption performance, involving the evanescent waves and their interaction with a dissipative medium, and show the excellent agreement with the experiment.

physics.class-ph↗
arXiv2016

Telepresence Interaction by Touching Live Video Images

This paper presents a telepresence interaction framework based on touchscreen and telepresence-robot technologies. The core of the framework is a new user interface, Touchable live video Image based User Interface, called TIUI. The TIUI allows a remote operator to not just drive the telepresence robot but operate and interact with real objects by touching their live video images on a pad with finger touch gestures. We implemented a telepresence interaction system which is composed of a telepresence robot and tele-interactive objects located in a local space, the TIUI of a pad located in a remote space, and the wireless networks connecting the two spaces. Our system can be a perfect embodiment of a remote operator to do most of daily living tasks, such as opening a door, drawing a curtain, pushing a wheelchair, and other like tasks. The evaluation and demonstration results show the effectiveness and promising applications of our system.

cs.HC↗
arXiv2016

Local unitary equivalence of quantum states and simultaneous orthogonal equivalence

The correspondence between local unitary equivalence of bipartite quantum states and simultaneous orthogonal equivalence is thoroughly investigated and strengthened. It is proved that local unitary equivalence can be studied through simultaneous similarity under projective orthogonal transformations, and four parametrization independent algorithms are proposed to judge when two density matrices on $\mathbb C^{d_1}\otimes \mathbb C^{d_2}$ are locally unitary equivalent in connection with trace identities, Weierstrass pencils, Albert determinants and Smith normal forms.

quant-ph↗
arXiv2015

Temporal Dynamic Appearance Modeling for Online Multi-Person Tracking

Robust online multi-person tracking requires the correct associations of online detection responses with existing trajectories. We address this problem by developing a novel appearance modeling approach to provide accurate appearance affinities to guide data association. In contrast to most existing algorithms that only consider the spatial structure of human appearances, we exploit the temporal dynamic characteristics within temporal appearance sequences to discriminate different persons. The temporal dynamic makes a sufficient complement to the spatial structure of varying appearances in the feature space, which significantly improves the affinity measurement between trajectories and detections. We propose a feature selection algorithm to describe the appearance variations with mid-level semantic features, and demonstrate its usefulness in terms of temporal dynamic appearance modeling. Moreover, the appearance model is learned incrementally by alternatively evaluating newly-observed appearances and adjusting the model parameters to be suitable for online tracking. Reliable tracking of multiple persons in complex scenes is achieved by incorporating the learned model into an online tracking-by-detection framework. Our experiments on the challenging benchmark MOTChallenge 2015 demonstrate that our method outperforms the state-of-the-art multi-person tracking algorithms.

cs.CV↗
arXiv2015

Subwavelength total acoustic absorption with degenerate resonators

We report the experimental realization of perfect sound absorption by sub-wavelength monopole and dipole resonators that exhibit degenerate resonant frequencies. This is achieved through the destructive interference of two resonators' transmission responses, while the matching of their averaged impedances to that of air implies no backscattering, thereby leading to total absorption. Two examples, both using decorated membrane resonators (DMRs) as the basic units, are presented. The first is a flat panel comprising a DMR and a pair of coupled DMRs, while the second one is a ventilated short tube containing a DMR in conjunction with a sidewall DMR backed by a cavity. In both examples, near perfect absorption, up to 99.7%, has been observed with the airborne wavelength up to 1.2 m, which is at least an order of magnitude larger than the composite absorber. Excellent agreement between theory and experiment is obtained.

cond-mat.mtrl-sci↗