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

Shimin Wei

dblp:59/610 · DBLP profile ↗
← Back
15ranked-venue papers
2as first author
9since 2021 · last 2026
0000-0002-6081-7229ORCID · corroborated

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

Artificial intelligence and machine learning · 7 · 5 since 2021Applied, interdisciplinary, general and emerging computing · 4 · 1 first-author · 2 since 2021Systems, architecture and hardware · 3 · 3 since 2021Theory of computation · 2 · 1 first-authorComputer networks · 1 · 1 since 2021Security and privacy · 1Databases, data management, data science and information retrieval · 1

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
3 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences
linear complexity
0.132002
A fast algorithm for determining the minimal polynomial where of a sequence with period 2pn over GF(q) · IEEE Trans. Inf. Theory 2002
A fast algorithm for determining the linear complexity of a binary sequence with period 2npm · Sci. China Ser. F Inf. Sci. 2001
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q) · IEEE Trans. Inf. Theory 2000
Coding theory › sequences
sequences over finite fields
0.022002
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q) · IEEE Trans. Inf. Theory 2000
A fast algorithm for determining the minimal polynomial where of a sequence with period 2pn over GF(q) · IEEE Trans. Inf. Theory 2002
Coding theory › sequences › linear complexity
minimal polynomials
0.012002
A fast algorithm for determining the minimal polynomial where of a sequence with period 2pn over GF(q) · IEEE Trans. Inf. Theory 2002
Coding theory › sequences
binary sequences
0.012001
A fast algorithm for determining the linear complexity of a binary sequence with period 2npm · Sci. China Ser. F Inf. Sci. 2001

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

fast algorithms · 0.0
YearPublicationVenuePosition
2026 Study on Optimization of Automatic Kidney Suture Strategies Based on Wound Conditions and Suture Paths
abstract
Objective: Whether it is manual suture or robotic automatic suture, the suture parameters of the kidney directly determine the recovery effect of the wound. However, there is a lack of quantitative research. The purpose of this paper is to reveal the influence of the different suture methods on the effect of the suture operation. Methods: Firstly, an editable three-dimensional model of the kidney was established using CT images. Subsequently, wounds were incised on the surface of the kidney entity and sutures were embedded. Secondly, the ABAQUS software was utilized to conduct a simulation analysis of the suturing process. Thirdly, experiments on the ex vivo porcine renal specimens were sutured manually in parallel to the simulation analysis. Meanwhile, the different tensile forces, under suture intervals, various wound conditions, and suturing methods, were measured to derive the tensile force values. Finally, a comparative study of finite element analysis and specimen experiments was performed. Results: The results showed that the 5 mm suture interval and the internal figure-of-eight suture are the optimal choice for suture and the suture of circular wounds is more difficult than elliptical wounds and rectangular wounds, the tensile force is around 0.3-0.5 N. Conclusion: This paper presents the variation law of the tensile force for different wounds and provides the optimal suturing method for both manual and robotic autonomous suturing. Significance: By revealing the influence of different suture methods and providing the optimal suturing method, it can contribute to improving the suture operation effect and promoting the development of suture technology.
Sikai Wang, Xiangyan Zhang, Yadong Mo, Guangyao Luo, Peng Su 0002, Lutao Yan, Shimin Wei
IEEE Trans Autom. Sci. Eng.8
2025 MASEC: Multi-dimensional Adaptive Signal Essence Capturing Framework for Real-Time Signal Analysis in Power System
Shaohua Yong, Qingze Huang, Xiangyan Zhang, Shimin Wei
ICIC (17)6
2025 Edge-Guided Lighting Adaptation: Real-Time Detection of Transparent Objects for Cell Culture Robot
abstract
In robot-assisted cell culture tasks, fluctuations in lighting conditions can result in blurred boundaries, intensified reflections, and pronounced refractions of transparent objects. These optical phenomena collectively escalate the complexity of image processing and target recognition. To address these challenges, this paper takes a dual-strategy approach. Firstly, it utilizes the Unity platform to construct a synthetic dataset (STTO-9k) containing 9,000 images of six types of transparent objects, providing abundant training samples for the detection and recognition of transparent objects. Secondly, it proposes an improved YOLOv8 visual detection algorithm (YOLO-Edge-Guided Lighting Adaptation, YL-EGLA). The algorithm realizes feature fusion by dynamically extracting the high-dimensional features of the input through the self-attention mechanism combined with the enhanced edge features extracted by the edge detection operator, and is equipped with adaptive image enhancement module to ensure stable detection under different lighting conditions. Algorithm comparison results demonstrate that the YL-EGLA can be fully trained on the synthetic dataset and directly applied to real-world scenarios without additional fine-tuning. Furthermore, physical experiments further validate the efficiency and practicality of this algorithm in transparent object manipulation, fully showcasing its significant value in practical applications.
Qingze Huang, Xiangyan Zhang, Shimin Wei
IROS5
2025 Micro-UAV with Ant-Inspired Bistable Gripper for Adaptive Perching and Wildlife Detection
abstract
With the global ecological environment facing continuous deterioration, effective monitoring of arboreal birds in complex canopy environments remains challenging due to limitations of conventional drones in endurance, size, and habitat disturbance. To address these challenges, this paper presents an ant-inspired micro quadrotor UAV equipped with a lightweight bistable gripper system mimicking the mandibular morphology of leafcutter ants. The design integrates shape memory alloy (SMA)-driven actuation and thermoplastic polyurethane (TPU)-based adaptive grippers, enabling rapid deformation (71 ms switching time) and energy-efficient operation (zero power consumption during perching). Experimental results demonstrate exceptional adaptability in grasping irregular objects (e.g., branches, pen caps) with an 8:1 payload-to-weight ratio. Field tests confirm stable navigation through dense foliage and reliable perching at heights exceeding 5 meters. The system’s compact dimensions (7 cm diameter, 70.5 g weight) and biomimetic approach offer a non-invasive solution for prolonged wildlife observation. This work advances bistable actuator design by combining bio-inspired structural optimization with rapid energy transition principles, showing potential in agile robotics and environmental sensing.
Yadong Mo, Xuexiu Liang, Yongkang Jiang, Shimin Wei
IROS6
2025 MLR-WM-ViT: Global high-performance classification of mixed-type wafer map defect using a multi-level relay Vision Transformer
Xiangyan Zhang, Xuexiu Liang, Ying Zhang 0086, Shimin Wei
Expert Syst. Appl.5
2023 Gait recognition using free-area transformer networks
Guannan Chen, Shimin Wei
Mach. Vis. Appl.2
2023 Real-World Semantic Grasp Detection Using Ontology Features: Learning to Concentrate on Object Features
Mingshuai Dong, Shimin Wei, Xiuli Yu
Neural Process. Lett.3
2023 YOLOOD: an arbitrary-oriented flexible flat cable detection method in robotic assembly
Mingshuai Dong, Shimin Wei, Xiuli Yu
J. Supercomput.3
2021 MASK-GD segmentation based robotic grasp detection
Mingshuai Dong, Shimin Wei, Xiuli Yu, Jianqin Yin
Comput. Commun.2
2020 Certificate-Based Encryption Resilient to Continual Leakage in the Standard Model
abstract
The security for many certificate-based encryption schemes was considered under the ideal condition, where the attackers rarely have the secret state for the solutions. However, with a side-channel attack, attackers can obtain partial secret values of the schemes. In order to make the scheme more practical, the security model for the certificate-based encryption which is resilient to continual leakage is first formalized. The attackers in the security model are permitted to get some secret information continuously through the side-channel attack. Based on the certificate-based key encapsulation scheme, a novel certificate-based encryption scheme is proposed, which is resilient to the continual leakage. In the standard model, the new scheme we propose is proved to be secure under the decisional truncated q-augmented bilinear Diffie–Hellman exponent hard problem and the decisional 1-bilinear Diffie–Hellman inversion hard problem. Additionally, the new scheme can resist the chosen-ciphertext attack. Moreover, a comparison is performed with other related schemes, where the proposed solution further considers the continual leakage-resilient property and exhibits less computation cost.
Yuyan Guo, Jiguo Li 0001, Shimin Wei
Secur. Commun. Networks5
2019 Crowd-Counting through a Cascaded, Multi-Task Convolutional Neural Network
abstract
Deep learning is one of the most popular technologies and research areas in machine learning. Convolutional Neural Networks (CNNs) are a typical artificial neural network underpinning deep learning. They have been used in many fields including image recognition, natural language process, and through games such as AlphaGo. A CNN has many advantages such as efficient feature extraction, the simplicity of data format required and the small number of (hyper-)parameters that are required. This paper focuses on a particular application of deep learning: crowd counting. To address this, we apply a Multi-task, Cascaded Convolutional Neural Network (MTCNN). Compared to other models, this model has a good performance and requires a shorter inference time, with shallower network structure and smaller size. In order to demonstrate the value and feasibility of the technology and provide a friendly operating environment for users, the application was realised on both the iOS and Android platforms. A web platform was also developed to visualize the real-time data using a Firebase server.
Xinrui Lyu, Richard O. Sinnott, Shimin Wei
BDCAT4
2008 Fuzzy K-means clustering on infrasound sample
abstract
Infrasound is ideally suited to provide essential information of these earthquakes without any invasive measures. This necessitates automatic processing of the data as the captured phenomena need to be sorted before further analysis can be undertaken. Extracting the physical characters of different signals by signal processing such as Fourier Transform and Wavelets Transform are generally employed to carry out the necessary expansion. This article reviews pattern recognition as it applies to earthquake prediction and discusses the concept of fuzzy logic approach as a means of seismic infrasound classification. An example is presented in which this approach was used for classifying preprocessed infrasound signals to identify precursory strong earthquake.
Shimin Wei, Qizheng Liao, Yaqin Xia, Danlin Li, Junzi Li
FUZZ-IEEE2
2002 A fast algorithm for determining the minimal polynomial where of a sequence with period 2pn over GF(q)
abstract
A fast algorithm is presented for determining the linear complexity and the minimal polynomial of a sequence with period 2p/sup n/ over GF (q), where p and q are odd prime, and q is a primitive root (mod p/sup 2/). The algorithm uses the fact that in this case the factorization of x/sup 2p(n)/-1 is especially simple.
Shimin Wei, Guozhen Xiao
IEEE Trans. Inf. Theory1
2001 A fast algorithm for determining the linear complexity of a binary sequence with period 2npm
Shimin Wei, Guozhen Xiao
Sci. China Ser. F Inf. Sci.1
2000 A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)
abstract
A fast algorithm is presented for determining the linear complexity of a sequence with period p/sup n/ over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p/sup 2/).
Guozhen Xiao, Shimin Wei, Kwok-Yan Lam, Kyoki Imamura
IEEE Trans. Inf. Theory2