Yongjun Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yongjun Li has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Pei Chen
School of Mathematics, South China University of Technology , Guangzhou 510640
3 shared publications - James Z. Wang
School of Computing, Clemson University, Clemson, SC 29634, USA
2 shared publications - Luonan Chen
School of Mathematical Sciences and School of AI, Shanghai Jiao Tong University, Shanghai, China
2 shared publications - Rui Liu
School of Mathematics, South China University of Technology , Guangzhou 510640
2 shared publications - Deyu Qi
School of Computer Engineering and Science, South China Univ. of Tech., Guangzhou Guangdong, 510640, China
1 shared publication - Deyu Qi
School of Computer Science & Engineering, South China University of Technology, Guangzhou, China 510640. Tel: +86-20-87110840
1 shared publication
Latest Publications
- 1 April 2019
- Published by Springer Nature in Applied Intelligence
- Vol. 49 (9) , 3283-3292
Enhancing sentence embedding with dynamic interaction
- 1 April 2019
- Published by Springer Nature in Applied Intelligence
- Vol. 49 (9) , 3283-3292
Enhancing sentence embedding with dynamic interaction
- Open Access
- 26 October 2017
- Published by Springer Nature in Journal of Translational Medicine
- Vol. 15 (1) , 1-15
Detecting the tipping points in a three-state model of complex diseases by temporal differential networks
The progression of complex diseases, such as diabetes and cancer, is generally a nonlinear process with three stages, i.e., normal state, pre-disease state, and disease state, where the pre-disease state is a critical state or tipping point immediately preceding the disease state. Traditional biomarkers aim to identify a disease state by exploiting the information of differential expressions for the observed molecules, but may fail to detect a pre-disease state because there are generally little significant differences between the normal and pre-disease states. Thus, it is challenging to signal the pre-disease state, which actually implies the disease prediction. In this work, by exploiting the information of differential associations among the observed molecules between the normal and pre-disease states, we propose a temporal differential network based computational method to accurately signal the pre-disease state or predict the occurrence of severe disease. The theoretical foundation of this work is the quantification of the critical state using dynamical network biomarkers. Considering that there is one stationary Markov process before reaching the tipping point, a novel index, inconsistency score (I-score), is proposed to quantitatively measure the change of the stationary processes from the normal state so as to detect the onset of pre-disease state. In other words, a drastic increase of I-score implies the high inconsistency with the preceding stable state and thus signals the upcoming critical transition. This approach is applied to the simulated and real datasets of three diseases, which demonstrates the effectiveness of our method for predicting the deterioration into disease states. Both functional analysis and pathway enrichment also validate the computational results from the perspectives of both molecules and networks. At the molecular network level, this method provides a computational way of unravelling the underlying mechanism of the dynamical progression when a biological system is near the tipping point, and thus detecting the early-warning signal of the imminent critical transition, which may help to achieve timely intervention. Moreover, the rewiring of differential networks effectively extracts discriminatively interpretable features, and systematically demonstrates the dynamical change of a biological system.
- 26 October 2017
- Published by Springer Nature in Journal of Translational Medicine
- Vol. 15 (1) , 1-15
Open AccessDetecting the tipping points in a three-state model of complex diseases by temporal differential networks
The progression of complex diseases, such as diabetes and cancer, is generally a nonlinear process with three stages, i.e., normal state, pre-disease state, and disease state, where the pre-disease state is a critical state or tipping point immediately preceding the disease state. Traditional biomarkers aim to identify a disease state by exploiting the information of differential expressions for the observed molecules, but may fail to detect a pre-disease state because there are generally little significant differences between the normal and pre-disease states. Thus, it is challenging to signal the pre-disease state, which actually implies the disease prediction. In this work, by exploiting the information of differential associations among the observed molecules between the normal and pre-disease states, we propose a temporal differential network based computational method to accurately signal the pre-disease state or predict the occurrence of severe disease. The theoretical foundation of this work is the quantification of the critical state using dynamical network biomarkers. Considering that there is one stationary Markov process before reaching the tipping point, a novel index, inconsistency score (I-score), is proposed to quantitatively measure the change of the stationary processes from the normal state so as to detect the onset of pre-disease state. In other words, a drastic increase of I-score implies the high inconsistency with the preceding stable state and thus signals the upcoming critical transition. This approach is applied to the simulated and real datasets of three diseases, which demonstrates the effectiveness of our method for predicting the deterioration into disease states. Both functional analysis and pathway enrichment also validate the computational results from the perspectives of both molecules and networks. At the molecular network level, this method provides a computational way of unravelling the underlying mechanism of the dynamical progression when a biological system is near the tipping point, and thus detecting the early-warning signal of the imminent critical transition, which may help to achieve timely intervention. Moreover, the rewiring of differential networks effectively extracts discriminatively interpretable features, and systematically demonstrates the dynamical change of a biological system.
- Open Access
- 1 August 2016
- Published by Springer Nature in BMC Systems Biology
- Vol. 10 (S2) , 139-150
The decrease of consistence probability: at the crossroad of catastrophic transition of a biological system
Unlike traditional detection of a disease state in which there are clear phenomena, it is usually a challenge to identify the pre-disease state during the progression of a complex disease just before the serious deterioration, not only because of the high complexity of the biological system, but there may be few clues and apparent changes appearing until the catastrophic critical transition occurs. In this work, by exploiting the different dynamical features between the normal and pre-disease states, we present a hidden-Markov-model (HMM) based computational method to identify the pre-disease state and elucidate the essential mechanisms during the critical transition at the network level. Specifically, by considering the network variation and regarding that the pre-disease state is the end or shift-point of a stationary Markov process, a consistence score is proposed to measure the probability that a system is in consistency with the normal state. As validation, this approach is applied to detect the upcoming critical transition of complex systems based on both the dataset generated from a simulated network and the rich information provided by high-throughput microarray data. The effectiveness of our method has been demonstrated by the identification of the pre-disease states for two real datasets including HCV-induced hepatocellular carcinoma and virus-induced influenza infection. From dynamical view point, the critical-transition phenomena in many biological processes are of some generic properties, which can be detected by the established method.
- 1 August 2016
- Published by Springer Nature in BMC Systems Biology
- Vol. 10 (S2) , 139-150
Open AccessThe decrease of consistence probability: at the crossroad of catastrophic transition of a biological system
Unlike traditional detection of a disease state in which there are clear phenomena, it is usually a challenge to identify the pre-disease state during the progression of a complex disease just before the serious deterioration, not only because of the high complexity of the biological system, but there may be few clues and apparent changes appearing until the catastrophic critical transition occurs. In this work, by exploiting the different dynamical features between the normal and pre-disease states, we present a hidden-Markov-model (HMM) based computational method to identify the pre-disease state and elucidate the essential mechanisms during the critical transition at the network level. Specifically, by considering the network variation and regarding that the pre-disease state is the end or shift-point of a stationary Markov process, a consistence score is proposed to measure the probability that a system is in consistency with the normal state. As validation, this approach is applied to detect the upcoming critical transition of complex systems based on both the dataset generated from a simulated network and the rich information provided by high-throughput microarray data. The effectiveness of our method has been demonstrated by the identification of the pre-disease states for two real datasets including HCV-induced hepatocellular carcinoma and virus-induced influenza infection. From dynamical view point, the critical-transition phenomena in many biological processes are of some generic properties, which can be detected by the established method.
- Open Access
- 19 March 2016
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 32 (14) , 2143-2150
Detecting critical state before phase transition of complex biological systems by hidden Markov model
Motivation: Identifying the critical state or pre-transition state just before the occurrence of a phase transition is a challenging task, because the state of the system may show little apparent change before this critical transition during the gradual parameter variations. Such dynamics of phase transition is generally composed of three stages, i.e. before-transition state, pre-transition state and after-transition state, which can be considered as three different Markov processes. Results: By exploring the rich dynamical information provided by high-throughput data, we present a novel computational method, i.e. hidden Markov model (HMM) based approach, to detect the switching point of the two Markov processes from the before-transition state (a stationary Markov process) to the pre-transition state (a time-varying Markov process), thereby identifying the pre-transition state or early-warning signals of the phase transition. To validate the effectiveness, we apply this method to detect the signals of the imminent phase transitions of complex systems based on the simulated datasets, and further identify the pre-transition states as well as their critical modules for three real datasets, i.e. the acute lung injury triggered by phosgene inhalation, MCF-7 human breast cancer caused by heregulin and HCV-induced dysplasia and hepatocellular carcinoma. Both functional and pathway enrichment analyses validate the computational results. Availability and implementation: The source code and some supporting files are available at https://github.com/rabbitpei/HMM_based-method. Contacts:lnchen@sibs.ac.cn or liyj@scut.edu.cn Supplementary information: Supplementary data are available at Bioinformatics online.
- 19 March 2016
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 32 (14) , 2143-2150
Open AccessDetecting critical state before phase transition of complex biological systems by hidden Markov model
Motivation: Identifying the critical state or pre-transition state just before the occurrence of a phase transition is a challenging task, because the state of the system may show little apparent change before this critical transition during the gradual parameter variations. Such dynamics of phase transition is generally composed of three stages, i.e. before-transition state, pre-transition state and after-transition state, which can be considered as three different Markov processes. Results: By exploring the rich dynamical information provided by high-throughput data, we present a novel computational method, i.e. hidden Markov model (HMM) based approach, to detect the switching point of the two Markov processes from the before-transition state (a stationary Markov process) to the pre-transition state (a time-varying Markov process), thereby identifying the pre-transition state or early-warning signals of the phase transition. To validate the effectiveness, we apply this method to detect the signals of the imminent phase transitions of complex systems based on the simulated datasets, and further identify the pre-transition states as well as their critical modules for three real datasets, i.e. the acute lung injury triggered by phosgene inhalation, MCF-7 human breast cancer caused by heregulin and HCV-induced dysplasia and hepatocellular carcinoma. Both functional and pathway enrichment analyses validate the computational results. Availability and implementation: The source code and some supporting files are available at https://github.com/rabbitpei/HMM_based-method. Contacts:lnchen@sibs.ac.cn or liyj@scut.edu.cn Supplementary information: Supplementary data are available at Bioinformatics online.
- 8 June 2007
- Published by Elsevier in Computer Communications
- Vol. 30 (8) , 1721-1730
Cost analysis and optimization for IP multicast group management
- 8 June 2007
- Published by Elsevier in Computer Communications
- Vol. 30 (8) , 1721-1730
Cost analysis and optimization for IP multicast group management
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19483449,p. 2282-2287
Adaptive Linkage: an Interface Level Adaptable Component Development Technique
Business requirements change consequentially causes software system business functions change and changing components which participate in performing the business functions, so flexible components can well adapt to the change of business functions. In order to solve component flexibility problem, this paper proposes an adaptable component development technique------adaptive linkage, which at interface level enables component to flexibly support business functions change. The proposed logical structure of adaptive component which owns multiple interfaces and multiple implementations, the introduced adaptive linkage descriptor provide the basis for adaptive linkage development technique, a formal model of adaptive linkage descriptor is addressed as a theory basis for its code autogeneration; then we implement this technique with XML and based on encapsulation and inheritance programming mechanisms in object oriented software development technology. At last, in the example system development process we adopt this technique to develop the components which participate in the performance of computing students required courses average score function to show how to use this technique, at the same time this also illustrates that developing adaptable component with this technique can effectively simplify developers' work when amending a component, and moreover, the amending of a component does not effect the performance of other business functions which don't hope the component to change and in whose performance the component participants.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19483449,p. 2282-2287
Adaptive Linkage: an Interface Level Adaptable Component Development Technique
Business requirements change consequentially causes software system business functions change and changing components which participate in performing the business functions, so flexible components can well adapt to the change of business functions. In order to solve component flexibility problem, this paper proposes an adaptable component development technique------adaptive linkage, which at interface level enables component to flexibly support business functions change. The proposed logical structure of adaptive component which owns multiple interfaces and multiple implementations, the introduced adaptive linkage descriptor provide the basis for adaptive linkage development technique, a formal model of adaptive linkage descriptor is addressed as a theory basis for its code autogeneration; then we implement this technique with XML and based on encapsulation and inheritance programming mechanisms in object oriented software development technology. At last, in the example system development process we adopt this technique to develop the components which participate in the performance of computing students required courses average score function to show how to use this technique, at the same time this also illustrates that developing adaptable component with this technique can effectively simplify developers' work when amending a component, and moreover, the amending of a component does not effect the performance of other business functions which don't hope the component to change and in whose performance the component participants.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Optimizing IP Multicast through Delayed Multicast Tree Pruning
This paper studies the system parameters that affect the total cost of managing the multicast group on a router. A Petri net model is first proposed to describe the states and transitions of the multicast group management. Based on this model, a delayed vacation queue, extended from a simple M/M/l queue, is used to analyze the total cost of the multicast group management under various system conditions. The formal analysis reveals that the total cost of the multicast group management is minimized when a router delays a certain time to send its pruning messages to upper stream routers. Furthermore, a formula is derived to calculate the optimal delay time for sending the pruning messages under various system parameters to minimize the multicast group management cost. Finally, cost analysis examples demonstrate how other system parameters, such as multicast member arrival rate and message sending costs, affect the total cost of the multicast group management under various delay times for sending the pruning messages.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Optimizing IP Multicast through Delayed Multicast Tree Pruning
This paper studies the system parameters that affect the total cost of managing the multicast group on a router. A Petri net model is first proposed to describe the states and transitions of the multicast group management. Based on this model, a delayed vacation queue, extended from a simple M/M/l queue, is used to analyze the total cost of the multicast group management under various system conditions. The formal analysis reveals that the total cost of the multicast group management is minimized when a router delays a certain time to send its pruning messages to upper stream routers. Furthermore, a formula is derived to calculate the optimal delay time for sending the pruning messages under various system parameters to minimize the multicast group management cost. Finally, cost analysis examples demonstrate how other system parameters, such as multicast member arrival rate and message sending costs, affect the total cost of the multicast group management under various delay times for sending the pruning messages.
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21619646,p. 1-4
A Discrete-Time Queue with Discrete Autoregressive Process of Order 1 Fluid in High-Speed Networks
In this paper, we consider a discrete-time queue with discrete autoregressive process of order 1 (DAR(I)) fluid in high-speed networks. Close-form expressions for the probability generating function and mean queue length are derived. Finally, some numerical results are given and it is shown that the system performance is quite sensitive to the correlation of the arrival process
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21619646,p. 1-4
A Discrete-Time Queue with Discrete Autoregressive Process of Order 1 Fluid in High-Speed Networks
In this paper, we consider a discrete-time queue with discrete autoregressive process of order 1 (DAR(I)) fluid in high-speed networks. Close-form expressions for the probability generating function and mean queue length are derived. Finally, some numerical results are given and it is shown that the system performance is quite sensitive to the correlation of the arrival process