Ruimin Wang

Prof. Dr. Ruimin Wang

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
19 December 2013 in Discrete Dynamics in Nature and Society
Verified
Journal Article
Open access
PDF file
RWRuimin Wang
Ruimin Wang
YLYuqiang Luo
Yuqiang Luo
JDJianqiang Dong
Jianqiang Dong
SLShuai Liu
Shuai Liu
XQXiaozhuo Qi
Xiaozhuo Qi
The research on the triangle packing problem has important theoretic significance, which has broad application prospects in material processing, network resource optimization, and so forth. Generally speaking, the orientation of the triangle should be limited in advance, since the triangle packing problem is NP-hard and has continuous properties. For example, the polygon is not allowed to rotate; then, the approximate solution can be obtained by optimization method. This paper studies the triangle packing problem by a new kind of method. Such concepts as angle region, corner-occupying action, corner-occupying strategy, and edge-conjoining strategy are presented in this paper. In addition, an edge-conjoining and corner-occupying algorithm is designed, which is to obtain an approximate solution. It is demonstrated that the proposed algorithm is highly efficient, and by the time complexity analysis and the analogue experiment result is found.

1 February 2025 in Electronics
Verified
Journal Article
Open access
PDF file
RWRuimin Wang
Ruimin Wang
HFHaolong Fan
Haolong Fan
KLKezhen Liu
Kezhen Liu
In recent years, governments have regarded blockchain technology as a key breakthrough in independent innovation of core technologies and have attached great importance to its development. In current blockchain solutions, the elliptic curve digital signature algorithm (ECDSA) is usually combined with the Keccak Hash Algorithm 256-bit Variant (keccak256) to generate blockchain addresses. Although the ECDSA algorithm is based on the Public Key Infrastructure (PKI) system, which has prominent issues such as complex deployment processes, high operation and maintenance costs, low efficiency, and difficulties in adapting to a large number of users, it still holds an important position and has a broad application foundation in the field of cryptography. This paper aims to circumvent the existing flaws of the PKI system rather than discarding the strong and well-proven PKI system. Instead, it endeavors to explore the application of the Identity-Based Cryptography (IBC) system in blockchain and reduce dependence on foreign cryptographic algorithms. This study adopts the SM9 algorithm based on the IBC and combines it with the SM3 algorithm to generate blockchain addresses. Considering users’ use, this paper improves the original SM9 algorithm based on the original SM9 algorithm, enabling users to perform functions such as signing and encryption with just a single pair of public and private keys. Experimental results indicate that the time consumed by this proposed scheme in blockchain address generation is 1.29 times that of the existing schemes, and the length of the blockchain addresses generated is the same as that of the existing ones.

5 August 2014 in Abstract and Applied Analysis
Verified
Journal Article
Open access
PDF file
RWRuimin Wang
Ruimin Wang
XQXiaozhuo Qi
Xiaozhuo Qi
YLYuqiang Luo
Yuqiang Luo
JDJianqiang Dong
Jianqiang Dong
The packing problem of unit equilateral triangles not only has the theoretical significance but also offers broad prospects in material processing and network resource optimization. Because this problem is nondeterministic polynomial (NP) hard and has the feature of continuity, it is necessary to limit the placements of unit equilateral triangles before optimizing and obtaining approximate solution (e.g., the unit equilateral triangles are not allowed to be rotated). This paper adopts a new quasi-human strategy to study the packing problem of unit equilateral triangles. Some new concepts are put forward such as side-clinging action, and an approximation algorithm for solving the addressed problem is designed. Time complexity analysis and the calculation results indicate that the proposed method is a polynomial time algorithm, which provides the possibility to solve the packing problem of arbitrary triangles.

28 March 2026 in Sensors
Verified
Journal Article
Open access
PDF file
XLXudong Luo
Xudong Luo
RWRuimin Wang
Ruimin Wang
JZJianhui Zhang
Jianhui Zhang
JZJunjie ZENG
Junjie ZENG
CHCai Xiao Hang
Cai Xiao Hang
Wind turbine blade surface defect detection remains challenging due to large variations in defect scales, blurred edge textures, and severe interference from complex backgrounds, which often lead to insufficient detection accuracy and high false and missed detection rates. To address these issues, this paper proposes an improved RTDETR-based detection framework, termed CEA-DETR, for wind turbine blade surface defect inspection. First, a Cross-Scale Multi-Edge feature Extraction (CSME) backbone is designed by integrating multi-scale pooling and edge-enhancement units with a dual-domain feature selection mechanism, enabling effective extraction of fine-grained texture and edge features across different scales. Second, an Efficient Multi-Scale Feature Fusion Network (EMSFFN) is constructed to facilitate deep cross-level feature interaction through adaptive weighted fusion and multi-scale convolutional structures, thereby enhancing the representation of multi-scale defects. Furthermore, an adaptive sparse self-attention mechanism is introduced to reconstruct the AIFI module, strengthening global dependency modeling and guiding the network to focus on critical defect regions under complex background conditions. Experimental results demonstrate that CEA-DETR achieves mAP50 and mAP50:95 of 89.4% and 68.9%, respectively, representing improvements of 3.1% and 6.5% over the RT-DETR-r18 baseline. Meanwhile, the proposed model reduces computational cost (GFLOPs) by 20.1% and parameter count by 8.1%. These advantages make CEA-DETR more suitable for deployment on resource-constrained unmanned aerial vehicles (UAVs), enabling efficient and real-time autonomous inspection of wind turbine blades.

3 September 2026 in Sensors
Verified
Journal Article
Open access
PDF file
RWRuimin Wang
Ruimin Wang
灿刘灿 刘
灿 刘
HZHanbing Zhang
Hanbing Zhang
MJMengyu Jia
Mengyu Jia
Vehicular ad hoc networks (VANETs) have become a vital component of intelligent transport systems, with their security concerns increasingly drawing attention. To safeguard user privacy and ensure data authenticity and integrity, researchers have devised numerous certificateless conditional privacy-preserving authentication (CLCPPA) schemes. However, existing schemes generally suffer from insufficient security or high computational and communication overhead. Moreover, most implicitly assume the existence of a secure channel between vehicles and trusted entities during pseudonym generation and transmission, making it difficult to meet the real-time demands and practical deployment requirements of VANETs. To address these issues, this paper constructs a certificateless aggregated conditional privacy-preserving authentication (CL-ACPPA) scheme under elliptic curve cryptography that does not require bilinear operations. Formal security analysis demonstrates that, under the Random Oracle Model and the elliptic curve discrete logarithm problem assumption, the proposed scheme resists adaptive chosen-message attacks from adversaries with varying capabilities. Performance analysis and experimental results demonstrate that, compared with existing schemes, the proposed scheme achieves higher security while maintaining low communication and computational overhead.

17 September 2026 in Electronics
Verified
Journal Article
Open access
PDF file
RWRuimin Wang
Ruimin Wang
HZHanbing Zhang
Hanbing Zhang
MJMengyu Jia
Mengyu Jia
灿刘灿 刘
灿 刘
In the era of the digital economy, data has become a fundamental resource, a critical factor of production, and a key driver of socio-economic development. As the volume of data generated and collected increases, issues concerning data security and privacy protection have gained widespread attention. To enhance data security during storage and retrieval, this study proposes an improved ciphertext index construction scheme based on the Verifiable Delay Function (VDF) and Learning with Errors (LWE). The scheme employs k-flat partitioning to organize multidimensional structured data and constructs group-level ciphertext indexes based on attribute coverage values. VDF-generated salts and attribute-specific LWE keys derived through a Key Derivation Function (KDF) are combined with randomized encryption to reduce the correlation leakage associated with deterministic indexes. During retrieval, the server performs homomorphic subtraction on ciphertext indexes, while the client determines equality by comparing the resulting noise with a decision threshold. Role-based access control (RBAC) is incorporated to enforce attribute-level key isolation and unauthorized-access rejection. Experimental results demonstrate that the proposed scheme achieves effective ciphertext equality queries without directly exposing plaintext index values, while maintaining acceptable computational overhead.