In this paper we analyze a variant of the n-disk Towers of Hanoi problem with an arbitrary starting and ending configuration using transition graphs representing valid configurations. In particular, we show that starting with any configuration, there is a sequence of moves that goes through each valid configuration exactly once and back to the starting configuration. Also, we show how the origi...

This article deals with the starting and stopping problem under Knightian uncertainty, i.e., roughly speaking, when the probability under which the future evolves is not exactly known. We show that the lower price of a plant submitted to the decisions of starting and stopping is given by a solution of a system of two reflected backward stochastic differential equations (BSDEs for short). We sol...

in this paper, construction rules of the root locus of a positive feedback system whose loop transfer function is not strictly proper have been investigated. the root locus method is being used since 1950. it is demonstrated that some of the steps in this technique are not general and for a positive feedback system whose loop transfer function is not strictly proper are not valid. to overcome t...

lent, considered by many to be one of the best sailing areas in the country, provided an opportunity not to be missed. Although my initial trip out was in a yacht, most of my early experience was in dinghies less expensive to buy and to repair if damaged. The first dinghy I shared was with three other equally inexperienced friends. We bought a 14 foot fibre glass family dinghy through Exchange ...

When it is not actively transporting cargo, conventional Kinesin-1 is present in the cytoplasm in a folded conformation that cannot interact effectively with microtubules (MTs). Two important and largely unexplored aspects of kinesin regulation are how it is converted to an active species when bound to cargo and the related issue of how kinesin discriminates among its many potential cargo molec...

The second-order cone programming problem is reformulated into several new systems of nonlinear equations. Assume the perturbation of the data is in a certain neighborhood of zero. Then starting from a solution to the old problem, the semismooth Newton’s iterates converge Q-quadratically to a solution of the perturbed problem. The algorithm is globalized. Numerical examples show that the algori...