This paper presents an experimental investigation on geopolymeric recycled aggregate concrete filled steel tubular (GRACFST) columns in fire. A total of 12 specimens were tested, including 6 circular columns and 6 square columns subjected to combined fire and loading. The test parameters include: (a) cross-section type (circular and square); (b) column load ratio (0.3, 0.4 and 0.6); and (c) fire scenario (all around fire exposure and two surfaces fire exposure). The failure mode, temperature development, deformation development and fire resistance of GRACFST columns were obtained and discussed. Finally, the fire resistance design method for conventional CFST columns proposed in Eurocode 4 was used to predict the ultimate cross sectional load bearing capacity of the GRACFST column at a specified fire exposure time, and the comparison between the prediction and the test results reported in this paper indicated that the Eurocode 4 method gave an overestimation to the GRACFST column. To improve the prediction accuracy, suitable material models for the passively confined GRAC in CFST columns should be developed in the future research.
Fire Technology - With 110 kV oil-immersed transformer as the platform, in this paper, we build a full-scale test platform covering 6 fire extinguishing (fire control) methods and different... 相似文献
This work discusses the results from tests conducted to investigate the uniaxial compression and creep behavior of red sandstone. An original untreated sample and an 800°C treated sample were selected to carry out the experiments. High temperature had an obvious influence on the mechanical properties of the red sandstone. The relationship between creep strain and instantaneous strain, as well as the instantaneous deformation modulus and creep viscosity coefficient, was analyzed. High temperature reduced the ability of the red sandstone to resist instantaneous deformation and creep deformation. Acoustic emission (AE) technology was also used in the loading process of uniaxial compression and creep tests, providing a powerful means for damage evolutionary analysis of the red sandstone. 相似文献
Just-in-time defect prediction can remind software developers and managers to verify and fix bugs at the moment they appeared, thus improving the effectiveness and validity of bug fixing. Existing studies mainly focus on just-in-time prediction for software files (JIT-F). JIT-F is a binary classification problem, which classifies (hence predicts) a file change as buggy or clean. This article provides a detailed analysis of just-in-time defect prediction for software hunks (JIT-H), which predicts bugs at a finer level of granularity, and hence further improves the efficiency of bug fixing. Classification is performed using the ensemble technique of bagging—aggregated combinations of random under sampling plus multiple classifiers (J48 and Random Forest). An empirical study with 10 open source projects was conducted to validate the effectiveness of JIT-H. Experimental results show that JIT-H is effective at predicting defects in software hunk changes. Compared with JIT-F, JIT-H is more cost effective. Additionally, analysis on the change features indicates that Text Vector features and hunk change level features are of more importance than features in other groups and levels. 相似文献
Verifiable secret sharing mainly solves the cheating behavior between malicious participants and the ground control center in the satellite network. The verification stage can verify the effectiveness of secret shares issued by the ground control center to each participant and verify the effectiveness of secret shares shown by participants. We use a lot of difficult assumptions based on mathematical problems in the verification stage, such as solving the difficult problem of the discrete logarithm, large integer prime factorization, and so on. Compared with other verifiable secret sharing schemes designed for difficult problems under the same security, the verifiable secret sharing scheme based on the Elliptic Curve Cryptography (ECC) system has the advantages of less computational overhead and shorter key. At present, the binary polynomial is a single secret scheme and cannot provide effective verification. Therefore, based on a Protected Verifiable Synchronous Multi Secret Sharing (PVS-MSS) scheme, this paper is designed based on bivariate asymmetric polynomials. The advanced verifiable attribute is introduced into the Protected Secret Sharing (PSS) scheme. This paper extends the protected synchronous multi-secret sharing scheme based on bivariate polynomial design. The ECC system constructs the security channel between the ground control center and participants and constructs the verification algorithm. Through the verification algorithm, any participant can verify the consistency and effectiveness of the secret shadow and secret share received from other participants or presented by the secret distribution center. Therefore, no additional key agreement protocol is required; participants do not need to negotiate the session key for encryption; the secret share polynomial can generate the session key between participants and speed up the secret reconstruction process. The verification stage has lower computational complexity than the verifiable scheme constructed by Rivest Shamir Adleman (RSA) and other encryption methods. Chinese Remainder Theorem (CRT) is used to update the secret shadow. The secret shadow does not need to be updated with the change of the scheme shared secret, and the public value update efficiency is higher. Reduce the complexity of sharing secret updates in a synchronous multi-secret sharing scheme. 相似文献