We adapt the TreeRePair tree compression algorithm and use it as an intermediate step in proving termination of term rewriting systems. We introduce a cost function that approximates the size of constraint systems that specify compatibility of matrix interpretations. We show how to integrate the compression algorithm with the Dependency Pairs transformation. Experiments show that compression re...

BACKGROUND Out-of-hospital cardiac arrest is a life threatening situation where the first person performing cardiopulmonary resuscitation (CPR) most often is a bystander without medical training. Some existing smartphone apps can call the emergency number and provide for example global positioning system (GPS) location like Hjelp 113-GPS App by the Norwegian air ambulance. We propose to extend ...

Modern processors use two or more levels of cache memories to bridge the rising disparity between processor and memory speeds. Microprocessor designers have been torn between tight constraints on the amount of onchip cache memory and the high latency of off-chip memory, such as dynamic random access memory. Accessing off-chip memory generally takes an order of magnitude more time than accessing...

Process cooling below ambient temperature is an energy demanding part of many chemical production processes. Compression refrigeration systems operating at very low temperatures consume a lot of high quality utility such as electricity or high pressure steam to drive the compressor units. In industrial process clusters with several processes operating at low temperatures, it is important to inv...

In this paper, we present a low power architecture for scan-path. This architecture is suitable when it is used with a test compression. Based on data compression methodology, the vector set is partitioned so that the segments repeated in every scan can be removed. Here, it is not needed to change all bits of scan path during the new scan path where new test vector will be filled. In this way, ...

Modern graphics processors provide exceptional computational power, but only for certain computational models. While they have revolutionized computation in many fields, compression has been largely unnaffected. This paper aims to explain the current issues and possibilities in GPGPU compression. This is done by a high level overview of the GPGPU computational model in the context of compressio...

Signal processing algorithms and architectures can use dynamic reconfiguration to exploit variations in signal statistics with the objectives of improved performance and reduced power. Parameters provide a simple and formal way to characterize incremental changes to a computation and its computing mechanism. This paper develops a framework for dynamic parameterization and applies it to MPEG-4 m...

The overmoded rf transmission and pulsed power compression system for SLAC's Next Linear Collider (NLC) program requires a high degree of transmission efficiency and mode purity to be economically feasible. To this end, a number of new, high power components and systems have been developed at X-band, which transmit rf power in the low loss, circular TE01 mode with negligible mode conversion. In...

Sign bit compression in fixed-point numbering systems can improve the dynamic range and round-off noise for signal processing algorithms. This paper analyses non-standard compression factors (CF) for compressed fixed-point data formats, where sign bit compression is performed on each individual fixed-point number. Although these compression techniques are applicable to other fixed-point formats...