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

A genetic algorithm for community detection in complex networks

Journal of Central South University 2013年第5期20卷 1269-1276页

作者：李赟刘钢老松杨 College of Information System and Management National University of Defense Technology

A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.

关键词： complex networks community detection genetic algorithm matrix encoding nodes similarity

来源：评论

学校读者我要写书评

暂无评论

A coding problem in steganography

引用

DESIGNS CODES AND CRYPTOGRAPHY 2008年第1期46卷 67-81页

作者： Zhang, Weiming Li, Shiqu Informat Engn Univ Dept Informat Res Zhengzhou 450002 Peoples R China Shanghai Univ Sch Commun & Informat Engn Shanghai 200076 Peoples R China

To study how to design a steganographic algorithm more efficiently, a new coding problem-steganographic codes (abbreviated stego-codes)-is presented in this paper. The stego-codes are defined over the field with q(q >= 2) elements. A method of constructing linear stego-codes is proposed by using the direct sum of vector subspaces. And the problem of linear stego-codes is converted to an algebraic problem by introducing the concept of the tth dimension of a vector space. Some bounds on the length of stego-codes are obtained, from which the maximum length embeddable (MLE) code arises. It is shown that there is a corresponding relation between MLE codes and perfect error-correcting codes. Furthermore the classification of all MLE codes and a lower bound on the number of binary MLE codes are obtained based on the corresponding results on perfect codes. Finally hiding redundancy is defined to value the performance of stego-codes.

关键词： steganography stego-codes error correcting codes matrix encoding MLE codes perfect codes hiding redundancy

来源：评论

学校读者我要写书评

暂无评论

Data hiding based on overlapped pixels using hamming code

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2016年第23期75卷 15651-15663页

作者： Kim, Cheonshik Yang, Ching-Nung Anyang Univ Digital Media Engn 708-113 Anyang 5 Dong Anyang 430714 Kyonggi Do South Korea Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Hualien 9701 Taiwan

Most data hiding schemes change the least significant bits to conceal messages in the cover images. matrix encoding scheme is a well known scheme in this field. The matrix encoding proposed by Crandall can be used in steganographic data hiding methods. Hamming codes are kinds of cover codes. "Hamming + 1" proposed by Zhang et al. is an improved version of matrix encoding steganography. The embedding efficiency of "Hamming + 1" is very high for data hiding, but the embedding rate is low. Our proposed "Hamming + 3" scheme has a slightly reduced embedding efficiency, but improve the embedding rate and image quality. "Hamming + 3" is applied to overlapped blocks, which are composed of 2 (k) +3 pixels, where k=3. We therefore propose verifying the embedding rate during the embedding and extracting phases. Experimental results show that the reconstructed secret messages are the same as the original secret message, and the proposed scheme exhibits a good embedding rate compared to those of previous schemes.

关键词： Data Hiding Steganography matrix encoding Hamming codes

来源：评论

学校读者我要写书评

暂无评论

Improving capacity of Hamming (n, k)+1 stego-code by using optimized Hamming plus k

引用

DIGITAL SIGNAL PROCESSING 2018年 78卷 284-293页

作者： Kim, Cheonshik Shin, Dongkyoo Yang, Ching-Nung Chou, Yung-Shun Sejong Univ Dept Comp Engn 209 Neungdong Ro Seoul South Korea Natl Dong Hwa Univ Dept Comp Sci & Informat Engn 1Sec 2Da Hsueh Rd Hualien 97401 Taiwan

The Hamming coding (n,k) + 1 data hiding (H1DH) scheme is based on matrix encoding and has the characteristic of a good embedding efficiency. This scheme improves the embedding efficiency of Hamming coding (n,k) data hiding (HDH). H1DH is used to hide a k + 1 bit in a (n 1) block by adding or subtracting one. However, the embedding rates of HDH, H1DH, and HCIH are only 0.43, 0.5, and 0.75 respectively. The important criterion of data hiding is the amount of embedding capacity with a high PSNR in a cover image. In this paper, we propose a Hamming coding (n, k) + k data hiding (HkDH) scheme to hide 2k bits in a block with overlapped LSB and 2LSB using matrix encoding by adding or subtracting by two. In order to hide 2k bits in a block, it is necessary to increase or decrease by one, two or three. Assuming that we need two modifications to hide 2k bits in a block and the location of two modifications is the same, the collision problem occurs in the block. We suggest an optimal method for hiding 2k bits in a block and verify the proposed method. The main contribution of this paper is theoretically proving that our HkDH scheme has a better embedding capacity than HDH, H1DH, EMD, and HCIH while not seriously degrading the PSNR. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Data hiding matrix encoding Hamming plus k DH (HkDH) Hamming DH (HDH) Hamming+1 DH (H1DH) High capacity of information hiding (HCIH)

来源：评论

学校读者我要写书评

暂无评论

Improved adaptive partial-matching steganography for Voice over IP

引用

COMPUTER COMMUNICATIONS 2015年第Oct.1期70卷 95-108页

作者： Tian, Hui Qin, Jie Guo, Shuting Huang, Yongfeng Liu, Jin Wang, Tian Chen, Yonghong Cai, Yiqiao Natl Huaqiao Univ Coll Comp Sci & Technol Xiamen 361021 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

In Voice over IP scenarios, adaptive partial-matching steganography (APMS) is an effective approach to balance steganographic transparency and bandwidth, in which the strategies involved, however, have not achieved the optimal steganographic performance yet. Therefore, in this paper, we try to improve APMS from three aspects. First, when the current partial similarity value (PSV) falls between the two given substitution thresholds, the embedding process is guided with unequal probabilities increased with the PSVs instead of identical probabilities, which enhances the embedding chances of cover parts with larger PSVs. Second, for cover parts considered unsuitable for information hiding in the original strategies, the matrix encoding strategy is employed to conceal secret messages with no more than one bit changed, which improves cover usage rate while maintaining high embedding efficiency. Third, in the APMS strategy with two flag bits, one more encrypted form of the secret message is added into the comprehensive evaluation of partial matching, which makes the embedding process more efficient. The proposed strategies are evaluated with ITU-T G.711 (A-law) as the codec of the cover speech, and compared with the original ones and some existing approaches. The experimental results demonstrate that the improved strategies can strike excellent balances between the steganographic transparency and bandwidth, and significantly outperform both the former ones and other previous approaches. Furthermore, the results of detection tests show they have outstanding performance of steganalysis resistance. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Steganography Covert communication Voice over IP Partial matching matrix encoding

来源：评论

学校读者我要写书评

暂无评论

LMDGW: a novel matrix based dynamic graph watermark

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2019年第1期10卷 295-304页

作者： Zeng, Lingling Ren, Wei Chen, Yuling Lei, Min China Univ Geosci Sch Comp Sci Wuhan Hubei Peoples R China Guizhou Univ Guizhou Prov Key Lab Publ Big Data Guiyang Guizhou Peoples R China Beijing Univ Posts & Telecommun Informat Secur Ctr Beijing Peoples R China

Android platform induces an open application development framework to attract more developers and promote larger market occupations. However, the open architecture also makes it easier to reverse engineering, which results in the property loss for both developers and companies, and increases the risks of mobile malicious code. Therefore, copyright protection for android application is of significant importance. A class of copyright protection methods are based on Android watermark. Different from static watermark, the process of embedding and extracting of dynamic graph watermark (DGW) is based on the function path and operation process of the app, which has better concealment. In this paper, we proposed a late-model dynamic watermark based on matrix, called LMDGW. This method is proposed to overcome the shortcoming of unintuitive and vulnerable property of traditional numberal DGW. We encode a matrix with low rank into a watermark graph, and embed the graph construction statements into smali code. With the containing of sensitive block characteristics, LMDGW is able to perceive and locate the changes in the specific block. Besides, LWDGW has great performance in tamper-proof attacks. Experiment results and analysis justified that LMDGW has great data rate and robust, and is available in sensitive code locating. LMDGW is proved to be an intelligent watermarking scheme, and is enlightening for intelligent security.

关键词： Dynamic graph watermark matrix watermark matrix encoding Changes locating matrix recovery

来源：评论

学校读者我要写书评

暂无评论

Improving embedding efficiency of covering codes for applications in steganography

引用

IEEE COMMUNICATIONS LETTERS 2007年第8期11卷 680-682页

作者： Zhang, Weiming Wang, Shuozhong Zhang, Xinpeng Shanghai Univ Sch Commun & Informat Engn Shanghai 200076 Peoples R China Informat Engn Inst Dept Informat Res Zhengzhou 450002 Peoples R China

In image steganography, each pixel can carry a ternary message by choosing adding/subtracting one to/from the gray value. Although ternary covering functions can provide embedding efficiency higher than binary ones, it is necessary to convert the binary message into a ternary format. We propose a novel method that improves the embedding efficiency of binary covering functions by fully exploiting the information contained in the choice of addition or subtraction in the embedding. The improved scheme can perform, equally well with, or even outperform, ternary covering functions without ternary conversion of the message.

关键词： covert communication steganography embedding efficiency covering codes matrix encoding

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Emergency Rescue Facilities Location Model for Catastrophic Interlocking Chemical Accidents in Chemical Parks

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2020年第11期21卷 4749-4761页

作者： Men, Jinkun Jiang, Peng Zheng, Song Kong, Yaguang Zhao, Ye Sheng, Gang Su, Nan Zheng, Sulu Hangzhou Dianzi Univ Sch Automat Hangzhou 310000 Peoples R China Quzhou Special Equipment Inspect Ctr Quzhou 324000 Peoples R China Zhejiang Transit Fluorine Silicon Quzhou 324000 Peoples R China Hangzhou Xihu Dist Affordable Housing Management Hangzhou 310000 Peoples R China

Catastrophic interlocking chemical accidents (CICAs) are the most frequent hazardous events that occur in chemical parks, and they result in severe human casualties and property losses. Emergency rescue facilities play an important role in ensuring the safety of chemical parks, as their locations determine the efficiency and effectiveness of the emergency management process. This paper proposes a multi-objective emergency rescue facilities location (ERFsL) model for emergency management of CICAs. Due to the special characteristics of CICAs, the proposed model considers not only the spatial characteristics of the facilities but also the potential risks associated with CICAs. A quantitative area risk assessment (QARA) approach based on domino effect and grid partition is involved to delineate the potential negative impacts of CICAs on different demand points. Moreover, a matrix encoding scheme is coupled with Pareto-based multi-objective evolutionary algorithms (MOEAs) for model solving. A case study is presented to demonstrate the methodology. A set of reasonable and non-dominated solutions indicate that the matrix encoding scheme and the corresponding evolutionary operators can be successfully coupled with the MOEAs to produce feasible child solutions. We also find that the involvement of risk analysis has a significant effect on the location decision. The findings show that our work has the potential to ensure the safety and long-term development of the parks.

关键词： Catastrophic interlocking chemical accidents emergency management chemical park facilities location quantitative area risk assessment matrix encoding

来源：评论

学校读者我要写书评

暂无评论

Research on information security in text emotional steganography based on machine learning

引用

ENTERPRISE INFORMATION SYSTEMS 2021年第7期15卷 984-1001页

作者： Li, Fufang Tang, Han Zou, Yukang Huang, Yongfeng Feng, Yuanyong Peng, Lingxi Guangzhou Univ Sch Comp Sci & Cyber Engn Guangzhou 510006 Peoples R China Jilin Univ Coll Commun Engn Changchun Peoples R China Tsinghua Univ Dept Elect Engn Beijing Peoples R China Guangzhou Univ Sch Mech & Elect Engn Guangzhou Peoples R China

To effectively protect sensitive information, this paper proposes a method of text Emotional modulation steganography based on machine learning. Firstly, we explore an intelligent dynamic expansion method for text emotional lexicon based on deep learning in detail. Secondly, the cosine similarity algorithm is used to combine the two most similar emotional words into emotional word pairs, which is the basis of the proposed approach. Thirdly, we combine emotional word pairs with matrix encoding algorithm to calculate the minimum modification unit, so as to minimize the rewriting of carrier text, and hence improve the privacy, embedding rate and capacity of sensitive information. Fourthly, we evaluate and validate the proposed algorithms through several experiments. Finally, the design of a NoC based organizational covert and secure autonomous intelligent online team work system is carried out. Experiments show that the efficiency, security, concealment and robustness of the proposed algorithms are sound.

关键词： Sensitive information security emotional machine learning emotional information steganography (hiding) and analysis matrix encoding Network on Chip (NoC) based intelligent autonomous application Distributed Hash Table (DHT)

来源：评论

学校读者我要写书评

暂无评论

A novel image steganography scheme based on morphological associative memory and permutation schema

引用

SECURITY AND COMMUNICATION NETWORKS 2015年第2期8卷 110-121页

作者： Nazari, Sara Eftekhari-Moghadam, Amir-Masoud Moin, Mohammad-Shahram Islamic Azad Univ Qazvin Branch Fac Comp & Informat Technol Engn Qazvin Iran ICT Res Inst IT Fac Tehran Iran

Steganography is the art and science of hiding a message in a carrier, in such a manner that no one, except the sender and intended recipient, can guess the existence of the message;it is a form of security through obscurity. Often, steganography algorithms using discrete cosine transform are detectable through steganalysis attacks. To reduce detectability of the stego, we propose an image steganography algorithm in transform domain based on morphological associative memory, permutation approach, and matrix encoding. In our proposed algorithm, in order to insert a secret message in the cover image, first, we map the cover image to a morphological representation containing morphological coefficients, and then bits of secret message are inserted into the image by permutation approach and matrix encoding. Permutation approach leads to unique distribution of secret message in the carrier, and the use of matrix encoding minimizes the number of coefficients needed to be changed because of inserting secret message. In our experiments, we compared the quality of stego, time complexity, and robustness of our method with state-of-art image steganography algorithms (F5 and morphological steganography) with an equal payload. The experimental results showed that the proposed method is able to produce insignificant visual distortion compared with other traditional approaches. To test the robustness of our proposed algorithm, we used wavelet-based and block-based steganalysis methods. The obtained results showed a high level of robustness of our algorithm against steganalysis attacks. Copyright (c) 2014 John Wiley & Sons, Ltd.

关键词： morphology associative memory image steganography GRP permutation matrix encoding control matrix steganalysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：