Reevaluating the Computer Fraud and Abuse Act: Amending the Statute to Explicitly Address the Cloud

Under the current interpretations of authorization, instances where an individual harmlessly accesses the cloud data of another user could be classified as hacking and a violation of this federal statute. As such, this Note demonstrates that all of the current interpretations of the CFAA are too broad because they could result in this nonsensical outcome. This Note accordingly proposes an amendment to the CFAA specifically addressing user access to data on the cloud. Such an amendment would eliminate the unusual result of innocuous cloud-computing users being deemed hackers under federal law

On the Navier-Stokes equations with constant total temperature

For various applications in fluid dynamics, it is assumed that the total temperature is constant. Therefore, the energy equation can be replaced by an algebraic relation. The resulting set of equations in the inviscid case is analyzed. It is shown that the system is strictly hyperbolic and well posed for the initial value problems. Boundary conditions are described such that the linearized system is well posed. The Hopscotch method is investigated and numerical results are presented

Generalized Du Fort-Frankel methods for parabolic initial boundary value problems

The Du Fort-Frankel difference scheme is generalized to difference operators of arbitrary high order accuracy in space and to arbitrary order of the parabolic differential operator. Spectral methods can also be used to approximate the spatial part of the differential operator. The scheme is explicit, and it is unconditionally stable for the initial value problem. Stable boundary conditions are given for two different fourth order accurate space approximations

Composition changes in the lower thermosphere

Chemical heating above polar thermosphere and formation of helium bulge during winte

Heavy Dynamical Fermions in Lattice QCD

It is expected that the only effect of heavy dynamical fermions in QCD is to renormalize the gauge coupling. We derive a simple expression for the shift in the gauge coupling induced by $N_f$ flavors of heavy fermions. We compare this formula to the shift in the gauge coupling at which the confinement-deconfinement phase transition occurs (at fixed lattice size) from numerical simulations as a function of quark mass and $N_f$. We find remarkable agreement with our expression down to a fairly light quark mass. However, simulations with eight heavy flavors and two light flavors show that the eight flavors do more than just shift the gauge coupling. We observe confinement-deconfinement transitions at $\beta=0$ induced by a large number of heavy quarks. We comment on the relevance of our results to contemporary simulations of QCD which include dynamical fermions.Comment: COLO-HEP-311, 26 pages and 6 postscript figures; file is a shar file and all macros are (hopefully) include

An adaptive pseudo-spectral method for reaction diffusion problems

The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions

Comparing the R algorithm and RHMC for staggered fermions

The R algorithm is widely used for simulating two flavours of dynamical staggered fermions. We give a simple proof that the algorithm converges to the desired probability distribution to within O(dt^2) errors, but show that the relevant expansion parameter is (dt/m)^2, m being the quark mass. The Rational Hybrid Monte Carlo (RHMC) algorithm provides an exact (i.e., has no step size errors) alternative for simulating the square root of the staggered Dirac operator. We propose using it to test the validity of the R algorithm for simulations carried out with dt m.Comment: 3 pages, proceedings from Lattice 2002 poster presentatio

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme

The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0, in TSP instances that form an arbitrary metric space with bounded intrinsic dimension. The celebrated results of Arora (A-98) and Mitchell (M-99) prove that the above result holds in the special case of TSP in a fixed-dimensional Euclidean space. Thus, our algorithm demonstrates that the algorithmic tractability of metric TSP depends on the dimensionality of the space and not on its specific geometry. This result resolves a problem that has been open since the quasi-polynomial time algorithm of Talwar (T-04)