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

25th ACM International Middleware Conference Demos, Posters and Doctoral Symposium, MIDDLEWARE 2024

作者： Ji, Shuping Tang, Zhen Wang, Wei Li, Hui Yao, Jianguo Jacobsen, Hans-Arno Institute of Software Chinese Academy of Sciences Beijing China Shanghai Jiao Tong University Jinan Inspur Data Technology Co. Ltd Shanghai China University of Toronto Toronto Canada Key Laboratory of System Software CAS State Key Laboratory of Computer Science Institute of Software at CAS University of CAS Beijing China University of CAS Nanjing College Nanjing China Nanjing Institute of Software Technology Nanjing China

ISBN: (纸本)9798400713545

Microservice architectures backed by container technology have been widely used in many real-world cloud-native applications. The number of containers in cloud data centers continues to increase, expected to reach several million soon. At this scale, existing service and configuration management solutions have limited efficiency, scalability and robustness. To overcome these limitations, we propose Ripple, which uniquely combines several existing and some novel features including consistent hashing-based workload distribution, dynamic destination list-based and client-assisted message delivery, incremental update, and adaptive load balancing. The experiments show that our solution greatly outperforms its counterparts. © 2024 Copyright held by the owner/author(s).

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A Systematic Literature Review on Large Language Models for Automated Program Repair

arXiv

引用

arXiv 2024年

作者： Zhang, Quanjun Fang, Chunrong Xie, Yang Ma, Yuxiang Sun, Weisong Yang, Yun Chen, Zhenyu State Key Laboratory for Novel Software Technology Nanjing University China School of Computer Science and Engineering Nanyang Technological University Singapore Department of Computing Technologies Swinburne University of Technology Australia

Automated Program Repair (APR) attempts to patch software bugs and reduce manual debugging efforts. Very recently, with the advances in Large Language Models (LLMs), a rapidly increasing number of APR techniques have been proposed, significantly facilitating software development and maintenance and demonstrating remarkable performance. However, due to ongoing explorations in the LLM-based APR field, it is challenging for researchers to understand the current achievements, challenges, and potential opportunities. This work provides the first systematic literature review to summarize the applications of LLMs in APR between 2020 and 2024. We analyze 127 relevant papers from LLMs, APR and their integration perspectives. First, we categorize existing popular LLMs that are applied to support APR and outline three types of utilization strategies for their deployment. Besides, we detail some specific repair scenarios that benefit from LLMs, e.g., semantic bugs and security vulnerabilities. Furthermore, we discuss several critical aspects of integrating LLMs into APR research, e.g., input forms and open science. Finally, we highlight a set of challenges remaining to be investigated and the potential guidelines for future research. Overall, our paper provides a systematic overview of the research landscape to the APR community, helping researchers gain a comprehensive understanding of achievements and promote future research. Our artifacts are publicly available at the GitHub repository: https://***/iSEngLab/AwesomeLLM4APR. © 2024, CC BY.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphism Problem 32

PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphi...

引用

32nd International Joint Conference on Artificial Intelligence, IJCAI 2023

作者： Wang, Yiyuan Jin, Chenghou Cai, Shaowei Lin, Qingwei School of Computer Science and Information Technology Northeast Normal University China Key Laboratory of Applied Statistics of MOE Northeast Normal University Changchun China Computer School Beijing Information Science and Technology University Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences China Microsoft Research China

ISBN: (纸本)9781956792034

The subgraph isomorphism problem (SIP) is a challenging problem with wide practical applications. In the last decade, despite being a theoretical hard problem, researchers designed various algorithms for solving SIP. In this work, we propose three main heuristics and develop an improved exact algorithm for SIP. First, we design a probing search procedure to try whether the search procedure can successfully obtain a solution at first sight. Second, we design a novel matching ordering as a value-ordering heuristic, which uses some useful information obtained from the probing search procedure to preferentially select some promising target vertices. Third, we discuss the characteristics of different propagation methods in the context of SIP and present an adaptive propagation method to make a good balance between these methods. Experimental results on a broad range of real-world benchmarks show that our proposed algorithm performs better than state-of-the-art algorithms for the SIP. © 2023 International Joint Conferences on Artificial Intelligence. All rights reserved.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Long- and Short- Term Sequential Recommendation with Temporal Interval 19

Long- and Short- Term Sequential Recommendation with Tempora...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： He, Kun Liu, Qiyan Li, Qianmu Meng, Shunmei Nanjing University of Science and Technology Nanjing China University of Toronto Computer Engineering Canada Nanjing University State Key Lab. for Novel Software Technology Nanjing China

ISBN: (纸本)9798350346558

Sequential recommendation aims to learn the changes of users' interests according to their historical behaviors and predict the most likely next item. Since user's historical behavior are sequential actions, user's interest in different time periods has different emphases. For predicting a user's next item, not only the recent behavior is important, but also long-term preference with all historical behaviors could not be ignored. Recently, self-attention based user preference modeling has drawn much attention for its advantages of fewer parameters and parallelism. However, most of the existing self-attention based model do not make a good distinction between the long-term and short-term preferences of users. Based on the observations, we design a sequential recommendation model based on a combination of long-term and short-term preference. On the one hand, considering the changes of users' interests in different periods, we divide the sequence of users' behaviors into different temporal windows. Then, we use GRU to capture users' interests in different temporal window. On the other hand, to better combine the global and local information of user's, we adopt a locally constrained multi-head attention mechanism based on Transformer encoder. On three real-world public datasets, we finally validate the efficacy of our method. © 2022 IEEE.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

Deep Convolutional Neural Network Approach for COVID-19 Detection

引用

computer Systems science & Engineering 2022年第7期42卷 201-211页

作者： Yu Xue Bernard-Marie Onzo Romany F.Mansour Shoubao Su School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China Engineering Research Center of Digital Forensics Ministry of EducationNanjing University of Information Science and TechnologyNanjingChina Department of Mathematics Faculty of ScienceNew Valley UniversityEl-Kharja72511Egypt Jiangsu Key Laboratory of Data Science and Smart Software Jinling Institute of TechnologyNanjing211169China

Coronavirus disease 2019(Covid-19)is a life-threatening infectious disease caused by a newly discovered strain of the *** by the end of 2020,Covid-19 is still not fully understood,but like other similar viruses,the main mode of transmission or spread is believed to be through droplets from coughs and sneezes of infected *** accurate detection of Covid-19 cases poses some questions to scientists and *** two main kinds of tests available for Covid-19 are viral tests,which tells you whether you are currently infected and antibody test,which tells if you had been infected ***-tine Covid-19 test can take up to 2 days to complete;in reducing chances of false negative results,serial testing is *** image processing by means of using Chest X-ray images and Computed Tomography(CT)can help radiologists detect the *** imaging approach can detect certain characteristic changes in the lung associated with *** this paper,a deep learning model or tech-nique based on the Convolutional Neural Network is proposed to improve the accuracy and precisely detect Covid-19 from Chest Xray scans by identifying structural abnormalities in scans or X-ray *** entire model proposed is categorized into three stages:dataset,data pre-processing andﬁnal stage being training and classiﬁcation.

关键词： COVID-19 deep learning convolutional neural network X-ray

来源：评论

学校读者我要写书评

暂无评论

ExpertDRL: Request Dispatching and Instance Configuration for Serverless Edge Inference with Foundation Models

引用

IEEE Transactions on Mobile Computing 2025年

作者： Zeng, Yue Zhou, Junlong Ye, Baoliu Qu, Zhihao Guo, Song Gong, Tianjian Li, Pan Nanjing University of Science and Technology Department of Computer Science and Engineering Jiangsu Nanjing210094 China Nanjing University State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing210023 China Hohai University Key Laboratory of Water Big Data Technology of Ministry of Water Resources Nanjing211100 China Hong Kong University of Science and Technology Hong Kong Southwest University College of Electronic and Information Engineering Chongqing400715 China

The prevalence of the pre-training & fine-tuning paradigm enables machine learning models to quickly adapt to various downstream tasks by fine-tuning pre-trained foundation models (FMs), greatly facilitating various IoT applications that rely on model inference in dynamic edge serverless environments. Efficiently dispatching inference requests and configuring instances to batch inference requests can significantly enhance resource efficiency. However, existing serverless inference solutions are tailored for traditional models, make coarse-grained request dispatching and instance configuration decisions, fail to exploit the shared model backbone characteristics of the FM and capture delayed rewards in dynamic environments, and ignore communication latency between edge sites, resulting in high costs and constraint violations. In this paper, we leverage our insight that fine-grained batch inference requests can effectively exploit the shared model backbone feature of FM to save monetary costs. We propose an algorithm that incorporates deep reinforcement learning (DRL) and expert intervention for fine-grained request dispatching and instance configuration, where the DRL component outputs fractional solutions as guidance, while the expert intervention module integrates our insights—batching reduces monetary costs at the expense of increased inference latency, whereas higher configurations shorten inference latency. This module rounds fractional solutions and adjusts instance configurations to search for optimal solutions while satisfying constraints, with theoretical guarantees rigorously proved. Finally, we conducted our experiments on an OpenFaas-based platform and simulator, and extensive trace-driven evaluation results show that ExpertDRL can save costs by up to 85.14% and improve request acceptance ratio by up to 26.93%, compared to the state-of-the-art solution. © 2002-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Identifying key Tag Distribution in Large-Scale RFID Systems

Identifying Key Tag Distribution in Large-Scale RFID Systems

引用

International Workshop on Quality of Service

作者： Yanyan Wang Jia Liu Shen-Huan Lyu Zhihao Qu Bin Tang Baoliu Ye Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University China College of Computer Science and Software Engineering Hohai University China State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (数字)9798350350128

ISBN: (纸本)9798350350135

With the proliferation of RFID-enabled applications, multiple readers are required for the complete coverage of numerous tags in a large-scale RFID system. In this scenario, we sometimes pay more attention to a subset of tags instead of all, which are referred to as key tags. In this paper, we study an under-investigated problem key tag distribution identification, which aims to identify which key tags are beneath which readers. This is crucial for efficiently managing specific items of interest, which can quickly pinpoint key tags and help RFID readers covering these tags collaborate to improve the tag inventory efficiency. Since key tags typically make up a small part of all tags, it is time consuming to deal with all tags in the traditional way. We propose a protocol called Kadept that identifies the key tag distribution by using a sophisticatedly designed filter that teases out key tags as well as assigns each of them a singleton slot for response. With this design, a great number of trivial (non-key) tags will keep silent and free up bandwidth resources for key tags, and each key tag is sorted in a collision-free way and can be identified with only 1-bit response, which significantly improves the time efficiency. We theoretically analyze how can we optimize protocol parameters of Kadept and conduct extensive simulations under different tag distribution scenarios. Compared with the state-of-the-art, Kadept can improve the time efficiency by a factor of 3.7×, when the ratio of key tags to all tags is 0.1.

关键词： Analytical models Protocols Quality of service Bandwidth Radiofrequency identification

来源：评论

学校读者我要写书评

暂无评论

Adaptively feature matching via joint transformational-spatial clustering

Adaptively feature matching via joint transformational-spati...

引用

作者： Wang, Linbo Tan, Li Fang, Xianyong Guo, Yanwen Wan, Shaohua MOE Key Laboratory of Intelligent Computing and Signal Processing School of Computer Science and Technology Anhui University Hefei China National Key Lab for Novel Software Technology Nanjing University Nanjing China School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan China

The transformational and spatial proximities are important cues for identifying inliers from an appearance based match set because correct matches generally stay close in input images and share similar local transformations. However, most existing approaches only check one type of them or both types consecutively with manually set thresholds, and thus their matching accuracy and flexibility in handling large-scale images are limited. In this paper, we present an efficient clustering based approach to identify match inliers with both proximities simultaneously. It first projects the putative matches into a joint transformational-spatial space, where mismatches tend to scatter all around while correct matches gather together. A mode-seeking process based on joint kernel density estimation is then proposed to obtain significant clusters in the joint space, where each cluster contains matches mapping the same object across images with high accuracy. Moreover, kernel bandwidths for measuring match proximities are adaptively set during density estimation, which enhances its applicability for matching different images. Experiments on three standard datasets show that the proposed approach delivers superior performance on a variety of feature matching tasks, including multi-object matching, duplicate object matching and object retrieval. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Clustering Density estimation Feature matching Mode-seeking

来源：评论

学校读者我要写书评

暂无评论

FedHPM: Online Federated Learning via Heterogeneous Prediction Model

FedHPM: Online Federated Learning via Heterogeneous Predicti...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Zhi Zhang Shiwen Zhang Shuang Chen Wei Liang Hunan University of Science and Technology College of Computer Science and Technology Xiangtan China School of Computer Science and Engineering Hunan University of Science and Technology and Hunan Key Laboratory for Service Computing and Novel Software Technology Xiangtan China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

In the era of big data and growing privacy concerns, Federated Learning (FL) has emerged as a promising solution for collaborative model training while preserving user data privacy. However, FL faces challenges such as inconsistent data quality and frequent client dropouts, which hinder its performance. To address these challenges, we propose FedHPM, a novel framework that leverages the predictive capabilities of Long Short-Term Memory (LSTM) networks. FedHPM incorporates an intelligent client selection mechanism that utilizes LSTM-based analysis of historical data to forecast clients’ potential data quality and dropout likelihood. This mechanism enables efficient selection of the top best-performing clients for participation in each round of global model training. By mitigating the impact of dropouts and optimizing the composition of participating clients, FedHPM significantly improves both the convergence speed and final performance of the global model. Through extensive empirical evaluations, we demonstrate the superior performance of FedHPM in enhancing FL stability, accelerating the convergence rate, and maintaining model accuracy. The results highlight the effectiveness of our framework in addressing the challenges associated with data quality and dropouts, thereby advancing the field of federated learning.

关键词： Training Privacy Data privacy Accuracy Federated learning Data integrity Predictive models Data models Long short term memory Convergence

来源：评论

学校读者我要写书评

暂无评论

Dynamic Individual Selection and Crossover Boosted Forensic-based Investigation Algorithm for Global Optimization and Feature Selection

引用

Journal of Bionic Engineering 2023年第5期20卷 2416-2442页

作者： Hanyu Hu Weifeng Shan Jun Chen Lili Xing Ali Asghar Heidari Huiling Chen Xinxin He Maofa Wang School of Emergency Management Institute of Disaster PreventionSanhe065201China Earthquake Administration of Anhui Province Hefei230031China Department of Computer Science and Artificial Intelligence Wenzhou UniversityWenzhou325035China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic TechnologyGuilin541004China

The advent of Big Data has rendered Machine Learning tasks more intricate as they frequently involve higher-dimensional *** Selection(FS)methods can abate the complexity of the data and enhance the accuracy,generalizability,and interpretability of ***-heuristic algorithms are often utilized for FS tasks due to their low requirements and efficient *** paper introduces an augmented Forensic-Based Investigation algorithm(DCFBI)that incorporates a Dynamic Individual Selection(DIS)and crisscross(CC)mechanism to improve the pursuit phase of the ***,a binary version of DCFBI(BDCFBI)is applied to *** conducted on IEEE CEC 2017 with other metaheuristics demonstrate that DCFBI surpasses them in search *** influence of different mechanisms on the original FBI is analyzed on benchmark functions,while its scalability is verified by comparing it with the original FBI on benchmarks with varied *** is then applied to 18 real datasets from the UCI machine learning database and the Wieslaw dataset to select near-optimal features,which are then compared with six renowned binary *** results show that BDCFBI can be more competitive than similar methods and acquire a subset of features with superior classification accuracy.

关键词： Feature selection Forensic-based investigation algorithm Crisscross mechanism Global optimization Metaheuristic algorithms Bionic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：