Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Guanghui Zhu"'
Publikováno v:
Machine Learning. 111:1959-1985
Decision trees have favorable properties, including interpretability, high computational efficiency, and the ability to learn from little training data. Learning a decision tree is known to be NP-complete. The researchers have proposed many greedy al
Publikováno v:
IEEE Transactions on Automatic Control. 66:2393-2398
In this article, we present a fault diagnosis approach for discrete event systems using labeled Petri nets. In contrast to the existing works, a new fault class containing all the fault transitions is additionally introduced in the diagnosis function
Publikováno v:
IEEE Transactions on Automatic Control. 66:810-817
In this article, we propose a two-layer-structure called hierarchical basis reachability graph that is useful for marking estimation in Petri nets that contain unobservable transitions. On the basis of a hierarchical partition of the set of observabl
Publikováno v:
IEEE Transactions on Automatic Control. 65:2662-2669
We study the computation of admissible marking sets in generalized Petri nets. We first show that the admissibility checking in the generalized Petri net is NP-hard. Then, we consider a special subclass of generalized Petri nets called weighted-synch
Publikováno v:
IEEE Access, Vol 8, Pp 154871-154880 (2020)
This paper addresses the fault diagnosis problem in discrete event systems using backward conflict-free Petri nets, where two different transitions have no common output places. The notion of generalized markings is employed, where the number of toke
Publikováno v:
IEEE Access, Vol 8, Pp 162363-162372 (2020)
In this article, we propose an online fault diagnosis approach for labeled Petri nets. When observing an event, the reachability graph of the unobservable subnet (i.e., the net consisting of all places, unobservable transitions, and the attached arcs
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 30:2663-2676
Functional dependencies (FDs) play a very important role in many data management tasks such as schema normalization, data cleaning, and query optimization. Meanwhile, there are ever-increasing application demands for efficient FD discovery on large-s
Publikováno v:
Journal of Parallel and Distributed Computing. 132:113-126
Most of the existing deep models are deep neural networks. Recently, the deep forest opens a door towards an alternative to deep neural networks for many tasks and has attracted more and more attention. At the same time, the deep forest model becomes
Publikováno v:
Parallel Computing. 87:87-102
The suffix tree is a fundamental data structure for string processing. It is widely used in many important scenarios such as text processing, information retrieval, and bioinformatics. With the rapid growth of data volume, constructing the suffix tre
Publikováno v:
Processes, Vol 9, Iss 762, p 762 (2021)
Processes
Volume 9
Issue 5
Processes
Volume 9
Issue 5
The powertrain system is critical to the reliability of a battery electric vehicle (BEV). However, the BEV powertrain is a complex system
it includes the motor, motor controller, power distribution unit, battery system, etc. The failure of any o
it includes the motor, motor controller, power distribution unit, battery system, etc. The failure of any o