19,294 research outputs found

    State Sentencing Guidelines: Profiles and Continuum

    Get PDF
    Describes twenty-one state sentencing commissions; highlights key attributes of each state's sentencing guidelines and the composition of each commission; and compares guideline systems along a continuum from "more voluntary" to "more mandatory.

    The Robertson v. Princeton Case: Too Important to Be Left to the Lawyers

    Get PDF
    Offers comments from eleven contributors on the Robertson family's donor rights suit against the Woodrow Wilson School of Public and International Affairs for violation of donor intent. Explores its effects on and implications for the nonprofit sector

    Polarisation structuring of broadband light

    Get PDF
    Spatial structuring of the intensity, phase and polarisation of light is useful in a wide variety of modern applications, from microscopy to optical communications. This shaping is most commonly achieved using liquid crystal spatial light modulators (LC-SLMs). However, the inherent chromatic dispersion of LC-SLMs when used as diffractive elements presents a challenge to the extension of such techniques from monochromatic to broadband light. In this work we demonstrate a method of generating broadband vector beams with dynamically tunable intensity, phase and polarisation over a bandwidth of 100 nm. We use our system to generate radially and azimuthally polarised vector vortex beams carrying orbital angular momentum, and beams whose polarisation states span the majority of the Poincaré sphere. We characterise these broadband vector beams using spatially and spectrally resolved Stokes measurements, and detail the technical and fundamental limitations of our technique, including beam generation fidelity and efficiency. The broadband vector beam shaper that we demonstrate here may find use in applications such as ultrafast beam shaping and white light microscopy

    Orienting Graphs to Optimize Reachability

    Full text link
    The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to minimize the number of such pairs. The paper describes a quadratic-time algorithm for the first problem, and a proof that the second problem is NP-hard to approximate within some constant 1+epsilon > 1. The latter proof also shows that the second problem is equivalent to ``comparability graph completion''; neither problem was previously known to be NP-hard

    Revolt of the Attorneys General

    Full text link
    corecore