The Singularity in Generic Gravitational Collapse Is Spacelike, Local, and Oscillatory

A longstanding conjecture by Belinskii, Khalatnikov, and Lifshitz that the singularity in generic gravitational collapse is spacelike, local, and oscillatory is explored analytically and numerically in spatially inhomogeneous cosmological spacetimes. With a convenient choice of variables, it can be seen analytically how nonlinear terms in Einstein's equations control the approach to the singularity and cause oscillatory behavior. The analytic picture requires the drastic assumption that each spatial point evolves toward the singularity as an independent spatially homogeneous universe. In every case, detailed numerical simulations of the full Einstein evolution equations support this assumption.Comment: 7 pages includes 4 figures. Uses Revtex and psfig. Received "honorable mention" in 1998 Gravity Research Foundation essay contest. Submitted to Mod. Phys. Lett.

Prioritized Garbage Collection: Explicit GC Support for Software Caches

Programmers routinely trade space for time to increase performance, often in the form of caching or memoization. In managed languages like Java or JavaScript, however, this space-time tradeoff is complex. Using more space translates into higher garbage collection costs, especially at the limit of available memory. Existing runtime systems provide limited support for space-sensitive algorithms, forcing programmers into difficult and often brittle choices about provisioning. This paper presents prioritized garbage collection, a cooperative programming language and runtime solution to this problem. Prioritized GC provides an interface similar to soft references, called priority references, which identify objects that the collector can reclaim eagerly if necessary. The key difference is an API for defining the policy that governs when priority references are cleared and in what order. Application code specifies a priority value for each reference and a target memory bound. The collector reclaims references, lowest priority first, until the total memory footprint of the cache fits within the bound. We use this API to implement a space-aware least-recently-used (LRU) cache, called a Sache, that is a drop-in replacement for existing caches, such as Google's Guava library. The garbage collector automatically grows and shrinks the Sache in response to available memory and workload with minimal provisioning information from the programmer. Using a Sache, it is almost impossible for an application to experience a memory leak, memory pressure, or an out-of-memory crash caused by software caching.Comment: to appear in OOPSLA 201

Solving the mystery of the disappearing January blip in state employment data

Frank Berger and Keith Phillips propose a new two-step method of seasonally adjusting state Current Employment Statistics (CES) data produced by the Bureau of Labor Statistics (BLS). This method, first proposed in the July/August 1993 issue of Southwest Economy, recently was adopted by the BLS to seasonally adjust the broadest industry groupings of the state employment series. With this new adjustment procedure, the state employment data should be smoother and better reflect trend-cycle movements than if a more traditional seasonal adjustment method were used. ; The article finds that forty-six states suffer a break in their seasonal pattern toward the end of the data series. The authors explain the reason for the break and describe a procedure to adjust for it. Although the BLS is currently using this procedure for states at the broadest level of industry detail, analysts who want to seasonally adjust the state employment data at a finer level of industry detail should find the authors' description of the process useful. Also, analysts who seek to seasonally adjust the CES data for metropolitan areas may find the two-step method helpful.Employment (Economic theory)

A Modified Version of the Waxman Algorithm

The iterative algorithm recently proposed by Waxman for solving eigenvalue problems, which relies on the method of moments, has been modified to improve its convergence considerably without sacrificing its benefits or elegance. The suggested modification is based on methods to calculate low-lying eigenpairs of large bounded hermitian operators or matrices

The Mellin Transform Technique for the Extraction of the Gluon Density

A new method is presented to determine the gluon density in the proton from jet production in deeply inelastic scattering. By using the technique of Mellin transforms not only for the solution of the scale evolution equation of the parton densities but also for the evaluation of scattering cross sections, the gluon density can be extracted in next-to-leading order QCD. The method described in this paper is, however, more general, and can be used in situations where a repeated fast numerical evaluation of scattering cross sections for varying parton distribution functions is required.Comment: 13 pages (LaTeX); 2 figures are included via epsfig; the corresponding postscript files are uuencode

Femtosecond "snapshots "of gap-forming charge-density-wave correlations in quasi-two-dimensional dichalcogenides 1T-TaS2 and 2H-TaSe2

Time-resolved optical spectroscopy of collective and single-particle excitations of 1T-TaS2 and 2H-TaSe2 reveals the presence of a large gap in the excitation spectrum on the femtosecond timescale, associated with the formation of various degrees of CDW order. In common with superconducting cuprates, excitations with energies less than the full gap show much slower relaxation. This separation of timescales cannot be explained in a quasi-2D Fermi-Liquid picture with an anisotropic gap but rather suggests the formation of a fluctuating spatially inhomogeneous state eventually forming a long-range ordered state at low temperatures.Comment: to appear in Phys. Rev.B Rapid Com