Facilitating Conflict Resolution in Union-Management Relations: A Guide for Neutrals

Over fifty years ago George Taylor, one of the most highly respected labor-management neutrals of his time, called for third parties to take on what he termed a mantle of responsibility for labor-management relations. Today, wide ranges of practitioners are assuming this responsibility. They are playing a variety of internal and external roles, as labor arbitrators, mediators, consultants, facilitators, dispute system designers, leaders serving on joint committees, and countless others. These individuals strive to rise above the partisan pressures that are found in any union-management relationship by helping to resolve disputes, foster problem solving, and build new institutional relations. In doing so, they are helping the institution of collective bargaining adapt in ways necessary for it to continue to be a key societal element into the next century. As dispute resolution professionals, we need to understand the range of practices now found in different relationships, the types of roles neutrals might play, and the principles that should guide neutrals as they carry out these roles. The purpose of this report, therefore, is to outline principles for SPIDR members, other neutrals, and the parties who utilize the services of third party neutrals in contemporary labor-management relations. Specifically, we have three target audiences in mind: labor relations neutrals, steeped in the institutional nuances of industrial relations (primarily arbitrators and mediators), who are being challenged to help parties adapt to new circumstances; third-party neutrals experienced in settings outside of labor relations who are or will be working with parties in unionized settings; internal facilitator sand change agents (from labor or management) who are helping to solve problems and resolve disputes in the workplace. Some points in this report may be completely obvious to one part of the target audience but an essential caution to another. Some of the recommendations will be controversial since they reflect an activist view of third-party roles. Importantly, this is not an overall guide to best practice for labor-management relations; instead, it is a guide to the role of dispute resolution professionals in the labor-management context. We hope that it stimulates further constructive dialogue in the profession

Experimental Realization of Br\"{u}schweiler's exponentially fast search algorithm in a homo-nuclear system

Compared with classical search algorithms, Grover quantum algorithm [ Phys. Rev. Lett., 79, 325(1997)] achieves quadratic speedup and Bruschweiler hybrid quantum algorithm [Phys. Rev. Lett., 85, 4815(2000)] achieves an exponential speedup. In this paper, we report the experimental realization of the Bruschweiler$ algorithm in a 3-qubit NMR ensemble system. The pulse sequences are used for the algorithms and the measurement method used here is improved on that used by Bruschweiler, namely, instead of quantitatively measuring the spin projection of the ancilla bit, we utilize the shape of the ancilla bit spectrum. By simply judging the downwardness or upwardness of the corresponding peaks in an ancilla bit spectrum, the bit value of the marked state can be read out, especially, the geometric nature of this read-out can make the results more robust against errors.Comment: 10 pages and 3 figure

Effective Pure States for Bulk Quantum Computation

In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) and Cory et al. (spatial averaging) for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla qubits and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high temperature and low temperature bulk quantum computing and analyze the signal to noise behavior of each.Comment: 24 pages in LaTex, 14 figures, the paper is also avalaible at http://qso.lanl.gov/qc

Multiqubit Spin

It is proposed that the state space of a quantum object with a complicated discrete spectrum can be used as a basis for multiqubit recording and processing of information in a quantum computer. As an example, nuclear spin 3/2 is considered. The possibilities of writing and reading two quantum bits of information, preparation of the initial state, implementation of the "rotation" and "controlled negation" operations, which are sufficient for constructing any algorithms, are demonstrated.Comment: 7 pages, PostScript, no figures; translation of Pis'ma Zh. Eksp. Teor. Fiz. 70, No. 1, pp. 59-63, 10 July 1999; (Submitted 29 April 1999; resubmitted 2 June 1999

3. Launching the New Enterprise

As the academic year of 1945-46 approached, the intensity of activity in preparation for actually opening the school in the fall term became overwhelming. Incredible though it may seem, Ives and Day were able in a period of a few weeks to assemble the nucleus of a faculty, several of whom formed a continuing source of counsel and advice both during the school’s formative years and thereafter. Includes: The First Dean and the School’s Dedication; A Participant’s View of the Early Years; Ives Moves On; Several Views of Martin P. Catherwood; The Founders

APL And The Numerical Solution Of High-Order Linear Differential Equations

An Nth‐order linear ordinary differential equation is rewritten as a first‐order equation in an N×N matrix. Taking advantage of the matrix manipulation strength of the APL language this equation is then solved directly, yielding a great simplification over the standard procedure of solving N coupled first‐order scalar equations. This eases programming and results in a more intuitive algorithm. Example applications of a program using the technique are given from quantum mechanics and control theory