Search arXiv⌕ Search

arXiv subjects

Yi Shen

Publications and source records attributed to Yi Shen.

At least 127 records · Page 7Linked to original sources

Coordinating Large-Scale Robot Networks with Motion and Communication Uncertainties for Logistics Applications

In this paper, we focus on the problem of task allocation, cooperative path planning and motion coordination of the large-scale system with thousands of robots, aiming for practical applications in robotic warehouses and automated logistics systems. Particularly, we solve the life-long planning problem and guarantee the coordination performance of large-scale robot network in the presence of robot motion uncertainties and communication failures. A hierarchical planning and coordination structure is presented. The environment is divided into several sectors and a dynamic traffic heat-map is generated to describe the current sector-level traffic flow. In task planning level, a greedy task allocation method is implemented to assign the current task to the nearest free robot and the sector-level path is generated by comprehensively considering the traveling distance, the traffic heat-value distribution and the current robot/communication failures. In motion coordination level, local cooperative A* algorithm is implemented in each sector to generate the collision-free road-level path of each robot in the sector and the rolling planning structure is introduced to solve problems caused by motion and communication uncertainties. The effectiveness and practical applicability of the proposed approach are validated by large-scale simulations with more than one thousand robots and real laboratory experiments.

cs.RO↗

Separability of Completely Symmetric States in Multipartite System

Symmetry plays an important role in the field of quantum mechanics. In this paper, we consider a subclass of symmetric quantum states in the multipartite system $N^{\otimes d}$, namely, the completely symmetric states, which are invariant under any index permutation. It was conjectured by L. Qian and D. Chu [arXiv:1810.03125 [quant-ph]] that the completely symmetric states are separable if and only if it is a convex combination of symmetric pure product states. In this paper, we proved that this conjecture is true for both bipartite and multipartite cases. And we proved the completely symmetric state $ρ$ is separable if its rank is at most $5$ or $N+1$. For the states of rank $6$ or $N+2$, they are separable if and only if their range contains a product vector. We apply our results to a few widely useful states in quantum information, such as symmetric states, edge states, extreme states, and nonnegative states. We also study the relation of CS states to Hankel and Toeplitz matrices.

quant-ph↗

A Noether theorem for random locations

We propose a unified framework for random locations exhibiting some probabilistic symmetries such as stationarity, self-similarity, etc. A theorem of Noether's type is proved, which gives rise to a conservation law describing the change of the density function of a random location as the interval of interest changes. We also discuss the boundary and near boundary behavior of the distributions of the random locations.

math.PR↗

Constructing $2\times2\times4$ and $4\times4$ unextendible product bases and positive-partial-transpose entangled states

The 4-qubit unextendible product basis (UPB) has been recently studied by [Johnston, J. Phys. A: Math. Theor. 47 (2014) 424034]. From this result we show that there is only one UPB of size $6$ and six UPBs of size $9$ in $\cH=\bbC^2\ox\bbC^2\ox\bbC^4$, three UPBs of size $9$ in $\cK=\bbC^4\ox\bbC^4$, and no UPB of size $7$ in $\cH$ and $\cK$. Furthermore we construct a 4-qubit positive-partial-transpose (PPT) entangled state $\r$ of rank seven, and show that it is also a PPT entangled state in $\cH$ and $\cK$, respectively. We analytically derive the geometric measure of entanglement of a special $\r$.

quant-ph↗

Entangling power of two-qubit unitary operations

The entangling power of a bipartite unitary operation shows the maximum created entanglement with the product input states. For an arbitrary two-qubit unitary operation, it is sufficient to consider its normalized operation $U$ with parameters $c_0,c_1,c_2$ and $c_3$. We show how to compute the entangling power of $U$ when $c_2=c_3$. In particular we construct the analytical expressions of entangling power of such $U$ for two examples. We also construct the entangling power of bipartite unitary operations of Schmidt rank two for any dimensions.

quant-ph↗

Random Locations of Periodic Stationary Processes

We consider a family of random locations, called intrinsic location functionals, of periodic stationary processes. This family includes but is not limited to the location of the path supremum and first/last hitting times. We first show that the set of all possible distributions of intrinsic location functionals for periodic stationary processes is the convex hull generated by a specific group of distributions. We then focus on two special subclasses of these random locations. For the first subclass, the density has a uniform lower bound; for the second subclass, the possible distributions are closely related to the concept of joint mixability.

math.PR↗

Data Sustainability and Reuse Pathways of Natural Resources and Environmental Scientists

This paper presents a multifarious examination of natural resources and environmental scientists' adventures navigating the policy change towards open access and cultural shift in data management, sharing, and reuse. Situated in the institutional context of Virginia Tech, a focus group and multiple individual interviews were conducted exploring the domain scientists' all-around experiences, performances, and perspectives on their collection, adoption, integration, preservation, and management of data. The results reveal the scientists' struggles, concerns, and barriers encountered, as well as their shared values, beliefs, passions, and aspirations when working with data. Based on these findings, this study provides suggestions on data modeling and knowledge representation strategies to support the long-term viability, stewardship, accessibility, and sustainability of scientific data. It also discusses the art of curation as creative scholarship and new opportunities for data librarians and information professionals to mobilize the data revolution.

cs.DL↗

Burgeoning Data Repository Systems, Characteristics and Development Strategies: Insights of Natural Resources and Environmental Scientists

Nowadays, we have the emergence and abundance of many different data repositories and archival systems for scientific data discovery, use, and analysis. With the burgeoning data sharing platforms available, this study addresses how natural resources and environmental scientists navigate these diverse data sources, what their concerns and value propositions are towards multiple data discovery channels, and most importantly, how they perceive the characteristics and compare the functionalities of different types of data repository systems. Through a user community research of domain scientists on their data use dynamics and insights, this research provides strategies and discusses ideas on how to leverage these different platforms. Further, it proposes a top-down, novel approach to search, browsing, and visualization for dynamic exploration of environmental data.

cs.DL↗

Predicting the Popularity of Online Videos via Deep Neural Networks

Predicting the popularity of online videos is important for video streaming content providers. This is a challenging problem because of the following two reasons. First, the problem is both "wide" and "deep". That is, it not only depends on a wide range of features, but also be highly non-linear and complex. Second, multiple competitors may be involved. In this paper, we propose a general prediction model using the multi-task learning (MTL) module and the relation network (RN) module, where MTL can reduce over-fitting and RN can model the relations of multiple competitors. Experimental results show that our proposed approach significantly increases the accuracy on predicting the total view counts of TV series with RN and MTL modules.

cs.LG↗

On a matrix inequality related to the distillability problem

We investigate the distillability problem in quantum information in $\bbC^d\ox\bbC^d$. A special case of the problem has been reduced to proving a matrix inequality when $d=4$. We investigate the inequality for two families of non-normal matrices. We prove the inequality for the first family with $d=4$ and two special cases of the second family with $d\ge4$. We also prove the inequality for all normal matrices with $d>4$.

quant-ph↗

Towards a minimal order distributed observer for linear systems

In this paper we consider the distributed estimation problem for continuous-time linear time-invariant (LTI) systems. A single linear plant is observed by a network of local observers. Each local observer in the network has access to only part of the output of the observed system, but can also receive information on the state estimates of its neigbours. Each local observer should in this way generate an estimate of the plant state. In this paper we study the problem of existence of a reduced order distributed observer. We show that if the observed system is observable and the network graph is a strongly connected directed graph, then a distributed observer exists with state space dimension equal to $Nn - \sum_{i =1}^N p_i$, where $N$ is the number of network nodes, $n$ is the state space dimension of the observed plant, and $p_i$ is the rank of the output matrix of the observed output received by the $i$th local observer. In the case of a single observer, this result specializes to the well-known minimal order observer in classical observer design.

math.OC↗

A simple approach to distributed observer design for linear systems

This note investigates the distributed estimation problem for continuous-time linear time-invariant (LTI) systems observed by a network of observers. Each observer in the network has access to only part of the output of the observed system, and communicates with its neighbors according to a given network graph. In this note we recover the known result that if the observed system is observable and the network graph is a strongly connected digraph, then a distributed observer exists. Moreover, the estimation error can be made to converge to zero at any a priori given decay rate. Our approach leads to a relatively straightforward proof of this result, using the mirror of the balanced graph associated with the original network graph. The numerical design of our distributed observer is reduced to solving linear matrix inequalities (LMI's). Each observer in the network has state dimension equal to that of the observed plant.

math.OC↗

A Separability-Entanglement Classifier via Machine Learning

The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial transpose (PPT) criterion and the k-symmetric extendibility criterion to tackle this problem in practice, none of them enables a general, effective solution to the problem even for small dimensions. Explicitly, separable states form a high-dimensional convex set, which exhibits a vastly complicated structure. In this work, we build a new separability-entanglement classifier underpinned by machine learning techniques. Our method outperforms the existing methods in generic cases in terms of both speed and accuracy, opening up the avenues to explore quantum entanglement via the machine learning approach.

quant-ph↗

Stationarity as a Path Property with Applications in Time Series Analysis

Traditionally stationarity refers to shift invariance of the distribution of a stochastic process. In this paper, we rediscover stationarity as a path property instead of a distributional property. More precisely, we characterize a set of paths denoted as $A$, which corresponds to the notion of stationarity. On one hand, the set $A$ is shown to be large enough, so that for any stationary process, almost all of its paths are in $A$. On the other hand, we prove that any path in $A$ will behave in the optimal way under any stationarity test satisfying some mild conditions. The results provide a unified framework to understand and assess the existing time series tests for stationarity, and can potentially lead to new families of stationarity tests.

math.ST↗

The Devil is in the Tails: Regression Discontinuity Design with Measurement Error in the Assignment Variable

Identification in a regression discontinuity (RD) research design hinges on the discontinuity in the probability of treatment when a covariate (assignment variable) exceeds a known threshold. When the assignment variable is measured with error, however, the discontinuity in the relationship between the probability of treatment and the observed mismeasured assignment variable may disappear. Therefore, the presence of measurement error in the assignment variable poses a direct challenge to treatment effect identification. This paper provides sufficient conditions to identify the RD treatment effect using the mismeasured assignment variable, the treatment status and the outcome variable. We prove identification separately for discrete and continuous assignment variables and study the properties of various estimation procedures. We illustrate the proposed methods in an empirical application, where we estimate Medicaid takeup and its crowdout effect on private health insurance coverage.

stat.ME↗

Location of the Path Supremum for Self-similar Processes with Stationary Increments

In this paper we consider the distribution of the location of the path supremum in a fixed interval for self-similar processes with stationary increments. To this end, a point process is constructed and its relation to the distribution of the location of the path supremum is studied. Using this framework, we show that the distribution has a spectral-type representation, in the sense that it is always a mixture of a special group of absolutely continuous distributions, plus point masses on the two boundaries. Bounds on the value and the derivatives of the density function are established. We further discuss self-similar Lévy processes as an example. Most of the results in this paper can be generalized to a group of random locations, including the location of the largest jump, etc.

math.PR↗

Geometry of reduced density matrices for symmetry-protected topological phases

In this paper, we study the geometry of reduced density matrices for states with symmetry-protected topological (SPT) order. We observe ruled surface structures on the boundary of the convex set of low dimension projections of the reduced density matrices. In order to signal the SPT order using ruled surfaces, it is important that we add a symmetry-breaking term to the boundary of the system---no ruled surface emerges in systems without boundary or when we add a symmetry-breaking term representing a thermodynamic quantity. Although the ruled surfaces only appear in the thermodynamic limit where the ground-state degeneracy is exact, we analyze the precision of our numerical algorithm and show that a finite system calculation suffices to reveal the ruled surface structures.

quant-ph↗

Discontinuity of Maximum Entropy Inference and Quantum Phase Transitions

In this paper, we discuss the connection between two genuinely quantum phenomena --- the discontinuity of quantum maximum entropy inference and quantum phase transitions at zero temperature. It is shown that the discontinuity of the maximum entropy inference of local observable measurements signals the non-local type of transitions, where local density matrices of the ground state change smoothly at the transition point. We then propose to use the quantum conditional mutual information of the ground state as an indicator to detect the discontinuity and the non-local type of quantum phase transitions in the thermodynamic limit.

quant-ph↗