Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhuzhi Yuan

dblp:43/6736 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3Applied, interdisciplinary, general and emerging computing · 3Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
network controllability
0.112008
Pinning weighted complex networks with heterogeneous delays by a small number of feedback controllers · Sci. China Ser. F Inf. Sci. 2008

Methods — techniques the papers use, named apart from their topics

pinning control · 0.1feedback control · 0.1
YearPublicationVenuePosition
2008 Pinning weighted complex networks with heterogeneous delays by a small number of feedback controllers
Linying Xiang, Zhongxin Liu 0001, Zengqiang Chen 0001, Zhuzhi Yuan
Sci. China Ser. F Inf. Sci.4
2007 Extending TCP congestion control to multicast
Hualiang Chen, Zhongxin Liu 0001, Zengqiang Chen 0001, Zhuzhi Yuan
Comput. Networks4
2007 New Chaotic PSO-Based Neural Network Predictive Control for Nonlinear Process
abstract
In this letter, a novel nonlinear neural network (NN) predictive control strategy based on the new tent-map chaotic particle swarm optimization (TCPSO) is presented. The TCPSO incorporating tent-map chaos, which can avoid trapping to local minima and improve the searching performance of standard particle swarm optimization (PSO), is applied to perform the nonlinear optimization to enhance the convergence and accuracy. Numerical simulations of two benchmark functions are used to test the performance of TCPSO. Furthermore, simulation on a nonlinear plant is given to illustrate the effectiveness of the proposed control scheme.
Zengqiang Chen 0001, Zhuzhi Yuan
IEEE Trans. Neural Networks3
2005 Evolutionary Pseudo-Relaxation Learning Algorithm for Bidirectional Associative Memory
Shengzhi Du, Zengqiang Chen 0001, Zhuzhi Yuan
J. Comput. Sci. Technol.3
2005 Sensitivity to noise in bidirectional associative memory (BAM)
abstract
Original Hebbian encoding scheme of bidirectional associative memory (BAM) provides a poor pattern capacity and recall performance. Based on Rosenblatt's perceptron learning algorithm, the pattern capacity of BAM is enlarged, and perfect recall of all training pattern pairs is guaranteed. However, these methods put their emphases on pattern capacity, rather than error correction capability which is another critical point of BAM. This paper analyzes the sensitivity to noise in BAM and obtains an interesting idea to improve noise immunity of BAM. Some researchers have found that the noise sensitivity of BAM relates to the minimum absolute value of net inputs (MAV). However, in this paper, the analysis on failure association shows that it is related not only to MAV but also to the variance of weights associated with synapse connections. In fact, it is a positive monotone increasing function of the quotient of MAV divided by the variance of weights. This idea provides an useful principle of improving error correction capability of BAM. Some revised encoding schemes, such as small variance learning for BAM (SVBAM), evolutionary pseudorelaxation learning for BAM (EPRLAB) and evolutionary bidirectional learning (EBL), have been introduced to illustrate the performance of this principle. All these methods perform better than their original versions in noise immunity. Moreover, these methods have no negative effect on the pattern capacity of BAM. The convergence of these methods is also discussed in this paper. If there exist solutions, EPRLAB and EBL always converge to a global optimal solution in the senses of both pattern capacity and noise immunity. However, the convergence of SVBAM may be affected by a preset function.
Shengzhi Du, Zengqiang Chen 0001, Zhuzhi Yuan, Xinghui Zhang
IEEE Trans. Neural Networks3
2004 QoS Routing Optimization Strategy Using Genetic Algorithm in Optical Fiber Communication Networks
Zengqiang Chen 0001, Zhuzhi Yuan
J. Comput. Sci. Technol.3
2002 Chaotifying linear Elman networks
abstract
A linear model of recurrent neural networks, called the Elman networks, is combined with the simple nonlinear modulo (mod) operation on its linear activated function so as to generate chaos purposely. Conditions on the weight matrix are obtained, under which the generated chaos satisfies the mathematical definition of chaos in the sense of T.Y. Li and J.A. Yorke (1975). Some simple and representative weight matrices are constructed for designing such Elman networks that can generate Li-Yorke chaos. Several numerical simulations are shown to verify and visualize the design.
Xiang Li 0010, Guanrong Chen, Zengqiang Chen 0001, Zhuzhi Yuan
IEEE Trans. Neural Networks4