Searcharxiv⌕ Search

arXiv subjects

Bo Chen

Publications and source records attributed to Bo Chen.

At least 433 records · Page 24Linked to original sources
arXiv2014

Towards an optimal decision strategy of visual search

Searching for objects amongst clutter is a key ability of visual systems. Speed and accuracy are often crucial: how can the visual system trade off these competing quantities for optimal performance in different tasks? How does the trade-off depend on target appearance and scene complexity? We show that the optimal tradeoff strategy may be cast as the solution to a partially observable Markov decision process (POMDP) and computed by a dynamic programming procedure. However, this procedure is computationally intensive when the visual scene becomes too cluttered. Therefore, we also conjecture an optimal strategy that scales to large number of clutters. Our conjecture applies to homogeneous visual search and for a special case of heterogenous search where the signal-to-noise ratio differs across location. Using the conjecture we show that two existing decision mechanisms for analyzing human data, namely diffusion-to-bound and maximum-of-output, are sub-optimal; the optimal strategy instead employs two scaled diffusions.

q-bio.NC↗
arXiv2014

Quantum correlations in bulk properties of solids obtained from neutron scattering

We demonstrate that inelastic neutron scattering technique can be used to indirectly detect and measure the macroscopic quantum correlations quantified by both entanglement and discord in a quantum magnetic material, VODPO4 . 1D2O. The amount of quantum correlations is obtained 2 by analyzing the neutron scattering data of magnetic excitations in isolated V4+ spin dimers. Our quantitative analysis shows that the critical temperature of this material can reach as high as Tc = 82.5 K, where quantum entanglement drops to zero. Significantly, quantum discord can even survive at Tc = 300 K and may be used in room temperature quantum devices. Taking into account the spin-orbit (SO) coupling, we also predict theoretically that entanglement can be significantly enhanced and the critical temperature Tc increases with the strength of spin-orbit coupling.

quant-ph↗
arXiv2014

Learning Fine-grained Image Similarity with Deep Ranking

Learning fine-grained image similarity is a challenging task. It needs to capture between-class and within-class image differences. This paper proposes a deep ranking model that employs deep learning techniques to learn similarity metric directly from images.It has higher learning capability than models based on hand-crafted features. A novel multiscale network structure has been developed to describe the images effectively. An efficient triplet sampling algorithm is proposed to learn the model with distributed asynchronized stochastic gradient. Extensive experiments show that the proposed algorithm outperforms models based on hand-crafted visual features and deep classification models.

cs.CV↗
arXiv2014

Tactical Fixed Job Scheduling with Spread-Time Constraints

We address the tactical fixed job scheduling problem with spread-time constraints. In such a problem, there are a fixed number of classes of machines and a fixed number of groups of jobs. Jobs of the same group can only be processed by machines of a given set of classes. All jobs have their fixed start and end times. Each machine is associated with a cost according to its machine class. Machines have spread-time constraints, with which each machine is only available for $L$ consecutive time units from the start time of the earliest job assigned to it. The objective is to minimize the total cost of the machines used to process all the jobs. For this strongly NP-hard problem, we develop a branch-and-price algorithm, which solves instances with up to $300$ jobs, as compared with CPLEX, which cannot solve instances of $100$ jobs. We further investigate the influence of machine flexibility by computational experiments. Our results show that limited machine flexibility is sufficient in most situations.

cs.DS↗
arXiv2013

Strong Stability of Nash Equilibria in Load Balancing Games

We study strong stability of Nash equilibria in load balancing games of m (m >= 2) identical servers, in which every job chooses one of the m servers and each job wishes to minimize its cost, given by the workload of the server it chooses. A Nash equilibrium (NE) is a strategy profile that is resilient to unilateral deviations. Finding an NE in such a game is simple. However, an NE assignment is not stable against coordinated deviations of several jobs, while a strong Nash equilibrium (SNE) is. We study how well an NE approximates an SNE. Given any job assignment in a load balancing game, the improvement ratio (IR) of a deviation of a job is defined as the ratio between the pre- and post-deviation costs. An NE is said to be a r-approximate SNE (r >= 1) if there is no coalition of jobs such that each job of the coalition will have an IR more than r from coordinated deviations of the coalition. While it is already known that NEs are the same as SNEs in the 2-server load balancing game, we prove that, in the m-server load balancing game for any given m >= 3, any NE is a (5/4)-approximate SNE, which together with the lower bound already established in the literature yields a tight approximation bound. This closes the final gap in the literature on the study of approximation of general NEs to SNEs in load balancing games. To establish our upper bound, we make a novel use of a graph-theoretic tool.

cs.GT↗
arXiv2013

Price of Anarchy for Non-atomic Congestion Games with Stochastic Demands

We generalize the notions of user equilibrium and system optimum to non-atomic congestion games with stochastic demands. We establish upper bounds on the price of anarchy for three different settings of link cost functions and demand distributions, namely, (a) affine cost functions and general distributions, (b) polynomial cost functions and general positive-valued distributions, and (c) polynomial cost functions and the normal distributions. All the upper bounds are tight in some special cases, including the case of deterministic demands.

cs.GT↗
arXiv2012

Restricted exchangeable partitions and embedding of associated hierarchies in continuum random trees

We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In particular, we deduce from the general theory developed here a limit result conjectured previously for Ford's alpha model and its extension, the alpha-gamma model, where restricted exchangeability arises naturally.

math.PR↗
arXiv2012

Dimension vectors in regular components over wild Kronecker quivers

Let $\mathcal{K}_n$ be the so-called wild Kronecker quiver, i.e., a quiver with one source and one sink and $n\geq 3$ arrows from the source to the sink. The following problems will be studied for an arbitrary regular component $\mathcal{C}$ of the Auslander-Reiten quiver: (1) What is the relationship between dimension vectors and quasi-lengths of the indecomposable regular representations in $\mathcal{C}$? (2) For a given natural number $d$, is there an upper bound of the number of indecomposable representations in $\mathcal{C}$ with the same length $d$? (3) When do the sets of the dimension vectors of indecomposable representations in different regular components coincide?

math.RT↗
arXiv2012

Joint Optimization and Variable Selection of High-dimensional Gaussian Processes

Maximizing high-dimensional, non-convex functions through noisy observations is a notoriously hard problem, but one that arises in many applications. In this paper, we tackle this challenge by modeling the unknown function as a sample from a high-dimensional Gaussian process (GP) distribution. Assuming that the unknown function only depends on few relevant variables, we show that it is possible to perform joint variable selection and GP optimization. We provide strong performance guarantees for our algorithm, bounding the sample complexity of variable selection, and as well as providing cumulative regret bounds. We further provide empirical evidence on the effectiveness of our algorithm on several benchmark optimization problems.

cs.LG↗
arXiv2010

The Gabriel-Roiter measures and representation type

Let $Λ$ be an Artin algebra. A GR segment of $Λ$ is a sequence of GR measures which is closed under direct successors and direct predecessors. The number of the GR segments was conjectured to relate to the representation type of $Λ$. In this paper, let $k$ be an algebraically closed field and $Λ$ be a finite-dimensional hereditary $k$-algebra. We show that $Λ$ admits infinitely many GR segments if and only if $Λ$ is of wild representation type. Thus the finiteness of the number of the GR segments might be an alternative characterization of the tameness of finite dimensional algebras over algebraically closed fields. Therefore, this might give a possibility to generalize Drozd's tameness and wildness to arbitrary Artin algebras.

math.RT↗
arXiv2010

The number of the Gabriel-Roiter measures admitting no direct predecessors over a wild quiver

A famous result by Drozd says that a finite-dimensional representation-infinite algebra is of either tame or wild representation type. But one has to make assumption on the ground field. The Gabriel-Roiter measure might be an alternative approach to extend these concepts of tame and wild to arbitrary artin algebras. In particular, the infiniteness of the number of GR segments, i.e. sequences of Gabriel-Roiter measures which are closed under direct predecessors and successors, might relate to the wildness of artin algebras. As the first step, we are going to study the wild quiver with three vertices, labeled by $1$,$2$ and $3$, and one arrow from $1$ to $2$ and two arrows from $2$ to $3$. The Gabriel-Roiter submodules of the indecomposable preprojective modules and quasi-simple modules $τ^{-i}M$, $i\geq 0$ are described, where $M$ is a Kronecker module and $τ=DTr$ is the Auslander-Reiten translation. Based on these calculations, the existence of infinitely many GR segments will be shown. Moreover, it will be proved that there are infinitely many Gabriel-Roiter measures admitting no direct predecessors.

math.RT↗
arXiv2010

The Gabriel-Roiter measure for $\widetilde{\mathbb{A}}_n$ II

Let $Q$ be a tame quiver of type $\widetilde{\mathbb{A}}_n$ and $\Rep(Q)$ the category of finite dimensional representations over an algebraically closed field. A representation is simply called a module. It will be shown that a regular string module has, up to isomorphism, at most two Gabriel-Roiter submodules. The quivers $Q$ with sink-source orientations will be characterized as those, whose central parts do not contain preinjective modules. It will also be shown that there are only finitely many (central) Gabriel-Roiter measures admitting no direct predecessors. This fact will be generalized for all tame quivers.

math.RT↗
arXiv2010

The Gabriel-Roiter measures of the indecomposables in a regular component of the 3-Kronecker quiver

Let $Q$ be the 3-Kronecker quiver, i.e., $Q$ has two vertices, labeled by 1 and 2, and three arrows from 2 to 1. Fix an algebraically closed field $k$. Let $\mathcal{C}$ be a regular component of the Auslander-Reiten quiver containing an indecomposable module $X$ with dimension $(1,1)$ or $(2,1)$. Using the properties of the Fibonacci numbers, we show that the Gabriel-Roiter measures of the indecomposable modules in $\mathcal{C}$ are uniquely determined by the dimension vectors. In other words, two indecomposable modules in $\mathcal{C}$ are not isomorphic if and only if their Gabriel-Roiter measures are different.

math.RT↗
arXiv2010

Regular modules with preprojective Gabriel-Roiter submodules over $n$-Kronecker quivers

Let $Q$ be a wild $n$-Kronecker quiver, i.e., a quiver with two vertices, labeled by 1 and 2, and $n\geq 3$ arrows from 2 to 1. The indecomposable regular modules with preprojective Gabriel-Roiter submodules, in particular, those $τ^{-i}X$ with $\udim X=(1,c)$ for $i\geq 0$ and some $1\leq c\leq n-1$ will be studied. It will be shown that for each $i\geq 0$ the irreducible monomorphisms starting with $τ^{-i}X$ give rise to a sequence of Gabriel-Roiter inclusions, and moreover, the Gabriel-Roiter measures of those produce a sequence of direct successors. In particular, there are infinitely many GR-segments, i.e., a sequence of Gabriel-Roiter measures closed under direct successors and predecessors. The case $n=3$ will be studied in detail with the help of Fibonacci numbers. It will be proved that for a regular component containing some indecomposable module with dimension vector $(1,1)$ or $(1,2)$, the Gabriel-Roiter measures of the indecomposable modules are uniquely determined by their dimension vectors.

math.RT↗
arXiv2010

The GR-segments for tame quivers

A GR-segment for an artin algebra is a sequence of Gabriel-Roiter measures, which is closed under direct predecessors and successors. The number of the GR-segments indexed by natural numbers $\mathbb{N}$ and integers $\mathbb{Z}$ probably relates to the representation types of artin algebras. Let $k$ be an algebraically closed field and $Q$ be a tame quiver (of type $\widetilde{\mathbb{A}}_n$, $\widetilde{\mathbb{D}}_n$, $\widetilde{\mathbb{E}}_6$, $\widetilde{\mathbb{E}}_7$, or $\widetilde{\mathbb{E}}_8$). Let $b$ be the number of the isomorphism classes of the exceptional quasi-simple modules over the path algebra $Λ=kQ$. We show that the number of the $\mathbb{N}$- and $\mathbb{Z}$-indexed GR-segments in the central part for $Q$ is bounded by $b+1$. Therefore, there are at most $b+3$ GR segments.

math.RT↗
arXiv2009

Group-Theoretic Partial Matrix Multiplication

A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve upper bounds on the exponent of matrix multiplication yielded by group-theoretic full matrix multiplication. The group theory behind our partial matrix multiplication algorithms leads to the problem of maximizing a quantity representing the "fullness" of a given partial matrix pattern. This problem is shown to be NP-hard, and two algorithms, one optimal and another non-optimal but polynomial-time, are given for solving it.

cs.CC↗
arXiv2008

A new family of Markov branching trees: the alpha-gamma model

We introduce a simple tree growth process that gives rise to a new two-parameter family of discrete fragmentation trees that extends Ford's alpha model to multifurcating trees and includes the trees obtained by uniform sampling from Duquesne and Le Gall's stable continuum random tree. We call these new trees the alpha-gamma trees. In this paper, we obtain their splitting rules, dislocation measures both in ranked order and in sized-biased order, and we study their limiting behaviour.

math.PR↗