HAR-sEMG: A Dataset for Human Activity Recognition on Lower-Limb sEMG

Knowledge and Information Systems - In the past decade, human activity recognition (HAR) has grown in popularity due to its applications in security and entertainment. As recent years have...     

GRU-based capsule network with an improved loss for personnel performance prediction

Applied Intelligence - Personnel performance is a key factor to maintain core competitive advantages. Thus, predicting personnel future performance is a significant research domain in human...     

Insight into an unsupervised two-step sparse transfer learning algorithm for speech diagnosis of Parkinson’s disease

Neural Computing and Applications - Speech diagnosis of Parkinson’s disease (PD) as a non-invasive and simple diagnosis method is particularly worth exploring. However, the number of samples...     

基于CPLD的系统硬件看门狗设计

基于以DSP芯片TMS320F2812为核心的数字伺服控制器,以国微电子公司的SM1032国产CPLD(兼容Lattice公司的ispLSI 1032)为载体,设计了专用的系统硬件看门狗模块,具备识别DSP软件初始化时序、自由定制看门狗时序等功能。通过对伺服控制器上电及工作运行时序的分析、仿真和实验验证,确定了硬件看门狗功能模块的设计方案,并给出了实验结果。     

Probability-confidence-kernel-based localized multiple kernel learning with lp norm

Localized multiple kernel learning (LMKL) is an attractive strategy for combining multiple heterogeneous features in terms of their discriminative power for each individual sample. However, models excessively fitting to a specific sample would obstacle the extension to unseen data, while a more general form is often insufficient for diverse locality characterization. Hence, both learning sample-specific local models for each training datum and extending the learned models to unseen test data should be equally addressed in designing LMKL algorithm. In this paper, for an integrative solution, we propose a probability confidence kernel (PCK), which measures per-sample similarity with respect to probabilistic-prediction-based class attribute: The class attribute similarity complements the spatial-similarity-based base kernels for more reasonable locality characterization, and the predefined form of involved class probability density function facilitates the extension to the whole input space and ensures its statistical meaning. Incorporating PCK into support-vectormachine-based LMKL framework, we propose a new PCK-LMKL with arbitrary l(p)-norm constraint implied in the definition of PCKs, where both the parameters in PCK and the final classifier can be efficiently optimized in a joint manner. Evaluations of PCK-LMKL on both benchmark machine learning data sets (ten University of California Irvine (UCI) data sets) and challenging computer vision data sets (15-scene data set and Caltech-101 data set) have shown to achieve state-of-the-art performances.     

Interactive image segmentation based on level sets of probabilities

In this paper, we present a robust and accurate algorithm for interactive image segmentation. The level set method is clearly advantageous for image objects with a complex topology and fragmented appearance. Our method integrates discriminative classification models and distance transforms with the level set method to avoid local minima and better snap to true object boundaries. The level set function approximates a transformed version of pixelwise posterior probabilities of being part of a target object. The evolution of its zero level set is driven by three force terms, region force, edge field force, and curvature force. These forces are based on a probabilistic classifier and an unsigned distance transform of salient edges. We further propose a technique that improves the performance of both the probabilistic classifier and the level set method over multiple passes. It makes the final object segmentation less sensitive to user interactions. Experiments and comparisons demonstrate the effectiveness of our method.     

Two new characteristic parameters for runoff computation

A method capable of estimating the hydrograph from a prescribed storm for a practical mild slope upstream catchment is proposed. This method makes use of two new characteristic parameters, andS, in conjunction with the kinematic wave equation to compute lateral inflows of the main stream of the catchment. The depth profile of overland flow at any instant within the catchment and hydrograph at any location can be easily found. Lag times for individual lateral inflows are then considered and are linearly combined to obtain the hydrograph at the outlet of the catchment or depth profile of the main stream at any instant. The validity of the excess rainfall-surface runoff linear relationship in this study has also been verified with Tatsunokuchiyama catchment, and it shows good results for this computed runoff.     

对《网络创业实训》课程的探讨

针对各校对大学生创业实训进行讲授内容的不同,我们在结合本专业的基础上,开展了网络创业实训课程,在创业方向方面不再仅限于网店,而是可以进行多种模式的选择,同时在提高实践性方向,最终的成果也以创业企划书来全面衡量。