Becoming Respectable: A History of Early Social Responsibility in the Las Vegas Casino Industry

Today’s gaming corporations actively engage with their communities by supporting nonprofit organizations and adopting environmentally friendly practices among other socially responsible actions. This research considers precursors to modern corporate social responsibility (CSR) in the gaming industry by examining the philanthropic activities of the casino owners in Las Vegas in the early days of its development. This historical look at early philanthropy in the gaming industry provides a contextual background for considering contemporary corporate social responsibility. While the gaming industry has clearly come a long way from its early ties to organized crime, an understanding of this context helps further discussion about the place of CSR in today’s gaming industry and the role that gaming corporations should play as corporate citizens

Versatile analog pulse height computer performs real-time arithmetic operations

Multipurpose analog pulse height computer performs real-time arithmetic operations on relatively fast pulses. This computer can be used for identification of charged particles, pulse shape discrimination, division of signals from position sensitive detectors, and other on-line data reduction techniques

Pulse-height defect due to electron interaction in dead layers of Ge/Li/ gamma-ray detectors

Study shows the pulse-height degradation of gamma ray spectra in germanium/lithium detectors to be due to electron interaction in the dead layers that exist in all semiconductor detectors. A pulse shape discrimination technique identifies and eliminates these defective pulses

Ultrastable reference pulser for high-resolution spectrometers

Solid-state double-pulse generator for a high resolution semiconductor detector meets specific requirements for resolution /0.05 percent/, amplitude range /0.1-13 MeV/, and repetition rate /0.1-1000 pulses per second/. A tag pulse is generated in coincidence with each reference pulse

List decoding of noisy Reed-Muller-like codes

First- and second-order Reed-Muller (RM(1) and RM(2), respectively) codes are two fundamental error-correcting codes which arise in communication as well as in probabilistically-checkable proofs and learning. In this paper, we take the first steps toward extending the quick randomized decoding tools of RM(1) into the realm of quadratic binary and, equivalently, Z_4 codes. Our main algorithmic result is an extension of the RM(1) techniques from Goldreich-Levin and Kushilevitz-Mansour algorithms to the Hankel code, a code between RM(1) and RM(2). That is, given signal s of length N, we find a list that is a superset of all Hankel codewords phi with dot product to s at least (1/sqrt(k)) times the norm of s, in time polynomial in k and log(N). We also give a new and simple formulation of a known Kerdock code as a subcode of the Hankel code. As a corollary, we can list-decode Kerdock, too. Also, we get a quick algorithm for finding a sparse Kerdock approximation. That is, for k small compared with 1/sqrt{N} and for epsilon > 0, we find, in time polynomial in (k log(N)/epsilon), a k-Kerdock-term approximation s~ to s with Euclidean error at most the factor (1+epsilon+O(k^2/sqrt{N})) times that of the best such approximation