Corrosion and inhibition of aged 347 grade stainless steel boiler tubes

General and pitting corrosion of both service and laboratory aged 347 grade stainless steel superheater tubes have been investigated. SEM analysis showed the precipitate phases to have a double structure consisting of phase and carbide. EDA analysis of the precipitates indicated the [Cr]/[Fe] ratio to increase with exposure time. For both set of specimens, the general corrosion rate in 1m H₂SO₄ increased with aging whilst the pitting studies (in 3.5% NaCl) also indicated increased pitting susceptibility with aging. These trends are consistent with corrosion from the chromium depleted areas adjacent to the precipitates. Methoxypropylamine is effective as an inhibitor for pitting corrosion and the concentration required to prevent this form of attack increases with exposure time for both types of specimens.     

The role of Al in C-S-H: NMR, XRD, and compositional results for precipitated samples

X-ray diffraction, compositional analysis, and ²⁹Si and ²⁷Al MAS NMR spectroscopy of Al-substituted tobermorite-type C-S-H made by precipitation from solution provide significant new insight into the structural mechanisms of Al-substitution in this important and complicated phase. Al occurs in 4-, 5-, and 6-coordination (Al[4], Al[5], and Al[6]) and plays multiple structural roles. Al[4] occurs on the bridging tetrahedra of the drierkette Al-silicate chains, and Al[5] and Al[6] occur in the interlayer and perhaps on particle surfaces. Al does not enter either the central Ca-O sheet or the pairing tetrahedra of the tobermorite-type layers. Al[4] occurs on three types of bridging sites, Q³ sites that bridge across the interlayer; Q² sites that are charge balanced by interlayer Ca⁺², Na⁺, or H⁺; and Q² sites that are most likely charge balanced by interlayer or surface Al[5] and Al[6] through Al[4]-O-Al[5,6] linkages. Although the data presented here are for relatively well-crystallized tobermorite-type C-S-H with C/S ratios ≤ 1.2, comparable spectral features for hydrated white cement pastes in previously published papers[30], [31] and [32] [M.D. Andersen, H.J. Jakobsen, J. Skibsted, Incorporation of aluminum in the calcium silicate hydrate (C-S-H) of hydrated Portland cements: a high-field ²⁷Al and ²⁹Si MAS NMR investigation Inorg. Chem. 42 (2003) 2280-2287; M.D. Andersen, H.J. Jakobsen, J. Skibsted, Characterization of white Portland cement hydration and the C-S-H structure in the presence of sodium aliminate by ²⁷Al and ²⁹Si MAS NMR spectroscopy, Cem. Concr. Res. 43 (2004) 857-868; M.D. Andersen, H. J. Jakobsen, J. Skibsted, A new aluminum-hydrate phase in hydrated Portland cements characterized by ²⁷Al and ²⁹Si MAS NMR spectroscopy, Cem. Concr. Res., submitted for publication.] indicate the presence of similar structural environments in the C-S-H of such pastes, and by implication OPC pastes.     

Multi-party quantum private comparison protocol with n-level entangled states

In this paper, two multi-party quantum private comparison (MQPC) protocols are proposed in distributed mode and traveling mode, respectively. Compared with the first MQPC protocol, which pays attention to compare between arbitrary two participants, our protocols focus on the comparison of equality for \(n\) participants with a more reasonable assumption of the third party. Through executing our protocols once, it is easy to get if \(n\) participants’ secrets are same or not. In addition, our protocols are proved to be secure against the attacks from both outside attackers and dishonest participants.     

Graft polymerization of acrylic acid onto polyphenylene sulfide nonwoven initiated by low temperature plasma

Graft copolymerization of acrylic acid (AA) onto polyphenylene sulfide (PPS) nonwoven initiated by low temperature plasma was studied. The effects of various conditions on graft reaction and the grafting rate were investigated. SEM images showed that PPS nonwoven was grafted, and the graft copolymerization only occurred on the surface of PPS. It may be due to the chain transference going with the graft copolymerization. It was found that with the increasing of plasma power, treatment time, space between electrodes, monomer concentration, and temperature of graft polymerization, the grafting rate increased at first, went to the top, and then decreased. The PPS nonwoven surface graft reaction could be optimized by the following processing conditions: 120 s of plasma treatment time, 50 W of plasma power, 1.5 cm of space between electrodes, 30% (w/w) of monomer concentration, and 50°C of temperature of graft polymerization. Measurement of XPS showed that the peak of C1s of graft polyacrylic acid was existed, and the peak area increased with the increase of the grafting rate. © 2006 Wiley Periodicals, Inc. J Appl Polym Sci 102: 5884–5889, 2006     

α—呋喃丙酸酯香料的合成研究

以糠醛为原料 ,通过三步反应合成了α-呋喃丙酸甲酯、乙酯、正丙酯、异丙酯、正丁酯、正戊酯等六种呋喃丙酸酯香料。此外 ,通过正交实验对呋喃丙酸甲酯的合成条件进行了优化。     

An alternate quantum adiabatic evolution for the Deutsch–Jozsa problem

Deutsch–Jozsa algorithm has been implemented via quantum adiabatic evolutions by Das et al. (Phys Rev A 65:062310, 2002) and Wei et al. (Phys Lett A 354:271, 2006). In the latter literature, the authors have shown a modified version of the adiabatic evolution which can improve the performance of the algorithm of S. Das et al’s to constant time. In this paper, we also improve the algorithm of S. Das et al’s in a constant time but by using a different construction of adiabatic evolution, i.e., adding ancillary qubits. The algorithm in this paper provides an alternative option to potential users.     

Optimality of partial adiabatic search and its circuit model

In this paper, we first uncover a fact that a partial adiabatic quantum search with \(O(\sqrt{N/M})\) time complexity is in fact optimal, in which \(N\) is the total number of elements in an unstructured database, and \(M\) ( \(M\ge 1\) ) of them are the marked ones(one) \((N\gg M)\) . We then discuss how to implement a partial adiabatic search algorithm on the quantum circuit model. From the implementing procedure on the circuit model, we can find out that the approximating steps needed are always in the same order of the time complexity of the adiabatic algorithm.     

Flexible protocol for quantum private query based on B92 protocol

Jakobi et al. for the first time proposed a novel and practical quantum private query (QPQ) protocol based on SARG04 (Scarani et al. in Phys Rev Lett 92:057901, 2004) quantum key distribution protocol (Jakobi et al. in Phys Rev A 83:022301, 2011). Gao et al. generalized Jakobi et al’s protocol and proposed a flexible QPQ protocol (Gao et al. in Opt Exp 20(16):17411–17420, 2012). When $\theta <\pi /4$ , Gao et al’s protocol exhibits better database security than Jakobi et al’s protocol, but has a higher probability with which Bob can correctly guess the address of Alice’s query. In this paper, we propose a flexible B92-based QPQ protocol. Although SARG04 protocol is a modification of B92 protocol and can be seen as a generalization of B92 protocol, our protocol shows different advantages from Gao et al’s protocol. It can simultaneously obtain better database security and a lower probability with which Bob can correctly guess the address of Alice’s query when $\theta <\pi /4$ . By introducing entanglement, the proposed QPQ protocol is robust against channel-loss attack, which also implies lower classical communication complexity. Similar to Gao et al’s protocol, it is flexible, practical, and robust against quantum memory attack.     

Robust optimization of foam-filled thin-walled structure based on sequential Kriging metamodel

Deterministic optimization has been successfully applied to a range of design problems involving foam-filled thin-walled structures, and to some extent gained significant confidence for the applications of such structures in automotive, aerospace, transportation and defense industries. However, the conventional deterministic design could become less meaningful or even unacceptable when considering the perturbations of design variables and noises of system parameters. To overcome this drawback, a robust design methodology is presented in this paper to address the effects of parametric uncertainties of foam-filled thin-walled structure on design optimization, in which different sigma criteria are adopted to measure the variations. The Kriging modeling technique is used to construct the corresponding surrogate models of mean and standard deviation for different crashworthiness criteria. A sequential sampling approach is introduced to improve the fitness accuracy of these surrogate models. Finally, a gradient-based sequential quadratic program (SQP) method is employed from 20 different initial points to obtain a quasi-global robust optimum solution. The optimal solutions were verified by using the Monte Carlo simulation. The results show that the presented robust optimization method is fairly effective and efficient, the crashworthiness and robustness of the foam-filled thin-walled structure can be improved significantly.     

Toward inference attacks for k-anonymity

Current research still cannot effectively prevent an inference attacker from inferring privacy information for k-anonymous data sets. To solve the issue, we must first study all kinds of aggressive reasoning behaviors and process for the attacker thoroughly. Our work focuses on describing comprehensively the inference attack and analyzing their privacy disclosures for k-anonymous data sets. In this paper, we build up a privacy inference graph based on attack graph theory, which is an extension of attack graph. The privacy inference graph describes comprehensively the inference attack in k-anonymous databases by considering attacker background knowledge and external factors. In the privacy inference graph, we introduce a concept of valid inference path to analyze the privacy disclosures in face of inference attack. According to both above, we design an algorithm to compute the n-valid inference paths. These paths can deduce some privacy information resulting in privacy disclosure. Moreover, we study the optimal privacy strategies to resist inference attack by key attribute sets and valid inference paths in the attack graph. An approximate algorithm is designed to obtain the approximate optimal privacy strategy set. At last, we prove the correctness in theory and analyze the performance of the approximate algorithm and their time complexity.