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

International Conference on Wireless communications, Networking and Mobile Computing (WiCom)

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

In adaptive secondary user channel allocation of cognitive radio, some users finish communication and release their channel as the time goes by, while some newcomers request channel resources to communicate. Thus, it is necessary to consider spectrum allocation process from the temporal perspective. In this paper, secondary users are modeled to a dynamic game similar to the chain store game, by which each user is able to achieve the equilibrium state adaptively without a central coordinator. We investigate the game through analyzing of correlated equilibria, which is computed easily and exhibits better results than Nash equilibria. We import some signal mechanisms based on time and sequence number that help users to achieve the correlated equilibria. The game algorithms based on correlated equilibrium are presented. The experimental results shows that our method have obvious superiorities to other allocation algorithms.

关键词： Channel allocation Cognitive radio Wireless sensor networks Laboratories Computer science Nash equilibrium Databases Base stations Resource management Game theory

来源：评论

学校读者我要写书评

暂无评论

Generating an Approximately Optimal Detector Set by Evolving Random Seeds

Generating an Approximately Optimal Detector Set by Evolving...

引用

IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC)

作者： Jie Zhang Wenjian Luo Baoliang Xu 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

The detector generation algorithm is the core of a negative selection algorithm (NSA). In most previous work, the NSAs generate the detector set randomly, which cannot guarantee to obtain an efficient detector set. To generate an approximately optimal detector set, in this paper, a novel detector generation algorithm for the real-valued negative selection algorithm (RNSA) is proposed. The proposed algorithm, named as the EvoSeedRNSA, adopts a genetic algorithm to evolve the random seeds to obtain an optimized detector set. The experimental results demonstrate that the EvoSeedRNSA has a better performance.

关键词： Detectors Genetic algorithms Shape software algorithms Computer science Laboratories Immune system Artificial immune systems Intrusion detection State-space methods

来源：评论

学校读者我要写书评

暂无评论

A hormone based tracking strategy for wireless sensor network

A hormone based tracking strategy for wireless sensor networ...

引用

IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS)

作者： Yipeng Zhang Haifeng You Xufa Wang Key Laboratory of Software in Computing and Communication Anhui Province School of Computer Science and Technology University of Science and Technology Hefei China

In this paper, we present a hormone based tracking strategy called Hormone based Activation (HA) for mobile target tracking in wireless sensor networks inspired by the bio-endocrine system. Hormone messages are used in sensor networks to coordinate sensor nodes for mobile target tracking in a self-adaptive way. Three kinds of hormones are introduced into sensor network for mobile target tracking: Base Hormone (BH),Wakeup Hormone (WH) and Sleep Hormone (SH).Based on different hormone messages, sensor nodes can choose to be asleep or awake in order to get good tracking results with less energy consumed. Comparative experiment shows that our strategy needs fewer nodes to wake up and has a much higher usage ratio of sensor nodes than other tracking strategies.

关键词： Biochemistry Wireless sensor networks Target tracking Biosensors Intelligent sensors Computer networks Mobile communication Sleep Energy efficiency communication system control

来源：评论

学校读者我要写书评

暂无评论

Test Case Generation Based on Invariant Extraction

Test Case Generation Based on Invariant Extraction

引用

International Conference on Wireless communications, Networking and Mobile Computing (WiCom)

作者： Fanping Zeng Qing Cao Liangliang Mao Zhide Chen Department of Computer Anhui Province Key Laboratory of Software in Computer and Communication University of Science and Technology Hefei Anhui China Department of Computer University of Science and Technology Hefei Anhui China

software testing is an effective way to find software errors. Generating a good test suite is the key. A program invariant is a property that is true at a particular program point or points. The property could reflect the program's execution over a test suite. Based on this point, we integrate the random test case generation technique and the invariant extraction technique, achieving automatic test case generation and selection. With the same invariants, compared with the traditional random test case generation technique, the experimental results show that the approach this paper describes can generate a smaller test suite.

关键词： software testing Electronic mail Automatic testing System testing Vehicle crash testing Data mining Costs Programming Automation Application software

来源：评论

学校读者我要写书评

暂无评论

Research on Buffer Overflow Test Based on Invariant

Research on Buffer Overflow Test Based on Invariant

引用

International Conference on Computer and Information Technology (CIT)

作者： Fanping Zeng Minghui Chen Kaitao Yin Xufa Wang Department of Computer Anhui Province Key Laboratory of Software in Computer and Communication University of Science and Technology Hefei Anhui China Department of Computer University of Science and Technology Hefei Anhui China

Buffer overflow (BOF) is one of the major vulnerabilities that lead to non-secure software. Testing an implementation for BOF vulnerabilities is challenging as the underlying reasons of buffer overflow vary widely. This paper presents a novel method for BOF test for ANSI C language, which uses program instrumentation and mutation test technology to test the BOF vulnerabilities, on the basis of analyzing the invariants for BOF vulnerabilities. The implementation shows that it can check the attack of BOF vulnerabilities adequately and accurately, in the circumstances of no large losses in performance.

关键词： Buffer overflow Instruments software testing Genetic mutations Monitoring Probes software libraries Runtime Information technology Performance loss

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Design of Relatively Large Combinational Circuits with an Extended Stepwise Dimension Reduction

Evolutionary Design of Relatively Large Combinational Circui...

引用

IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC)

作者： Zhifang Li Wenjian Luo Lihua Yue Xufa Wang School of Computer Science and Technology University of Science and Technology Hefei Anhui China 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

In this paper, an eXtended Stepwise Dimension Reduction approach (XSDR) to evolutionary design of relatively large combinational logic circuits is proposed. In our previous work, a Stepwise Dimension Reduction approach (SDR) is introduced. The SDR divides a circuit into several layers. The layers are evolved one after another. However, some layers are difficult to be evolved. The XSDR improves the SDR by decomposing the original truth table of a layer to two truth tables. The new truth tables after decomposing are easy to be evolved. The proposed method has been tested with multipliers and the circuits taken from the Microelectronics Center of North Carolina (MCNC) benchmark library. The experimental results demonstrate that the XSDR extensively improves the performance of the SDR in terms of the number of fitness evaluations and the computational time.

关键词： Combinational circuits Hardware Circuit testing Evolutionary computation Electronic circuits Computer science Laboratories Assembly Microelectronics Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

A real-time schedule method for aircraft landing scheduling problem based on cellular automaton 09

A real-time schedule method for aircraft landing scheduling ...

引用

2009 World Summit on Genetic and Evolutionary computation, 2009 GEC Summit - 1st ACM/SIGEVO Summit on Genetic and Evolutionary computation, GEC'09

作者： Shenpeng, Yu Xianbin, Cao Maobin, Hu Wenbo, Du Jun, Zhang Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 86-551-3601545 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230026 China School of Engineering Science University of Science and Technology of China Hefei 230026 86-551-3600127 China School of Electronic and Information Engineering Beihang University Beijing 100083 China

ISBN: (纸本)9781605583266

The Aircraft Landing Scheduling (ALS) problem is a typical hard multi-constraint optimization problem. In real applications, it is not most important to find the best solution but to provide a feasible landing schedule in an acceptable time. We propose a novel approach which can effectively solve the ALS while satisfying the real-time need. It consists of two steps: (i) Use CA to simulate the landing process in the terminal airspace and to find a considerably good landing sequence;(ii) a simple Genetic Algorithm associated with a Relaxation Operator is used to obtain a better result based on the CA result. Experiments have shown that our method is much faster and suitable for real-time ALS problem compared with traditional optimization methods. For all the 13 data sets, the proposed approach can find satisfactory solutions in less than 2 seconds. Copyright 2009 ACM.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

Constructing the Voronoi Diagram of Planar Point Set in Parallel

Constructing the Voronoi Diagram of Planar Point Set in Para...

引用

International Conference on computational Intelligence and software Engineering (CiSE)

作者： Lanfang Dong Yuan Wu Shanhai Zhou Anhui Province Key Laboratory of Software In Computing and Communication College of computer science and technology University of Science and Technology Hefei China College of computer science & technology University of Science and Technology Hefei China

By researching Voronoi diagram, parallel algorithm, and divide-and-conquer method, we present a special data structure(change doubly-connected list little) for Voronoi diagram generation in parallel. In this paper we also present two proposal, they are one processor gradually to merge and 22-merger on the parallel machine, the experiment results show that the present algorithm runs faster than the serial program. By analyzing the various results, we should choose the most suitable number of processors according to the point set scale. At last, we can conclude that gradually merger with one processor is better proposal for Voronoi diagram parallel generation.

关键词： Data structures Educational institutions Computer science Parallel algorithms Proposals Switches Merging Concurrent computing Parallel machines Geography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：