Failure Investigation of Boiler Water Wall Tubes of a Thermal Power Station

Failure investigation was carried out on boiler water wall tubes of a thermal power plant through visual inspection, chemical analysis, and metallurgical analysis. Failure was in the form of thin/micro cracks along the length of the tubes which were located at the girth welding joint of tubes. Experimental results revealed that the cracking was from inward to outward of the tube thickness. Discontinuities/cavities were observed in the welded region which might have occurred due to lack of fusion of base metal and the weld metal. Cracks were initiated from the sharp corner/crack tip of the cavities/discontinuities present at the welded region under the action of hoop/thermal stress existed during the operation. Nature of the crack propagation indicates the case of typical hydrogen-induced cracking. Moreover, the presence of the cavities/discontinuities reduced the cross-sectional area of tubes resulting increased stress intensity. Increased stress beyond the flow stress of the material assisted by hydrogen-induced effect resulted the cracking of the tubes. In order to mitigate the problem, proper welding of tubes joints should be carried out followed by proper inspection after weld. Secondly, hydrogen dissolution during welding should be prevented and treatment for its removal after welding should be carried out.     

Metallurgical Investigation of the Collapsed Front Structure of a Dragline in a Coal Mine

Journal of Failure Analysis and Prevention - A dragline is the largest mobile equipment on earth, and it is called the “kingpin” of any mine site. In this present investigation, a case...     

DNF sparsification and a faster deterministic counting algorithm

Given a DNF formula f on n variables, the two natural size measures are the number of terms or size s(f) and the maximum width of a term w(f). It is folklore that small DNF formulas can be made narrow: if a formula has m terms, it can be ${\epsilon}$ -approximated by a formula with width ${{\rm log}(m/{\epsilon})}$ . We prove a converse, showing that narrow formulas can be sparsified. More precisely, any width w DNF irrespective of its size can be ${\epsilon}$ -approximated by a width w DNF with at most ${(w\, {\rm log}(1/{\epsilon}))^{O(w)}}$ terms. We combine our sparsification result with the work of Luby & Velickovic (1991, Algorithmica 16(4/5):415–433, 1996) to give a faster deterministic algorithm for approximately counting the number of satisfying solutions to a DNF. Given a formula on n variables with poly(n) terms, we give a deterministic ${n^{\tilde{O}({\rm log}\, {\rm log} (n))}}$ time algorithm that computes an additive ${\epsilon}$ approximation to the fraction of satisfying assignments of f for ${\epsilon = 1/{\rm poly}({\rm log}\, n)}$ . The previous best result due to Luby and Velickovic from nearly two decades ago had a run time of ${n^{{\rm exp}(O(\sqrt{{\rm log}\, {\rm log} n}))}}$ (Luby & Velickovic 1991, in Algorithmica 16(4/5):415–433, 1996).     

The Complexity of Boolean Functions in Different Characteristics

Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one characteristic affects its complexity in other characteristics. We establish the following general principle: functions with low degree modulo p must have high complexity in every other characteristic q. More precisely, we show the following results about Boolean functions f : {0, 1}ⁿ → {0, 1} which depend on all n variables, and distinct primes p, q:

Algorithms for Modular Counting of Roots of Multivariate Polynomials

Given a multivariate polynomial P(X ₁,…,X _n ) over a finite field , let N(P) denote the number of roots over . The modular root counting problem is given a modulus r, to determine N _r (P)=N(P)mod r. We study the complexity of computing N _r (P), when the polynomial is given as a sum of monomials. We give an efficient algorithm to compute N _r (P) when the modulus r is a power of the characteristic of the field. We show that for all other moduli, the problem of computing N _r (P) is -hard. We present some hardness results which imply that our algorithm is essentially optimal for prime fields. We show an equivalence between maximum-likelihood decoding for Reed-Solomon codes and a root-finding problem for symmetric polynomials. P. Gopalan’s and R.J Lipton’s research was supported by NSF grant CCR-3606B64. V. Guruswami’s research was supported in part by NSF grant CCF-0343672 and a Sloan Research Fellowship.     

Design of mixed energy‐integrated batch process networks by Pseudo‐direct approach

In this article, a novel framework for the design of mixed (combined direct and indirect) integration for batch process systems is presented. The framework is based on the concept of pseudo‐direct energy integration (PDEI) which reformulates indirect integration as direct integration using pseudo‐process streams. Two algorithms are presented to achieve energy integration for batch processes operating cyclically (in a campaign mode). The first algorithm targets maximization of energy recovery and overcomes the limitations of some of the existing contributions for design of mixed integrated systems. The second algorithm provides a network reduction methodology to generate a cadre of integrated designs while exploring the trade‐off between capital (number of heat exchangers and storage units) and operating costs (utility consumption). The proposed framework is illustrated using a benchmark example of two hot and two cold streams. © 2017 American Institute of Chemical Engineers AIChE J, 63: 55–67, 2018