Given a finite family F of axis-parallel boxes in R such that F contains no k + 1 pairwise disjoint boxes, and such that for each two intersecting boxes in F a corner of one box is contained in the other box, we prove that F can be pierced by at most ck log log(k) points, where c is a constant depending only on d. We further show that in some special cases the upper bound on the number of pierc...

This paper provides an overview of the survey-based literature on industrial Research and Development (R&D) laboratories, beginning with the work of Edwin Mansfield. Topics covered include R&D projects, new products, and new processes; the appropriability of intellectual property; the limits of the firm in R&D; and spillovers of knowledge from other firms and universities into the laboratories....

Although not original, the story makes an interesting introduction to the topic: Boeing’s prototype B-17 bomber stalled and crashed in 1935 on its first f light because the elevator control was left locked.1,2 The combination of the loss of life and the potential loss to the firm of the US government procurement demanded an innovative approach – and thus the checklist was born. The B-17 program...

In the paper we consider intensional aspects of the notion of data. We advocate an idea that traditional set-theoretic platform should be enhanced with new data structures having explicit intensional component. Among such data we distinguish the notions of preset and nominat. Intuitively, presets may be considered as collections of “black boxes”, nominats may be considered as collections of “gr...

This paper presents the substitution boxes (s-boxes) found in many block ciphers, and more specifically in DES-like encryption systems. It begins with a brief history of the Data Encryption Standard (DES) and the first public question on the chosen s-boxes. An outline of the DES algorithm is presented, along with a more detailed look of the cipher function that uses the s-boxes. The major metho...

This paper presents the substitution boxes (s-boxes) found in many block ciphers, and more specifically in DES-like encryption systems. It begins with a brief history of the Data Encryption Standard (DES) and the first public question on the chosen s-boxes. An outline of the DES algorithm is presented, along with a more detailed look of the cipher function that uses the s-boxes. The major metho...

Let T be a protoset of d-dimensional polyominoes. Which boxes (rectangular parallelepipeds) can be tiled by T ? A nice result of Klarner and Göbel asserts that the answer to this question can always be given in a particularly simple form, namely, by giving a finite list of “prime” boxes. All other boxes that can be tiled can be deduced from these prime boxes. We give a new, simpler proof of thi...

This paper presents the substitution boxes (s-boxes) found in many block ciphers, and more specifically in DES-like encryption systems. It begins with a brief history of the Data Encryption Standard (DES) and the first public question on the chosen s-boxes. An outline of the DES algorithm is presented, along with a more detailed look of the cipher function that uses the s-boxes. The major metho...

We present preliminary results on dynamic self-adaptation of streaming networks of concurrent programs (called boxes) to the underlying hardware platform. The monitoring subsystem gathers on-line measurements on the performance of individual boxes and uses the measurements to construct (and improve) performance models of the boxes. Ideally, the models accurately predict the running time of boxe...