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

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

来源：评论

学校读者我要写书评

暂无评论

Path Optimization Method Under UAV Charging Scheduling Network 24th

Path Optimization Method Under UAV Charging Scheduling Netwo...

引用

24th International Conference on Algorithms and architectures for Parallel Processing, ICA3PP 2024

作者： Yang, Tingting Wang, Yiqian Zhu, Jie Chang, Shuyu Huang, Haiping Nanjing University of Posts and Telecommunications Nanjing210003 China State Key Laboratory Chinese of Computer Architecture Institute of Computing Technology Academy of Sciences Beijing100864 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing210003 China

ISBN: (纸本)9789819615278

Unmanned Aerial Vehicles (UAVs) have emerged as integral components in logistics systems, where their potential for efficient delivery services is being explored. However, the limited battery capacity of UAVs poses a significant challenge for long-distance delivery applications. In this paper, we investigate a hybrid problem involving UAV trajectory planning and charging scheduling for long-distance logistics systems with a charging network. In the problem under study, multiple UAVs are assigned long-distance delivery tasks. A UAV can stop at any charging station in the charging network to charge if it is in a low-energy state. An Ant Colony Optimization-based UAV Trajectory Planning and Charging Scheduling (ACO-TPCS) algorithm is proposed to minimize task completion time by optimizing UAV trajectory and charging plans. The main framework of the ACO-TPCS algorithm consists of several key components, including reachable graph construction, candidate flight path generation, pheromone matrix construction, ant generation, feasible solution generation, and pheromone update method. All these components are delicately designed. Through extensive experimentation and comparison with baseline algorithms, we demonstrate the effectiveness of the ACO-TPCS algorithm in addressing the problem under study. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Optimizing Self-training Sample Selection for Euphemism Detection in Special Scenarios 24th

Optimizing Self-training Sample Selection for Euphemism Dete...

引用

24th International Conference on Algorithms and architectures for Parallel Processing, ICA3PP 2024

作者： Zhang, Zhiwei Chang, Shuyu Huang, Haiping Wang, Rui Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing210023 China Nanjing University of Posts and Telecommunications Nanjing210023 China State Key Laboratory Chinese of Computer Architecture Institute of Computing Technology Academy of Sciences Beijing100864 China

ISBN: (纸本)9789819615476

Euphemism, which is often used to disguise true intentions or soften the tone of speech, has garnered significant attention for its detection in recent years. Current approaches to euphemism detection struggle with uncommon data, where new and rare vocabularies frequently emerge in the test set, leading to decreased model performance. To address these challenges, we propose a novel framework that combines data augmentation, self-training, and a special sample selection method. We expand the original dataset using lexical and sentence-level data augmentation techniques, enhancing the representation of rare vocabulary and allowing the model to familiarize itself with their contexts and usage characteristics. Next, we employ self-training as a semi-supervised learning approach, utilizing the augmented datasets to iteratively generate and refine pseudo-labels. During each iteration, a KNN framework is used to generate pseudo-labels by searching for the nearest neighbor texts, thus enhancing the quality of these labels. Finally, to further increase the presence of rare vocabulary in the training data, we implement a sample selection strategy based on euphemism frequency and predictive uncertainty, integrating it with the earlier steps. Experimental results demonstrate that our framework outperforms previous research on most metrics and achieves a 10% increase over the baseline model. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Supply and Demand Relationship of Fresh Retail Based on Accessibility: A Case Study of Guangzhou

Supply and Demand Relationship of Fresh Retail Based on Acce...

引用

2024 International Conference on Construction and Real Estate Management: ESG Development in the Construction Industry, ICCREM 2024

作者： Jiang, Rui Hu, Zilin Wei, Zongcai Wu, Kaixin Liang, Jing Liu, Ziye School of Architecture South China Univ. of Technology Guangzhou China State Key Laboratory of Subtropical Building and Urban Science South China Univ.of Technology Guangzhou China School of Computer Science and Engineering South China Univ. of Technology Guangzhou China

ISBN: (数字)9780784485910

ISBN: (纸本)9780784485910

Whether the supply-demand relationship of fresh food retail services matches is of great significance to urban planning and construction and residents' lives. This work takes four central districts in Guangzhou as an example to calculate the accessibility of fresh retail in different types of residential areas. In addition, this work explores the spatial clustering distribution relationship of fresh retail supply and demand. Results show that the frequency of purchasing fresh food in central areas is typically higher than that in border areas. However, the supply-demand matching is poor due to the large population size. The online accessibility of newly built urban areas, such as Tianhe District, is better, but offline fresh food retailing dominates. Offline fresh food retail supply and demand matching is better than online in the marginal area. The analysis of the accessibility of fresh food in residential areas is beneficial for providing a reference for urban spatial layout and planning and construction. © ASCE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fresh Retail Layout and Forecast Based on Multi-Source Big Data and Machine Learning: A Case Study of Guangzhou

Fresh Retail Layout and Forecast Based on Multi-Source Big D...

引用

2024 International Conference on Construction and Real Estate Management: ESG Development in the Construction Industry, ICCREM 2024

作者： Wu, Kaixin Liu, Ziye Wei, Zongcai Liang, Jing Jiang, Rui Hu, Zilin School of Architecture South China Univ. of Technology Guangzhou China School of Computer Science and Engineering South China Univ. of Technology Guangzhou China State Key Laboratory of Subtropical Building and Urban Science South China Univ. of Technology Guangzhou China

ISBN: (数字)9780784485910

ISBN: (纸本)9780784485910

Fresh retail is an important facility in the community life circle. Exploring its spatial distribution is essential for improving the allocation of life service resources. This paper introduces a method based on supply and demand matching and machine learning, designed to analyze and forecast the current state of supply and demand in offline fresh retail. Specifically, we take the four central districts of Guangzhou as the research object and apply the two-step mobile search method to filter the training set grid. Utilizing machine learning, we obtained the feature matrices of these grids and applied them to the supply prediction of the remaining grids. The results indicate that the Commercial Residential Density, Travel Convenience Index, and Food Service Density are the main factors affecting the location selection of offline fresh retail. The supply and demand in Yuexiu and Haizhu Districts show imbalance, and the construction of offline fresh retail facilities must be fortified. © ASCE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

RGB-Based Category-Level Object Pose Estimation via Depth Recovery and Adaptive Refinement

引用

IEEE Robotics and Automation Letters 2025年第6期10卷 5377-5384页

作者： Yang, Hui Sun, Wei Liu, Jian Zheng, Jin Zeng, Zhiwen Mian, Ajmal Hunan University National Engineering Research Center for Robot Visual Perception and Control Technology College of Electrical and Information Engineering Changsha410082 China Hunan University State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body Changsha410082 China Central South University School of Architecture and Art Changsha410082 China University of Western Australia Department of Computer Science and Software Engineering CrawleyWA6009 Australia

Category-level pose estimation methods have received widespread attention as they can be generalized to intra-class unseen objects. Although RGB-D-based category-level methods have made significant progress, reliance on depth image limits practical application. RGB-based methods offer a more practical and cost-effective solution. However, current RGB-based methods struggle with object geometry perception, leading to inaccurate pose estimation. We propose depth recovery and adaptive refinement for category-level object pose estimation from a single RGB image. We leverage DINOv2 to reconstruct the coarse scene-level depth from the input RGB image and propose an adaptive refinement network based on an encoder-decoder architecture to dynamically improve the predicted coarse depth and reduce its gap from the ground truth. We introduce a 2D–3D consistency loss to ensure correspondence between the point cloud obtained from depth projection and the objects in the 2D image. This consistency supervision enables the model to maintain alignment between the depth image and the point cloud. Finally, we extract features from the refined point cloud and feed them into two confidence-aware rotation regression branches and a translation and size prediction residual branch for end-to-end training. Decoupling the rotation matrix provides a more direct representation, which facilitates parameter optimization and gradient propagation. Extensive experiments on the REAL275 and CAMERA25 datasets demonstrate the superior performance of our method. Real-world estimation and robotic grasping experiments demonstrate our model robustness to occlusion, clutter environments, and low-textured objects. Our code and robotic grasping video are available at DA-Pose. © 2016 IEEE.

关键词： Depth perception

来源：评论

学校读者我要写书评

暂无评论

An effective meta-heuristics for trajectory planning problem in UAV-assisted vessel emission detection system

引用

Peer-to-Peer Networking and Applications 2025年第4期18卷 1-21页

作者： Zhu, Jie Cui, Weizhi Huang, Haiping Zhu, Tao Sun, Yuzhong School of Computer Science Nanjing University of Posts and Telecommunications Nanjing 210003 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing University of Posts and Telecommunications Nanjing 210003 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100864 China

With the development of the shipping industry, the pollution problem caused by vessel fuels is becoming increasingly severe. Due to the great mobility and on-demand service capability of Unmanned Aerial Vehicles (UAVs), UAVs have become effective tools for detecting pollution in Emission Control Areas (ECAs). How to obtain the effective trajectories of UAVs within the energy limitation and the time limitation is a difficult problem to solve. The paper investigates the trajectory planning problem in UAV-assisted vessel emission detection system. In the problem, the sailing vessels in a given area are taken as the detection tasks and multiple UAVs are ready to detect these vessels. Each vessel is assigned a different detecting weight and sails to the port at a different speed. The objective is to complete as many detection tasks as possible before the deadline and maximize the total weight of these completed tasks. A Genetic Algorithm (GA)-based trajectory planning algorithm framework is proposed for the problem under study. The framework consists of key components, such as the chromosome generation method to generate chromosomes of each generation, the feasible solution generation method to compute the feasible solution according to the sequence defined in a chromosome, and the chromosome reconstruction method to improve the quality of chromosomes based on history information. The experimental results show that the proposed algorithm outperforms the baseline algorithms in terms of effectiveness and robustness. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Emission control areas Genetic algorithm Trajectory planning UAV scheduling

来源：评论

学校读者我要写书评

暂无评论

In-situ NAS: A Plug-and-Search Neural architecture Search framework across hardware platforms

引用

IEEE Transactions on computers 2025年

作者： Lv, Hao Zhang, Lei Wang, Ying Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China State Key Laboratory of Computer Architecture China

Hardware-aware Neural architecture Search (HW-NAS) has garnered significant research interest due to its ability to automate the design of neural networks for various hardware platforms. Prevalent HW-NAS frameworks often use fast predictors to estimate network performance, bypassing the time-consuming actual profiling step. However, the resource-intensive nature of building these predictors and their accuracy limitations hinder their practical use in diverse deployment scenarios. In response, we emphasize the indispensable role of actual profiling in HW-NAS and explore efficiency optimization possibilities within the HW-NAS framework. We provide a systematic analysis of profiling overhead in HW-NAS and identify many redundant and unnecessary operations during the search phase. We then optimize the workflow and present Insitu NAS, which leverages similarity features and exploration history to eliminate redundancy and improve runtime efficiency. In-situ NAS also offers simplified interfaces to ease the user’s effort in managing the complex device-dependent profiling flow, enabling plug-and-search functionality across diverse hardware platforms. Experimental results show that In-situ NAS achieves an average 10x speedup across different hardware platforms while reducing the search overhead by 8x compared to predictor-based approaches in various deployment scenarios. Additionally, In-situ NAS consistently discovers networks with better accuracy (about 1.5%) across diverse hardware platforms compared to predictor-based NAS. © 1968-2012 IEEE.

关键词： AutoML Deep Learning Hardware-Aware Neural architecture Search Optimization Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Towards Expanding Precise Timing for Collaborative Its with Deterministic Communications in 6G

Towards Expanding Precise Timing for Collaborative Its with ...

引用

IEEE Conference on Wireless Communications and Networking

作者： Hongxing Li Haotian Li Qianhan Gao Guochu Shou Yaqiong Liu Zhigang Guo Yihong Hu State Key Laboratory of Networking and Switching Technology School of Computer Science (National Pilot Software Engineering School) Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

The demand for precise timing continues to grow with the rapid development of smart cities, where intelligent transportation emerges as a critical application heavily dependent on accurate time distribution. Deterministic communication is anticipated to be a defining feature of nextgeneration mobile networks (6G), enabling end-to-end timecritical applications, and unlocking new possibilities for achieving end-to-end precise time synchronization as well. To cope with the challenge of delivering precise time synchronization across broader areas at a lower cost, this paper proposes a method to achieve end-to-end precise time synchronization by leveraging the deterministic characteristics of communication networks. Specially, the proposed approach adopts the Software-Defined Networking (SDN) paradigm to implement deterministic networking for the seamless integration of Time-Sensitive Networking (TSN) and cellular networks. Furthermore, to mitigate the impact of wireless channel uncertainties on synchronization accuracy, we propose a network delay measurement mechanism based on the principle of time redundancy, designed to reduce end-to-end network delay variation. Experimental results validate the effectiveness of the proposed method, demonstrating its capability to constrain the end-to-end relative time error of wired and wireless converged networks to the microsecond scale, without necessitating modifications to the existing network infrastructure.

关键词： 6G mobile communication Wireless communication Cellular networks Uncertainty Accuracy Measurement uncertainty Transportation Delays Synchronization Software defined networking

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Constrained Aircraft Sequencing and Path Planning for Airport Ground Movement Problem 19th

Spatial-Temporal Constrained Aircraft Sequencing and Path P...

引用

19th CCF Conference on computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Liu, Fengmei Sun, Jingzhe Zhu, Jie Zhao, Zheng Huang, Huimin School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China The State Key Laboratory Chinese of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing100864 China Nanjing University of Aeronautics and Astronautics Nanjing210016 China

ISBN: (纸本)9789819623754

In order to effectively alleviate the congestion and delay of aircraft during peak hours in a large hub airport, the paper studies the cooperative scheduling and path planning for arrival and departure aircrafts. A cooperative aircraft scheduling and path planning model for the airport ground movement problem is established with multiple spatial and temporal constraints, such as the queue constraint, time difference constraint, corner constraint. It aims to minimize the average taxiing time for all aircrafts. A genetic algorithm with elite selection strategy (ESGA) is proposed for the problem under study. Experimental results show that the proposed algorithm can effectively obtain the aircraft sequencing and path planning solutions, and significantly reduce the average taxiing time of the aircraft. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：