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

International Workshop on Advanced Computational Intelligence (IWACI)

作者： Junteng Wang Wenjian Luo Yamin Hu Hao Jiang Anhui Province Key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (数字)9781728142487

ISBN: (纸本)9781728142494

Cryptographic hash functions play significant roles in information security applications, including data integrity. Facing hash collision attacks, several prevalent cryptographic hash functions have been proved not safe enough. In this paper, we propose a simple scheme for data integrity check called PN-HASH (Positive hash and Negative hash). PN-HASH is inspired by the negative representation of information, which is a research branch in the field of immune computation. This scheme computes two hash values of the input message and its negative representation. The resulting hashes are called the positive hash and the negative hash, respectively. The proposed scheme is simple but can improve the resistance to hash collision attacks. Furthermore, for more flexibility and higher security, we propose three extensions of PN-HASH. Security and complexity analyses show that PN-HASH could improve the security of underlying cryptographic hash functions, with approximately twice cost of them. To give exact examples, we present PN-MD5, an implementation of PN-HASH based on MD5.

关键词： Cryptography Data integrity Databases Resistance Complexity theory Face

来源：评论

学校读者我要写书评

暂无评论

An immune based algorithm for Chinese network short text clustering

引用

Zidonghua Xuebao/ Acta Automatica Sinica 2009年第7期35卷 896-902页

作者： He, Tao Cao, Xian-Bin Tan, Hui School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Laboratory of Software in Computing and Communication Anhui Province Hefei 230027 China School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 China

Network short text clustering is a major technology in network content security. Since Chinese network short text is less of keywords and full of anomalous writings, the traditional text clustering method is not directly suitable for network short text clustering. This paper presents an immune network regulation based method to cluster Chinese network short texts. First, Chinese N-gram chunks are extracted and transformed to Chinese pinyin to form the feature representation to each Chinese network short text, so as to relieve these two characteristics' bad influence on the clustering performance. Then, the network short text set is constructed as a dynamic network and an immune network learning mechanism is used to learn the similarity among short texts and therefore to gain a better clustering result. Experiments show our method can get better performance in Chinese network short text clustering, compared with traditional method such as K-means. © 2009 Acta Automatica Sinica. All rights reserved.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks

Joint Sink Mobility and Data Diffusion for Lifetime Optimiza...

引用

IEEE Asia-Pacific Conference on Services Computing (APSCC)

作者： Yu Gu Hengchang Liu Fei Song Baohua Zhao Department of Computer Science Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China Department of Computer Science University of Virginia Charlottesville VA USA

In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularly challenging since we need to consider both mobility scheme and storage constraint. Previous works suggest to use a simple single-hop routing model in which source nodes can only communication with the sink node directly in those mobile networks. However, we notice that this statement is unsuitable for sensor networks with storage constraint because we prove it is a NP-complete problem under single-hop routing model by reducing the traveling salesman problem (TSP) to it in polynomial time. Hence, we try a different way. First we analyze this problem and give a lifetime upperbound, so whether this upperbound is tight is what we concern mostly. Thus, we first construct a 2-approximation O(n 2 ) algorithm to solve the TSP problem, then a novel data diffusion mechanism is built to achieve this upperbound. We prove that under some reasonable assumptions, our algorithm can output this optimal lifetime.

关键词： Wireless sensor networks Routing computer networks Constraint optimization computer science Mobile communication NP-complete problem Traveling salesman problems Polynomials Monitoring

来源：评论

学校读者我要写书评

暂无评论

The Learning-Bargaining Algorithm Used in Unlicensed Spectrum Pre-Allocation

The Learning-Bargaining Algorithm Used in Unlicensed Spectru...

引用

第三届IEEE无线通讯、网络技术暨移动计算国际会议

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

In the wireless network of finite spectrum resource, some communication users probably do not allocate the spectrum so that their communication should be delayed. Thus it is necessary to arrange the communication time of the systems when we allocate the communication spectrum. We propose a games learning-bargaining algorithm to pre-allocate the communication resources in the frequency-time space. Through this distributed games learning, each user obtains its communication schedule, and the result of allocation is further improved by the bargaining process. The result of this algorithm makes the bandwidth utilization achieve a quite high level and arranges the global communication time as short as possible. Comparing with the centralized algorithm of NP-hard, this distributed algorithm has low time complexity. The experiments verify the convergence of the algorithm and present the superiorities of our results to other allocation algorithms.

关键词： Cognitive Radio Spectrum Allocation Game Theory Learning-Bargaining Time Complexity.

来源：评论

学校读者我要写书评

暂无评论

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.

来源：评论

学校读者我要写书评

暂无评论

Link-weighted and distance-constrained channel assignment in single-radio wireless mesh networks

Link-weighted and distance-constrained channel assignment in...

引用

Conference on Local computer Networks (LCN)

作者： Junfeng Jin Baohua Zhao Hao Zhou School of Computer Science University of Science and Technology Hefei Anhui China Province Key Laboratory of Software in Computing and Communication Hefei Anhui China School of Computer Science University of Science and Technology of China Hefei Anhui

In this work, we study a link-weighted and distance-constrained channel assignment problem in multi-channel mesh networks with stationary router nodes, such as community wireless networks. A good channel assignment is given as the one which can minimize interference of each link from its neighboring links and subsequently improve the network throughput. In response to it, we introduce an interference metric, namely, min-max i-value of an edge (MMIE), to explicitly accounts for interference among links that are at distance one. In addition, we further show that the link-weighted and distance-constrained channel assignment problem with respect to the interference metric is NP-hard in computation. This guides us to propose a new heuristic channel assignment algorithm called LD-CA algorithm. We study the performance of our algorithm by implementing it in a wireless simulation environment consisting of 25 nodes, each equipped with one 802.11 wireless card. The ns-2 simulation results show that in a multi-channel environment, the LD-CA algorithm significantly outperforms previously proposed channel assignment schemes by minimizing MMIE of all links.

关键词： Wireless mesh networks Interference Mesh networks Throughput Spread spectrum communication laboratories Computational modeling Switches Conferences computer network management

来源：评论

学校读者我要写书评

暂无评论

An Energy-Aware Coverage Based Node Scheduling Scheme for Wireless Sensor Networks

An Energy-Aware Coverage Based Node Scheduling Scheme for Wi...

引用

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

作者： Jinxia Liu Naijie Gu Songsong He Dept. of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei Anhui 230027 China

A fundamental issue in wireless sensor network is to extend network lifetime while maintaining network coverage and connectivity. Protection for sensors themselves is another important concern. An Energyaware Coverage based Node Scheduling scheme (ECNS) is proposed to provide protection for sensors and guarantees network connectivity and desired coverage level. ECNS enables each node to decide whether it is eligible to turn off to conserve energy through local information exchange with its neighbors. Simulation results show that ECNS improves network performance with respect to energy conservation, load balance and network lifetime.

关键词： Sensor network coverage network connectivity lifetime node scheduling scheme.

来源：评论

学校读者我要写书评

暂无评论

Directed differential evolution based on directional derivative for numerical optimization problems

Directed differential evolution based on directional derivat...

引用

International Conference on Hybrid Intelligent Systems (HIS)

作者： Jun Zhang Wenjian Luo School of Computer Science and Technology University of Science and Technology Hefei Anhui China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology Hefei Anhui China

Differential Evolution is one kind of Evolutionary Algorithms, which has been successfully applied to solve many optimization problems. In this paper, a directed differential mutation (DDM), which utilizes the directional derivative to decide a suitable search direction and a proper mutation step size, is proposed. It is merged into the classical DE to form a new algorithm, named directed differential evolution (DDE). The performance of the DDE is tested on 23 classical problems for numerical optimization. The experimental results demonstrate that the performance of the DDE outperforms the classical DE on most functions.

关键词： Optimization Vectors Equations Hybrid intelligent systems Algorithms Programming Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

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 fine-grained algorithm for generating hard-toreverse negative databases

A fine-grained algorithm for generating hard-toreverse negat...

引用

International Workshop on Artificial Immune Systems (AIS)

作者： Dongdong Zhao Wenjian Luo Ran Liu Lihua Yue Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China School of Computer Science China University of Geosciences Wuhan China

The negative database (NDB) is a new technique for privacy preserving and information hiding. It hides information by storing the complementary set instead of the original data. In order to protect the hidden information, NDBs should be hard-to-reverse. In this paper, we propose the K-hidden algorithm for generating hard-to-reverse NDBs (called K-hidden-NDBs). The K-hidden algorithm could be controlled in a more fine-grained manner than existing NDB generation algorithms. Moreover, in terms of the SAT solvers based on the local search strategy, we formally prove that the K-hidden-NDBs could be more hard-to-reverse than the NDBs generated by the typical p-hidden algorithm. Furthermore, we show that the K-hidden-NDB could be more hard-to-reverse (against the local search strategy) than the q-hidden-NDB (NDBs generated by the q-hidden algorithm) when the sizes of NDBs are the same. Finally, as for the Unit Clause heuristic solvers, we prove that the K-hidden-NDB could be the same hard-to-reverse as the q-hidden-NDB.

关键词： Search problems Databases Security Data privacy Algorithm design and analysis computer science NP-hard problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：