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

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

来源：评论

学校读者我要写书评

暂无评论

Random directional attack for fooling deep neural networks

arXiv

引用

arXiv 2019年

作者： Luo, Wenjian Wu, Chenwang Zhou, Nan Ni, Li 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 Anhui230027 China

Deep neural networks (DNNs) have been widely used in many fields such as images processing, speech recognition;however, they are vulnerable to adversarial examples, and this is a security issue worthy of attention. Because the training process of DNNs converge the loss by updating the weights along the gradient descent direction, many gradient-based methods attempt to destroy the DNN model by adding perturbations in the gradient direction. Unfortunately, as the model is nonlinear in most cases, the addition of perturbations in the gradient direction does not necessarily increase loss. Thus, we propose a random directed attack (RDA) for generating adversarial examples in this paper. Rather than limiting the gradient direction to generate an attack, RDA searches the attack direction based on hill climbing and uses multiple strategies to avoid local optima that cause attack failure. Compared with state-of-the-art gradient-based methods, the attack performance of RDA is very competitive. Moreover, RDA can attack without any internal knowledge of the model, and its performance under black-box attack is similar to that of the white-box attack in most cases, which is difficult to achieve using existing gradient-based attack methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Sparse learning for face recognition with social context

Sparse learning for face recognition with social context

引用

4th International Conference on Intelligence Science and Big Data engineering, IScIDE 2013

作者： Gui, Jie Mi, Jian-Xun Lei, Ying-Ke Wang, Hong-Qiang State Key Laboratory of Software Engineering Wuhan University 430072 China Hefei Institute of Intelligent Machines Chinese Academy of Sciences Hefei Anhui China State Key Laboratory for Novel Software Technology Nanjing University China Bio-Computing Research Center Shenzhen Graduate School Harbin Institute of Technology Shenzhen Guangdong Province China Electronic Engineering Institute Hefei Anhui 230037 China

ISBN: (纸本)9783642420566

Face recognition in uncontrolled environments, such as large pose variations, and extreme ambient illumination and expressions is a challenging task for traditional face recognition methods. Some recent works show that context information such as clothes and social relationships is very important for solving the problem. Furthermore, sparse representation-based method is very robust for face occlusion and pixel contamination. In this paper, the authors propose a sparse learning framework for face recognition with social context. First, sparse representation based dimensionality reduction method is used to find the low dimension representation of the face images. Second, sparse representation based classification is utilized to classify test face images as known label and unknown label. Third, for test images classified as unknown label, social context descriptor is constructed according to co-existence information. Finally, based on social context descriptor and the low dimension representation of the test images classified as unknown label, sparse representation based clustering is adopted to perform face recognition. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

A New Channel Parameter For Cognitive Radio

A New Channel Parameter For Cognitive Radio

引用

International Conference on Cognitive Radio Oriented Wireless Networks and communications

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

ISBN: (纸本)9781424408146;1424408156

Spectrum leasing has made more efficient utilization for the limited spectrum resource. While increasing the spectrum utilization, spectrum leasing also brings in some problem. Spectrum switch in the leasing process not only introduces in additional system overhead, but also decreases the secondary user's Qos. In this paper, we model the wireless system as a M/G/1 queue with preemptive priority, propose a new channel parameter to analyze the switch performance. Algorithms are suggested to reduce system overhead and to improve secondary user's Qos based on the new parameter.

关键词： Cognitive radio Switches Performance analysis Laboratories Computer science communication switching Queueing analysis Physics Game theory Wideband

来源：评论

学校读者我要写书评

暂无评论

Evolutionary community discovery in dynamic networks based on leader nodes

Evolutionary community discovery in dynamic networks based o...

引用

International Conference on Big Data and Smart computing (BIGCOMP)

作者： Wenhao Gao Wenjian Luo Chenyang Bu Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China University of Science and Technology of China Hefei Anhui CN

Evolutionary community discovery is a hot research topic which clusters the dynamic or temporal network. The communities detected in dynamic network should get reasonable partition for the current data while simultaneously not deviate drastically from the previous ones. In this paper, the evolutionary community discovery algorithm based on leader nodes (EvoLeaders) is proposed to cluster the dynamic network. Compared with the static community discovery algorithm based on leader nodes (the Top Leaders algorithm), experimental results over two real-world datasets demonstrate that the EvoLeaders is more suitable for dynamic scenarios.

关键词： Heuristic algorithms Clustering algorithms Current measurement Partitioning algorithms Social network services History Merging

来源：评论

学校读者我要写书评

暂无评论

Combining multipopulation evolutionary algorithms with memory for dynamic optimization problems

Combining multipopulation evolutionary algorithms with memor...

引用

Congress on Evolutionary Computation

作者： Tao Zhu Wenjian Luo Lihua Yue Anhui Province Key Laboratory of Software Engineering in Computing and Communication Hefei Anhui China School of Computer Science and Technology University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781479914869

Both multipopulation and memory are widely used approaches in the field of evolutionary dynamic optimization. It would be interesting to examine the effect of the combinations of multipopulation algorithms (MPAs) and memory schemes. However, since most of the existing memory schemes are proposed with single population algorithms, straightforwardly applying them to MPAs may cause problems. By addressing the possible problems, a new memory scheme is proposed for MPAs in this paper. In the experiments, several existing memory schemes and the newly proposed scheme are combined with a MPA, i.e. the Species-based Particle Swarm Optimizer (SPSO), and these combinations are tested on cyclic and acyclic problems. The experimental results indicate that 1) straightforwardly using the existing memory schemes sometimes degrades the performance of SPSO even on cyclic problems; 2) the newly proposed memory scheme is very competitive.

关键词： Sociology Statistics Memory management Optimization Heuristic algorithms Benchmark testing Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

SvdNPD: a negative data publication method based on the sensitive value distribution

SvdNPD: a negative data publication method based on the sens...

引用

International Workshop on Artificial Immune Systems (AIS)

作者： Linli Wu Wenjian Luo Dongdong Zhao University of Science and Technology of China Hefei Anhui CN Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

Existing data publication methods retain the relationship between the quasi-identifier attributes and sensitive attributes of published data. We call them "positive data publication". However, it will lead to potential risk that attackers could deduce the privacy of the corresponding individuals from the published data. Recently, by combining the negative representation with k-anonymity and l-diversity, (k, m)- anonNPD and (l, m)-divNPD algorithms have been proposed, which improve the degree of privacy because the sensitive value of each individual is transformed into a negative value randomly. However, to reduce the average error of the reconstructed distribution, the data published by (k, m)-anonNPD and (l, m)-divNPD are often much larger than the original data. In this paper, we take the Sensitive Value Distribution into consideration, and propose a novel Negative Data Publication approach (i.e. SvdNPD), which is based on l-diversity. According to the sensitive value distribution, the negative selection probability of the sensitive attribute in each record can be calculated. Then the data could be published by transforming the sensitive value to a negative one with this probability. Experimental results show that the effective usage of the individual sensitive value distribution could enhance the utility of published data. Meanwhile, compared with (l, 1)-divNPD, SvdNPD just sacrifices a tiny privacy degree which is acceptable.

关键词： Data privacy Privacy Diseases Aggregates Databases Lungs Organizations

来源：评论

学校读者我要写书评

暂无评论

PN-HASH: An Immune-Inspired Scheme for Data Integrity Check

PN-HASH: An Immune-Inspired Scheme for Data Integrity Check

引用

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 APPROACH BASED ON TSA-TREE FOR ACCURATE TIME SERIES CLASSIFICATION

AN APPROACH BASED ON TSA-TREE FOR ACCURATE TIME SERIES CLASS...

引用

2012 IEEE 2nd International Conference on Cloud computing and Intelligence Systems

作者： Xiaoxu He Chenxi Shao School of Computer Science and Technology University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication

In order to improve the performance of time series classification, we introduce a new approach of time series classification. The first step of the approach is to design a feature exaction model based on Trend and Surprise Abstraction tree （TSA-tree）. The second step of the approach is to combine the exacted global feature and 1 nearest neighbor to classify time series. The proposed approach is compared with a number of known classifiers by experiments in artificial and real-world data sets. The experimental results show it can reduce the error rates of time series classification, so it is highly competitive with previous approaches.

关键词： Feature exaction dimension reduction classification TSA-tree

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：