The irreversible thermodynamics of curved lipid membranes

The theory of irreversible thermodynamics for arbitrarily curved lipid membranes is presented here. The coupling between elastic bending and irreversible processes such as intra-membrane lipid flow, intra-membrane phase transitions, and protein binding and diffusion is studied. The forms of the entropy production for the irreversible processes are obtained, and the corresponding thermodynamic forces and fluxes are identified. Employing the linear irreversible thermodynamic framework, the governing equations of motion along with appropriate boundary conditions are provided.Comment: 62 pages, 4 figure

An adaptive space-time phase field formulation for dynamic fracture of brittle shells based on LR NURBS

We present an adaptive space-time phase field formulation for dynamic fracture of brittle shells. Their deformation is characterized by the Kirchhoff–Love thin shell theory using a curvilinear surface description. All kinematical objects are defined on the shell’s mid-plane. The evolution equation for the phase field is determined by the minimization of an energy functional based on Griffith’s theory of brittle fracture. Membrane and bending contributions to the fracture process are modeled separately and a thickness integration is established for the latter. The coupled system consists of two nonlinear fourth-order PDEs and all quantities are defined on an evolving two-dimensional manifold. Since the weak form requires C1-continuity, isogeometric shape functions are used. The mesh is adaptively refined based on the phase field using Locally Refinable (LR) NURBS. Time is discretized based on a generalized-α method using adaptive time-stepping, and the discretized coupled system is solved with a monolithic Newton–Raphson scheme. The interaction between surface deformation and crack evolution is demonstrated by several numerical examples showing dynamic crack propagation and branching

Kinetic slow mode-type solitons

One-dimensional hybrid code simulations are presented, carried out in order both to study solitary waves of the slow mode branch in an isotropic, collisionless, medium-β plasma (β_i=0.25) and to test the fluid based soliton interpretation of Cluster observed strong magnetic depressions (Stasiewicz et al., 2003; Stasiewicz, 2004) against kinetic theory. In the simulations, a variety of strongly oblique, large amplitude, solitons are seen, including solitons with Alfvenic polarization, similar to those predicted by the Hall-MHD theory, and robust, almost non-propagating, solitary structures of slow magnetosonic type with strong magnetic field depressions and perpendicular ion heating, which have no counterpart in fluid theory. The results support the soliton-based interpretation of the Cluster observations, but reveal substantial deficiencies of Hall-MHD theory in describing slow mode-type solitons in a plasma of moderate beta

ERRATUM TO: Mass-selective vibrational spectroscopy of vanadium oxide cluster ions [Mass Spect. Rev. 26, 542-562 (2007)]

On p. 558, right column, line 10 from bottom, the reference “(Santambrogio et al., 2007)” should be replaced by “(Santambrogio et al., 2006). On p. 561, the reference “Santambrogio G, Brümmer M, Wöste L, Döbler J, Sierka M, Sauer J, Meijer G, Asmis KR. 2007. Gas Phase Infrared Spectroscopy of Mass-Selected Vanadium Oxide Cluster Anions. Submitted to J Chem Phys.“ Should be replaced by “Santambrogio G, Brümmer M, Wöste L, Döbler J, Sierka M, Sauer J, Meijer G, Asmis KR. 2006. Gas Phase Vibrational Spectroscopy of Mass-Selected Vanadium Oxide Cluster Anions. In preparation.

GOTCHA Password Hackers!

We introduce GOTCHAs (Generating panOptic Turing Tests to Tell Computers and Humans Apart) as a way of preventing automated offline dictionary attacks against user selected passwords. A GOTCHA is a randomized puzzle generation protocol, which involves interaction between a computer and a human. Informally, a GOTCHA should satisfy two key properties: (1) The puzzles are easy for the human to solve. (2) The puzzles are hard for a computer to solve even if it has the random bits used by the computer to generate the final puzzle --- unlike a CAPTCHA. Our main theorem demonstrates that GOTCHAs can be used to mitigate the threat of offline dictionary attacks against passwords by ensuring that a password cracker must receive constant feedback from a human being while mounting an attack. Finally, we provide a candidate construction of GOTCHAs based on Inkblot images. Our construction relies on the usability assumption that users can recognize the phrases that they originally used to describe each Inkblot image --- a much weaker usability assumption than previous password systems based on Inkblots which required users to recall their phrase exactly. We conduct a user study to evaluate the usability of our GOTCHA construction. We also generate a GOTCHA challenge where we encourage artificial intelligence and security researchers to try to crack several passwords protected with our scheme.Comment: 2013 ACM Workshop on Artificial Intelligence and Security (AISec