Tiezheng Nie

Mr. Tiezheng Nie

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
12 December 2022 in IEEE Access
Verified
Journal Article
Open access
HMHanyu Mao
Hanyu Mao
TNTiezheng Nie
Tiezheng Nie
HSHao Sun
Hao Sun
DSDerong Shen
Derong Shen
GYGe Yu
Ge Yu
With the continuous development of blockchain technology, many blockchain applications, such as digital currencies in the form of tokens, are deployed. However, due to the lack of data and value inter-blockchain transmission methods, these chain applications form many data islands. Therefore, cross-chain technology is proposed and applied in distributed transaction platforms, digital finance, e-government and many other different fields. Although cross-chain technology just started, the cross-chain technology and its applications are gradually improving to meet the development needs of blockchain system. At the same time, they have already realized asset transfers across heterogeneous blockchains and platforms, and some projects have realized cross-chain information exchange. At present, cross-chain technology includes the following typical methods: Hash-locking, Notary scheme, Distributed private key control, Sidechains/Relays and Tight coupling. This paper analyzes the above methods from the aspect of techniques, security requirements, and technical limitation, and compares their applicability. With public blockchains and consortium blockchains, this paper analyzes their problems and challenges in cross-chain technology and introduces the main approaches of existing solutions. By analyzing the existing cross-chain technologies and problems, this paper further introduces eight popular cross-chain projects and their application prospects. Finally, this paper summarizes and proposes the future research topics and development trends of cross-chain technology.

20 November 2023 in Data Science and Engineering
Verified
Journal Article
Open access
PDF file
CSChenchen Sun
Chenchen Sun
YNYan Ning
Yan Ning
DSDerong Shen
Derong Shen
TNTiezheng Nie
Tiezheng Nie
An accurate short-term load forecasting plays an important role in modern power system’s operation and economic development. However, short-term load forecasting is affected by multiple factors, and due to the complexity of the relationships between factors, the graph structure in this task is unknown. On the other hand, existing methods do not fully aggregating data information through the inherent relationships between various factors. In this paper, we propose a short-term load forecasting framework based on graph neural networks and dilated 1D-CNN, called GLFN-TC. GLFN-TC uses the graph learning module to automatically learn the relationships between variables to solve problem with unknown graph structure. GLFN-TC effectively handles temporal and spatial dependencies through two modules. In temporal convolution module, GLFN-TC uses dilated 1D-CNN to extract temporal dependencies from historical data of each node. In densely connected residual convolution module, in order to ensure that data information is not lost, GLFN-TC uses the graph convolution of densely connected residual to make full use of the data information of each graph convolution layer. Finally, the predicted values are obtained through the load forecasting module. We conducted five studies to verify the outperformance of GLFN-TC. In short-term load forecasting, using MSE as an example, the experimental results of GLFN-TC decreased by 0.0396, 0.0137, 0.0358, 0.0213 and 0.0337 compared to the optimal baseline method on ISO-NE, AT, AP, SH and NCENT datasets, respectively. Results show that GLFN-TC can achieve higher prediction accuracy than the existing common methods.

17 September 2021
Verified
Book Chapter
Closed access
PDF file
SJShixian Jiang
Shixian Jiang
TNTiezheng Nie
Tiezheng Nie
DSDerong Shen
Derong Shen
YKYue Kou
Yue Kou
GYGe Yu
Ge Yu


19 August 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
HMHanyu Mao
Hanyu Mao
TNTiezheng Nie
Tiezheng Nie
MYMinghe Yu
Minghe Yu
XDXiaomei Dong
Xiaomei Dong
XLXiaohua Li
Xiaohua Li
GYGe Yu
Ge Yu
We propose an innovative approach called SMPTC3, designed specifically to enhance security and privacy in cross-chain transaction verification. This approach addresses multi-chain, multi-participant information exchange and large-scale cross-chain transfers, resisting various types of malicious attacks. We leverage the verifiability of cross-chain transactions based on smart contracts and innovatively transform transaction information into confidential sets, organizing them into quadratic secret polynomials. By utilizing secret sharing and random distribution techniques, we construct a secure multiparty computation method, tailored for cross-chain transactions. To enhance the efficiency of cross-chain transactions, we introduce cross-chain batch processing technology, grouping inter-chain transactions into cross-chain transaction sets. Unlike traditional distributed notary technologies, SMPTC3 designates honest participants as a cross-chain notary group, reducing the time required for redundant signature confirmations and significantly lowering the possibility of malicious notaries. Theoretical analysis and empirical experiments demonstrate that SMPTC3 is highly efficient in addressing cross-chain transaction security issues.

21 October 2024
Verified
Conference Paper
Open access
WDWenzhou Dou
Wenzhou Dou
DSDerong Shen
Derong Shen
XZXiangmin Zhou
Xiangmin Zhou
HBHui Bai
Hui Bai
YKYue Kou
Yue Kou
GYGe Yu
Ge Yu
Deep entity resolution (ER) identifies matching entities across data sources using techniques based on deep learning. It involves two steps: a blocker for identifying the potential matches to generate the candidate pairs, and a matcher for accurately distinguishing the matches and non-matches among these candidate pairs. Recent deep ER approaches utilize pretrained language models (PLMs) to extract similarity features for blocking and matching, achieving state-of-the-art performance. However, they often fail to balance the consensus and discrepancy between the blocker and matcher, emphasizing the consensus while neglecting the discrepancy. This paper proposes MutualER, a deep entity resolution framework that integrates and jointly trains the blocker and matcher, balancing both the consensus and discrepancy between them. Specifically, we firstly introduce a lightweight PLM in siamese structure for the blocker and a heavier PLM in cross structure or an autoregressive large language model (LLM) for the matcher. Two optimization techniques named Mutual Sample Selection (MSS) and Similarity Knowledge Transferring (SKT) are designed to jointly train the blocker and matcher. MSS enables the blocker and matcher to mutually select the customized training samples for each other to maintain the discrepancy, while SKT allows them to share the similarity knowledge for improving their blocking and matching capabilities respectively to maintain the consensus. Extensive experiments on five datasets demonstrate that MutualER significantly outperforms existing PLM-based and LLM-based approaches, achieving leading performance in both effectiveness and efficiency.