期刊：
IEEE/ACM Transactions on Computational Biology and Bioinformatics,2022年19(3):1322-1333 ISSN：1545-5963
通讯作者：
Jiang, X.
作者机构：
[He, Tingting; Jiang, Xingpeng; Ma, Yingjun] Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.;[Ma, Yingjun] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.;[He, Tingting; Jiang, Xingpeng] Cent China Normal Univ, Hubei Prov Key Lab Artificial Intelligence & Smar, Wuhan 430079, Hubei, Peoples R China.;[Tan, Yuting] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Peoples R China.;[Tan, Yuting] Hubei Key Lab Math Sci, Wuhan 430079, Hubei, Peoples R China.
通讯机构：
Central China Normal University, School of Computer, Hubei Provincial Key Laboratory of Artificial Intelligence and Smart Learning, Hubei, Wuhan, China
会议名称：
18th Asia Pacific Bioinformatics Conference (APBC)
会议时间：
AUG 18-20, 2020
会议地点：
ELECTR NETWORK
会议主办单位：
[Ma, Yingjun;He, Tingting;Jiang, Xingpeng] Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.^[Ma, Yingjun] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.^[He, Tingting;Jiang, Xingpeng] Cent China Normal Univ, Hubei Prov Key Lab Artificial Intelligence & Smar, Wuhan 430079, Hubei, Peoples R China.^[Tan, Yuting] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Peoples R China.^[Tan, Yuting] Hubei Key Lab Math Sci, Wuhan 430079, Hubei, Peoples R China.
摘要：
Infectious diseases are currently the most important and widespread health problem, and identifying viral infection mechanisms is critical for controlling diseases caused by highly infectious viruses. Because of the lack of non-interactive protein pairs and serious imbalance between positive and negative sample ratios, the supervised learning algorithm is not suitable for prediction. At the same time, due to the lack of information on viral proteins and significant dissimilarity in sequence, some ensemble learning models have poor generalization ability. In this paper, we propose a Sequence-Based Ensemble Learning (Seq-BEL) method to predict the potential virus-human PPIs. Specifically, based on the amino acid sequence of proteins and the currently known virus-human PPI network, Seq-BEL calculates various features and similarities of human proteins and viral proteins, and then combines these similarities and features to score the potential of virus-human PPIs. The computational results show that Seq-BEL achieves success in predicting potential virus-human PPIs and outperforms other state-of-the-art methods. More importantly, Seq-BEL also has good predictive performance for new human proteins and new viral proteins. In addition, the model has the advantages of strong robustness and good generalization ability, and can be used as an effective tool for virus-human PPI prediction.
作者机构：
[Guo, Yimin; Guo, YM] Zhongnan Univ Econ & Law, Sch Informat & Safety Engn, Wuhan, Peoples R China.;[Zhang, Zhenfeng] Chinese Acad Sci, Inst Software, Trusted Comp & Informat Assurance Lab, Beijing, Peoples R China.;[Guo, Yajun] Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.
通讯机构：
[Guo, YM ] Z;Zhongnan Univ Econ & Law, Sch Informat & Safety Engn, Wuhan, Peoples R China.
关键词：
Authentication;Fog computing;Lightweight;Security;Smart home
摘要：
Fog computing is the best solution for IoT applications with low latency and real-time interaction. Fog can endow smart home with many smart functions and services. One of the most important services is that users can remotely access and control smart devices. Since remote users and smart homes communicate through insecure channels, it is necessary to design a secure and effective remote authentication scheme to guarantee secure communications. The existing authentication schemes designed for smart homes have some security issues and are not suitable for fog-enabled smart home environments. Therefore, this paper designs a secure remote user authentication scheme, SecFHome. It supports secure communication at the edge of the network and remote authentication in fog-enabled smart home systems. Specifically, We present an efficient authentication mode in the fog-enabled environment, which includes the edge negotiation phase and the authentication phase. SecFHome adds updated information to the authenticator, which can verify the message synchronization simultaneously with the authentication, thus improving the authentication efficiency. In addition, SecFHome does not store sensitive information of users and smart devices in the memory of the smart gateway, which can avoid various attacks caused by the compromised gateway. The formal security proof and informal security analysis show that the SecFHome is secure and can resist known attacks. Compared with the related authentication schemes, SecFHome only needs fewer communication costs and computation costs, and achieves more security features.
摘要：
Over the past decades, Chemical-induced Disease (CID) relations have attracted extensive attention in biomedical community, reflecting wide applications in biomedical research and healthcare field. However, prior efforts fail to make full use of the interaction between local and global contexts in biomedical document, and the derived performance needs to be improved accordingly. In this paper, we propose a novel framework for document-level CID relation extraction. More specifically, a stacked Hypergraph Aggregation Neural Network (HANN) layers are introduced to model the complicated interaction between local and global contexts, based on which better contextualized representations are obtained for CID relation extraction. In addition, the CID Relation Heterogeneous Graph is constructed to capture the information with different granularities and improve further the performance of CID relation classification. Experiments on a real-world dataset demonstrate the effectiveness of the proposed framework.
作者机构：
[Wu, Libing; Cao, Shuqin] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Peoples R China.;[Wu, Libing; Cao, Shuqin] Guangdong Lab Artificial Intelligence & Digital Ec, Wuhan 518132, Peoples R China.;[Chen, Yanjiao] Zhejiang Univ, Coll Elect Engn, Hangzhou 310007, Peoples R China.;[Li, Jianxin] Deakin Univ, Sch Informat Technol, Burwood, Vic 3217, Australia.;[Cui, Jianqun; Chang, Yanan] Cent China Normal Univ, Sch Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Wu, L.] S;[Chen, Y.] C;School of Computer Science, Wuhan University, Wuhan, 430072, China<&wdkj&>Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ), Wuhan, 518132, China
摘要：
A mobility model is a basis of constructing the simulation environment for vehicular ad hoc network (VANET) research. Most existing models mainly focus on the geographical movement of individual mobile communication devices. However, few works focus on the cooperative movement of multiple autonomous vehicles. In this paper, we propose a cooperative mobility model for multiple autonomous vehicles, making vehicles run as a swarm in an orderly manner. Specifically, inspired by artificial fish swarm algorithms, we draw on the cooperative behaviors of the fish swarm to model the collaboration and self-organization in multi-vehicle formation. Then we design several force functions to express the interactions between vehicles and the influence of the driving environment based on the artificial potential field. Under Newtonian dynamics, the proposed mobility model determines the coordinated movement of multiple autonomous vehicles by force functions. Furthermore, we introduce a parallel orientation area in the interaction area division to improve vehicle stability. Following existing works, we assume that the road is straight and of infinite length. This is, the considered environment is suitable for intersection-free double-lane roads. To comprehensively verify the effectiveness of our proposed approach, we conduct extensive simulations under different traffic scenarios. Simulation results confirm that using our mobility model, multiple vehicles are able to keep driving in the center of the lane at the allowed speed limit, form an ordered collision-free motorcade, and collaboratively avoid collisions with obstacles. Particularly, our proposed mobility model has better stability.
期刊：
Wireless Communications and Mobile Computing,2022年2022 ISSN：1530-8669
通讯作者：
Cui, J.
作者机构：
[Wu, Jike; Cui, Jianqun; Zhang, Ruijie; Chang, Yanan; Wan, Qiyun] Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.;[Zhou, Hao] Wuhan Polytech Univ, Network & Informatizat Ctr, Wuhan, Peoples R China.
通讯机构：
[Yanan Chang; Qiyun Wan; Jike Wu; Jianqun Cui; Ruijie Zhang] S;[Hao Zhou] N;School of Computer,Central China Normal University,Wuhan,China<&wdkj&>Network and Informatization Center,Wuhan Polytechnic University,Wuhan,China
关键词：
Introduction;Materials and Methods;Results;Discussion;Conclusion;Abstract;Data Availability;Additional Points;Ethical Approval;Consent;Disclosure;Conflicts of Interests;Authors’ Contributions;Funding Statement;Acknowledgements;Acknowledgments;Supplementary Materials;Reference;Dataset Description;Dataset Files;Abstract;Introduction;Introduction and Materials;Introduction and Methods;Materials;Materials and Methods;Methods;Results;Discussion;Results and Discussion;Discussion and Conclusion;Results and Conclusion;Conclusion;Conclusions;Data Availability;Additional Points;Ethical Approval;Consent;Disclosure;Conflicts of Interest;Authors’ Contributions;Funding Statement;Acknowledgements;Supplementary Materials;References;Appendix;Abbreviations;Preliminaries;Introduction and Preliminaries;Notation;Proof of Theorem;Proofs;Analysis of Results;Examples;Numerical Example;Applications;Numerical Simulation;Model;Model Formulation;Systematic Palaeontology;Nomenclatural Acts;Taxonomic Implications;Experimental;Synthesis;Overview;Characterization;Background;Experimental;Theories;Calculations;Model Verification;Model Implementation;Geographic location;Study Area;Geological setting;Data Collection;Field Testing;Data and Sampling;Dataset;Literature Review;Related Works;Related Work;System Model;Methods and Data;Experimental Results;Results and Analysis;Evaluation;Implementation;Case Presentation;Case Report;Search Terms;Case Description;Case Series;Background;Limitations;Additional Points;Case;Case 1;Case 2 etc.;Concern Details;Retraction Details;Copyright;Related Articles
摘要：
How to select proper relay nodes to ensure the successful delivery of messages is still a hot topic in delay tolerant networks (DTN). In this paper, we propose a probabilistic Spray-and-Wait routing algorithm based on node interest preference (called NIP-PSW). Firstly, considering the influence of the social attributes of nodes, we define a metric called node interest preference (NIP) to measure the probability of nodes becoming friends. Secondly, in view of the influence of node quality and connection time between nodes on message forwarding, we define the delivery probability (DP). Finally, according to the historical information of nodes, the node interest similarity (NIS) is proposed. In spray phase, NIP and DP are used to select the relay node and allocate the number of message copies adaptively. In wait phase, it is judged whether to forward the message to the encountering nodes again according to the NIS and the DP. In addition, the concept of message storage value (MSV) and the acknowledgment (ACK) mechanism are introduced to manage the buffer of nodes. The simulation results show that the NIP-PSW not only can significantly improve the delivery rate and reduce the average delay but also shows good performance in network overhead and average number of hops.
作者机构：
[Tao, Shiming; Yang, Fei; Zhang, Huyin] Wuhan Univ, Sch Comp Sci, Wuhan, Peoples R China.;[Zhang, Huyin] Minist Nat Resources, Key Lab Urban Land Resources Monitoring & Simulat, Shenzhen, Peoples R China.;[Hao, Sheng] Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.
通讯机构：
[Huyin Zhang] S;School of Computer Science, Wuhan University, Wuhan, China<&wdkj&>Key Laboratory of Urban Land Resources Monitoring and Simulation, Ministry of Natural Resources, Shenzhen, China
作者机构：
[Zeng, Peng] Hunan Inst Land & Resources Planning, Changsha 410007, Peoples R China.;[Zhou, Dongbo; Lin, Shixuan] Cent China Normal Univ, Fac Artificial Intelligence Educ, Wuhan 430079, Peoples R China.;[Sun, Hao] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.
通讯机构：
[Shixuan Lin] F;Faculty of Artificial Intelligence in Education, Central China Normal University, Wuhan 430079, China<&wdkj&>Author to whom correspondence should be addressed.
摘要：
Today, cloud storage services increased the popular for data storage in the cloud and retrieve from any location without any time limitations. One of the most important demands required in cloud is secured data transmission in un-trusted cloud applications. Particularly, secure and efficient multiparty communications in Untrusted Cloud Environments (UCE) attract widespread attentions. The equipment used in UCE have the particularity of being heterogeneous and UCE communication environment are asynchronous networks in which multiple users cannot transmit their messages simultaneously. How to ensure secure communication between these heterogeneous intelligent devices is a major challenge for multiparty communication applied in UCE. In such an asynchronous environment, the asynchronous transmission can cause security problems in cryptographic functions. Therefore, how to implement rational secret sharing (RSS) in an asynchronous model of the UCE networks has become a burning research topic. The RSS refers to finding a solution composed of strategies to encourage players in the secret reconstruction to act honestly even players are rational to act for their own interest. If each player plays the game for the best response to the best response of other players, the game is in Nash equilibrium. The objective of an RSS is to achieve the Nash equilibrium state corresponding to the global optima. In this paper, we propose an information-theoretic secure RSS in asynchronous model for UCE. Our design uses Petersen's VSS to allow every player to divide his share into multiple pieces for other players. Then, shares can be revealed asynchronously. If any player acts maliciously, his share can be recovered by other players. This feature can encourage players to act honestly since any malicious action (i.e., either revealing a fake share or refusing to release one) is useless. Our scheme is practically valuable for secure group-oriented applications in UCE.
摘要：
Context: Modern software systems (e.g., Apache Spark) are usually written in multiple programming languages (PLs). There is little understanding on the phenomenon of multi-programming-language commits (MPLCs), which involve modified source files written in multiple PLs.Objective: This work aims to explore MPLCs and their impacts on development difficulty and software quality.Methods: We performed an empirical study on eighteen non-trivial Apache projects with 197,566 commits.Results : (1) the most commonly used PL combination consists of all the four PLs, i.e., C/C++, Java, JavaScript, and Python; (2) 9% of the commits from all the projects are MPLCs, and the proportion of MPLCs in 83% of the projects goes to a relatively stable level; (3) more than 90% of the MPLCs from all the projects involve source files in two PLs; (4) the change complexity of MPLCs is significantly higher than that of non-MPLCs; (5) issues fixed in MPLCs take significantly longer to be resolved than issues fixed in non-MPLCs in 89% of the projects; (6) MPLCs do not show significant effects on issue reopen; (7) source files undergoing MPLCs tend to be more bug-prone; and (8) MPLCs introduce more bugs than non-MPLCs.Conclusions: MPLCs are related to increased development difficulty and decreased software quality.(c) 2022 Elsevier Inc. All rights reserved.
摘要：
Knowledge graph representation learning (KGRL) aims to infer the missing links between target entities based on existing triples. Graph neural networks (GNNs) have been introduced recently as one of the latest trendy architectures serves KGRL task using aggregations of neighborhood information. However, current GNN-based methods have fundamental limitations in both modelling the multi-hop distant neighbors and selecting relation-specific neighborhood information from vast neighbors. In this study, we propose a new relation-specific graph transformation network (RGTN) for the KGRL task. Specifically, the proposed RGTN is the first pioneer model that transforms a relation-based graph into a new path-based graph by generating useful paths that connect heterogeneous relations and multi-hop neighbors. Unlike the existing GNN-based methods, our approach is able to adaptively select the most useful paths for each specific relation and to effectively build path-based connections between unconnected distant entities. The transformed new graph structure opens a new way to model the arbitrary lengths of multi-hop neighbors which leads to more effective embedding learning. In order to verify the effectiveness of our proposed model, we conduct extensive experiments on three standard benchmark datasets, e.g., WN18RR, FB15k-237 and YAGO-10-DR. Experimental results show that the proposed RGTN achieves the promising results and even outperforms other state-of-the-art models on the KGRL task (e.g., compared to other state-of-the-art GNN-based methods, our model achieves 2.5% improvement using H@10 on WN18RR, 1.2% improvement using H@10 on FB15k-237 and 6% improvement using H@10 on YAGO3-10-DR).
期刊：
Journal of King Saud University - Computer and Information Sciences,2022年34(8):5388-5404 ISSN：1319-1578
通讯作者：
Sheng Hao
作者机构：
[Hao, Sheng] Cent China Normal Univ CCNU, Sch Comp Sci, Wuhan, Peoples R China.;[Hao, Sheng; Zhang, Huyin] Wuhan Univ WHU, Sch Comp Sci, Wuhan, Peoples R China.;[Hao, Sheng] CCNU, Natl Language Resources Monitoring & Res Ctr Netwo, Wuhan, Peoples R China.
通讯机构：
[Sheng Hao] S;School of Computer Science, Central China Normal University (CCNU), PR China<&wdkj&>School of Computer Science, Wuhan University (WHU), PR China<&wdkj&>National Language Resources Monitoring and Research Center for Network Media, CCNU, PR China
摘要：
Reconfigurable intelligent surface (RIS) is one of the most promising technologies for constructing sixthgeneration (6G) wireless networks. It has the capability of controlling the electromagnetic response, thereby improving the communication performance. Current studies about physical (PHY) layer analysis of RIS assisted WLC systems neglect the influence of retransmission protocols. Furthermore, the impacts of traffic rate and limited transit buffer on packet transmission and energy consumption are not considered for RIS assisted WLC systems. Focusing on the above problems, we put forward an insightful model to analyze the PHY layer performance of RIS assisted WLC systems using retransmission protocols. In the modeling process, we firstly provide an E2E (end to end) transmission model for the RIS assisted WLC system. The influence of typical retransmission protocols, containing ARQ (automatic repeat request) and hybrid ARQ (HARQ), channel fading types, frame duration on data transmission are comprehensively taken into consideration. Then, we establish an accurate energy consumption model through analyzing the queueing state of the transmitter with finite buffer size and traffic rate. Based on the above two models, we derive the closed-form expressions of PHY layer metrics for RIS assisted WLC systems considering the impact of retransmission protocols. In addition, we also analyze the bound performance of coverage range and expected power efficiency of RIS assisted WLC system with retransmission protocols. Finally, we evaluate the performance of RIS assisted WLC systems under different retransmission protocols and system parameters, and verify the proposed theoretical model.(c) 2022 The Author(s). Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
作者机构：
[Harn, Lein] Univ Missouri, Dept Comp Sci Elect Engn, Kansas City, MO 64110 USA.;[Hsu, Chingfang] Cent China Normal Univ, Comp Sch, Wuhan 430079, Peoples R China.;[Xia, Zhe] Wuhan Univ Technol, Dept Comp Sci, Wuhan 430071, Peoples R China.
通讯机构：
[Hsu, CF ] C;Cent China Normal Univ, Comp Sch, Wuhan 430079, Peoples R China.
关键词：
Group key distribution;IoV;Internet of things;Lightweight;Pairwise keys;Secure communications
摘要：
It is predicted that the trend of Internet of Vehicles (IoV) applications will keep on growing due to its flexibility in infrastructure. The security of IoV can protect the peer-to-peer (P2P) data transmitted over Internet. Since most Internet devices are components with low battery power, low communication and computational power, the key distribution scheme for IoV needs to be lightweight. Most conventional communications in Internet of Vehicles are one-to-one types of communications which involve only two communication entities. Proposals for key distribution schemes are mostly developed to establish a pairwise key for a pair of users. For example, Diffie-Hellman public-key distribution scheme proposed in 1976 and the quantum key distribution scheme (QKD) invented in 1984 (also called the BB84 scheme), can only enable two users to share a secret key used in conventional one-to-one communications. Modern communications have been evolved into many-to-many types of communications which involve more than two users. Group-key distributions enable multiple users to share a group key. Recently, a lightweight group-key distribution scheme has been proposed which needs only logic operations. But this scheme can only provide confidentiality of the group key. In this paper, we extend that scheme to propose the first lightweight authenticated group-key distribution scheme which needs only logic operations. Our proposed schemes can be built on top of any type of authenticated pairwise-key distribution schemes. We first propose a basic three-party authenticated group-key distribution scheme. Then, general three multiple-party authenticated group-key distribution schemes based on the basic scheme are proposed. Since our proposed schemes need only logic operations, they are all lightweight and are suitable for P2P IoV communication applications. (C) 2022 Elsevier Inc. All rights reserved.
期刊：
ACM Transactions on Asian and Low-Resource Language Information Processing,2022年21(2):1–14 ISSN：2375-4699
通讯作者：
Yang, HT
作者机构：
[Yang, Haitong; Zhou, Guangyou; Yang, HT; He, Tingting] Cent China Normal Univ, Hubei Prov Key Lab Artificial Intelligence & Smar, Wuhan, Peoples R China.;[Yang, Haitong; Zhou, Guangyou; Yang, HT; He, Tingting] Cent China Normal Univ, Natl Language Resources Monitoring, Wuhan, Peoples R China.;[Yang, Haitong; Zhou, Guangyou; Yang, HT; He, Tingting] Cent China Normal Univ, Res Ctr Network Media, Wuhan, Peoples R China.;[Yang, Haitong; Zhou, Guangyou; Yang, HT; He, Tingting] Cent China Normal Univ, Sch Comp, Luo Yu Rd, Wuhan, Hubei, Peoples R China.
通讯机构：
[Yang, HT ] C;Cent China Normal Univ, Hubei Prov Key Lab Artificial Intelligence & Smar, Wuhan, Peoples R China.;Cent China Normal Univ, Natl Language Resources Monitoring, Wuhan, Peoples R China.;Cent China Normal Univ, Res Ctr Network Media, Wuhan, Peoples R China.;Cent China Normal Univ, Sch Comp, Luo Yu Rd, Wuhan, Hubei, Peoples R China.
作者：
Xie, Zhiwen;Zhu, Runjie;Liu, Jin;Zhou, Guangyou;Huang, Jimmy Xiangji;...
期刊：
Information Sciences,2022年608:1557-1571 ISSN：0020-0255
通讯作者：
Liu, J.
作者机构：
[Liu, Jin; Xie, Zhiwen] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Peoples R China.;[Zhu, Runjie] York Univ, Lassonde Sch Engn, Toronto, ON, Canada.;[Zhou, Guangyou] Cent China Normal Univ, Sch Comp Sci, Wuhan 430079, Peoples R China.;[Huang, Jimmy Xiangji] York Univ, Sch Informat Technol, Toronto, ON, Canada.;[Cui, Xiaohui] Wuhan Univ, Sch Cyber Sci & Engn, Wuhan 430072, Peoples R China.
通讯机构：
[Liu, J.] S;School of Computer Science, China
关键词：
COVID-19;Knowledge Graph;Natural Language Processing;Text Mining
摘要：
In response to fighting COVID-19 pandemic, researchers in machine learning and artificial intelligence have constructed some medical knowledge graphs (KG) based on existing COVID-19 datasets, however, these KGs contain a considerable amount of semantic rela-tions which are incomplete or missing. In this paper, we focus on the task of knowledge graph embedding (KGE), which serves an important solution to infer the missing relations. In the past, there have been a collection of knowledge graph embedding models with dif-ferent scoring functions to learn entity and relation embeddings published. However, these models share the same problems of rarely taking important features of KG like attribute features, other than relation triples, into account, while dealing with the heterogeneous, complex and incomplete COVID-19 medical data. To address the above issue, we propose a graph feature collection network (GFCNet) for COVID-19 KGE task, which considers both neighbor and attribute features in KGs. The extensive experiments conducted on the COVID-19 drug KG dataset show promising results and prove the effectiveness and effi-ciency of our proposed model. In addition, we also explain the future directions of deepen-ing the study on COVID-19 KGE task.(c) 2022 Elsevier Inc. All rights reserved.
期刊：
BRIEFINGS IN BIOINFORMATICS,2022年23(5) ISSN：1467-5463
通讯作者：
Jiang, XP
作者机构：
[Tan, Yuting; Sun, Han] Cent China Normal Univ, Sch Math & Stat, Wuhan, Peoples R China.;[Jiang, Xingpeng; Huo, Ban; He, Tingting] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.;[Huang, Xiaoyun] Cent China Normal Univ, Collaborat & Innovat Ctr Educ Technol, Wuhan, Peoples R China.;[Jiang, Xingpeng] Hubei Prov Key Lab Artificial Intelligence & Smar, Wuhan, Peoples R China.
通讯机构：
[Jiang, XP ] C;Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.
关键词：
microbiome-based association test;longitudinal microbiome data;generalized estimating equations;sparse microbial association signals;higher criticism
摘要：
The association between the compositions of microbial communities and various host phenotypes is an important research topic. Microbiome association research addresses multiple domains, such as human disease and diet. Statistical methods for testing microbiome–phenotype associations have been studied recently to determine their ability to assess longitudinal microbiome data. However, existing methods fail to detect sparse association signals in longitudinal microbiome data. In this paper, we developed a novel method, namely aGEEMIHC, which is a data-driven adaptive microbiome higher criticism analysis based on generalized estimating equations to detect sparse microbial association signals from longitudinal microbiome data. aGEEMiHC adopts generalized estimating equations framework that fully considers the correlation among different observations from the same subject in longitudinal data. To be robust to diverse correlation structures for longitudinal data, aGEEMiHC integrates multiple microbiome higher criticism analyses based on generalized estimating equations with different working correlation structures. Extensive simulation experiments demonstrate that aGEEMiHC can control the type I error correctly and achieve superior performance according to a statistical power comparison. We also applied it to longitudinal microbiome data with various types of host phenotypes to demonstrate the stability of our method. aGEEMiHC is also utilized for real longitudinal microbiome data, and we found a significant association between the gut microbiome and Crohn’s disease. In addition, our method ranks the significant factors associated with the host phenotype to provide potential biomarkers.
关键词：
Protocols;Aggregates;Security;Lattices;Gaussian distribution;Sensors;Medical diagnostic imaging;Aggregate signature;identity-based crypto-system;lattice;quantum attacks;quantum random oracle model;wireless medical sensor network
摘要：
The aggregate signature is a special signature mode widely used in the wireless medical sensor network. The aggregate signature can reduce bandwidth and storage space in this sensor network by aggregating multiple signatures from different signers into a short signature. Traditional aggregate signature protocols based on the discrete logarithm problem and the great integer factorization problem cannot resist quantum attacks. In this article, we propose a new noninteractive identity-based aggregate signature protocol from lattices. We prove that the proposed protocol is secure in the quantum random oracle model. Additionally, the performance of the proposed protocol is much better than most previous protocols according to our experiment. Meanwhile, the size of the aggregate signature in our protocol is a logarithmic function of the number of signatures being aggregated.
