Intelligent analysis method of dam material gradation for asphalt-core rock-fill dam based on enhanced Cascade Mask R-CNN and GCNet

Reasonable dam materials’ gradation design for asphalt-core rock-fill dams is one of the main ways to control permeability. It is a challenge to test whether it can meet the requirements of dam construction. The computer vision method provides a new idea for asphalt-core rock-fill dam material gradation testing. However, due to the characteristics of densely overlapping and multi-scale sizes of dam material particles, the traditional image segmentation methods and algorithms cannot achieve accurate segmentation of dam materials’ images, and it is hard to apply the segmentation result to quantify the gradation curve. In this research, the enhanced Cascade Mask R-CNN with ResNet and PAFPN (Path Aggregation Feature Pyramid Networks) is proposed. Multi-scale features extracted by ResNet and feature ensemble can be realized using PAFPN. Data augmentation (DA) and online hard example mining (OHEM) are also applied in segmentation model training. Moreover, the GCNet is proposed to calibrate the gradation curve. The nonlinear relationship between the real gradation and the one based on the segmentation results can be revealed and the model of dam materials’ gradation analysis can be established. In the research, the enhanced Cascade Mask R-CNN can achieve 84.2 mAP, which is higher than that of Cascade Mask R-CNN with 74.9 mAP. The effectiveness of the proposed module and training strategies is proved using ablation experiments. The average error of each level for the gradation calibration using GCNet is 0.55%, 1.87%, 2.22%, 1.18%, and 2.42% respectively. The accuracy can meet the requirements of hydraulic engineering construction, which verifies the effectiveness of the GCNet network for gradation calibration, and the research provides a new method and technology for intelligent gradation testing of the asphalt-core rock-fill dam.     

基于流特征的数据中心非对称流负载均衡方法

数据中心边界广泛部署的地址转换技术产生的非对称流为负载均衡系统的设计带来了挑战.为了解决软件负载均衡系统不能充分发挥多核处理器和网卡硬件能力的问题,提出一种基于流特征的非对称流负载均衡方法.首先,分析网卡的数据包散列机制,提出数据包调度算法,将数据包调度至预期的CPU核;然后,基于会话报文序列的时间与空间特征,构建大象流识别算法;最后,基于识别结果,提出负载均衡方法.实验结果表明,非对称流负载均衡方法可以正确处理非对称流的负载均衡,平均吞吐率提升约14.5%.     

基于自适应方向导数滤波器的彩色边缘检测

传统彩色边缘检测算法在提高边缘检测准确性时可能将噪声检测为边缘,而在提高噪声鲁棒性时会将部分边缘当作噪声进行抑制,导致部分边缘信息丢失。为解决传统彩色边缘检测算法在边缘检测准确性与噪声鲁棒性之间的矛盾问题,提出一种基于自适应各向异性高斯方向导数（ANDD）的彩色边缘检测算法。通过彩色图像的微分自相关矩阵构建反映边缘类型的度量准则,以自适应地确定每个像素处ANDD滤波器的形状,从而准确提取不同类型的边缘特征,采用ANDD滤波器组对图像进行平滑处理,提取在三个通道上的ANDD特征。在此基础上,利用奇异值分解得到最优融合权值,并融合三个通道的ANDD特征,以增强彩色边缘强度。实验结果表明,该算法在无噪声和含噪声环境下的Pratt品质因子分别为0.849 6和0.791 4,与彩色Canny、RCMG-MM和FRPOS算法相比,在保持较高边缘检测准确率的同时具有较优的噪声鲁棒性。     

机载计算机BIT设计技术及策略研究

机内测试(Built-in Test,BIT)技术是改善系统或设备测试性和维修性的重要途径,通过在机载计算机中设计专门的BIT算法,可以达到大幅度提高机载计算机的可靠性和安全性的目的,但高的虚警率是阻碍其广泛应用的一个重要原因;在对机载计算机BIT虚警原因进行分析的基础上,提出一种新型的机载计算机BIT设计策略,并给出了算法流程图;提出了数字I/0通道、A/D、D/A通道、串行接口等关键部分的故障检测解决方案,经过实践证明该策略的测试覆盖率达90%以上,降低虚警率约35%,明显提高了机载计算机的可靠性及可维护性。     

消息分发系统中的元组空间分解算法研究

为解决分布式环境下消息分发系统中的按需通信,在对Gelemter元组空间模型进行改进的基础上,对消息分发系统中的元组空间通信进行了结构设计,定义了元组空间的特征模型,并基于局部性原理提出一种元组空间通信的空间分解算法.该算法依据在实际通信中不同元组不同元素的匹配频度的差异,将元组空间分解为依赖特征空间、特征元组和特征元素之间抽象关系的一组缓冲子空间,通信进程在进行匹配操作时可直接从缓冲子空间中获取匹配元组,从而降低通信的计算成本.     

Efficiency determination of induction motors using multi-objective evolutionary algorithms

This paper introduces a method based on multi-objective evolutionary algorithms for the determination of in-service induction motor efficiency. In general, the efficiency is determined by accumulating multiple objectives into one objective by a linear combination and optimizing the resulting single-objective problem. The approach has some drawbacks such that exact information about solution alternatives will not be readily visible. In this paper the multi-objective evolutionary optimization algorithms, the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and Strength Pareto Evolutionary Algorithm-2 (SPEA2), are successfully applied to the efficiency determination problem in induction motor. The performances of algorithms are compared on the basis of the obtained results.     

一种高效的基于身份的可验证加密签名方案

基于Shim数字签名方案,提出了一种基于身份的可验证加密签名方案.该方案不需要零知识证明系统提供验证,避免了因复杂交互而产生的计算负担,该方案的可验证加密签名仅需在普通签名参数上作一次加法运算即可完成,可验证加密签名的验证仅需在普通签名验证等式右边作一次乘法运算即可实现,方案形式较为简洁,在CDH问题难解的假设下,该方...     

A new feature selection method on classification of medical datasets: Kernel F-score feature selection

In this paper, we have proposed a new feature selection method called kernel F-score feature selection (KFFS) used as pre-processing step in the classification of medical datasets. KFFS consists of two phases. In the first phase, input spaces (features) of medical datasets have been transformed to kernel space by means of Linear (Lin) or Radial Basis Function (RBF) kernel functions. By this way, the dimensions of medical datasets have increased to high dimension feature space. In the second phase, the F-score values of medical datasets with high dimensional feature space have been calculated using F-score formula. And then the mean value of calculated F-scores has been computed. If the F-score value of any feature in medical datasets is bigger than this mean value, that feature will be selected. Otherwise, that feature is removed from feature space. Thanks to KFFS method, the irrelevant or redundant features are removed from high dimensional input feature space. The cause of using kernel functions transforms from non-linearly separable medical dataset to a linearly separable feature space. In this study, we have used the heart disease dataset, SPECT (Single Photon Emission Computed Tomography) images dataset, and Escherichia coli Promoter Gene Sequence dataset taken from UCI (University California, Irvine) machine learning database to test the performance of KFFS method. As classification algorithms, Least Square Support Vector Machine (LS-SVM) and Levenberg–Marquardt Artificial Neural Network have been used. As shown in the obtained results, the proposed feature selection method called KFFS is produced very promising results compared to F-score feature selection.     

Global optimization of case-based reasoning for breast cytology diagnosis

Case-based reasoning (CBR) is one of the most popular prediction techniques in medical domains because it is easy to apply, has no possibility of overfitting, and provides a good explanation for the output. However, it has a critical limitation – its prediction performance is generally lower than other AI techniques like artificial neural networks (ANN). In order to obtain accurate results from CBR, effective retrieval and matching of useful prior cases for the problem is essential, but it is still a controversial issue to design a good matching and retrieval mechanism for CBR systems. In this study, we propose a novel approach to enhance the prediction performance of CBR. Our suggestion is the simultaneous optimization of feature weights, instance selection, and the number of neighbors that combine using genetic algorithms (GA). Our model improves the prediction performance in three ways – (1) measuring similarity between cases more accurately by considering relative importance of each feature, (2) eliminating useless or erroneous reference cases, and (3) combining several similar cases represent significant patterns. To validate the usefulness of our model, this study applied it to a real-world case for evaluating cytological features derived directly from a digital scan of breast fine needle aspirate (FNA) slides. Experimental results showed that the prediction accuracy of conventional CBR may be improved significantly by using our model. We also found that our proposed model outperformed all the other optimized models for CBR using GA.