钢管套筒灌浆连接轴向受拉性能模拟试验研究

为研究钢管套筒灌浆连接轴向受拉破坏过程及破坏机理，试验中设计了16组48个钢管套筒灌浆连接试件，试件采用钢板代替圆钢管，并进行静载试验。分析了灌浆料裂缝扩展过程、荷载-相对位移曲线，并对抗剪键高距比、灌浆料厚度、侧向力等因素对破坏过程及承载力的影响进行分析。结果表明：对于不设置抗剪键的套筒灌浆连接试件，斜裂缝随机产生，裂缝分布不均匀；对于设置抗剪键的套筒灌浆连接试件，裂缝首先出现在底部抗剪键位置处，与水平方向夹角约为30°，随后在中部和上部抗剪键位置处分别出现斜裂缝。由于每个抗剪键上荷载分担并不均匀，与抗剪键接触的灌浆料逐渐达到极限压应力，达到极限状态时，承载力全部由抗剪键间的机械咬合力承担，在连接承载力中，可忽略摩擦力和胶结力作用。随着抗剪键高距比h/s增大，各试件初始剪切刚度相差不大，承载力增大，但增幅逐渐减小，建议抗剪键高距比0.06g/s>0.3，同时需要满足灌浆料灌注的施工要求。     

A hybrid knowledge and ensemble classification approach for prediction of venous thromboembolism

Clinical narratives such as progress summaries, lab reports, surgical reports, and other narrative texts contain key biomarkers about a patient's health. Evidence-based preventive medicine needs accurate semantic and sentiment analysis to extract and classify medical features as the input to appropriate machine learning classifiers. However, the traditional approach of using single classifiers is limited by the need for dimensionality reduction techniques, statistical feature correlation, a faster learning rate, and the lack of consideration of the semantic relations among features. Hence, extracting semantic and sentiment-based features from clinical text and combining multiple classifiers to create an ensemble intelligent system overcomes many limitations and provides a more robust prediction outcome. The selection of an appropriate approach and its interparameter dependency becomes key for the success of the ensemble method. This paper proposes a hybrid knowledge and ensemble learning framework for prediction of venous thromboembolism (VTE) diagnosis consisting of the following components: a VTE ontology, semantic extraction and sentiment assessment of risk factor framework, and an ensemble classifier. Therefore, a component-based analysis approach was adopted for evaluation using a data set of 250 clinical narratives where knowledge and ensemble achieved the following results with and without semantic extraction and sentiment assessment of risk factor, respectively: a precision of 81.8% and 62.9%, a recall of 81.8% and 57.6%, an F measure of 81.8% and 53.8%, and a receiving operating characteristic of 80.1% and 58.5% in identifying cases of VTE.     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

Evolutionary collective behavior decomposition model for time series data mining

In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model.     

新形势下普通高校大学生行为管理模式研究

高校是培养人才的摇篮,肩负着科教兴国、人才强国两大历史性战略任务。由于社会环境的复杂化,人际关系的交错性,新时代的大学生行为状况给高校学生管理工作带来了新的挑战。针对新时期大学生行为特点,我们通过加强党建工作、强化学风建设、做好班级自主管理和深化社会服务四个方面工作进行分析,提出了全面引导、约束、规范和优化大学生的行为的建议和对策,从而有效解决新形势下普通高校学生管理工作的实际困难。     

冷轧平整机机前甩尾轧制工艺的开发与应用

本文介绍了柳钢冷轧板带厂1550 mm单机架平整机机前甩尾轧制的工艺。改进前轧制每卷钢卷生产效率低,钢卷成材率低,改进后生产效率、成材率明显提高,部分规格的钢卷能实现带尾剪切长度为零。     

The effectiveness of adaptive versus non-adaptive learning with digital educational games

For the training of academic skills, digital educational games with integrated adaptivity are promising. Adaptive games are considered superior to non-adaptive games, because they constantly assess children's performance, and accordingly adapt the difficulty of the tasks corresponding to the children's individual level. However, empirical evidence with regard to the effectivity of adaptive compared to non-adaptive games is limited. A study was conducted with 191 children from the third year of Kinder garten who were enrolled in one of three conditions, that is, playing an adaptive version of the reading game (RG), a non-adaptive version of the RG or training with pen-and-paper exercises. In all three conditions, children trained emergent reading (phonological awareness and letter knowledge) once a week for 30 min over a period of 5 weeks. Children's performance on cognitive (phonological awareness, letter knowledge, reading fluency) and non-cognitive (motivation, self-concept) factors was assessed. Results revealed a significant improvement in phonological awareness and letter knowledge in all conditions. However, no differences between the conditions were observed with respect to children's improvement on phonological awareness and letter knowledge or on their post-test scores for reading fluency. With regard to motivation and self-concept, again, no differences in these non-cognitive factors were observed across conditions.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

Improving the prediction of petroleum reservoir characterization with a stacked generalization ensemble model of support vector machines

The ensemble learning paradigm has proved to be relevant to solving most challenging industrial problems. Despite its successful application especially in the Bioinformatics, the petroleum industry has not benefited enough from the promises of this machine learning technology. The petroleum industry, with its persistent quest for high-performance predictive models, is in great need of this new learning methodology. A marginal improvement in the prediction indices of petroleum reservoir properties could have huge positive impact on the success of exploration, drilling and the overall reservoir management portfolio. Support vector machines (SVM) is one of the promising machine learning tools that have performed excellently well in most prediction problems. However, its performance is a function of the prudent choice of its tuning parameters most especially the regularization parameter, C. Reports have shown that this parameter has significant impact on the performance of SVM. Understandably, no specific value has been recommended for it. This paper proposes a stacked generalization ensemble model of SVM that incorporates different expert opinions on the optimal values of this parameter in the prediction of porosity and permeability of petroleum reservoirs using datasets from diverse geological formations. The performance of the proposed SVM ensemble was compared to that of conventional SVM technique, another SVM implemented with the bagging method, and Random Forest technique. The results showed that the proposed ensemble model, in most cases, outperformed the others with the highest correlation coefficient, and the lowest mean and absolute errors. The study indicated that there is a great potential for ensemble learning in petroleum reservoir characterization to improve the accuracy of reservoir properties predictions for more successful explorations and increased production of petroleum resources. The results also confirmed that ensemble models perform better than the conventional SVM implementation.     

Transport Map sampling with PGD model reduction for fast dynamical Bayesian data assimilation

The motivation of this work is to address real-time sequential inference of parameters with a full Bayesian formulation. First, the proper generalized decomposition (PGD) is used to reduce the computational evaluation of the posterior density in the online phase. Second, Transport Map sampling is used to build a deterministic coupling between a reference measure and the posterior measure. The determination of the transport maps involves the solution of a minimization problem. As the PGD model is quasi-analytical and under a variable separation form, the use of gradient and Hessian information speeds up the minimization algorithm. Eventually, uncertainty quantification on outputs of interest of the model can be easily performed due to the global feature of the PGD solution over all coordinate domains. Numerical examples highlight the performance of the method.