用于研究专家系统的另一神模型──判别树及其寄生树

本文提出的判别树是一种既系统又直观地描述判别思路的模型,寄生树是一种用来判定判别树中结点的子特征的判别树。在专家系统的研究中,应用本模型有三个优点：①可有条理地描述、整理复杂的分类判别知识;②易于转换出相应的产生式规则或框架形式的知识库;③能清晰直观地指导设计高效的判别推理机。     

Association Rule Mining Frequent-Pattern-Based Intrusion Detection in Network

In the network security system, intrusion detection plays a significant role. The network security system detects the malicious actions in the network and also conforms the availability, integrity and confidentiality of data information resources. Intrusion identification system can easily detect the false positive alerts. If large number of false positive alerts are created then it makes intrusion detection system as difficult to differentiate the false positive alerts from genuine attacks. Many research works have been done. The issues in the existing algorithms are more memory space and need more time to execute the transactions of records. This paper proposes a novel framework of network security Intrusion Detection System (IDS) using Modified Frequent Pattern (MFP-Tree) via K-means algorithm. The accuracy rate of Modified Frequent Pattern Tree (MFPT)-K means method in finding the various attacks are Normal 94.89%, for DoS based attack 98.34%, for User to Root (U2R) attacks got 96.73%, Remote to Local (R2L) got 95.89% and Probe attack got 92.67% and is optimal when it is compared with other existing algorithms of K-Means and APRIORI.     

Hybrid Recommender System Using Systolic Tree for Pattern Mining

A recommender system is an approach performed by e-commerce for increasing smooth users’ experience. Sequential pattern mining is a technique of data mining used to identify the co-occurrence relationships by taking into account the order of transactions. This work will present the implementation of sequence pattern mining for recommender systems within the domain of e-commerce. This work will execute the Systolic tree algorithm for mining the frequent patterns to yield feasible rules for the recommender system. The feature selection's objective is to pick a feature subset having the least feature similarity as well as highest relevancy with the target class. This will mitigate the feature vector's dimensionality by eliminating redundant, irrelevant, or noisy data. This work presents a new hybrid recommender system based on optimized feature selection and systolic tree. The features were extracted using Term Frequency-Inverse Document Frequency (TF-IDF), feature selection with the utilization of River Formation Dynamics (RFD), and the Particle Swarm Optimization (PSO) algorithm. The systolic tree is used for pattern mining, and based on this, the recommendations are given. The proposed methods were evaluated using the MovieLens dataset, and the experimental outcomes confirmed the efficiency of the techniques. It was observed that the RFD feature selection with systolic tree frequent pattern mining with collaborative filtering, the precision of 0.89 was achieved.     

结合WLS滤波与还原控制因子的图像去雾

雾天退化图像的复原过程中,针对大气光幕和大气亮度估计不准确导致光晕效应、偏色现象和对比度不足等问题,提出一种结合WLS (weighted least square)滤波与还原控制因子的去雾算法.首先分析WLS滤波器的原理和性能,并用于大气光幕的有效提取;其次利用Sobel算子检测二值化图像边缘,将边缘数目与像素均值同时作为四叉树空间索引的依据,提高大气亮度的估计准确性;最后分析天空出现颜色失衡现象的原因,引入还原控制因子改善视觉效果.实验结果表明,去雾后图像的平均梯度整体提高58.03%,信息熵提高2.88%,运行时间节省50%以上.该方法对含有浓雾、薄雾以及天空等深度复杂的远景图像、近景图像均能得到高对比度、可视度和色彩保真度的恢复效果.     

分层网格划分实现海量地图标记物聚散可视化

在传统的地图可视化中,面对海量地图标记物展示会采用点聚合的方式,但是各类点聚合算法都是运行时计算,没有分层机制,在海量点的散开展示时,对于地图标记物堆叠没有过滤机制。针对这一问题,提出了分层的网格划分实现海量地图标记物聚散一体化解决方案。该方法对分层网格中心点构建K-D树索引,对海量点构建四叉树索引,通过索引和存储技术,实现了聚合的高效查询。对海量点散开时增加网格过滤,消除堆叠问题。在实验案例数据集上进行对比,结果表明,与传统的点聚合方案相比,在数据量大的情况下,计算性能显著提高,对海量标记物散开展示增加过滤算法,有效提升了用户体验。     

带有资源冲突的Seru在线并行调度算法

随着大规模定制的市场需求日趋显著,赛如生产系统(Seru production system,SPS)应运而生,逐渐成为研究和应用领域的热点.本文针对带有资源冲突的Seru在线并行调度问题进行研究,即需要在有限的空间位置上安排随动态需求而构建的若干Seru,以总加权完工时间最小为目标,决策Seru的构建顺序及时间.先基于平均延迟最短加权处理时间(Average delayed shortest weighted processing time,AD-SWPT)算法,针对其竞争比不为常数的局限性,引入调节参数,得到竞争比为常数的无资源冲突的Seru在线并行调度算法.接下来,引入冲突处理机制,得到有资源冲突的Seru在线并行调度算法,αAD-I(α-average delayed shortest weighted processing time-improved)算法,特殊实例下可通过实例归约的方法证明其竞争比与无资源冲突的情况相同.最后,通过实验,验证了在波动的市场环境下算法对于特殊实例与一般实例的优越性.     

计及置信容量的光热电站储热容量优化配置

为探索光热电站的容量价值,文中基于光热电站的容量置信度和度电成本,提出一种光热电站集热面积和储热容量优化方法。文中建立光热电站发电效率模型和经济性模型,基于序贯蒙特卡洛方法计算发电系统可靠性,使用粒子群算法计算光热电站置信容量,研究太阳倍数和储热时长分别对光热电站容量置信度和度电成本的影响;并以容量置信度和度电成本作为优化目标,使用加权理想点法建立目标优化函数、熵权法确定指标权重值,对太阳倍数和储热时长进行优化。以西北某地区光热规划为例,使用该地区实际太阳辐照资源数据建立模型,发现随着太阳倍数和储热时长的增加,容量置信度单调递增,而度电成本呈先降后升的趋势,可优化得到约束条件下最佳太阳倍数和储热时长。     

一种基于YOLOv4-TIA的林业害虫实时检测方法

针对现有基于深度学习的林业昆虫图像检测方法存在检测精度低和检测速度慢的问题,提出一种结合改进PANet结构与三分支注意力机制的目标检测方法YOLOv4-TIA。通过对样本数量较少的昆虫类别进行数据增强,实现样本均衡分布。利用三分支注意力机制改进YOLOv4中的CSPDarkNet53骨干网络,同时通过旋转操作和残差变换建立维度间的依存关系,以提高有效的特征通道权重,在PANet结构上增加将跳跃连接与跨尺度连接相结合的特征融合方式,从而获取更丰富的语义信息和位置信息。在此基础上,采用Focal loss函数优化分类损失,解决正负样本不均衡的问题。实验结果表明,该方法的精确率和召回率分别达到85.9%和91.2%,相比SSD、Faster R-CNN、YOLOv4方法,其在保证检测速度的同时,能够有效提高检测精度,且实现对林业害虫的实时精确监测。     

A mathematical model for vehicle routing problem under endogenous uncertainty

In this study, a multistage stochastic programming (SP) model is presented for a variant of single-vehicle routing problem with stochastic demands from a dynamic viewpoint. It is assumed that the actual demand of a customer becomes known only when the customer is visited. This problem falls into the category of SP with endogenous uncertainty and hence, the scenario tree is decision-dependent. Therefore, nonanticipativity of decisions is ensured by conditional constraints making up a large portion of total constraints. Thus, a novel approach is proposed that considerably reduces the problem size without any effect on the solution space. Computational results on some test problems are reported.