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

Linguistic Steganalysis Based on Meta Features and Immune Mechanism

Chinese Journal of Electronics 2023年第4期19卷 661-666页

作者： Hao Yang Xianbin Cao Anhui Province Key Laboratory of Software in Computing and Communication School of Computer Science and Technology University of Science and Technology of China Hefei China

Linguistic steganalysis depends on efficient detection features due to the diversity of syntax and the polysemia of semantics in natural language processing. This paper presents a novel linguistics steganalysis approach based on meta features and immune clone mechanism. Firstly, meta features are used to represent texts. Then immune clone mechanism is exploited to select appropriate features so as to constitute effective detectors. Our approach employed meta features as detection features, which is an opposite view from the previous literatures. Moreover, the immune training process consists of two phases which can identify respectively two kinds of stego texts. The constituted detectors have the capable of blind steganalysis to a certain extent. Experiments show that the proposed approach gets better performance than typical existing methods, especially in detecting short texts. When sizes of texts are confined to 3kB, detection accuracies have exceeded 95%.

关键词： Training Integrated circuits Steganography Semantics Cloning Detectors Linguistics

来源：评论

学校读者我要写书评

暂无评论

On the self representation based on the adaptive self radius

On the self representation based on the adaptive self radius

引用

4th International Workshop on Advanced Computational Intelligence, IWACI 2011

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

ISBN: (纸本)9781612843735

Self representation problem is very important for the negative selection algorithms. In this paper, two methods, named as K-NN-ASR and B-NN-ASR, are proposed to calculate the self radius of a self sample in the continuous space. As for the K-NN-ASR, the self radius of a self sample is calculated according to the distances from itself to the surrounding self samples. In the B-NN-ASR, both the position of the self sample and the distances to the surrounding self samples are considered. Experiments are done to test the performance of the proposed methods. Experimental results demonstrate that the proposed methods are competitive, and the B-NN-ASR is better. © 2011 IEEE.

关键词： selection algorithm Self tuning CONTINUOUS SPACE

来源：评论

学校读者我要写书评

暂无评论

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 2015

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

ISBN: (纸本)9781509002986

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 Khidden algorithm for generating hard-to-reverse NDBs (called Khidden-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 Khidden-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 qhidden-NDB. © 2015 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Evolutionary clustering with differential evolution

Evolutionary clustering with differential evolution

引用

Congress on Evolutionary Computation

作者： Gang Chen Wenjian Luo Tao Zhu Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781479914869

Evolutionary clustering is a hot research topic that clusters the time-stamped data and it is essential to some important applications such as data streams clustering and social network analysis. An evolutionary clustering should accurately reflect the current data at any time step while simultaneously not deviate too drastically from the recent past. In this paper, the differential evolution (DE) is applied to deal with the evolutionary clustering problem. Comparing with the typical k-means, evolutionary clustering based on DE (deEC) could perform a global search in the solution space. Experimental results over synthetic and real-world data sets demonstrate that the deEC provides robust and adaptive solutions.

关键词： Clustering algorithms History Vectors Evolutionary computation Equations Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

Differential evolution with a species-based repair strategy for constrained optimization

Differential evolution with a species-based repair strategy ...

引用

Congress on Evolutionary Computation

作者： Chenyang Bu Wenjian Luo Tao Zhu Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781479914869

Evolutionary Algorithms (EAs) with gradient-based repair, which utilize the gradient information of the constraints set, have been proved to be effective. It is known that it would be time-consuming if all infeasible individuals are repaired. Therefore, so far the infeasible individuals to be repaired are randomly selected from the population and the strategy of choosing individuals to be repaired has not been studied yet. In this paper, the Species-based Repair Strategy (SRS) is proposed to select representative infeasible individuals instead of the random selection for gradient-based repair. The proposed SRS strategy has been applied to εDEag which repairs the random selected individuals using the gradient-based repair. The new algorithm is named SRS-εDEag. Experimental results show that SRS-εDEag outperforms εDEag in most benchmarks. Meanwhile, the number of repaired individuals is reduced markedly.

关键词： Maintenance engineering Sociology Statistics Vectors Equations Clustering algorithms Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Grasping and folding knots

Grasping and folding knots

引用

IEEE International Conference on Robotics and Automation

作者： Weifu Wang Devin Balkcom Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781467380270

String stretched tightly along a sequence of fixed grasp points takes the shape of a polygonal arc. In this work, we investigate how many points are necessary and sufficient to grasp and tie arbitrary knots while maintaining tension, so that the string remains polygonal. This approach allows reasoning that is entirely geometric, which does not rely on potentially inaccurate dynamic models of the string or detailed knowledge of physical characteristics of the string. Algorithms are proposed to determine the contact locations, and generate the motions needed to tie arbitrary knots. This work shows that a number of grasp points that is linear in the number of crossings in a knot diagram is sufficient to immobilize string in a polygonal shape with the topology of an arbitrary knot, or to fold or unfold the knot from a straight configuration.

关键词： Grasping folding knots

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in Clonal Selection Algorithms and Applications

Recent Advances in Clonal Selection Algorithms and Applicati...

引用

IEEE Symposium Series on Computational Intelligence

作者： Wenjian Luo Xin Lin Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

Clonal selection algorithms (CSAs) are a kind of Artificial Immune Algorithms (AIAs). In this paper, recent advances in clonal selection algorithms are summarized and reviewed. First, the basic framework of clonal selection algorithms is given. Second, various types of applications using clonal selection algorithms are summarized, including global optimization, constrained optimization, combinatorial optimization, multiobjective optimization, dynamic optimization and other applications. Last, a brief conclusion and some remarks about clonal selection algorithms are given.

关键词： Immune Computation Clonal Selection Algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

An improved genetic algorithm for dynamic shortest path problems

An improved genetic algorithm for dynamic shortest path prob...

引用

Congress on Evolutionary Computation

作者： Xuezhi Zhu Wenjian Luo Tao Zhu Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

The Shortest Path (SP) problems are conventional combinatorial optimization problems. There are many deterministic algorithms for solving the shortest path problems in static topologies. However, in dynamic topologies, these deterministic algorithms are not efficient due to the necessity of restart. In this paper, an improved Genetic Algorithm (GA) with four local search operators for Dynamic Shortest Path (DSP) problems is proposed. The local search operators are inspired by Dijkstra's Algorithm and carried out when the topology changes to generate local shortest path trees, which are used to promote the performance of the individuals in the population. The experimental results show that the proposed algorithm could obtain the solutions which adapt to new environments rapidly and produce high-quality solutions after environmental changes.

关键词： Sociology Statistics Heuristic algorithms Topology Algorithm design and analysis Digital signal processing Biological cells

来源：评论

学校读者我要写书评

暂无评论

A novel updating strategy for associative memory scheme in cyclic dynamic environments

A novel updating strategy for associative memory scheme in c...

引用

International Workshop on Advanced Computational Intelligence (IWACI)

作者： Cao, Yong Luo, Wenjian Nature Inspired Computation and Applications Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei 230027 Anhui China

ISBN: (纸本)9781424463343

Associative memory schemes have been developed for Evolutionary Algorithms (EAs) to solve Dynamic Optimization Problems (DOPs), and demonstrated powerful performance. In these schemes, how to update the memory could be important for their performance. However, little work has been done about the associative memory updating strategies. In this paper, a novel updating strategy is proposed for associative memory schemes. In this strategy, the memory point whose associated environmental information is most similar to the current environmental information is first picked out from the memory. Then, the selected memory individual is updated according to the fitness value, and the associated environmental information is updated according to the matching degree between environmental information and individuals. This updating strategy is embedded into a stateof-the-art algorithm, i.e. the MPBIL, and tested by experiments. Experimental results demonstrate that the proposed updating strategy is helpful for associative memory schemes to enhance their search ability in cyclic dynamic environments.

关键词： Associative processing

来源：评论

学校读者我要写书评

暂无评论

Study on Parallel computing

引用

Journal of Computer Science & Technology 2006年第5期21卷 665-673页

作者：陈国良孙广中张云泉莫则尧 Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 P.R. China Laboratory of Parallel Computing Institute of Software Chinese Academy of Sciences Beijing 100080 P.R. China Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics Beijing 100088 P.R. China

In this paper, we present a general survey on parallel computing. The main contents include parallel computer system which is the hardware platform of parallel computing, parallel algorithm which is the theoretical base of parallel computing, parallel programming which is the software support of parallel computing. After that, we also introduce some parallel applications and enabling technologies. We argue that parallel computing research should form an integrated methodology of ＂architecture algorithm programming application＂. Only in this way, parallel computing research becomes continuous development and more realistic.

关键词： parallel computing parallel architecture parallel programming parallel algorithm parallel application

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：