activity
20192021
most citedPolynomial-Time Algorithms for Structurally Observable Graphs by Controlling Minimal Vertices

4 citations · 4 across the 4 of their papers we have counts for

collaborators

5 papers

eess.SY20214 cited

Polynomial-Time Algorithms for Structurally Observable Graphs by Controlling Minimal Vertices

Shiyong Zhu, Jianquan Lu, Daniel W. C. Ho +1

The aim of this paper is to characterize an important class of marked digraphs, called structurally observable graphs (SOGs), and to solve two minimum realization problems. To begi…

math.DS2020

Stability Analysis of Quaternion-valued Neural Networks with Leakage Delay and Additive Time-varying Delays

Qun Huang, Jinde Cao

In this paper, the stability analysis of quaternion-valued neural networks (QVNNs) with both leakage delay and additive time-varying delays is proposed. By employing the Lyapunov-K…

cs.CV2020

A new approach to descriptors generation for image retrieval by analyzing activations of deep neural network layers

Paweł Staszewski, Maciej Jaworski, Jinde Cao +1

In this paper, we consider the problem of descriptors construction for the task of content-based image retrieval using deep neural networks. The idea of neural codes, based on full…

eess.SY2019

Pinning Stabilizer Design for Large-Scale Probabilistic Boolean Networks

Lin Lin, Jinde Cao, Jianquan Lu +1

This paper investigates the stabilization of probabilistic Boolean networks (PBNs) via a novel pinning control strategy based on network structure. In a PBN, the evolution equation…

math.CO2019

Computing the Laplacian spectrum of linear octagonal-quadrilateral networks and its applications

Jia-Bao Liu, Zhi-Yu Shi, Ying-Hao Pan +3

Let Ln denote linear octagonal-quadrilateral networks. In this paper, we aim to firstly investigate the Laplacian spectrum on the basis of Laplacian polynomial of Ln. Then, by appl…