基于可视化图形特征的入侵检测方法

入侵检测是保障网络安全的重要措施,网络攻击手段的多样性和隐蔽性不断增强导致入侵检测愈加困难,迫切需要研究新的入侵检测方法。结合可视化技术和k近邻分类算法,提出一种基于图形特征的入侵检测方法。采用信息增益方法对原始特征进行排序选择,并进行雷达图可视化表示,提取雷达图的图形特征构成新的数据集并送入k近邻分类器进行训练和测试。通过KDDCUP99数据集仿真实验表明,该方法不仅能直观显示攻击行为,而且获得较好的攻击检测性能,对DOS攻击的检测率可达97.9%,误报率为1.5%。     

A smart local moving algorithm for large-scale modularity-based community detection

We introduce a new algorithm for modularity-based community detection in large networks. The algorithm, which we refer to as a smart local moving algorithm, takes advantage of a well-known local moving heuristic that is also used by other algorithms. Compared with these other algorithms, our proposed algorithm uses the local moving heuristic in a more sophisticated way. Based on an analysis of a diverse set of networks, we show that our smart local moving algorithm identifies community structures with higher modularity values than other algorithms for large-scale modularity optimization, among which the popular “Louvain algorithm”. The computational efficiency of our algorithm makes it possible to perform community detection in networks with tens of millions of nodes and hundreds of millions of edges. Our smart local moving algorithm also performs well in small and medium-sized networks. In short computing times, it identifies community structures with modularity values equally high as, or almost as high as, the highest values reported in the literature, and sometimes even higher than the highest values found in the literature.     

一种公共网络攻击数据挖掘智能算法研究

公共网络的开放性和自组织特性导致网络容易受到病毒干扰和入侵攻击,对攻击数据的准确高效挖掘能确保网络安全。传统方法采用时频指向性波束特征聚类方法实现攻击数据挖掘,在信噪比较低时攻击数据准确挖掘概率较低。提出一种基于自适应滤波检测和时频特征提取的公共网络攻击数据挖掘智能算法。首先进行公共网络攻击数据的信号拟合和时间序列分析,对含噪的攻击数据拟合信号进行自适应滤波检测,提高信号纯度,对滤波输出数据进行时频特征提取,实现攻击数据的准确挖掘。仿真结果表明,采用该算法进行网络攻击数据挖掘,对攻击数据特征的准确检测性能较高,对干扰的抑制性能较强,能有效实现网络安全防御。     

Detecting Communities by Revised Max-flow Method in Networks

A ubiquitous phenomenon in networks is the presence of communities within which the network connections are dense and between which they are sparser.This paper proposes a max-flow algorithm in bipartite networks to detect communities in general networks.Firstly,we construct a bipartite network in accordance with a general network and derive a revised max-flow problem in order to uncover the community structure.Then we present a local heuristic algorithm to find the optimal solution of the revised max-flow problem.This method is applied to a variety of real-world and artificial complex networks,and the partition results confirm its effectiveness and accuracy.     

Detecting Communities by Revised Max-flow Method in Networks

A ubiquitous phenomenon in networks is the presence of communities within which the network connections are dense and between which they are sparser. This paper proposes a max-flow algorithm in bipartite networks to detect communities in general networks. Firstly, we construct a bipartite network in accordance with a general network and derive a revised max-flow problem in order to uncover the community structure. Then we present a local heuristic algorithm to find the optimal solution of the revised max-flow problem. This method is applied to a variety of real-world and artificial complex networks, and the partition results confirm its effectiveness and accuracy.     

基于特征选择的网络入侵检测模型研究

为了有效从收集的恶意数据中选择特征去分析,保障网络系统的安全与稳定,需要进行网络入侵检测模型研究。但目前方法是采用遗传算法找出网络入侵的特征子集,再利用粒子群算法进行进一步选择,找出最优的特征子集,最后利用极限学习机对网络入侵进行分类,但该方法准确性较低。为此,提出一种基于特征选择的网络入侵检测模型研究方法。该方法首先以增强寻优性能为目标对网络入侵检测进行特征选择,结合分析出的特征选择利用特征属性的Fisher比构造出特征子集的评价函数,然后结合计算出的特征子集评价函数进行支持向量机完成对基于特征选择的网络入侵检测模型研究方法。仿真实验表明,利用支持向量机对网络入侵进行检测能有效地提高入侵检测的速度以及入侵检测的准确性。     

基于蚁群算法的辊式涂布涂层厚度图像检测

针对目前辊式涂布涂层厚度检测效率低、准确率低等问题,提出一种基于启发式蚁群算法的辊式涂布涂层厚度机器视觉检测方法。采用Canny算子的原理提取出边缘信息,得到了边缘点的先验知识;然后建立了改进的蚁群算法的边缘追踪模型,实现了信息素和启发信息对蚂蚁的导向作用,同时较好地避免了蚂蚁在非边缘区域的分布和行走,解决了传统蚁群算法中随机性与正反馈两种机制的协调问题,使用改进蚁群算法的机器视觉法进行测量实验,与机理建模法对比最大误差为5.74%,平均误差为4.04%,满足实际生产需要。     

A robust watermarking algorithm based on salient image features

A feature-based robust watermarking algorithm against geometric attacks is proposed in this paper. It is well-known that geometric attacks such as rotation, scaling, and translation on a watermarked image will destroy the synchronization between the processes of watermark embedding and detection. In other words, the locations for embedding the watermark are lost due to geometric attacks, which results in the failure of watermark detection. Since salient features in an image are relatively stable under geometric attacks, they may serve as reference points to synchronize the embedding and detection processes and the detection rate of the watermark could be increased significantly. Another problem for feature-based watermarking is that the repeatability of feature detection tends to be low; that is, the features detected during the embedding process may not be detected again during the detection process. To overcome such a problem, a novel feature enhancement technique is developed to increase the repeatability rate of feature detection, in which image moments are used to achieve geometric invariance between the embedding and detection processes. Experimental results demonstrate that the proposed watermarking algorithm is able to survive various geometric attacks and common image processing operations. And the visual quality of the watermarked image is well preserved as well.     

(Semi-)Automatically Parsing Private Protocols for In-Vehicle ECU Communications

In-vehicle electronic control unit (ECU) communications generally count on private protocols (defined by the manufacturers) under controller area network (CAN) specifications. Parsing the private protocols for a particular vehicle model would be of great significance in testing the vehicle’s resistance to various attacks, as well as in designing efficient intrusion detection and prevention systems (IDPS) for the vehicle. This paper proposes a suite of methods for parsing ECU private protocols on in-vehicle CAN network. These methods include an algorithm for parsing discrete variables (encoded in a discrete manner, e.g., gear state), an algorithm for parsing continuous variables (encoded in a continuous manner, e.g., vehicle speed), and a parsing method based on upper-layer protocols (e.g., OBD and UDS). Extensive verifications have been performed on five different brands of automobiles (including an electric vehicle) to demonstrate the universality and the correctness of these parsing algorithms. Some parsing tips and experiences are also presented. Our continuous-variables parsing algorithm could run in a semi-automatic manner and the parsing algorithm from upper-layer protocols could execute in a completely automatic manner. One might view the results obtained by our parsing algorithms as an important indicator of penetration testing on in-vehicle CAN network.     

网络疑似入侵环境下的最优接口访问控制模型仿真

在网络疑似入侵环境下通过最优接口访问控制实现网络入侵的可靠性拦截,保障网络安全。传统方法采用自由链路分散控制模型进行网络入侵检测和接口访问控制,在受到较大的特征干扰下,入侵访问控制和拦截性能不好。提出一种基于自适应循环堆栈接口调度的网络疑似入侵环境下的最优接口访问控制模型。进行接口访问控制模型总体设计及组件模块分析,接口访问控制系统包括通信库、协议库、核心控制库和资源库,采用小波包自适应波束调制方法进行入侵检测算法设计,作为接口访问控制系统软件核心。通过SDICmdCon寄存器设置网络疑似入侵环境下的最优接口的内核,在嵌入式Linux环境下通过自适应循环堆栈接口调度实现接口访问控制的软件开发。仿真结果表明,采用该模型进行网络入侵检测,准确检测性能较好,通过最优接口访问控制,实现对网络入侵数据的准确识别和拦截。     

How to Effectively Collect and Process Network Data for Intrusion Detection?

The number of security breaches in the cyberspace is on the rise. This threat is met with intensive work in the intrusion detection research community. To keep the defensive mechanisms up to date and relevant, realistic network traffic datasets are needed. The use of flow-based data for machine-learning-based network intrusion detection is a promising direction for intrusion detection systems. However, many contemporary benchmark datasets do not contain features that are usable in the wild. The main contribution of this work is to cover the research gap related to identifying and investigating valuable features in the NetFlow schema that allow for effective, machine-learning-based network intrusion detection in the real world. To achieve this goal, several feature selection techniques have been applied on five flow-based network intrusion detection datasets, establishing an informative flow-based feature set. The authors’ experience with the deployment of this kind of system shows that to close the research-to-market gap, and to perform actual real-world application of machine-learning-based intrusion detection, a set of labeled data from the end-user has to be collected. This research aims at establishing the appropriate, minimal amount of data that is sufficient to effectively train machine learning algorithms in intrusion detection. The results show that a set of 10 features and a small amount of data is enough for the final model to perform very well.     

基于热释电红外传感器的多节点定位系统研究与设计

针对热释电红外传感器(PIR)在人体探测领域中越来越广泛的应用,研究设计了一种基于PIR的检测定位系统,可实时完成对人员目标入侵探测区域时的检测与定位,并预推出人员目标的行进轨迹;该系统由多个PIR感知节点组成,每个感知节点通过传感在动、静两种状态下对探测区域进行信息采集;最终融合多节点与不同状态下传感器采集的数据,算出各个传感器的探测角度值,以交叉定位的算法,得到目标的定位坐标;经实验证明,该系统运行稳定,检测灵敏,定位效果很好,拓宽了热释电传感器在定位定向方面的使用范围。     

The Mean Field Theory of Spin Glasses: The Heuristic Replica Approach and Recent Rigorous Results

The mathematically correct computation of the spin glasses free energy in the infinite range limit crowns 25 years of mathematic efforts in solving this model. The exact solution of the model was found many years ago by using a heuristic approach; the results coming from the heuristic approach were crucial in deriving the mathematical results. The mathematical tools used in the rigorous approach are quite different from those of the heuristic approach. In this note we will review the heuristic approach to spin glasses in the light of the rigorous results; we will also discuss some conjectures that may be useful to derive the solution of the model in an alternative way.     

The “Hockey” Assist Makes the Difference—Validation of a Defensive Disruptiveness Model to Evaluate Passing Sequences in Elite Soccer

With the growing availability of position data in sports, spatiotemporal analysis in soccer is a topic of rising interest. The aim of this study is to validate a performance indicator, namely D-Def, measuring passing effectiveness. D-Def calculates the change of the teams’ centroid, centroids of formation lines (e.g., defensive line), teams’ surface area, and teams’ spread in the following three seconds after a pass and therefore results in a measure of disruption of the opponents’ defense following a pass. While this measure was introduced earlier, in this study we aim to prove the usefulness to evaluate attacking sequences. In this study, 258 games of Dutch Eredivisie season 2018/19 were included, resulting in 13,094 attacks. D-Def, pass length, pass velocity, and pass angle of the last four passes of each attack were calculated and compared between successful and unsuccessful attacks. D-Def showed higher values for passes of successful compared to unsuccessful attacks (0.001 < p ≤ 0.029, 0.06 ≤ d ≤ 0.23). This difference showed the highest effects sizes in the penultimate pass (d = 0.23) and the maximal D-Def value of an attack (d = 0.23). Passing length (0.001 < p ≤ 0.236, 0.08 ≤ d ≤ 0.17) and passing velocity (0.001 < p ≤ 0.690, −0.09 ≤ d ≤ 0.12) showed inconsistent results in discriminating between successful and unsuccessful attacks. The results indicate that D-Def is a useful indicator for the measurement of pass effectiveness in attacking sequences, highlighting that successful attacks are connected to disruptive passing. Within successful attacks, at least one high disruptive action (pass with D-Def > 28) needs to be present. In addition, the penultimate pass (“hockey assist”) of an attack seems crucial in characterizing successful attacks.     

Block based embedding of encrypted watermarks using singular value decomposition

Watermarking is a solution to the problem of copyright protection of multimedia documents over the Internet. This paper presents a block based watermarking scheme using the singular value decomposition (SVD) algorithm to embed encrypted watermarks into digital images. The paper compares between the traditional method of Liu and the proposed method for embedding encrypted watermarks. Also, a permutation based encryption algorithm and a diffusion based encryption algorithm are compared as the watermark encryption algorithms. Experimental results show that the proposed method is superior to the traditional method of Liu for embedding encrypted watermarks and extracting them efficiently under attacks. Results also show that it is preferred to use permutation based encryption algorithms than diffusion based encryption algorithms for watermark encryption due to their lower sensitivity to attacks.     

基于光谱和改进极限学习机的土壤含盐量分析

研究盐碱地的性质、组成,对于生态环境具有重要意义。传统的含盐量测定方法大多基于化学分析,因其成本高、效率低的缺点使得应用于大面积土地的可行性很低。极限学习机（ELM）作为一种基于前馈神经网络构建的机器学习系统,在许多研究中作为一种光谱处理方法被成功运用。为了改进传统的盐碱地含盐量检测方法,采用光谱学结合改进的极限学习机（ELM）模型的方法对盐碱地进行研究。根据镇赉县采集得到的62个土壤表层样本得到对应的光谱反射率和含盐量数据,提出了基于随机值改进粒子群优化算法（RVIPSO-MELM）优化的多层极限学习机模型。首先使用主成分分析提取光谱数据特征,并使用ELM算法对光谱数据建立分类模型,引入改进的粒子群优化算法以提高精度和速度。该模型结合了具有随机值的多层ELM（RV-MELM）和改进PSO算法的多层ELM（IPSO-MELM）二者的优点,在运用启发式算法搜索最优值的同时还具有随机性,提高了模型优化速度,同时以提高模型性能为目的对隐含层之间参数进行优化和选择。并且该模型可以推广到多层,对隐含层之间的参数的两种选择方法,根据经验公式计算和使用改进的启发式算法搜索,进行了提高模型性能和优化时间的讨论,实践结果表明,选择第一层参数使用改进粒子群优化算法,确定随后的隐含层之间参数选择,使用经验公式进行计算得到一种更具现实意义的方法模型。模型在进行启发式搜索最优值之前,利用蒙特卡罗方法确定一个较好的初值,使得模型能保持较高准确率的条件下,优化速度进一步提高。相比于传统方法,这种光谱分析结合ELM的模型节省时间和经济成本,有一定推广意义。     

Image watermarking algorithm based on fractional Fourier transform and random phase encoding

We propose an optical image watermarking algorithm based on fractional Fourier transform and random phase encoding. The proposed watermarking can be exactly implemented in optics and the secret key is passively generated by the proposed algorithm. In the packaged watermarking system, the host image is unchanged in the embedding procedure. This algorithm is fast and convenient for real-time implementation. PSNR between the host and distorted host images, MSE between the extracted and original watermarks are used to evaluate the performance of the proposed algorithm. Robustnesses against typical attacks are also analyzed. Numerical results have demonstrated its feasibility and effectiveness.     

On a recent attempt to define the interpretation basis in the many worlds interpretation of quantum mechanics

David Deutsch's 1985 algorithm to determine the preferred product structure and basis in the many worlds interpretation is examined. His heuristic argument for the conditions appearing in the algorithm is found wanting. The question of the existence and uniqueness of a final solution to his algorithm is discussed. The algorithm is shown to be inadequate to account for certain types of measurement which are, at least in principle, possible.     

An Image Encryption Algorithm Based on Discrete-Time Alternating Quantum Walk and Advanced Encryption Standard

This paper proposes an image encryption scheme based on a discrete-time alternating quantum walk (AQW) and the advanced encryption standard (AES). We use quantum properties to improve the AES algorithm, which uses a keystream generator related to AQW parameters to generate a probability distribution matrix. Some singular values of the matrix are extracted as the key to the AES algorithm. The Rcon of the AES algorithm is replaced with the elements of the probability distribution matrix. Then, the ascending order of the size of the clone probability distribution matrix scrambles the mapping rules of the S-box and ShiftRow transformations in the AES algorithm. The algorithm uses a probability distribution matrix and plaintext XOR operation to complete the preprocessing and uses the modified AES algorithm to complete the encryption process. The technology is based on simulation verification, including pixel correlation, histograms, differential attacks, noise attacks, information entropy, key sensitivity, and space. The results demonstrate a remarkable encryption effect. Compared with other improved AES algorithms, this algorithm has the advantages of the original AES algorithm and improves the ability to resist correlation attacks.     

Falkner–Skan Flow with Stream-Wise Pressure Gradient and Transfer of Mass over a Dynamic Wall

In this work, an important model in fluid dynamics is analyzed by a new hybrid neurocomputing algorithm. We have considered the Falkner–Skan (FS) with the stream-wise pressure gradient transfer of mass over a dynamic wall. To analyze the boundary flow of the FS model, we have utilized the global search characteristic of a recently developed heuristic, the Sine Cosine Algorithm (SCA), and the local search characteristic of Sequential Quadratic Programming (SQP). Artificial neural network (ANN) architecture is utilized to construct a series solution of the mathematical model. We have called our technique the ANN-SCA-SQP algorithm. The dynamic of the FS system is observed by varying stream-wise pressure gradient mass transfer and dynamic wall. To validate the effectiveness of ANN-SCA-SQP algorithm, our solutions are compared with state-of-the-art reference solutions. We have repeated a hundred experiments to establish the robustness of our approach. Our experimental outcome validates the superiority of the ANN-SCA-SQP algorithm.