ICMS ' 2000 The Physics of Boiling at Burnout
The basic elements of a new experimental approach for the investigation of burnout in pool boiling are presented. The approach consists of the combined use of ultrathin (nano-scale) heaters and high speed infrared imag|ng of the heater temperature pattern as a whole, in conjunction with highly detailed control and characterization of heater morphology at the nano and micron scales. It is shown that the burnout phenomenon can be resolved in both space and time. Ultrathin heaters capable of dissipating power levels, at steady-state, of over 1 MW/m 2 are demonstrated. A separation of scales is identified and it is used to transfer the focus of attention from the complexity of the two-phase mixing layer in the vicinity of the heater to a micron-scaled microlayer and nucleation and associated film-disruption processes within it.
The mechanism and prediction of critical heat flux in inverted geometries
Abstract Recent interest in a severe accident management scheme known as ‘In-Yessel Retention’ has created the need to establish the coolability limits of large, inverted geometries. In this paper, full-scale simulations conducted at UCSB's ULPU facility are examined at the microscopic level. Because of the peculiar geometry, it has become possible to directly visualize the boiling transition phenomenon, and with the help of microthermocouples to quantitatively identify the mechanism of dryout. Altogether, a new boiling transition regime was identified, with a significant coupling between overall systems dynamics and the microphenomena. This leads the way to the a priori prediction of critical heat flux and factors that may influence it.
Rubik's for cryptographers
Hard mathematical problems are at the core of security arguments in cryptography. In this paper, we study mathematical generalizations of the famous Rubik’s cube puzzle, namely the factorization, representation and balance problems in non-Abelian groups. These problems arise naturally when describing the security of Cayley hash functions, a class of cryptographic hash functions with very interesting properties. The factorization problem is also strongly related to a famous long-standing conjecture of Babai, at the intersection of group theory and graph theory. A constructive proof of Babai’s conjecture would make all Cayley hash functions insecure, but on the other hand it would have many positive applications in graph theory and computer science. In this paper, we classify existing attacks against Cayley hash functions and we review known results on Babai’s conjecture. Despite recent cryptanalytic progress on particular instances, we show that the factorization, representation and balance problems presumably remain good sources of cryptographic hard problems. Our study demonstrates that Cayley hash functions deserve further interest by the cryptography community.