Predictions of large events on a spring-block model

We study the predictability of a theoretical model for earthquakes, using a pattern recognition algorithm similar to the CN and M8 algorithms known in seismology. The model, which is a stochastic spring-block model with both global correlation and local interaction, becomes more predictable as the strength of the global correlation or the local interaction is increased.

Selective block in erythropoietin-induced differentiation of growth factor-independent retrovirally-infected TF-1 cells

The erythroleukaemic cell line TF-1, infected with either the pBabe neo retrovirus or the retrovirus bearing the human erythropoietin (hEpo) gene, developed three growth factor-independent clones. Erythropoietin (Epo), interleukin-3 (IL-3) and granulocyte-macrophage colony stimulating factor (GM-CSF) accelerated the proliferation of these clones. Autonomous growth of the clones was independent of Epo because it was not altered by Epo anti-sense oligonucleotides, nor was Epo detectable in culture supernatants. Cells from the mutant clones could not be induced by Epo to express glycophorin A and haemoglobin synthesis was markedly reduced. Haemin reversed the block in Epo-induced haemoglobin synthesis. Acquisition of growth factor-independence appears to be linked with the selective loss of differentiation capacity. These cells may provide a useful model for the study of the mechanisms involved in leukaemic transformation.

The effect of construction pattern and unit interlock on the structural behaviour of block pavements

The maintenance or even replacement of cracked pavements requires considerable financial resources and puts a large burden on the budgets of local councils. In addition to these costs, local councils also face liability claims arising from uneven or cracked pedestrian pavements. These currently cost the Manchester City Council and Preston City Council around £6 million a year each. Design procedures are empirical. A better understanding of the interaction between paving blocks, bedding sand and subbase was necessary in order to determine the mode of failure of pavements under load. Increasing applied stress was found to mobilise ‘‘rotational interlock’’, providing increased pavement stiffness and thus increased load dissipation resulting in lower transmitted stress on the subgrade. The indications from the literature
review were that pavements are designed to fail by excessive deformation and that paving blocks remained uncracked at failure. This was confirmed with experimental data which was obtained from tests on segments of pavements that were laid/constructed in a purpose built test frame in the laboratory.

IMPROVED POSTFILTERING TECHNIQUE FOR BLOCK QUANTISATION OF SPEECH.

A modified comb filtering technique is proposed which can be used to reduce framing noise generated when speech signals are transform-coded or vector-quantized. Application of this filter to 9. 6 kbit/s speech in a vector transform coder has been found to improve the perceptual quality of the coded speech.

Systolic building block for high performance recursive filtering

A novel bit level systolic array is presented that can be used as a building block in the construction of recursive digital filters. The circuit accepts bit-parallel input data, is pipelined at the bit level, and exhibits a very high throughput rate. The most important feature of the circuit is that it allows recursive operations to be implemented directly without incurring the large m cycle latency (where m is approximately the word length) normally associated with such systems. The use of this circuit in the construction of both first- and second-order IIR (infinite-impulse-response) filters is described.

BDDT: Block-level Dynamic Dependence Analysis for Task-Based Parallelism

We present BDDT, a task-parallel runtime system that dynamically discovers and resolves dependencies among parallel tasks. BDDT allows the programmer to specify detailed task footprints on any memory address range, multidimensional array tile or dynamic region. BDDT uses a block-based dependence analysis with arbitrary granularity. The analysis is applicable to existing C programs without having to restructure object or array allocation, and provides flexibility in array layouts and tile dimensions.
We evaluate BDDT using a representative set of benchmarks, and we compare it to SMPSs (the equivalent runtime system in StarSs) and OpenMP. BDDT performs comparable to or better than SMPSs and is able to cope with task granularity as much as one order of magnitude finer than SMPSs. Compared to OpenMP, BDDT performs up to 3.9× better for benchmarks that benefit from dynamic dependence analysis. BDDT provides additional data annotations to bypass dependence analysis. Using these annotations, BDDT outperforms OpenMP also in benchmarks where dependence analysis does not discover additional parallelism, thanks to a more efficient implementation of the runtime system.

Hardware Comparison of the ISO/IEC 29192-2 Block Ciphers

As ubiquitous computing becomes a reality, sensitive information is increasingly processed and transmitted by smart cards, mobile devices and various types of embedded systems. This has led to the requirement of a new class of lightweight cryptographic algorithm to ensure security in these resource constrained environments. The International Organization for Standardization (ISO) has recently standardised two low-cost block ciphers for this purpose, Clefia and Present. In this paper we provide the first comprehensive hardware architecture comparison between these ciphers, as well as a comparison with the current National Institute of Standards and Technology (NIST) standard, the Advanced Encryption Standard.

Orthogonal space-time block coded rate-adaptive modulation with outdated feedbasck

Abstract-Channel state information (CSI) at the transmitter can be used to adapt transmission rate or antenna gains in multi-antenna systems. We propose a rate-adaptive M-QAM scheme equipped with orthogonal space-time block coding with simple outdated, finite-rate feedback over independent flat fading channels. We obtain closed-form expressions for the average BER and throughput for our scheme, and analyze the effects of possibly delayed feedback on the performance gains. We derive optimal switching thresholds maximizing the average throughput under average and outage BER constraints with outdated feedback. Our numerical results illustrate the immunity of our optimal thresholds to delayed feedback.