Accountable Care Organizations and Transaction Cost Economics

Using a Transaction Cost Economics (TCE) approach, this paper explores which organizational forms Accountable Care Organizations (ACOs) may take. A critical question about form is the amount of vertical integration that an ACO may have, a topic central to TCE. We posit that contextual factors outside and inside an ACO will produce variable transaction costs (the non-production costs of care) such that the decision to integrate vertically will derive from a comparison of these external versus internal costs, assuming reasonably rational management abilities. External costs include those arising from environmental uncertainty and complexity, small numbers bargaining, asset specificity, frequency of exchanges, and information impactedness. Internal costs include those arising from human resource activities including hiring and staffing, training, evaluating (i.e., disciplining, appraising, or promoting), and otherwise administering programs. At the extreme, these different costs may produce either total vertical integration or little to no vertical integration with most ACOs falling in between. This essay demonstrates how TCE can be applied to the ACO organization form issue, explains TCE, considers ACO activity from the TCE perspective, and reflects on research directions that may inform TCE and facilitate ACO development

A new construction for a QMA complete 3-local Hamiltonian

We present a new way of encoding a quantum computation into a 3-local Hamiltonian. Our construction is novel in that it does not include any terms that induce legal-illegal clock transitions. Therefore, the weights of the terms in the Hamiltonian do not scale with the size of the problem as in previous constructions. This improves the construction by Kempe and Regev, who were the first to prove that 3-local Hamiltonian is complete for the complexity class QMA, the quantum analogue of NP. Quantum k-SAT, a restricted version of the local Hamiltonian problem using only projector terms, was introduced by Bravyi as an analogue of the classical k-SAT problem. Bravyi proved that quantum 4-SAT is complete for the class QMA with one-sided error (QMA_1) and that quantum 2-SAT is in P. We give an encoding of a quantum circuit into a quantum 4-SAT Hamiltonian using only 3-local terms. As an intermediate step to this 3-local construction, we show that quantum 3-SAT for particles with dimensions 3x2x2 (a qutrit and two qubits) is QMA_1 complete. The complexity of quantum 3-SAT with qubits remains an open question.Comment: 11 pages, 4 figure

From Solar and Stellar Flares to Coronal Heating: Theory and Observations of How Magnetic Reconnection Regulates Coronal Conditions

There is currently no explanation of why the corona has the temperature and density it has. We present a model which explains how the dynamics of magnetic reconnection regulates the conditions in the corona. A bifurcation in magnetic reconnection at a critical state enforces an upper bound on the coronal temperature for a given density. We present observational evidence from 107 flares in 37 sun-like stars that stellar coronae are near this critical state. The model may be important to self-organized criticality models of the solar corona.Comment: 13 pages, 2 figures, accepted to Ap. J. Lett., February 200

Transition from ion-coupled to electron-only reconnection: Basic physics and implications for plasma turbulence

Using kinetic particle-in-cell (PIC) simulations, we simulate reconnection conditions appropriate for the magnetosheath and solar wind, i.e., plasma beta (ratio of gas pressure to magnetic pressure) greater than 1 and low magnetic shear (strong guide field). Changing the simulation domain size, we find that the ion response varies greatly. For reconnecting regions with scales comparable to the ion Larmor radius, the ions do not respond to the reconnection dynamics leading to ''electron-only'' reconnection with very large quasi-steady reconnection rates. The transition to more traditional ''ion-coupled'' reconnection is gradual as the reconnection domain size increases, with the ions becoming frozen-in in the exhaust when the magnetic island width in the normal direction reaches many ion inertial lengths. During this transition, the quasi-steady reconnection rate decreases until the ions are fully coupled, ultimately reaching an asymptotic value. The scaling of the ion outflow velocity with exhaust width during this electron-only to ion-coupled transition is found to be consistent with a theoretical model of a newly reconnected field line. In order to have a fully frozen-in ion exhaust with ion flows comparable to the reconnection Alfv\'en speed, an exhaust width of at least several ion inertial lengths is needed. In turbulent systems with reconnection occurring between magnetic bubbles associated with fluctuations, using geometric arguments we estimate that fully ion-coupled reconnection requires magnetic bubble length scales of at least several tens of ion inertial lengths

Super-Alfv\'enic propagation of reconnection signatures and Poynting flux during substorms

The propagation of reconnection signatures and their associated energy are examined using kinetic particle-in-cell simulations and Cluster satellite observations. It is found that the quadrupolar out-of-plane magnetic field near the separatrices is associated with a kinetic Alfv\'en wave. For magnetotail parameters, the parallel propagation of this wave is super-Alfv\'enic (V_parallel ~ 1500 - 5500 km/s) and generates substantial Poynting flux (S ~ 10^-5 - 10^-4 W/m^2) consistent with Cluster observations of magnetic reconnection. This Poynting flux substantially exceeds that due to frozen-in ion bulk outflows and is sufficient to generate white light aurora in the Earth's ionosphere.Comment: Submitted to PRL on 11/1/2010. Resubmitted on 4/5/201

Reduction of Ion Heating During Magnetic Reconnection by Large-Scale Effective Potentials

The physical processes that control the partition of released magnetic energy between electrons and ions during reconnection is explored through particle-in-cell simulations and analytical techniques. We demonstrate that the development of a large-scale parallel electric field and its associated potential controls the relative heating of electrons and ions. The potential develops to restrain heated exhaust electrons and enhances their heating by confining electrons in the region where magnetic energy is released. Simultaneously the potential slows ions entering the exhaust below the Alfv\'enic speed expected from the traditional counterstreaming picture of ion heating. Unexpectedly, the magnitude of the potential and therefore the relative partition of energy between electrons and ions is not a constant but rather depends on the upstream parameters and specifically the upstream electron normalized temperature (electron beta). These findings suggest that the fraction of magnetic energy converted into the total thermal energy may be independent of upstream parameters

An O(n^3)-Time Algorithm for Tree Edit Distance

The {\em edit distance} between two ordered trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this paper, we present a worst-case $O(n^3)$-time algorithm for this problem, improving the previous best $O(n^3\log n)$-time algorithm~\cite{Klein}. Our result requires a novel adaptive strategy for deciding how a dynamic program divides into subproblems (which is interesting in its own right), together with a deeper understanding of the previous algorithms for the problem. We also prove the optimality of our algorithm among the family of \emph{decomposition strategy} algorithms--which also includes the previous fastest algorithms--by tightening the known lower bound of $\Omega(n^2\log^2 n)$~\cite{Touzet} to $\Omega(n^3)$, matching our algorithm's running time. Furthermore, we obtain matching upper and lower bounds of $\Theta(n m^2 (1 + \log \frac{n}{m}))$ when the two trees have different sizes $m$ and~$n$, where $m < n$.Comment: 10 pages, 5 figures, 5 .tex files where TED.tex is the main on

Two-scale structure of the electron dissipation region during collisionless magnetic reconnection

Particle in cell (PIC) simulations of collisionless magnetic reconnection are presented that demonstrate that the electron dissipation region develops a distinct two-scale structure along the outflow direction. The length of the electron current layer is found to decrease with decreasing electron mass, approaching the ion inertial length for a proton-electron plasma. A surprise, however, is that the electrons form a high-velocity outflow jet that remains decoupled from the magnetic field and extends large distances downstream from the x-line. The rate of reconnection remains fast in very large systems, independent of boundary conditions and the mass of electrons.Comment: Submitted to Physical Review Letters, 4 pages, 4 figure

The 2(2S+1)- Formalism and Its Connection with Other Descriptions

In the framework of the Joos-Weinberg 2(2S+1)- theory for massless particles, the dynamical invariants have been derived from the Lagrangian density which is considered to be a 4- vector. A la Majorana interpretation of the 6- component "spinors", the field operators of S=1 particles, as the left- and right-circularly polarized radiation, leads us to the conserved quantities which are analogous to those obtained by Lipkin and Sudbery. The scalar Lagrangian of the Joos-Weinberg theory is shown to be equivalent to the Lagrangian of a free massless field, introduced by Hayashi. As a consequence of a new "gauge" invariance this skew-symmetric field describes physical particles with the longitudinal components only. The interaction of the spinor field with the Weinberg's 2(2S+1)- component massless field is considered. New interpretation of the Weinberg field function is proposed. KEYWORDS: quantum electrodynamics, Lorentz group representation, high-spin particles, bivector, electromagnetic field potential. PACS: 03.50.De, 11.10.Ef, 11.10.Qr, 11.17+y, 11.30.CpComment: 13pp., merged hep-th/9305141 and hep-th/9306108 with revisions. Accepted in "Int. J. Geom. Meth. Phys.

ReCrash: Making Crashes Reproducible

It is difficult to fix a problem without being able to reproduce it.However, reproducing a problem is often difficult and time-consuming.This paper proposes a novel algorithm, ReCrash, that generatesmultiple unit tests that reproduce a given program crash.ReCrash dynamically tracks method calls during every execution of the target program. If the program crashes, ReCrash saves information about the relevant method calls and uses the saved information to create unit tests reproducing the crash.We present reCrashJ an implementation of ReCrash for Java. reCrashJ reproducedreal crashes from javac, SVNKit, Eclipse JDT, and BST. reCrashJ is efficient, incurring 13%-64% performance overhead. If this overhead is unacceptable, then reCrashJ has another mode that has negligible overhead until a crash occurs and 0%-1.7% overhead until a second crash, at which point the test cases are generated