Ultra-Compact and Robust FPGA-Based PUF Identification Generator

Physically Unclonable Functions (PUFs), exploit inherent manufacturing variations and present a promising solution for hardware security. They can be used for key storage, authentication and ID generations. Low power cryptographic design is also very important for security applications. However, research to date on digital PUF designs, such as Arbiter PUFs and RO PUFs, is not very efficient. These PUF designs are difficult to implement on Field Programmable Gate Arrays (FPGAs) or consume many FPGA hardware resources. In previous work, a new and efficient PUF identification generator was presented for FPGA. The PUF identification generator is designed to fit in a single slice per response bit by using a 1-bit PUF identification generator cell formed as a hard-macro. In this work, we propose an ultra-compact PUF identification generator design. It is implemented on ten low-cost Xilinx Spartan-6 FPGA LX9 microboards. The resource utilization is only 2.23%, which, to the best of the authors' knowledge, is the most compact and robust FPGA-based PUF identification generator design reported to date. This PUF identification generator delivers a stable range of uniqueness of around 50% and good reliability between 85% and 100%.

Finite-element investigation of cold-formed steel portal frames in fire

This paper presents the results of a full-scale site fire test performed on a cold-formed steel portal frame building with semi-rigid joints. The purpose of the study is to establish a performance-based approach for the design of such structures in fire boundary conditions. In the full-scale site fire test, the building collapsed asymmetrically at a temperature of 714°C. A non-linear elasto-plastic finite-element shell model is described and is validated against the results of the full-scale test. A parametric study is presented that highlights the importance of in-plane restraint from the side rails in preventing an outwards sway failure for both a single portal and full building geometry model. The study also demonstrates that the semi-rigidity of the joints should be taken into account in the design. The single portal and full building geometry models display a close match to site test results with failure at 682°C and 704°C, respectively. A design case is described in accordance with Steel Construction Institute design recommendations. The validated single portal model is tested with pinned bases, columns protected, realistic loading and rafters subject to symmetric uniform heating in accordance with the ISO 834 standard fire curve; failure occurs at 703°C.

SN 2011dh: DISCOVERY OF A TYPE IIb SUPERNOVA FROM A COMPACT PROGENITOR IN THE NEARBY GALAXY M51

On 2011 May 31 UT a supernova (SN) exploded in the nearby galaxy M51 (the Whirlpool Galaxy). We discovered this event using small telescopes equipped with CCD cameras and also detected it with the Palomar Transient Factory survey, rapidly confirming it to be a Type II SN. Here, we present multi-color ultraviolet through infrared photometry which is used to calculate the bolometric luminosity and a series of spectra. Our early-time observations indicate that SN 2011dh resulted from the explosion of a relatively compact progenitor star. Rapid shock-breakout cooling leads to relatively low temperatures in early-time spectra, compared to explosions of red supergiant stars, as well as a rapid early light curve decline. Optical spectra of SN 2011dh are dominated by H lines out to day 10 after explosion, after which He I lines develop. This SN is likely a member of the cIIb (compact IIb) class, with progenitor radius larger than that of SN 2008ax and smaller than the eIIb (extended IIb) SN 1993J progenitor. Our data imply that the object identified in pre-explosion Hubble Space Telescope images at the SN location is possibly a companion to the progenitor or a blended source, and not the progenitor star itself, as its radius (~1013 cm) would be highly inconsistent with constraints from our post-explosion spectra.

On the numerical solution of the 2d wave equation with compact fdtd schemes

This paper discusses compact-stencil finite difference time domain (FDTD) schemes for approximating the 2D wave equation in the context of digital audio. Stability, accuracy, and efficiency are investigated and new ways of viewing and interpreting the results are discussed. It is shown that if a tight accuracy constraint is applied, implicit schemes outperform explicit schemes. The paper also discusses the relevance to digital waveguide mesh modelling, and highlights the optimally efficient explicit scheme.

Comparison of optimal designs of steel portal frames including topological asymmetry considering rolled, fabricated and tapered sections

A structural design optimisation has been carried out to allow for asymmetry and fully tapered portal frames. The additional weight of an asymmetric structural shape was found to be on average 5–13% with additional photovoltaic (PV) loading having a negligible effect on the optimum design. It was also shown that fabricated and tapered frames achieved an average percentage weight reduction of 9% and 11%, respectively, as compared to comparable hot-rolled steel frames. When the deflection limits recommended by the Steel Construction Institute were used, frames were shown to be deflection controlled with industrial limits yielding up to 40% saving.

Truth at 24 frames a second? A working dialogue between a film-maker and a historical consultant about the making of The Enigma of Frank Ryan

We employ a practice-based methodology based on a ‘live’ film project to explore the different ways that film-makers and historians narrate the past. Through a case-study of the production and exhibition of a drama-documentary feature-film, The Enigma of Frank Ryan, on which both authors (film-maker Bell and historian McGarry) worked respectively as director and historical consultant, we explore a range of critical issues arising from our collaboration. Through a dialogue between a director and a historian, a model of good practice between historians and film-makers emerges.

Compact Routing Messages in Self-Healing Trees

Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and Chechik [PODC 2013], often have no means to tolerate failures, once the system has been setup and started. This paper presents, to our knowledge, the first self-healing compact routing scheme. Besides, our schemes are developed for low memory nodes, i.e., nodes need only O(log2 n) memory, and are thus, compact schemes.
We introduce two algorithms of independent interest: The first is CompactFT, a novel compact version (using only O(log n) local memory) of the self-healing algorithm Forgiving Tree of Hayes et al. [PODC 2008]. The second algorithm (CompactFTZ) combines CompactFT with Thorup-Zwick’s treebased compact routing scheme [SPAA 2001] to produce a fully compact self-healing routing scheme. In the self-healing model, the adversary deletes nodes one at a time with the affected nodes self-healing locally by adding few edges. CompactFT recovers from each attack in only O(1) time and ∆ messages, with only +3 degree increase and O(log∆) graph diameter increase, over any sequence of deletions (∆ is the initial maximum degree).
Additionally, CompactFTZ guarantees delivery of a packet sent from sender s as long as the receiver has not been deleted, with only an additional O(y log ∆) latency, where y is the number of nodes that have been deleted on the path between s and t. If t has been deleted, s gets informed and the packet removed from the network.