29,514 research outputs found
Geometric entanglement from matrix product state representations
An efficient scheme to compute the geometric entanglement per lattice site
for quantum many-body systems on a periodic finite-size chain is proposed in
the context of a tensor network algorithm based on the matrix product state
representations. It is systematically tested for three prototypical critical
quantum spin chains, which belong to the same Ising universality class. The
simulation results lend strong support to the previous claim [Q.-Q. Shi, R.
Or\'{u}s, J. O. Fj{\ae}restad, and H.-Q. Zhou, New J. Phys \textbf{12}, 025008
(2010); J.-M. St\'{e}phan, G. Misguich, and F. Alet, Phys. Rev. B \textbf{82},
180406R (2010)] that the leading finite-size correction to the geometric
entanglement per lattice site is universal, with its remarkable connection to
the celebrated Affleck-Ludwig boundary entropy corresponding to a conformally
invariant boundary condition.Comment: 4+ pages, 3 figure
Model Predictive Control for Smart Grids with Multiple Electric-Vehicle Charging Stations
Next-generation power grids will likely enable concurrent service for
residences and plug-in electric vehicles (PEVs). While the residence power
demand profile is known and thus can be considered inelastic, the PEVs' power
demand is only known after random PEVs' arrivals. PEV charging scheduling aims
at minimizing the potential impact of the massive integration of PEVs into
power grids to save service costs to customers while power control aims at
minimizing the cost of power generation subject to operating constraints and
meeting demand. The present paper develops a model predictive control (MPC)-
based approach to address the joint PEV charging scheduling and power control
to minimize both PEV charging cost and energy generation cost in meeting both
residence and PEV power demands. Unlike in related works, no assumptions are
made about the probability distribution of PEVs' arrivals, the known PEVs'
future demand, or the unlimited charging capacity of PEVs. The proposed
approach is shown to achieve a globally optimal solution. Numerical results for
IEEE benchmark power grids serving Tesla Model S PEVs show the merit of this
approach
Learning Points and Routes to Recommend Trajectories
The problem of recommending tours to travellers is an important and broadly
studied area. Suggested solutions include various approaches of
points-of-interest (POI) recommendation and route planning. We consider the
task of recommending a sequence of POIs, that simultaneously uses information
about POIs and routes. Our approach unifies the treatment of various sources of
information by representing them as features in machine learning algorithms,
enabling us to learn from past behaviour. Information about POIs are used to
learn a POI ranking model that accounts for the start and end points of tours.
Data about previous trajectories are used for learning transition patterns
between POIs that enable us to recommend probable routes. In addition, a
probabilistic model is proposed to combine the results of POI ranking and the
POI to POI transitions. We propose a new F score on pairs of POIs that
capture the order of visits. Empirical results show that our approach improves
on recent methods, and demonstrate that combining points and routes enables
better trajectory recommendations
On the Nature of X(4260)
We study the property of resonance by re-analyzing all experimental
data available, especially the cross section data. The final state
interactions of the , couple channel system are also taken
into account. A sizable coupling between the and is
found. The inclusion of the data indicates a small value of
eV.Comment: Refined analysis with new experimental data included. 13 page
Rank-One Matrix Completion with Automatic Rank Estimation via L1-Norm Regularization
Completing a matrix from a small subset of its entries, i.e., matrix completion is a challenging problem arising from many real-world applications, such as machine learning and computer vision. One popular approach to solve the matrix completion problem is based on low-rank decomposition/factorization. Low-rank matrix decomposition-based methods often require a prespecified rank, which is difficult to determine in practice. In this paper, we propose a novel low-rank decomposition-based matrix completion method with automatic rank estimation. Our method is based on rank-one approximation, where a matrix is represented as a weighted summation of a set of rank-one matrices. To automatically determine the rank of an incomplete matrix, we impose L1-norm regularization on the weight vector and simultaneously minimize the reconstruction error. After obtaining the rank, we further remove the L1-norm regularizer and refine recovery results. With a correctly estimated rank, we can obtain the optimal solution under certain conditions. Experimental results on both synthetic and real-world data demonstrate that the proposed method not only has good performance in rank estimation, but also achieves better recovery accuracy than competing methods
- …