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

Block-gram:Mining knowledgeable features for efficiently smart contract vulnerability detection

Digital Communications and Networks 2025年第1期11卷 1-12页

作者： Xueshuo Xie Haolong Wang Zhaolong Jian Yaozheng Fang Zichun Wang Tao Li Tianjin Key Laboratory of Network and Data Security Technology TianjinChina College of Computer Science Nankai UniversityTianjinChina Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province China State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesChina

Smart contracts are widely used on the blockchain to implement complex transactions,such as decentralized applications on *** vulnerability detection of large-scale smart contracts is critical,as attacks on smart contracts often cause huge economic *** it is difficult to repair and update smart contracts,it is necessary to find the vulnerabilities before they are ***,code analysis,which requires traversal paths,and learning methods,which require many features to be trained,are too time-consuming to detect large-scale on-chain ***-based methods will obtain detection models from a feature space compared to code analysis methods such as symbol *** the existing features lack the interpretability of the detection results and training model,even worse,the large-scale feature space also affects the efficiency of *** paper focuses on improving the detection efficiency by reducing the dimension of the features,combined with expert *** this paper,a feature extraction model Block-gram is proposed to form low-dimensional knowledge-based features from ***,the metadata is separated and the runtime code is converted into a sequence of opcodes,which are divided into segments based on some instructions(jumps,etc.).Then,scalable Block-gram features,including 4-dimensional block features and 8-dimensional attribute features,are mined for the learning-based model ***,feature contributions are calculated from SHAP values to measure the relationship between our features and the results of the detection *** addition,six types of vulnerability labels are made on a dataset containing 33,885 contracts,and these knowledge-based features are evaluated using seven state-of-the-art learning algorithms,which show that the average detection latency speeds up 25×to 650×,compared with the features extracted by N-gram,and also can enhance the interpretability of the detection model.

关键词： Smart contract Bytecode&opcode Knowledgeable features Vulnerability detection Feature contribution

来源：评论

学校读者我要写书评

暂无评论

An alert-situation text data augmentation method based on MLM

引用

High Technology Letters 2024年第4期30卷 389-396页

作者： DING Weijie MAO Tingyun CHEN Lili ZHOU Mingwei YUAN Ying HU Wentao Department of Computer and Information Security Zhejiang Police CollegeHangzhou 310053P.R.China Key Laboratory of Public Security Information Application Based on Big-Data Architecture Ministry of Public SecurityHangzhou 310053P.R.China Zhejiang Dahua Technology Co. LtdHangzhou 310053P.R.China

The performance of deep learning models is heavily reliant on the quality and quantity of train-ing *** training data will lead to ***,in the task of alert-situation text classification,it is usually difficult to obtain a large amount of training *** paper proposes a text data augmentation method based on masked language model(MLM),aiming to enhance the generalization capability of deep learning models by expanding the training *** method em-ploys a Mask strategy to randomly conceal words in the text,effectively leveraging contextual infor-mation to predict and replace masked words based on MLM,thereby generating new training *** Mask strategies of character level,word level and N-gram are designed,and the performance of each Mask strategy under different Mask ratios is analyzed and *** experimental results show that the performance of the word-level Mask strategy is better than the traditional data augmen-tation method.

关键词： deep learning text data augmentation masked language model(MLM) alert-sit-uation text classification

来源：评论

学校读者我要写书评

暂无评论

Source Camera Identification Algorithm Based on Multi-Scale Feature Fusion

引用

computers, Materials & Continua 2024年第8期80卷 3047-3065页

作者： Jianfeng Lu Caijin Li Xiangye Huang Chen Cui Mahmoud Emam School of Computer Science and Technology Hangzhou Dianzi UniversityHangzhou310018China Shangyu Institute of Science and Engineering Hangzhou Dianzi UniversityShaoxing312300China Key Laboratory of Public Security Information Application Based on Big-Data Architecture Ministry of Public SecurityZhejiang Police CollegeHangzhou310000China Faculty of Artificial Intelligence Menoufia UniversityShebin El-Koom32511Egypt

The widespread availability of digital multimedia data has led to a new challenge in digital *** source camera identification algorithms usually rely on various traces in the capturing ***,these traces have become increasingly difficult to extract due to wide availability of various image processing *** Neural Networks(CNN)-based algorithms have demonstrated good discriminative capabilities for different brands and even different models of camera ***,their performances is not ideal in case of distinguishing between individual devices of the same model,because cameras of the same model typically use the same optical lens,image sensor,and image processing algorithms,that result in minimal overall *** this paper,we propose a camera forensics algorithm based on multi-scale feature fusion to address these *** proposed algorithm extracts different local features from feature maps of different scales and then fuses them to obtain a comprehensive feature *** representation is then fed into a subsequent camera fingerprint classification *** upon the Swin-T network,we utilize Transformer Blocks and Graph Convolutional Network(GCN)modules to fuse multi-scale features from different stages of the backbone ***,we conduct experiments on established datasets to demonstrate the feasibility and effectiveness of the proposed approach.

关键词： Source camera identification camera forensics convolutional neural network feature fusion transformer block graph convolutional network

来源：评论

学校读者我要写书评

暂无评论

Image inpainting via Smooth Tucker decomposition and Low-rank Hankel constraint

引用

International Journal of computers and Applications 2023年第6期45卷 421-432页

作者： Cai, Jing Jiang, Jiawei Wang, Yibing Zheng, Jianwei Xu, Honghui Department of Forensic Science Zhejiang Police College Hangzhou China Key Laboratory of Public Security Information Application Based on Big-Data Architecture Hangzhou China College of Computer Science and Technology Zhejiang University of Technology Hangzhou China

Image inpainting, aiming at exactly recovering missing pixels from partially observed entries, is typically an ill-posed problem. As a powerful constraint, low-rank priors have been widely applied in image inpainting to transform such problems into well-posed ones. However, the low-rank assumption of original visual data is only in an approximate mode, which in turn results in suboptimal recovery of fine-grained details, particularly when the missing rate is extremely high. Moreover, a single prior cannot faithfully capture the complex texture structure of an image. In this paper, we propose a joint usage of Smooth Tucker decomposition and Low-rank Hankel constraint (STLH) for image inpainting, which enables simultaneous capturing of the global low-rankness and local piecewise smoothness. Specifically, based on the Hankelization operation, the original image is mapped to a high-order structure for capturing more spatial and spectral information. By employing Tucker decomposition for optimizing the Hankel tensor and simultaneously applying Discrete Total Variation (DTV) to the Tucker factors, sharper edges are generated and better isotropic properties are enhanced. Moreover, to approximate the essential rank of the Tucker decomposition and avoid facing the uncertainty problem of the upper-rank limit, a reverse strategy is adopted to approximate the true rank of the Tucker decomposition. Finally, the overall image inpainting model is optimized by the well-known alternate least squares (ALS) algorithm. Extensive experiments show that the proposed method achieves state-of-the-art performance both quantitatively and qualitatively. Particularly, in the extreme case with 99% pixels missed, the results from STLH are averagely ahead of others at least 0.9dB in terms of PSNR values. © 2023 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Rail Transit Event Extraction based on the Fusion of Semantic and Local Dependency Features 15

Rail Transit Event Extraction based on the Fusion of Semanti...

引用

15th IEEE International Conference on Knowledge Graph, ICKG 2024

作者： Chen, Qiang Meng, Haining Bao, Yihao Yang, Mingsong Tong, Xinyu Zhao, Qin Khan, Muhammad Bilal Hei, Xinhong Xi'an University of Technology School of Computer Science and Engineering Xi'an China Xi'an University of Technology School of Computer Science and Engineering Shaanxi Key Laboratory of Network Computing and Security Technology Xi'an China Xi'an University of Technology School of Civil Engineering and Architecture Xi'an China

ISBN: (纸本)9798331508821

Event extraction in rail transit plays a vital role in all stages of design, construction, and final acceptance. Event extraction is a key part of building event logic graph (ELG). However, the difficulty in obtaining semantic features and event local dependencies poses a challenge to accurate event extraction, which hinders the informatization and intelligent development of rail transit projects. To address these challenges, we proposes an event extraction method that fuses semantic and local dependency features. The study initially preprocesses the rail transit design codes dataset and performs sequence labeling. Then, the event trigger words are mined by combining the term frequency-inverse document frequency (TF-IDF) and minimum edit distance (MED) algorithms. Based on the semantic similarity measurement method and the trigger word mining results, the features representation of event semantic information is enhanced by using the Bidirectional Encoder Representations from Transformers (BERT) model and Bi-directional Long Short-Term Memory (BiLSTM) model. At the same time, event arguments are mined and a local dependency graph is generated based on their mining results, and then the enhanced local dependency features are obtained by using the graph convolutional network (GCN). Finally, the event semantic features and local dependency features are fused, and the conditional random field (CRF) is used to predict the labels to obtain the event extraction results. Through the comparison with five baseline methods on the datasets of rail transit design codes, it is found that the Precision, Recall, and F1 score of the proposed method are improved, with an average improvement of 9.604% on Precision, 9.342% on Recall, and 9.730% on F1 score, respectively. The contribution of the sub-modules to the overall performance is further evaluated through ablation experiments, which confirms the effectiveness and feasibility of the proposed method. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Block-gram: Mining Knowledgeable Features for Smart Contract Vulnerability Detection 7th

Block-gram: Mining Knowledgeable Features for Smart Contrac...

引用

7th International Conference on Smart Computing and Communication, SmartCom 2022

作者： Li, Tao Wang, Haolong Fang, Yaozheng Jian, Zhaolong Wang, Zichun Xie, Xueshuo Tianjin Key Laboratory of Network and Data Security Technology Tianjin China College of Computer Science Nankai University Tianjin China Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province Hangzhou China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783031281235

Effective vulnerability detection of large-scale smart contracts is critical because smart contract attacks frequently bring about tremendous economic loss. However, code analysis requiring traversal paths and learning methods requiring many features training is too time-consuming to detect large-scale on-chain contracts. This paper focuses on improving detection efficiency by reducing the dimension of the features, combined with expert knowledge. We propose a feature extraction method Block-gram to form low-dimensional knowledgeable features from the bytecode. We first separate the metadata and convert the runtime code to opcode sequence, dividing the opcode sequence into segments according to some instructions (jump, etc.). Then, we mine extensible Block-gram features for learning-based model training, consisting of 4-dimensional block features and 8-dimensional attribute features. We evaluate these knowledge-based features using seven state-of-the-art learning algorithms to show that the average detection latency speeds up 25 to 650 times, compared with the features extracted by N-gram. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

A Sketch-Based Generation Model for Diverse Ceramic Tile Images Using Generative Adversarial Network

引用

Intelligent Automation & Soft Computing 2023年第9期37卷 2865-2882页

作者： Jianfeng Lu Xinyi Liu Mengtao Shi Chen Cui Mahmoud Emam School of Computer Science and Technology Hangzhou Dianzi UniversityHangzhou310018China Key Laboratory of Public Security Information Application Based on Big-Data Architecture Ministry of Public SecurityZhejiang Police CollegeHangzhou310000China Faculty of Artificial Intelligence Menoufia UniversityShebin El-Koom32511Egypt

Ceramic tiles are one of the most indispensable materials for interior *** ceramic patterns can’t match the design requirements in terms of diversity and interactivity due to their natural *** this paper,we propose a sketch-based generation method for generating diverse ceramic tile images based on a hand-drawn sketches using Generative Adversarial Network(GAN).The generated tile images can be tailored to meet the specific needs of the user for the tile *** proposed method consists of four ***,a dataset of ceramic tile images with diverse distributions is created and then pre-trained based on ***,for each ceramic tile image in the dataset,the corresponding sketch image is generated and then the mapping relationship between the images is trained based on a sketch extraction network using ResNet Block and jump connection to improve the quality of the generated ***,the sketch style is redefined according to the characteristics of the ceramic tile images and then double cross-domain adversarial loss functions are employed to guide the ceramic tile generation network for fitting in the direction of the sketch style and to improve the training ***,we apply hidden space perturbation and interpolation for further enriching the output textures style and satisfying the concept of“one style with multiple faces”.We conduct the training process of the proposed generation network on 2583 ceramic tile images *** measure the generative diversity and quality,we use Frechet Inception Distance(FID)and Blind/Referenceless Image Spatial Quality Evaluator(BRISQUE)*** experimental results prove that the proposed model greatly enhances the generation results of the ceramic tile images,with FID of 32.47 and BRISQUE of 28.44.

关键词： Ceramic tile pattern design cross-domain learning deep learning GAN generative adversarial networks ResNet Block

来源：评论

学校读者我要写书评

暂无评论

The differential fault analysis on block cipher FeW

引用

Cybersecurity 2023年第2期6卷 62-74页

作者： Haiyan Xiao Lifang Wang Jinyong Chang School of Computer Science Northwestern Polytechnical UniversityXiAn 710055People's Republic of China Engineering University of PAP XiAn 710055People's Republic of China School of Information and Control Engineering XiAn University of Architecture and TechnologyXi'An 710055People's Republic of China State Key Laboratory of Information Security(SKLOIS) Institute of Information EngineeringChinese Academy of SciencesBeijing 100089People's Republic of China

Feather weight(FeW)cipher is a lightweight block cipher proposed by Kumar et *** 2019,which takes 64 bits plaintext as input and produces 64 bits *** Kumar et ***,FeW is a software oriented design with the aim of achieving high efficiency in software based *** seems that FeW is immune to many cryptographic attacks,like linear,impossible differential,differential and zero correlation ***,in recent work,Xie et *** the security of *** precisely,they proved that under the differential fault analysis(DFA)on the encryption states,an attacker can completely recover the master secret *** this paper,we revisit the block cipher FeW and consider the DFA on its key schedule algorithm,which is rather popular cryptanalysis for kinds of block *** particular,by respectively injected faults into the 30th and 29th round subkeys,one can recover about 55/80~69%bits of master *** the brute force searching remaining bits,one can obtain the full master secret *** simulations and experiment results show that our analysis is practical.

关键词： Differential fault analysis Block cipher FeW Side channel attack

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Convolutional Neural Network with Representation Self-challenge for Fingerprint Liveness Detection

引用

computers, Materials & Continua 2022年第10期73卷 719-733页

作者： Jie Chen Chengsheng Yuan Chen Cui Zhihua Xia Xingming Sun Thangarajah Akilan School of Computer Science Nanjing University of Information Science and TechnologyNanjing210044China Key Laboratory of Public Security Information Application Based on Big-Data Architecture Ministry of Public SecurityZhejiang Police CollegeHangzhou310053China Jiangsu Yuchi Blockchain Research Institute Nanjing210044China Department of Software Engineering Lakehead UniversityThunder BayON P7B 5E1Canada

Fingerprint identification systems have been widely deployed in many occasions of our daily ***,together with many advantages,they are still vulnerable to the presentation attack(PA)by some counterfeit *** address challenges from PA,fingerprint liveness detection(FLD)technology has been proposed and gradually attracted people’s *** vast majority of the FLD methods directly employ convolutional neural network(CNN),and rarely pay attention to the problem of overparameterization and over-fitting of models,resulting in large calculation force of model deployment and poor model *** at filling this gap,this paper designs a lightweight multi-scale convolutional neural network method,and further proposes a novel hybrid spatial pyramid pooling block to extract abundant features,so that the number of model parameters is greatly reduced,and support multi-scale true/fake fingerprint ***,the representation self-challenge(RSC)method is used to train the model,and the attention mechanism is also adopted for optimization during execution,which alleviates the problem of model over-fitting and enhances generalization of detection ***,experimental results on two publicly benchmarks:LivDet2011 and LivDet2013 sets,show that our method achieves outstanding detection results for blind materials and *** size of the model parameters is only 548 KB,and the average detection error of cross-sensors and cross-materials are 15.22 and 1 respectively,reaching the highest level currently available.

关键词： FLD lightweight multi-scale RSC blind materials

来源：评论

学校读者我要写书评

暂无评论

Discrete Jaya algorithm to solve the police resource deployment problem in emergency traffic accident 10

Discrete Jaya algorithm to solve the police resource deploym...

引用

10th IEEE Joint International Information Technology and Artificial Intelligence Conference, ITAIC 2022

作者： Jing, Zhang Weijie, Ding Zhejiang Police College Department of Computer and Information Security Hangzhou310053 China Big-data and Network Security Research Institute Zhejiang Police College Hangzhou310053 China College of Information Engineering Zhejiang University of Technology Hangzhou310023 China Key Laboratory of Public Security Information Application Based on Big-data Architecture Ministry of Public Security Hangzhou310053 China

ISBN: (数字)9781665422079

ISBN: (纸本)9781665422079

Aiming at the high frequency of urban traffic accidents and the relative shortage of police resources, a multi-objective discrete Jaya algorithm is proposed to solve the problem of police resource deployment in emergency traffic accident handling. The purpose is to make timely response and handling of traffic accidents through the rational allocation of police deployment points in the jurisdiction. Taking the coverage of accident points and the average response time of accidents as the optimization objectives, the discrete Jaya algorithm is used as the global search strategy to approach the Pareto front by constantly approaching the optimal solution and far away from the worst solution, and then the neighborhood search strategy is used to improve the local search ability of the algorithm. Finally, a practical example is given to verify the effectiveness of the proposed method. © 2022 IEEE.

关键词： Law enforcement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：