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

12th IEEE International Conference on Identification, Information and Knowledge in the Internet of Things, IIKI 2024

作者： Jin, Shenghao Yang, Qiwen Chen, Shengyu Zhang, Hui Beihang University State Key Laboratory of Complex & Critical Software Environment School of Computer Science & Engineering Beijing China

ISBN: (纸本)9798331510633

With the widespread adoption of cryptocurrencies, associated illicit activities such as money laundering, fraud, extortion, and Ponzi schemes have garnered significant attention. Traditional studies have extensively employed graph neural network technologies to identify illicit transactions, typically treating the entire transaction network as input to classify its nodes. Although these methods perform well on small-scale networks, they face performance limitations when processing large-scale blockchain transaction data. To address this issue, we propose a neighborhood subgraph-based method for detecting illicit transactions, integrating GCN and LSTM. In this approach, the GCN captures and integrates information from adjacent nodes for each transaction, facilitating a deep understanding of network structures. The LSTM is tasked with capturing the sequence and variations in fund flows, effectively tracking the direction and temporal characteristics of the money flow. Experimental results indicate that when using 3-hop neighborhood subgraphs, our model's performance surpasses other GCN-based methods. Compared to previous models that require considering the entire transaction network, our approach only needs to utilize information from an average of 80 nodes, significantly improving efficiency. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Quantum search algorithm for continuous domains

引用

science China(Physics,Mechanics & Astronomy) 2025年第6期Mechanics & Astronomy) .卷 215页

作者： Lvzhou Li Institute of Quantum Computing and Software School of Computer Science and Engineering Sun Yat-sen University

The paper “Fixed-point quantum continuous search algorithm with optimal query complexity’’[1] presents another interesting application of quantum search algorithms by addressing one of the long-standing challenges in quantum computing:how to efficiently perform search over continuous domains. While Grover’s algorithm has been a cornerstone in discrete quantum search with its well-known quadratic speedup [2], many real-world problems—ranging from high-dimensional optimization to spectral analysis of infinite dimensional operators—require searching over continuous, uncountably infinite solution spaces.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Overbooking-Enabled Task Scheduling and Resource Allocation in Mobile Edge Computing Environments

引用

Intelligent Automation & Soft Computing 2023年第7期37卷 1-16页

作者： Jixun Gao Bingyi Hu Jialei Liu Huaichen Wang Quanzhen Huang Yuanyuan Zhao School of Computer Henan University of EngineeringZhengzhou451191China School of Computer Science and Technology Henan Polytechnic UniversityJiaozuo454000China School of Computer Hubei University of Arts and ScienceXiangyang441053China School of Software Engineering Anyang Normal UniversityAnyang455000China School of Computer and Information Engineering Henan Normal UniversityXinxiang453003China The Publicity Department Zhengzhou University of TechnologyZhengzhou450044China

Mobile Edge Computing(MEC)is proposed to solve the needs of Inter-net of Things(IoT)users for high resource utilization,high reliability and low latency of service ***,the backup virtual machine is idle when its primary virtual machine is running normally,which will waste *** the backup virtual machine under the above circumstances can effectively improve resource ***,these virtual machines are deployed into slots randomly,and then some tasks with cooperative relationship are off-loaded to virtual machines for *** deployment locations have different resource utilization and average service response *** want toﬁnd a balanced solution that minimizes the average service response time of the IoT application while maximizing resource *** this paper,we propose a task scheduler and exploit a Task Deployment Algorithm(TDA)to obtain an optimal virtual machine deployment ***,the simulation results show that the TDA can signiﬁcantly increase the resource utilization of the system,while redu-cing the average service response time of the application by comparing TDA with the other two classical *** experimental results conﬁrm that the perfor-mance of TDA is better than that of other two methods.

关键词： Mobile edge computing overbooking resource utilization service response time task deployment algorithm

来源：评论

学校读者我要写书评

暂无评论

Mathematical Methods for Reducing the Search Space for Solutions in 'Big Data' Analysis and Management 14

Mathematical Methods for Reducing the Search Space for Solut...

引用

14th International Conference on Advanced computer Information Technologies, ACIT 2024

作者： Syrotkina, Olena Kobti, Ziad Aleksieiev, Mykhailo Moroz, Dmytro Udovyk, Iryna Martynenko, Andrii University of Windsor School of Computer Science Windsor Canada Dnipro University of Technology Department of Software Engineering Dnipro Ukraine

ISBN: (纸本)9798350350036

This paper addresses mathematical methods to reduce or segment the search space for big data solutions into distinct subspaces with partial solutions. It is achieved by using a data organization structure of 'm-tuples based on ordered sets of arbitrary cardinality.' We provide a mathematical description of this structure and review contemporary methodologies to address similar problems. The study highlights how these properties can significantly reduce the analyzed state space and includes graphs that demonstrate changes in data volume within these subspaces. Additionally, we analyze how variations in four specific arguments affect data volume changes and provide an overview of the efficiency gains in resource use from applying the mathematical methods discussed. © 2024 IEEE.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

OptEx: Expediting First-Order Optimization with Approximately Parallelized Iterations 38

OptEx: Expediting First-Order Optimization with Approximatel...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Shu, Yao Fang, Jiongfeng He, Ying Tiffany Yu, Fei Richard China College of Computer Science and Software Engineering Shenzhen University China School of Information Technology Carleton University Canada

First-order optimization (FOO) algorithms are pivotal in numerous computational domains, such as reinforcement learning and deep learning. However, their application to complex tasks often entails significant optimization inefficiency due to their need of many sequential iterations for convergence. In response, we introduce first-order optimization expedited with approximately parallelized iterations (OptEx), the first general framework that enhances the optimization efficiency of FOO by leveraging parallel computing to directly mitigate its requirement of many sequential iterations for convergence. To achieve this, OptEx utilizes a kernelized gradient estimation that is based on the history of evaluated gradients to predict the gradients required by the next few sequential iterations in FOO, which helps to break the inherent iterative dependency and hence enables the approximate parallelization of iterations in FOO. We further establish theoretical guarantees for the estimation error of our kernelized gradient estimation and the iteration complexity of SGD-based OptEx, confirming that the estimation error diminishes to zero as the history of gradients accumulates and that our SGD-based OptEx enjoys an effective acceleration rate of Θ(√N) over standard SGD given parallelism of N, in terms of the sequential iterations required for convergence. Finally, we provide extensive empirical studies, including synthetic functions, reinforcement learning tasks, and neural network training on various datasets, to underscore the substantial efficiency improvements achieved by OptEx in practice. Our implementation is available at https://***/youyve/OptEx. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems

引用

ACM Transactions on Evolutionary Learning and Optimization 2024年第4期4卷 1-32页

作者： Wu, Xunfeng Lin, Qiuzhen Zhou, Junwei Liu, Songbai Coello Coello, Carlos A. Leung, Victor C. M. College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China School of Computer Science and Artificial Intelligence Wuhan University of Technology Wuhan430070 China Mexico City07300 Mexico Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

In recent years, surrogate-Assisted evolutionary algorithms (SAEAs) have been sufficiently studied for tackling computationally expensive multiobjective optimization problems (EMOPs), as they can quickly estimate the qualities of solutions by using surrogate models to substitute for expensive evaluations. However, most existing SAEAs only show promising performance for solving EMOPs with no more than 10 dimensions, and become less efficient for tackling EMOPs with higher dimensionality. Thus, this article proposes a new SAEA with a simplified helper task for tackling high-dimensional EMOPs. In each generation, one simplified task will be generated artificially by using random dimension reduction on the target task (i.e., the target EMOPs). Then, two surrogate models are trained for the helper task and the target task, respectively. Based on the trained surrogate models, evolutionary multitasking optimization is run to solve these two tasks so that the experiences of solving the helper task can be transferred to speed up the convergence of tackling the target task. Moreover, an effective model management strategy is designed to select new promising samples for training the surrogate models. When compared to five competitive SAEAs on four well-known benchmark suites, the experiments validate the advantages of the proposed algorithm on most test cases. © 2024 held by the owner/author(s).

关键词： Multitasking

来源：评论

学校读者我要写书评

暂无评论

Less Traces Are All It Takes: Efficient Side-Channel Analysis on AES

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2024年第6期44卷 2080-2092页

作者： Xiao, Zhiyuan Wang, Chen Shen, Jian Wu, Q. M. Jonathan He, Debiao Zhejiang Sci-Tech University School of Information Science and Engineering School of Cyber Science and Technology the Zhejiang Provincial Key Laboratory of Digital Fashion and Data Governance Zhejiang Provincial International Cooperation Base for Science and Technology on Cloud Computing Security and Data Aggregation Hangzhou310018 China University of Windsor Department of Electrical and Computer Engineering WindsorON Canada Wuhan University State Key Laboratory of Software Engineering Computer School Wuhan430072 China

In cryptography, side-channel analysis (SCA) is a technique used to recover cryptographic keys by examining the physical leakages that occur during the operation of cryptographic devices. Recent advancements in Deep Learning (DL) have greatly enhanced the extraction of crucial information from intricate leakage patterns. A considerable amount of research is dedicated to studying the SubByte (SB) operations of the advanced encryption standard (AES). This is because the SB process, which generates numerous transitions between 0s and 1s during encryption, results in significant energy leakage. However, traditional analysis models primarily focus on the initial round of SB operations in AES, which are less effective on mobile terminals where it is difficult to collect enough signals. These models often neglect additional operations and subsequent rounds, thus providing limited insights from small datasets. Consequently, this limitation has a direct impact on the accuracy and efficiency of key recovery. Our study uses ρ-test analysis to show that significant leakage occurs not only during the S-box operation but also during the AddRoundKey (AR) phase of AES. To address these challenges, we propose a new SCA method that is optimized for small sample sizes. This method includes a new comprehensive round trace labeling algorithm, which simultaneously analyzes the SB and AR stages of each AES round. Additionally, we introduce the peak precise localization algorithm to accurately identify the points of energy leakage during each encryption round. Our experiments, conducted with power and Electromagnetic (EM) datasets from the STM32F303 microcontroller, demonstrate that our method can reliably recover keys with as few as 20 traces. These results highlight the enhanced capability of our method in handling the complexities of small sample datasets in cryptographic analysis. © 2024 IEEE.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

Research and Innovation of Artificial Intelligence Curriculum System—Under the Background of "Double First-Class" Construction 5th

Research and Innovation of Artificial Intelligence Curriculu...

引用

5th International Conference on computer science and Educational Informatization, CSEI 2023

作者： Wei, Dongmei Meng, Dan Wang, Ping School of Management Science and Engineering Southwest University of Finance and Economics Chengdu611130 China School of Computer and Software Engineering Xihua University Chengdu610039 China

ISBN: (纸本)9789819994915

Under the background that the construction of artificial intelligence technology and intelligent science has become a national strategy, how to establish the development direction of professional characteristics and build a scientific curriculum system has become an urgent problem to be solved. With the goal of constructing artificial intelligence talent training system and curriculum system and creating first-class majors, we will carry out high-quality intelligent science curriculum system construction and teaching research from the goal of first-class professional curriculum construction. By taking the specialty of intelligent science and technology of Xihua University as an example, this thesis expounds the establishment of the specialty characteristic direction, the goal of cultivating high-quality artificial intelligence technical talents to meet the social needs, the application and innovation of the hierarchical talent training mode. The thesis builds the specific implementation path of the intelligent science relating to curriculum system, and applies it to the actual teaching. This research perspective is unique and innovative, and has obvious practical application value, so as to achieve the training goal of senior intelligent science professionals required by the development of local artificial intelligence industry. These results also provide reference for the construction of Intelligent Technology Specialty in Colleges and universities. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Challenges of Using Pre-trained Models: The Practitioners' Perspective 31

Challenges of Using Pre-trained Models: The Practitioners' P...

引用

31st IEEE International Conference on software Analysis, Evolution and Reengineering, SANER 2024

作者： Tan, Xin Li, Taichuan Chen, Ruohe Liu, Fang Zhang, Li School of Computer Science and Engineering State Key Laboratory of Complex & Critical Software Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China School of Economics and Management Beihang University Beijing China

ISBN: (纸本)9798350330663

The challenges associated with using pre-trained models (PTMs) have not been specifically investigated, which hampers their effective utilization. To address this knowledge gap, we collected and analyzed a dataset of 5,896 PTM-related questions on Stack Overflow. We first analyze the popularity and difficulty trends of PTM-related questions. We find that PTM-related questions are becoming more and more popular over time. However, it is noteworthy that PTM-related questions not only have a lower response rate but also exhibit a longer response time compared to many well-researched topics in software engineering. This observation emphasizes the significant difficulty and complexity associated with the practical application of PTMs. To delve into the specific challenges, we manually annotate 430 PTM-related questions, categorizing them into a hierarchical taxonomy of 42 codes (i.e., leaf nodes) and three categories. This taxonomy encompasses many PTM prominent challenges such as fine-tuning, output understanding, and prompt customization, which reflects the gaps between current techniques and practical needs. We discuss the implications of our study for PTM practitioners, vendors, and educators, and suggest possible directions and solutions for future research. © 2024 IEEE.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

Fair and Communication-Efficient Personalized Federated Learning 18th

Fair and Communication-Efficient Personalized Federated Lea...

引用

18th International Conference on Wireless Artificial Intelligent Computing Systems and Applications, WASA 2024

作者： Zheng, Yifu Zheng, Xu Wang, Tingqi Mu, Chong Zhakiyev, Nurkhat School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Department of Science and Innovation Astana IT University Astana Kazakhstan

ISBN: (纸本)9783031714665

Personalized Federated Learning (pFL) is among the most popular tasks in distributed deep learning, which compensates for mutual knowledge and enables device-specific model personalization. However, the effectiveness of pFL is severely impeded by challenges on fairness and significant communication overhead, where devices holding essential samples have to devote extensive resources for model training. To address these issues, we introduce the Fair and Communication-Efficient Personalized Federated Learning (FCE-PFL) framework, which harmonizes performance and device fairness while maintaining communication costs. Based on the Dempster-Shafer Theory, FCE-PFL employs assistance and contribution metrics to quantify the auxiliary information a client receives and provides. Then FCE-PFL balances and adjusts the involvement of devices in each training iteration, so as to facilitate fair training by constraining the maximum resource consumption per device and reduce the overall communication overhead. Our framework has been proven to be superior to existing methods in accuracy through rigorous experiments on the CIFAR10 and CIFAR100 datasets, demonstrating its potential as a fair and efficient pFL solution. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：