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

17th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2020

作者： Yu, Mengshan Fan, Guisheng Yu, Huiqun Chen, Liang Department of Computer Science and Engineering East China University of Science and Technology Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China

ISBN: (纸本)9783030794774

With the rapid development of the 5G and Internet of Things (IoT), mobile edge computing has gained considerable popularity in academic and industrial field, which provides physical resources closer to end users. Service recommendation in such a distributed environment is a hot issue. However, the cold-start problem for service recommendation in mobile edge computing is still urgent to be solved. In this paper, we propose a service recommendation method based on collaborative filtering (CF) and user location, by comprehensively considering the characteristic of services at the edge and mobility of users. In detail, we first synthesize the service characteristics of each dimension through multidimensional weighting method. We further introduce the idea of Inverse_CF_Rec to the traditional CF and then predict the lost QoS value to solve the problem of sparse data. Finally, a recommendation algorithm based on predicted QoS value and user geographic location is proposed to recommend appropriate services to users. The experimental results show that our multidimensional inverse similarity recommendation algorithm based on collaborative filtering (MDICF) outperforms Inverse_CF_Rec in terms of the accuracy of recommendation. © 2021, IFIP International Federation for Information Processing.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

iCTS: Iterative and Hierarchical Clock Tree Synthesis With Skew-Latency-Load Tree

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Li, Weiguo Huang, Zhipeng Yu, Bei Zhu, Wenxing Chen, Jian He, Zhixue Li, Xingquan South China University of Technology School of Software Engineering Guangzhou China Pengcheng Laboratory Shenzhen China Beijing Institute of Open Source Chip Beijing China Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong Hong Kong Fuzhou University Center for Discrete Mathematics and Theoretical Computer Science Fuzhou China

The advancement of modern clock tree synthesis (CTS) encounters a bottleneck, primarily due to the difficulty in achieving multi-objective co-optimization among complex design processes. To concurrently optimize skew, latency, and load capacitance, we propose an iterative and hierarchical CTS framework, which is composed of clustering, topology generation and routing, buffering, and optimization. First, we introduce a capacitance-based metric to achieve adaptive balanced clustering and optimize the cluster results through simulated annealing. Second, to construct a clock tree with lower latency, load capacitance, and skew, we introduce the skew-latency-load tree (SLLT), which combines the advantages of bound skew tree and Steiner shallow-light tree, and we propose an effective SLLT construction algorithm. Third, to further optimize CTS result by buffering, we introduce the critical wirelength evaluation (CWE) to evaluate the capability of each buffer, and propose the insertion delay estimation (IDE) to reduce the evaluation bias during buffering, then design the iterative skew convergence algorithm (ISCA) to achieve complete convergence of skew. We validate our solution using 28nm process technology. Compared to our method, the commercial tool increases skew, latency, and clock capacitance by 39.5%, 13.0%, and 18.5%, respectively, while the OpenROAD by 101.6%, 50.7%, and 25.5%, respectively. © 1982-2012 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Anomaly Detection for Multivariate Time Series Based on Contrastive Learning and Autoformer

Anomaly Detection for Multivariate Time Series Based on Cont...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xuwen Shang Jue Zhang Xingguo Jiang Hong Luo Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications Beijing China Department of Computer Science and Engineering Beihang University Beijing China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Nowadays, due to the increasingly complex and huge data flow, anomaly detection has become an important technology to ensure the high security and reliability of the systems. It helps identify unusual observations in the data, thereby protecting safety and reducing risk. However, in the field of multivariate temporal anomaly detection, there are still some difficulties in spatio-temporal correlation mining of variables, generalization ability in dealing with complex temporal sequences, and feature learning under different granularity. Therefore, we propose an unsupervised anomaly detection method for multivariate time series based on contrastive learning and Autoformer autoencoder. In order to fully explore the spatio-temporal correlation of time series data, this paper uses Graph Attention Network and Auto-Correlation to jointly learn spatio-temporal correlation, and obtain positive and negative pairs through time-domain and frequency-domain data augmentation. Finally, the Autoformer autoencoder is used for anomaly detection in a predictive manner. In the loss function section, a joint loss function is formed by introducing contrastive learning losses at the time step and time window granularity, combined with prediction loss, to improve the learning effect. This paper investigates the performance of the proposed method through experiments on the SMAP and MSL public datasets, and achieves better results than baseline methods.

关键词： Correlation Computational modeling Time series analysis Contrastive learning computer architecture Stability analysis Safety

来源：评论

学校读者我要写书评

暂无评论

Reasoning about Strategic Abilities in Stochastic Multi-agent Systems

arXiv

引用

arXiv 2024年

作者： Zhang, Yedi Song, Fu Chen, Taolue Wu, Xuzhi Department of Computing Science National University of Singapore Singapore State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China School of Computing and Mathematical Sciences Birkbeck University of London United Kingdom College of Computer Science and Software Engineering Shenzhen University China

Reasoning about strategic abilities is key to AI systems comprising multiple agents, which provide a unified framework for formalizing various problems in game theory, social choice theory, etc. In this work, we propose a probabilistic extension of the alternating-time μ-calculus (AMC), named PAMC, for reasoning about the strategic abilities of agents in stochastic multi-agent systems. We show that PAMC subsumes two existing logics AMC and PμTL (a probabilistic extension of the modal μ-calculus), but is incomparable with the probabilistic alternating-time temporal logic (PATL). We study the problems of model checking and satisfiability checking for PAMC. We first give a model checking algorithm by leveraging algorithms for solving normal-form games and AMC model checking. We establish that the model checking problem of PAMC remains in UP∩co-UP, the same complexity class as the model checking problem for AMC and PμTL. We also provide a new reduction from the satisfiability problem of PAMC to solving parity games, by which we obtain an EXPTIME decision procedure, as well as the small model property which allows to construct a model for each satisfiable PAMC formula. Satisfiability in PAMC has the same complexity as in the modal μ-calculus, unlike PCTL and PATL whose satisfiability checking problems remain open. We have implemented both the model checking and satisfiability checking algorithms as open-source tools. Experimental results are reported, showcasing the practical applications and effectiveness of our approaches. © 2024, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Defining and Detecting the Defects of the Large Language Model-based Autonomous Agents

arXiv

引用

arXiv 2024年

作者： Ning, Kaiwen Chen, Jiachi Zhang, Jingwen Li, Wei Wang, Zexu Feng, Yuming Zhang, Weizhe Zheng, Zibin The School of Software Engineering Sun Yat-Sen University Peng Cheng Laboratory China The School of Software Engineering Sun Yat-Sen University China The School of Computer Science and Technology Harbin Institute of Technology China Peng Cheng Laboratory China The Department of New Networks Peng Cheng Laboratory China

Artificial intelligence (AI) agents are systems capable of perceiving their environment, autonomously planning and executing tasks. Recent advancements in Large Language Models (LLMs) have introduced a transformative paradigm for AI agents, enabling them to interact with external resources and tools through prompt techniques. This advancement has significantly extended the capabilities of LLMs, positioning LLM-based AI Agents as an important research area. In such agents, the workflow integrates developer-written code, which manages framework construction and logic control, with LLM-generated natural language that enhances dynamic decision-making and interaction. However, discrepancies between developer-implemented logic and the dynamically generated content of LLMs in terms of behavior and expected outcomes can lead to defects, such as tool invocation failures and task execution errors. These issues introduce specific risks, leading to various defects in LLM-based AI Agents, including service interruptions and incorrect output. Despite the importance of these issues, there is a lack of systematic work that focuses on analyzing LLM-based AI Agents to uncover defects in their code. To address this gap, we present the first study focused on identifying and detecting defects in LLM Agents. We collected and analyzed 6, 854 relevant posts from StackOverflow to define and classify eight types of agent defects. For each defect type, we provided detailed descriptions and illustrated with an example. Then, we designed a static analysis tool, named Agentable, to detect the defined defects. Agentable leverages Code Property Graphs (CPGs) and LLMs to analyze Agent workflows by efficiently identifying specific code patterns and analyzing natural language descriptions. To evaluate Agentable, we constructed two datasets: AgentSet, which consists of 84 real-world Agent projects, and AgentTest, which contains 78 Agent projects specifically designed to include various types of defect

关键词： Autonomous agents

来源：评论

学校读者我要写书评

暂无评论

IBATree: A Novel Method for Interpretable Cancer Cell Diagnosis Using Information Bottleneck Attribution

IBATree: A Novel Method for Interpretable Cancer Cell Diagno...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Muhammad Umair Raza Jie Chen Adil Nawaz Faisal Saeed Victor C.M. Leung Jianqiang Li Zhaoxia Wang College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Gastroenterology Shenzhen Children’s Hospital China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Deep Neural Networks (DNNs) have demonstrated remarkable performance in classification and regression tasks on RGB-based pathological inputs. The network’s prediction mechanism must be interpretable to establish trust in the clinical routine. One principal approach to interpretation is feature attribution. Feature attribution methods identify the importance of input features for the output prediction. Building on the Information Bottleneck Attribution (IBA) method, we recognize the RGB’s input regions with high mutual information with the network’s output for each prediction. IBA identifies input regions that have sufficient predictive information. In this paper, we introduce "IBATree", a novel approach that combines IBA with decision trees to enhance both the interpretability and accuracy of DNNs in cancer cell classification. Our method leverages the information bottleneck framework to inject noise into feature maps and then isolates the most informative features for model predictions while maintaining high classification performance. We evaluated our proposed approach on three datasets—CNMC, ISBI2016, and BreaKHis—demonstrating competitive accuracy and producing clear interpretations. This makes IBATree particularly suitable for clinical applications, where understanding the rationale behind predictions is crucial. Our results show that IBATree provides reliable predictions and valuable insights into feature importance, paving the way for its application in various biomedical domains.

关键词： Pathology Accuracy Biological system modeling Noise Predictive models Reliability Decision trees Biological cells Cancer Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Explainable-AI-based two-stage solution for WSN object localization using zero-touch mobile transceivers

引用

science China(Information sciences) 2024年第7期67卷 27-45页

作者： Kai FANG Junxin CHEN Han ZHU Thippa Reddy GADEKALLU Xiaoping WU Wei WANG School of Mathematics and Computer Science Zhejiang A&F University School of Software Dalian University of Technology Faculty of Applied Sciences Macao Polytechnic University Department of Electrical and Computer Engineering Lebanese American University School of Information Engineering Huzhou University Guangdong-Hong Kong-Macao Joint Laboratory for Emotional Intelligence and Pervasive Computing Artificial Intelligence Research Institute Shenzhen MSU-BIT University

Artificial intelligence technology is widely used in the field of wireless sensor networks(WSN).Due to its inexplicability, the interference factors in the process of WSN object localization cannot be effectively eliminated. In this paper, an explainable-AI-based two-stage solution is proposed for WSN object localization. In this solution, mobile transceivers are used to enlarge the positioning range and eliminate the blind area for object localization. The motion parameters of transceivers are considered to be unavailable,and the localization problem is highly nonlinear with respect to the unknown parameters. To address this,an explainable AI model is proposed to solve the localization problem. Since the relationship among the variables is difficult to fully include in the first-stage traditional model, we develop a two-stage explainable AI solution for this localization problem. The two-stage solution is actually a comprehensive consideration of the relationship between variables. The solution can continue to use the constraints unused in the firststage during the second-stage, thereby improving the performance of the solution. Therefore, the two-stage solution has stronger robustness compared to the closed-form solution. Experimental results show that the performance of both the two-stage solution and the traditional solution will be affected by numerical changes in unknown parameters. However, the two-stage solution performs better than the traditional solution, especially with a small number of mobile transceivers and sensors or in the presence of high noise. Furthermore,we have also verified the feasibility of the proposed explainable-AI-based two-stage solution.

关键词： explainable AI object localization semidefinite relaxation mobile transceiver two-stage solution closed-form solution

来源：评论

学校读者我要写书评

暂无评论

Weighted Poisson-disk Resampling on Large-Scale Point Clouds

arXiv

引用

arXiv 2024年

作者： Jiao, Xianhe Lv, Chenlei Zhao, Junli Yi, Ran Wen, Yu-Hui Pan, Zhenkuan Wu, Zhongke Liu, Yong-Jin College of Computer Science and Technology Qingdao University China College of Computer Science and Software Engineering Shenzhen University China Department of Computer Science and Engineering Shanghai Jiao Tong University China School of Computer Science & Technology Beijing Jiaotong University China School of Artificial Intelligence Beijing Normal University China Department of Computer Science and Technology MOE-Key Laboratory of Pervasive Computing Tsinghua University China

For large-scale point cloud processing, resampling takes the important role of controlling the point number and density while keeping the geometric consistency. However, current methods cannot balance such different requirements. Particularly with large-scale point clouds, classical methods often struggle with decreased efficiency and accuracy. To address such issues, we propose a weighted Poisson-disk (WPD) resampling method to improve the usability and efficiency for the processing. We first design an initial Poisson resampling with a voxel-based estimation strategy. It is able to estimate a more accurate radius of the Poisson-disk while maintaining high efficiency. Then, we design a weighted tangent smoothing step to further optimize the Voronoi diagram for each point. At the same time, sharp features are detected and kept in the optimized results with isotropic property. Finally, we achieve a resampling copy from the original point cloud with the specified point number, uniform density, and high-quality geometric consistency. Experiments show that our method significantly improves the performance of large-scale point cloud resampling for different applications, and provides a highly practical solution. Copyright © 2024, The Authors. All rights reserved.

关键词： Poisson distribution

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Middlebox Detection: Evasion and Effectiveness

Middlebox Detection: Evasion and Effectiveness

引用

International Black Sea Conference on Communications and Networking (BlackSeaCom)

作者： Vahab Pournaghshband Hassan Pournaghshband Eric Vance Computer Science Department University of San Francisco San Francisco USA Software Engineering Department Kennesaw State University Atlanta USA Jet Propulsion Laboratory NASA Pasadena USA

ISBN: (数字)9798350351859

ISBN: (纸本)9798350351866

Network middleboxes are crucial for the security and efficiency of modern Internet infrastructure, performing various tasks that necessitate robust detection and localization tools. Traditional detection strategies often overlook the adaptability of these middleboxes, which can actively avoid detection. To address this, our paper examines how adversaries can manipulate network traffic to undermine detection tools, focusing on strict priority queueing (SPQ) as an example. We introduce an adversary model that uses SPQ to mask discriminatory traffic handling from detection tools. Simulations show that under specific conditions, a middlebox can successfully evade detection by standard SPQ detection tools.

关键词： Location awareness Adaptation models Focusing Telecommunication traffic Middleboxes Security Task analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：