检索结果-内蒙古大学图书馆

Mining Bytecode Features of Smart Contracts to Detect PonziScheme on Blockchain

Computer Modeling in engineering & Sciences 2021年第6期127卷 1069-1085页

作者： Xiajiong Shen Shuaimin Jiang Lei Zhang Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifeng47500China Institute of Data and Knowledge Engineering Henan UniversityKaifeng47500China School of Computer and Information Engineering Henan UniversityKaifeng47500China

The emergence of smart contracts has increased the attention of industry and academia to blockchain technology,which is tamper-proofing,decentralized,autonomous,and enables decentralized applications to operate in untrustworthy ***,these features of this technology are also easily exploited by unscrupulous individuals,a typical example of which is the Ponzi scheme in *** negative effect of unscrupulous individuals writing Ponzi scheme-type smart contracts in Ethereum and then using these contracts to scam large amounts of money has been *** solve this problem,we propose a detection model for detecting Ponzi schemes in smart contracts using *** this model,our innovation is shown in two aspects:We first propose to use two bytes as one characteristic,which can quickly transform the bytecode into a high-dimensional matrix,and this matrix contains all the implied characteristics in the ***,We innovatively transformed the Ponzi schemes detection into an anomaly detection ***,an anomaly detection algorithm is used to identify Ponzi schemes in smart *** results show that the proposed detection model can greatly improve the accuracy of the detection of the Ponzi scheme ***,the F1-score of this model can reach 0.88,which is far better than those of other traditional detection models.

关键词： Ponzi scheme blockchain security smart contracts anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Phase spectrum based automatic ship detection in synthetic aperture radar images

引用

Journal of Ocean engineering and Science 2021年第2期6卷 185-195页

作者： Miaohui Zhang Baojun Qiao Ming Xin Bo Zhang Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifengChina Institute of Data and Knowledge Engineering Henan UniversityKaifengChina School of Computer Science and Engineering Beihang UniversityBeijingChina

This paper proposes an automatic ship detection approach in Synthetic Aperture Radar(SAR)Images using phase *** proposed method mainly contains two stages:Firstly,sea-land segmentation of SAR Images is one of the key stages for SAR image application such as sea-targets detection and recognition,which are easily detected only in sea *** order to eliminate the influence of land regions in SAR images,a novel land removing method is *** removing method employs a Harris corner detector to obtain some image patches belonging to land,and the probability density function(PDF)of land area can be estimated by these ***,an appropriate land segmentation threshold is accordingly ***,an automatic ship detector based on phase spectrum is *** proposed detector is free from various idealized assumptions and can accurately detect ships in SAR *** results demonstrate the efficiency of the proposed ship detection algorithm in diversified SAR images.

关键词： Ship detection saliency detection phase spectrum sea-land segmentation

来源：评论

学校读者我要写书评

暂无评论

Generative-Contrastive Graph Learning for Recommendation

arXiv

引用

arXiv 2023年

作者： Yang, Yonghui Wu, Zhengwei Wu, Le Zhang, Kun Hong, Richang Zhang, Zhiqiang Zhou, Jun Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China Ant Group China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Center China

By treating users’ interactions as a user-item graph, graph learning models have been widely deployed in Collaborative Filtering (CF) based recommendation. Recently, researchers have introduced Graph Contrastive Learning (GCL) techniques into CF to alleviate the sparse supervision issue, which first constructs contrastive views by data augmentations and then provides self-supervised signals by maximizing the mutual information between contrastive views. Despite the effectiveness, we argue that current GCL-based recommendation models are still limited as current data augmentation techniques, either structure augmentation or feature augmentation. First, structure augmentation randomly dropout nodes or edges, which is easy to destroy the intrinsic nature of the user-item graph. Second, feature augmentation imposes the same scale noise augmentation on each node, which neglects the unique characteristics of nodes on the graph. To tackle the above limitations, we propose a novel Variational Graph Generative-Contrastive Learning (VGCL) framework for recommendation. Specifically, we leverage variational graph reconstruction to estimate a Gaussian distribution of each node, then generate multiple contrastive views through multiple samplings from the estimated distributions, which builds a bridge between generative and contrastive learning. The generated contrastive views can well reconstruct the input graph without information distortion. Besides, the estimated variances are tailored to each node, which regulates the scale of contrastive loss for each node on optimization. Considering the similarity of the estimated distributions, we propose a cluster-aware twofold contrastive learning, a node-level to encourage consistency of a node’s contrastive views and a cluster-level to encourage consistency of nodes in a cluster. Finally, extensive experimental results on three public datasets clearly demonstrate the effectiveness of the proposed model. Copyright © 2023, The Authors.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

knowledge Graph based Mutual Attention for Machine Reading Comprehension over Anti-Terrorism Corpus

引用

data Intelligence 2023年第3期5卷 685-706页

作者： Feng Gao Jin Hou Jinguang Gu Lihua Zhang School of Computer Science and Technology Wuhan University of Science and TechnologyWuhan 430065Hubei The Key Laboratory of Rich-Media Knowledge Organization and Service of Digital Publishing Content Insitute of Scientic and Technical Information of ChinaBeijing 100038China Wuhan University of Science and Technology Big Data Science and Engineering Research Institute Wuhan 430065Hubei Eastchina Jiaotong University Nanchang 330013Jiangxi

Machine reading comprehension has been a research focus in natural language processing and intelligence ***,there is a lack of models and datasets for the MRC tasks in the anti-terrorism ***,current research lacks the ability to embed accurate background knowledge and provide precise *** address these two problems,this paper first builds a text corpus and testbed that focuses on the anti-terrorism domain in a semi-automatic ***,it proposes a knowledge-based machine reading comprehension model that fuses domain-related triples from a large-scale encyclopedic knowledge base to enhance the semantics of the *** eliminate knowledge noise that could lead to semantic deviation,this paper uses a mixed mutual ttention mechanism among questions,passages,and knowledge triples to select the most relevant triples before embedding their semantics into the *** results indicate that the proposed approach can achieve a 70.70%EM value and an 87.91%F1 score,with a 4.23%and 3.35%improvement over existing methods,respectively.

关键词： Machine reading comprehension Anti-terrorism domain knowledge embedding knowledge attention Mutual attention

来源：评论

学校读者我要写书评

暂无评论

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic Constrained Optimization

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic C...

引用

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Bu, Chenyang Liu, Yuxin Zhang, Lizhong Zhu, Tao Luo, Wenjian School of Computer Science and Information Engineering Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Anhui Hefei230027 China School of Computer Science and Information Engineering University of South China Hunan Hengyang421200 China School of Computer Science and Technology Harbin Institute of Technology Guangdong Shenzhen518000 China

ISBN: (纸本)9798350337020

Nature-inspired population-based stochastic search algorithms (SSA) have demonstrated effectiveness in solving many real-world dynamic optimization problems (DOPs), such as dynamic optimal power flow (DOPF) problems. The basic idea of solving DOPs using SSAs is to 'track the moving optima', rather than solving the changed problems from scratch. Its hidden assumption is that the problems are slightly changed in general, and it is expected that the search process can be accelerated by learning from past search experiences. However, the hidden assumption that the current search process can always benefit from previous search experiences might not be true for certain cases. For example, if the current problem is not similar to any of its previous problems, the historical solutions might not be helpful for the current search. To reduce such negative transfer, the following issues are worthy of study: how to choose which historical problems to learn from, and how to determine the degree of learning from historical problems. To solve the above problems, we propose a dynamic processing framework based on fuzzy rules from the perspective of incorporating human knowledge for optima tracking. The experimental results on the DOPF problems show that the SSA with the proposed optima tracking strategy outperforms other comparative algorithms. We open up the code and data of our algorithm44https://***/DMiC-Lab-HFUT/SMDE-Transfer. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on access control decision model of Internet of Things based on attribute exploration

Research on access control decision model of Internet of Thi...

引用

2021 International Conference on Signal Processing and Communication Technology, SPCT 2021

作者： Shen, XiaJiong Zhang, Peng Zhang, YanFeng Henan Key Laboratory of Big Data Analysis and Processing Henan Univ. HA Kaifeng475004 China School of Computer and Information Engineering Henan Univ. HA Kaifeng475004 China Institute of Data and Knowledge Engineering Henan Univ. HA Kaifeng475004 China

ISBN: (数字)9781510653344

ISBN: (纸本)9781510653337

With the rapid development of the Internet of things, the problem of access control has become increasingly prominent. In order to solve the problems of high redundancy and low integrity caused by the traditional Role-Based Access Control model, this paper proposes an access control model of Internet of things based on attribute exploration. Firstly, the decision model is established based on attribute exploration algorithm, and finally merged into a complete decision model. The model has the function of dynamically modifying access rights in the process of building decision model. It is a new exploration in the field of access control model. © 2022 SPIE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Assisted Diagnostic Learning Based on Concept Lattice

Assisted Diagnostic Learning Based on Concept Lattice

引用

2021 International Conference on Signal Processing and Communication Technology, SPCT 2021

作者： Shen, Xiajiong Li, Xingchen Han, Daojun Zhang, Yanfeng Henan Key Laboratory of Big Data Analysis and Processing Henan Univ. HA Kaifeng475004 China School of Computer and Information Engineering Henan Univ. HA Kaifeng475004 China Institute of Data and Knowledge Engineering Henan Univ. HA Kaifeng475004 China

ISBN: (数字)9781510653344

ISBN: (纸本)9781510653337

With the continuous development of education, online education is becoming more and more popular with learners because of its convenience. However, online education has the problem of insufficient interaction with students. Students still need to rely on the students themselves to judge the lack of knowledge in practice tasks, which will greatly affect the learning efficiency. In this paper, we propose a method based on formal concept analysis to analyze the knowledge that may not be mastered, and a method of intensive practice for students. First of all, establishing the formal context of student error test questions, construct the concept lattice to calculate the degree of importance of the knowledge concept that may not be mastered, judge the student's mastery of the knowledge concept, and give feedback. Secondly, construct the concept lattice of the unpractised test set, and calculate the similarity of the concept extension set that meets the threshold, find similar topics and push them, and realize targeted training for students who have not mastered the knowledge concepts. © 2022 SPIE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Algorithms with Heuristic Gradient-based Repair for Constrained Optimization

Evolutionary Algorithms with Heuristic Gradient-based Repair...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Du, Jiacheng Bu, Chenyang Liu, Yuxin Liu, Fei Luo, Wenjian Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Anhui Hefei230027 China Harbin Institute of Technology School of Computer Science and Technology Guangdong Shenzhen518000 China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Gradient-based repair aims to repair infeasible solutions to feasible ones using the gradient information of the constraints. As an effective constraint handling method, gradientbased repair has received extensive attention and has been applied in various evolutionary algorithms (EAs). Nevertheless, due to the complexity of constraints in practical problems, a single infeasible solution often needs to be repaired multiple times until it becomes a feasible solution or reaches the maximum number of repairs. As far as we know, existing related research on gradient-based repair mainly applies this method directly to EAs, while there is little work in the evolutionary computing community on how to improve gradient-based repair. Currently, the multiple repairs for a single individual are independent. That is, the current repair does not consider the previous repair experience. However, only using gradient information to repair infeasible individuals may result in oscillations in the search process. Therefore, in this paper, we propose a heuristic gradient-based repair method (HGR) which exploits the previous repair information of an individual to alleviate this issue. Experimental results on several benchmarks demonstrate the effectiveness of the proposed method. The source code is available at https://***/DMiC-Lab-HFUT/HGR-SMC2022. © 2022 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: Boosting Can Achieve Modality Reconcilement 41

ReconBoost: Boosting Can Achieve Modality Reconcilement

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Throughput-oriented associated transaction assignment in sharding blockchains for IoT social data storage

引用

Digital Communications and Networks 2022年第6期8卷 885-899页

作者： Liping Tao Yang Lu Xu Ding Yuqi Fan Jung Yoon Kim School of Computer Science and Information Engineering Hefei University of TechnologyHefei230009China Engineering Research Center of Safety Critical Industrial Measurement and Control Technology Ministry of EducationHefei University of TechnologyHefei230009China Institute of Industry&Equipment Technology Hefei University of TechnologyHefei230009China Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Ministry of EducationHefei230009China Graduate School of Game Gachon UniversitySeongnam-Si461-701South Korea

Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to solve the problem of low throughput in blockchains. However, cross-shard communication hinders the effective improvement of blockchain throughput. Therefore, it is critical to reasonably allocate transactions to different shards to improve blockchain throughput. Existing research on blockchain sharding mainly focuses on shards formation, configuration, and consensus, while ignoring the negative impact of cross-shard communication on blockchain throughput. Aiming to maximize the throughput of transaction processing, we study how to allocate blockchain transactions to shards in this paper. We propose an Associated Transaction assignment algorithm based on Closest Fit (ATCF). ATCF classifies associated transactions into transaction groups which are then assigned to different shards in the non-ascending order of transaction group sizes periodically. Within each epoch, ATCF tries to select a shard that can handle all the transactions for each transaction group. If there are multiple such shards, ATCF selects the shard with the remaining processing capacity closest to the number of transactions in the transaction group. When no such shard exists, ATCF chooses the shard with the largest remaining processing capacity for the transaction group. The transaction groups that cannot be completely processed within the current epoch will be allocated in the subsequent epochs. We prove that ATCF is a 2-approximation algorithm for the associated transaction assignment problem. Simulation results show that ATCF can effectively improve the blockchain throughput and reduce the number of cross-shard transactions.

关键词： IoT social data Blockchain Shar ding Associated transactions Transaction assi gnment

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：