作者机构：
[Yang Yan; Li Rong; Wang Sai] Cent China Normal Univ, Comp Sch, Wuhan, Peoples R China.
会议名称：
4th National Conference on Electrical, Electronics and Computer Engineering (NCEECE)
会议时间：
DEC 12-13, 2015
会议地点：
Xian, PEOPLES R CHINA
会议主办单位：
[Yang Yan;Li Rong;Wang Sai] Cent China Normal Univ, Comp Sch, Wuhan, Peoples R China.
会议论文集名称：
AER-Advances in Engineering Research
关键词：
Pi Calculus;Web Service;Service Composition;Composition Validation
摘要：
Web service composition has been an important research topic in the field of service computing. Through the web service process modeling and the formal verification of the composition, we make sure th
期刊：
Lecture Notes in Computer Science,2016年10102:583-594 ISSN：0302-9743
通讯作者：
Zong, Chengqing
作者机构：
[Li, Junjie; Zong, Chengqing] Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing, Peoples R China.;[Yang, Haitong] Univ Chinese Acad Sci, Beijing, Peoples R China.;[Li, Junjie; Zong, Chengqing] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.
通讯机构：
[Zong, Chengqing] C;Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing, Peoples R China.;Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.
会议名称：
5th International Conference on Natural Language Processing and Chinese Computing (NLPCC) / 24th International Conference on Computer Processing of Oriental Languages (ICCPOL)
会议时间：
DEC 02-06, 2016
会议地点：
Kunming Univ Sci & Technol, Kunming, PEOPLES R CHINA
作者机构：
[Zhao, Jingyuan] Shanghai Jiao Tong Univ, Shanghai, Peoples R China.;[Sihao, Zhang] Chongqing Univ, Sch Elect Engn, Elect Engn, Chongqing, Zhejiang, Peoples R China.;[Sihao, Zhang] Cent China Normal Univ, Sch Comp, Software Engn, Wuhan, Peoples R China.
会议名称：
International Conference on Communication and Electronics Systems (ICCES)
会议时间：
OCT 21-22, 2016
会议地点：
Coimbatore, INDIA
会议主办单位：
[Zhao, Jingyuan] Shanghai Jiao Tong Univ, Shanghai, Peoples R China.^[Sihao, Zhang] Chongqing Univ, Sch Elect Engn, Elect Engn, Chongqing, Zhejiang, Peoples R China.^[Sihao, Zhang] Cent China Normal Univ, Sch Comp, Software Engn, Wuhan, Peoples R China.
关键词：
Image Retrieval;On line and offline systems;sparse coding;content bases image retrieval systems
摘要：
Image retrieval is based on the description of image content, found in the target image collection with the specified characteristics or with the image of the specified content. The content of the image can be divided into two categories: visual content and information content. The visual content corresponding to the physical representation of the image, such as color, shape, texture, etc. while corresponding image semantic information content, such as the theme, characters, scenes, etc come under the category of information content. The emergence of the theory of sparse representation for computer vision and pattern recognition, and other fields has brought the profound influence. Image sparse representation is a well as a new image description model, the said coefficient of less than zero composition reveals the image signal of the main structure and essential attribute. Efficient representation of the model not only can obtain the observation signal, but also can extract the semantic information. This Topic through the introduction of sparse coding idea retrieval process can be divided into two steps: off-line training and on-line retrieval. By using the sparse dictionary online training algorithm for each image to complete dictionary training, using the image similarity evaluation algorithm based on sparse feature expression of query image and the database image similarity calculation, finally according to the similarity retrieval results, thus the ascension of systemic algorithm accuracy and efficiency
作者：
Zhou, Guangyou*;Xie, Zhiwen;Huang, Jimmy Xiangji;He, Tingting
作者机构：
[Zhou, Guangyou; Xie, Zhiwen; He, Tingting] Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.;[Huang, Jimmy Xiangji] York Univ, Sch Informat Technol, Toronto, ON, Canada.
会议名称：
54th Annual Meeting of the Association-for-Computational-Linguistics (ACL)
会议时间：
AUG 07-12, 2016
会议地点：
Berlin, GERMANY
会议主办单位：
[Zhou, Guangyou;Xie, Zhiwen;He, Tingting] Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.^[Huang, Jimmy Xiangji] York Univ, Sch Informat Technol, Toronto, ON, Canada.
摘要：
Sentiment classification aims to automatically predict sentiment polarity (e.g., positive or negative) of user generated sentiment data (e.g., reviews, blogs). Due to the mismatch among different domains, a sentiment classifier trained in one domain may not work well when directly applied to other domains. Thus, domain adaptation for sentiment classification algorithms are highly desirable to reduce the domain discrepancy and manual labeling costs. To address the above challenge, we propose a novel domain adaptation method, called Bi-Transferring Deep Neural Networks (BTDNNs). The proposed BTDNNs attempts to transfer the source domain examples to the target domain, and also transfer the target domain examples to the source domain. The linear transformation of BTDNNs ensures the feasibility of transferring between domains, and the distribution consistency between the transferred domain and the desirable domain is constrained with a linear data reconstruction manner. As a result, the transferred source domain is supervised and follows similar distribution as the target domain. Therefore, any supervised method can be used on the transferred source domain to train a classifier for sentiment classification in a target domain. We conduct experiments on a benchmark composed of reviews of 4 types of Amazon products. Experimental results show that our proposed approach significantly outperforms the several baseline methods, and achieves an accuracy which is competitive with the state-of-the-art method for domain adaptation.
期刊：
PROCEEDINGS OF THE 2016 5TH INTERNATIONAL CONFERENCE ON ADVANCED MATERIALS AND COMPUTER SCIENCE,2016年80:93-96 ISSN：2352-5401
通讯作者：
Zhang, Maoyuan
作者机构：
[Zhang, Maoyuan; Pan, Xiaohang; Meng, Qiongyao] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.
通讯机构：
[Zhang, Maoyuan] C;Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.
会议名称：
5th International Conference on Advanced Materials and Computer Science (ICAMCS)
会议时间：
MAR 26-27, 2016
会议地点：
Qingdao, PEOPLES R CHINA
会议主办单位：
[Zhang, Maoyuan;Pan, Xiaohang;Meng, Qiongyao] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.
会议论文集名称：
AER-Advances in Engineering Research
关键词：
Word variation;Distributed word representations;Cloud model
摘要：
Words,as the basis of language,have relative stability.But it is also gradually developing.The language variation and change has been an important subfield in sociolinguistics,and has made remarkable
摘要：
Now,there are more and more hot event of network.The event itself is complex,and have too much useless information.In this paper,we propose a formal method which uses semantic fingerprint to represent
会议名称：
11th ACM Asia Conference on Computer and Communications Security (ASIA CCS)
会议时间：
MAY 30-JUN 03, 2016
会议地点：
Xian, PEOPLES R CHINA
会议主办单位：
[Liang, Kaitai] Aalto Univ, Dept Comp Sci, Helsinki, Finland.^[Su, Chunhua] Japan Adv Inst Sci & Technol, Sch Informat Sci, 1-1 Asahidai, Nomi, Ishikawa 9231292, Japan.^[Chen, Jiageng] Cent China Normal Univ, Comp Sch, Wuhan 430079, Peoples R China.^[Liu, Joseph K.] Monash Univ, Fac Informat Technol, Melbourne, Vic, Australia.
关键词：
Encrypted cloud data;privacy;secure data search and share;efficiency
摘要：
Outsourcing a huge amount of local data to remote cloud servers that has been become a significant trend for industries. Leveraging the considerable cloud storage space, industries can also put forward the outsourced data to cloud computing. How to collect the data for computing without loss of privacy and confidentiality is one of the crucial security problems. Searchable encryption technique has been proposed to protect the confidentiality of the outsourced data and the privacy of the corresponding data query. This technique, however, only supporting search functionality, may not be fully applicable to real-world cloud computing scenario whereby secure data search, share as well as computation are needed. This work presents a novel encrypted cloud-based data share and search system without loss of user privacy and data confidentiality. The new system enables users to make conjunctive keyword query over encrypted data, but also allows encrypted data to be efficiently and multiply shared among different users without the need of the "download-decrypt-then-encrypt" mode. As of independent interest, our system provides secure keyword update, so that users can freely and securely update data's keyword field. It is worth mentioning that all the above functionalities do not incur any expansion of ciphertext size, namely, the size of ciphertext remains constant during being searched, shared and keyword-updated. The system is proven secure and meanwhile, the efficiency analysis shows its great potential in being used in large-scale database.
摘要：
In this paper, color image encryption algorithm based on improved RC4 and chaotic maps is proposed. In proposed algorithm, the classic RC4 algorithm in cryptography is improved, and then applied to proposed encryption algorithm. Firstly, the original image is divided into some sub-blocks. Then, the improved RC4 algorithm is applied to the operation between the adjacent two sub-blocks, thereby changes the value of pixels. Finally, the image is scrambled by logistic map. Experimental results show that the original image has a big change and a flat histogram after encrypted, and that the proposed algorithm has an enough large key space and a very high sensitivity to the key.
摘要：
With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and textual description are gaining in prevalence. Given a spatial location and a set of keywords, a top-k spatial keyword query returns the k best spatio-textual objects ranked according to their proximity to the query location and relevance to the query keywords. To our knowledge, existing study on spatial keyword query processing only focuses on single query point scenario. In this paper, we take the first step to study the problem of multiple query points (or group queries) top-k spatial keyword query processing. We first propose a threshold-based algorithm, which first performs incremental top-k spatial keyword query for each query point and then combines their results. Next, we propose another more efficient algorithm by treating the whole query set as a query unit, which can significantly reduce the objects to be examined, and thus achieve higher performance. Extensive experiments using real datasets demonstrate that our approaches are efficient in terms of runtime and I/O cost, as compared to the baseline algorithm.
作者：
Jian, Fanghong;Huang, Jimmy Xiangji*;Zhao, Jiashu;He, Tingting（何婷婷）;Hu, Po
期刊：
SIGIR'16: PROCEEDINGS OF THE 39TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL,2016年:733-736
通讯作者：
Huang, Jimmy Xiangji
作者机构：
[Jian, Fanghong] Cent China Normal Univ, Natl Engn Res Ctr E Learning, Wuhan, Hubei, Peoples R China.;[Huang, Jimmy Xiangji] Cent China Normal Univ, Informat Retrieval & Knowledge Management Res Lab, Wuhan, Hubei, Peoples R China.;[He, Tingting; Hu, Po] Cent China Normal Univ, Sch Comp Sci, Wuhan, Hubei, Peoples R China.;[Zhao, Jiashu] York Univ, Sch Informat Technol, Toronto, ON, Canada.
通讯机构：
[Huang, Jimmy Xiangji] C;Cent China Normal Univ, Informat Retrieval & Knowledge Management Res Lab, Wuhan, Hubei, Peoples R China.
会议名称：
39th International ACM SIGIR conference on Research and Development in Information Retrieval
会议时间：
JUL 17-21, 2016
会议地点：
Pisa, ITALY
会议主办单位：
[Huang, Jimmy Xiangji] Cent China Normal Univ, Informat Retrieval & Knowledge Management Res Lab, Wuhan, Hubei, Peoples R China.^[Jian, Fanghong] Cent China Normal Univ, Natl Engn Res Ctr E Learning, Wuhan, Hubei, Peoples R China.^[He, Tingting;Hu, Po] Cent China Normal Univ, Sch Comp Sci, Wuhan, Hubei, Peoples R China.^[Zhao, Jiashu] York Univ, Sch Informat Technol, Toronto, ON, Canada.
关键词：
Probabilistic Model;Dirichlet Language Model;LDA
摘要：
Traditional information retrieval (IR) models, in which a document is normally represented as a bag of words and their frequencies, capture the term-level and document-level information. Topic models, on the other hand, discover semantic topic-based information among words. In this paper, we consider term-based information and semantic information as two features of query terms and propose a simple enhancement for ad-hoc IR via topic modeling. In particular, three topic-based hybrid models, LDA-BM25, LDA-MATF and LDA-LM, are proposed. A series of experiments on eight standard datasets show that our proposed models can always outperform significantly the corresponding strong baselines over all datasets in terms of MAP and most of datasets in terms of P@5 and P@20. A direct comparison on eight standard datasets also indicates our proposed models are at least comparable to the state-of-the-art approaches.
会议名称：
IEEE Congress on Evolutionary Computation (CEC) held as part of IEEE World Congress on Computational Intelligence (IEEE WCCI)
会议时间：
JUL 24-29, 2016
会议地点：
Vancouver, CANADA
会议主办单位：
[Jiang, Shouyong;Yang, Shengxiang] De Montfort Univ, Sch Comp Sci, Leicester LE1 9BH, Leics, England.^[Guo, Jinglei] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
会议论文集名称：
IEEE Congress on Evolutionary Computation
摘要：
The multiobjective evolutionary algorithm based on decomposition (MOEA/D) decomposes a multiobjective optimization problem into a number of single-objective problems and solves them collaboratively. Since its introduction, MOEA/D has gained increasing research interest and has become a benchmark for validating new designed algorithms. Despite that, some recent studies have revealed that MOEA/D faces some difficulties to solve problems with complicated characteristics. In this paper, we study the influence of the penalty-based boundary intersection (PBI) approach, one of the most popular decomposition approaches used in MOEA/D, on individuals' convergence and diversity, showing that the fixed same penalty value for all the subproblems is not very sensible. Based on this observation, we propose to use adaptive penalty values to enhance the balance between population convergence and diversity. Experimental studies show that the proposed adaptive PBI can generally improve the performance of the original PBI when solving the problems considered in this paper.
作者机构：
[Zhu, Zhiyuan] Chinese Inst Elect, Consulting & Stand Res Ctr, Beijing, Peoples R China.;[Ren, Dongchun] Beijing 7Invensun Technol Co Ltd, Res Ctr, Beijing, Peoples R China.;[Zhou, Guangyou; Zhou, Yin] Cent China Normal Univ, Sch Comp, Wuhan, Hubei, Peoples R China.
会议名称：
2nd Annual International Conference on Network and Information Systems for Computers (ICNISC)
会议时间：
APR 15-17, 2016
会议地点：
Wuhan, PEOPLES R CHINA
会议主办单位：
[Zhu, Zhiyuan] Chinese Inst Elect, Consulting & Stand Res Ctr, Beijing, Peoples R China.^[Ren, Dongchun] Beijing 7Invensun Technol Co Ltd, Res Ctr, Beijing, Peoples R China.^[Zhou, Guangyou;Zhou, Yin] Cent China Normal Univ, Sch Comp, Wuhan, Hubei, Peoples R China.
关键词：
DIR;BoVW;feature fusion
摘要：
With the rising popularity of mobile devices, recent years have witnessed a growing interest in document image retrieval (DIR). In conventional Bag-of-Visual-Words (BoVW) based document image retrieval method, only SIFT or SURF feature is used to locate feature points and produce a codebook, which has a low discriminative power. Though several multiple feature based BoVW methods are proposed, these methods are based on multiple codebooks. However, some features can not train a codebook, such as connected-component feature. So this paper propose a new multi-feature fusion method, considering these features. Experimental results show that the proposed method has better performance.
摘要：
A silhouette polygon matching method is proposed based on centroid distance in polar grid. With the polygon centroid as the origin, all the vertexes of the polygon in an image are converted into the polar coordinates. The polygon is partitioned into many grids according to the polar angle. The average centroid distance in each grid is considered as the descriptor and the similarity measure of the polygon. In addition, normalized polygon area is applied to speed up the progress of similar polygons searching. Experiments show that its calculating speed is higher by an order of magnitude than traditional algorithm using polygon feature point sets extraction and matching.
摘要：
Statistical cryptanalysis is one of the most powerful tools to analyze symmetric key cryptographic primitives such as block ciphers. One of these attacks, the differential attack has been demonstrated to break a wide range of block ciphers. Block cipher proposals previously obtain a rough estimate of their security margin against differential attacks by counting the number of active S-Box along a differential path. However this method does not take into account the complex clustering effect of multiple differential paths. Analysis under full differential distributions have been studied for some extremely lightweight block ciphers such as KATAN and SIMON, but is still unknown for ciphers with relatively large block sizes. In this paper, we provide a framework to accurately estimate the full differential distribution of General Feistel Structure (GFS) block ciphers with relatively large block sizes. This framework acts as a convenient tool for block cipher designers to determine the security margin of their ciphers against differential attacks. We describe our theoretical model and demonstrate its correctness by performing experimental verification on a toy GFS cipher. We then apply our framework to two concrete GFS ciphers, LBlock and TWINE to derive their full differential distribution by using super computer. Based on the results, we are able to attack 25 rounds of TWINE-128 using a distinguishing attack, which is comparable to the best attack to date. Besides that, we are able to depict a correlation between the hamming weight of an input differential characteristic and the complexity of the attack. Based on the proposed framework, LBlock and TWINE have shown to have 178 and 208-bit security respectively.
期刊：
Advances in Intelligent Systems and Computing,2016年464:13-22 ISSN：2194-5357
通讯作者：
Jin, Cong
作者机构：
[Liu, Jin-An; Jin, Cong] Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.;[Jin, Shu-Wei] Ecole Normale Super, Dept Phys, 24 Rue Lhomond, F-75231 Paris 5, France.
通讯机构：
[Jin, Cong] C;Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.
会议主办单位：
[Jin, Cong;Liu, Jin-An] Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.^[Jin, Shu-Wei] Ecole Normale Super, Dept Phys, 24 Rue Lhomond, F-75231 Paris 5, France.
会议论文集名称：
Advances in Intelligent Systems and Computing
关键词：
Chinese ancient fiction;Image feature;Image narration;Semantic description
摘要：
Narration of Chinese ancient fiction images has been concerned by many researchers. In the today of the digital technology rapid development, it will affect research of the image narration for Chinese ancient fiction. Based on the existing digital technologies, in this paper, an image narration framework in digital environment for Chinese ancient fiction is proposed. In the proposed framework, we analyze the possibility of using variety digital techniques for achieving the narration of Chinese ancient fiction images, whose implementation can provide support for the digital narration of Chinese ancient fiction images.
作者机构：
[Long Fang; Zhou Wei] Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.;[Ye Zhujun] Cent China Normal Univ, State Based Class Phys, Wuhan, Peoples R China.
会议名称：
6th International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)
会议时间：
JUL 21-23, 2016
会议地点：
Harbin Inst Technol, Harbin, PEOPLES R CHINA
会议主办单位：
Harbin Inst Technol
会议论文集名称：
International Conference on Instrumentation Measurement Computer Communication and Control
关键词：
ordering food online;E-commerce;WeChat;J2EE
摘要：
Because the phenomenon about unreasonable arrangement of college students' class hour is relatively common, the system designed a public colleges and universities ordering system based on WeChat. This system took use of convenience and openness of WeChat, which can tremendously simplify the development and promotion. At the same time, online ordering for the students provided a convenient way of eating, and it was conducive to enhance learning efficiency of students. This system mainly completed the users' ordering function. The users can observe the dynamic change in their orders. The sellers can have a real-time observation of the buyers' orders and deal with them in time. And at the same time, sellers can modify their own restaurants information including dishes' information. And the administrator can manage the sellers, including the crud of sellers.
作者机构：
[Yang Yan; Yao Hua-Xiong; Li Rong; Yang, Y; Yao, HX; Li, R] Cent China Normal Univ, Comp Sch, Wuhan 430079, Peoples R China.
会议名称：
4th National Conference on Electrical, Electronics and Computer Engineering (NCEECE)
会议时间：
DEC 12-13, 2015
会议地点：
Xian, PEOPLES R CHINA
会议主办单位：
[Yang Yan;Yao Hua-Xiong;Li Rong] Cent China Normal Univ, Comp Sch, Wuhan 430079, Peoples R China.
会议论文集名称：
AER-Advances in Engineering Research
关键词：
time series;rough set;similarity;data clustering;Web Recommendation
摘要：
In the view of the information inaccuracy and additional information in the web page recommendation algorithm of multi similar web pages, the data clustering effect is not satisfactory. In this paper, a new method for the image denoising method based on the rough set of Gauss block is proposed. Firstly, based on the information uncertainty, we use rough set theory to improve the traditional probabilistic data clustering model, which is suitable to deal with the problem of information uncertainty. Secondly, to solve the problem that the fixed probability data clustering is used to deal with the problem of web page tag recommendation, the problem is that the new algorithm has higher accuracy and efficiency compared with the new information.
期刊：
PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON BIG DATA,2015年:2907-2909
通讯作者：
Zhang, Maoyuan
作者机构：
[Zhu, Jianping; Yuan, Fang; Zhang, Maoyuan] Cent China Normal Univ, Dept Comp Sci & Technol, Wuhan, Peoples R China.
通讯机构：
[Zhang, Maoyuan] C;Cent China Normal Univ, Dept Comp Sci & Technol, Wuhan, Peoples R China.
会议名称：
IEEE International Conference on Big Data
会议时间：
OCT 29-NOV 01, 2015
会议地点：
Santa Clara, CA
会议主办单位：
[Zhang, Maoyuan;Yuan, Fang;Zhu, Jianping] Cent China Normal Univ, Dept Comp Sci & Technol, Wuhan, Peoples R China.
关键词：
Semantic Knowledge;Cloud Model;Tag-LDA
摘要：
Semantic Knowledge is usually adding into topic model to improve topic coherence. However, it's hard to judge whether semantic information is related to topic without using complicated lexical characteristics. In this paper, we demonstrate a novel model called Cloud Transformation Model, which can easily judge whether semantic information is related to topic, and integrate semantic information into topic model.
摘要：
Because of dynamic nature of the application layer multicast node in mobile ALM, the node easily loss. The loss of upper-middle-class multicast tree nodes has a wide range of influence, but the loss of lower nodes, especially the leaf node has a small range of influence. According to this characteristic, Hierarchical Adaptive Recovery (HAR) algorithm is proposed. Firstly HAR stipulates the judging method of core nodes and primary nodes, namely hierarchical method; when the node is missing, based on different nodes loss, it can adopt different recovery strategy to renew the multicast tree. Also it can make the multicast tree more stable and get higher node recovery efficiency. Through the experimental comparison, it is proved that HAR has lower rejoining delay.
期刊：
2008 INTERNATIONAL WORKSHOP ON EDUCATION TECHNOLOGY AND TRAINING AND 2008 INTERNATIONAL WORKSHOP ON GEOSCIENCE AND REMOTE SENSING, VOL 1, PROCEEDINGS,2015年:155-158
通讯作者：
Liu Hui
作者机构：
[Liu Hui] Hubei Univ Technol, Sch Elect & Elect Engn, Wuhan 430065, Peoples R China.;[Jin Hanjun; Yan Jianlin] Huazhong Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.
摘要：
Shadow scenes by shadow mapping has long suffered from the problem of under-sampling artifacts due to too little shadow map resolution leading to so-called perspective and projection aliasing. On this issue, we present a new practical real-time shadow mapping algorithm. Firstly we sample the scene from the eye-point on the GPU to get the needed shadow map resolution in different parts of the scene. Then we process the resulting data on the CPU and construct a hierarchical grid structure. Finally we traverse it in quad-tree fashion, shadowing the scene with shadow map pages where needed. The results show that shadow mapping algorithm based on quad-tree is capable of shadowing large scenes by virtually increasing the resolution of the whole shadow map beyond the GPU hardware limit.
