Searcharxiv⌕ Search

arXiv subjects

Jie Hou

Publications and source records attributed to Jie Hou.

49 records · Page 3Linked to original sources

Hydrogen clustering in bcc metals: atomic origin and strong stress anisotropy

Hydrogen (H) induced damage in metals has been a long-standing woe for many industrial applications. One form of such damage is linked to H clustering, for which the atomic origin remains contended, particularly for non-hydride forming metals. In this work, we systematically studied H clustering behavior in bcc metals represented by W, Fe, Mo, and Cr, combining first-principles calculations, atomistic and Monte Carlo simulations. H clustering has been shown to be energetically favorable, and can be strongly facilitated by anisotropic stress field, dominated by the tensile component along one of the <001> crystalline directions. We showed that the stress effect can be well predicted by the continuum model based on H formation volume tensor, and that H clustering is thermodynamically possible at edge dislocations, evidenced by nanohydride formation at rather low levels of H concentration. Moreover, anisotropy in the stress effect is well reflected in nanohydride morphology around dislocations, with nanohydride growth occurring in the form of thin platelet structures that maximize one <001> tension. In particular, the <001> type edge dislocation, with the <001> tensile component maximized, has been shown to be highly effective in facilitating H aggregation, thus expected to play an important role in H clustering in bcc metals, in close agreement with recent experimental observations. This work explicitly and quantitatively clarifies the anisotropic nature of stress effect on H energetics and H clustering behaviors, offering mechanistic insights critical towards understanding H-induced damages in metals.

cond-mat.mtrl-sci↗

Accurate prediction of nanovoid structures and energetics in bcc metals

Knowledge on structures and energetics of nanovoids is fundamental to understand defect evolution in metals. Yet there remain no reliable methods able to determine essential structural details or to provide accurate assessment of energetics for general nanovoids. Here, we performed systematic first-principles investigations to examine stable structures and energetics of nanovoids in bcc metals, explicitly demonstrated the stable structures can be precisely determined by minimizing their Wigner-Seitz area, and revealed a linear relationship between formation energy and Wigner-Seitz area of nanovoids. We further developed a new physics-based model to accurately predict stable structures and energetics for arbitrary-sized nanovoids. This model was well validated by first-principles calculations and recent nanovoid annealing experiments, and showed distinct advantages over the widely used spherical approximation. The present work offers mechanistic insights that crucial for understanding nanovoid formation and evolution, being a critical step towards predictive control and prevention of nanovoid related damage processes in structural metals.

cond-mat.mtrl-sci↗

Improvements of computational ghost imaging by using Special-Hadamard patterns

We introduced a new kind of patterns named Special-Hadamard patterns, which could be used as structured illuminations of computational ghost imaging. Special-Hadamard patterns can get a better image quality than Hadamard patterns in a noisy environment. We can completely reconstruct the original object in a noiseless environment by using Special-Hadamard patterns, and the size of object also can be adjusted arbitrarily, these advantages cannot be achieved by other common patterns. We also performed simulations to compare the results of Special Hadamard patterns with the results of Hadamard patterns. We found Special Hadamard patterns can greatly improve the image quality of computational ghost imaging.

eess.IV↗

Predictive Model of Hydrogen Trapping and Bubbling in Nanovoids in BCC Metals

Interplay between hydrogen and nanovoids, despite long-recognized as a central aspect in hydrogen-induced damages in structural materials, remains poorly understood. Focusing on tungsten as a model BCC system, the present study, for the first time, explicitly demonstrated sequential adsorption of hydrogen adatoms on Wigner-Seitz squares of nanovoids with distinct energy levels. Interaction between hydrogen adatoms on the nanovoid surface is shown to be dominated by pairwise power law repulsion. A predictive model was established for quantitative prediction of configurations and energetics of hydrogen adatoms in nanovoids. This model, further combined with equation of states of hydrogen gas, enables prediction of hydrogen molecule formation in nanovoids. Multiscale simulations based on the predictive model were performed, showing excellent agreement with experiments. This work clarifies fundamental physics and provides full-scale predictive model for hydrogen trapping and bubbling in nanovoids, offering long-sought mechanistic insights crucial for understanding hydrogen-induced damages in structural materials.

cond-mat.mtrl-sci↗

A Brand-level Ranking System with the Customized Attention-GRU Model

In e-commerce websites like Taobao, brand is playing a more important role in influencing users' decision of click/purchase, partly because users are now attaching more importance to the quality of products and brand is an indicator of quality. However, existing ranking systems are not specifically designed to satisfy this kind of demand. Some design tricks may partially alleviate this problem, but still cannot provide satisfactory results or may create additional interaction cost. In this paper, we design the first brand-level ranking system to address this problem. The key challenge of this system is how to sufficiently exploit users' rich behavior in e-commerce websites to rank the brands. In our solution, we firstly conduct the feature engineering specifically tailored for the personalized brand ranking problem and then rank the brands by an adapted Attention-GRU model containing three important modifications. Note that our proposed modifications can also apply to many other machine learning models on various tasks. We conduct a series of experiments to evaluate the effectiveness of our proposed ranking model and test the response to the brand-level ranking system from real users on a large-scale e-commerce platform, i.e. Taobao.

cs.IR↗

Hydrogen bubble nucleation by self-clustering: Density Functional Theory and statistical models studies using tungsten as a model system

Low-energy hydrogen irradiation is known to induce bubble formation in tungsten, while its atomistic mechanisms remain little understood. Using first-principles calculations and statistical models, we studied the self-clustering behavior of hydrogen in tungsten. Unlike previous speculations that hydrogen self-clusters are energetically unstable owing to the general repulsion between two hydrogens, we demonstrated that hydrogen self-cluster becomes more favorable as the cluster size increases. We found that hydrogen atoms would form two-dimensional platelet-like structures along {100} planes. These hydrogen self-clustering behaviors can be quantitative understood by the competition between long-ranged elastic attraction and local electronic repulsion. Further statistical analysis showed that there exists a critical hydrogen concentration above which hydrogen self-clusters are thermodynamically stable and kinetically feasible. Based on this critical hydrogen concentration, the plasma loading conditions under which hydrogen self-clusters form were predicted. Our predictions showed excellent agreement with experimental results of hydrogen bubble formation in tungsten exposed to low-energy hydrogen irradiation. Finally, we proposed a possible mechanism for the hydrogen bubble nucleation via hydrogen self-clustering. This work provides mechanistic insights and quantitative models towards understanding of plasma-induced hydrogen bubble formation in plasma-facing tungsten.

cond-mat.mtrl-sci↗

DeepSF: deep convolutional neural network for mapping protein sequences to folds

Motivation Protein fold recognition is an important problem in structural bioinformatics. Almost all traditional fold recognition methods use sequence (homology) comparison to indirectly predict the fold of a tar get protein based on the fold of a template protein with known structure, which cannot explain the relationship between sequence and fold. Only a few methods had been developed to classify protein sequences into a small number of folds due to methodological limitations, which are not generally useful in practice. Results We develop a deep 1D-convolution neural network (DeepSF) to directly classify any protein se quence into one of 1195 known folds, which is useful for both fold recognition and the study of se quence-structure relationship. Different from traditional sequence alignment (comparison) based methods, our method automatically extracts fold-related features from a protein sequence of any length and map it to the fold space. We train and test our method on the datasets curated from SCOP1.75, yielding a classification accuracy of 80.4%. On the independent testing dataset curated from SCOP2.06, the classification accuracy is 77.0%. We compare our method with a top profile profile alignment method - HHSearch on hard template-based and template-free modeling targets of CASP9-12 in terms of fold recognition accuracy. The accuracy of our method is 14.5%-29.1% higher than HHSearch on template-free modeling targets and 4.5%-16.7% higher on hard template-based modeling targets for top 1, 5, and 10 predicted folds. The hidden features extracted from sequence by our method is robust against sequence mutation, insertion, deletion and truncation, and can be used for other protein pattern recognition problems such as protein clustering, comparison and ranking.

cs.LG↗

DeepQA: Improving the estimation of single protein model quality with deep belief networks

Protein quality assessment (QA) by ranking and selecting protein models has long been viewed as one of the major challenges for protein tertiary structure prediction. Especially, estimating the quality of a single protein model, which is important for selecting a few good models out of a large model pool consisting of mostly low-quality models, is still a largely unsolved problem. We introduce a novel single-model quality assessment method DeepQA based on deep belief network that utilizes a number of selected features describing the quality of a model from different perspectives, such as energy, physio-chemical characteristics, and structural information. The deep belief network is trained on several large datasets consisting of models from the Critical Assessment of Protein Structure Prediction (CASP) experiments, several publicly available datasets, and models generated by our in-house ab initio method. Our experiment demonstrate that deep belief network has better performance compared to Support Vector Machines and Neural Networks on the protein model quality assessment problem, and our method DeepQA achieves the state-of-the-art performance on CASP11 dataset. It also outperformed two well-established methods in selecting good outlier models from a large set of models of mostly low quality generated by ab initio modeling methods. DeepQA is a useful tool for protein single model quality assessment and protein structure prediction. The source code, executable, document and training/test datasets of DeepQA for Linux is freely available to non-commercial users at http://cactus.rnet.missouri.edu/DeepQA/.

cs.AI↗

Test study on the RPS of TMSR-SF1 reactor

The reactor protection system (RPS), as a 1E-level safety system, should be designed and developed following a series of nuclear laws and technical disciplines.

physics.ins-det↗

Effective Secrecy: Reliability, Confusion and Stealth

A security measure called effective security is defined that includes strong secrecy and stealth communication. Effective secrecy ensures that a message cannot be deciphered and that the presence of meaningful communication is hidden. To measure stealth we use resolvability and relate this to binary hypothesis testing. Results are developed for wire-tap channels and broadcast channels with confidential messages.

cs.IT↗

Short Message Noisy Network Coding with a Decode-Forward Option

Short message noisy network coding (SNNC) differs from long message noisy network coding (LNNC) in that one transmits many short messages in blocks rather than using one long message with repetitive encoding. Several properties of SNNC are developed. First, SNNC with backward decoding achieves the same rates as SNNC with offset encoding and sliding window decoding for memoryless networks where each node transmits a multicast message. The rates are the same as LNNC with joint decoding. Second, SNNC enables early decoding if the channel quality happens to be good. This leads to mixed strategies that unify the advantages of decode-forward and noisy network coding. Third, the best decoders sometimes treat other nodes' signals as noise and an iterative method is given to find the set of nodes that a given node should treat as noise sources.

cs.IT↗

Informational Divergence Approximations to Product Distributions

The minimum rate needed to accurately approximate a product distribution based on an unnormalized informational divergence is shown to be a mutual information. This result subsumes results of Wyner on common information and Han-Verdú on resolvability. The result also extends to cases where the source distribution is unknown but the entropy is known.

cs.IT↗

Short-Message Quantize-Forward Network Coding

Recent work for single-relay channels shows that quantize-forward (QF) with long-message encoding achieves the same reliable rates as compress-forward (CF) with short-message encoding. It is shown that short-message QF with backward or pipelined (sliding-window) decoding also achieves the same rates. Similarly, for many relays and sources, short-message QF with backward decoding achieves the same rates as long-message QF. Several practical advantages of short-message encoding are pointed out, e.g., reduced delay and simpler modulation. Furthermore, short-message encoding lets relays use decode-forward (DF) if their channel quality is good, thereby enabling multiinput, multi-output (MIMO) gains that are not possible with long-message encoding. Finally, one may combine the advantages of long- and short-message encoding by hashing a long message to short messages.

cs.IT↗