The software package τ-ARGUS offers a very efficient algorithm for secondary cell suppression known as either HiTaS or the Modular approach. The method is well suited for the protection of up to 3-dimensional hierarchical tables. In practice, statistical agencies release multiple tabulations based on the same dataset. Usually these tables are linked through certain linear constraints. In such a...

A device for boolean mappings Bn -> Bm, B={0,1}, n, m ∈ Ν is given that is hardware efficient and quickly reprogrammable, combining the best features of look-up tables and programmable logic arrays (PLAs). It is especially suited to implement functions with large n, m. The device’s setup is given on the transistor level. Its hardware complexity is compared to look-up tables and PLAs by means of...

Weak References constitute an elegant mechanism for an application to interact with its garbage collector. In most of its typical uses, weak references are used through weak tables (e.g., Java’s WeakHashMap). However, most implementations of weak tables have a severe limitation: Cyclic references between keys and values in weak tables prevent the elements inside a cycle from being collected, ev...