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

arXiv 2024年

作者： Xu, Jinwei Zhang, He Yang, Yanjin Cheng, Zeru Lyu, Jun Liu, Bohan Zhou, Xin Yang, Lanxin Bacchelli, Alberto Chiam, Yin Kia Chiew, Thiam Kian State Key Laboratory of Novel Software Technology Software Institute Nanjing University Nanjing210008 China Department of Informatics University of Zürich Zürich8006 Switzerland Department of Software Engineering Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur50603 Malaysia

Large language model-generated code (LLMgCode) has become increasingly prevalent in software development. Many studies report that LLMgCode has more quality and security issues than human-authored code (HaCode). It is common for LLMgCode to mix with HaCode in a code change, while the change is signed by only human developers, without being carefully checked. Many automated methods have been proposed to detect LLMgCode from HaCode, in which the perplexity-based method (PERPLEXITY for short) is the state-of-the-art method. However, the efficacy evaluation of PERPLEXITY has focused on the detection accuracy. In this article, we are interested in whether PERPLEXITY is good enough in a wider range of realistic evaluation settings. To this end, we devise a large-scale dataset that includes 11,664 HaCode snippets and 13,164 LLMgCode snippets, and based on that, we carry out a family of experiments to compare PERPLEXITY against feature-based and pre-training-based methods from three perspectives: (1) detection accuracy in terms of programming language, degree of difficulty, and scale of solution, (2) generalization capability, and (3) inference efficiency. The experimental results show that PERPLEXITY has the best generalization capability while it has low accuracy and efficiency in most cases. Based on the experimental results and detection mechanism of PERPLEXITY, we discuss implications into both the strengths and limitations of PERPLEXITY, e.g., PERPLEXITY is unsuitable for high-level programming languages while it has good interpretability. As the first large-scale investigation on detecting LLMgCode from HaCode, this article provides a wide range of evidence for future improvement. Copyright © 2024, The Authors. All rights reserved.

关键词： High level languages

来源：评论

学校读者我要写书评

暂无评论

Policy Learning from Tutorial Books via Understanding, Rehearsing and Introspecting 38

Policy Learning from Tutorial Books via Understanding, Rehea...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Chen, Xiong-Hui Wang, Ziyan Du, Yali Jiang, Shengyi Fang, Meng Yu, Yang Wang, Jun National Key Laboratory for Novel Software Technology Nanjing University China School of Artificial Intelligence Nanjing University China Cooperative AI Lab Department of Informatics King's College London United Kingdom AI Centre Department of Computer Science University College London United Kingdom University of Liverpool United Kingdom The University of Hong Kong Hong Kong

When humans need to learn a new skill, we can acquire knowledge through written books, including textbooks, tutorials, etc. However, current research for decision-making, like reinforcement learning (RL), has primarily required numerous real interactions with the target environment to learn a skill, while failing to utilize the existing knowledge already summarized in the text. The success of Large Language Models (LLMs) sheds light on utilizing such knowledge behind the books. In this paper, we discuss a new policy learning problem called Policy Learning from tutorial Books (PLfB) upon the shoulders of LLMs' systems, which aims to leverage rich resources such as tutorial books to derive a policy network. Inspired by how humans learn from books, we solve the problem via a three-stage framework: Understanding, Rehearsing, and Introspecting (URI). In particular, it first rehearses decision-making trajectories based on the derived knowledge after understanding the books, then introspects about the imaginary dataset to distill a policy network. We build two benchmarks for PLfB based on Tic-Tac-Toe and Football games. In the experiment, URI's policy achieves a minimum of 44% net winning rate against GPT-based agents without any real data. In the much more complex football game, URI's policy beat the built-in AIs with a 37% winning rate while GPT-based agents can only achieve a 6% winning rate. The project page: ***. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

IIoT Mobile Business Data Placement Strategy Based on Bayesian Optimization Algorithm 24

IIoT Mobile Business Data Placement Strategy Based on Bayesi...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data science and Systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Shen, Zhijie Liu, Bowen Xu, Xiaolong Qi, Lianyong Dai, Fei Dou, Wanchun State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Shenzhen China College of Big Data and Intelligent Engineering Southwest Forestry University Kunming China Qingdao China School of Computer Science Nanjing University of Information Science and Technology Nanjing China

ISBN: (纸本)9798350319934

As a standardized and systematic management method, business process management plays an important role in the industrial Internet of Things (IIoT) scenario. With the rapid development of mobile Internet and the increasing amount of data generated by the Internet of Things devices, the traditional storage scheme can no longer meet the requirements of managing the IIoT mobile business data. The cloud-edge collaborative data storage scheme provides mass storage capability by the cloud data center, and meanwhile takes access delay into account by storing data in the edge servers near to user, making it an effective solution to manage mobile business data in the IIoT scenario. However, the storage capacity of edge servers is relatively limited. How to design a reasonable data placement strategy to maximize the speed of data reading and tasks execution in IIoT business process has become an urgent problem to be solved. In order to shorten the overall running time, reduce data transmission costs and enhance users experience, we propose a data placement strategy based on Bayesian optimization algorithm, which can reasonably allocate storage capacity in the edge side, and further determine which edge server the data should be placed on. The results of the experiment show that the strategy based on our proposed algorithm performs better in a variety of different scenarios than the ones that based on other kind of optimization algorithms which have been adopted in similar studies. © 2022 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree

arXiv

引用

arXiv 2024年

作者： Carlson, Charlie Chen, Xiaoyu Feng, Weiming Vigoda, Eric Department of Computer Science University of California Santa Barbara United States State Key Laboratory for Novel Software Technology New Cornerstone Science Laboratory Nanjing University China Institute for Theoretical Studies ETH Zürich Switzerland

We address the convergence rate of Markov chains for randomly generating an edge coloring of a given tree. Our focus is on the Glauber dynamics which updates the color at a randomly chosen edge in each step. For a tree T with n vertices and maximum degree ∆, when the number of colors q satisfies q ≥ ∆ + 2 then we prove that the Glauber dynamics has an optimal relaxation time of O(n), where the relaxation time is the inverse of the spectral gap. This is optimal in the range of q in terms of ∆ as Dyer, Goldberg, and Jerrum (2006) showed that the relaxation time is Ω(n3) when q = ∆ + 1. For the case q = ∆ + 1, we show that an alternative Markov chain which updates a pair of neighboring edges has relaxation time O(n). Moreover, for the ∆-regular complete tree we prove O(n log2 n) mixing time bounds for the respective Markov chain. Our proofs establish approximate tensorization of variance via a novel inductive approach, where the base case is a tree of height = O(∆2 log2 ∆), which we analyze using a canonical paths argument. Copyright © 2024, The Authors. All rights reserved.

关键词： Mixing

来源：评论

学校读者我要写书评

暂无评论

A Method of Multidimensional software Aging Prediction Based on Ensemble Learning: A Case of Android Os

SSRN

引用

SSRN 2023年

作者： Nie, Yuge Chen, Yulei Jiang, Yujia Wu, Huayao Yin, Beibei Cai, Kai-Yuan Beihang University School of Automation Science and Electrical Engineering Beijing100083 China Nanjing University State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing210023 China

Context: software aging refers to the phenomenon of performance degradation, increasing failure rate, or system crash due to resource consumption and error accumulation in software systems running for a long time. Precisely predicting software aging is crucial for enabling proactive measures before the situation substantially deteriorates. Previous machine learning (ML) methods for predicting aging predominantly rely on a single ML modeland a single labeling metric to attain their objectives. Furthermore, a common limitation shared by these methods is that training and prediction data stem from identical operational profiles. This could pose challenges for these models in delivering the desired performance when confronted with diverse user scenarios. Objective: In this paper, we aim to find a method that can both consistently and precisely predict aging trends across a wide range of application scenarios. Method: We propose a method of multidimensional software aging prediction based on ensemble learning called MSAP. Unlike the previous full-process single-threaded approaches, in the framework of MSAP, five dimensions including datasets, labeling metrics, labeling thresholds, algorithms, and model decisions are extracted and diversified to protest against diverse user scenarios and aging situations. Results: When subjected to identical workloads, MSAP demonstrates comparable performance to the majority of unidimensional models, albeit without significant prominence. Under different workloads, MSAP consistently outperforms unidimensional models whose performance drops dramatically in terms of precision, maintaining a notable lead while exhibiting minimal fluctuations. Conclusion: MSAP exhibits exceptional stability while concurrently upholding outstanding prediction precision across a spectrum of user scenarios. Therefore, it has better generalization characteristics and application prospects. © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Multi-agent dynamic algorithm configuration 22

Multi-agent dynamic algorithm configuration

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Ke Xue Jiacheng Xu Lei Yuan Miqing Li Chao Qian Zongzhang Zhang Yang Yu State Key Laboratory for Novel Software Technology Nanjing University State Key Laboratory for Novel Software Technology Nanjing University and Polixir Technologies CERCIA School of Computer Science University of Birmingham

ISBN: (纸本)9781713871088

Automated algorithm configuration relieves users from tedious, trial-and-error tuning tasks. A popular algorithm configuration tuning paradigm is dynamic algorithm configuration (DAC), in which an agent learns dynamic configuration policies across instances by reinforcement learning (RL). However, in many complex algorithms, there may exist different types of configuration hyperparameters, and such heterogeneity may bring difficulties for classic DAC which uses a single-agent RL policy. In this paper, we aim to address this issue and propose multi-agent DAC (MA-DAC), with one agent working for one type of configuration hyperparameter. MA-DAC formulates the dynamic configuration of a complex algorithm with multiple types of hyperparameters as a contextual multi-agent Markov decision process and solves it by a cooperative multi-agent RL (MARL) algorithm. To instantiate, we apply MA-DAC to a well-known optimization algorithm for multi-objective optimization problems. Experimental results show the effectiveness of MA-DAC in not only achieving superior performance compared with other configuration tuning approaches based on heuristic rules, multi-armed bandits, and single-agent RL, but also being capable of generalizing to different problem classes. Furthermore, we release the environments in this paper as a benchmark for testing MARL algorithms, with the hope of facilitating the application of MARL.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FM-FCN:A Neural Network with Filtering Modules for Accurate Vital Signs Extraction

引用

Research 2025年第1期2024卷 92-106页

作者： Fangfang Zhu Qichao Niu Xiang Li Qi Zhao Honghong Su Jianwei Shuai Department of Physics and Fujian Provincial Key Laboratory for Soft Functional Materials ResearchXiamen UniversityXiamen 361005China National Institute for Data Science in Health and Medicine and State Key Laboratory of Cellular Stress BiologyInnovation Center for Cell Signaling NetworkXiamen UniversityXiamen 361005China Vitalsilicon Technology Co.Ltd. JiaxingZhejiang 314006China School of Computer Science and Software Engineering University of Science and Technology LiaoningAnshan 114051China Yangtze Delta Region Institute of Tsinghua University ZhejiangJiaxing 314006China Wenzhou Institute University of Chinese Academy of SciencesWenzhou 325001China Oujiang Laboratory (Zhejiang Lab for Regenerative Medicine Vision and Brain Health)Wenzhou 325001China

Neural networks excel at capturing local spatial patterns through convolutional modules,but they may struggle to identify and effectively utilize the morphological and amplitude periodic nature of physiological *** this work,we propose a novel network named filtering module fully convolutional network(FM-FCN),which fuses traditional filtering techniques with neural networks to amplify physiological signals and suppress ***,instead of using a fully connected layer,we use an FCN to preserve the time-dimensional correlation information of physiological signals,enabling multiple cycles of signals in the network and providing a basis for signal ***,we introduce the FM as a network module that adapts to eliminate unwanted interference,leveraging the structure of the *** approach builds a bridge between deep learning and signal processing ***,we evaluate the performance of FM-FCN using remote *** results demonstrate that FM-FCN outperforms the second-ranked method in terms of both blood volume pulse(BVP)signal and heart rate(HR)*** substantially improves the quality of BVP waveform reconstruction,with a decrease of 20.23%in mean absolute error(MAE)and an increase of 79.95%in signal-to-noise ratio(SNR).Regarding HR estimation accuracy,FM-FCN achieves a decrease of 35.85%in MAE,29.65%in error standard deviation,and 32.88%decrease in 95%limits of agreement width,meeting clinical standards for HR accuracy *** results highlight its potential in improving the accuracy and reliability of vital sign measurement through high-quality BVP signal *** codes and datasets are available online at https://***/zhaoqi106/FM-FCN.

关键词： physiological signalsin filtering module fully convolutional network fm fcn which vital signs extraction amplify physiological signals convolutional modulesbut neural networks filtering module capturing local spatial patterns

来源：评论

学校读者我要写书评

暂无评论

3D Gaussian Splatting: Survey, Technologies, Challenges, and Opportunities

arXiv

引用

arXiv 2024年

作者： Bao, Yanqi Ding, Tianyu Huo, Jing Liu, Yaoli Li, Yuxin Li, Wenbin Gao, Yang Luo, Jiebo State Key Laboratory for Novel Software Technology Nanjing University 210023 China Applied Sciences Group Microsoft Corporation Redmond United States Department of Computer Science University of Rochester United States

3D Gaussian Splatting (3DGS) has emerged as a prominent technique with the potential to become a mainstream method for 3D representations. It can effectively transform multiview images into explicit 3D Gaussian through efficient training, and achieve real-time rendering of novel views. This survey aims to analyze existing 3DGS-related works from multiple intersecting perspectives, including related tasks, technologies, challenges, and opportunities. The primary objective is to provide newcomers with a rapid understanding of the field and to assist researchers in methodically organizing existing technologies and challenges. Specifically, we delve into the optimization, application, and extension of 3DGS, categorizing them based on their focuses or motivations. Additionally, we summarize and classify nine types of technical modules and corresponding improvements identified in existing works. Based on these analyses, we further examine the common challenges and technologies across various tasks, proposing potential research opportunities. © 2024, CC BY.

关键词： 3D modeling

来源：评论

学校读者我要写书评

暂无评论

Time and Cost-Efficient Cloud Data Transmission based on Serverless Computing Compression

Time and Cost-Efficient Cloud Data Transmission based on Ser...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Rong Gu Xiaofei Chen Haipeng Dai Shulin Wang Zhaokang Wang Yaofeng Tu Yihua Huang Guihai Chen State Key Laboratory for Novel Software Technology Nanjing University China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics China ZTE Cooperation China

Nowadays, there exists a lot of cross-region data transmission demand on cloud. It is promising to use serverless computing for compressing data to save the transmission data amount. However, it is challenging to estimate the data transmission time and monetary cost with serverless compression. In addition, minimizing the data transmission cost is non-trivial due to enormous parameter space and joint optimization. This paper focuses on this problem and makes the following contributions: (1) We propose empirical data transmission time and monetary cost models based on serverless compression. (2) For single-task cloud data transmission, we propose two efficient parameter search methods based on Sequential Quadratic Programming (SQP ) and Eliminate then Divide and Conquer (EDC), which are theoretically proven with error upper bounds. (3) Furthermore, for multi-task cloud data transmission, a parameter search method based on dynamic programming and numerical computation is proposed to reduce the algorithm complexity from exponential to linear complexity. We have implemented the entire actual system and evaluated it with various workloads and application cases on the real-world AWS serverless computing platform. Experimental results on cross-region public cloud show that the proposed approach can improve the parameter search efficiency by more than 3× compared with the state-of-art parameter search methods and achieves better parameter quality. Compared with other competing cloud data transmission approaches, our approach is able to achieve higher time efficiency and lower monetary cost.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A FRAMEWORK FOR SAFE PROBABILISTIC INVARIANCE VERIFICATION OF STOCHASTIC DYNAMICAL SYSTEMS

arXiv

引用

arXiv 2024年

作者： Wu, Taoran Yu, Yiqing Xia, Bican Wang, Ji Xue, Bai Key Laboratory of System Software Chinese Academy of Sciences State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Department of Information Science School of Mathematical Sciences Peking University China State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology China

Ensuring safety through set invariance has proven to be a valuable method in various robotics and control applications. This paper introduces a comprehensive framework for the safe probabilistic invariance verification of both discrete- and continuous-time stochastic dynamical systems over an infinite time horizon. The objective is to ascertain the lower and upper bounds of liveness probabilities for a given safe set and set of initial states. The liveness probability signifies the likelihood of the system remaining within the safe set indefinitely, starting from a state in the initial set. To address this problem, we propose optimizations for verifying safe probabilistic invariance in discrete-time and continuous-time stochastic dynamical systems. These optimizations are constructed via either using the Doob’s nonnegative supermartingale inequality-based method or relaxing the equations described in [30,32], which can precisely characterize the probability of reaching a target set while avoiding unsafe states. Finally, we demonstrate the effectiveness of these optimizations through several examples using semi-definite programming tools. Copyright © 2024, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：