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

Enjian Bai

dblp:55/4140 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
1since 2021 · last 2025
0000-0002-9885-392XORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-authorTheory of computation · 2 · 1 first-authorComputer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Coding theory · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences › pseudorandom sequences
cyclotomic sequences
0.112005
Linear complexity of new generalized cyclotomic sequences of order two of length pq · IEEE Trans. Inf. Theory 2005
Coding theory › sequences
linear complexity
0.112005
Linear complexity of new generalized cyclotomic sequences of order two of length pq · IEEE Trans. Inf. Theory 2005
Coding theory
sequences
0.112005
Linear complexity of new generalized cyclotomic sequences of order two of length pq · IEEE Trans. Inf. Theory 2005
Cryptographic primitives and cryptanalysis
stream cipher
0.012005
Linear complexity of new generalized cyclotomic sequences of order two of length pq · IEEE Trans. Inf. Theory 2005

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

minimal polynomial computation · 0.1
YearPublicationVenuePosition
2025 Image Compression Model Based on Dynamic Convolution and Vision Mamba
abstract
ABSTRACT We propose an efficient image compression scheme leveraging Vision Mamba and dynamic convolution, addressing the limitations of existing methods, such as failure to capture long‐range pixel dependencies and high computational complexity. Our approach improves both global and local information learning with reduced computational cost. Experimental results on the Kodak, Tecnick and CLIC datasets show that our model achieves competitive performance with lower algorithm complexity. Our code is available on: https://github.com/Lynxsx/ICVM .
Lingchen Qiu, Enjian Bai, Yun Wu 0002, Xueqin Jiang 0001
IET Image Process.2
2020 Generalised switching protocol of energy harvesting for enhancing the security of AF multi-antenna relaying systems
abstract
In this study, the authors propose a generalisedswitching protocol (GSP) for increasing the flexibility of energy harvesting (EH) protocol and enhancing the security of amplify‐and‐forward (AF) multi‐antenna relaying system. The proposed GSP‐based relaying [generalised switching relaying (GSR)] system is established with target node assisted interference and EH technologies. In phase I, while the source transmits certain signal to the relay, the destination transmits an artificial noise to interfere the passive eavesdropper. In this phase, the relay harvests energy from the two nodes. In phase II, the relay node processes the two different received signals, which are from the source and destination, then AF them by utilising the harvested energy. The authors also derive a new analytical formula for the proposed protocol on ergodic secrecy capacity. The effect of the number of relay antennas N , the source transmitted power , the destination transmitted power and EH efficiency factors and on ergodic secrecy capacity are investigated. The simulation results show that as N , , , and increase, the ergodic secrecy capacity of GSR system increases accordingly. Moreover, the GSR protocol can provide higher ergodic secrecy capacity than both time switching relaying and powersplitting relaying protocols.
Xueqin Jiang 0001, Enjian Bai, Yuyang Peng, Hui-Ming Wang 0001
IET Commun.4
2017 A new advantage distillation scheme over MIMO wiretap channels based on feedback bits
abstract
We first generalize the extended orthogonal space time block codes (EO-STBCs). Then, based on the generalized EO-STBCs (GEO-STBCs) and channel state information (CSI), the feedback bits are generated at the receiver. By using the feedback bits from the legitimate receiver, we propose a new advantage distillation scheme for multiple-input multiple-output (MIMO) wiretap channels.
Xueqin Jiang 0001, Miaowen Wen, Enjian Bai, Yun Wu 0002, Jun Li 0036
CCNC4
2011 A heuristic time-invariant model for fuzzy time series forecasting
Enjian Bai, Wai Keung Wong, W. C. Chu, Min Xia 0002
Expert Syst. Appl.1
2010 Adaptive Time-Variant Models for Fuzzy-Time-Series Forecasting
abstract
A fuzzy time series has been applied to the prediction of enrollment, temperature, stock indices, and other domains. Related studies mainly focus on three factors, namely, the partition of discourse, the content of forecasting rules, and the methods of defuzzification, all of which greatly influence the prediction accuracy of forecasting models. These studies use fixed analysis window sizes for forecasting. In this paper, an adaptive time-variant fuzzy-time-series forecasting model (ATVF) is proposed to improve forecasting accuracy. The proposed model automatically adapts the analysis window size of fuzzy time series based on the prediction accuracy in the training phase and uses heuristic rules to generate forecasting values in the testing phase. The performance of the ATVF model is tested using both simulated and actual time series including the enrollments at the University of Alabama, Tuscaloosa, and the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX). The experiment results show that the proposed ATVF model achieves a significant improvement in forecasting accuracy as compared to other fuzzy-time-series forecasting models.
Wai Keung Wong, Enjian Bai, Alice Wai-Ching Chu
IEEE Trans. Syst. Man Cybern. Part B2
2009 Robust sequence memory in sparsely-connected networks with controllable steady-state period
Min Xia 0002, Enjian Bai
Neurocomputing4
2007 Some Notes on d -Form Functions with Difference-Balanced Property
Tongjiang Yan, Xiaoni Du, Enjian Bai, Guozhen Xiao
WAIFI3
2007 Some Notes on Prime-Square Sequences
Enjian Bai
J. Comput. Sci. Technol.1
2005 Linear complexity of new generalized cyclotomic sequences of order two of length pq
abstract
In this correspondence, the linear complexity and minimal polynomial of new generalized cyclotomic sequences of order two are determined. Our results show that these sequences also have high linear complexity.
Enjian Bai, Guozhen Xiao
IEEE Trans. Inf. Theory1