Zhitao Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zhitao Li has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Weihua Gui
Central South University
2 shared publications - Yuqian Guo
School of Automation, Central South University, Changsha, China
2 shared publications - Fang Liu
School of Transportation Engineering, Changsha University of Science and Technology, Changsha 410205, China
1 shared publication - Han Fei Huang
Center for Biological Science and Technology, Advanced Institute of Natural Sciences, Beijing Normal University , Zhuhai, Guangdong 519087 , China
1 shared publication - Jianqing Zhang
Department of POPs Lab, Shenzhen Center for Disease Control and Prevention, Shenzhen 518055, China
1 shared publication - Jin Li
School of Life Sciences, Fudan University
1 shared publication
Latest Publications
- 26 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (4) , 2769-2776
Asymptotical Controllability of Continuous-Time Probabilistic Logic Control Systems
Herein, we investigate the asymptotical controllability of continuous-time probabilistic logic control systems (CT-PLCSs) under piecewise constant and right continuous controls (PCRCCs). The theory of an invariant subset for a CT-PLCS controlled by a PCRCC is developed. Based on this theory, we prove that a state is asymptotically reachable from another state under a PCRCC if and only if it is asymptotically reachable under a simple periodic PCRCC; in other words, the control efforts are pairwise distinct within one period. Thereafter, a verifiable, necessary and sufficient condition for the asymptotical reachability between states is obtained, based on which verifiable, necessary and sufficient conditions for the asymptotical reachability and asymptotical controllability are derived. In particular, we prove that a CT-PLCS is asymptotically controllable if and only if each state can be asymptotically stabilized by PCRCCs. Additionally, the proof of the proposed results is constructive, which naturally leads to the development of methods of designing PCRCCs. Lastly, examples are provided to illustrate the theoretical results.
- 26 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (4) , 2769-2776
Asymptotical Controllability of Continuous-Time Probabilistic Logic Control Systems
Herein, we investigate the asymptotical controllability of continuous-time probabilistic logic control systems (CT-PLCSs) under piecewise constant and right continuous controls (PCRCCs). The theory of an invariant subset for a CT-PLCS controlled by a PCRCC is developed. Based on this theory, we prove that a state is asymptotically reachable from another state under a PCRCC if and only if it is asymptotically reachable under a simple periodic PCRCC; in other words, the control efforts are pairwise distinct within one period. Thereafter, a verifiable, necessary and sufficient condition for the asymptotical reachability between states is obtained, based on which verifiable, necessary and sufficient conditions for the asymptotical reachability and asymptotical controllability are derived. In particular, we prove that a CT-PLCS is asymptotically controllable if and only if each state can be asymptotically stabilized by PCRCCs. Additionally, the proof of the proposed results is constructive, which naturally leads to the development of methods of designing PCRCCs. Lastly, examples are provided to illustrate the theoretical results.
- 20 January 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 593, 126925
Reposition optimization in free-floating bike-sharing system: A case study in Shenzhen City
- 20 January 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 593, 126925
Reposition optimization in free-floating bike-sharing system: A case study in Shenzhen City
- 2 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (1) , 279-291
Asymptotical Stability and Stabilization of Continuous-Time Probabilistic Logic Networks
Discrete-time probabilistic logic networks (DT-PLNs), of which probabilistic Boolean networks (PBNs) are a special type, are an important qualitative model for gene regulatory networks (GRNs). Although a DT-PLN can predict the long-term behavior of a GRN, using it to describe the transient kinetics at the microtimescale level remains inconvenient. In this article, we investigate the problems associated with the stability and stabilization of continuous-time probabilistic logic networks (CT-PLNs). First, we demonstrate that the concept of finite-time stability for DT-PLNs cannot be extended to CT-PLNs owing to the nonsingularity of transitional probability matrices. Thus, we introduce the concept of asymptotical stability, which is defined as the convergence in distribution of the network state. Second, by developing the theory of invariant subsets for CT-PLNs, a necessary and sufficient condition for asymptotical stability with respect to a subset is proposed, which is expressed in terms of the transition rate matrix of probability. Third, for a CT-PLN with input nodes, termed a continuous-time probabilistic logic control network, we discuss the subsets that are invariant under piece-wise constant input. Based thereupon, we propose a necessary and sufficient condition under which asymptotically stabilizing sampled-data feedback exists. A method for designing sampled-data feedback is proposed. Last, Monte Carlo simulation algorithms are proposed to efficiently simulate a CT-PLN in the time domain. Examples are provided to demonstrate the methods proposed in this article.
- 2 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (1) , 279-291
Asymptotical Stability and Stabilization of Continuous-Time Probabilistic Logic Networks
Discrete-time probabilistic logic networks (DT-PLNs), of which probabilistic Boolean networks (PBNs) are a special type, are an important qualitative model for gene regulatory networks (GRNs). Although a DT-PLN can predict the long-term behavior of a GRN, using it to describe the transient kinetics at the microtimescale level remains inconvenient. In this article, we investigate the problems associated with the stability and stabilization of continuous-time probabilistic logic networks (CT-PLNs). First, we demonstrate that the concept of finite-time stability for DT-PLNs cannot be extended to CT-PLNs owing to the nonsingularity of transitional probability matrices. Thus, we introduce the concept of asymptotical stability, which is defined as the convergence in distribution of the network state. Second, by developing the theory of invariant subsets for CT-PLNs, a necessary and sufficient condition for asymptotical stability with respect to a subset is proposed, which is expressed in terms of the transition rate matrix of probability. Third, for a CT-PLN with input nodes, termed a continuous-time probabilistic logic control network, we discuss the subsets that are invariant under piece-wise constant input. Based thereupon, we propose a necessary and sufficient condition under which asymptotically stabilizing sampled-data feedback exists. A method for designing sampled-data feedback is proposed. Last, Monte Carlo simulation algorithms are proposed to efficiently simulate a CT-PLN in the time domain. Examples are provided to demonstrate the methods proposed in this article.
- Open Access
- 15 December 2020
- Published by Brieflands in Jundishapur Journal of Microbiology
- Vol. 13 (10)
Evaluation of High-Throughput Next-Generation Sequencing Applied in the Pathogenic Diagnosis of Bloodstream Infections
Background: Bloodstream infection (BSI) has been one of the biggest headaches for clinicians, as it not only aggravates symptoms but also increases the length of stay, the cost of hospitalization, and the side effects caused by antibiotics. It is an urgent need for clinicians to develop timely and accurate methods to find microorganisms. Currently, the gold standard for diagnosing BSI is blood culture, but it takes three to eight days to produce results, and its positive rate is extremely low. Next-generation sequencing (NGS) has emerged as a better technology desperately needed by doctors and patients to diagnose BSI. Objectives: This study compared NGS and blood culture methods in clinical patients with BSI. Methods: In this study, blood culture and NGS were used to analyze the blood of patients with BSI in different departments of the First Affiliated Hospital of Kunming Medical University. Results: Next-generation sequencing detected 60 pathogens in 63 blood samples, while blood culture detected 15 pathogens in 336 blood samples from 63 patients who were clinically considered to be infected. Pathogens detected by NGS included bacteria, fungi, and viruses, while blood culture only found bacteria and fungi. The positive rates of blood culture diagnosis and NGS diagnosis in BSI patients were 23.8% (15/63) (CI: 13.3% - 34.3%) and 95% (60/63) (CI: 90% - 100%), respectively. Conclusions: Our results showed that NGS creates a new diagnostic platform for patients with BSI. Its wide detection range, high positive rate, and characteristics of rapid detection will benefit patients with BSI.
- 15 December 2020
- Published by Brieflands in Jundishapur Journal of Microbiology
- Vol. 13 (10)
Open AccessEvaluation of High-Throughput Next-Generation Sequencing Applied in the Pathogenic Diagnosis of Bloodstream Infections
Background: Bloodstream infection (BSI) has been one of the biggest headaches for clinicians, as it not only aggravates symptoms but also increases the length of stay, the cost of hospitalization, and the side effects caused by antibiotics. It is an urgent need for clinicians to develop timely and accurate methods to find microorganisms. Currently, the gold standard for diagnosing BSI is blood culture, but it takes three to eight days to produce results, and its positive rate is extremely low. Next-generation sequencing (NGS) has emerged as a better technology desperately needed by doctors and patients to diagnose BSI. Objectives: This study compared NGS and blood culture methods in clinical patients with BSI. Methods: In this study, blood culture and NGS were used to analyze the blood of patients with BSI in different departments of the First Affiliated Hospital of Kunming Medical University. Results: Next-generation sequencing detected 60 pathogens in 63 blood samples, while blood culture detected 15 pathogens in 336 blood samples from 63 patients who were clinically considered to be infected. Pathogens detected by NGS included bacteria, fungi, and viruses, while blood culture only found bacteria and fungi. The positive rates of blood culture diagnosis and NGS diagnosis in BSI patients were 23.8% (15/63) (CI: 13.3% - 34.3%) and 95% (60/63) (CI: 90% - 100%), respectively. Conclusions: Our results showed that NGS creates a new diagnostic platform for patients with BSI. Its wide detection range, high positive rate, and characteristics of rapid detection will benefit patients with BSI.
- Open Access
- 2 April 2003
- Published by Wiley in ChemInform
- Vol. 34 (16)
Total Syntheses of Demethylasterriquinone B1, an Orally Active Insulin Mimetic, and Demethylasterriquinone A1.
For Abstract see ChemInform Abstract in Full Text.
- 2 April 2003
- Published by Wiley in ChemInform
- Vol. 34 (16)
Open AccessTotal Syntheses of Demethylasterriquinone B1, an Orally Active Insulin Mimetic, and Demethylasterriquinone A1.
For Abstract see ChemInform Abstract in Full Text.