This paper presents a new method for synthesizing stochastic control Lyapunov functions for a class of nonlinear stochastic control systems. The technique relies on a transformation of the classical nonlinear Hamilton–Jacobi–Bellman partial differential equation to a linear partial differential equation for a class of problems with a particular constraint on the stochastic forcing. This linear ...

Geometric analysis can be said to originate in the 19’th century work of Weierstrass, Riemann, Schwarz and others on minimal surfaces, a problem whose history can be traced at least as far back as the work of Meusnier and Lagrange in the 18’th century. The experiments performed by Plateau in the mid-19’th century, on soap films spanning wire contours, served as an important inspiration for this...

A number of papers [1-7] have been presented to address the issues of multi-body mechanisms. Examples of their applications are found in gasoline and diesel engines, where the gas force acts on the slider and the motion is transmitted through the links. Whether the connecting rod is assumed to be rigid or not, the steady-state and dynamic responses of the connecting rod of the mechanism with ti...

The most widely used method for finding relationships between several quantities is multiple regression. This however is restricted to a single dependent variable. We present a more general method which allows models to be constructed with multiple variables on both sides of an equation and which can be computed easily using a spreadsheet program. The underlying principle (originating from cano...

The interest in using the pseudoelastic properties of NiTi wires in orthodontic practice arises chiefly from the expectation that they can afford low continuous forces at constant temperature. The reversion force developed by NiTi archwires depends, however, upon temperature since the superelastic force follows a Clausius-Clapeyron like equation. Actually the oral environment temperature is mod...

Randomly-generated constraint satisfaction problems go through a phase transition as the constraint tightness varies. Loose constraints give an `easy-soluble' region, where problems have many solutions and are almost always easy to solve. However, in this region, systematic search algorithms may occasionally encounter problems which are extremely expensive to solve. It has been suggested that i...

This paper addresses the problem of generating strong convex relaxations of Mixed Integer Quadratically Constrained Programming (MIQCP) problems. MIQCP problems are very difficult because they combine two kinds of non-convexities: integer variables and nonconvex quadratic constraints. To produce strong relaxations of MIQCP problems, we use techniques from disjunctive programming and the liftand...

This paper addresses the problem of generating strong convex relaxations of Mixed Integer Quadratically Constrained Programming (MIQCP) problems. MIQCP problems are very difficult because they combine two kinds of non-convexities: integer variables and non-convex quadratic constraints. To produce strong relaxations of MIQCP problems, we use techniques from disjunctive programming and the lift-a...