Jiayong Chai

Mr. Jiayong Chai

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 March 2026 in Sensors
Verified
Journal Article
Open access
PDF file
JCJiayong Chai
Jiayong Chai
MCMo Chen
Mo Chen
张张张伟 张
张伟 张
XWXiaojuan Wang
Xiaojuan Wang
JSJiaming Song
Jiaming Song
Cross-domain data collaboration is a core requirement for the intelligent development of critical areas such as the Internet of Vehicles and intelligent transportation systems. In this scenario, vehicles and various sensors deployed roadside continuously generate massive amounts of time-series data, yet this data often forms “data silos” due to privacy regulations and a lack of trust between collaborating entities. Existing integrated schemes combining “Federated Learning + Blockchain” have achieved a certain degree of process traceability and automated payments, but risks of gradient-level privacy leakage persist, and inflexible and delayed incentive mechanisms result in low participation quality. To systematically address these bottlenecks, this paper proposes the Federated Learning with Assured Privacy and Reputation-Driven Incentives (FLARE) architecture, whose core innovation lies in the native integration of cryptographic security and mechanism design theory. It includes the Secure and Faithfully Executed Gradient aggregation (SafeGrad) protocol, which integrates partial homomorphic encryption and zero-knowledge proofs to provide verifiable privacy guarantees for gradient contributions while enabling efficient secure aggregation, defending against inversion attacks at the source; alongside this, it includes the Economy-on-Chain incentive (EconChain) mechanism, which designs an on-chain economic system based on blockchain, achieving precise measurement and sustainable incentivization of training process contributions through fine-grained instant micro-rewards and a dynamic reputation model. Experiments show that, compared to baseline schemes, FLARE can effectively enhance node participation enthusiasm and contribution quality without compromising model accuracy, providing a new paradigm with both strong security and high vitality for the trusted and efficient circulation of data.

1 January 2026 in International Journal of Swarm Intelligence Research
Verified
Journal Article
Open access
JCJiayong Chai
Jiayong Chai
LZLei Zhang
Lei Zhang
JLJian Li
Jian Li
Appropriate model hyperparameters, transfer learning strategies, and loss balancing are still challenging to discover, while deep learning has achieved remarkable progress in picture segmentation and classification. An integrated encoder-decoder network is improved in this transfer learning system with the application of Particle Swarm Optimization (PSO). To get hierarchical data, a pretrained encoder is used, and lightweight segmentation and classification heads learn two tasks at once. By default, PSO, a universal meta-optimizer, changes learning rates, layer-freezing masks, batch sizes, and loss-weighting coefficients. Manual searches are accelerated in this way. With this hybrid approach, we may improve the accuracy-efficiency trade-off by combining global exploration with gradient descent and Particle Swarm Optimization (PSO). Cityscapes, PASCAL VOC, and CIFAR simulations demonstrate that swarm-based meta-learning has the potential to increase the flexibility of transfer learning, leading to more efficient and less expensive models for picture processing.

16 December 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JCJiayong Chai
Jiayong Chai
JGJun Guo
Jun Guo
MWMuhua Wei
Muhua Wei
MCMo Chen
Mo Chen
SLSONG LUO
SONG LUO
Blockchain systems have been widely adopted in today’s society, with consensus algorithms serving as their core component to ensure all participants in the network agree on a specific data state. Existing consensus algorithms such as Proof of Work (PoW), Proof of Stake (PoS), and the Practical Byzantine Fault-Tolerant Algorithm (PBFT) exhibit certain limitations in terms of scalability, security, and efficiency. To address these limitations, this paper proposes a novel Network-based Reputation Consensus (NRC) algorithm. The main research contributions of this work include the following: (1) An intelligent grouping mechanism that dynamically groups nodes based on network awareness, forming consensus groups with low internal latency and high bandwidth utilization, significantly reducing intra-group communication overhead. (2) A dynamic reputation system incorporating a “diminishing returns” reward function and a “multiplicative penalty” mechanism, effectively incentivizing honest node participation while preventing power monopoly. (3) A two-phase model of “intra-group BFT consensus + global communication committee ordering” that decomposes complex global consensus into parallel intra-group processing and coordination among a small set of elite nodes, thereby drastically improving efficiency. (4) Comprehensive simulations comparing the NRC algorithm with mainstream consensus algorithms, demonstrating its superior performance in communication overhead, throughput, latency, and tolerance to malicious nodes, thereby laying the foundation for large-scale applications.