Metal-free catalyst fabrication by incorporating oxygen groups on the surface of the carbonaceous sample and efficient hydrogen production from NaBH4 methanolysis

In the present study, metal-free catalysts for efficient H₂ generation from NaBH₄ methanolysis was produced for the first time from apricot kernel shells with two-step activation. The first stage of the two-stage activation includes the production of activated carbon with the KOH agent (AKOH), and the second stage includes hydrothermally HNO₃ activation with oxygen doping (O doped AKOH + N). The hydrogen production rate (HGR) and the activation energy (Ea) of the reaction with the obtained metal-free catalyst (10 mg) were determined as 14,444 ml min^?1 g^?1 and 7.86 kJ mol^?1, respectively. The structural and physical-chemical properties of these catalysts were characterized by XRD (X-ray diffraction), SEM (scanning electron microscopy), elemental CHNS analysis, FT-IR (Fourier transform infrared spectroscopy), and nitrogen adsorption analysis. Also, the reusability results of this metal-free catalyst for H₂ production are promising.     

基于VMD和BSA-KELM的高陡边坡位移预测模型研究

边坡位移的时间序列曲线存在复杂的非线性特性,传统的预测模型精度不足以满足预测要求。为此提出了基于变分模态分解的鸟群优化-核极限学习机的预测模型,并用于河北省某水泥厂的边坡位移预测。该方法首先采用VMD把边坡位移序列分解为一系列的有限带宽的子序列,再对各子序列分别采用相空间重构并用核极限学习机预测,采用鸟群算法优化相空间重构的嵌入维度和KELM中惩罚系数和核参数三个数值,以取得最优预测模型。最后将各个子序列预测值叠加,得到边坡位移的最终预测值。结果表明：和KELM、BSA-KELM、EEMD-BSA-KELM模型相比,基于VMD的BSA-KELM预测精度更高,为边坡位移的预测提供一种有效的方法。     

Breeding schemes with optimum-contribution selection or truncation selection for beef cattle destined for use on dairy females

We tested the hypothesis that the size of a beef cattle population destined for use on dairy females is smaller under optimum-contribution selection (OCS) than under truncation selection (TRS) at the same genetic gain (ΔG) and the same rate of inbreeding (ΔF). We used stochastic simulation to estimate true ΔG realized at a 0.005 ΔF in breeding schemes with OCS or TRS. The schemes for the beef cattle population also differed in the number of purebred offspring per dam and the total number of purebred offspring per generation. Dams of the next generation were exclusively selected among the one-year-old heifers. All dams were donors for embryo transfer and produced a maximum of 5 or 10 offspring. The total number of purebred offspring per generation was: 400, 800, 1,600 or 4,000 calves, and it was used as a measure of population size. Rate of inbreeding was predicted and controlled using pedigree relationships. Each OCS (TRS) scheme was simulated for 10 discrete generations and replicated 100 (200) times. The OCS scheme and the TRS scheme with a maximum of 10 offspring per dam required approximately 783 and 1,257 purebred offspring per generation to realize a true ΔG of €14 and a ΔF of 0.005 per generation. Schemes with a maximum of 5 offspring per dam required more purebred offspring per generation to realize a similar true ΔG and a similar ΔF. Our results show that OCS and multiple ovulation and embryo transfer act on selection intensity through different mechanisms to achieve fewer selection candidates and fewer selected sires and dams than under TRS at the same ΔG and a fixed ΔF. Therefore, we advocate the use of a breeding scheme with OCS and multiple ovulation and embryo transfer for beef cattle destined for use on dairy females because it is favorable both from an economic perspective and a carbon footprint perspective.     

Prediction of mode I fracture toughness of rock using linear multiple regression and gene expression programming

Prediction of mode I fracture toughness (K_IC) of rock is of significant importance in rock engineering analyses. In this study, linear multiple regression (LMR) and gene expression programming (GEP) methods were used to provide a reliable relationship to determine mode I fracture toughness of rock. The presented model was developed based on 60 datasets taken from the previous literature. To predict fracture parameters, three mechanical parameters of rock mass including uniaxial compressive strength (UCS), Brazilian tensile strength (BTS), and elastic modulus (E) have been selected as the input parameters. A cluster of data was collected and divided into two random groups of training and testing datasets. Then, different statistical linear and artificial intelligence based nonlinear analyses were conducted on the training data to provide a reliable prediction model of K_IC. These two predictive methods were then evaluated based on the testing data. To evaluate the efficiency of the proposed models for predicting the mode I fracture toughness of rock, various statistical indices including coefficient of determination (R²), root mean square error (RMSE), and mean absolute error (MAE) were utilized herein. In the case of testing datasets, the values of R², RMSE, and MAE for the GEP model were 0.87, 0.188, and 0.156, respectively, while they were 0.74, 0.473, and 0.223, respectively, for the LMR model. The results indicated that the selected GEP model delivered superior performance with a higher R² value and lower errors.     

A self-adaptive synthetic over-sampling technique for imbalanced classification

Traditionally, in supervised machine learning, (a significant) part of the available data (usually 50%-80%) is used for training and the rest—for validation. In many problems, however, the data are highly imbalanced in regard to different classes or does not have good coverage of the feasible data space which, in turn, creates problems in validation and usage phase. In this paper, we propose a technique for synthesizing feasible and likely data to help balance the classes as well as to boost the performance in terms of confusion matrix as well as overall. The idea, in a nutshell, is to synthesize data samples in close vicinity to the actual data samples specifically for the less represented (minority) classes. This has also implications to the so-called fairness of machine learning. In this paper, we propose a specific method for synthesizing data in a way to balance the classes and boost the performance, especially of the minority classes. It is generic and can be applied to different base algorithms, for example, support vector machines, k-nearest neighbour classifiers deep neural, rule-based classifiers, decision trees, and so forth. The results demonstrated that (a) a significantly more balanced (and fair) classification results can be achieved and (b) that the overall performance as well as the performance per class measured by confusion matrix can be boosted. In addition, this approach can be very valuable for the cases when the number of actual available labelled data is small which itself is one of the problems of the contemporary machine learning.     

Improved error performance for generalised spatial modulation with enhanced spectral efficiency

The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these.     

一种新的多渐消因子容积卡尔曼滤波

将强跟踪思想引入容积卡尔曼滤波（cubature Kalman filter，CKF），建立强跟踪CKF能有效克服CKF在模型不确定、状态突变等情况下，滤波性能下降的问题。通过分析现有多渐消因子计算方法，发现它们均只利用了协方差矩阵的对角线元素，并没有考虑各个状态之间的相关性，不能充分发挥多渐消因子的优势。为此，本文提出渐消因子矩阵，基于正交原理推导渐消因子矩阵的求解方法，提出多渐消因子强跟踪CKF算法。多渐消因子强跟踪CKF算法突破了传统多渐消因子为向量的限制，也不再要求渐消因子取值要大于1。仿真验证了算法具有更好的滤波精度何鲁棒性，能更好的满足工程应用的要求。     

Bootstrap procedures for detecting multiple persistence shifts in heteroskedastic time series

This article proposes new bootstrap procedures for detecting multiple persistence shifts in a time series driven by non-stationary volatility. The assumed volatility process can accommodate discrete breaks, smooth transition variation as well as trending volatility. We develop wild bootstrap sup-Wald tests of the null hypothesis that the process is either stationary [I(0)] or has a unit root [I(1)] throughout the sample. We also propose a sequential procedure to estimate the number of persistence breaks based on ordering the regime-specific bootstrap p-values. The asymptotic validity of the advocated procedures is established both under the null of stability and a variety of persistence change alternatives. A comparison with existing tests that assume homoskedasticity illustrates the finite sample improvements offered by our methods. An application to OECD inflation rates highlights the empirical relevance of the proposed approach and weakens the case for persistence change relative to existing procedures.     

Evolving an Accurate Decision Tree-Based Model for Predicting Carbon Dioxide Solubility in Polymers

Solubility is one of the most indispensable physicochemical properties determining the compatibility of components of a blending system. Research has been focused on the solubility of carbon dioxide in polymers as a significant application of green chemistry. To replace costly and time-consuming experiments, a novel solubility prediction model based on a decision tree, called the stochastic gradient boosting algorithm, was proposed to predict CO₂ solubility in 13 different polymers, based on 515 published experimental data lines. The results indicate that the proposed ensemble model is an effective method for predicting the CO₂ solubility in various polymers, with highly satisfactory performance and high efficiency. It produces more accurate outputs than other methods such as machine learning schemes and an equation of state approach.