Qingshan Ren

Dr. Qingshan Ren


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
30 April 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
YCYineng Chen
Yineng Chen
TGTing Guo
Ting Guo
QRQingshan Ren
Qingshan Ren
1Y1 Yang
1 Yang
XCXiaoxuan Chen
Xiaoxuan Chen
FZFanzi Zeng
Fanzi Zeng
With the widespread application of alliance chain technology in diverse scenarios, its immutability has gradually revealed certain limitations in practical use. To address this challenge, a redactable alliance chain innovatively introduces functionalities for data modification, deletion, and updating. However, issues related to redaction permissions, auditing, and security hinder its development. To overcome these challenges, the K-medoids clustering algorithm is first employed to select a redaction center and a consensus committee. The redaction center reviews redaction requests, while the consensus committee groups redaction blocks and reaches block consensus. Next, a dual-hash function scheme is proposed, where a subkey-updatable chameleon hash function collaborates with a standard hash function. The system’s master key can revoke a user’s redaction rights by updating their subkey. Based on this framework, a block redaction strategy comprising four phases and nine execution algorithms is introduced, enabling an auditable, accountable, and subkey-updatable RBAU. Security analysis and experimental results demonstrate that the proposed model excels in correctness, resistance to collision of the original key, resistance to collision of the updated key, user subkey updatability, and master key immutability. Additionally, the algorithm’s execution time, transaction execution time, block size, and redaction time are comparable to those of the pre-improvement alliance chain.

1 November 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
HLHongchao Lv
Hongchao Lv
YCYineng Chen
Yineng Chen
QRQingshan Ren
Qingshan Ren
SLshukun liu
shukun liu
XPXianghua Peng
Xianghua Peng
YZYixin Zhang
Yixin Zhang
Background: Identifying diabetes phenotypes in electronic health records is challenging when repeated admissions and diagnosis-derived variables can bias evaluation. Methods: We reconstructed an ICD-audited diabetes phenotype from MIMIC-IV v3.1 and compared LightGBM with trajectory-aware probability stacking and a conservative contextual-bandit reliability gate. Patient-level separation, out-of-fold feature generation, independent gate development, and a common upstream Base model were used. Results: On the primary held-out split (51,400 records), Full SAG-RS achieved accuracy 0.926654, F1 0.889579, AUC 0.961288, and Brier 0.059649. Across five patient-level splits, mean accuracy was 0.928021 ± 0.002217. The gate improved primary-split accuracy over Stack-only by 0.000233 (95% paired confidence interval −0.000078 to 0.000548); net corrections were positive in three of five splits. Conclusions: Trajectory-aware stacking provided most of the gain over admission-level LightGBM. The gate offered limited, variable correction rather than a demonstrated independent performance gain. Findings are restricted to retrospective internal validation; external validation and full-pipeline replication remain outstanding.