作者： Li, Yanhong;Wang, Meng;Zhu, Rongbo*;Anjum, Ashiq;Du, Xiaokun;...

期刊： Future Generation Computer Systems,2019年94:697-711 ISSN：0167-739X

通讯作者： Zhu, Rongbo

作者机构： [Tian, Shasha; Zhu, Rongbo; Du, Xiaokun; Li, Yanhong; Wang, Meng] South Cent Univ Nationalities, Coll Comp Sci, Wuhan, Hubei, Peoples R China.;[Feng, Yuhe] Guangdong Intelligent Robot Inst, R&D, Dongguan, Peoples R China.;[Zhu, Rongbo] Beihang Univ, State Key Lab Virtual Real Technol & Syst, Beijing, Peoples R China.;[Anjum, Ashiq] Univ Derby, Coll Engn & Technol, Derby, England.;[Luo, Changyin] Cent China Normal Univ, Sch Comp, Wuhan, Hubei, Peoples R China.

通讯机构： [Zhu, Rongbo] 1;182 Minzu Ave, Wuhan 430074, Hubei, Peoples R China.

关键词： Intelligent query;Internet of vehicles;Boolean expression;Traffic network

摘要： Internet of Vehicles (IoV) has attracted wide attention from both academia and industry. Due to the popularity of the geographical devices deployed on the vehicles, a tremendous amount of spatial entities which include spatial information, unstructured information and structured information, are generated every second. This development calls for intelligent augmented spatial keyword queries (ASKQ), which intelligently takes into account the locations, unstructured information (in the form of keyword sets), structured information (in the form of boolean expressions) of 182MinzuAvespatial entities. In this paper, we take the first step to address the issue of processing ASKQ in real traffic networks of IoV environments (ASKQIV) and focus on Top-k ASKQIV queries. To support network distance pruning, keyword pruning, and boolean expression pruning intelligently and simultaneously, a novel hybrid index structure called ASKTI is proposed. Note in the real-life traffic networks of IoV environments, travel cost is not only decided by the network distance, but also decided by some additional travel factors. By considering these additional factors, a combined factor Cftc of each road (edge) in the traffic network of IoV environments is calculated, and weighted network distance is calculated and adopted. Based on ASKTI, an efficient algorithm for Top-k ASKQIV query processing is proposed. Our method can also be extended to handle boolean range ASKQIV Queries and ranking ASKQIV Queries. Finally, simulation experiments on one real traffic network of IoV environments and two synthetic spatial entity sets are conducted. The results show that our ASKTI based method is superior to its competitors. © 2018 Elsevier B.V.

语种： 英文

作者： Li, Yanhong;Luo, Changyin;Zhu, Rongbo*;Chen, Yuanfang;Zeng, Huacheng

期刊： MOBILE NETWORKS & APPLICATIONS,2018年23(4):864-878 ISSN：1383-469X

通讯作者： Zhu, Rongbo

作者机构： [Zhu, Rongbo; Li, Yanhong] South Cent Univ Nationalities, Coll Comp Sci, Wuhan, Hubei, Peoples R China.;[Luo, Changyin] Cent China Normal Univ, Sch Comp, Wuhan, Hubei, Peoples R China.;[Chen, Yuanfang] Guangdong Univ Petrochem Technol, Maoming, Peoples R China.;[Zeng, Huacheng] Univ Louisville, Dept Elect & Comp Engn, Louisville, KY 40292 USA.

通讯机构： [Zhu, Rongbo] S;South Cent Univ Nationalities, Coll Comp Sci, Wuhan, Hubei, Peoples R China.

关键词： Spatial keyword query;Internet of industrial vehicles;Wireless data broadcast;Air index

摘要： With the development of the Internet of Things (IoT), the industrial vehicle ad hoc networks are revolving into the Internet of Industrial Vehicles (IoIV). Due to the popularity of the geographical devices used on the Industrial vehicle, location-based information is extensively available in IoIV. This development calls for spatial keyword queries (SKQ), which takes into account both the locations and textual descriptions of objects. This paper addresses the issue of processing SKQ in IoIV environment, which focuses on two types of SKQ queries, namely Boolean kNN Queries and Top-k Queries. A general air index called Extended Spatial Keyword query index in IoIV environment (ESKIV) is proposed, which supports both network space pruning and textual pruning simultaneously. Based on ESKIV, efficient algorithms are designed to deal with these two types of SKQ respectively. The proposed ESKIV also can be used to deal with other kinds of queries, such as range SKQ. Finally, extensive simulations are conducted to demonstrate the efficiency of our ESKIV index and the corresponding query processing algorithms.

语种： 英文

作者： Wang, Xiaoyan;Li, Yichuan;He, Tingting（何婷婷）;Jiang, Xingpeng*（蒋兴鹏）;Hu, Xiaohua*

期刊： BMC Systems Biology,2018年12(6):39-45 ISSN：1752-0509

通讯作者： Jiang, Xingpeng（蒋兴鹏）;Hu, Xiaohua

作者机构： [Jiang, Xingpeng; He, Tingting; Hu, Xiaohua; Li, Yichuan; Wang, Xiaoyan; Hu, XH] Cent China Normal Univ, Sch Comp, Wuhan, Hubei, Peoples R China.;[Hu, Xiaohua] Drexel Univ, Coll Comp & Informat, Philadelphia, PA 19104 USA.

通讯机构： [Jiang, XP; Hu, XH] C;Cent China Normal Univ, Sch Comp, Wuhan, Hubei, Peoples R China.

关键词： Spark;Named entity recognition;Text mining;Microbial interactions

摘要： Background: Microbe plays a crucial role in the functional mechanism of an ecosystem. Identification of the interactions among microbes is an important step towards understand the structure and function of microbial communities, as well as of the impact of microbes on human health and disease. Despite the importance of it, there is not a gold-standard dataset of microbial interactions currently. Traditional approaches such as growth and co-culture analysis need to be performed in the laboratory, which are time-consuming and costly. By providing predicted candidate interactions to experimental verification, computational methods are able to alleviate this problem. Mining microbial interactions from mass medical texts is one type of computational methods. Identification of the named entity of bacteria and related entities from the text is the basis for microbial relation extraction. In the previous work, a system of bacteria named entities recognition based on the dictionary and conditional random field was proposed. However, it is inefficient when dealing with large-scale text. Results: We implemented bacteria named entity recognition on Spark platform and designed experiments for comparison to verify the correctness and validity of the proposed system. The experimental results show that it can achieve higher F-Measure on the comparison of correctness. Moreover, the predicting speed is much faster than the previous version in large-scale biomedical datasets, and the computational efficiency is improved remarkably by about 3.1 to 6.7 times. Conclusions: The system for bacteria named entity recognition solves the inefficiency of the previous proposed system on large-scale datasets. The proposed system has good performance in accuracy and scalability. © 2018 The Author(s).

语种： 英文

作者： 李源;翟宏森;刘凤娇;黄文灿;杨梦川

期刊： 计算机与数字工程,2018年46(1):78-82,190 ISSN：1672-9722

作者机构： 华中师范大学计算机学院 武汉 430079;[杨梦川; 李源; 翟宏森; 黄文灿; 刘凤娇] 华中师范大学

关键词： 词义消歧;依存关系;特征模板;最大熵模型

摘要： 词义消歧是自然语言信息处理领域的基础研究, 对自然语言信息处理领域的研究至关重要.为解决词义消歧中提取关联词语不精确进而影响词义消歧正确率的问题, 该文依存句法模板设计了5种复合特征模板, 并结合最大熵模型进行训练.实验证明, 使用该复合模板, 不仅降低了计算复杂度, 而且提高了词义消歧的性能.对500余条复句进行词义消歧, 取得了较好的词义消歧正确率.

语种： 中文

作者： 李源;刘凤娇;刘剑锋;翟宏森;杨梦川

期刊： 计算机与数字工程,2018年46(4):750-753+768 ISSN：1672-9722

作者机构： 华中师范大学计算机学院 武汉430079;[刘剑锋; 杨梦川; 李源; 翟宏森; 刘凤娇] 华中师范大学

关键词： 三分句;句法依存;标记隐现规则

摘要： 汉语复句层次关系的研究是目前中文信息处理中极为重要的研究课题,而有标复句成为重要的研究对象。在汉语的实际运用过程中,二重复句和三重复句使用较多,而二重复句中三分句为典型的使用模式,因此,论文重点研究三分句二重有标复句的层次关系。为实现对三分句有标复句层次关系的识别,论文采取了基于依存句法和标点符号（逗号）对复句进行分句的提取,同时,通过构建标记隐现规则库实现对三分句有标复句的层次关系识别。

语种： 中文

作者： Zheng, Qiang;Yuan, Zhilin;Li, Yuan;Li, Wei*

期刊： Applied Sciences-Basel,2018年8(6) ISSN：2076-3417

通讯作者： Li, Wei

作者机构： [Zheng, Qiang; Li, Wei; Yuan, Zhilin] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Hubei, Peoples R China.;[Li, Yuan] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.

通讯机构： [Li, Wei] H;Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Hubei, Peoples R China.

关键词： Digital back-propagation;Nonlinear signal-to-noise interaction;Nonlinearity mitigation;Optical fiber communications;Raman amplification

摘要： A theoretical model of the nonlinear signal-to-noise interaction (NSNI) in a bi-directional Raman amplified system with receiver-side digital back-propagation (DBP) or split-DBP is given, which is helpful for the design of such a system. In the proposed model, the distributed Raman gain and the spontaneous Raman scattering are taken into account. The results of the theoretical calculation are compared with the results of transmission simulations, which indicates that the theoretical model matches well with the results of simulations when the pre-compensation length is less than 100 km. For the cases of pre-compensation lengths more than 100 km, the theoretical model has an error of less than 0.1 dB compared with the simulations. By using the theoretical model, the efficiency of the split-DBP is analyzed, and the results are compared with transmission simulations. Both the results of theoretical calculation and simulations show that the split-DBP can effectively mitigate the NSNI in such a system. By adopting split-DBP, with an appropriate pre-compensation length, the signal-to-noise ratio (SNR) of the signal increases by about 1 dB. In addition, the impact of the double Rayleigh scattering (DRB) is also analyzed using the proposed model, and the results show that DRB has little impact on the system. © 2018 by the authors.

语种： 英文

作者： Feng, Qiguang;Li, Yuan*;Wang, You;Zhang, Pu;Zheng, Qiang;...

期刊： Asia Communications and Photonics Conference, ACP,2017年2017-August ISSN：2162-108X

通讯作者： Li, Yuan

作者机构： [Feng, Qiguang; Zheng, Qiang; Wang, You; Li, Wei; Zhang, Pu] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Hubei, Peoples R China.;[Li, Yuan] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.

通讯机构： [Li, Yuan] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.

会议名称： Asia Communications and Photonics Conference (ACP)

会议时间： NOV 10-13, 2017

会议地点： Guangzhou, PEOPLES R CHINA

会议主办单位： [Feng, Qiguang;Wang, You;Zhang, Pu;Zheng, Qiang;Li, Wei] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Hubei, Peoples R China.^[Li, Yuan] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.

会议论文集名称： Asia Communications and Photonics Conference and Exhibition

摘要： With orthogonal coding, we proposed a cost-effective ring-based optical access architecture with Rayleigh backscattering noise mitigation for optical and wireless convergence, where no extra lasers for the upstream and fewer fiber Bragg gratings are required. Asia Communications and Photonics Conference (ACP) © OSA 2017

语种： 英文

作者： Feng, Qiguang;Li, Yuan*;Zheng, Qiang;Zhang, Pu;Wang, You;...

期刊： Asia Communications and Photonics Conference, ACP,2017年2017-August ISSN：2162-108X

通讯作者： Li, Yuan

作者机构： [Feng, Qiguang; Zheng, Qiang; Wang, You; Li, Wei; Zhang, Pu] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Hubei, Peoples R China.;[Li, Yuan] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.

通讯机构： [Li, Yuan] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.

会议名称： Asia Communications and Photonics Conference (ACP)

会议时间： NOV 10-13, 2017

会议地点： Guangzhou, PEOPLES R CHINA

会议主办单位： [Feng, Qiguang;Zheng, Qiang;Zhang, Pu;Wang, You;Li, Wei] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Hubei, Peoples R China.^[Li, Yuan] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.

会议论文集名称： Asia Communications and Photonics Conference and Exhibition

摘要： We proposed a stochastic model to analyze the evolution of spontaneous Raman and Rayleigh scatterings in distributed Raman amplifiers. Good agreement was obtained between the simulations and measurements, which verified the accuracy of the model. Asia Communications and Photonics Conference (ACP) © OSA 2017

语种： 英文

作者： 李源;刁胜权;胡金柱;翟宏森;杨梦川;...

期刊： 计算机工程与科学,2017年39(12):2306-2313 ISSN：1007-130X

作者机构： [李源; 刁胜权; 胡金柱; 翟宏森; 杨梦川; 黄文灿] 华中师范大学计算机学院, 湖北, 武汉, 430079

关键词： 汉语复句;层次关系;语义;挖掘;规则;移进-规约

摘要： 汉语复句层次关系分析是中文信息处理领域极具挑战性的课题之一。为解决关系词标识信息不充足所导致的复句层次关系识别准确率下降问题,挖掘了影响分句关联的形式化语义知识,在此基础上构建了小句关联体识别算法并将其应用于相应的复句层次判定规则之中,以辅助分析其层次关系;对于其余单、多重有标复句的层次识别,使用基于搭配规则的移进-归约算法;最后提出了一种语义与规则相结合的复句层次分析模型。实验结果表明,此方法在一定程度上提高了复句层次关系识别的准确率。

语种： 中文

作者： Li, Yuan;Deng, Zhuanhua*;Hu, Rong;Li, Cai;Li, Wei*;...

期刊： Optics Communications,2016年370:222-225 ISSN：0030-4018

通讯作者： Deng, Zhuanhua;Li, Wei

作者机构： [Li, Yuan] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.;[Deng, Zhuanhua] Hubei Univ Econ, Sch Informat Management, Wuhan, Peoples R China.;[Yu, Shaohua; Li, Cai; Li, Wei; Hu, Rong; Yuan, Zhilin] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China.

通讯机构： [Deng, Zhuanhua; Li, Wei] H;Hubei Univ Econ, Sch Informat Management, Wuhan, Peoples R China.;Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China.

关键词： UDWDM-PON;Coherent detection;DBPSK;ASK

摘要： The coherent ultra-dense wavelength division multiplexed passive optical network (UDWDM-PON) has been widely studied recently, in which the envelop detection based coherent reception of on-off keying (00K) signal has been shown to possess both high receiver sensitivity and tolerance against laser linewidth/chirp. In order to increase the spectral efficiency (SE) to 2 bit/s/Hz, researchers formulated a hybrid DBPSK/ASK-2 modulation using the silicon Mach-Zehnder modulator (MZM), where both amplitude and phase modulation are employed. The experimental result shows that the proposed DBPSK/ASK-2 modulation is of better performance than PAM-4 at the same SE of 2 bit/s/Hz. When the low-cost silicon MZM and DFB laser of 4-MHz linewidth are employed, the receiver sensitivity of DBPSK/ASK-2 exceeds that of the PAM-4 by about 5.7 dB. This work can achieve about 46 dBm receiver sensitivity at 2.5 GBaud after transmission over 80-km standard single mode fiber (SSMF). The proposed DBPSK/ASK-2 modulation using low-cost silicon MZM and DFB laser is considered as a practical and reliable method for the future UDWDM-PON at the SE of 2 bit/s/Hz. (C) 2016 Elsevier B.V. All rights reserved.

语种： 英文

作者： 李源;刁胜权;汪春红;郑印;刘凤娇

期刊： 计算机与数字工程,2016年44(4):683-686+724 ISSN：1672-9722

作者机构： 华中师范大学计算机学院 武汉 430079;[郑印; 李源; 刁胜权; 刘凤娇; 汪春红] 华中师范大学

关键词： 复句;层次关系;自动识别;分句划分;移进规约

摘要： 为解决由于长复句以及搭配关系所导致的复句层次自动识别准确率下降问题,论文分析了复句中的标点使用规律,提出了基于SVM的分句界定方法;并基于复句关系词搭配规则,建立了复句的上下文无关文法形式化模型;依据该模型,提出一种改进的移进-归约算法;以期提高复句层次关系识别的准确率。

语种： 中文

作者： Tang, Xiwei*;Hu, Xiaohua*;Yang, Xuejun;Fan, Yetian;Li, Yongfan;...

期刊： BMC Genomics,2016年17(4):397-405 ISSN：1471-2164

通讯作者： Tang, Xiwei;Hu, Xiaohua

作者机构： [Li, Yongfan; Tang, Xiwei; Liao, Yongzhong; Hu, Wei; Zheng, Ming Cai] Hunan First Normal Univ, Sch Informat Sci & Engn, Changsha 410205, Hunan, Peoples R China.;[Hu, Xiaohua; Tang, Xiwei; Tang, XW; Hu, XH] Drexel Univ, Coll Comp & Informat, Philadelphia, PA 19104 USA.;[Tang, Xiwei; Yang, Xuejun] Natl Univ Def Technol, Coll Comp, Changsha 410073, Hunan, Peoples R China.;[Fan, Yetian] Dalian Univ Technol, Sch Math Sci, Dalian 116023, Peoples R China.;[Peng, Wei] Kunming Univ Sci & Technol, Ctr Comp, Kunming 650500, Peoples R China.

通讯机构： [Tang, Xiwei] H;[Tang, XW; Hu, XH] D;Hunan First Normal Univ, Sch Informat Sci & Engn, Changsha 410205, Hunan, Peoples R China.;Drexel Univ, Coll Comp & Informat, Philadelphia, PA 19104 USA.

关键词： Candidate Protein;Protein Subcellular Localization;Candidate Disease Gene;Prioritize Candidate Disease Gene;Subcellular Localization Information

摘要： Background: Diabetes mellitus characterized by hyperglycemia as a result of insufficient production of or reduced sensitivity to insulin poses a growing threat to the health of people. It is a heterogeneous disorder with multiple etiologies consisting of type 1 diabetes, type 2 diabetes, gestational diabetes and so on. Diabetes-associated protein/gene prediction is a key step to understand the cellular mechanisms related to diabetes mellitus. Compared with experimental methods, computational predictions of candidate proteins/genes are cheaper and more effortless. Protein-protein interaction (PPI) data produced by the high-throughput technology have been used to prioritize candidate disease genes/proteins. However, the false interactions in the PPI data seriously hurt computational methods performance. In order to address that particular question, new methods are developed to identify candidate disease genes/proteins via integrating biological data from other sources. Results: In this study, a new framework called PDMG is proposed to predict candidate disease genes/proteins. First, the weighted networks are building in terms of the combination of the subcellular localization information and PPI data. To form the weighted networks, the importance of each compartment is evaluated based on the number of interacted proteins in this compartment. This is because the very different roles played by different compartments in cell activities. Besides, some compartments are more important than others. Based on the evaluated compartments, the interactions between proteins are scored and the weighted PPI networks are constructed. Second, the known disease genes are extracted from OMIM database as the seed genes to expand disease-specific networks based on the weighted networks. Third, the weighted values between a protein and its neighbors in the disease-related networks are added together and the sum is as the score of the protein. Last but not least, the proteins are ranked based on descending order of their scores. The candidate proteins in the top are considered to be associated with the diseases and are potential disease-related proteins. Various types of data, such as type 2 diabetes-associated genes, subcellular localizations and protein interactions, are used to test PDMG method. Conclusions: The results show that the proteins/genes functionally exerting a direct influence over diabetes are consistently placed at the head of the queue. PDMG expands and ranks 445 candidate proteins from the seed set including original 27 type 2 diabetes proteins. Out of the top 27 proteins, 14 proteins are the real type 2 diabetes proteins. The literature extracted from the PubMed database has proved that, out of 13 novel proteins, 8 proteins are associated with diabetes. © 2016 Tang et al.

语种： 英文

作者： 胡泉;谢芳;李源;刘延申

期刊： 中文信息学报,2016年30(4):56-64,70 ISSN：1003-0077

作者机构： 华中师范大学物理学院, 湖北, 武汉, 430079;湖北工业大学计算机学院, 湖北, 武汉, 430068;华中师范大学计算机学院, 湖北, 武汉, 430079;[胡泉; 刘延申] 华中师范大学物理学院, 湖北, 武汉, 430079;[谢芳] 湖北工业大学计算机学院, 湖北, 武汉, 430068

关键词： 汉语复句关系词搭配;复杂网络;平均路径长度;聚集系数;度分布

摘要： 汉语复句关系词是汉语复句在语表形式上的标记,是复句中标识关系的重要构件,在现代汉语复句研究领域起着关键作用。汉语复句关系词的搭配是指在汉语语篇中两个或两个以上的复句关系词形成的句法共现形式,它不仅影响着分句的语义,而且影响着复句层次关系的划分。该文利用复杂网络的理论,基于已获取的470个复句关系词构建了一个“现代汉语复句关系词搭配网络”。通过对该网络中的平均路径长度、聚集系数和度分布等特征的统计,用来发现汉语复句关系词之间的搭配能力和搭配强度,这些结果能够帮助复句层次关系和复句逻辑语义的自动识别。

语种： 中文

作者： 胡金柱;舒江波;胡泉;李源;杨进才（杨进才）;...

期刊： 计算机工程与应用,2016年52(1):127-132 ISSN：1002-8331

作者机构： 华中师范大学计算机学院语言研究所, 武汉, 430079;华中师范大学, 国家数字化学习工程技术研究中心, 武汉, 430079;华中师范大学物理科学与技术学院, 武汉, 430079;湖北工业大学计算机学院, 武汉, 430068;[杨进才; 胡金柱; 李源] 华中师范大学计算机学院语言研究所, 武汉, 430079

关键词： 汉语复句关系词;规则的表示方法;自动识别;中文信息处理

摘要： 关系词在现代汉语复句领域起着重要的作用,是汉语语法、语义研究中的重要内容,复句关系词的计算机自动识别是一个非常困难的研究课题。在汉语复句关系词自动识别中规则的约束条件研究的基础上,重点研究现代汉语复句关系词自动识别系统中规则的表示方法,为进一步研究、建设复句关系词自动识别中的规则库,深入研究规则与统计相结合自动识别复句和复句关系词的方法,为实现汉语句子和篇章的自动识别奠定基础。

语种： 中文

作者： Li, Yanhong;Zhu, Rongbo*;Li, Guohui;Shu, Lihchyun;Luo, Changyin

期刊： IEEE ACCESS,2016年4:8900-8913 ISSN：2169-3536

通讯作者： Zhu, Rongbo

作者机构： [Zhu, Rongbo; Li, Yanhong] South Cent Univ Nationalities, Coll Comp Sci, Wuhan 430074, Peoples R China.;[Li, Guohui] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China.;[Shu, Lihchyun] Natl Cheng Kung Univ, Coll Management, Tainan 701, Taiwan.;[Luo, Changyin] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.

通讯机构： [Zhu, Rongbo] S;South Cent Univ Nationalities, Coll Comp Sci, Wuhan 430074, Peoples R China.

关键词： CkNN queries;CPkNN queries;Road networks;Uncertain speed

摘要： Continuous k-nearest neighbor (CkNN) query processing is an important issue in spatial temporal databases. In real-world scenarios, query clients and data objects may move with uncertain speeds on the road networks, which makes retrieving the exact CkNN query result a challenge. This paper addresses the issue of processing probabilistic CkNN queries of uncertain data (CPkNN) for road networks, where moving objects and query points are restricted by the connectivity of the road network and the object-query distance updates affect the query result. A novel model is proposed to estimate network distances between moving objects and a submitted moving query in the road network. Then, a CPkNN query monitoring method is presented to continuously report the possible result objects within a given time interval. In addition, an efficient method is proposed to arrange all the candidate objects according to their probabilities of being a kNN of a query. The method then chooses the top-k objects as the final query result. In addition, we extend our method to large networks with high efficiency. Finally, extensive experiments are conducted to demonstrate the effectiveness of the proposed schema.

语种： 英文

作者： Shen, Xianjun*;Zhao, Yanli;Li, Yanan;Yi, Yang;He, Tingting（何婷婷）;...

期刊： INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS,2015年11(4):458-473 ISSN：1748-5673

通讯作者： Shen, Xianjun

作者机构： [Yang, Jincai; He, Tingting; Shen, Xianjun; Yi, Yang; Zhao, Yanli; Li, Yanan] Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.

通讯机构： [Shen, Xianjun] C;Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.

关键词： protein complexes;best neighbour node;modularity increment;protein-protein interactions network

摘要： In order to overcome the limitations of global modularity and the deficiency of local modularity, we propose a hybrid modularity measure Local-Global Quantification (LGQ) which considers global modularity and local modularity together. LGQ adopts a suitable module feature adjustable parameter to control the balance of global detecting capability and local search capability in Protein-Protein Interactions (PPI) Network. Furthermore, we develop a new protein complex mining algorithm called Best Neighbour and Local-Global Quantification (BN-LGQ) which integrates the best neighbour node and modularity increment. BN-LGQ expands the protein complex by fast searching the best neighbour node of the current cluster and by calculating the modularity increment as a metric to determine whether the best neighbour node can join the current cluster. The experimental results show BN-LGQ performs a better accuracy on predicting protein complexes and has a higher match with the reference protein complexes than MCL and MCODE algorithms. Moreover, BN-LGQ can effectively discover protein complexes with better biological significance in the PPI network.

语种： 英文

作者： Shen, Xianjun;Yi, Li;Jiang, Xingpeng（蒋兴鹏）;Zhao, Yanli;He, Tingting（何婷婷）;...

期刊： PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE,2015年:109-112 ISSN：2156-1125

通讯作者： Yang, Jincai

作者机构： [Jiang, Xingpeng; Yang, Jincai; He, Tingting; Shen, Xianjun; Yi, Li; Zhao, Yanli] Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.

通讯机构： [Yang, Jincai] C;Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.

会议名称： IEEE International Conference on Bioinformatics and Biomedicine - Medical Informatics and Decision Making

会议时间： NOV 09-12, 2015

会议地点： Washington, DC

会议主办单位： [Shen, Xianjun;Yi, Li;Jiang, Xingpeng;Zhao, Yanli;He, Tingting;Yang, Jincai] Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.

会议论文集名称： IEEE International Conference on Bioinformatics and Biomedicine-BIBM

关键词： protein complexes;time course protein interaction networks;clustering coefficient;neighbor closeness

摘要： The detection of temporal protein complexes would be a great aid in furthering our knowledge of the dynamic features and molecular mechanism in cell life activities. Inspired by the idea of that the tighter a protein's neighbors inside a module connect, the greater the possibility that the protein belongs to the module, we propose a novel clustering algorithm CNC (Clustering based on Neighbor Closeness) and apply it to the time course protein interaction networks (TCPINs) to detect temporal protein complexes. Our novel algorithm has better performance on identifying protein complexes than five state-of-the-art algorithms-Hunter, MCODE, CFinder, SPICI, and ClusterONE-in terms of matching degree and accuracy metric, meanwhile it obtains many protein complexes with strong biological significance. © 2015 IEEE.

语种： 英文

作者： Li, Yuan;Wang, Yimeng;Li, Wei*;Han, Jilong;He, Zhixue;...

期刊： Photonic Network Communications,2015年29(1):32-39 ISSN：1387-974X

通讯作者： Li, Wei

作者机构： [Li, Yuan] Cent China Normal Univ, Dept Comp Sci, Wuhan 430074, Peoples R China.;[Li, Wei; Wang, Yimeng; Han, Jilong] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China.;[Yu, Shaohua; Qi, Yang; Hu, Rong; He, Zhixue] Wuhan Res Inst MPT, State Key Lab Opt Commun & Networks, Wuhan 430074, Peoples R China.

通讯机构： [Li, Wei] H;Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China.

关键词： Passive optical network;Electrical code division multiplexing;Uplink data transmission;Multi-level orthogonal coding;Wavelet packet transform

摘要： A novel uplink data transmission method in electrical code division multiplexing passive optical networks is proposed, simulated and experimentally verified, in which each optical network unit (ONU) is assigned a special multi-level orthogonal code based on wavelet packet transform. Comparing with the normal bi-level orthogonal code by using Walsh code or Gold code, the proposed method can improve the bandwidth utilizations and reduce the optical beat noise. Simulation results show 31 ONUs, of which each data rate is 10 Gb/s and total rate is 310 Gb/s, can be transmitted 30 km. Three ONUs with each data at 622 Mb/s over 50-km single-mode fiber is experimentally demonstrated.

语种： 英文

作者： Li, Yuan;Li, Wei*;Cheng, Haoran;Zhang, Zhaoyong;Fan, Youwen;...

期刊： Photonic Network Communications,2014年27(2):65-72 ISSN：1387-974X

通讯作者： Li, Wei

作者机构： [Li, Yuan] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Li, Wei; Fan, Youwen; Cheng, Haoran; Zhang, Zhaoyong] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China.;[He, Zhixue] Huazhong Univ Sci & Technol, Coll Optoelect Sci & Engn, Wuhan Res Inst Posts & Telecommun, Wuhan 430074, Peoples R China.;[Yu, Shaohua] Wuhan Res Inst Posts & Telecommun, Wuhan 43009, Peoples R China.

通讯机构： [Li, Wei] H;Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China.

关键词： DWDM Fiber-optic system;Linear frequency chirp;Nonlinear Schrödinger equation;Nonlinear phase shift;Pre-compensation

摘要： In this paper, we propose, simulate and experimentally demonstrate a convenient pre-compensation method, which is capable of mitigating fiber nonlinearity in dense wavelength-division-multiplexed long-haul high-speed systems. From nonlinear Schrödinger equation, we deduce that an optical signal with quadratic phase will have better nonlinear suppression ability than other phase pre-compensation methods. In our pre-compensation method, before being launched into fiber, each transmitted wavelength is modulated by a phase modulator, which is driven by a periodic parabolic electric driving signal. Thus, each channel will have a quadratic phase. Both of the simulations and experimental results show that the fiber Kerr nonlinearity can be reduced effectively and the BER can be improved by two orders of magnitude.

语种： 英文

作者： Shen, Xianjun;Zhao, Yanli*;Li, Yanan;He, Tingting（何婷婷）;Yang, Jincai（杨进才）;...

期刊： BMC Bioinformatics,2014年15(12):1-9 ISSN：1471-2105

通讯作者： Zhao, Yanli

作者机构： [Yang, Jincai; He, Tingting; Shen, Xianjun; Hu, Xiaohua; Zhao, Yanli; Li, Yanan] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.;[Hu, Xiaohua] Drexel Univ, Coll Comp & Informat, Philadelphia, PA 19104 USA.

通讯机构： [Zhao, Yanli] C;Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.

关键词： protein complexes;protein-protein interaction network;multistage kernel extension

摘要： Background: In recent years, many protein complex mining algorithms, such as classical clique percolation (CPM) method and markov clustering (MCL) algorithm, have developed for protein-protein interaction network. However, most of the available algorithms primarily concentrate on mining dense protein subgraphs as protein complexes, failing to take into account the inherent organizational structure within protein complexes. Thus, there is a critical need to study the possibility of mining protein complexes using the topological information hidden in edges. Moreover, the recent massive experimental analyses reveal that protein complexes have their own intrinsic organization. Methods: Inspired by the formation process of cliques of the complex social network and the centrality-lethality rule, we propose a new protein complex mining algorithm called Multistage Kernel Extension (MKE) algorithm, integrating the idea of critical proteins recognition in the Protein- Protein Interaction (PPI) network,. MKE first recognizes the nodes with high degree as the first level kernel of protein complex, and then adds the weighted best neighbour node of the first level kernel into the current kernel to form the second level kernel of the protein complex. This process is repeated, extending the current kernel to form protein complex. In the end, overlapped protein complexes are merged to form the final protein complex set. Results: Here MKE has better accuracy compared with the classical clique percolation method and markov clustering algorithm. MKE also performs better than the classical clique percolation method both on Gene Ontology semantic similarity and co-localization enrichment and can effectively identify protein complexes with biological significance in the PPI network. © 2014 Shen et al.; licensee BioMed Central Ltd.

语种： 英文