控制爆破法处理卡钻事故

介绍了在包头市某工程实施管道穿越黄河施工中,采用爆破法处理卡钻的经验。针对深水环境条件及钻杆内径小不宜采用集团装药的条件,确定采用"小直径爆破筒,钻杆内部装药"的爆破方案,阐述了爆破设计及施工注意事项。可供类似工程参考。     

Predicting Prostephanus truncatus (Horn) (Coleoptera: Bostrichidae) populations and associated grain damage in smallholder farmers’ maize stores: A machine learning approach

Prostephanus truncatus is a notorious pest of stored-maize grain and its spread throughout sub-Saharan Africa has led to increased levels of grain storage losses. The current study developed models to predict the level of P. truncatus infestation and associated damage of maize grain in smallholder farmer stores. Data were gathered from grain storage trials conducted in Hwedza and Mbire districts of Zimbabwe and correlated with weather data for each site. Insect counts of P. truncatus and other common stored grain insect pests had a strong correlation with time of year with highest recorded numbers from January to May. Correlation analysis showed insect-generated grain dust from boring and feeding activity to be the best indicator of P. truncatus presence in stores (r = 0.70), while a moderate correlation (r = 0.48) was found between P. truncatus numbers and storage insect parasitic wasps, and grain damage levels significantly correlated with the presence of Tribolium castaneum (r = 0.60). Models were developed for predicting P. truncatus infestation and grain damage using parameter selection algorithms and decision-tree machine learning algorithms with 10-fold cross-validation. The P. truncatus population size prediction model performance was weak (r = 0.43) due to the complicated sampling and detection of the pest and eight-week long period between sampling events. The grain damage prediction model had a stronger correlation coefficient (r = 0.93) and is a good estimator for in situ stored grain insect damage. The models were developed for use under southern African climatic conditions and can be improved with more input data to create more precise models for building decision-support tools for smallholder maize-based production systems.     

Maximum likelihood-based adaptive differential evolution identification algorithm for multivariable systems in the state-space form

Parameter estimation plays an important role in the field of system control. This article is concerned with the parameter estimation methods for multivariable systems in the state-space form. For the sake of solving the identification complexity caused by a large number of parameters in multivariable systems, we decompose the original multivariable system into some subsystems containing fewer parameters and study identification algorithms to estimate the parameters of each subsystem. By taking the maximum likelihood criterion function as the fitness function of the differential evolution algorithm, we present a maximum likelihood-based differential evolution (ML-DE) algorithm for parameter estimation. To improve the parameter estimation accuracy, we introduce the adaptive mutation factor and the adaptive crossover factor into the ML-DE algorithm and propose a maximum likelihood-based adaptive differential evolution algorithm. The simulation study indicates the efficiency of the proposed algorithms.     

基于梯度提升决策树的车轮轮缘厚度磨耗预测

轮对在列车走行过程中起着导向、承受以及传递载荷的作用，其踏面及轮缘磨耗对地铁列车运行安全性和钢轨的寿命都将产生重要影响。根据地铁列车车轮磨耗机理，分析车轮尺寸数据特点，针对轮缘厚度这一型面参数，基于梯度提升决策树算法构建轮缘厚度磨耗预测模型。在该模型的基础上，任意选取某轮对数据进行验证分析，结果表明：基于梯度提升决策树的轮对磨耗预测模型具有较好的预测精度，可预测出1~6个月的轮缘厚度变化趋势范围，预测时间范围较长，可为地铁维保部门对轮对的维修方式由状态修转为预防修提供指导性建议。     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.     

A Student's t-based density peaks clustering with superpixel segmentation (tDPCSS) method for image color clustering

Image color clustering is a basic technique in image processing and computer vision, which is often applied in image segmentation, color transfer, contrast enhancement, object detection, skin color capture, and so forth. Various clustering algorithms have been employed for image color clustering in recent years. However, most of the algorithms require a large amount of memory or a predetermined number of clusters. In addition, some of the existing algorithms are sensitive to the parameter configurations. In order to tackle the above problems, we propose an image color clustering method named Student's t-based density peaks clustering with superpixel segmentation (tDPCSS), which can automatically obtain clustering results, without requiring a large amount of memory, and is not dependent on the parameters of the algorithm or the number of clusters. In tDPCSS, superpixels are obtained based on automatic and constrained simple non-iterative clustering, to automatically decrease the image data volume. A Student's t kernel function and a cluster center selection method are adopted to eliminate the dependence of the density peak clustering on parameters and the number of clusters, respectively. The experiments undertaken in this study confirmed that the proposed approach outperforms k-means, fuzzy c-means, mean-shift clustering, and density peak clustering with superpixel segmentation in the accuracy of the cluster centers and the validity of the clustering results.     

Control theory for stochastic distributed parameter systems,an engineering perspective

The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.     

A Global Maximum Error Controller Based Nonlinearity Aware TPWL Method for Reducing Nonlinear Systems

Abstract

Model order reduction is a common practice to reduce large order systems so that their simulation and control become easy. Nonlinearity aware trajectory piecewise linear is a variation of trajectory piecewise linearization technique of order reduction that is used to reduce nonlinear systems. With this scheme, the reduced approximation of the system is generated by weighted sum of the linearized and reduced sub-models obtained at certain linearization points on the system trajectory. This scheme uses dynamically inspired weight assignment that makes the approximation nonlinearity aware. Just as weight assignment, the process of linearization points selection is also important for generating faithful approximations. This article uses a global maximum error controller based linearization points selection scheme according to which a state is chosen as a linearization point if the error between a current reduced model and the full order nonlinear system reaches a maximum value. A combination that not only selects linearization points based on an error controller but also assigns dynamic inspired weights is shown in this article. The proposed scheme generates approximations with higher accuracies. This is demonstrated by applying the proposed method to some benchmark nonlinear circuits including RC ladder network and inverter chain circuit and comparing the results with the conventional schemes.