Zhen 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
Zhen Li has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Kang-Li Xu
School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an 710049, China
3 shared publications Kang-Li Xu
Xi'an Jiaotong University
2 shared publicationsBin Wang
1 shared publicationGuang-Bo Du
China United Engineering Corporation, Hangzhou, China
1 shared publication- Hao Jin
College of Artificial Intelligence & Computer Science, Xi’an University of Science and Technology, Xi’an, China
1 shared publication - Huadong Liu
Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, Guangxi, China
1 shared publication
Latest Publications
- 19 August 2025
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 57 (7) , 1894-1907
Structure-preserving interpolation reduced-order modelling for efficient simulation of parametric port-Hamiltonian systems
- 19 August 2025
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 57 (7) , 1894-1907
Structure-preserving interpolation reduced-order modelling for efficient simulation of parametric port-Hamiltonian systems
- Open Access
- 11 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2565
Model Reduction in Parallelization Based on Equivalent Transformation of Block Bi-Diagonal Toeplitz Matrices for Two-Dimensional Discrete-Time Systems
This study proposes a parallel model reduction method for two-dimensional discrete-time systems, utilizing Krawtchouk moments and equivalent transformation. This work makes two significant contributions. First, we introduce a projection subspace that is independent of the input as well as of the Krawtchouk parameters, thus ensuring robustness. Second, we propose an efficient parallel algorithm for computing the basis of the projection subspace. With the difference relation of Krawtchouk polynomials and the analytic identity theorem, we obtain the explicit formula for the Krawtchouk moments of the state, which is input-dependent and Krawtchouk-parameter-dependent. We derive a projection subspace that is independent of both input and Krawtchouk parameter, such that it is equivalent to the subspace spanned by the Krawtchouk moments. Further, we propose a parallel strategy based on the equivalent transformation of the block bi-diagonal Toeplitz matrices with bi-diagonal blocks to compute the basis of the projection subspace, facilitating acceleration of the model reduction process on high-performance computers. Moreover, we analyze the Krawtchouk moment invariants of the proposed parallel method. Finally, the effectiveness of the proposed method is illustrated by two numerical examples.
- 11 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2565
Open AccessModel Reduction in Parallelization Based on Equivalent Transformation of Block Bi-Diagonal Toeplitz Matrices for Two-Dimensional Discrete-Time Systems
This study proposes a parallel model reduction method for two-dimensional discrete-time systems, utilizing Krawtchouk moments and equivalent transformation. This work makes two significant contributions. First, we introduce a projection subspace that is independent of the input as well as of the Krawtchouk parameters, thus ensuring robustness. Second, we propose an efficient parallel algorithm for computing the basis of the projection subspace. With the difference relation of Krawtchouk polynomials and the analytic identity theorem, we obtain the explicit formula for the Krawtchouk moments of the state, which is input-dependent and Krawtchouk-parameter-dependent. We derive a projection subspace that is independent of both input and Krawtchouk parameter, such that it is equivalent to the subspace spanned by the Krawtchouk moments. Further, we propose a parallel strategy based on the equivalent transformation of the block bi-diagonal Toeplitz matrices with bi-diagonal blocks to compute the basis of the projection subspace, facilitating acceleration of the model reduction process on high-performance computers. Moreover, we analyze the Krawtchouk moment invariants of the proposed parallel method. Finally, the effectiveness of the proposed method is illustrated by two numerical examples.
- 11 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 25867-25878
An Asymmetric Searchable Encryption Scheme Supporting Shortest Distance Query in Internet of Vehicles
With the advent of Internet technologies, the concept of conventional vehicular ad hoc network is gradually migrating into the Internet of Vehicles (IoV). Meanwhile, as a common data structure composed of vertices and edges, graph commonly used to represent road network typologies, are also outsourced to Internet servers for the convenience of people in IoV accessing the road network anytime and anywhere. However, it introduces much potential risks on people’s privacy as the Internet servers are often assumed semi-honest. As an essential component in IoV, privacy-preserving shortest distance query has been researched many years in the cryptographic community. Unfortunately, most of the solutions are designed under symmetric key setting and employ some off-the-shelf cryptographic primitives. They are impractical in the multiuser IoV environment due to an inherent weakness—key agreement required between each pair of a graph data provider and a user since the symmetric key encryption was born. Moreover, these off-the-shelf primitives ask multiple Internet servers or graph data providers to interact in the test process in order to assist one Internet server returning the shortest distance to users, both of which thereby raise a significant communication cost. To overcome these drawbacks, in this article, we propose an asymmetric searchable encryption scheme supporting shortest distance query, which is quite suitable for multiuser IoV environment since the key agreement is no longer required between each pair of a graph data provider and a user. In particular, we present a new cryptographic primitive instead of leveraging any ready-made one, that enables only one server in IoV to be required for returning the final query result—shortest distance to users without any interaction with others, thereby reducing the communication cost. Finally, a strict mathematical security proof is offered as well as some security attacks are analyzed, followed by an experimental evaluation and comparison.
- 11 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 25867-25878
An Asymmetric Searchable Encryption Scheme Supporting Shortest Distance Query in Internet of Vehicles
With the advent of Internet technologies, the concept of conventional vehicular ad hoc network is gradually migrating into the Internet of Vehicles (IoV). Meanwhile, as a common data structure composed of vertices and edges, graph commonly used to represent road network typologies, are also outsourced to Internet servers for the convenience of people in IoV accessing the road network anytime and anywhere. However, it introduces much potential risks on people’s privacy as the Internet servers are often assumed semi-honest. As an essential component in IoV, privacy-preserving shortest distance query has been researched many years in the cryptographic community. Unfortunately, most of the solutions are designed under symmetric key setting and employ some off-the-shelf cryptographic primitives. They are impractical in the multiuser IoV environment due to an inherent weakness—key agreement required between each pair of a graph data provider and a user since the symmetric key encryption was born. Moreover, these off-the-shelf primitives ask multiple Internet servers or graph data providers to interact in the test process in order to assist one Internet server returning the shortest distance to users, both of which thereby raise a significant communication cost. To overcome these drawbacks, in this article, we propose an asymmetric searchable encryption scheme supporting shortest distance query, which is quite suitable for multiuser IoV environment since the key agreement is no longer required between each pair of a graph data provider and a user. In particular, we present a new cryptographic primitive instead of leveraging any ready-made one, that enables only one server in IoV to be required for returning the final query result—shortest distance to users without any interaction with others, thereby reducing the communication cost. Finally, a strict mathematical security proof is offered as well as some security attacks are analyzed, followed by an experimental evaluation and comparison.
- 13 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 72 (1) , 198-202
Parametric Interpolation Model Order Reduction on Grassmann Manifolds by Parallelization
Based on Riemannian geometry of Grassmann manifolds and discrete Laguerre polynomials, we propose a parametric interpolation parallel MOR method for discrete-time parametric systems. First, a block discrete Fourier transform-based (BDFT) parallel strategy is presented to construct the local basis matrices, which achieves two level acceleration by parallelization. Further, using the retractions and vector transports on Grassmann manifolds, the basis matrix for a new parameter is obtained by interpolating the local bases on the tangent spaces at the different reference points. Finally, a numerical example is used to demonstrate the efficiency of our method.
- 13 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 72 (1) , 198-202
Parametric Interpolation Model Order Reduction on Grassmann Manifolds by Parallelization
Based on Riemannian geometry of Grassmann manifolds and discrete Laguerre polynomials, we propose a parametric interpolation parallel MOR method for discrete-time parametric systems. First, a block discrete Fourier transform-based (BDFT) parallel strategy is presented to construct the local basis matrices, which achieves two level acceleration by parallelization. Further, using the retractions and vector transports on Grassmann manifolds, the basis matrix for a new parameter is obtained by interpolating the local bases on the tangent spaces at the different reference points. Finally, a numerical example is used to demonstrate the efficiency of our method.
- 14 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-8
Parallel Input-Independent Model Order Reduction for Discrete-Time Parametric Systems
In this paper, based on discrete orthogonal polynomials and the block $\epsilon$ -circulant matrix, we explore a parallel input-independent model order reduction (MOR) method, which is suitable for the single-input discrete-time systems characterizing non-affine uncertainty about a scalar parameter. With the explicit difference relations of Charlier polynomials, Meixner polynomials, and Krawtchouk polynomials, the expansion coefficients of the state variable are obtained. Further, we derive an input-independent projection subspace, such that it is equivalent to the subspace spanned by the expansion coefficients for arbitrary input. Based on the block discrete Fourier transform (DFT) of the block $\epsilon$ -circulant matrix, a parallel strategy is proposed to compute the basis of the equivalent projection subspace. Then, the projection matrix is constructed and used to reduce discrete-time parametric systems. Moreover, we analyze the feasibility of the parallel strategy by presenting the invertibility of the block $\epsilon$ -circulant matrices and the corresponding error. Finally, the efficiency of the proposed method is illustrated by the numerical experiment.
- 14 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-8
Parallel Input-Independent Model Order Reduction for Discrete-Time Parametric Systems
In this paper, based on discrete orthogonal polynomials and the block $\epsilon$ -circulant matrix, we explore a parallel input-independent model order reduction (MOR) method, which is suitable for the single-input discrete-time systems characterizing non-affine uncertainty about a scalar parameter. With the explicit difference relations of Charlier polynomials, Meixner polynomials, and Krawtchouk polynomials, the expansion coefficients of the state variable are obtained. Further, we derive an input-independent projection subspace, such that it is equivalent to the subspace spanned by the expansion coefficients for arbitrary input. Based on the block discrete Fourier transform (DFT) of the block $\epsilon$ -circulant matrix, a parallel strategy is proposed to compute the basis of the equivalent projection subspace. Then, the projection matrix is constructed and used to reduce discrete-time parametric systems. Moreover, we analyze the feasibility of the parallel strategy by presenting the invertibility of the block $\epsilon$ -circulant matrices and the corresponding error. Finally, the efficiency of the proposed method is illustrated by the numerical experiment.
- 7 September 2018
- Published by Institution of Engineering and Technology (IET) in IET Control Theory & Applications
- Vol. 12 (16) , 2253-2262
Non‐linear model‐order reduction based on tensor decomposition and matrix product
In this study, based on tensor decomposition and matrix product, the authors investigate two model‐order reduction (MOR) methods for the quadratic‐bilinear (QB) systems which are equivalently transformed from the non‐linear input–output systems. Since the quadratic term coefficient of the QB system can be considered as the matricisation of a tensor, they propose two computationally efficient ways to obtain the reduced system by using tensor calculus. First, the Tucker decomposition of tensors is used to deal with the quadratic term coefficient of the QB system. The transformational matrix is constructed by applying the analysis of matrix product. Then, they get the reduced QB system which can match the first several expansion coefficients of the original output. Besides, they propose another MOR method based on the CANDECOMP/PARAFAC decomposition. These two methods can avoid large computational complexity in the process of computing the reduced system. Moreover, the error estimation and stability of the authors' MOR methods are discussed. The efficiency of their MOR methods is illustrated by two numerical examples and they show their competitiveness when compared to the proper orthogonal decomposition method.
- 7 September 2018
- Published by Institution of Engineering and Technology (IET) in IET Control Theory & Applications
- Vol. 12 (16) , 2253-2262
Non‐linear model‐order reduction based on tensor decomposition and matrix product
In this study, based on tensor decomposition and matrix product, the authors investigate two model‐order reduction (MOR) methods for the quadratic‐bilinear (QB) systems which are equivalently transformed from the non‐linear input–output systems. Since the quadratic term coefficient of the QB system can be considered as the matricisation of a tensor, they propose two computationally efficient ways to obtain the reduced system by using tensor calculus. First, the Tucker decomposition of tensors is used to deal with the quadratic term coefficient of the QB system. The transformational matrix is constructed by applying the analysis of matrix product. Then, they get the reduced QB system which can match the first several expansion coefficients of the original output. Besides, they propose another MOR method based on the CANDECOMP/PARAFAC decomposition. These two methods can avoid large computational complexity in the process of computing the reduced system. Moreover, the error estimation and stability of the authors' MOR methods are discussed. The efficiency of their MOR methods is illustrated by two numerical examples and they show their competitiveness when compared to the proper orthogonal decomposition method.
- 1 August 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10932941,p. 23-26
Experimental research on the triggering characteristic of TVS under AC condition
Triggered vacuum switches (TVS), have found fast growing applications in the field of power system and pulse power. A closing switch is the necessary controlling device of power supply of an ElectroMagnetic Launcher (EML) system and synthetic making test of high-voltage circuit breakers for short-circuit current introduce, which should have the ability to quick connect the circuit and precisely controlling the moment of connection. It also should isolate the high power storage, then close the circuit at a set time. TVS gets fast development in recent years, which attributes to its many advantages. High insulation level of vacuum medium and the fast diffusion of post-arc plasma make TVS have the ability to turn on and off high voltage and high current with higher frequency. Electrodes and trigger are sealed in the vacuum chamber and free from outside disturbance, that ensures the reliability of TVS. Arcs running in vacuum have very low arc voltage that leads to much lower energy input to the arc and thus result in a lower electrode erosion rate. In our research, a series experiments have been carried out on the sample TVS especially with AC load between the main electrodes. The triggering and delay characteristics were emphatically expounded. An elaborated circuit for controlling the TVS is proposed herein. The triggering energy of the controller can be adjusted conveniently. By means of changing the triggering energy, the experimental results show that the delay and jitter times decrease with increasing trigger energy. The delay and jitter times decreases magnificently with the increasing voltage in the main gap. By increasing the main-gap voltage, the triggered probability increases.
- 1 August 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10932941,p. 23-26
Experimental research on the triggering characteristic of TVS under AC condition
Triggered vacuum switches (TVS), have found fast growing applications in the field of power system and pulse power. A closing switch is the necessary controlling device of power supply of an ElectroMagnetic Launcher (EML) system and synthetic making test of high-voltage circuit breakers for short-circuit current introduce, which should have the ability to quick connect the circuit and precisely controlling the moment of connection. It also should isolate the high power storage, then close the circuit at a set time. TVS gets fast development in recent years, which attributes to its many advantages. High insulation level of vacuum medium and the fast diffusion of post-arc plasma make TVS have the ability to turn on and off high voltage and high current with higher frequency. Electrodes and trigger are sealed in the vacuum chamber and free from outside disturbance, that ensures the reliability of TVS. Arcs running in vacuum have very low arc voltage that leads to much lower energy input to the arc and thus result in a lower electrode erosion rate. In our research, a series experiments have been carried out on the sample TVS especially with AC load between the main electrodes. The triggering and delay characteristics were emphatically expounded. An elaborated circuit for controlling the TVS is proposed herein. The triggering energy of the controller can be adjusted conveniently. By means of changing the triggering energy, the experimental results show that the delay and jitter times decrease with increasing trigger energy. The delay and jitter times decreases magnificently with the increasing voltage in the main gap. By increasing the main-gap voltage, the triggered probability increases.