摘要：
Directional sensor networks have a lot of practical applications, and target coverage is one of the most important issues. In this article, we study the target coverage problem in directional sensor network, where directional sensors can rotate freely around their centers and targets are attached with differentiated coverage quality requirements. Our goal is to maximize the lifetime of sensor network, satisfying the coverage quality requirements of all targets. We model it as the maximum cover sets problem and address it by organizing the directions of sensors into a group of non-disjoint cover sets, which can cover all targets, satisfying their coverage quality requirements, and then schedule them alternately to extend the network lifetime. It consists of two parts. First, since directional sensor has infinite directions by rotating continuously, we propose sensing direction partition algorithm to find all non-redundancy directions for each sensor according to the targets deployed within the sensing region of the sensor. Then, based on the result of the sensing direction partition algorithm, we propose an efficient heuristic algorithm for the maximum cover sets problem to organize the directions of sensors into a number of non-disjoint cover sets and allocate work time for each cover set. Besides, we get an upper bound of the optimal solution for the problem. Finally, simulation results are presented to demonstrate the performance of our algorithm.
期刊：
Proceedings of SPIE - The International Society for Optical Engineering,2017年10225:1022510-null ISSN：0277-786X
通讯作者：
Jin, Cong
作者机构：
[Jin, Cong] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.;[Jin, Shu-Wei] Ecole Normale Super, 24 Rue Lhomond, F-75231 Paris 5, France.
通讯机构：
[Jin, Cong] C;Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.
会议名称：
8th International Conference on Graphic and Image Processing (ICGIP)
会议时间：
OCT 29-31, 2016
会议地点：
Tokyo, JAPAN
会议主办单位：
[Jin, Cong] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.^[Jin, Shu-Wei] Ecole Normale Super, 24 Rue Lhomond, F-75231 Paris 5, France.
摘要：
Multi-label image annotation (MIA) has been widely studied during recent years and many MIA schemes have been proposed. However, the most existing schemes are not satisfactory. In this paper, an improved multiple kernel learning (IMKL) method of support vector machine (SVM) is proposed to improve the classification accuracy of SVM, then a novel MIA scheme based on IMKL is presented, which uses the discriminant loss to control the number of top semantic labels, and the feature selection approach is also used for improving the performance of MIA. The experiment results show that proposed MIA scheme achieves higher the performance than the existing other MIA schemes, its performance is satisfactory for large image dataset.
作者机构：
[Jiang, Xingpeng] Cent China Normal Univ, Sch Comp Sci, Wuhan, Hubei, Peoples R China.;[Hu, Xiaohua] Drexel Univ, Coll Comp & Informat, Philadelphia, PA 19104 USA.;[Xu, Weiwei] Wuhan Univ, Int Sch Software, Wuhan, Hubei, Peoples R China.
通讯机构：
[Jiang, Xingpeng] C;Cent China Normal Univ, Sch Comp Sci, Wuhan, Hubei, Peoples R China.
关键词：
Human microbiome;data integration;data representation;multi-view clustering;nonnegative matrix factorization
摘要：
Microbiome datasets are often comprised of different representations or views which provide complementary information to understand microbial communities, such as metabolic pathways, taxonomic assignments, and gene families. Data integration methods including approaches based on nonnegative matrix factorization (NMF) combine multi-view data to create a comprehensive view of a given microbiome study by integrating multi-view information. In this paper, we proposed a novel variant of NMF which called Laplacian regularized joint non-negative matrix factorization (LJ-NMF) for integrating functional and phylogenetic profiles from HMP. We compare the performance of this method to other variants of NMF. The experimental results indicate that the proposed method offers an efficient framework for microbiome data analysis.
期刊：
International Journal of Network Security,2017年19(3):347-357 ISSN：1816-353X
通讯作者：
Jin, Cong(jincong@mail.ccnu.edu.cn)
作者机构：
[Liu, Hui; Jin, Cong] School of Computer, Central China Normal University, Wuhan, 430079, China
通讯机构：
School of Computer, Central China Normal University, Wuhan, China
关键词：
Arnold scrambling algorithm;Coupled-map lattices;Image encryption;Quantum chaotic map;Two-dimensional logistic map
摘要：
In recent years, several algorithms of image encryption have been proposed independently. In this paper, an algorithm of image encryption based on general two-dimensional Arnold transform with keys and quantum chaotic map is proposed. First, the key streams are generated by the two-dimensional logistic map as initial conditions and parameters. Second, general Arnold scrambling algorithm with keys is exploited to permute the pixels of color components, R, G and B. Finally a serial of pseudorandom numbers generated by the quantum chaotic map is applied to modify the value of diffused pixels. In order to get the high randomness and the high complexity, the two-dimensional logistic map and quantum chaotic map are coupled with nearest-neighboring coupled-map lattices. Theoretical analyses and computer simulations confirm that the new algorithm has high level of security.
期刊：
International Journal of Network Security,2017年19(3):347-357 ISSN：1816-3548
通讯作者：
Jin, Cong(jincong@mail.ccnu.edu.cn)
作者机构：
[Liu, Hui; Jin, Cong] School of Computer, Central China Normal University, Wuhan, 430079, China
通讯机构：
School of Computer, Central China Normal University, Wuhan, China
关键词：
Arnold scrambling algorithm;Coupled-map lattices;Image encryption;Quantum chaotic map;Two-dimensional logistic map
摘要：
In recent years, several algorithms of image encryption have been proposed independently. In this paper, an algorithm of image encryption based on general two-dimensional Arnold transform with keys and quantum chaotic map is proposed. First, the key streams are generated by the two-dimensional logistic map as initial conditions and parameters. Second, general Arnold scrambling algorithm with keys is exploited to permute the pixels of color components, R, G and B. Finally a serial of pseudorandom numbers generated by the quantum chaotic map is applied to modify the value of diffused pixels. In order to get the high randomness and the high complexity, the two-dimensional logistic map and quantum chaotic map are coupled with nearest-neighboring coupled-map lattices. Theoretical analyses and computer simulations confirm that the new algorithm has high level of security.
期刊：
Proceedings - 2017 International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration, ICIICII 2017,2017年2017-December:262-265
作者机构：
[Wu, Yong] School of Automation, Wuhan University of Technology, Wuhan, China;[Guo, Jinglei] School of Computer, Central China Normal University, Wuhan, China
期刊：
International Journal of Network Security,2017年19(4):507-516 ISSN：1816-353X
通讯作者：
Jin, Cong(jincong@mail.ccnu.edu.cn)
作者机构：
[Jin, Cong] School of Computer, Central China Normal University, Wuhan, 430079, China;[Wang, Xiaoyan] Department of Electronic Information, Zhengzhou Electric Power College, Zhengzhou, 450000, China
通讯机构：
School of Computer, Central China Normal University, Wuhan, China
关键词：
Computer virus;Propagation model;RMD-virus;RMDSIR model
摘要：
Removable memory device (RMD) is one of main way for propagating computer virus. In this paper, a dynamic propagation model of RMD-virus with varying popula- tion size is discussed. Unlike other computer virus propagation models, the proposed model mainly considers the RMD-virus propagation between host and RMD, which is embodied by introducing the RMD state and new propagation rate. Furthermore, to control the RMD-virus, three threshold parameters are obtained. The simulation results show that the proposed model can serve as a basis for understanding and simulating RMD-virus.
摘要：
In a (t, n) secret sharing scheme (SS), a dealer divides the secret into n shares in such way that any t or more than t shares can reconstruct the secret but fewer than t shares cannot reconstruct the secret. The multi-SS is an extension of the (t, n) SS in which shares can be reused to reconstruct multiple secrets. Thus, the efficiency of the multi-SS is better than the efficiency of the (t, n) SS. In this paper, we propose the first multi-SS using a bivariate polynomial. Our design is unique in comparing with all existing multi-SSs. Shares generated using a bivariate polynomial can not only be used to reconstruct multiple secrets but also be used to establish pairwise keys between any pair of shareholders. The pairwise keys can protect exchange information in the secret reconstruction to prevent outsiders from obtaining the recovered secrets. All existing multi-SSs require additional key establishment to accomplish this.
作者机构：
[Tan, Liansheng; Tang, Shengda] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Tang, Shengda] Guangxi Normal Univ, Sch Math & Stat, Guilin 541000, Peoples R China.
通讯机构：
[Tan, Liansheng] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
作者机构：
[Harn, Lein] Univ Missouri Kansas City, Dept Comp Sci Elect Engn, Kansas City, MO 64110 USA.;[Hsu, Ching-Fang] Cent China Normal Univ, Comp Sch, Wuhan 430079, Hubei, Peoples R China.
通讯机构：
[Hsu, Ching-Fang] C;Cent China Normal Univ, Comp Sch, Wuhan 430079, Hubei, Peoples R China.
关键词：
Group communications;Group key establishment;Secret sharing scheme;Unconditional secure
作者机构：
[Zhu, Xuan; Hsu, Ching-Fang; Zhang, Maoyuan] Cent China Normal Univ, Comp Sch, Wuhan, Peoples R China.;[Harn, Lein] Univ Missouri, Dept Comp Sci Elect Engn, Kansas City, MO 64110 USA.;[Mu, Yi] Univ Wollongong, Sch Comp & Informat Technol, Wollongong, NSW 2522, Australia.
通讯机构：
[Hsu, Ching-Fang] C;Cent China Normal Univ, Comp Sch, Wuhan, Peoples R China.
关键词：
Wireless group key transfer;Vandermonde matrix;Linear secret sharing;Computation-efficient
摘要：
Efficient key establishment is an important problem for secure group communications. The communication and storage complexity of group key establishment problem has been studied extensively. In this paper, we propose a new group key establishment protocol whose computation complexity is significantly reduced. Instead of using classic secret sharing, the protocol only employs a linear secret sharing scheme, using Vandermonde Matrix, to distribute group key efficiently. This protocol drastically reduces the computation load of each group member and maintains at least the same security degree compared to existing schemes employing traditional secret sharing. The security strength of this scheme is evaluated in detail. Such a protocol is desirable for many wireless applications where portable devices or sensors need to reduce their computation as much as possible due to battery power limitations. This protocol provides much lower computation complexity while maintaining low and balanced communication complexity and storage complexity for secure group key establishment.
作者机构：
[吴黎兵] State Key Laboratory of Software Engineering, Wuhan University, Wuhan, 430072, China;[崔建群] Computer School, Central China Normal University, Wuhan, 430079, China;[ZOU Yi-Fei; 吴黎兵; NIE Lei; 范静] Computer School, Wuhan University, Wuhan, 430072, China
摘要：
Knowledge Base Question Answering (KBQA) is a hot research topic in natural language processing (NLP). The most challenging problem in KBQA is how to understand the semantic information of natural language questions and how to bridge the semantic gap between the natural language questions and the structured fact triples in knowledge base. This paper focuses on simple questions which can be answered by a single fact triple in knowledge base. We propose a topic enhanced deep structured semantic model for KBQA. The proposed method considers the task of KBQA as a matching problem between questions and the subjects and predicates in knowledge base. And the proposed model consists of two stages to match the subjects and predicates, respectively. In the first stage, we propose a Convolutional based Topic Entity Extraction Model (CTEEM) to extract topic entities mentioned in questions. With the extracted entities, we can retrieve the relevant candidate fact triples from knowledge base and obviously decrease the amount of noising candidates. In the second stage, we employ Deep Structured Semantic Models (DSSMs) to compute the semantic relevant score between questions and predicates in the candidates. And we combine the semantic level and the lexical level scores to rank the candidates. We evaluate the proposed method on KBQA dataset released by NLPCC-ICCPOL 2016. The experimental results show that our proposed method achieves the third place among the 21 submitted systems. Furthermore, we also extend the DSSM by using BiLSTM and integrate a convolutional structure on the top of BiLSTM layers. Our experimental results show that the extension models can further improve the performance.
期刊：
ACM Transactions on Information Systems,2017年36(2):18:1-18:36 ISSN：1046-8188
通讯作者：
Zhou, Guang-You
作者机构：
[Zhou, Guang-You] Cent China Normal Univ, Sch Comp, 152 Luoyu Ave, Wuhan 430079, Hubei, Peoples R China.;[Huang, Jimmy Xiangji] York Univ, Sch Informat Technol, Informat Retrieval & Knowledge Management Res Lab, 4600 Keele St, Toronto, ON M3J 1P3, Canada.
通讯机构：
[Zhou, Guang-You] C;Cent China Normal Univ, Sch Comp, 152 Luoyu Ave, Wuhan 430079, Hubei, Peoples R China.
关键词：
Information retrieval;Natural language processing;Sentiment analysis
