Transition point dynamic programming (TPDP) is a memorybased, reinforcement learning, direct dynamic programming approach to adaptive optimal control that can reduce the learning time and memory usage required for the control of continuous stochastic dynamic systems. TPDP does so by determining an ideal set of transition points (TPs) which specify only the control action changes necessary for o...

A biocompatible microemulsion system comprising of isopropyl myristate (IPM) as oil, tween 80 as a non-ionic surfactant and isobuthanol as co-surfactant was studied experimentally at 298.15 K. The pseudo-ternary phase diagram for the microemulsion system has been delineated at different surfactant to co-surfactant mass ratio of 1:1, 2.4:1 and 4:1. Some physico-chemical properties such as densit...

one of the basic subjects in political sociology of every society is the nature of stat in that society. the states have different economical social culture and political nature. the essay studies the political nature of the state in studies the political nature of the state in iran during pahlavi period , from the view point of transition to democracy. the aim of study the political nature of ...

bubble column reactors are used in a wide variety of applications such as multiphase bioreactors, catalytic slurry reactors, and absorption processes. the superficial gas velocity-gas holdup relationship and transition point are two important parameters for characterizing the hydrodynamics of a bubble column reactor. in this study, systematic investigation of a nitrogen - water - glass beads bu...

We study the effects of dissipation on photoisomerization (PI). The result suggests the existence of two types of environment depending on whether it entangles with the molecule. With entanglement there is a quantum phase transition between a state where PI persists, to a state where PI is quenched by the environment. Without entanglement, the environment only quantitatively modifies the PI beh...

We present an inductive characterization for an invariant to stand in a given finite-state transition system. We show how this characterization can be computed by means of BDD-based operations, without performing a fixpoint iteration over sets of states as the CTL symbolic model checking algorithm does.