Xinhua Suo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xinhua Suo has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Bing Guo
Sichuan University
4 shared publications - Hong Su
Chengdu University of Information Technology, China
2 shared publications - Yaosen Chen
University of Electronic Science and Technology of China Chengdu China
2 shared publications - Chuanfeng Zhang
School of Computer Science, Chengdu University of Information Technology, Chengdu, China
1 shared publication - Haichuan Zhang
School of Computer Science, Chengdu University of Information Technology, Chengdu, China
1 shared publication Renshuang Zhou
College of Computer Science, Sichuan University, Chengdu, China
1 shared publication
Latest Publications
- 2 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (13) , 23384-23397
Lifecycle Optimization of Smart Contract for Different Scenarios in 6G Network
In the rapidly evolving landscape of the sixth generation (6G) network, smart contracts emerge as a pivotal technology for enforcing trustful rules. However, the conventional lifecycle model of smart contracts – encompassing stages from initiation to the termination of a contract instance – suffers from rigidity and lack of customization, leading to notable operational challenges. These challenges primarily manifest as heightened resource demands, including longer waiting periods and escalated transaction costs, which hinder the adaptability of smart contracts in the varied and dynamic contexts of 6Gconnected environments. Driven by these issues, this paper conducts a comprehensive analysis of the smart contract lifecycle.We introduce an innovative lifecycle model that offers customizable flexibility, allowing for the merging or separation of different stages in the smart contract process. Meanwhile, we propose a unique transaction data structure designed to integrate parameters of combined stages, each marked with distinct identifiers for differentiation. Further, we introduce an innovative address scheme for smart contract instances, which provides an identifier to simplify instance access while also maintaining a mechanism for traditional access methods. The verification results show that the model can save 52.72% of processing fee and 68.09% of completion time compared with the conventional method.
- 2 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (13) , 23384-23397
Lifecycle Optimization of Smart Contract for Different Scenarios in 6G Network
In the rapidly evolving landscape of the sixth generation (6G) network, smart contracts emerge as a pivotal technology for enforcing trustful rules. However, the conventional lifecycle model of smart contracts – encompassing stages from initiation to the termination of a contract instance – suffers from rigidity and lack of customization, leading to notable operational challenges. These challenges primarily manifest as heightened resource demands, including longer waiting periods and escalated transaction costs, which hinder the adaptability of smart contracts in the varied and dynamic contexts of 6Gconnected environments. Driven by these issues, this paper conducts a comprehensive analysis of the smart contract lifecycle.We introduce an innovative lifecycle model that offers customizable flexibility, allowing for the merging or separation of different stages in the smart contract process. Meanwhile, we propose a unique transaction data structure designed to integrate parameters of combined stages, each marked with distinct identifiers for differentiation. Further, we introduce an innovative address scheme for smart contract instances, which provides an identifier to simplify instance access while also maintaining a mechanism for traditional access methods. The verification results show that the model can save 52.72% of processing fee and 68.09% of completion time compared with the conventional method.
- 1 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (22) , 19810-19824
Blockchain Exchange Optimization by Graph Partition and Merging in IoT Scenarios
Blockchain exchanges have been widely used for IoT-based resource sharing. An exchange consists of several related transactions where participants exchange their assets. However, the exchange can take a long time to complete due to different reasons (such as IoT device failure). Meanwhile, exchange fees are an important aspect, because an exchange usually contains multiple transactions, and the exchange fee is the sum of the fees for each transaction. In this paper, we explore ways to optimize the exchange process concerning the above issues. The method is based on the graph of an exchange, which is strongly connected. To save exchange time, we propose a way to split the exchange into smaller exchanges, since smaller exchanges have fewer transactions. The method first finds strongly connected sub graphs, separates them from the original graph, and adjusts the edges and their weights. To save transaction fees, we propose a method to reduce the number of transactions. Transactions that meet certain requirements are combined into one transaction, and corresponding weights are adjusted. The verification results show that the proposed method can optimize the exchange process, which can be used to save the exchange time and also can be used to save transaction fees.
- 1 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (22) , 19810-19824
Blockchain Exchange Optimization by Graph Partition and Merging in IoT Scenarios
Blockchain exchanges have been widely used for IoT-based resource sharing. An exchange consists of several related transactions where participants exchange their assets. However, the exchange can take a long time to complete due to different reasons (such as IoT device failure). Meanwhile, exchange fees are an important aspect, because an exchange usually contains multiple transactions, and the exchange fee is the sum of the fees for each transaction. In this paper, we explore ways to optimize the exchange process concerning the above issues. The method is based on the graph of an exchange, which is strongly connected. To save exchange time, we propose a way to split the exchange into smaller exchanges, since smaller exchanges have fewer transactions. The method first finds strongly connected sub graphs, separates them from the original graph, and adjusts the edges and their weights. To save transaction fees, we propose a method to reduce the number of transactions. Transactions that meet certain requirements are combined into one transaction, and corresponding weights are adjusted. The verification results show that the proposed method can optimize the exchange process, which can be used to save the exchange time and also can be used to save transaction fees.
- 6 April 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (15) , 17864-17880
Video summarization with u-shaped transformer
- 6 April 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (15) , 17864-17880
Video summarization with u-shaped transformer
- 12 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 32 (5) , 2962-2975
Capsule Boundary Network With 3D Convolutional Dynamic Routing for Temporal Action Detection
Temporal action detection is a challenging task in video understanding, due to the complexity of the background and rich action content impacting high-quality temporal proposals generation in untrimmed videos. Capsule networks can avoid some limitations of the invariance caused by pooling and inability from convolutional neural networks, which can better understand the temporal relations for temporal action detection. However, because of the extremely computationally expensive procedure, capsule network is difficult to be applied to the task of temporal action detection. To address this issue, this paper proposes a novel U-shaped capsule network framework with a k-Nearest Neighbor (k-NN) mechanism of 3D convolutional dynamic routing, which we named U-BlockConvCaps. Furthermore, we build a Capsules Boundary Network (CapsBoundNet) based on U-BlockConvCaps for dense temporal action proposal generation. Specifically, the first module is one 1D convolutional layer for fusing the two-stream with RGB and optical flow video features. The sampling module further processes the fused features to generate the 2D start-end action proposal feature maps. Then, the multi-scale U-Block convolutional capsule module with 3D convolutional dynamic routing is used to process the proposal feature map. Finally, the feature maps generated from the CapsBoundNet are used to predict starting, ending, action classification, and action regression score maps, which help to capture the boundary and intersection over union features. Our work innovatively improves the dynamic routing algorithm of capsule networks and extends the use of capsule networks to the temporal action detection task for the first time in the literature. The experimental results on benchmarks THUMOS14 show that the performance of CapsBoundNet is obviously beyond the state-of-the-art methods, e.g., the mAP@tIoU = 0.3, 0.4, 0.5 on THUMOS14 are improved from 63.6% to 70.0%, 57.8% to 63.1%, 51.3% to 52.9%, respectively. We also got competitive results on the action detection dataset of ActivityNet1.3.
- 12 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 32 (5) , 2962-2975
Capsule Boundary Network With 3D Convolutional Dynamic Routing for Temporal Action Detection
Temporal action detection is a challenging task in video understanding, due to the complexity of the background and rich action content impacting high-quality temporal proposals generation in untrimmed videos. Capsule networks can avoid some limitations of the invariance caused by pooling and inability from convolutional neural networks, which can better understand the temporal relations for temporal action detection. However, because of the extremely computationally expensive procedure, capsule network is difficult to be applied to the task of temporal action detection. To address this issue, this paper proposes a novel U-shaped capsule network framework with a k-Nearest Neighbor (k-NN) mechanism of 3D convolutional dynamic routing, which we named U-BlockConvCaps. Furthermore, we build a Capsules Boundary Network (CapsBoundNet) based on U-BlockConvCaps for dense temporal action proposal generation. Specifically, the first module is one 1D convolutional layer for fusing the two-stream with RGB and optical flow video features. The sampling module further processes the fused features to generate the 2D start-end action proposal feature maps. Then, the multi-scale U-Block convolutional capsule module with 3D convolutional dynamic routing is used to process the proposal feature map. Finally, the feature maps generated from the CapsBoundNet are used to predict starting, ending, action classification, and action regression score maps, which help to capture the boundary and intersection over union features. Our work innovatively improves the dynamic routing algorithm of capsule networks and extends the use of capsule networks to the temporal action detection task for the first time in the literature. The experimental results on benchmarks THUMOS14 show that the performance of CapsBoundNet is obviously beyond the state-of-the-art methods, e.g., the mAP@tIoU = 0.3, 0.4, 0.5 on THUMOS14 are improved from 63.6% to 70.0%, 57.8% to 63.1%, 51.3% to 52.9%, respectively. We also got competitive results on the action detection dataset of ActivityNet1.3.