Cable, Copyright, Communications: Controversy

This Note will examine the efforts of the courts, the legislature, and the Federal Communications Com-mission (FCC) to apply the Copyright Act of 1909 to the technological developments of the twentieth century. It is submitted that the significance of Teleprompter lies not in the Court\u27s determination that there was no copyright infringement -for that finding will soon be negated by upcoming copyright law revision -but in the inability of the Court to discard past inflexible and unrealistic approaches to the 1909 Copyright Act. Offered is a different method of viewing cable communications in terms of the Copyright Act, which recognizes that black and white categorizations are inappropriate and hopefully accommodates the perplexing characteristics of the cable industry

Homological growth of Artin kernels in positive characteristic

We prove an analogue of the Lück Approximation Theorem in positive characteristic for certain residually finite rationally soluble (RFRS) groups including right-angled Artin groups and Bestvina–Brady groups. Specifically, we prove that the mod p homology growth equals the dimension of the group homology with coefficients in a certain universal division ring and this is independent of the choice of residual chain. For general RFRS groups we obtain an inequality between the invariants. We also consider a number of applications to fibring, amenable category, and minimal volume entropy

Homological growth of Artin kernels in positive characteristic

We prove an analogue of the L\"uck Approximation Theorem in positive characteristic for certain residually finite rationally soluble (RFRS) groups including right-angled Artin groups and Bestvina--Brady groups. Specifically, we prove that the mod $p$ homology growth equals the dimension of the group homology with coefficients in a certain universal division ring and this is independent of the choice of residual chain. For general RFRS groups we obtain an inequality between the invariants. We also consider a number of applications to fibring, amenable category, and minimal volume entropy.Comment: 23 pages. Section 4 is ne

The Hanna Neumann Conjecture for graphs of free groups with cyclic edge groups

The Hanna Neumann Conjecture (HNC) for a free group $G$ predicts that $\overline\chi(U \cap V) \leqslant \overline\chi(U) \overline\chi(V)$ for all finitely generated subgroups $U$ and $V$, where $\overline\chi(H) = \min\{-\chi(H),0\}$ denotes the reduced Euler characteristic of $H$. A strengthened version of the HNC was proved independently by Friedman and Mineyev in 2011. Recently, Antol\'in and Jaikin-Zapirain introduced the $L^2$-Hall property and showed that if $G$ is a hyperbolic limit group that satisfies this property, then $G$ satisfies the HNC. Antol\'in--Jaikin-Zapirain established the $L^2$-Hall property for free and surface groups, which Brown--Kharlampovich extended to all limit groups. In this article, we prove the $L^2$-Hall property for graphs of free groups with cyclic edge groups that are hyperbolic relative to virtually abelian subgroups and also give another proof of the $L^2$-Hall property for limit groups. As a corollary, we show that all these groups satisfy a strengthened version of the HNC.Comment: 37 pages, 3 figures. Comments welcome

Cheating

https://digitalcommons.library.umaine.edu/mmb-vp/1210/thumbnail.jp

Self-directed disability support: building people’s capacity through peer support and action research

How are people with disability experiencing and managing the transition towards self directed support and preparing for the NDIS? In this project, small groups of people with disability around Australia met over 6 months to talk about their disability support. The peer support groups enabled action research about how they are deciding the practical details about support, such as how, when and by whom it is provided

A Verified LL(1) Parser Generator

An LL(1) parser is a recursive descent algorithm that uses a single token of lookahead to build a grammatical derivation for an input sequence. We present an LL(1) parser generator that, when applied to grammar G, produces an LL(1) parser for G if such a parser exists. We use the Coq Proof Assistant to verify that the generator and the parsers that it produces are sound and complete, and that they terminate on all inputs without using fuel parameters. As a case study, we extract the tool\u27s source code and use it to generate a JSON parser. The generated parser runs in linear time; it is two to four times slower than an unverified parser for the same grammar

Improved access to urban water services in Uganda

According to a 2004 Unicef/World Health Organization assessment, developing countries are more likely to achieve the millennium development goal (MDG) drinking water target in urban than in rural areas. However, this achievement is threatened by a high urbanisation rate in developing countries, where the urban population is projected to increase by about two billion between 2000 and 2030. For instance, although the global urban population with adequate water service levels increased in real terms by 36% between 1990 and 2004, overall coverage has remained practically unchanged at 95%. Given these high urbanisation rates, water utilities in developing countries need to be innovative in order to improve or maintain service coverage in their service areas. This paper presents the case of the National Water and Sewerage Corporation (NWSC) of Uganda, which has improved service coverage tremendously over the past decade through innovative management. Between 1998 and 2007, NWSC registered the following key performance improvements: number of service connections from 54 000 to over 180 000; service coverage from 51% to 71% of the population; towns served from 12 to 22; billing efficiency from 51% to 67.5%. The paper describes the specific measures that have contributed to this high performance improvement