Xiang Jiang - University of Cambridge

Xiang Jiang
Are you Xiang Jiang?

Claim your profile, edit publications, add additional information:

Contact Details

Name
Xiang Jiang
Affiliation
University of Cambridge
Country
United Kingdom

Pubs By Year

Pub Categories

 
Computer Science - Computer Science and Game Theory (2)
 
Computer Science - Computer Vision and Pattern Recognition (2)
 
Physics - Mesoscopic Systems and Quantum Hall Effect (1)
 
Computer Science - Computational Complexity (1)
 
Computer Science - Learning (1)
 
Computer Science - Artificial Intelligence (1)

Publications Authored By Xiang Jiang

Understanding and discovering knowledge from GPS (Global Positioning System) traces of human activities is an essential topic in mobility-based urban computing. We propose TrajectoryNet-a neural network architecture for point-based trajectory classification to infer real world human transportation modes from GPS traces. To overcome the challenge of capturing the underlying latent factors in the low-dimensional and heterogeneous feature space imposed by GPS data, we develop a novel representation that embeds the original feature space into another space that can be understood as a form of basis expansion. Read More

Identifying user's identity is a key problem in many data mining applications, such as product recommendation, customized content delivery and criminal identification. Given a set of accounts from the same or different social network platforms, user identification attempts to identify all accounts belonging to the same person. A commonly used solution is to build the relationship among different accounts by exploring their collective patterns, e. Read More

Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for finding Nash equilibria is proposed. The algorithm is fixed-parameter tractable with the size of the largest irreducible component of a game as parameter. An implementation of the algorithm is shown to yield a significant performance increase on inputs with small parameters. Read More

Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for finding Nash equilibria is proposed. The algorithm is fixed-parameter tractable with the size of the largest irreducible component of a game as parameter. An implementation of the algorithm is shown to yield a significant performance increase on inputs with small parameters. Read More

We present a new empirical pseudopotential (EPM) calculation approach to simulate the million atom nanostructured semiconductor devices under potential bias using the periodic boundary conditions. To treat the non-equilibrium condition, instead of directly calculating the scattering states from the source and drain, we calculate the stationary states by the linear combination of bulk band method and then decompose the stationary wave function into source and drain injecting scattering states according to an approximated top of the barrier splitting (TBS) scheme based on physical insight of ballistic and tunneling transport. The decomposed electronic scattering states are then occupied according to the source/drain Fermi-Levels to yield the occupied electron density which is then used to solve the potential, forming a self-consistent loop. Read More