Nonsmooth geometry and collapse of flexible structures under smooth loads

While static equilibria of flexible strings subject to various load types (gravity, hydrostatic pressure, Newtonian wind) is well understood textbook material, the combinations of the very same loads can give rise to complex spatial behaviour at the core of which is the unilateral material constraint prohibiting compressive loads. While the effects of such constraints have been explored in optimisation problems involving straight cables, the geometric complexity of physical configurations has not yet been addressed. Here we show that flexible strings subject to combined smooth loads may not have smooth solutions in certain ranges of the load ratios. This non-smooth phenomenon is closely related to the collapse geometry of inflated tents. After proving the nonexistence of smooth solutions for a broad family of loadings we identify two alternative, critical geometries immediately preceding the collapse. We verify these analytical results by dynamical simulation of flexible chains as well as with simple table-top experiments with an inflated membrane.

Exact quantum master equation via the calculus on path integrals

An exact quantum master equation formalism is constructed for the efficient evaluation of quantum non-Markovian dissipation beyond the weak system-bath interaction regime in the presence of time-dependent external field. A novel truncation scheme is further proposed and compared with other approaches to close the resulting hierarchically coupled equations of motion. The interplay between system-bath interaction strength, non-Markovian property, and required level of hierarchy is also demonstrated with the aid of simple spin-boson systems. (C) 2005 American Institute of Physics.

An automata theoretic decision procedure for the propositional mu-calculus

The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the propositional dynamic logic of Fischer and Ladner, the infinite looping construct of Streett, and the game logic of Parikh. We give an elementary time decision procedure, using a reduction to the emptiness problem for automata on infinite trees. A small model theorem is obtained as a corollary.

a higher-order duration calculus and its completeness

National Natural Science Foundation of China; Public Administration and Civil Service Bureau of Macau SAR; Companhia de Telecomunicacoes de Macau S.A.R.L.; Macau SAR Government Tourist Office