Murder in the Abstract: The First Amendment and the Misappropriation of Brandenburg

When Paladin Enterprises published Hit Man, a manual about murder for hire, it knew and intended that the book would be used for such a purpose. When James Perry used the information contained in Hit Man to murder three innocent persons, he started a legal debate about the scope of First Amendment protections for books that instruct how to commit criminal acts. Many scholars and commentators indicated that Brandenburg v. Ohio contains the applicable constitutional standard; however, in litigation against Paladin, the survivors of the decedents challenged the conventional wisdom. This Note examines the Brandenburg test for its applicability to published materials that function as instruction manuals to perpetrate crimes. Because Brandenburg is inextricably linked with the crowd context, it is inapplicable to the published materials that function not as advocacy, but as instruction. Because Hit Man was used exactly as Paladin had intended, Paladin should be held liable in tort for the wrongful deaths of Perry\u27s three victims

PACE-IT study protocol: a stepped wedge cluster randomised controlled trial evaluating the implementation of telehealth visual assessment in emergency care for people living in residential aged-care facilities.

BACKGROUND:Transfer of residential aged-care facility (RACF) residents to Emergency Departments (ED) is common, risky and expensive. RACF residents who present to ED are more likely to have hospital readmissions, longer stays and face major risks related to hospital acquired complications. Aged Care Emergency services (ACE) is a nurse led, protocol- guided, telephone RACF/ED outreach model that has been shown to be effective in reducing hospitalisation and length of hospital stay for RACF residents in the Hunter New England Local Health District, New South Wales (NSW). The Partnerships in Aged-Care Emergency services using Interactive Telehealth (PACE-IT) project enhances ACE by incorporating interactive video assessment and consultation. The PACE-IT project's primary aim is to assess whether augmentation of ACE services through the addition of protocol-guided interactive Visual Telehealth Consultation (VTC) for clinical decision-making, plus telephone follow-up, reduces RACF resident transfers to ED. METHODS:A stepped-wedge cluster randomised controlled trial will be conducted. The intervention will be delivered sequentially to 8 clusters; each cluster comprises one ED and two RACFs in NSW, Australia. The 16 RACFs in the study will be selected for order of implementation using a computer-generated randomisation sequence. A 2-step randomisation process will be undertaken, randomising the hospital EDs first and then randomising the RACFs aligned with each hospital. The PACE-IT intervention comprises: an initial phone call by RACFs to the ACE service in the ED; the ACE service in ED responds with a protocol-guided VTC, a management plan agreed between all participants; an automated consultation summary letter to the General Practitioner and the RACF; a post VTC 24 h follow-up phone call to the RACF. DISCUSSION:If shown to be effective, the intervention has the potential to improve the clinical care and quality of life for residents. Findings will provide high level evidence that will inform sustainable change and broad translation into practice across NSW. It will show how the change has been achieved and highlight success factors for scalability and sustainability. It will inform review of processes, the development of policy and guidelines that will integrate PACE-IT into existing service models in NSW. TRIAL REGISTRATION:The trial is registered with the Australian New Zealand Clinical Trials Registry (Trial ID ACTR N12619001692123 ) 02/12/2020.)

CD-independent subsets in meet-distributive lattices

A subset $X$ of a finite lattice $L$ is CD-independent if the meet of any two incomparable elements of $X$ equals 0. In 2009, Cz\'edli, Hartmann and Schmidt proved that any two maximal CD-independent subsets of a finite distributive lattice have the same number of elements. In this paper, we prove that if $L$ is a finite meet-distributive lattice, then the size of every CD-independent subset of $L$ is at most the number of atoms of $L$ plus the length of $L$. If, in addition, there is no three-element antichain of meet-irreducible elements, then we give a recursive description of maximal CD-independent subsets. Finally, to give an application of CD-independent subsets, we give a new approach to count islands on a rectangular board.Comment: 14 pages, 4 figure

A polynomial bound for untangling geometric planar graphs

To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while keeping at least n^\epsilon vertices fixed. We answer this question in the affirmative with \epsilon=1/4. The previous best known bound was \Omega((\log n / \log\log n)^{1/2}). We also consider untangling geometric trees. It is known that every n-vertex geometric tree can be untangled while keeping at least (n/3)^{1/2} vertices fixed, while the best upper bound was O(n\log n)^{2/3}. We answer a question of Spillner and Wolff [arXiv:0709.0170 2007] by closing this gap for untangling trees. In particular, we show that for infinitely many values of n, there is an n-vertex geometric tree that cannot be untangled while keeping more than 3(n^{1/2}-1) vertices fixed. Moreover, we improve the lower bound to (n/2)^{1/2}.Comment: 14 pages, 7 figure

Complete genome sequence of the Medicago microsymbiont Ensifer (Sinorhizobium) medicae strain WSM419

Ensifer (Sinorhizobium) medicae is an effective nitrogen fixing microsymbiont of a diverse range of annual Medicago (medic) species. Strain WSM419 is an aerobic, motile, non-spore forming, Gram-negative rod isolated from a M. murex root nodule collected in Sardinia, Italy in 1981. WSM419 was manufactured commercially in Australia as an inoculant for annual medics during 1985 to 1993 due to its nitrogen fixation, saprophytic competence and acid tolerance properties. Here we describe the basic features of this organism, together with the complete genome sequence, and annotation. This is the first report of a complete genome se-quence for a microsymbiont of the group of annual medic species adapted to acid soils. We reveal that its genome size is 6,817,576 bp encoding 6,518 protein-coding genes and 81 RNA only encoding genes. The genome contains a chromosome of size 3,781,904 bp and 3 plasmids of size 1,570,951 bp, 1,245,408 bp and 219,313 bp. The smallest plasmid is a fea-ture unique to this medic microsymbiont

Convexity in partial cubes: the hull number

We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some earlier results in the literature. On the other hand we provide a polynomial-time algorithm to determine the hull number of planar partial cube quadrangulations. Instances of the hull number problem for partial cubes described include poset dimension and hitting sets for interiors of curves in the plane. To obtain the above results, we investigate convexity in partial cubes and characterize these graphs in terms of their lattice of convex subgraphs, improving a theorem of Handa. Furthermore we provide a topological representation theorem for planar partial cubes, generalizing a result of Fukuda and Handa about rank three oriented matroids.Comment: 19 pages, 4 figure

Feasible combinatorial matrix theory

We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory \LA with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over the standard textbook proof of KMM which requires $\Pi_2^B$ induction, and hence does not yield feasible proofs --- while our new approach does. \LA is a weak theory that essentially captures the ring properties of matrices; however, equipped with $\Sigma_1^B$ induction \LA is capable of proving KMM, and a host of other combinatorial properties such as Menger's, Hall's and Dilworth's Theorems. Therefore, our result formalizes Min-Max type of reasoning within a feasible framework

Advanced brain dopamine transporter imaging in mice using small-animal SPECT/CT

Abstract. The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum size, while any stable matching is a maximal matching and thus trivially a factor two approximation. In this paper, we give the first nontrivial result for approximation of factor less than two. Our algorithm achieves an approximation ratio of 2/(1+L −2) for instances in which only men have ties of length at most L. When both men and women are allowed to have ties, we show a ratio of 13/7(< 1.858) for the case when ties are of length two. We also improve the lower bound on the approximation ratio to 2