Obstacles to Holding A Parole Official in Virginia Liable for the Negligent Release or Supervision of a Parolee

With the continuing problem of overcrowded prisons, parole board officials have been under increasing pressure to release prisoners before the natural termination of their sentences. As a consequence, the public suffers the risk that the parolee, once released, will commit a violent crime. If this should occur, the question then becomes whether the injured individual can, as a result, hold the parole board civilly liable for the negligent release or supervision of the parolee

Stepping Stones to Inductive Synthesis of Low-Level Looping Programs

Inductive program synthesis, from input/output examples, can provide an opportunity to automatically create programs from scratch without presupposing the algorithmic form of the solution. For induction of general programs with loops (as opposed to loop-free programs, or synthesis for domain-specific languages), the state of the art is at the level of introductory programming assignments. Most problems that require algorithmic subtlety, such as fast sorting, have remained out of reach without the benefit of significant problem-specific background knowledge. A key challenge is to identify cues that are available to guide search towards correct looping programs. We present MAKESPEARE, a simple delayed-acceptance hillclimbing method that synthesizes low-level looping programs from input/output examples. During search, delayed acceptance bypasses small gains to identify significantly-improved stepping stone programs that tend to generalize and enable further progress. The method performs well on a set of established benchmarks, and succeeds on the previously unsolved "Collatz Numbers" program synthesis problem. Additional benchmarks include the problem of rapidly sorting integer arrays, in which we observe the emergence of comb sort (a Shell sort variant that is empirically fast). MAKESPEARE has also synthesized a record-setting program on one of the puzzles from the TIS-100 assembly language programming game.Comment: AAAI 201

Yrast line for weakly interacting trapped bosons

We compute numerically the yrast line for harmonically trapped boson systems with a weak repulsive contact interaction, studying the transition to a vortex state as the angular momentum L increases and approaches N, the number of bosons. The L=N eigenstate is indeed dominated by particles with unit angular momentum, but the state has other significant components beyond the pure vortex configuration. There is a smooth crossover between low and high L with no indication of a quantum phase transition. Most strikingly, the energy and wave function appear to be analytical functions of L over the entire range 2 < L < N. We confirm the structure of low-L states proposed by Mottelson, as mainly single-particle excitations with two or three units of angular momentum.Comment: 9 pages, 3 EPS-figures, uses psfig.st

Area Decay Law Implementation for Quark String Fragmentation

We apply the Area Decay Law (ADL) straightforwardly to simulate a quark string hadronization and compare the results with the explicit analytic calculations. We show that the usual "inclusive" Monte--Carlo simulations do not correspond to the ADL because of two mistakes: not proper simulation of two--dimensional probability density and lack of an important combinatorial factor in a binary tree simulation. We also show how to simulate area decay law "inclusively" avoiding the above--mentioned mistakes.Comment: 5 pages (REVTEX) + 3 figures (available in ps format from G.G.Leptoukh , IPGAS-HE/93-3, to be published in Phys. Rev.

Effect of anisotropy on the ground-state magnetic ordering of the spin-one quantum J1XXZJ_{1}^{XXZ}--J2XXZJ_{2}^{XXZ} model on the square lattice

We study the zero-temperature phase diagram of the $J_{1}^{XXZ}$--$J_{2}^{XXZ}$ Heisenberg model for spin-1 particles on an infinite square lattice interacting via nearest-neighbour ($J_1 \equiv 1$) and next-nearest-neighbour ($J_2 > 0$) bonds. Both bonds have the same $XXZ$-type anisotropy in spin space. The effects on the quasiclassical N\'{e}el-ordered and collinear stripe-ordered states of varying the anisotropy parameter $\Delta$ is investigated using the coupled cluster method carried out to high orders. By contrast with the spin-1/2 case studied previously, we predict no intermediate disordered phase between the N\'{e}el and collinear stripe phases, for any value of the frustration $J_2/J_1$, for either the $z$-aligned ($\Delta > 1$) or $xy$-planar-aligned ($0 \leq \Delta < 1$) states. The quantum phase transition is determined to be first-order for all values of $J_2/J_1$ and $\Delta$. The position of the phase boundary $J_{2}^{c}(\Delta)$ is determined accurately. It is observed to deviate most from its classical position $J_2^c = {1/2}$ (for all values of $\Delta > 0$) at the Heisenberg isotropic point ($\Delta = 1$), where $J_{2}^{c}(1) = 0.55 \pm 0.01$. By contrast, at the XY isotropic point ($\Delta = 0$), we find $J_{2}^{c}(0) = 0.50 \pm 0.01$. In the Ising limit ($\Delta \to \infty$) $J_2^c \to 0.5$ as expected.Comment: 20 pages, 5 figure

Black holes in the Brans-Dicke-Maxwell theory

The black hole solutions in the higher dimensional Brans-Dicke-Maxwell theory are investigated. We find that the presence of the nontrivial scalar field depends on the spacetime dimensions (D). When D=4, the solution corresponds to the Reissner-Nordstr\"{o}m black hole with a constant scalar field. In higher dimensions (D>4), one finds the charged black hole solutions with the nontrivial scalar field. The thermal properties of the charged black holes are discussed and the reason why the nontrivial scalar field exists are explained. Also the solutions for higher dimensional Brans-Dicke theory are given for comparison.Comment: Revtex, 5 pages, no figures, contents were rewritten and new references were adde

Estimating commitment in a digital market place environment

The future generation of mobile communication shall be a convergence of mobile telephony and information systems which promises to change people's lives by enabling them to access information when, where and how they want. It presents opportunities to offer multimedia applications and services that meet end-toend service requirements. The Digital Marketplace framework will enable users to have separate contracts for different services on a per call basis. In order for such a framework to function appropriately, there has to be some means for the network operator to know in advance if its network will be able to support the user requirements. This paper discusses the methods by which the network operator will be able to determine if the system will be able to support another user of a certain service class and therefore negotiate parameters like commitment, QoS and the associated cost for providing the service, thus making the Digital Marketplace wor