检索结果-内蒙古大学图书馆

International Conference on Bio-Inspired computing: Theories and Applications, BICTA

作者： Xingxin Pei Wenjian Luo Nature Inspired Computation and Application Laboratory School of Computer Science and Technology Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China

Evolutionary Negative Selection Algorithms (ENSAs) could be regarded as hybrid algorithms of Evolutionary Algorithms (EAs) and Negative Selection Algorithms (NSAs). The average time complexity of ENSAs on combinational optimization problems has never been studied before. In this paper, the average time complexity of ENSAs on one combinational optimization problem is analyzed. The theoretical results demonstrate that, for the Two Max function, the ENSA with an appropriate matching threshold could perform better than the traditional (N+N) EA. Some simulation experiments on the combinational problem are also done, and the experimental results are consistent with theoretical results.

关键词： Algorithm design and analysis software algorithms Immune system Convergence Laboratories Computer applications Application software Computer science Evolutionary computation Biology computing

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Algorithm for the Laser Stripe Centreline Extraction 17

A Hybrid Algorithm for the Laser Stripe Centreline Extractio...

引用

17th CIRP Conference on Computer Aided Tolerancing, CAT 2022

作者： Mao, Zirui Xu, Yuanping Guo, Benjun Li, Tukun Jiang, Xiangqian Shi, Yajing Cao, Yanlong Xu, Zhijie Zhang, Chaolong Huang, Jian School of Software Engineering Chengdu University of Information Technology Chengdu China School of Computing and Engineering University of Huddersfield HuddersfieldHD1 3DH United Kingdom Key Laboratory of Advanced Manufacturing Technology of Zhejiang Province College of Mechanical Engineering Zhejiang University Hangzhou310027 China

Centreline extraction is one of the critical processes of structured light systems that play an increasingly important role in industry 4.0. This paper proposes a novel algorithm to extract the centreline by combining an improved skeleton thinning algorithm to extract the initial centreline and an improved grey centroid algorithm to establish the final centreline. It consists of several steps: Firstly, an image difference operation and a thresholding operation are undertaken, and the Canny edge detection algorithm is applied to locate the approximate position of the laser stripe to reduce the image matrix calculation cost;Secondly, an initial centreline is extracted via the use of an image morphology operation and a skeleton thinning algorithm;Finally, a high-power grey centroid method is employed to acquire the centreline at the sub-pixel level. Experiments together with a comparison with other mainstream methods is conducted to test the validity and practicability of the proposed hybrid algorithm. The experimental results show that the speed of the proposed algorithm is 50% faster than the Steger algorithm, and the root-mean-square error is 40% lower than the grey centroid method. © 2022 The Author(s).

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

A Local Trust Model Based on Time Influence Function in P2P Networks

A Local Trust Model Based on Time Influence Function in P2P ...

引用

2015 6th IEEE International Conference on software Engineering and Service Science(ICSESS 2015)

作者： Yan-xia Cui Hong-yun Ning Yun-yun Du Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology School of Computer and Communication Engineering Tianjin University of Technology Key Laboratory of Computer Vision and System Ministry of Education School of Computer and Communication Engineering Tianjin University of Technology

In peer-to-peer network environment, there is no centralized management authority to be relied on, so the service provider and service requester have to establish some assessment model, and evaluate the dynamic behavior of others, then choose more credible trusted entities to interact. Only in this way can they ensure security, safety and reliable decisions. On the basis of Eigen Trust model, a local trust value computation model considering time effect function is put forward, and it reduces the network overhead, increases the binding force of malicious nodes,and makes the trust value computation model more reliable and accurate. Simulation experiments show that the improved model proposed in this paper greatly reduces the network overhead indeed, and transaction success rate of nodes is higher than Eigen Trust model in the presence of malicious nodes in the P2P system.

关键词： component P2P network security trust models time influence function

来源：评论

学校读者我要写书评

暂无评论

IPRAR: A DFG-based approach to instruction clustering for multicluster VLIW DSP processor with SIMD structure

引用

Journal of Computational Information Systems 2014年第3期10卷 1257-1269页

作者： Yang, Yangzhao Gu, Naijie Zhao, Zeng Ren, Kaixin School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China USTC and Loongson Technology Associated Laboratory Institute of Advanced Technology University of Science and Technology of China Hefei 230027 China

Modern Very Long Instruction (VLIW) DSP can improve performance by using instruction-level parallelism (ILP) and obtain better parallelism through instruction clustering. The essence of clustering is resource allocation. Traditional clustering method assumes that one instruction can only be assigned to a certain cluster, which is inapplicable to the architecture with SIMD structure. To address this issue, this paper presents IPRAR, a novel instruction clustering algorithm for the features of SIMD structure based on DFG. Due to considering the features of SIMD structure, IPRAR can be implemented on BWDSP100 with satisfactory. Besides, IPRAR can make the load of cluster more balanced and minimize the intercluster communication overload. Finally, numerous experiment results show that the IPRAR has an average of 7-10% performance improvement compared to the traditional methods. © 2014 Binary Information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Bi-dimensional Variational Mode Decomposition for Surface Texture Analysis 17

Bi-dimensional Variational Mode Decomposition for Surface Te...

引用

17th CIRP Conference on Computer Aided Tolerancing, CAT 2022

作者： Li, Zhuowei Xu, Yuanping Li, Tukun Shi, Yajing Jiang, Xiangqian Cao, Yanlong Zeng, Wenhan Xu, Zhijie Zhang, Chaolong Huang, Jian School of Software Engineering Chengdu University of Information Technology Chengdu China School of Computing and Engineering University of Huddersfield HuddersfieldHD1 3DH United Kingdom Key Laboratory of Advanced Manufacturing Technology of Zhejiang Province College of Mechanical Engineering Zhejiang University Hangzhou310027 China

In surface metrology, filtration is one of the key operations which is used to decompose the components of the surface and extract a scale-limited surface for further assessment. Although many types of filters have been proposed and some of them have been standardized in ISO16610 serials, the classic surface topography filters often inherit the mode mixing and boundary distortion problems that may lead to surface texture verification failures. This study proposes a new filter algorithm for the surface texture analysis, and it is based on the extended bi-dimensional variational mode decomposition (BVMD), named EBVMD. BVMD is widely used in the field of image processing and it is probably first-time to be used in the field of surface texture analysis. It consists of three steps. Firstly, a coarse-grained parallel genetic algorithm is applied in the devised model to select of optimal penalty factor and decomposition number of the bi-dimensional variational mode, and the best set of modes is gained. Secondly, the instantaneous wavelength value of each mode is obtained by calculating the corresponding isotropic monogenic signals. Finally, the scale-limited surface is extracted by the mean instantaneous wavelength. Experiments are conducted to verify the feasibility of the proposed filter on areal surface texture feature extraction with the mode aliasing and shape distortion phenomenon remedies. The experimental results show that the mean square error of roughness reconstructed by the proposed filter compared with the benchmarking values is 6.37×10-5, and owing to high flexibility in practice, the devised EBVMD provides a promising solution to achieve a high accuracy and efficiency filter. © 2022 The Author(s).

关键词： Variational mode decomposition

来源：评论

学校读者我要写书评

暂无评论

Improvement of key in ZigBee wireless network

引用

Information Technology Journal 2013年第18期12卷 4593-4596页

作者： Li, Wenjie Cao, Qianqian Liu, Zhuzi Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology School of Computer and Communication Engineering Tianjin University of Technology Tianjin 300384 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology China

Zigbee provides a connection to a variety of wireless devices and solves the problem of the communicating between different protocols. ZigBee can provide wireless communication which is low rate, low complexity, short distance and low cost. Due to the existence of various attacks in the wireless transmission, security becomes a bottleneck for Zigbee applications. In the study, we designed the model based on dynamic key which is sent in Zigbee network and analyzed its performances. © 2013 Asian Network for Scientific Information.

关键词： Zigbee

来源：评论

学校读者我要写书评

暂无评论

Optimizing BLAS2 for a decoupled access/execute architecture processor

引用

Journal of Computational Information Systems 2014年第3期10卷 1231-1241页

作者： Zhao, Zeng Gu, Naijie Yang, Yangzhao Ren, Kaixin School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China USTC and Loongson Technology Associated Laboratory Institute of Advanced Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China

Basic Linear Algebra Subroutines (BLAS) is a widely used basic mathematical library for high-performance computing. It has a great impact on the performance of supercomputers. This paper focuses on memory accessing optimization for the level-2 library of BLAS (BLAS2) based on Godson-3B chips. The key contribution of this work is proposing several methods to make full use of the Godson-3B's hardware features, as well as to improve the performance of memory access. GEMV, the kernel function of BLAS2, is selected to demonstrate the optimization methods for Godson-3B. Using Single Instruction Multiple Data (SIMD) instructions, Direct Register Access (DRA) and Direct Cache Access (DCA) of Godson-3B, two optimization algorithms for GEMV are introduced in this paper. Experiments show that the best computing performance of the optimized GEMVs on Godson-3B is more than 1.8Gops, which is far superior to that of other versions. While the test scale of GEMVs is greater than the size of L2-cache, its average performance exceeds UBLAS and OpenBlas, the two most famous optimized BLAS libraries for GODSON, by more than 60% and 20% respectively. © 2014 Binary Information Press.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Network Security Evaluation Algorithm Based on Access Level Vectors

Network Security Evaluation Algorithm Based on Access Level ...

引用

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Kai Li Naijie Gu Kun Bi Hongzhu Ji Department of Computer Science and Technology University of Science and Technology of China Hefei China 230027 Anhui Province Key Lab. of Computing and Communication Software Hefei China 230027

The attack graph, a typical model-based method, is widely used in the field of network security evaluation. The biggest disadvantage of attack graph method is its exponential growth of the state space. This paper presents an efficient algorithm based on the malefactor's access level vector in every host of the network to generate a reduced attack graph in polynomial compute complexity. In this algorithm, the state space is reduced to O(nm) , where n is the number of nodes and m is the whole number of vulnerabilities in the network. We also present a standard method to generate attack templates from the vulnerabilities.

关键词： Network security evaluation attack graph access level vector attack template.

来源：评论

学校读者我要写书评

暂无评论

Scheduling Model for Cognitive Radio

Scheduling Model for Cognitive Radio

引用

3rd International Conference on Cognitive Radio Oriented Wireless Networks and communications (CrownCom 2008)

作者： Ping Zhu Jinglong Li Xufa Wang Department of Computer Science and Technology Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China Department of Computer Science and Technology University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781424423019

The priority queue model divides CR (cognitive radio) system users into primary user and secondary user. The primary user has preemptive priority over secondary user, while the same priority level users are FIFO served. This paper models the CR system based on scheduling technology. The secondary users are further divided into different priority levels. A hybrid priority dynamic policy, which indicates primary user's preemptive priority and secondary user's nonpreemptive priority, is developed to reduce spectrum switch overhead during spectrum leasing process. Theoretical analyzing shows that hybrid priority reduces the spectrum switch overhead and the hybrid priority improvement is a non-negative mono-increasing function of priority level. Based on the proposed policy, CR scheduling model is built and CR scheduling rule is provided and proved. Experimental comparison between CR scheduling and priority queue shows that CR scheduling gets a smaller weighted staying time sum than priority queue and the improvement increases as system becomes more congested.

关键词： Cognitive radio Priority queue CR schedule

来源：评论

学校读者我要写书评

暂无评论

A Preliminary Study on Why Using the Nonself Detector Set for Anomaly Detection in Artificial Immune Systems

A Preliminary Study on Why Using the Nonself Detector Set fo...

引用

International Conference on Computational Intelligence and Security

作者： Baoliang Xu Wenjian Luo Xufa Wang Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China University of Science and Technology of China Hefei Anhui CN

ISBN: (纸本)9781424454112

In artificial immune systems, the detectors in the nonself space are often adopted to detect anomaly changes, such as the negative selection algorithm and its improvements. Since the detectors in the self space can also be used to detect anomaly changes, a frequently asked question is which kind of detector sets is more efficient for a specific problem. In this paper, firstly, the advantages and disadvantages of the self detector set and the nonself detector set are briefly reviewed. Secondly, when the complete matching rule is adopted, the average time costs of employing the nonself detector set and the self detector set for anomaly detection are compared theoretically. Thirdly, simulated experiments are done, and experimental results demonstrate that the theoretical conclusion is essentially correct.

关键词： Detectors Artificial immune systems Space technology Costs Immune system Biological system modeling Monitoring Laboratories Intrusion detection Biology computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：