Measuring carrier density in parallel conduction layers of quantum Hall systems

An experimental analysis for two parallel conducting layers determines the full resistivity tensor of the parallel layer, at magnetic fields where the other layer is in the quantum Hall regime. In heterostructures which exhibit parallel conduction in the modulation-doped layer, this analysis quantitatively determines the charge density in the doping layer and can be used to estimate the mobility. To illustrate one application, experimental data show magnetic freeze-out of parallel conduction in a modulation doped heterojunction. As another example, the carrier density of a minimally populated second subband in a two-subband quantum well is determined. A simple formula is derived that can estimate the carrier density in a highly resistive parallel layer from a single Hall measurement of the total system.Comment: 7 pages, 7 figure

A formal definition and a new security mechanism of physical unclonable functions

The characteristic novelty of what is generally meant by a "physical unclonable function" (PUF) is precisely defined, in order to supply a firm basis for security evaluations and the proposal of new security mechanisms. A PUF is defined as a hardware device which implements a physical function with an output value that changes with its argument. A PUF can be clonable, but a secure PUF must be unclonable. This proposed meaning of a PUF is cleanly delineated from the closely related concepts of "conventional unclonable function", "physically obfuscated key", "random-number generator", "controlled PUF" and "strong PUF". The structure of a systematic security evaluation of a PUF enabled by the proposed formal definition is outlined. Practically all current and novel physical (but not conventional) unclonable physical functions are PUFs by our definition. Thereby the proposed definition captures the existing intuition about what is a PUF and remains flexible enough to encompass further research. In a second part we quantitatively characterize two classes of PUF security mechanisms, the standard one, based on a minimum secret read-out time, and a novel one, based on challenge-dependent erasure of stored information. The new mechanism is shown to allow in principle the construction of a "quantum-PUF", that is absolutely secure while not requiring the storage of an exponentially large secret. The construction of a PUF that is mathematically and physically unclonable in principle does not contradict the laws of physics.Comment: 13 pages, 1 figure, Conference Proceedings MMB & DFT 2012, Kaiserslautern, German

Towards Functional Flows for Hierarchical Models

The recursion relations of hierarchical models are studied and contrasted with functional renormalisation group equations in corresponding approximations. The formalisms are compared quantitatively for the Ising universality class, where the spectrum of universal eigenvalues at criticality is studied. A significant correlation amongst scaling exponents is pointed out and analysed in view of an underlying optimisation. Functional flows are provided which match with high accuracy all known scaling exponents from Dyson's hierarchical model for discrete block-spin transformations. Implications of the results are discussed.Comment: 17 pages, 4 figures; wording sharpened, typos removed, reference added; to appear with PR

Characterization of the domain chaos convection state by the largest Lyapunov exponent

Using numerical integrations of the Boussinesq equations in rotating cylindrical domains with realistic boundary conditions, we have computed the value of the largest Lyapunov exponent lambda1 for a variety of aspect ratios and driving strengths. We study in particular the domain chaos state, which bifurcates supercritically from the conducting fluid state and involves extended propagating fronts as well as point defects. We compare our results with those from Egolf et al., [Nature 404, 733 (2000)], who suggested that the value of lambda1 for the spiral defect chaos state of a convecting fluid was determined primarily by bursts of instability arising from short-lived, spatially localized dislocation nucleation events. We also show that the quantity lambda1 is not intensive for aspect ratios Gamma over the range 20<Gamma<40 and that the scaling exponent of lambda1 near onset is consistent with the value predicted by the amplitude equation formalism

Enhanced tracer transport by the spiral defect chaos state of a convecting fluid

To understand how spatiotemporal chaos may modify material transport, we use direct numerical simulations of the three-dimensional Boussinesq equations and of an advection-diffusion equation to study the transport of a passive tracer by the spiral defect chaos state of a convecting fluid. The simulations show that the transport is diffusive and is enhanced by the spatiotemporal chaos. The enhancement in tracer diffusivity follows two regimes. For large Peclet numbers (that is, small molecular diffusivities of the tracer), we find that the enhancement is proportional to the Peclet number. For small Peclet numbers, the enhancement is proportional to the square root of the Peclet number. We explain the presence of these two regimes in terms of how the local transport depends on the local wave numbers of the convection rolls. For large Peclet numbers, we further find that defects cause the tracer diffusivity to be enhanced locally in the direction orthogonal to the local wave vector but suppressed in the direction of the local wave vector.Comment: 11 pages, 12 figure

Traveling waves in rotating Rayleigh-Bénard convection: Analysis of modes and mean flow

Numerical simulations of the Boussinesq equations with rotation for realistic no-slip boundary conditions and a finite annular domain are presented. These simulations reproduce traveling waves observed experimentally. Traveling waves are studied near threshhold by using the complex Ginzburg-Landau equation (CGLE): a mode analysis enables the CGLE coefficients to be determined. The CGLE coefficients are compared with previous experimental and theoretical results. Mean flows are also computed and found to be more significant as the Prandtl number decreases (from sigma=6.4 to sigma=1). In addition, the mean flow around the outer radius of the annulus appears to be correlated with the mean flow around the inner radius

On the Optimal Space Complexity of Consensus for Anonymous Processes

The optimal space complexity of consensus in shared memory is a decades-old open problem. For a system of $n$ processes, no algorithm is known that uses a sublinear number of registers. However, the best known lower bound due to Fich, Herlihy, and Shavit requires $\Omega(\sqrt{n})$ registers. The special symmetric case of the problem where processes are anonymous (run the same algorithm) has also attracted attention. Even in this case, the best lower and upper bounds are still $\Omega(\sqrt{n})$ and $O(n)$. Moreover, Fich, Herlihy, and Shavit first proved their lower bound for anonymous processes, and then extended it to the general case. As such, resolving the anonymous case might be a significant step towards understanding and solving the general problem. In this work, we show that in a system of anonymous processes, any consensus algorithm satisfying nondeterministic solo termination has to use $\Omega(n)$ read-write registers in some execution. This implies an $\Omega(n)$ lower bound on the space complexity of deterministic obstruction-free and randomized wait-free consensus, matching the upper bound and closing the symmetric case of the open problem