Precision Cascade: A novel algorithm for multi-precision extreme compression
Explore the source record for details and available documents.
Engineering topics
Publications and source records attributed to Nunez, R..
Explore the source record for details and available documents.
For the last 7 years, Accelogic pioneered and perfected a radically new theory of numerical computing codenamed “Compressive Computing”, which has an extremely profound impact on real-world computer science [1]. At the core of this new theory is the discovery of one of its fundamental theorems which states that, under very general conditions, the vast majority (typically between 70% and 80%) of the bits used in modern large-scale numerical computations are absolutely irrelevant for the accuracy of the end result. This theory of Compressive Computing provides mechanisms able to identify (with high intelligence and surgical accuracy) the number of bits (i.e., the precision) that can be used to represent numbers without affecting the substance of the end results, as they are computed and vary in real time. The bottom-line outcome will be to provide state-of-the-art compression algorithms --and accompanying software libraries-- able to surpass the performance of the compression engines currently available in the ROOT [7] framework. The resulting technology has the capability to enable substantial economic and operational gains (including speedup) for High Energy and Nuclear Physics data storage/analysis. In our initial studies, a factor of nearly x4 (3.9) compression was achieved with RHIC/STAR data where ROOT compression managed only x1.4 [6].As a collaboration of experimental scientists, private industry, and the ROOT Team, our aim is to capitalize on the substantial success delivered by the initial effort and produce a robust technology properly packaged as an open-source tool that could be used by virtually every experiment around the world as means for improving data management and accessibility.In this contribution, we will present our efforts integrating our concepts of “functionally lossless compression” within the ROOT framework implementation, with the purpose of producing a basic solution readily integrated into HENP applications. We will also present our progress applying this compression through realistic examples of analysis from both the STAR and CMS experiments.
In the summer of 2012, during a Pulsar Search Collaboratory workshop, two high-school students discovered J1930–1852, a pulsar in a double neutron star (DNS) system. Most DNS systems are characterized by short orbital periods, rapid spin periods, and eccentric orbits. However, J1930–1852 has the longest spin period (P{sub spin} ∼ 185 ms) and orbital period (P{sub b} ∼ 45 days) yet measured among known, recycled pulsars in DNS systems, implying a shorter than average and/or inefficient recycling period before its companion went supernova. We measure the relativistic advance of periastron for J1930–1852, ω-dot =0.00078 (4) deg yr{sup −1}, which implies a total mass (M{sub tot}=2.59 (4) M{sub ⊙}) consistent with other DNS systems. The 2σ constraints on M{sub tot} place limits on the pulsar and companion masses (m{sub p}<1.32 M{sub ⊙} and m{sub c}>1.30 M{sub ⊙} respectively). J1930–1852’s spin and orbital parameters challenge current DNS population models and make J1930–1852 an important system for further investigation.