Self-organizing search lists using probabilistic back-pointers

A class of algorithms is given for maintaining self-organizing sequential search lists, where the only permutation applied is to move the accessed record of each search some distance towards the front of the list. During searches, these algorithms retain a back-pointer to a previously probed record in order to determine the destination of the accessed record's eventual move. The back-pointer does not traverse the list, but rather it is advanced occationally to point to the record just probed by the search algorithm. This avoids the cost of a second traversal through a significant portion of the list, which may be a significant savings when each record access may require a new page to be brought into primary memory. Probabilistic functions for deciding when to advance the pointer are presented and analyzed. These functions demonstrate average case complexities of measures such as asymptotic cost and convergence similar to some of the more common list update algorithms in the literature. In cases where the accessed record is moved forward a distance proportional to the distance to the front of the list, the use of these functions may save up to 50% of the time required for permuting the list

Generation of optimal binary split trees

A binary split tree is a search structure combining features of heaps and binary search trees. Building an optimal binary split tree was originally conjectured to be intractable due to difficulties in applying dynamic programming techniques to the problem. However, two algorithms have recently been published which purportedly generate optimal trees in O(n^5) time, for records with distinct access probabilities. An extension allowing non-distinct access probabilities required exponential time. These algorithms consider a range of values when only a single value is possible, and may select an infeasible value which leads to an incorrect result. A dynamic programming method for determining the correct value is given, resulting in an algorithm which builds an optimal binary split tree in O(n^5) time for non-distinct access probabilities and Θ(n^4) time for distinct access probabilities

A probabilistic model of insolation for the Mojave Desert area

A discussion of mathematical models of insolation characteristics suitable for use in analysis of solar energy systems is presented and shows why such models are essential for solar energy system design. A model of solar radiation for the Mojave Desert area is presented with probabilistic and deterministic components which reflect the occurrence and density of clouds and haze, and mimic their effects on both direct and indirect radiation. Multiple comparisons were made between measured total energy received per day and the corresponding simulated totals. The simulated totals were all within 11 percent of the measured total. The conclusion is that a useful probabilistic model of solar radiation for the Goldstone, California, area of the Mojave Desert has been constructed

Optimal Pebbling in Products of Graphs

We prove a generalization of Graham's Conjecture for optimal pebbling with arbitrary sets of target distributions. We provide bounds on optimal pebbling numbers of products of complete graphs and explicitly find optimal $t$-pebbling numbers for specific such products. We obtain bounds on optimal pebbling numbers of powers of the cycle $C_5$. Finally, we present explicit distributions which provide asymptotic bounds on optimal pebbling numbers of hypercubes.Comment: 28 pages, 1 figur

Constitutional Law—Right to Counsel—Alleged Parole Violator Has Right to Counsel at a Parole Revocation Hearing

People ex rel. Combs v. La Vallee, 29 A.D. 2d 128, 286 N.Y.S.2d 600 (4th Dept. 1968), appeal dismissed, 22 N.Y.2d 857, 293 N.Y.S.2d 117 (1968)

Break up of returning plasma after the 7 June 2011 filament eruption by Rayleigh-Taylor instabilities

A prominence eruption on 7 June 2011 produced spectacular curtains of plasma falling through the lower corona. At the solar surface they created an incredible display of extreme ultraviolet brightenings. The aim is to identify and analyze some of the local instabilities which produce structure in the falling plasma. The structures were investigated using SDO/AIA 171A and 193A images in which the falling plasma appeared dark against the bright coronal emission. Several instances of the Rayleigh-Taylor instability were investigated. In two cases the Alfven velocity associated with the dense plasma could be estimated from the separation of the Rayleigh-Taylor fingers. A second type of feature, which has the appearance of self-similar branching horns, is also discussed.Comment: 6 pages, 7 figures, submitted A&A. Movies are at http://www.mps.mpg.de/data/outgoing/innes/arcs_movie.avi and http://www.mps.mpg.de/data/outgoing/innes/horns_movie.av

Criminal History Enhancements Sourcebook

Criminal history scores make up one of the two most significant determinants of the punishment an offender receives in a sentencing guidelines jurisdiction. While prior convictions are taken into account by all U.S. sentencing systems, sentencing guidelines make the role of prior crimes more explicit by specifying the counting rules and by indicating the effect of prior convictions on sentence severity. Yet, once established, criminal history scoring formulas go largely unexamined. Moreover, there is great diversity across state and federal jurisdictions in the ways that an offender's criminal record is considered by courts at sentencing. This Sourcebook brings together for the first time information on criminal history enhancements in all existing U.S. sentencing guidelines systems. Building on this base, the Sourcebook examines major variations in the approaches taken by these systems, and identifies the underlying sentencing policy issues raised by such enhancements.The Sourcebook contains the following elements:A summary of criminal history enhancements in all guidelines jurisdictions;An analysis of the critical dimensions of an offender's previous convictions;A discussion of the policy options available to commissions considering amendments to their criminal history enhancements;A bibliography of key readings on the role of prior convictions at sentencing