Nunierically stable and computationally efficient Power System Statc Estimation (PSSE) algorithms are designed using Orthogonalization (QR decomposition) approach. They u3e Givens rotations for orthogonalization which enables sparsity exploitation during factorization of large sparse auginentecl Ja,cobian. Apriori row and column ordering is usiially performed to reduce intermediate a.nd and ove...

Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. While st-orderings do extend to directed graphs, especially planar st-graphs, they do not offer the same properties as canonical orderings. In this work we extend the so called bitonic st-orderings to directed graphs. We...

An ordering method and accompanying factorization for the direct solution of saddlepoint matrices is presented. A simple constraint on ordering together with an assumption on the rank of parts of the matrix are sufficient to guarantee the existence of the LDLT factorization, stability concerns aside. In fact, D may be taken to be a diagonal matrix with ±1 along the diagonal, and be fully determ...

This paper describes a technique for re-ordering of scan cells to minimize power dissipation that is also capable of reducing the area overhead of the circuit compared to a random ordering of the scan cells. For a given test set, our proposed greedy algorithm finds the (locally) optimal scan cell ordering for a given value of λ, which is a trade-off parameter that can be used by the designer to...

The effect of lattice mismatch on the chemical ordering of epitaxial FePt films was studied. The results showed that the lattice constant scd of the FePt films decreased with increasing lattice mismatch « from about 2.23% to 6.33%. Upon further increase of « to about 8.8%, c increased. On the other hand, the variation of the lattice constant sad of the FePt films showed a reversal behavior to t...

The concept of upper and lower semicontinuity of fuzzy mappings introduced by Bao and Wu [Y.E. Bao, C.X. Wu, Convexity and semicontinuity of fuzzy mappings, Comput. Math. Appl., 51 (2006) 1809–1816] is redefined by using the concept of parameterized triples of fuzzy numbers. On the basis of the linear ordering of fuzzy numbers proposed by Goetschel and Voxman [R. Goetschel, W. Voxman, Elementar...

A key issue for high integration circuit design in the semiconductor industry are power constraints that stem from the need for heat removal and reliability or battery lifetime limitations. As the power consumption depends heavily on the capacitances between adjacent wires, determining the optimal ordering and spacing of parallel wires is an important issue in the design of low power chips. As ...

The linear ordering problem consists in finding a linear order at minimum remoteness from a weighted tournament T, the remoteness being the sum of the weights of the arcs that we must reverse in T to transform it into a linear order. This problem, also known as the search of a median order, or of a maximum acyclic subdigraph, or of a maximum consistent set, or of a minimum feedback arc set, is ...

method to obtain the minimum number of nodes in Reduced Ordered Binary Decision Diagrams (ROBDD). The proposed method uses the graph topology to find the best variable ordering. Therefore the input Boolean function is converted to a unidirectional graph. Three levels of graph parameters are used to increase the probability of having a good variable ordering. The initial level uses the total num...