'School performance tables', an alphabetical list of secondary schools along with aggregates of their pupils' performances in national tests, have been published in the UK since 1992. Inevitably, the media have responded by publishing ranked 'league tables'. Despite concern over the potentially divisive effect of such tables, the current government has continued to publish this information in t...

The ECN Group Limited is a Software development company that designs and builds Business Process Management (BPM) solutions using their BPM engine, Viibe. Viibe is a flexible framework that can be customised to meet the specific needs of the organisation. Viibe is made up of three distinct layers; Presentation layer, Middle tier and Database layer. The Database layer is made up of a client data...

Pomerance conjectured that there are x 1− {1+o(1)} log log log x log log x Carmichael numbers up to x. At the time, his data tables up to 25 · 109 appeared to support his conjecture. However, Pinch extended this data and showed that up to 1021, Pomerance's conjecture did not appear well-supported. Thus, we build upon the work of Carl Pomerance and others to formulate an alternative conjecture r...

A multiple-input signature register (MISR) computation algorithm for fast signature simulation is proposed. Based on the table look-up linear compaction algorithm and the modularity property of a single-input signature register (SISR), some new accelerating schemes—partial-input look-up tables and flying-state look-up tables—are developed to boost the signature computation speed. Mathematical a...

The paper extends the current known tables of Fermat’s pseudoprimes to base 3 with the bound of 10. The paper is motivated by works of C. Pomerance (1980), G. E. Pinch (2000), William Galway (2002) and Jan Feitsma (2009) who provided tables of pseudoprimes with base 2 up to 10 (Pinch), 10 (Galway) and 10 (Feitsma).

Hash tables are an essential data-structure for numerous networking applications (e.g., connection tracking, rewalls, network address translators). Among these, cuckoo hash tables provide excellent performance by allowing lookups to be processed with very few memory accesses (2 to 3 per lookup). Yet, for large tables, cuckoo hash tables remain memory bound and each memory access impacts perform...