Deconstructing Carmona: The U.S. War on Drugs and Black Men as Non-Citizens

Article published in the VaLaw U.Law Review

SlowFuzz: Automated Domain-Independent Detection of Algorithmic Complexity Vulnerabilities

Algorithmic complexity vulnerabilities occur when the worst-case time/space complexity of an application is significantly higher than the respective average case for particular user-controlled inputs. When such conditions are met, an attacker can launch Denial-of-Service attacks against a vulnerable application by providing inputs that trigger the worst-case behavior. Such attacks have been known to have serious effects on production systems, take down entire websites, or lead to bypasses of Web Application Firewalls. Unfortunately, existing detection mechanisms for algorithmic complexity vulnerabilities are domain-specific and often require significant manual effort. In this paper, we design, implement, and evaluate SlowFuzz, a domain-independent framework for automatically finding algorithmic complexity vulnerabilities. SlowFuzz automatically finds inputs that trigger worst-case algorithmic behavior in the tested binary. SlowFuzz uses resource-usage-guided evolutionary search techniques to automatically find inputs that maximize computational resource utilization for a given application.Comment: ACM CCS '17, October 30-November 3, 2017, Dallas, TX, US

Triggering on hard probes in heavy ion collisions with CMS

We present a study of the CMS trigger system in heavy-ion collisions. Concentrating on two physics channels, dimuons from decays of quarkonia and single jets, we evaluate a possible trigger strategy for Pb+Pb running that relies on event selection solely in the High-Level Trigger (HLT). The study is based on measurements of the timing performance of the offline algorithms and event-size distributions using full simulations. Using a trigger simulation chain, we compare the physics reach for the jet and dimuon channels using online selection in the HLT to minimum bias running. The results demonstrate the crucial role the HLT will play for CMS heavy-ion physics.Comment: 4 pages, 4 fugures, contribution to QM'06 conferenc

Persistent superfluid phase in a three-dimensional quantum XY model with ring exchange

We present quantum Monte Carlo simulation results on a quantum S=1/2 XY model with ring exchange (the J-K model) on a three-dimensional simple cubic lattice. We first characterize the ground state properties of the pure XY model, obtaining estimations for the energy, spin stiffness and spin susceptibility at T=0 in the superfluid phase. With the ring exchange, we then present simulation data on small lattices which suggests that the superfluid phase persists to very large values of the ring exchange K, without signatures of a phase transition. We comment on the consequences of this result for the search for various exotic phases in three dimensions.Comment: 4 pages, 4 figure

Trajectory generation for road vehicle obstacle avoidance using convex optimization

This paper presents a method for trajectory generation using convex optimization to find a feasible, obstacle-free path for a road vehicle. Consideration of vehicle rotation is shown to be necessary if the trajectory is to avoid obstacles specified in a fixed Earth axis system. The paper establishes that, despite the presence of significant non-linearities, it is possible to articulate the obstacle avoidance problem in a tractable convex form using multiple optimization passes. Finally, it is shown by simulation that an optimal trajectory that accounts for the vehicle’s changing velocity throughout the manoeuvre is superior to a previous analytical method that assumes constant speed