Tiaojuan Ren
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tiaojuan Ren has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Meng Han
Zhejiang University
3 shared publications - Yourong Chen
Zhejiang Shuren University
3 shared publications - Changchun Yang
Changzhou University
2 shared publications - Olga Nedzvedz
Belarusian State Medical University, Minsk, Belarus
2 shared publications - Yang Zhang
School of Computer Science, Hangzhou Dianzi University, Hangzhou, China
2 shared publications A. Nedzvedz
Belarusian State University, Minsk, Belarus
1 shared publication
Latest Publications
- 14 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (22) , 37170-37186
A Large-Scale Node Lightweight Consensus Algorithm of Blockchain for Internet of Things
In order to solve the problems in the blockchain consensus algorithm such as slow consensus speed, high resource consumption, and low consensus security due to excessive large-scale node data volume and Byzantine attacks in the Internet of Things system, we propose a large-scale node lightweight consensus algorithm of blockchain for Internet of Things (LNLCA). Firstly, a transaction set construction mechanism is proposed to improve consensus efficiency and security. The mechanism packages multiple data monitored by Internet of Things (IoT) nodes into data transactions, and builds the transaction set. Then it constructs non-conflict subsets and conflict subsets. Secondly, an adjacent parent node sampling and response mechanism is proposed to reduce the consumption of communication resources. The new transaction set selects nearby parent nodes based on the time distance summation method and collaborates to batch verify each transaction in the transaction set. Finally, an efficient consistent consensus based on transaction set Direct Acyclic Graph (DAG) is proposed to quickly vote for each transaction in the transaction set, thereby constructing the transaction set DAG for batch uploading to the chain, and achieving a secure and lightweight consensus on IoT data. The experimental results show that no matter how the number of Byzantine nodes changes, LNLCA can improve transaction throughput, and reduce transaction delay and communication overhead, which outperforms the CDBFT, Avalanche, and Hashgraph.
- 14 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (22) , 37170-37186
A Large-Scale Node Lightweight Consensus Algorithm of Blockchain for Internet of Things
In order to solve the problems in the blockchain consensus algorithm such as slow consensus speed, high resource consumption, and low consensus security due to excessive large-scale node data volume and Byzantine attacks in the Internet of Things system, we propose a large-scale node lightweight consensus algorithm of blockchain for Internet of Things (LNLCA). Firstly, a transaction set construction mechanism is proposed to improve consensus efficiency and security. The mechanism packages multiple data monitored by Internet of Things (IoT) nodes into data transactions, and builds the transaction set. Then it constructs non-conflict subsets and conflict subsets. Secondly, an adjacent parent node sampling and response mechanism is proposed to reduce the consumption of communication resources. The new transaction set selects nearby parent nodes based on the time distance summation method and collaborates to batch verify each transaction in the transaction set. Finally, an efficient consistent consensus based on transaction set Direct Acyclic Graph (DAG) is proposed to quickly vote for each transaction in the transaction set, thereby constructing the transaction set DAG for batch uploading to the chain, and achieving a secure and lightweight consensus on IoT data. The experimental results show that no matter how the number of Byzantine nodes changes, LNLCA can improve transaction throughput, and reduce transaction delay and communication overhead, which outperforms the CDBFT, Avalanche, and Hashgraph.
- Open Access
- 22 December 2023
- Published by MDPI AG in Mathematics
- Vol. 12 (1) , 43
An Adaptive Low Computational Cost Alternating Direction Method of Multiplier for RELM Large-Scale Distributed Optimization
In a class of large-scale distributed optimization, the calculation of RELM based on the Moore–Penrose inverse matrix is prohibitively expensive, which hinders the formulation of a computationally efficient optimization model. Attempting to improve the model’s convergence performance, this paper proposes a low computing cost Alternating Direction Method of Multipliers (ADMM), where the original update in ADMM is solved inexactly with approximate curvature information. Based on quasi-Newton techniques, the ADMM approach allows us to solve convex optimization with reasonable accuracy and computational effort. By introducing this algorithm into the RELM model, the model fitting problem can be decomposed into a set of subproblems that can be executed in parallel to achieve efficient classification performance. To avoid the storage of expensive Hessian for large problems, BFGS with limited memory is proposed with computational efficiency. And the optimal parameter values of the step-size search method are obtained through Wolfe line search strategy. To demonstrate the superiority of our methods, numerical experiments are conducted on eight real-world datasets. Results on problems arising in machine learning suggest that the proposed method is competitive with other similar methods, both in terms of better computational efficiency as well as accuracy.
- 22 December 2023
- Published by MDPI AG in Mathematics
- Vol. 12 (1) , 43
Open AccessAn Adaptive Low Computational Cost Alternating Direction Method of Multiplier for RELM Large-Scale Distributed Optimization
In a class of large-scale distributed optimization, the calculation of RELM based on the Moore–Penrose inverse matrix is prohibitively expensive, which hinders the formulation of a computationally efficient optimization model. Attempting to improve the model’s convergence performance, this paper proposes a low computing cost Alternating Direction Method of Multipliers (ADMM), where the original update in ADMM is solved inexactly with approximate curvature information. Based on quasi-Newton techniques, the ADMM approach allows us to solve convex optimization with reasonable accuracy and computational effort. By introducing this algorithm into the RELM model, the model fitting problem can be decomposed into a set of subproblems that can be executed in parallel to achieve efficient classification performance. To avoid the storage of expensive Hessian for large problems, BFGS with limited memory is proposed with computational efficiency. And the optimal parameter values of the step-size search method are obtained through Wolfe line search strategy. To demonstrate the superiority of our methods, numerical experiments are conducted on eight real-world datasets. Results on problems arising in machine learning suggest that the proposed method is competitive with other similar methods, both in terms of better computational efficiency as well as accuracy.
- Open Access
A Novel Data-Driven Evaluation Framework for Fork after Withholding Attack in Blockchain Systems
In the blockchain system, mining pools are popular for miners to work collectively and obtain more revenue. Nowadays, there are consensus attacks that threaten the efficiency and security of mining pools. As a new type of consensus attack, the Fork After Withholding (FAW) attack can cause huge economic losses to mining pools. Currently, there are a few evaluation tools for FAW attacks, but it is still difficult to evaluate the FAW attack protection capability of target mining pools. To address the above problem, this paper proposes a novel evaluation framework for FAW attack protection of the target mining pools in blockchain systems. In this framework, we establish the revenue model for mining pools, including honest consensus revenue, block withholding revenue, successful fork revenue, and consensus cost. We also establish the revenue functions of target mining pools and other mining pools, respectively. In particular, we propose an efficient computing power allocation optimization algorithm (CPAOA) for FAW attacks against multiple target mining pools. We propose a model-solving algorithm based on improved Aquila optimization by improving the selection mechanism in different optimization stages, which can increase the convergence speed of the model solution and help find the optimal solution in computing power allocation. Furthermore, to greatly reduce the possibility of falling into local optimal solutions, we propose a solution update mechanism that combines the idea of scout bees in an artificial bee colony optimization algorithm and the constraint of allocating computing power. The experimental results show that the framework can effectively evaluate the revenue of various mining pools. CPAOA can quickly and accurately allocate the computing power of FAW attacks according to the computing power of the target mining pool. Thus, the proposed evaluation framework can effectively help evaluate the FAW attack protection capability of multiple target mining pools and ensure the security of the blockchain system.
Open AccessA Novel Data-Driven Evaluation Framework for Fork after Withholding Attack in Blockchain Systems
In the blockchain system, mining pools are popular for miners to work collectively and obtain more revenue. Nowadays, there are consensus attacks that threaten the efficiency and security of mining pools. As a new type of consensus attack, the Fork After Withholding (FAW) attack can cause huge economic losses to mining pools. Currently, there are a few evaluation tools for FAW attacks, but it is still difficult to evaluate the FAW attack protection capability of target mining pools. To address the above problem, this paper proposes a novel evaluation framework for FAW attack protection of the target mining pools in blockchain systems. In this framework, we establish the revenue model for mining pools, including honest consensus revenue, block withholding revenue, successful fork revenue, and consensus cost. We also establish the revenue functions of target mining pools and other mining pools, respectively. In particular, we propose an efficient computing power allocation optimization algorithm (CPAOA) for FAW attacks against multiple target mining pools. We propose a model-solving algorithm based on improved Aquila optimization by improving the selection mechanism in different optimization stages, which can increase the convergence speed of the model solution and help find the optimal solution in computing power allocation. Furthermore, to greatly reduce the possibility of falling into local optimal solutions, we propose a solution update mechanism that combines the idea of scout bees in an artificial bee colony optimization algorithm and the constraint of allocating computing power. The experimental results show that the framework can effectively evaluate the revenue of various mining pools. CPAOA can quickly and accurately allocate the computing power of FAW attacks according to the computing power of the target mining pool. Thus, the proposed evaluation framework can effectively help evaluate the FAW attack protection capability of multiple target mining pools and ensure the security of the blockchain system.
- Open Access
FAWPA: A FAW Attack Protection Algorithm Based on the Behavior of Blockchain Miners
Blockchain has become one of the key techniques for the security of the industrial internet. However, the blockchain is vulnerable to FAW (Fork after Withholding) attacks. To protect the industrial internet from FAW attacks, this paper proposes a novel FAW attack protection algorithm (FAWPA) based on the behavior of blockchain miners. Firstly, FAWPA performs miner data preprocessing based on the behavior of the miners. Then, FAWPA proposes a behavioral reward and punishment mechanism and a credit scoring model to obtain cumulative credit value with the processed data. Moreover, we propose a miner’s credit classification mechanism based on fuzzy C-means (FCM), which combines the improved Aquila optimizer (AO) with strong solving ability. That is, FAWPA combines the miner’s accumulated credit value and multiple attack features as the basis for classification, and optimizes cluster center selection by simulating Aquila’s predation behavior. It can improve the solution update mechanism in different optimization stages. FAWPA can realize the rapid classification of miners’ credit levels by improving the speed of identifying malicious miners. To evaluate the protective effect of the target mining pool, FAWPA finally establishes a mining pool and miner revenue model under FAW attack. The simulation results show that FAWPA can thoroughly and efficiently detect malicious miners in the target mining pool. FAWPA also improves the recall rate and precision rate of malicious miner detection, and it improves the cumulative revenue of the target mining pool. The proposed algorithm performs better than ND, RSCM, AWRS, and ICRDS.
Open AccessFAWPA: A FAW Attack Protection Algorithm Based on the Behavior of Blockchain Miners
Blockchain has become one of the key techniques for the security of the industrial internet. However, the blockchain is vulnerable to FAW (Fork after Withholding) attacks. To protect the industrial internet from FAW attacks, this paper proposes a novel FAW attack protection algorithm (FAWPA) based on the behavior of blockchain miners. Firstly, FAWPA performs miner data preprocessing based on the behavior of the miners. Then, FAWPA proposes a behavioral reward and punishment mechanism and a credit scoring model to obtain cumulative credit value with the processed data. Moreover, we propose a miner’s credit classification mechanism based on fuzzy C-means (FCM), which combines the improved Aquila optimizer (AO) with strong solving ability. That is, FAWPA combines the miner’s accumulated credit value and multiple attack features as the basis for classification, and optimizes cluster center selection by simulating Aquila’s predation behavior. It can improve the solution update mechanism in different optimization stages. FAWPA can realize the rapid classification of miners’ credit levels by improving the speed of identifying malicious miners. To evaluate the protective effect of the target mining pool, FAWPA finally establishes a mining pool and miner revenue model under FAW attack. The simulation results show that FAWPA can thoroughly and efficiently detect malicious miners in the target mining pool. FAWPA also improves the recall rate and precision rate of malicious miner detection, and it improves the cumulative revenue of the target mining pool. The proposed algorithm performs better than ND, RSCM, AWRS, and ICRDS.
- Open Access
- 28 January 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (13) , 14693-14710
Edge-enhanced dual discriminator generative adversarial network for fast MRI with parallel imaging using multi-view information
In clinical medicine, magnetic resonance imaging (MRI) is one of the most important tools for diagnosis, triage, prognosis, and treatment planning. However, MRI suffers from an inherent slow data acquisition process because data is collected sequentially in k-space. In recent years, most MRI reconstruction methods proposed in the literature focus on holistic image reconstruction rather than enhancing the edge information. This work steps aside this general trend by elaborating on the enhancement of edge information. Specifically, we introduce a novel parallel imaging coupled dual discriminator generative adversarial network (PIDD-GAN) for fast multi-channel MRI reconstruction by incorporating multi-view information. The dual discriminator design aims to improve the edge information in MRI reconstruction. One discriminator is used for holistic image reconstruction, whereas the other one is responsible for enhancing edge information. An improved U-Net with local and global residual learning is proposed for the generator. Frequency channel attention blocks (FCA Blocks) are embedded in the generator for incorporating attention mechanisms. Content loss is introduced to train the generator for better reconstruction quality. We performed comprehensive experiments on Calgary-Campinas public brain MR dataset and compared our method with state-of-the-art MRI reconstruction methods. Ablation studies of residual learning were conducted on the MICCAI13 dataset to validate the proposed modules. Results show that our PIDD-GAN provides high-quality reconstructed MR images, with well-preserved edge information. The time of single-image reconstruction is below 5ms, which meets the demand of faster processing.
- 28 January 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (13) , 14693-14710
Open AccessEdge-enhanced dual discriminator generative adversarial network for fast MRI with parallel imaging using multi-view information
In clinical medicine, magnetic resonance imaging (MRI) is one of the most important tools for diagnosis, triage, prognosis, and treatment planning. However, MRI suffers from an inherent slow data acquisition process because data is collected sequentially in k-space. In recent years, most MRI reconstruction methods proposed in the literature focus on holistic image reconstruction rather than enhancing the edge information. This work steps aside this general trend by elaborating on the enhancement of edge information. Specifically, we introduce a novel parallel imaging coupled dual discriminator generative adversarial network (PIDD-GAN) for fast multi-channel MRI reconstruction by incorporating multi-view information. The dual discriminator design aims to improve the edge information in MRI reconstruction. One discriminator is used for holistic image reconstruction, whereas the other one is responsible for enhancing edge information. An improved U-Net with local and global residual learning is proposed for the generator. Frequency channel attention blocks (FCA Blocks) are embedded in the generator for incorporating attention mechanisms. Content loss is introduced to train the generator for better reconstruction quality. We performed comprehensive experiments on Calgary-Campinas public brain MR dataset and compared our method with state-of-the-art MRI reconstruction methods. Ablation studies of residual learning were conducted on the MICCAI13 dataset to validate the proposed modules. Results show that our PIDD-GAN provides high-quality reconstructed MR images, with well-preserved edge information. The time of single-image reconstruction is below 5ms, which meets the demand of faster processing.
- 1 October 2021
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 31 (4) , 775-785
Reconstruction of the Volume of Affected Lymph Nodes on Positron Emission and Computed Tomography Images
Combining images obtained by different medical imaging methods makes it possible to correctly detect tumors in lymph nodes and determine their type. The main difficulty is to correctly combine the images, accurately segment objects on them, and construct their volumetric images, taking into account the parameters of each set of images. The paper proposes an algorithm for visualizing complex objects and tumors on medical images. It can determine tumor volume and provide an individual approach to modeling the shape of the radiation field when planning radiation therapy.
- 1 October 2021
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 31 (4) , 775-785
Reconstruction of the Volume of Affected Lymph Nodes on Positron Emission and Computed Tomography Images
Combining images obtained by different medical imaging methods makes it possible to correctly detect tumors in lymph nodes and determine their type. The main difficulty is to correctly combine the images, accurately segment objects on them, and construct their volumetric images, taking into account the parameters of each set of images. The paper proposes an algorithm for visualizing complex objects and tumors on medical images. It can determine tumor volume and provide an individual approach to modeling the shape of the radiation field when planning radiation therapy.
- 1 January 2021
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 31 (1) , 172-184
Analysis of the Dynamical Biological Objects of Optical Microscopy
We generalize the experience of the applied and theoretical investigations performed in the last 7‒8 years, including the generated algorithms and procedures for analyzing the behavior of the cells’ population as a system of dynamical objects by using a concept of the integral optical flow. We determine the main types of motion which make it possible to separate the key moments of the motion of cells in the population and describe the stages of the cells’ development and their interaction with each other. In order to describe the motion based on the integral optical flow, we generate maps which make possible to determine the moment at which the state starts to change and classify the main types of motion in the cells’ population: directed motion, aggregation (cells motion towards each other), dispersion (cells’ motion in different directions with respect to the common center), division (formation of several new cells in the place where the old one was), and apoptosis (cell destruction). We develop the algorithms for analyzing cells’ motion by using the integral optical flow. The generated procedure is intended for nondestructively checking the development of the cells’ population and it can be used in automatic systems of cell engineering. The procedure based on integral optical flow analysis and motion maps makes it possible to monitor the development of the cells’ population at the new level by considering the interaction of cells.
- 1 January 2021
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 31 (1) , 172-184
Analysis of the Dynamical Biological Objects of Optical Microscopy
We generalize the experience of the applied and theoretical investigations performed in the last 7‒8 years, including the generated algorithms and procedures for analyzing the behavior of the cells’ population as a system of dynamical objects by using a concept of the integral optical flow. We determine the main types of motion which make it possible to separate the key moments of the motion of cells in the population and describe the stages of the cells’ development and their interaction with each other. In order to describe the motion based on the integral optical flow, we generate maps which make possible to determine the moment at which the state starts to change and classify the main types of motion in the cells’ population: directed motion, aggregation (cells motion towards each other), dispersion (cells’ motion in different directions with respect to the common center), division (formation of several new cells in the place where the old one was), and apoptosis (cell destruction). We develop the algorithms for analyzing cells’ motion by using the integral optical flow. The generated procedure is intended for nondestructively checking the development of the cells’ population and it can be used in automatic systems of cell engineering. The procedure based on integral optical flow analysis and motion maps makes it possible to monitor the development of the cells’ population at the new level by considering the interaction of cells.