The Impact of a Regulatory Intervention on Resident-Centered Nursing Home Care: Rhode Island's Individualized Care Pilot

Evaluates a pilot project to promote resident-centered care through activities integrated with recertification inspections, including visits from a nonregulatory entity, and its impact on understanding, consideration, and implementation of practices

High field magnetotransport in composite conductors: the effective medium approximation revisited

The self consistent effective medium approximation (SEMA) is used to study three-dimensional random conducting composites under the influence of a strong magnetic field {\bf B}, in the case where all constituents exhibit isotropic response. Asymptotic analysis is used to obtain almost closed form results for the strong field magnetoresistance and Hall resistance in various types of two- and three-constituent isotropic mixtures for the entire range of compositions. Numerical solutions of the SEMA equations are also obtained, in some cases, and compared with those results. In two-constituent free-electron-metal/perfect-insulator mixtures, the magnetoresistance is asymptotically proportional to $|{\bf B}|$ at {\em all concentrations above the percolation threshold}. In three-constituent metal/insulator/superconductor mixtures a line of critical points is found, where the strong field magnetoresistance switches abruptly from saturating to non-saturating dependence on $|{\bf B}|$, at a certain value of the insulator-to-superconductor concentration ratio. This transition appears to be related to the phenomenon of anisotropic percolation.Comment: 16 pages, 3 figure

Codend selection of winter flounder Pseudopleuronectes americanus

Codend selection of winter flounder (Pseudopleuronectes americanus) in 76-127 mm mesh codends was examined from experiments conducted in Long Island Sound during the spring of 1986-87. The results show a slightly larger size at selection than was found in earlier work as indicated by the selection factor, 2.31 in the present study compared with 2.2 and 2.24 from previous studies. Diamond mesh was found to have a length at 50% retention about 1 cm longer (Lso =22.6 cm), and a selection range (3.4 cm) about 1 cm narrower, than square mesh in 102-mm codends. Tow duration varied from 1 to 2 hours using 114-mm diamond mesh. As has been found in previous studies, tow duration and Lso are positively related, with I-hour tows averaging 24.6 cm and 2-hour tows averaging 26.6 cm. The importance of the slope of the selection curve was examined in yield-per-recruit analyses by comparing knife-edge and stepwise recruitment. In all mesh sizes, stepwise recruitment provides a more conservative estimate of yield in the presence of a minimum size limit. Differences in yield estimates between the two models were generally small (1-7%), except in the largest mesh size, 127 mm, where yield is overestimated by 10% when assuming knife-edge recruitment. (PDF file contains 16 pages.

Distributed local approximation algorithms for maximum matching in graphs and hypergraphs

We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank $r$. Our main result is a deterministic algorithm to generate a matching which is an $O(r)$-approximation to the maximum weight matching, running in $\tilde O(r \log \Delta + \log^2 \Delta + \log^* n)$ rounds. (Here, the $\tilde O()$ notations hides $\text{polyloglog } \Delta$ and $\text{polylog } r$ factors). This is based on a number of new derandomization techniques extending methods of Ghaffari, Harris & Kuhn (2017). As a main application, we obtain nearly-optimal algorithms for the long-studied problem of maximum-weight graph matching. Specifically, we get a $(1+\epsilon)$ approximation algorithm using $\tilde O(\log \Delta / \epsilon^3 + \text{polylog}(1/\epsilon, \log \log n))$ randomized time and $\tilde O(\log^2 \Delta / \epsilon^4 + \log^*n / \epsilon)$ deterministic time. The second application is a faster algorithm for hypergraph maximal matching, a versatile subroutine introduced in Ghaffari et al. (2017) for a variety of local graph algorithms. This gives an algorithm for $(2 \Delta - 1)$-edge-list coloring in $\tilde O(\log^2 \Delta \log n)$ rounds deterministically or $\tilde O( (\log \log n)^3 )$ rounds randomly. Another consequence (with additional optimizations) is an algorithm which generates an edge-orientation with out-degree at most $\lceil (1+\epsilon) \lambda \rceil$ for a graph of arboricity $\lambda$; for fixed $\epsilon$ this runs in $\tilde O(\log^6 n)$ rounds deterministically or $\tilde O(\log^3 n )$ rounds randomly