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

International Conference on Systems and Informatics (ICSAI)

作者： Siquan Hu Jun Jia Zhiguo Shi Jun Zhao School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Beijing Big Data Center Beijing China

In the domain of few-shot learning, where the scarcity of training data poses a significant challenge, this paper introduces an innovative approach. We present a few-shot classification algorithm that utilizes the Two-Stream Frequency Domain Information Network. This algorithm delves deep into the efficacy of training different frequency components of images in the context of few-shot classification. It integrates filtered and enhanced image frequency domain information as supplementary data to be adaptively fused with the original image data, enhancing and augmenting the available information. Experimental results establish that the few-shot classification model, employing the Two-Stream Frequency Domain Information Network, outperforms leading algorithms in the field of few-shot learning. This enhancement is evidenced by an accuracy improvement of 1.06% and 0.93% on the miniImageNet and tiredImageNet datasets, respectively, when compared to the Meta-Baseline, illustrating the efficacy of this specialized approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient and Privacy-preserving Edge Intelligence for 6G-Empowered Intelligent Transportation Systems

引用

IEEE Network 2025年

作者： Zhu, Chenlu Fan, Xiaoxuan Deng, Xianjun Xiao, Ziheng Guo, Tingting Liu, Shenghao Sun, Jiaqi Park, Jong Hyuk Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Wuhan Kedao Geographic Information Engineering Co. Wuhan China Department of Computer Science and Engineering Seoul National University of Science and Technology Seoul Korea Republic of

6G-empowered Intelligent Transportation Systems (ITS) generate large amounts of data through millions of devices and sensors at the terminal and network edge. Edge intelligence advances the frontier of data-driven artificial intelligence (AI) to the network edge, which enables AI applications to better utilize edge data. Broader connectivity, higher device density, and stronger data exchange present challenges for reliable device communication and privacy data protection in 6G-empowered ITS. To address these challenges, this paper proposes an energy-efficient and privacy-preserving edge intelligence framework named EP-EI. EP-EI deploys a deep reinforcement learning-based cluster head selection model at the edge to ensure energy-efficient communication for terminal devices. Meanwhile, EP-EI designs a privacy-aware hierarchical computing framework for terminal-edge-cloud to prevent privacy leakage. Furthermore, the application scenarios, challenges, and future directions of EP-EI are discussed. Finally, simulation experiments in a specific intelligent transportation case study demonstrate that EP-EI can provide energy-efficient and privacy-protecting services. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Large Language Model Supply Chain: A research Agenda

arXiv

引用

arXiv 2024年

作者： Wang, Shenao Zhao, Yanjie Hou, Xinyi Wang, Haoyu Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

The rapid advancement of large language models (LLMs) has revolutionized artificial intelligence, introducing unprecedented capabilities in natural language processing and multimodal content generation. However, the increasing complexity and scale of these models have given rise to a multifaceted supply chain that presents unique challenges across infrastructure, foundation models, and downstream applications. This paper provides the first comprehensive research agenda of the LLM supply chain, offering a structured approach to identify critical challenges and opportunities through the dual lenses of software engineering (SE) and security & privacy (S&P). We begin by establishing a clear definition of the LLM supply chain, encompassing its components and dependencies. We then analyze each layer of the supply chain, presenting a vision for robust and secure LLM development, reviewing the current state of practices and technologies, and identifying key challenges and research opportunities. This work aims to bridge the existing research gap in systematically understanding the multifaceted issues within the LLM supply chain, offering valuable insights to guide future efforts in this rapidly evolving domain. Copyright © 2024, The Authors. All rights reserved.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Object Detection Method for Bank Operation and Maintenance Scenarios 5

A Lightweight Object Detection Method for Bank Operation and...

引用

5th International Conference on Pattern Recognition and Artificial Intelligence, PRAI 2022

作者： Xue, Junmin Rao, Yunbo Wu, Jiangang Gou, Haosong Liu, Yong Yang, Yang University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu China Data Center of Postal Savings Bank of China Beijing China Chengdu Aerospace Science and Industry Big Data Research Institute Corporation Limited Chengdu China Sichuan Institute of Computer Sciences Chengdu China

ISBN: (数字)9781665499163

ISBN: (纸本)9781665499163

Due to the complex background of bank operation and maintenance scenarios, it is extremely difficult to detect and analyze the object of operation and maintenance scenarios. The traditional target detection algorithms, such as F-RCNN, are not suitable for object detection. We propose a lightweight object detection method for bank operation and maintenance scenarios based on deep learning. The proposed method highlights two improvements based on Yolov5. The first adjustment of it is this method constructs a new convolution method and a new activation function. Also, we use the multi-scale output strategy of Feature Pyramid Networks (FPN) to develop a new lightweight feature extraction algorithm. These changes we made are based on the real-life situation, such as bank operation and maintenance scenarios. Experiments have been carried out on the same data set with multiple object detection algorithms, and the experimental results show that the proposed method reduces the complexity of the activation function. Meanwhile, the module is flexible, and can be easily applied to other similar business scenario detection models. © 2022 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

WaDec: Decompiling WebAssembly Using Large Language Model

arXiv

引用

arXiv 2024年

作者： She, Xinyu Zhao, Yanjie Wang, Haoyu Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

WebAssembly (abbreviated Wasm) has emerged as a cornerstone of web development, offering a compact binary format that allows high-performance applications to run at near-native speeds in web browsers. Despite its advantages, Wasm’s binary nature presents significant challenges for developers and researchers, particularly regarding readability when debugging or analyzing web applications. Therefore, effective decompilation becomes crucial. Unfortunately, traditional decompilers often struggle with producing readable outputs. While some large language model (LLM)-based decompilers have shown good compatibility with general binary files, they still face specific challenges when dealing with Wasm. In this paper, we introduce a novel approach, WaDec, which is the first use of a fine-tuned LLM to interpret and decompile Wasm binary code into a higher-level, more comprehensible source code representation. The LLM was meticulously fine-tuned using a specialized dataset of wat-c code snippets, employing self-supervised learning techniques. This enables WaDec to effectively decompile not only complete wat functions but also finer-grained wat code snippets. Our experiments demonstrate that WaDec markedly outperforms current state-of-the-art tools, offering substantial improvements across several metrics. It achieves a code inflation rate of only 3.34%, a dramatic 97% reduction compared to the state-ofthe-art’s 116.94%. Unlike the output of baselines that cannot be directly compiled or executed, WaDec maintains a recompilability rate of 52.11%, a re-execution rate of 43.55%, and an output consistency of 27.15%. Additionally, it significantly exceeds state-of-the-art performance in AST edit distance similarity by 185%, cyclomatic complexity by 8%, and cosine similarity by 41%, achieving an average code similarity above 50%. In summary, WaDec enhances understanding of the code’s structure and execution flow, facilitating automated code analysis, optimization, and security auditin

关键词： Web browsers

来源：评论

学校读者我要写书评

暂无评论

Towards Effective and Efficient Error Handling Code Fuzzing Based on Software Fault Injection

Towards Effective and Efficient Error Handling Code Fuzzing ...

引用

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Kang Chen Ming Wen Haoxiang Jia Rongxin Wu Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology (HRUST) Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security Jin YinHu Laboratory Wuhan China School of Informatics Xiamen University Xiamen China School of Computer Science and Technology HUST Wuhan China Cluster and Grid Computing Lab

ISBN: (数字)9798350330663

ISBN: (纸本)9798350330670

Software systems often encounter various errors or exceptions in practice, and thus proper error handling code is essential to ensure the reliability of software systems. Unfortunately, error handling code is often bug-prone, while sufficiently testing them is challenging as such code often cannot be triggered under normal conditions. Motivated by this, recent studies have proposed to leverage software fault injection (SFI) based fuzzing to discover potential bugs in complicated error handling code. Despite the promising results achieved, their effectiveness and efficiency are still compromised in practice due to the huge search space of error sites, inadequate fuzzing guidance, and the overhead induced by context-sensitive SFI. To achieve effective and efficient testing of error handling code, this study presents AFL-FI, which first utilizes a similarity-based method to identify suspicious error sites, and then incorporates the idea of error site coverage to guide the fuzzing process. Finally, the design of lightweight context-sensitive SFI enables AFL-FI to execute test cases efficiently. We evaluate AFL-FI on eight large-scale open-source projects, and the results show that it can outperform existing state-of-the-art fuzzing tools significantly in terms of branch code coverage. More importantly, AFL-FI has discovered 13 previously unknown bugs, and all of them have been confirmed while 12 of them have been fixed. Besides, our evaluation also demonstrates that all the key designs of AFL- F I are effective that contribute significantly to its overall performance.

关键词： Codes computer bugs Fuzzing Software systems Software reliability Testing

来源：评论

学校读者我要写书评

暂无评论

Play like a Vertex: A Stackelberg Game Approach for Streaming Graph Partitioning

arXiv

引用

arXiv 2024年

作者： Ding, Zezhong Xiang, Yongan Wang, Shangyou Xie, Xike Zhou, S. Kevin School of Data Science School of Computer Science and Technology School of Biomedical Engineering Data Darkness Lab MIRACLE Center Suzhou Institute for Advanced Research University of Science and Technology of China Jiangsu Suzhou China

In the realm of distributed systems tasked with managing and processing large-scale graph-structured data, optimizing graph partitioning stands as a pivotal challenge. The primary goal is to minimize communication overhead and runtime cost. However, alongside the computational complexity associated with optimal graph partitioning, a critical factor to consider is memory overhead. Real-world graphs often reach colossal sizes, making it impractical and economically unviable to load the entire graph into memory for partitioning. This is also a fundamental premise in distributed graph processing, where accommodating a graph with non-distributed systems is unattainable. Currently, existing streaming partitioning algorithms exhibit a skew-oblivious nature, yielding satisfactory partitioning results exclusively for specific graph types. In this paper, we propose a novel streaming partitioning algorithm, the Skewness-aware Vertex-cut Partitioner (S5P), designed to leverage the skewness characteristics of real graphs for achieving high-quality partitioning. S5P offers high partitioning quality by segregating the graph’s edge set into two subsets, head and tail sets. Following processing by a skewness-aware clustering algorithm, these two subsets subsequently undergo a Stackelberg graph game. Our extensive evaluations conducted on substantial real-world and synthetic graphs demonstrate that, in all instances, the partitioning quality of S5P surpasses that of existing streaming partitioning algorithms, operating within the same load balance constraints. For example, S5P can bring up to a 51% improvement in partitioning quality compared to the top partitioner among the baselines. Lastly, we showcase that the implementation of S5P results in up to an 81% reduction in communication cost and a 130% increase in runtime efficiency for distributed graph processing tasks on *** Codes 97P30 Copyright © 2024, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Routing over Best Links is not necessarily Better in Wireless Multi-hop Networks

Routing over Best Links is not necessarily Better in Wireles...

引用

International Workshop on Quality of Service

作者： Shutao Lu Wuyungerile Li Yintu Bao Alvin C. Valera Winston K.G. Seah Baoqi Huang Inner Mongolia Key Lab. of Wireless Networking & Mobile Computing Engineering Research Center of Ecological Big Data Ministry of Education School of Computer Science Inner Mongolia University Hohhot China School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand

ISBN: (数字)9798350350128

ISBN: (纸本)9798350350135

The conventional approach of choosing the best route to carry network traffic in wireless multi-hop networks does not maximize the overall network throughput and can lead to short-term instabilities in network state with dire consequences. To date, wireless network route selection considers mainly network or link metrics, always picking the best links, thus channeling all packets through a subset of all available links. This leaves weaker links under-utilized although such links can in fact be used to carry smaller packets or packets with less stringent requirements and free up bandwidth on the better links for larger packets or traffic with higher service requirements. As network traffic volume and heterogeneity increase in future networks, we need to maximize the usage of available network bandwidth and distribute the network traffic load. We combine network link metrics and packet attributes to determine the successful packet transmission probability, and then use this outcome to pick suitable links to forward the packet, which is not necessarily the link with the best metric. To validate the efficacy of our proposed approach in routing performance and energy efficiency, we applied it in routing for wireless multi-hop networks. More importantly, we are able to spread the traffic across nodes in the network, thus achieving better network load-balancing and higher network resource utilization.

关键词： Measurement Wireless networks Spread spectrum communication Telecommunication traffic Bandwidth Routing Throughput

来源：评论

学校读者我要写书评

暂无评论

Gradient Boosting-Accelerated Evolution for Multiple-Fault Diagnosis

Gradient Boosting-Accelerated Evolution for Multiple-Fault D...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Hongfei Wang Chenliang Luo Deqing Zou Hai Jin Wenjie Cai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Wuhan China Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Wuhan China Huazhong University of Science and Technology Wuhan China Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China College of Public Administration Wuhan China

ISBN: (数字)9783981926385

ISBN: (纸本)9798350348606

Logic diagnosis is a key step in yield learning. Multiple faults diagnosis is challenging because of several reasons, including error masking, fault reinforcement, and huge search space for possible fault combinations. This work proposes a two-phase method for multiple-fault diagnosis. The first phase efficiently reduces the potential number of fault candidates through machine learning. The second phase obtains the final diagnosis results, by formulating the task as an combinational optimization problem that is later iteratively solved using binary evolution computation. Experiments shows that our method outperforms two existing methods for multiple-fault diagnosis, and achieves better diagnosability (improved by $1.87\times$ ) and resolution (improved by $1.42\times$ ) compared with a state-of-the-art commercial diagnosis tool.

关键词： Fault diagnosis Adaptation models Computational modeling Fitting Filtering algorithms Boosting Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：