It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

the traditional event tree analysis uses a single probability to represent each top event. however, it is unrealistic to evaluate the occurrence of each event by using a crisp value without considering the inherent uncertainty and imprecision a state has. the fuzzy set theory is universally applied to deal with this kind of phenomena. the main purpose of this study is to construct an easy metho...

We develop the Q method for the Second Order Cone Programming problem. The algorithm is the adaptation of the Q method for semidefinite programming originally developed by Alizadeh, Haeberly and Overton, [3] and [2]. We take advantage of the special algebraic structure associated with second order cone programs to formulate the Q method. Furthermore we prove that our algorithm is globally conve...

The Hodgkin-Huxley model of nerve pulse propagation relies on ion currents through specific resistors called ion channels. We discuss a number of classical thermodynamic findings on nerves that are not contained in this classical theory. Particularly striking is the finding of reversible heat changes, thickness and phase changes of the membrane during the action potential. Data on various nerve...

The importance of shea tree to the people of south-western Nigeria cannot be over emphasized considering both the economic and environmental uses of the tree. However, efforts have not been made to propagate its production by the farmers as the shea tree still grows in the wild state. It would be worthwhile to investigate farmers’ perception of shea nut tree as an economic tree and their attitu...

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

We discuss several different search directions which can be used in primal-dual interior-point methods for semidefinite programming problems and investigate their theoretical properties, including scale invariance, primal-dual symmetry, and whether they always generate well-defined directions. Among the directions satisfying all but at most two of these desirable properties are the Alizadeh-Hae...

In this paper we discuss the problem of computing the H∞-norm of transfer functions associated to large-scale descriptor systems. We exploit the relationship between the H∞-norm and the structured complex stability radius of a corresponding matrix pencil. To compute the structured stability radius we consider so-called structured pseudospectra. Namely, we have to find the pseudospectrum touchin...

We present two new algorithms for investigating the stability of large and sparse matrices subject to real perturbations. The first algorithm computes the real structured pseudospectral abscissa and is based on the algorithm for computing the pseudospectral abscissa proposed by Guglielmi and Overton [SIAM J. Matrix Anal. Appl., 32 (2011), pp. 1166-1192]. It entails finding the rightmost eigenva...