Entanglement Cost of Antisymmetric States and Additivity of Capacity of Some Quantum Channel

We study the entanglement cost of the states in the contragredient space, which consists of $(d-1)$ $d$-dimensional systems. The cost is always $\log_2 (d-1)$ ebits when the state is divided into bipartite \C^d \otimes (\C^d)^{d-2}. Combined with the arguments in \cite{Matsumoto02}, additivity of channel capacity of some quantum channels is also shown.Comment: revtex 4 pages, no figures, small changes in title and author's affiliation and some typo are correcte

Approximate Bayesian Image Interpretation using Generative Probabilistic Graphics Programs

The idea of computer vision as the Bayesian inverse problem to computer graphics has a long history and an appealing elegance, but it has proved difficult to directly implement. Instead, most vision tasks are approached via complex bottom-up processing pipelines. Here we show that it is possible to write short, simple probabilistic graphics programs that define flexible generative models and to automatically invert them to interpret real-world images. Generative probabilistic graphics programs consist of a stochastic scene generator, a renderer based on graphics software, a stochastic likelihood model linking the renderer's output and the data, and latent variables that adjust the fidelity of the renderer and the tolerance of the likelihood model. Representations and algorithms from computer graphics, originally designed to produce high-quality images, are instead used as the deterministic backbone for highly approximate and stochastic generative models. This formulation combines probabilistic programming, computer graphics, and approximate Bayesian computation, and depends only on general-purpose, automatic inference techniques. We describe two applications: reading sequences of degraded and adversarially obscured alphanumeric characters, and inferring 3D road models from vehicle-mounted camera images. Each of the probabilistic graphics programs we present relies on under 20 lines of probabilistic code, and supports accurate, approximately Bayesian inferences about ambiguous real-world images.Comment: The first two authors contributed equally to this wor

Resolvent Splitting for Sums of Monotone Operators with Minimal Lifting

In this work, we study fixed point algorithms for finding a zero in the sum of $n\geq 2$ maximally monotone operators by using their resolvents. More precisely, we consider the class of such algorithms where each resolvent is evaluated only once per iteration. For any algorithm from this class, we show that the underlying fixed point operator is necessarily defined on a $d$-fold Cartesian product space with $d\geq n-1$. Further, we show that this bound is unimprovable by providing a family of examples for which $d=n-1$ is attained. This family includes the Douglas-Rachford algorithm as the special case when $n=2$. Applications of the new family of algorithms in distributed decentralised optimisation and multi-block extensions of the alternation direction method of multipliers (ADMM) are discussed.Comment: 23 page

Fundamental Cycle of a Periodic Box-Ball System

We investigate a soliton cellular automaton (Box-Ball system) with periodic boundary conditions. Since the cellular automaton is a deterministic dynamical system that takes only a finite number of states, it will exhibit periodic motion. We determine its fundamental cycle for a given initial state.Comment: 28 pages, 6 figure

The Influence of Bid-ask Spread and Leverage on Earnings Management with Good Corporate Governance as Moderating Variable

This research was intended for obtaining an empirical evidence regarding good corporate governance to moderate the influence of bid-ask spread and leverage on earnings management. Earnings management was measured by the three proxies of real earnings management. It was included cash flow operation, production cost, and discretionary expenses. Bid-ask spread was measured by ask and bid price of the company\u27s shares in given period. Leverage was measured by the ratio of total debt and assets. A good corporate governance was measured by score Corporate Governance Perception Index (CGPI). The research population was a company listed on the Indonesia Stock Exchange in 2008-2015. The sampling method is used a purposive sampling. The samples analyzed was 56 samples. An analytical technique is used Moderated Regression Analysis (MRA). The result showed that a good corporate governance did not moderate the influence of bid-ask spread on earnings management. However, a good corporate governance weakens the influence of leverage on earnings management

On a Periodic Soliton Cellular Automaton

We propose a box and ball system with a periodic boundary condition (pBBS). The time evolution rule of the pBBS is represented as a Boolean recurrence formula, an inverse ultradiscretization of which is shown to be equivalent with the algorithm of the calculus for the 2Nth root. The relations to the pBBS of the combinatorial R matrix of ${U'}_q(A_N^{(1)})$ are also discussed.Comment: 17 pages, 5 figure

Correlation function for a periodic box-ball system

We investigate correlation functions in a periodic box-ball system. For the two point functions of short distance, we give explicit formulae obtained by combinatorial methods. We give expressions for general N-point functions in terms of ultradiscrete theta functions.Comment: 13 pages, 2 figures, submitted to J. Phys. A: Math. Theo

Distributed Forward-Backward Methods for Ring Networks

In this work, we propose and analyse forward-backward-type algorithms for finding a zero of the sum of finitely many monotone operators, which are not based on reduction to a two operator inclusion in the product space. Each iteration of the studied algorithms requires one resolvent evaluation per set-valued operator, one forward evaluation per cocoercive operator, and two forward evaluations per monotone operator. Unlike existing methods, the structure of the proposed algorithms are suitable for distributed, decentralised implementation in ring networks without needing global summation to enforce consensus between nodes.Comment: 19 page