Identification and U-control of a state-space system with time-delay

This article presents a state-space model with time-delay to map the relationship between known input-output data for discrete systems. For the given input-output data, a model identification algorithm combining parameter estimation and state estimation is proposed in line with the causality constraints. Consequently, this article proposes a least squares parameter estimation algorithm, and analyzes its convergence for the studied systems to prove that the parameter estimation errors converge to zero under the persistent excitation conditions. In control system design, the U-model based control is introduced to provide a unilateral platform to improve the design efficiency and generality. A simulation portfolio from modeling to control is provided with computational experiments to validate the derived results.     

Tabular data: Deep learning is not all you need

A key element in solving real-life data science problems is selecting the types of models to use. Tree ensemble models (such as XGBoost) are usually recommended for classification and regression problems with tabular data. However, several deep learning models for tabular data have recently been proposed, claiming to outperform XGBoost for some use cases. This paper explores whether these deep models should be a recommended option for tabular data by rigorously comparing the new deep models to XGBoost on various datasets. In addition to systematically comparing their performance, we consider the tuning and computation they require. Our study shows that XGBoost outperforms these deep models across the datasets, including the datasets used in the papers that proposed the deep models. We also demonstrate that XGBoost requires much less tuning. On the positive side, we show that an ensemble of deep models and XGBoost performs better on these datasets than XGBoost alone.     

Learn decision trees with deep visual primitives

In this paper, we strive to propose a self-interpretable framework, termed PrimitiveTree, that incorporates deep visual primitives condensed from deep features with a conventional decision tree, bridging the gap between deep features extracted from deep neural networks (DNNs) and trees’ transparent decision-making processes. Specifically, we utilize a codebook, which embeds the continuous deep features into a finite discrete space (deep visual primitives) to distill the most common semantic information. The decision tree adopts the spatial location information and the mapped primitives to present the decision-making process of the deep features in a tree hierarchy. Moreover, the trained interpretable PrimitiveTree can inversely explain the constituents of the deep features, highlighting the most critical and semantic-rich image patches attributing to the final predictions of the given DNN. Extensive experiments and visualization results validate the effectiveness and interpretability of our method.     

Enhanced wide-activated residual network for efficient and accurate image deblocking

To save bandwidth and storage space as well as speed up data transmission, people usually perform lossy compression on images. Although the JPEG standard is a simple and effective compression method, it usually introduces various visually unpleasing artifacts, especially the notorious blocking artifacts. In recent years, deep convolutional neural networks (CNNs) have seen remarkable development in compression artifacts reduction. Despite the excellent performance, most deep CNNs suffer from heavy computation due to very deep and wide architectures. In this paper, we propose an enhanced wide-activated residual network (EWARN) for efficient and accurate image deblocking. Specifically, we propose an enhanced wide-activated residual block (EWARB) as basic construction module. Our EWARB gives rise to larger activation width, better use of interdependencies among channels, and more informative and discriminative non-linearity activation features without more parameters than residual block (RB) and wide-activated residual block (WARB). Furthermore, we introduce an overlapping patches extraction and combination (OPEC) strategy into our network in a full convolution way, leading to large receptive field, enforced compatibility among adjacent blocks, and efficient deblocking. Extensive experiments demonstrate that our EWARN outperforms several state-of-the-art methods quantitatively and qualitatively with relatively small model size and less running time, achieving a good trade-off between performance and complexity.     

A review of phosphorescent and fluorescent phosphors for fingerprint detection

Currently, the efficient detection of fingerprints is essential for the crime investigations. Revealing fingerprints is commonly achieved with fluorescent organic compounds but they are not efficient for fingerprint detection on porous or reflective surfaces. In order to solve the problem of collecting fingerprints on porous/reflective surfaces, inorganic phosphors have been employed, since they have characteristics of variable color emission, afterglow, high chemical stability and nano-size, which allow the fingerprint detection on any porous or non-porous surfaces. Due to these last properties, this review presents a summary about the use of phosphorescent and fluorescent phosphors for the detection of latent fingerprints. First, we discussed the main physical and chemical characteristics of the fingerprints which permit their detection and collection from any surface. After this, we presented the main morphological, structural and luminescent properties of the phosphorescent and fluorescent phosphors that allow their use for fingerprint detection. Later, we demonstrated with pictures of fingerprints (with and without light emission from the phosphors deposited on them) that both, phosphorescent and fluorescent phosphors can be used to visualize fingerprints with high resolution and high contrast without interference of the background surface, which is ideal for its collection and registration in the Automated Fingerprint Identification System (AFIS). We believe that this review could be useful to understand how to select an appropriate phosphorescent or fluorescent material for fingerprint detection depending on the type of surface (porous or non-porous, reflective or not reflective) where the fingerprint is deposited.     

爆破工程安全评价初探

开展爆破工程安全评价可有效地减少各种危险和有害因素 ,减少爆破事故的发生 ,大型或特殊爆破工程均应进行安全评价。本文提出了对爆破工程开展安全评价的设想 ,并对爆破工程安全评价的内容和方法进行了探讨。文中指出 :根据爆破工程的特点 ,可采用事故树分析和预先危险性分析等方法进行爆破工程的安全评价     

Structural health monitoring system based on multi-agent coordination and fusion for large structure

In practical applications of structural health monitoring technology, a large number of distributed sensors are usually adopted to monitor the big dimension structures and different kinds of damage. The monitored structures are usually divided into different sub-structures and monitored by different sensor sets. Under this situation, how to manage the distributed sensor set and fuse different methods to obtain a fast and accurate evaluation result is an important problem to be addressed deeply. In the paper, a multi-agent fusion and coordination system is presented to deal with the damage identification for the strain distribution and joint failure in the large structure. Firstly, the monitoring system is adopted to distributedly monitor two kinds of damages, and it self-judges whether the static load happens in the monitored sub-region, and focuses on the static load on the sub-region boundary to obtain the sensor network information with blackboard model. Then, the improved contract net protocol is used to dynamically distribute the damage evaluation module for monitoring two kinds of damage uninterruptedly. Lastly, a reliable assessment for the whole structure is given by combing various heterogeneous classifiers strengths with voting-based fusion. The proposed multi-agent system is illustrated through a large aerospace aluminum plate structure experiment. The result shows that the method can significantly improve the monitoring performance for the large-scale structure.     

Generating Questions Based on Semi-Automated and End-to-End Neural Network

With the emergence of large-scale knowledge base, how to use triple information to generate natural questions is a key technology in question answering systems. The traditional way of generating questions require a lot of manual intervention and produce lots of noise. To solve these problems, we propose a joint model based on semi-automated model and End-to-End neural network to automatically generate questions. The semi-automated model can generate question templates and real questions combining the knowledge base and center graph. The End-to-End neural network directly sends the knowledge base and real questions to BiLSTM network. Meanwhile, the attention mechanism is utilized in the decoding layer, which makes the triples and generated questions more relevant. Finally, the experimental results on SimpleQuestions demonstrate the effectiveness of the proposed approach.     

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.     

基于神经网络和遗传算法的锭子弹性管性能优化

为得到减振弹性管对下锭胆的支承弹性和锭子高速运动下的稳定性等性能的最优匹配效率,依据减振弹性管的等效抗弯刚度及底部等效刚度系数公式,利用MatLab数值分析软件构建弹性管抗弯刚度和底部挠度数学模型。首先,结合Isight优化软件基于径向基神经网络构建其近似模型,且使精度达到可接受水平,并以模型的关键结构参数弹性模量、螺距、槽宽、壁厚为设计变量,结合遗传算法对弹性管抗弯刚度和底部挠度进行多目标优化设计,得到Pareto最优解集和Pareto前沿图,确定出减振弹性管结构工艺参数的优化方案。通过对优化数据进行分析发现,该方案在保证减振弹性管弹性的同时,其底部振幅明显减弱。