PROTECTING PROPERTY RIGHTS WITH STRICT SCRUTINY: AN ARGUMENT FOR THE SPECIFICALLY AND UNIQUELY ATTRIBUTABLE STANDARD

This article analyzes three levels of scrutiny states have applied to regulatory takings cases. These include \u27judicial deterrence , rational nexus , and specifically and uniquely attributable . The author argues that the first two standards are inefficient and concludes in favor of the specifically and uniquely attributable standard

The Messianic Zeal: A Case of Radical Aesthetics in Black Cultural Production

This essay examines artwork by popular artists D’Angelo, Kanye West, Kendrick Lamar and 2pac Shakur and compares their articulations to a larger discourse of messianic symbolism in (black) American popular culture. In this paper, messianic symbolism is a discursive chain of symbols that invoke the Black experience. Artists extend the legacy of earlier representations of black messianism by similarly representing themselves as Jews, saviors or folk heroes with a specific mission to save a world burdened by racial strife and oppression. These qualities manifest in lyrics, album covers, and other late 20th century rhetoric

Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits

In order to formally understand the power of neural computing, we first need to crack the frontier of threshold circuits with two and three layers, a regime that has been surprisingly intractable to analyze. We prove the first super-linear gate lower bounds and the first super-quadratic wire lower bounds for depth-two linear threshold circuits with arbitrary weights, and depth-three majority circuits computing an explicit function. $\bullet$ We prove that for all $\epsilon\gg \sqrt{\log(n)/n}$, the linear-time computable Andreev's function cannot be computed on a $(1/2+\epsilon)$-fraction of $n$-bit inputs by depth-two linear threshold circuits of $o(\epsilon^3 n^{3/2}/\log^3 n)$ gates, nor can it be computed with $o(\epsilon^{3} n^{5/2}/\log^{7/2} n)$ wires. This establishes an average-case ``size hierarchy'' for threshold circuits, as Andreev's function is computable by uniform depth-two circuits of $o(n^3)$ linear threshold gates, and by uniform depth-three circuits of $O(n)$ majority gates. $\bullet$ We present a new function in $P$ based on small-biased sets, which we prove cannot be computed by a majority vote of depth-two linear threshold circuits with $o(n^{3/2}/\log^3 n)$ gates, nor with $o(n^{5/2}/\log^{7/2}n)$ wires. $\bullet$ We give tight average-case (gate and wire) complexity results for computing PARITY with depth-two threshold circuits; the answer turns out to be the same as for depth-two majority circuits. The key is a new random restriction lemma for linear threshold functions. Our main analytical tool is the Littlewood-Offord Lemma from additive combinatorics

Twisted Alexander Invariants of Twisted Links

Let L be an oriented (d+1)-component link in the 3-sphere, and let L(q) be the d-component link in a homology 3-sphere that results from performing 1/q-surgery on the last component. Results about the Alexander polynomial and twisted Alexander polynomials of L(q) corresponding to finite-image representations are obtained. The behavior of the invariants as q increases without bound is described.Comment: 21 pages, 6 figure

GPU Based Path Integral Control with Learned Dynamics

We present an algorithm which combines recent advances in model based path integral control with machine learning approaches to learning forward dynamics models. We take advantage of the parallel computing power of a GPU to quickly take a massive number of samples from a learned probabilistic dynamics model, which we use to approximate the path integral form of the optimal control. The resulting algorithm runs in a receding-horizon fashion in realtime, and is subject to no restrictive assumptions about costs, constraints, or dynamics. A simple change to the path integral control formulation allows the algorithm to take model uncertainty into account during planning, and we demonstrate its performance on a quadrotor navigation task. In addition to this novel adaptation of path integral control, this is the first time that a receding-horizon implementation of iterative path integral control has been run on a real system.Comment: 6 pages, NIPS 2014 - Autonomously Learning Robots Worksho

Simultaneous Parasitism of Field-Collected Green Cloverworm, \u3ci\u3eHypena Scabra\u3c/i\u3e (Lepidoptera: Noctuidae) Larvae by Endoparasitioids and an Entomopathogenic Fungus

The impacts of entomopathogens (e.g., fungi, bacteria, protists and viruses) on larval Lepidoptera and their associated insect parasitoids have been examined in laboratory studies but field studies of interaction between these two mortality factors are rare. We present field observations of concurrent insect parasitism and fungal disease infection in larvae of the green cloverworm, Hypena scabra, a sporadic pest of soybean (Glycine max) in North America. We reared ten parasitoid species from H. scabra larvae during our three-month study. Three parasitoid species were dominant and overlapped the period of infection by the entomopathogenic fungus Nomuraea rileyi: Aleiodes nolophanae, Cotesia plathypenae and Campylochaeta plathypenae. Two of the three parasitoid species, Co. plathypenae and Ca. plathypenae, completed development within H. scabra larvae infected by N. rileyi. Overall incidence of simultaneous parasitism and fungal infection was low, averaging 6.7% of H. scabra larvae parasitized by Ca. plathypenae and 3.3% of those parasitized by Co. plathypenae