Patterns in model engineering 2015 - A workshop summary

The Patterns in Model Engineering (PAME) workshop5 was held on 21 July 2015 as part of the Software Technologies: Applications and Foundations (STAF) conference, in L'Aquila, Italy. The workshop focused on identification, analysis and presentation of patterns across all aspects of modelling and Model-Driven Engineering (MDE), including patterns for modelling, metamodelling, transformation, and in constraints. The workshop featured three invited presentations by Jordi Cabot (ICREA, Spain), Daniel Varro (BME, Hungary) and Antonio Cicchetti (MDH, Sweden), five full papers, and a significant discussion and debate about the roles that patterns can play in modelling. This paper summarises the workshop discussion and highlights some of the key research challenges in the field

Holography in 4D (Super) Higher Spin Theories and a Test via Cubic Scalar Couplings

The correspondences proposed previously between higher spin gauge theories and free singleton field theories were recently extended into a more complete picture by Klebanov and Polyakov in the case of the minimal bosonic theory in D=4 to include the strongly coupled fixed point of the 3d O(N) vector model. Here we propose an N=1 supersymmetric version of this picture. We also elaborate on the role of parity in constraining the bulk interactions, and in distinguishing two minimal bosonic models obtained as two different consistent truncations of the minimal N=1 model that retain the scalar or the pseudo-scalar field. We refer to these models as the Type A and Type B models, respectively, and conjecture that the latter is holographically dual to the 3d Gross-Neveu model. In the case of the Type A model, we show the vanishing of the three-scalar amplitude with regular boundary conditions. This agrees with the O(N) vector model computation of Petkou, thereby providing a non-trivial test of the Klebanov-Polyakov conjecture.Comment: 30p

One Loop Beta Functions in Topologically Massive Gravity

We calculate the running of the three coupling constants in cosmological, topologically massive 3d gravity. We find that \nu, the dimensionless coefficient of the Chern-Simons term, has vanishing beta function. The flow of the cosmological constant and Newton's constant depends on \nu, and for any positive \nu there exist both a trivial and a nontrivial fixed point.Comment: 44 pages, 16 figure

TuRaN: True Random Number Generation Using Supply Voltage Underscaling in SRAMs

Prior works propose SRAM-based TRNGs that extract entropy from SRAM arrays. SRAM arrays are widely used in a majority of specialized or general-purpose chips that perform the computation to store data inside the chip. Thus, SRAM-based TRNGs present a low-cost alternative to dedicated hardware TRNGs. However, existing SRAM-based TRNGs suffer from 1) low TRNG throughput, 2) high energy consumption, 3) high TRNG latency, and 4) the inability to generate true random numbers continuously, which limits the application space of SRAM-based TRNGs. Our goal in this paper is to design an SRAM-based TRNG that overcomes these four key limitations and thus, extends the application space of SRAM-based TRNGs. To this end, we propose TuRaN, a new high-throughput, energy-efficient, and low-latency SRAM-based TRNG that can sustain continuous operation. TuRaN leverages the key observation that accessing SRAM cells results in random access failures when the supply voltage is reduced below the manufacturer-recommended supply voltage. TuRaN generates random numbers at high throughput by repeatedly accessing SRAM cells with reduced supply voltage and post-processing the resulting random faults using the SHA-256 hash function. To demonstrate the feasibility of TuRaN, we conduct SPICE simulations on different process nodes and analyze the potential of access failure for use as an entropy source. We verify and support our simulation results by conducting real-world experiments on two commercial off-the-shelf FPGA boards. We evaluate the quality of the random numbers generated by TuRaN using the widely-adopted NIST standard randomness tests and observe that TuRaN passes all tests. TuRaN generates true random numbers with (i) an average (maximum) throughput of 1.6Gbps (1.812Gbps), (ii) 0.11nJ/bit energy consumption, and (iii) 278.46us latency