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

45th IEEE/ACM International Conference on software engineering, ICSE 2023

作者： Wu, Jiahui Xu, Zhengzi Tang, Wei Zhang, Lyuye Wu, Yueming Liu, Chengyue Sun, Kairan Zhao, Lida Liu, Yang School of Computer Science and Engineering Nanyang Technological University Singapore School of Software Tsinghua University China

ISBN: (纸本)9781665457019

Third-party libraries (TPLs) are frequently used in software to boost efficiency by avoiding repeated developments. However, the massive using TPLs also brings security threats since TPLs may introduce bugs and vulnerabilities. Therefore, software composition analysis (SCA) tools have been proposed to detect and manage TPL usage. Unfortunately, due to the presence of common and trivial functions in the bloated feature dataset, existing tools fail to precisely and rapidly identify TPLs in C/C++ real-world projects. To this end, we propose OSSFP, a novel SCA framework for effective and efficient TPL detection in large-scale real-world projects via generating unique fingerprints for open source software. By removing common and trivial functions and keeping only the core functions to build the fingerprint index for each TPL project, OSSFP significantly reduces the database size and accelerates the detection process. It also improves TPL detection accuracy since noises are excluded from the fingerprints. We applied OSSFP on a large data set containing 23,427 C/C++ repositories, which included 585,683 versions and 90 billion lines of code. The result showed that it could achieve 90.84% of recall and 90.34% of precision, which outperformed the state-of-the-art tool by 35.31% and 3.71%, respectively. OSSFP took only 0.12 seconds on average to identify all TPLs per project, which was 22 times faster than the other tool. OSSFP has proven to be highly scalable on large-scale datasets. © 2023 IEEE.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Multi-Person Estimation Method Combining Interactive and Contextual Information 5

Multi-Person Estimation Method Combining Interactive and Con...

引用

5th International Seminar on Artificial Intelligence, Networking and Information Technology, AINIT 2024

作者： Chen, Zhuxiang Li, Shujie Jia, Wei School of Computer Science and Information Engineering Hefei University of Technology Hefei China School of Software Hefei University of Technology Hefei China

ISBN: (纸本)9798350385557

Multi-person pose estimation based on monocular cameras is one of the hot research topics in computer vision. Current monocular multi-person 3D pose estimation methods often treat individuals as independent entities for estimation and are based solely on single-frame assessments. This methodology has notable limitations, particularly its insufficient utilization of the rich interactive information interlinking individuals, as well as the contextual continuity inherent across sequential frames. To address these challenges, our study introduces a novel method for monocular multi-person 3D pose estimation. Firstly, it utilizes the attention mechanism of Transformer to learn the contextual and interactive information of both local and global coordinates. Subsequently, the methd employs low-order convolution operators of a root trajectory network to further assimilate global coordinate information. Finally, an optimization algorithm is used to adaptively filter frames with significant occlusions. Our method effectively integrates the interactive information among multiple individuals and the contextual information across multiple frames. Experimental results on the public dataset MuPoTS-3D demonstrate that compared to the state-of-the-art methods, our approach shows a 4.8% improvement in average joint accuracy and a 19. 4% reduction in average root joint error. © 2024 IEEE.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Effective and Efficient Community Search with Graph Embeddings 26

Effective and Efficient Community Search with Graph Embeddin...

引用

26th European Conference on Artificial Intelligence, ECAI 2023

作者： Gou, Xiaoxuan Xu, Xiaoliang Wu, Xiangying Chen, Runhuai Wang, Yuxiang Wu, Tianxing Ke, Xiangyu Hangzhou Dianzi University School of Computer Science China Southeast University School of Computer Science and Engineering China Zhejiang University School of Software Technology China

ISBN: (纸本)9781643684369

Given a graph G and a query node q, community search (CS) seeks a cohesive subgraph from G that contains q. CS has gained much research interests recently. In the database research community, researchers aim to find the most cohesive subgraph satisfying a specific community model (e.g., k-core or k-truss) via graph traversal. These works obtain good precision, however suffering from the low efficiency issue. In the AI research community, a new thought of using the deep learning model to support CS without relying on graph traversal emerges. Supervised end-to-end models using GCN are presented, which perform efficiently, but leave a large room for precision improvement. None of them can achieve a good balance between the efficiency and effectiveness. This motivates our solution: First, we present an offline community-injected graph embedding method to preserve the community's cohesiveness features into the learned node representations. Second, we resort to a proximity graph (PG) built from node representations, to quickly return the community online. Moreover, we develop a self-augmented method based on KL divergence to further optimize node representations. Extensive experiments on seven real-world graphs show our solution's superiority on effectiveness (at least 39.3% improvement) and efficiency (one to two orders of magnitude faster). © 2023 The Authors.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

African Bison Optimization Algorithm:A New Bio-Inspired Optimizer with engineering Applications

引用

computers, Materials & Continua 2024年第10期81卷 603-623页

作者： Jian Zhao Kang Wang Jiacun Wang Xiwang Guo Liang Qi School of Science University of Science and Technology LiaoningAnshan114051China Team of Artificial Intelligence Theory and Application University of Science and Technology LiaoningAnshan114051China Department of Computer Science and Software Engineering Monmouth UniversityWest Long BranchNJ 07764USA Information and Control Engineering College Liaoning Petrochemical UniversityFushun113000China Department of Computer Science and Technology Shandong University of Science and TechnologyQingdao266590China

This paper introduces the African Bison Optimization(ABO)algorithm,which is based on biological *** is inspired by the survival behaviors of the African bison,including foraging,bathing,jousting,mating,and *** foraging behavior prompts the bison to seek a richer food source for *** bison find a food source,they stick around for a while by bathing *** jousting behavior makes bison stand out in the population,then the winner gets the chance to produce offspring in the mating *** eliminating behavior causes the old or injured bison to be weeded out from the herd,thus maintaining the excellent *** above behaviors are translated into ABO by mathematical *** assess the reliability and performance of ABO,it is evaluated on a diverse set of 23 benchmark functions and applied to solve five practical engineering problems with *** findings from the simulation demonstrate that ABO exhibits superior and more competitive performance by effectively managing the trade-off between exploration and exploitation when compared with the other nine popular metaheuristics algorithms.

关键词： Optimization metaheuristics African bison optimization engineering problems

来源：评论

学校读者我要写书评

暂无评论

Effort-aware cross-project just-in-time defect prediction framework for mobile apps

引用

Frontiers of computer science 2022年第6期16卷 15-29页

作者： Tian CHENG Kunsong ZHAO Song SUN Muhammad MATEEN Junhao WEN School of Big Data and Software Engineering Chongqing UniversityChongqing401331China School of Computer Science Wuhan UniversityWuhan430072China Department of Computer Science Air University Multan CampusMultan60000Pakistan

As the boom of mobile devices,Android mobile apps play an irreplaceable roles in people’s daily life,which have the characteristics of frequent updates involving in many code commits to meet new ***-in-Time(JIT)defect prediction aims to identify whether the commit instances will bring defects into the new release of apps and provides immediate feedback to developers,which is more suitable to mobile *** the within-app defect prediction needs sufficient historical data to label the commit instances,which is inadequate in practice,one alternative method is to use the cross-project *** this work,we propose a novel method,called KAL,for cross-project JIT defect prediction task in the context of Android mobile *** specifically,KAL first transforms the commit instances into a high-dimensional feature space using kernel-based principal component analysis technique to obtain the representative ***,the adversarial learning technique is used to extract the common feature embedding for the model *** conduct experiments on 14 Android mobile apps and employ four effort-aware indicators for performance *** results on 182 cross-project pairs demonstrate that our proposed KAL method obtains better performance than 20 comparative methods.

关键词： kernel-based principal component analysis adversarial learning just-in-time defect prediction cross-project model

来源：评论

学校读者我要写书评

暂无评论

Optimization of Heliostat Field Arrangement Model Based on Geometric Relationship and Particle Swarm Algorithm 4

Optimization of Heliostat Field Arrangement Model Based on G...

引用

4th IEEE International Conference on Power, Electronics and computer Applications, ICPECA 2024

作者： Liu, Zhishuai Wei, Zhengyang Li, Jiangnan School of Mathematics Hohai University Nanjing China College of Computer Science and Software Engineering Hohai University Nanjing China

ISBN: (纸本)9798350359589

With the continuous progress of photovoltaic (PV) technology and the steady reduction of related costs, solar energy, as an important renewable energy source, shows an increasingly strong competitiveness in energy market competition. In the tower solar thermal power station, the arrangement of the heliostat field directly affects the power generation efficiency of the tower power generation system as well as the working cost. Therefore, this paper presents a model based on geometric relationship and particle swarm algorithm for the optimization of the heliostat field arrangement, mathematical modeling and calculating cosine efficiency, truncation efficiency, etc., and effectively improves the output thermal power as well as the optical efficiency of the heliostat field. Geometric planning is utilized to determine the location of the absorption tower, the coordinates of the heliostat arrangement and other layout parameters to optimize the layout of the tower solar system. Drawing on the idea of clustering, the model analyzes the characteristics of the heliostat mirrors in the same region, uses same or similar parameters to minimize the cost of computation, improving the overall optical efficiency of the mirror field. The particle swarm algorithm is utilized to solve the parameters such as mirror length and mirror width of the heliostat to get the suitable size of the heliostat for the heliostat mirror field. After completing all the calculation and optimization steps, the final solution of the model is carried out in this paper. The layout scheme of the heliostat field optimized by the implementation of the model gets a significant performance improvement. Specifically, the average annual thermal power output of the heliostat field is improved by 33.2309 MW, while the average annual optical efficiency is also improved by 43.2%. These improvements effectively enhance the power generation efficiency of the whole system, confirming the effectiveness of the optimization

关键词： Campo arrangement method Geometric relationship Mirror field optimization arrangement Particle swarm algorithm Spatial transformation

来源：评论

学校读者我要写书评

暂无评论

Neighborhood Subgraph-based Illicit Transaction Detection in Cryptocurrency Networks 12

Neighborhood Subgraph-based Illicit Transaction Detection in...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：