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

Baolei Peng

dblp:398/8296 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021

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
Emerging computing paradigms · 100%

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

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › molecular computing
DNA computing
0.912025
Design of a Universal Decoder Model Based on DNA Winner-Takes-All Neural Networks · IEEE Trans. Computers 2025
Emerging computing paradigms
neural computing
0.312025
Design of a Universal Decoder Model Based on DNA Winner-Takes-All Neural Networks · IEEE Trans. Computers 2025

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

competitive annihilation · 0.9DNA strand displacement · 0.9
YearPublicationVenuePosition
2025 Multiple-input and multiple-output encoders with DNA-based winner-take-all neural Networks
Chun Huang 0005, Qingshuang Guo, Jiaying Shao, Baolei Peng, Panlong Li, Junwei Sun 0002, Yanfeng Wang 0002
Neural Networks4
2025 Design of a Universal Decoder Model Based on DNA Winner-Takes-All Neural Networks
abstract
DNA computing has proven to possess strong parallel processing capabilities, offering notable advantages for multi-objective computation. Traditional, complex nonlinear DNA molecular logic circuits require the pre-construction of basic logic gates, followed by their cascading to achieve logic functions. However, as the number of cascade levels increases, more DNA strands are required to amplify and recover signals, causing the system's reaction time to grow exponentially. This paper introduces a novel approach for building complex nonlinear digital logic circuits using DNA winner-take-all neural networks. The logic circuit comprises four computational modules: weight multiplication, summation, competitive annihilation, and reporting. First, an annihilation strand is designed to control the reaction rate between two competing signals, resolving the interference between weight multiplication and competitive annihilation. Second, new grouping strategies—complementary annihilation, equal annihilation, and denoise annihilation—are introduced. These strategies exponentially reduce the number of competitive strands and significantly decrease system reaction time. The effect becomes more pronounced as the number of input patterns increases. Finally, 2-4, 3-8, and 4-16 decoder circuits are built using the winner-take-all neural networks, and an$\boldsymbol{n}\boldsymbol{-}\boldsymbol{2}^{\boldsymbol{n}}$universal decoder model is further developed. This study presents an effective method for implementing complex nonlinear logic circuits through DNA strand displacement reactions.
Chun Huang 0005, Jiaying Shao, Baolei Peng, Qingshuang Guo, Panlong Li, Junwei Sun 0002, Yanfeng Wang 0002
IEEE Trans. Computers3