作者：
Chen, Jiageng*;Miyaji, Atsuko;Su, Chunhua;Teh, Jesen
作者机构：
[Chen, Jiageng] Cent China Normal Univ, Comp Sch, Wuhan, Peoples R China.;[Miyaji, Atsuko; Su, Chunhua] Japan Adv Inst Sci & Technol, Sch Informat Sci, Nomi, Japan.;[Miyaji, Atsuko] Japan Sci & Technol Agcy, Kawaguchi Ctr, Crest, Kawaguchi, Saitama, Japan.;[Miyaji, Atsuko] Osaka Univ, Grad Sch Engn, Suita, Osaka 565, Japan.;[Teh, Jesen] Univ Sains Malaysia, Informat Secur Lab, George Town, Malaysia.
会议名称：
2nd International Conference on Cyber Security and Cloud Computing (CS Cloud)
会议时间：
NOV 03-05, 2015
会议地点：
New York, NY
会议主办单位：
[Chen, Jiageng] Cent China Normal Univ, Comp Sch, Wuhan, Peoples R China.^[Miyaji, Atsuko;Su, Chunhua] Japan Adv Inst Sci & Technol, Sch Informat Sci, Nomi, Japan.^[Miyaji, Atsuko] Japan Sci & Technol Agcy, Kawaguchi Ctr, Crest, Kawaguchi, Saitama, Japan.^[Miyaji, Atsuko] Osaka Univ, Grad Sch Engn, Suita, Osaka 565, Japan.^[Teh, Jesen] Univ Sains Malaysia, Informat Secur Lab, George Town, Malaysia.
关键词：
Differential Path;Branch and Bound algorithm;Active S-box;LBlock;TWINE
摘要：
The success probability of differential and linear cryptanalysis against block ciphers heavily depend on finding differential or linear paths with high statistical bias compared with uniform random distribution. For large number of rounds, it is not a trivial task to find such differential or linear paths. Matsui first investigated this problem and proposed a solution based on a branch and bound algorithm in 1994. Since then, the research on finding good concrete differential or linear path did not receive much attention. In this paper, we revisit the differential attack against several S-Box based block ciphers by carefully studying the differential characteristics. Inspired by Matsui's algorithm, we provide an improved solution with the aid of several searching strategies, which enable us to find by far the best differential characteristics for the two investigated ciphers (LBlock, TWINE) efficiently. Furthermore, we provide another way to evaluate the security of ciphers against differential attack by comparing the strength of the ciphers from differential characteristic's point of view, and we also investigate the accuracy when using the active S-Box to evaluate the security margin against differential attack, which is the common method adapted when new ciphers are designed.
摘要：
Protein-protein interaction plays an important role in understanding biological processes. In order to resolve the parsing error resulted from modal verb phrases and the noise interference brought by appositive dependency, an improved tree kernel-based PPI extraction method is proposed in this paper. Both modal verbs and appositive dependency features are considered to define some relevant processing rules which can effectively optimize and expand the shortest dependency path between two proteins in the new method. On the basis of these rules, the effective optimization and expanding path is used to direct the cutting of constituent parse tree, which makes the constituent parse tree for protein-protein interaction extraction more precise and concise. The experimental results show that the new method achieves better results on five commonly used corpora.
摘要：
Traffic flow condition prediction is a basic problem in the transportation field. It is challenging to play out full potential of temporally-related information and overcome the problem of data sparsity existed in the traffic flow prediction. In this paper, we propose a novel urban traffic prediction mechanism namely C-Sense consisting of two parts: CRF-based temporal feature learning and sequence segments matching. CRF-based temporal feature learning exploits a linear-chain condition random field (CRF) to explore the temporal transformation rule in the traffic flow state sequence with supplementary environmental resources. Sequence segments matching is utilized to match the obtained state sequence segments with historical condition to get the ultimate prediction results. Experiments are evaluated based on datasets obtained in Wuhan and the results show that our mechanism can achieve good performance, which prove that it is a potential approach in transportation field.
期刊：
PROCEEDINGS OF THE 2015 JOINT INTERNATIONAL MECHANICAL, ELECTRONIC AND INFORMATION TECHNOLOGY CONFERENCE (JIMET 2015),2015年10:517-522 ISSN：2352-538X
通讯作者：
Yang Yan
作者机构：
[Yang Yan; Yao Hua-Xiong; Li Rong] Cent China Normal Univ, Comp Sch, Wuhan 430079, Peoples R China.
通讯机构：
[Yang Yan] C;Cent China Normal Univ, Comp Sch, Wuhan 430079, Peoples R China.
会议名称：
2015 Joint International Mechanical,Electronic and Information Technology Conference(JIMET 2015)(2015 联合国际机械,电子与信息技术国际会议)
会议时间：
2015-12-18
会议地点：
重庆
会议主办单位：
[Yang Yan;Yao Hua-Xiong;Li Rong] Cent China Normal Univ, Comp Sch, Wuhan 430079, Peoples R China.
会议论文集名称：
2015 Joint International Mechanical,Electronic and Information Technology Conference(JIMET 2015)(2015 联合国际机械,电子与信息技术国际会议)论文集
关键词：
Web services;SOAP;compression algorithm;XDrill
摘要：
We will firstly apply XDrill compression algorithm to the SOAP protocol. Firstly, this paper makes in-depth analysis of the differences in principles between XDrill algorithm and XMill algorithm, poin
会议名称：
IEEE International Conference on Information and Automation 2015
会议时间：
AUG 08-10, 2015
会议地点：
Lijiang, PEOPLES R CHINA
会议主办单位：
[Yang, Tianqi;Chen, Xin] Jinan Univ, Dept Comp Sci, Guangzhou, Guangdong, Peoples R China.^[Zeng, Zitao] Cent China Normal Univ, Dept Comp Sci & Technol, Wuhan, Peoples R China.
关键词：
gravity center track;multiple link;important score;gait recognition
摘要：
There has been increasing interest in applying gait recognition systems to real lives. Currently, the main obstacle hindering the appearance of gait recognition system is high complexity and suffering from dress and carrying variance. In this paper, it proposes a gait recognition method based on multi-link gravity center track (ML-GCT) that has low computation cost but robust to dress and carrying. It divides human silhouette into multiple links and calculates the GCT of each link. In order to improve the recognition accuracy, it takes Fisher's ratio as the importance score (IS) to rank body regions, then completes matching on the ranked regions. Test shows that the method is capable of achieving excellent recognition under different dress and carrying conditions.
期刊：
PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE,2015年:1133-1140 ISSN：2156-1125
通讯作者：
Guo, Xiyue
作者机构：
[Guo, Xiyue] Cent China Normal Univ, Natl Engn Res Ctr E Learning, Wuhan, Peoples R China.;[He, Tingting; Yuan, Jie] Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.;[Guo, Xiyue] Xingyi Normal Univ Nationalities, Sch Informat Technol, Xingyi, Peoples R China.
通讯机构：
[Guo, Xiyue] C;Cent China Normal Univ, Natl Engn Res Ctr E Learning, Wuhan, Peoples R China.
会议名称：
IEEE International Conference on Bioinformatics and Biomedicine - Medical Informatics and Decision Making
会议时间：
NOV 09-12, 2015
会议地点：
Washington, DC
会议主办单位：
[Guo, Xiyue] Cent China Normal Univ, Natl Engn Res Ctr E Learning, Wuhan, Peoples R China.^[He, Tingting;Yuan, Jie] Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.^[Guo, Xiyue] Xingyi Normal Univ Nationalities, Sch Informat Technol, Xingyi, Peoples R China.
会议论文集名称：
IEEE International Conference on Bioinformatics and Biomedicine-BIBM
关键词：
PPI Extraction;Weakly Supervised;Dictionary Construction;Slot-filling;Rule Learning
期刊：
WWW 2015 Companion - Proceedings of the 24th International Conference on World Wide Web,2015年:649-654
通讯作者：
Ma, Changlin
作者机构：
[Ma, Changlin; Wang, Meng] Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.;[Chen, Xuewen] Wayne State Univ, Dept Comp Sci, Detroit, MI 48202 USA.
通讯机构：
[Ma, Changlin] C;Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.
会议名称：
24th International Conference on World Wide Web (WWW)
会议时间：
MAY 18-22, 2015
会议地点：
Florence, ITALY
会议主办单位：
[Ma, Changlin;Wang, Meng] Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.^[Chen, Xuewen] Wayne State Univ, Dept Comp Sci, Detroit, MI 48202 USA.
关键词：
LDA;Topic and sentiment unification;Maximum entropy;Fine-grained opinion mining
摘要：
Opinion mining is an important research topic in data mining. Many current methods are coarse-grained, which are practically problemic due to insufficient feedback information and limited reference values. To address these problems, a novel topic and sentiment unification maximum entropy LDA model is proposed in this paper for fine-grained opinion mining of online reviews. In this model, a maximum entropy component is first added to the traditional LDA model to distinguish background words, aspect words and opinion words and further realize both the local and global extraction of these words. A sentiment layer is then inserted between a topic layer and a word layer to extend the proposed model to four layers. Sentiment polarity analysis is done based on the extraction of aspect words and opinion words to simultaneously acquire the sentiment polarity of the whole review and each topic, which leads to, fine-grained topic-sentiment abstract. Experimental results demonstrate the validity of the proposed model and theory.
作者机构：
[Zhao, Fu-Zhe; Xue, Bing-Xin] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.;[Zhao, Fu-Zhe] Cent China Normal Univ, Sch Comp, 152 Luoyu Ave, Wuhan 430079, Peoples R China.
会议名称：
International Conference on Computer Science and Communication Engineering (CSCE)
会议时间：
JUN 13-14, 2015
会议地点：
Suzhou, PEOPLES R CHINA
会议主办单位：
[Zhao, Fu-Zhe;Xue, Bing-Xin] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.
关键词：
FAST TCP;Lyapunov-Razumikhin;Stability
摘要：
FAST TCP is a variant of TCP. FAST TCP has become very popular in recent years due to the feature of high sustainability throughput and utilization at multi-Gbps over long distance. Unfortunately, the performance of FAST TCP heavily depends on the choice of the parameters. The approximate parameters bring excellent quality of service for FAST TCP; while the improper parameters lead to the poor performance in terms of throughput and utilization. To the best of our knowledge, no effective parameter selection method has been proposed to address this critical issue. Therefore, in this paper, we succeeded in finding the optimal parameters theoretically by analyzing global asymptotically stability of FAST TCP. Furthermore, the simulation results demonstrate the effectiveness and efficiency of our method.
作者机构：
[Zhao, Fuzhe] Cent China Normal Univ, Sch Comp, Wuhan, Hubei Province, Peoples R China.
会议名称：
International Conference on Materials Engineering and Information Technology Applications (MEITA)
会议时间：
AUG 30-31, 2015
会议地点：
Guilin, PEOPLES R CHINA
会议主办单位：
[Zhao, Fuzhe] Cent China Normal Univ, Sch Comp, Wuhan, Hubei Province, Peoples R China.
会议论文集名称：
AER-Advances in Engineering Research
关键词：
Multimedia stream;Transport protocol;TCP-like congestion control algorithm;improved algorithm
摘要：
In this paper, we analyze the problems of current congestion control algorithm based on TCP protocol and UDP protocol for transmitting multimedia stream, and proposed an improved multimedia stream con
期刊：
Lecture Notes in Computer Science,2015年9403:336-347 ISSN：0302-9743
通讯作者：
Hu, Po
作者机构：
[Hu, Po; Zhang, Yong] Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.;[He, Jiacong] Medallia Inc, Palo Alto, CA USA.
通讯机构：
[Hu, Po] C;Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.
会议名称：
8th International Conference on Knowledge Science, Engineering and Management (KSEM)
会议时间：
OCT 28-30, 2015
会议地点：
SW Univ, Fac Comp & Informat Sci, Chongqing, PEOPLES R CHINA
会议主办单位：
SW Univ, Fac Comp & Informat Sci
会议论文集名称：
Lecture Notes in Artificial Intelligence
关键词：
Query-focused multi-document summarization;Manifold ranking;Affinity graph construction
摘要：
Manifold ranking is one of the most competitive approaches for query-focused multi-document summarization. Despite its success for this task, it usually constructs a sentence affinity graph first based on inter-sentence content similarity, and then perform manifold ranking on the graph to score each sentence with the assumption that all the sentences live on a single manifold. Actually, for a document set to be summarized, the distribution of the sentences might form different, but related manifolds. This paper aims to generalize the basic manifold-ranking based approach to the more generic setting by introducing a novel affinity graph to estimate the similarity between sentences, which leverages both the local geometric structures and the contents of sentences jointly. Preliminary experimental results on the DUC datasets demonstrate the good effectiveness of the proposed approach.
作者：
Liang, Zhaohui;Zhang, Gang;Huang, Jimmy Xiangji*
期刊：
PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE,2015年:543-548 ISSN：2156-1125
通讯作者：
Huang, Jimmy Xiangji
作者机构：
[Huang, Jimmy Xiangji; Liang, Zhaohui] York Univ, Sch Informat Technol, Toronto, ON M3J 1P3, Canada.;[Huang, Jimmy Xiangji] Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.;[Zhang, Gang] Guangdong Univ Technol, Sch Automat, Guangzhou, Guangdong, Peoples R China.
通讯机构：
[Huang, Jimmy Xiangji] Y;York Univ, Sch Informat Technol, Toronto, ON M3J 1P3, Canada.
会议名称：
IEEE International Conference on Bioinformatics and Biomedicine - Medical Informatics and Decision Making
会议时间：
NOV 09-12, 2015
会议地点：
Washington, DC
会议主办单位：
[Liang, Zhaohui;Huang, Jimmy Xiangji] York Univ, Sch Informat Technol, Toronto, ON M3J 1P3, Canada.^[Huang, Jimmy Xiangji] Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.^[Zhang, Gang] Guangdong Univ Technol, Sch Automat, Guangzhou, Guangdong, Peoples R China.
会议论文集名称：
IEEE International Conference on Bioinformatics and Biomedicine-BIBM
关键词：
generative stochastic networks;deep learning;Markov chain transition;genetic polymorphism;adverse drug reaction
摘要：
Most traditional Wikipedia based methods use only article content information. By organizing Wikipedia articles as a graph, multi-information such as category and structure information can be utilized in our method. In this paper, we propose a novel method to do classification by using knowledge from a conceptual graph which is built from Wikipedia. First, we build a conceptual graph from Wikipedia. Each article is considered as a concept node. Titles, hyperlinks, texts and category information are used as edges to measure the relationship between those concepts. Each text is mapped to its respective set of nodes and Personalized PageRank (random walk) is then used to generate a set of most important node which can represent the text best. Finally the two sets are scored with a measure of vector similarity. We evaluate our techniques on the standard text classification dataset (20newsgroup), the results show the effectiveness of the proposed approach.
摘要：
Buzzwords are the main embodiment of internet culture, which play an important role in public opinion analysis, social focus tracking and language evolution study. At present, questionnaire has been wildly used as a standard method to obtain network buzzwords, which is subjective and costly. In this paper, we will propose a novel algorithm relying on the time-distribution feature of words and a KL-divergence measure to estimate words' popularity so as to figure out buzzwords in a specific period. The time-distribution feature simply states the fact that buzzwords' usage has a sharp increase during a very short period, which is then modeled formally with the KL-divergence measure. Compared with traditional method involving much workforce, the automatic algorithm presented here is clearly more efficient. Moreover, buzzwords identified in this manner will not be affected by individual's subjective opinions, so they can reflect the language usage in practice better. When applying the algorithm to a social media big data set, our experimental results show that the proposed approach can accurately identify buzzwords in a certain period, which is highly coincident with results tagged manually.
期刊：
Lecture Notes in Computer Science,2014年8801:279-289 ISSN：0302-9743
通讯作者：
Zhang, Maoyuan
作者机构：
[Zhang, Hong; Wu, Deyu; Zhang, Maoyuan; Pan, Xiaohang] Cent China Normal Univ, Dept Comp Sci, Luoyu Rd 152, Wuhan, Peoples R China.
通讯机构：
[Zhang, Maoyuan] C;Cent China Normal Univ, Dept Comp Sci, Luoyu Rd 152, Wuhan, Peoples R China.
会议名称：
13th China National Conference on Chinese Computational Linguistics (CCL) / 2nd International Symposium on Natural Language Processing Based on Naturally Annotated Big Data (NLP-NABD)
会议时间：
OCT 18-19, 2014
会议地点：
Cent China Normal Univ, Wuhan, PEOPLES R CHINA
作者机构：
[He, Fanli; Chen, Shuiyin; Zhang, Maoyuan] Cent China Normal Univ, Dept Comp Sci & Technol, Wuhan 430000, Peoples R China.
会议名称：
International Conference on Information Science and Cloud Computing Companion (ISCC-C)
会议时间：
DEC 07-08, 2013
会议地点：
Guangzhou, PEOPLES R CHINA
会议主办单位：
[Zhang, Maoyuan;He, Fanli;Chen, Shuiyin] Cent China Normal Univ, Dept Comp Sci & Technol, Wuhan 430000, Peoples R China.
关键词：
Information Retrieval;feature;Cloud Model;LDA model
摘要：
This paper probes into how to improve Information Retrieval by changing the feature distribution of the text. It introduces Cloud Model theory into Latent Dirichlet Allocation(LDA) Model and build a new feature selection system. LDA Model is used to mine the underlying topical structure. Each topic is associated with a multinomial distribution over words which are semantic related. But there is doubt that themes are relevant with each other in the light of semantics. Based on LDA model presented probability distribution of vocabulary in text, the new system with Cloud Model theory can automatically simulate feature set whose contribution degree is high in the text. Results show this feature set has less features but higher classification accuracy, thus obviously better than currently popular feature selection methods. If the query is matched to words with high contribution degree, the more these words are, the more relevant the article searched out is with the query. NTCIR-5 (the 5th NII Test Collection for IR Systems) collections of Experiment on SLIR (Single Language IR) show that this method achieves an obvious improvement compared with some other methods in IR.
作者机构：
[Liu, Chen] Cent China Normal Univ, Dept Elect & Informat Engn, Wuhan, Hubei Province, Peoples R China.;[Liu, Chen] Wuhan Inst Technol, Sch Elect & Informat Engn, Wuhan, Hubei Province, Peoples R China.;[Wei, Zhou] Cent China Normal Univ, Sch Comp, Wuhan, Hubei Province, Peoples R China.
会议名称：
3rd International Conference on Computer Science and Service System (CSSS)
会议时间：
JUN 13-15, 2014
会议地点：
Bangkok, THAILAND
会议主办单位：
[Liu, Chen] Cent China Normal Univ, Dept Elect & Informat Engn, Wuhan, Hubei Province, Peoples R China.^[Liu, Chen] Wuhan Inst Technol, Sch Elect & Informat Engn, Wuhan, Hubei Province, Peoples R China.^[Wei, Zhou] Cent China Normal Univ, Sch Comp, Wuhan, Hubei Province, Peoples R China.
会议论文集名称：
Advances in Intelligent Systems Research
关键词：
CBIR;feature retrieval;HSV color;Canny edge
摘要：
Content Based Image Retrieval (CBIR) has been stirred in last decades since the dramatic rise in the sizes of images databases. In this paper, a CBIR system is proposed combining features of color and significant edge. To promote the whole performance, compact quantizing method in HSV color space and revised Canny edge retrieval methods are adopted in feature retrieval process. User regulated weights make the integrated similarity customized. Experiments show the accuracy and efficiency of the proposed retrieval method.
