A multi-tree routing scheme using acyclic orientations

We propose a mathematical model for fault-tolerant routing based on acyclic orientations, or acorns, of the underlying network G=(V,E). The acorn routing model applies routing tables that store the set of parent pointers associated with each out-neighborhood defined by the acorn. Unlike the standard single-parent sink-tree model, which is vulnerable to faults, the acorn model affords a full representation of the entire network and is able to dynamically route around faults. This fault tolerance is achieved when using the acorn model as a multi-tree generator for gathering data at a destination node, as well as an independent tree generator for global point-to-point communication. A fundamental fault-tolerant measure of the model is the capacity of an acorn, i.e., the largest integer k such that each vertex outside the neighborhood N(v) of the destination v has at least k parent pointers. A capacity-k acorn A to destination v is k-vertex fault-tolerant to v. More strongly, we show A supports a k independent sink-tree generator, i.e., the parent pointers of each vertex w V−N(v) can be partitioned into k nonempty classes labeled 1,2,…,k such that any set of sink trees T₁,T₂,…,T_k are pairwise independent, where tree T_i is a sink tree generated by parent pointers labeled i together with the parent pointers into v. We present an linear time optimization algorithm for finding an acorn A of maximum capacity in graphs, based upon a minimax theorem. We also present efficient algorithms that label the parent pointers of capacity-k acorn A, yielding a k-independent sink tree generating scheme.     

Efficient enumeration of all minimal separators in a graph

This paper presents an efficient algorithm for enumerating all minimal a-b separators separating given non-adjacent vertices a and b in an undirected connected simple graph G = (V, E), Our algorithm requires O(n³R_ab) time, which improves the known result of O(n⁴R_ab) time for solving this problem, where ¦V¦= n and R_ab is the number of minimal a-b separators. The algorithm can be generalized for enumerating all minimal A-B separators that separate non-adjacent vertex sets A, B < V, and it requires O(n²(n − n_A − n_b)R_AB) time in this case, where n_a = ¦A¦, n_B = ¦B¦ and r_AB is the number of all minimal A−B separators. Using the algorithm above as a routine, an efficient algorithm for enumerating all minimal separators of G separating G into at least two connected components is constructed. The algorithm runs in time O(n³R⁺_Σ + n⁴R_Σ), which improves the known result of O(n⁶R_Σ) time, where R_σ is the number of all minimal separators of G and R_ΣR⁺_Σ = ∑_1i, v_j) ER_vivj n − 1)/2 − m)R_Σ. Efficient parallelization of these algorithms is also discussed. It is shown that the first algorithm requires at most O((n/log n)R_ab) time and the second one runs in time O((n/log n)R⁺_Σ+n log nR_Σ) on a CREW PRAM with O(n³) processors.     

On a nonlinear iterative method in applied mechanics, part II

In Part I of this paper, a particular iterative method used in applied mechanics is shown to belong to a general class of methods termed SOR-Newton-(m_k) iterative methods. The purpose here is to make a case study of the method and compare its performance with Newton iteration and Newton-SOR iteration. The numerical experiments are designed to examine the range of convergence of the m_k = 1 step method, rates of convergence, and the effect of relaxation.     

Experimental numerical studies on a supercomputer of natural convection in an enclosure with localized heating

We present particle simulations of natural convection of a symmetrical, nonlinear, three-dimensional cavity flow problem. Qualitative studies are made in an enclosure with localized heating. The assumption is that particles interact locally by means of a compensating Lennard-Jones type force F, whose magnitude is given by −G/r^p + H/r^q.

In this formula, the parameters G, H, p, q depend upon the nature of the interacting particles and r is the distance between two particles. We also consider the system to be under the influence of gravity. Assuming that there are n particles, the equations relating position, velocity and acceleration at time t_k = kΔt, K = 0, 1, 2, …, are solved simultaneously using the “leap-frog” formulas. The basic formulas relating force and acceleration are Newton's dynamical equations F_i,k = m_ia_i,k, I = 1, 2, 3, …, n, where m_i is the mass of the ith particle.

Extensive and varied computations on a CRAY X - MP/24 are described and discussed, and comparisons are made with the results of others.     

A learning scheme for a fuzzy k-NN rule

The performance of a fuzzy k-NN rule depends on the number k and a fuzzy membership-array W[l,m_R], where l and m_R denote the number of classes and the number of elements in the reference set X_R respectively. The proposed learning procedure consists in iterative finding such k and W which minimize the error rate estimate by the leaving ‘leaving one out‘ method.     

Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations

The nonlinear projection methods are minimization procedures for solving systems of nonlinear equations. They permit reevaluation of n_k, 1 ≤ n_k ≤ n, components of the approximate solution vector at each iteration step where n is the dimension of the system. At iteration step k, the reduction in the norm of the residue vector depends upon the n_k components which are reevaluated. These n_k components are obtained by solving a linear system.

We present two algorithms for determining the components to be modified at each iteration of the nonlinear projection method and compare the use of these algorithms to Newton's method. The computational examples demonstrate that Newton's method, which reevaluates all components of the approximate solution vector at each iteration, can be accelerated by using the projection techniques.     

A complete algebraic solvability test for the nonstrict Lyapunov inequality

For arbitrary equally sized square complex matrices A and Q (Q Hermitian), the paper provides a complete algebraic test for verifying the existence of a Hermitian solution X of the nonstrict Lyapunov inequality A^*X + XA + Q 0. If existing, we exhibit how to construct a solution. Our approach involves the validation problem for the linear matrix inequality Σ_j=1^k (A_j^*X_jB_j + B_j^*X_j^*A_j) + Q> 0 in X_j, for which we provide an algebraic solvability test and a construct solutions if the kernels of A_j or, dually, those of B_j form an isotonic sequence.     

A simple solution to the l optimization problem

It is pointed out in this brief paper that the l¹ optimization problem min_{Q ε lqp¹} | H − U * Q * V |₁, H ε l_mn¹, U ε l_mq¹, V ε l_pn¹ can be solved in one step rather than two. The solution of the dual problem is obviated by the direct solution of the primal problem via linear programming. The method here is applicable to finite-dimensional problems or approximating finite-dimensional problems, in the general case.     

Least adaptive optimal search with unreliable tests

We consider the basic problem of searching for an unknown m-bit number by asking the minimum possible number of yes–no questions, when up to a finite number e of the answers may be erroneous. In case the (i+1)th question is adaptively asked after receiving the answer to the ith question, the problem was posed by Ulam and Rényi and is strictly related to Berlekamp's theory of error correcting communication with noiseless feedback. Conversely, in the fully non-adaptive model when all questions are asked before knowing any answer, the problem amounts to finding a shortest e-error correcting code. Let q_e(m) be the smallest integer q satisfying Berlekamp’s bound . Then at least q_e(m) questions are necessary, in the adaptive, as well as in the non-adaptive model. In the fully adaptive case, optimal searching strategies using exactly q_e(m) questions always exist up to finitely many exceptional m's. At the opposite non-adaptive case, searching strategies with exactly q_e(m) questions—or equivalently, e-error correcting codes with 2^m codewords of length q_e(m)—are rather the exception, already for e=2, and are generally not known to exist for e>2. In this paper, for each e>1 and all sufficiently large m, we exhibit searching strategies that use a first batch of m non-adaptive questions and then, only depending on the answers to these m questions, a second batch of q_e(m)−m non-adaptive questions. These strategies are automatically optimal. Since even in the fully adaptive case, q_e(m)−1 questions do not suffice to find the unknown number, and q_e(m) questions generally do not suffice in the non-adaptive case, the results of our paper provide e fault tolerant searching strategies with minimum adaptiveness and minimum number of tests.     

Finite element estimates of singularity powers for cracks terminating at finite width interfaces

Finite elements are used to estimate singularity powers for a crack tip perpendicularly terminating at a material interface. The influence of material stacking sequence upon singularity power estimates is considered as function of bond line width. The ratio of bond line elastic modulus (E₂) to that of the crack containing material (E₁) is used to define the various cases considered (m = E₂/E₁) The width of the bond line is found to have some influence upon singularity powers. It is found that for m < 1.0 the material stacking sequence has little effect upon singularity powers. Conversely, for m > 1.0 the material stacking sequence is found to have the most significant influence upon singularity powers as a function of bond line width. The variation of crack tip stresses for various material combinations and bond line widths is also considered.     

Lax-stability of fully discrete spectral methods via stability regions and pseudo-eigenvalues

In many calculations, spectral discretization in space is coupled with a standard ordinary differential equation formula in time. To analyze the stability of such a combination, one would like simply to test whether the eigenvalues of the spatial discretization operator (appropriately scaled by the time step k) lie in the stability region for the o.d.e. formula, but it is well known that this kind of analysis is in general invalid. In the present paper we rehabilitate the use of stability regions by proving that a discrete linear multistep ‘method of lines’ approximation to a partial differential equation is Lax-stable, within a small algebraic factor, if and only if all of the -pseudo-eigenvalues of the spatial discretization operator lie within O() of the stability region as → 0. An -pseudo-eigenvalue of a matrix A is any number that is an eigenvalue of some matrix A + E with E ; our arguments make use of resolvents and are closely related to the Kreiss matrix theorem. As an application of our general result, we show that an explicit N-point Chebyshev collocation approximation of u_t = −xu_x on [−1, 1] is Lax-stable if and only if the time step satisfies k = O(N⁻²), although eigenvalue analysis would suggest a much weaker restriction of the form k CN⁻¹.     

Séparateurs dans les mots infinis engendrés par morphismes

Let x be an infinite word on a finite alphabet A. For each position n, the separator of x at n is the smallest factor of x which begins at index n and that does not appear before in x. Let S_x be the function such that S_x(n) is the length of the separator of x at index n if it exists and otherwise 0.

We consider the problem of computing S_x in the case where x is generated by iterating a morphism σ : A* → A*. We prove the following theorem:     

Pole assignment for multi-input multi-output systems using output feedback

In this paper the problem of pole assignment using constant gain output feedback is studied for MIMO system with system order n > m + l − 1, where m and l are the number of inputs and outputs, respectively. A new procedure is presented to design a constant gain output feedback matrix which assigns (m + l − 2) poles exactly to the desired locations and shifts all the unassigned poles to suitable locations using root locus techniques.     

Lyapunov exponents of the logistic map with periodic forcing

The iterative map x_n+1 = r_nx_n (1 - x_n) is investigated with r_n changing periodically between two values A and B. Different periodicities are assumed, e.g., {r_n} = {BABA …} or {r_n} = {BBABA BBABA …}. The Lyapunov exponent (a measure of average stability) is displayed with high resolution on the A-B-plane. The resulting images have aesthetically appealing self-similar structures. Furthermore, these images allow with one glimpse the identification of a number of system properties: coexistence of attractors, superstable curves, order by alternation of chaotic processes, and chaos by periodic resetting from a stable into an unstable fixed point.     

Infinite words and biprefix codes

Let A be an alphabet and ƒ be a right infinite word on A. If ƒ is not ultimately periodic then there exists an infinite set {v_ii0} of (finite) words on A such that ƒ=v₀v₁…v_i…, {v_ii1} is a biprefix code and v_i≠v_j for positive integers i≠j.     

Computation of generalised inverse of a special class of matrices

The computation of the generalised Inverse A⁺ of matrix A depends critically of the rank of A and involves several matrix multiplications. It is shown here that if A is of the form where A_i are now vectors, then A⁺ can be computed efficiently and accurately by a simple algebraic method.     

New upper bounds on feedback vertex numbers in butterflies

Butterflies are undirected graphs of bounded degree. They are widely used as interconnection networks. In this paper we study the feedback vertex set problem for butterflies. We show that the feedback vertex set found by Luccio's algorithm [Inform. Process. Lett. 66 (1998) 59–64] for the k-dimensional butterfly B_k is of size . Besides, we propose an algorithm to find a feedback vertex set of size either or for B_k depending on whether k is even or odd.     

Computing LOGCFL certificates

The complexity class LOGCFL consists of all languages (or decision problems) which are logspace reducible to a context-free language. Since LOGCFL is included in AC¹, the problems in LOGCFL are highly parallelizable.

By results of Ruzzo (JCSS 21 (1980) 218), the complexity class LOGCFL can be characterized as the class of languages accepted by alternating Turing machines (ATMs) which use logarithmic space and have polynomially sized accepting computation trees. We show that for each such ATM M recognizing a language A in LOGCFL, it is possible to construct an L^LOGCFL transducer T_M such that T_M on input w A outputs an accepting tree for M on w. It follows that computing single LOGCFL certificates is feasible in functional AC¹ and is thus highly parallelizable.

Wanke (J. Algorithms 16 (1994) 470) has recently shown that for any fixed k, deciding whether the treewidth of a graph is at most k is in the complexity-class LOGCFL. As an application of our general result, we show that the task of computing a tree-decomposition for a graph of constant treewidth is in functional LOGCFL, and thus in AC¹.

We also show that the following tasks are all highly parallelizable: Computing a solution to an acyclic constraint satisfaction problem; computing an m-coloring for a graph of bounded treewidth; computing the chromatic number and minimal colorings for graphs of bounded tree- width.     

Paired-domination in inflated graphs

The inflation G_I of a graph G with n(G) vertices and m(G) edges is obtained from G by replacing every vertex of degree d of G by a clique K_d. A set S of vertices in a graph G is a paired dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The paired domination number γ_p(G) is the minimum cardinality of a paired dominating set of G. In this paper, we show that if a graph G has a minimum degree δ(G)2, then n(G)γ_p(G_I)4m(G)/[δ(G)+1], and the equality γ_p(G_I) = n(G) holds if and only if G has a perfect matching. In addition, we present a linear time algorithm to compute a minimum paired-dominating set for an inflation tree.