Searcharxiv⌕ Search

arXiv subjects

Cheng Yang

Publications and source records attributed to Cheng Yang.

At least 253 records · Page 14Linked to original sources

Neural Diffusion Model for Microscopic Cascade Prediction

The prediction of information diffusion or cascade has attracted much attention over the last decade. Most cascade prediction works target on predicting cascade-level macroscopic properties such as the final size of a cascade. Existing microscopic cascade prediction models which focus on user-level modeling either make strong assumptions on how a user gets infected by a cascade or limit themselves to a specific scenario where "who infected whom" information is explicitly labeled. The strong assumptions oversimplify the complex diffusion mechanism and prevent these models from better fitting real-world cascade data. Also, the methods which focus on specific scenarios cannot be generalized to a general setting where the diffusion graph is unobserved. To overcome the drawbacks of previous works, we propose a Neural Diffusion Model (NDM) for general microscopic cascade prediction. NDM makes relaxed assumptions and employs deep learning techniques including attention mechanism and convolutional network for cascade modeling. Both advantages enable our model to go beyond the limitations of previous methods, better fit the diffusion data and generalize to unseen cascades. Experimental results on diffusion prediction task over four realistic cascade datasets show that our model can achieve a relative improvement up to 26% against the best performing baseline in terms of F1 score.

cs.SI↗

COSINE: Compressive Network Embedding on Large-scale Information Networks

There is recently a surge in approaches that learn low-dimensional embeddings of nodes in networks. As there are many large-scale real-world networks, it's inefficient for existing approaches to store amounts of parameters in memory and update them edge after edge. With the knowledge that nodes having similar neighborhood will be close to each other in embedding space, we propose COSINE (COmpresSIve NE) algorithm which reduces the memory footprint and accelerates the training process by parameters sharing among similar nodes. COSINE applies graph partitioning algorithms to networks and builds parameter sharing dependency of nodes based on the result of partitioning. With parameters sharing among similar nodes, COSINE injects prior knowledge about higher structural information into training process which makes network embedding more efficient and effective. COSINE can be applied to any embedding lookup method and learn high-quality embeddings with limited memory and shorter training time. We conduct experiments of multi-label classification and link prediction, where baselines and our model have the same memory usage. Experimental results show that COSINE gives baselines up to 23% increase on classification and up to 25% increase on link prediction. Moreover, time of all representation learning methods using COSINE decreases from 30% to 70%.

cs.SI↗

A controllable two-membrane-in-the-middle cavity optomechanical system

We report an optomechanical system with two dielectric membranes inside a Fabry-Perot cavity. The cavity resonant frequencies are measured in such a two-membrane-in-the-middle system, which show an interesting band-structure-like diagram. This system exhibits great controllability on the parameters of the system. The positions and angles of each membrane can be manipulated on demand by placing two membranes inside the cavity separately. The eigenfrequencies of the vibrational modes of the membranes can also be tuned individually with piezoelectricity. This scheme could be straightforwardly extended to multiple-membrane-in-the-middle systems, where more than two membranes are involved. Such a well controllable multiple membrane optomechanical system provides a promising platform for studying nonlinear and quantum dynamical phenomena in multimode optomechanics with distinct mechanical oscillators.

physics.optics↗

CED: Credible Early Detection of Social Media Rumors

Rumors spread dramatically fast through online social media services, and people are exploring methods to detect rumors automatically. Existing methods typically learn semantic representations of all reposts to a rumor candidate for prediction. However, it is crucial to efficiently detect rumors as early as possible before they cause severe social disruption, which has not been well addressed by previous works. In this paper, we present a novel early rumor detection model, Credible Early Detection (CED). By regarding all reposts to a rumor candidate as a sequence, the proposed model will seek an early point-in-time for making a credible prediction. We conduct experiments on three real-world datasets, and the results demonstrate that our proposed model can remarkably reduce the time span for prediction by more than 85%, with better accuracy performance than all state-of-the-art baselines.

cs.SI↗

Learning and Transferring IDs Representation in E-commerce

Many machine intelligence techniques are developed in E-commerce and one of the most essential components is the representation of IDs, including user ID, item ID, product ID, store ID, brand ID, category ID etc. The classical encoding based methods (like one-hot encoding) are inefficient in that it suffers sparsity problems due to its high dimension, and it cannot reflect the relationships among IDs, either homogeneous or heterogeneous ones. In this paper, we propose an embedding based framework to learn and transfer the representation of IDs. As the implicit feedbacks of users, a tremendous amount of item ID sequences can be easily collected from the interactive sessions. By jointly using these informative sequences and the structural connections among IDs, all types of IDs can be embedded into one low-dimensional semantic space. Subsequently, the learned representations are utilized and transferred in four scenarios: (i) measuring the similarity between items, (ii) transferring from seen items to unseen items, (iii) transferring across different domains, (iv) transferring across different tasks. We deploy and evaluate the proposed approach in Hema App and the results validate its effectiveness.

cs.LG↗

Avalon: Building an Operating System for Robotcenter

This paper envisions a scenario that hundreds of heterogeneous robots form a robotcenter which can be shared by multiple users and used like a single powerful robot to perform complex tasks. However, current multi-robot systems are either unable to manage heterogeneous robots or unable to support multiple concurrent users. Inspired by the design of modern datacenter OSes, we propose Avalon, a robot operating system with two-level scheduling scheme which is widely adopted in datacenters for Internet services and cloud computing. Specifically, Avalon integrates three important features together: (1) Instead of allocating a whole robot, Avalon classifies fine-grained robot resources into three categories to distinguish which fine-grained resources can be shared by multi-robot frameworks simultaneously. (2) Avalon adopts a location based resource allocation policy to substantially reduce scheduling overhead. (3) Avalon enables robots to offload computation intensive tasks to the clouds.We have implemented and evaluated Avalon on robots on both simulated environments and real world.

cs.RO↗

Fast 3D Point Cloud Denoising via Bipartite Graph Approximation & Total Variation

Acquired 3D point cloud data, whether from active sensors directly or from stereo-matching algorithms indirectly, typically contain non-negligible noise. To address the point cloud denoising problem, we propose a fast graph-based local algorithm. Specifically, given a k-nearest-neighbor graph of the 3D points, we first approximate it with a bipartite graph(independent sets of red and blue nodes) using a KL divergence criterion. For each partite of nodes (say red), we first define surface normal of each red node using 3D coordinates of neighboring blue nodes, so that red node normals n can be written as a linear function of red node coordinates p. We then formulate a convex optimization problem, with a quadratic fidelity term ||p-q||_2^2 given noisy observed red coordinates q and a graph total variation (GTV) regularization term for surface normals of neighboring red nodes. We minimize the resulting l2-l1-norm using alternating direction method of multipliers (ADMM) and proximal gradient descent. The two partites of nodes are alternately optimized until convergence. Experimental results show that compared to state-of-the-art schemes with similar complexity, our proposed algorithm achieves the best overall denoising performance objectively and subjectively.

eess.SP↗

Ultra-high-density local structure of liquid water

The local structure of liquid water plays a key role in determining the anomalous properties of water. We run all-atom simulations for three microscopic water models, and use multiple order parameters to analyse the local structure of water. We identify three types of local structures. In addition to the well known low-density-liquid and high-density-liquid structures, the newly identified third type possesses an ultra high density and overcoordinated H-bonds. The existence of this third type decreases the rate of transition from the high-density-structure to low-density-structure and increases the rate of the reverse one, leading to the enhancement of the high-density-structure stability.

cond-mat.soft↗

Squeezed cooling of mechanical motion beyond the resolved-sideband limit

Cavity optomechanics provides a unique platform for controlling micromechanical systems by means of optical fields that crosses the classical-quantum boundary to achieve solid foundations for quantum technologies. Currently, optomechanical resonators have become promising candidates for the development of precisely controlled nano-motors, ultrasensitive sensors and robust quantum information processors. For all these applications, a crucial requirement is to cool the mechanical resonators down to their quantum ground states. In this paper, we present a novel cooling scheme to further cool a micromechanical resonator via the noise squeezing effect. One quadrature in such a resonator can be squeezed to induce enhanced fluctuation in the other, "heated" quadrature, which can then be used to cool the mechanical motion via conventional optomechanical coupling. Our theoretical analysis and numerical calculations demonstrate that this squeeze-and-cool mechanism offers a quick technique for deeply cooling a macroscopic mechanical resonator to an unprecedented temperature region below the zero-point fluctuations.

quant-ph↗

A Neural Network Approach to Joint Modeling Social Networks and Mobile Trajectories

The accelerated growth of mobile trajectories in location-based services brings valuable data resources to understand users' moving behaviors. Apart from recording the trajectory data, another major characteristic of these location-based services is that they also allow the users to connect whomever they like. A combination of social networking and location-based services is called as location-based social networks (LBSN). As shown in previous works, locations that are frequently visited by socially-related persons tend to be correlated, which indicates the close association between social connections and trajectory behaviors of users in LBSNs. In order to better analyze and mine LBSN data, we present a novel neural network model which can joint model both social networks and mobile trajectories. In specific, our model consists of two components: the construction of social networks and the generation of mobile trajectories. We first adopt a network embedding method for the construction of social networks: a networking representation can be derived for a user. The key of our model lies in the component of generating mobile trajectories. We have considered four factors that influence the generation process of mobile trajectories, namely user visit preference, influence of friends, short-term sequential contexts and long-term sequential contexts. To characterize the last two contexts, we employ the RNN and GRU models to capture the sequential relatedness in mobile trajectories at different levels, i.e., short term or long term. Finally, the two components are tied by sharing the user network representations. Experimental results on two important applications demonstrate the effectiveness of our model. Especially, the improvement over baselines is more significant when either network structure or trajectory data is sparse.

cs.SI↗

On the Hamiltonian and Geometric structure of the Craik-Leibovich equation

In this paper we show that the Craik-Leibovich (CL) equation in hydrodynamics is the Euler equation on the dual of a certain central extension of the Lie algebra of divergence-free vector fields. From this geometric viewpoint, one can give a generalization of CL equation on any Riemannian manifold with boundary. We also prove a stability theorem for 2-dimensional steady flows of the Craik-Leibovich equation.

math-ph↗

On the Ergodic theory of the Generalized incompressible flow

To study the variation problem related to the incompressible fluid mechanics, Brenier brings the concept of generalized flow and shows that the generalized incompressible flow (GIF) is deeply related to the classical solution of the incompressible Euler equations. In this paper, we will study the ergodic theory of the GIF which may help us understand the dynamic property of the classical solution of the incompressible Euler equations. First, we show that the GIF has the weak recurrent property rather than the classical one. Then, we define the ergodicity of the GIF and discuss its relation with the classical ergodic flow. Next, we prove some ergodic theorems of the GIF. Finally, we give a theorem about the structure of the set of all GIFs.

math.DS↗

Multiscale method, Central extensions and a generalized Craik-Leibovich equation

In this paper we develop perturbation theory on the reduced space of a principal $G-$bundle. This theory uses a multiscale method and is related to vibrodynamics. For a fast oscillating motion with the symmetry Lie group $G$, we prove that the averaged equation (i.e. the equation describing the slow motion) is the Euler equation on the dual of a certain central extension of the corresponding Lie algebra $\mathfrak g$. As an application of this theory we study the Craik--Leibovich (CL) equation in hydrodynamics. We show that CL equation can be regarded as the Euler equation on the dual of an appropriate central extension of the Lie algebra of divergence-free vector fields. From this geometric point of view, one can give a generalization of CL equation on any Riemannian manifold with boundary. For accuracy of the averaged equation, we prove that the difference between the solution of the averaged equation and the solution of the perturbed equation remains small (of order $ε$) over a very long time interval (of order $1/{ε^2}$). Combining the geometric structure of the generalized CL equation and the averaging theorem, we present a large class of adiabatic invariants for the perturbation model of the Langmuir circulation in the ocean.

math-ph↗

First-principles study of electronic structure, optical and phonon properties of α-ZrW2O8

ZrW2O8 exhibits isotropic negative thermal expansions over its entire temperature range of stability, yet so far its physical properties and mechanism have not been fully addressed. In this article, the electronic structure, elastic, thermal, optical and phonon properties of α-ZrW2O8 are systematically investigated from first principles. The agreements between the generalized gradient approximation (GGA) calculation and experiments are found to be quite satisfactory. The calculation results can be useful in relevant material designs, e.g., when ZrW2O8 is employed to adjust the thermal expansion coefficient of ceramic matrix composites.

cond-mat.mtrl-sci↗

Equilibrium sampling by re-weighting non-equilibrium simulation trajectories

With the traditional equilibrium molecular simulations, it is usually difficult to efficiently visit the whole conformational space in complex systems, which are separated into some metastable conformational regions by high free energy barriers. The applied non-equilibrium process in simulations could enhance the transitions among these conformational regions, and the associated non-equilibrium effects can be removed by employing the Jarzynski equality (JE), then the global equilibrium distribution can be reproduced. However, the original JE requires the initial distribution of the non-equilibrium process is equilibrium, which largely limits the application of the non-equilibrium method in equilibrium sampling. By extending the previous method, the reweighted ensemble dynamics (RED), which re-weights many equilibrium simulation trajectories from arbitrary initial distribution to reproduce the global equilibrium, to non-equilibrium simulations, we present a method, named as re-weighted non-equilibrium ensemble dynamics (RNED), to generalize the JE in the non-equilibrium trajectories started from an arbitrary initial distribution, thus provide an efficient method to reproduce the equilibrium distribution based on multiple independent (short) non-equilibrium trajectories. We have illustrated the validity of the RNED in a one-dimensional toy model and in a Lennard-Jones system to detect the liquid-solid phase coexistence.

cond-mat.soft↗

Jarzynski matrix equality: calculating free energy difference by non-equilibrium simulations with an arbitrary initial distribution

The Jarzynski equality (JE), which relates works of non-equilibrium trajectories to the free energy difference of the initial and final states of the non-equilibrium process, provides an efficient way to calculate free energies of systems in simulations and experiments. However, wider applications of the JE are limited by the requirement that the initial distribution of non-equilibrium trajectories must be equilibrium. Here we extend the JE to a matrix form, the Jarzynski matrix equality (JME), which transforms the free energies of metastable conformational regions in the initial system to that of final one. Therefore, we can calculate the free energies from non-equilibrium trajectories which started from an arbitrary initial distribution. We demonstrate the application of the JME in toy models, Lennard-Jones fluids, and polymer chain models, show its good efficiency in calculation of free energy with a satisfactory accuracy. The JME extends applications of the non-equilibrium method in estimate of free energy in complex system where the initial global equilibrium is difficult to reach.

cond-mat.soft↗

Giant negative thermal expansion covering room temperature in nanocrystalline GaNxMn3

Materials with negative thermal expansion (NTE), which contract upon heating, are of great interest both technically and fundamentally. Here, we report giant NTE covering room temperature in mechanically milled antiperovksite GaNxMn3 compounds. The micrograin GaNxMn3 exhibits a large volume contraction at the antiferromagnetic (AFM) to paramagnetic (PM) (AFM-PM) transition within a temperature window (ΔT) of only a few kelvins. The grain size reduces to ~ 30 nm after slight milling, while ΔT is broadened to 50K. The corresponding coefficient of linear thermal expansion (α) reaches ~ -70 ppm/K, which is almost two times larger than those obtained in chemically doped antiperovskite compounds. Further reducing grain size to ~ 10 nm, ΔT exceeds 100 K and α remains as large as -30 ppm/K (-21 ppm/K) for x = 1.0 (x = 0.9). Excess atomic displacements together with the reduced structural coherence, revealed by high-energy X-ray pair distribution functions, are suggested to delay the AFM-PM transition. By controlling the grain size via mechanically alloying or grinding, giant NTE may also be achievable in other materials with large lattice contraction due to electronic or magnetic phase transitions.

cond-mat.mtrl-sci↗