Spontaneous decay of an excited atom placed near a rectangular plate

Using the Born expansion of the Green tensor, we consider the spontaneous decay rate of an excited atom placed in the vicinity of a rectangular plate. We discuss the limitations of the commonly used simplifying assumption that the plate extends to infinity in the lateral directions and examine the effects of the atomic dipole moment orientation, atomic position, and plate boundary and thickness on the atomic decay rate. In particular, it is shown that in the boundary region, the spontaneous decay rate can be strongly modified.Comment: 5 pages, 5 figure

Comparison of Hirs' equation of Moody's equation for determining rotordynamic coefficients of annular pressure seals

The rotordynamic coefficients of an incompressible-flow annular pressure seal were determined using a bulk-flow model in conjunction with two different friction factor relationships. The first, Hirs' equation, assumes the friction factor is a function of Reynolds number only. The second, Moody's equation, approximates Moody's diagram and assumes the friction factor is a function of both Reynolds number and relative roughness. For each value of relative roughness, Hirs' constants were determined so that both equations gave the same magnitude and slope of the friction factor. For smooth seals, both relationships give the same results. For rough seals (e/2 H sub 0 = 0.05) Moody's equation predicts 44% greater direct stiffness, 35% greater cross-coupled stiffness, 19% smaller cross-coupled damping, 59% smaller cross-coupled inertia, and nominally the same direct damping and direct inertia

Output Reachable Set Estimation and Verification for Multi-Layer Neural Networks

In this paper, the output reachable estimation and safety verification problems for multi-layer perceptron neural networks are addressed. First, a conception called maximum sensitivity in introduced and, for a class of multi-layer perceptrons whose activation functions are monotonic functions, the maximum sensitivity can be computed via solving convex optimization problems. Then, using a simulation-based method, the output reachable set estimation problem for neural networks is formulated into a chain of optimization problems. Finally, an automated safety verification is developed based on the output reachable set estimation result. An application to the safety verification for a robotic arm model with two joints is presented to show the effectiveness of proposed approaches.Comment: 8 pages, 9 figures, to appear in TNNL

The complexity of equivalence problems for commutative grammars

In this paper we investigate the computational complexity of the inequivalence problems for commutative grammars. We show that the inequivalence problems for type 0 and context-sensitive commutative grammars are undecidable whereas decidability in nondeterministic exponential-time holds for the classes of regular and context-free commutative grammars. For the latter the inequivalence problems are Σp2-hard