Scan cell reordering to minimize peak power during test cycle: A graph theoretic approach

Scan circuit is widely practiced DFT technology. The scan testing procedure consist of state initialization, test application, response capture and observation process. During the state initialization process the scan vectors are shifted into the scan cells and simultaneously the responses captured in last cycle are shifted out. During this shift operation the transitions that arise in the scan cells are propagated to the combinational circuit, which inturn create many more toggling activities in the combinational block and hence increases the dynamic power consumption. The dynamic power consumed during scan shift operation is much more higher than that of normal mode operation.

Fuel Cell Efficiency Redefined; Carnot Limit Reassessed

There are deficiencies in current definition of thermodynamic efficiency of fuel cells (ηcth = ΔG/ΔH); efficiency greater than unity is obtained when AS for the cell reaction is positive, and negative efficiency is obtained for endothermic reactions. The origin of the flow is identified. A new definition of thennodynamic efficiency is proposed that overcomes these limitations. Consequences of the new definition are examined. Against the conventional view that fuel cells are not Carnot limited, several recent articles have argued that the second law of thermodynamics restricts fuel cell energy conversion in the same way as heat engines. This controversy is critically examined. A resolution is achieved in part from an understanding of the contextual assumptions in the different approaches and in part from identifying some conceptual limitations.

Quantum fidelity for one-dimensional Dirac fermions and two-dimensional Kitaev model in the thermodynamic limit

We study the scaling behavior of the fidelity (F) in the thermodynamic limit using the examples of a system of Dirac fermions in one dimension and the Kitaev model on a honeycomb lattice. We show that the thermodynamic fidelity inside the gapless as well as gapped phases follow power-law scalings, with the power given by some of the critical exponents of the system. The generic scaling forms of F for an anisotropic quantum critical point for both the thermodynamic and nonthermodynamic limits have been derived and verified for the Kitaev model. The interesting scaling behavior of F inside the gapless phase of the Kitaev model is also discussed. Finally, we consider a rotation of each spin in the Kitaev model around the z axis and calculate F through the overlap between the ground states for the angle of rotation eta and eta + d eta, respectively. We thereby show that the associated geometric phase vanishes. We have supplemented our analytical calculations with numerical simulations wherever necessary.

Quantum fidelity for one-dimensional Dirac fermions and two-dimensional Kitaev model in the thermodynamic limit

We study the scaling behavior of the fidelity (F) in the thermodynamic limit using the examples of a system of Dirac fermions in one dimension and the Kitaev model on a honeycomb lattice.We show that the thermodynamic fidelity inside the gapless as well as gapped phases follow power-law scalings, with the power given by some of the critical exponents of the system. The generic scaling forms of F for an anisotropic quantum critical point for both the thermodynamic and nonthermodynamic limits have been derived and verified for the Kitaev model. The interesting scaling behavior of F inside the gapless phase of the Kitaev model is also discussed. Finally, we consider a rotation of each spin in the Kitaev model around the z axis and calculate F through the overlap between the ground states for the angle of rotation η and η + dη, respectively. We thereby show that the associated geometric phase vanishes. We have supplemented our analytical calculations with numerical simulations wherever necessary

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.