اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPredicting Failure using Conditioning on Damage History: Demonstration on Percolation and Hierarchical Fiber Bundles
93
0
0.0
(
0
)
تأليف
J. Andersen
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We formulate the problem of probabilistic predictions of global failure in the simplest possible model based on site percolation and on one of the simplest model of time-dependent rupture, a hierarchical fiber bundle model. We show that conditioning the predictions on the knowledge of the current degree of damage (occupancy density $p$ or number and size of cracks) and on some information on the largest cluster improves significantly the prediction accuracy, in particular by allowing to identify those realizations which have anomalously low or large clusters (cracks). We quantify the prediction gains using two measures, the relative specific information gain (which is the variation of entropy obtained by adding new information) and the root-mean-square of the prediction errors over a large ensemble of realizations. The bulk of our simulations have been obtained with the two-dimensional site percolation model on a lattice of size $L times L=20 times 20$ and hold true for other lattice sizes. For the hierarchical fiber bundle model, conditioning the measures of damage on the information of the location and size of the largest crack extends significantly the critical region and the prediction skills. These examples illustrate how on-going damage can be used as a revelation of both the realization-dependent pre-existing heterogeneity and the damage scenario undertaken by each specific sample.
قيم البحث
اقرأ أيضاً
We present a general prediction scheme of failure times based on updating continuously with time the probability for failure of the global system, conditioned on the information revealed on the pre-existing idiosyncratic realization of the system by
the damage that has occurred until the present time. Its implementation on a simple prototype system of interacting elements with unknown random lifetimes undergoing irreversible damage until a global rupture occurs shows that the most probable predicted failure time (mode) may evolve non-monotonically with time as information is incorporated in the prediction scheme. In addition, both the mode, its standard deviation and, in fact, the full distribution of predicted failure times exhibit sensitive dependence on the realization of the system, similarly to ``chaos in spinglasses, providing a multi-dimensional dynamical explanation for the broad distribution of failure times observed in many empirical situations.
We investigate kinetically constrained models of glassy transitions, and determine which model characteristics are crucial in allowing a rigorous proof that such models have discontinuous transitions with faster than power law diverging length and ti
me scales. The models we investigate have constraints similar to that of the knights model, introduced by Toninelli, Biroli, and Fisher (TBF), but differing neighbor relations. We find that such knights-like models, otherwise known as models of jamming percolation, need a ``No Parallel Crossing rule for the TBF proof of a glassy transition to be valid. Furthermore, most knight-like models fail a ``No Perpendicular Crossing requirement, and thus need modification to be made rigorous. We also show how the ``No Parallel Crossing requirement can be used to evaluate the provable glassiness of other correlated percolation models, by looking at models with more stable directions than the knights model. Finally, we show that the TBF proof does not generalize in any straightforward fashion for three-dimensiona
In the last two decades, network science has blossomed and influenced various fields, such as statistical physics, computer science, biology and sociology, from the perspective of the heterogeneous interaction patterns of components composing the com
plex systems. As a paradigm for random and semi-random connectivity, percolation model plays a key role in the development of network science and its applications. On the one hand, the concepts and analytical methods, such as the emergence of the giant cluster, the finite-size scaling, and the mean-field method, which are intimately related to the percolation theory, are employed to quantify and solve some core problems of networks. On the other hand, the insights into the percolation theory also facilitate the understanding of networked systems, such as robustness, epidemic spreading, vital node identification, and community detection. Meanwhile, network science also brings some new issues to the percolation theory itself, such as percolation of strong heterogeneous systems, topological transition of networks beyond pairwise interactions, and emergence of a giant cluster with mutual connections. So far, the percolation theory has already percolated into the researches of structure analysis and dynamic modeling in network science. Understanding the percolation theory should help the study of many fields in network science, including the still opening questions in the frontiers of networks, such as networks beyond pairwise interactions, temporal networks, and network of networks. The intention of this paper is to offer an overview of these applications, as well as the basic theory of percolation transition on network systems.
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-degree correlation, and study its percolation transition to discuss the effect of a strong degree-degree correlation on the percolation critical behav
iors. Using the generating function method for bipartite networks, we analytically derive the percolation threshold and the order parameter critical exponent, $beta$. For the MD scale-free networks, whose degree distribution is $P(k) sim k^{-gamma}$, we show that the exponent, $beta$, for the MD networks and corresponding uncorrelated networks are same for $gamma>3$ but are different for $2<gamma<3$. A strong degree-degree correlation significantly affects the percolation critical behavior in heavy-tailed scale-free networks. Our analytical results for the critical exponents are numerically confirmed by a finite-size scaling argument.
Evaluating the mechanical response of fiber-reinforced composites can be extremely time consuming and expensive. Machine learning (ML) techniques offer a means for faster predictions via models trained on existing input-output pairs and have exhibite
d success in composite research. This paper explores a fully convolutional neural network modified from StressNet, which was originally for lin-ear elastic materials and extended here for a non-linear finite element (FE) simulation to predict the stress field in 2D slices of segmented tomography images of a fiber-reinforced polymer specimen. The network was trained and evaluated on data generated from the FE simulations of the exact microstructure. The testing results show that the trained network accurately captures the characteristics of the stress distribution, especially on fibers, solely from the segmented microstructure images. The trained model can make predictions within seconds in a single forward pass on an ordinary laptop, given the input microstructure, compared to 92.5 hours to run the full FE simulation on a high-performance computing cluster. These results show promise in using ML techniques to conduct fast structural analysis for fiber-reinforced composites and suggest a corollary that the trained model can be used to identify the location of potential damage sites in fiber-reinforced polymers.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
