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

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (纸本)9798400706868

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3D-AD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Investigating Efficacy of Perplexity in Detecting LLM-Generated Code

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Multi-Hierarchy Metamorphic Testing for Hyphenated Words in Machine Translation

Multi-Hierarchy Metamorphic Testing for Hyphenated Words in ...

引用

Asia-Pacific Conference on software Engineering

作者： Rui Zhu Chuanqi Tao Jerry Gao College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Ministry Key Laboratory for Safety-Critical Software Development and Verification Nanjing University of Aeronautics and Astronautics Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Computer Engineering Department San Jose State University San Jose USA

ISBN: (数字)9798331534011

ISBN: (纸本)9798331534028

With the advancement of deep neural networks, machine translation has seen rapid progress in recent years. Individuals often rely on machine translation software to facil-itate various tasks. However, the intricacies of neural networks can lead to translation errors, resulting in misunderstandings or conflicts. The most common method for testing machine translation is metamorphic testing. However, metamorphic testing at the phrase or sentence hierarchy may result in some test cases being incorrectly identified as failures. To mitigate this issue, we added the word hierarchy. We proposed a multi-hierarchy metamorphic testing method, MHT, to test machine translation. Hyphenated words as a specific format prone to translation errors, which are chosen as our research object. Based on the common notion that translations of words within the same sentence should be similar, we extract contents from different hierarchies within sentences containing hyphenated words and compare the similarity of their corresponding translations for these specific words. We conducted the experiments on 881 sentences leveraging Google Translate, Microsoft Bing Translator, and Baidu Translate, which detected 111, 91, and 111 suspicious errors with high precision (78.4 %, 82.4 %, and 81.1 %). Translation errors mainly include mis-translation, under-translation, over-translation, and non-translation.

关键词： Translation Web and internet services Artificial neural networks software Internet Machine translation Usability Testing software engineering

来源：评论

学校读者我要写书评

暂无评论

UA-HGAT: Uncertainty-aware Heterogeneous Graph Attention Network for Short Text Classification 15

UA-HGAT: Uncertainty-aware Heterogeneous Graph Attention Net...

引用

2022 IEEE Congress on Cybermatics: 15th IEEE International Conferences on Internet of Things, iThings 2022, 18th IEEE International Conferences on Green Computing and Communications, GreenCom 2022, 2022 IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2022 and 8th IEEE International Conference on Smart Data, SmartData 2022

作者： Kong, DeYan Ji, ZhenYan Sang, Yanjuan Dong, Wei Yang, Yanyan Beijing Jiaotong University School of Software Engineering Beijing China Blueintelligence Technology Co.Ltd. R&d Department Wuhan China Institute of Software Chinese Academy of Sciences State Key Laboratory of Computer Science Beijing100190 China

ISBN: (数字)9781665454179

ISBN: (纸本)9781665454179

During the last decade, deep learning has played a significant role in improving text classification which is widely applied in question answering systems, comment extraction, sentiment analysis, etc. Considering that few labeled training data are available, semi-supervised short text classification needs to be studied urgently. Existing works focus on long texts and cannot achieve satisfactory performance on short texts due to the sparsity, non-standardization, and insufficient labeled data. In this paper, we propose a novel uncertainty-aware heterogeneous graph attention network for semi-supervised short text classification (UA-HGAT), which makes full use of limited labeled data and large amounts of unlabeled data via exploiting an uncertainty-aware mechanism. In the model, entity description from Wikipedia is introduced to empower short texts, and word-level information is acquired by Word2Vec. The entity description and word-level information are combined with topic information to address the issue of short text sparseness. In particular, we introduce uncertainty-aware mechanism and negative sample learning to relieve the erroneous high confidence predictions from poorly calibrated models, so that it can offer enough pseudo-label samples for the model training. Extensive experiments show that our model significantly outperforms the SOTA methods on AGNews and Snippets datasets. © 2022 IEEE.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

WTDUN: Wavelet Tree-Structured Sampling and Deep Unfolding Network for Image Compressed Sensing

arXiv

引用

arXiv 2024年

作者： Han, Kai Wang, Jin Shi, Yunhui Cai, Hanqin Ling, Nam Yin, Baocai Beijing Key Laboratory of Multimedia and Intelligent Software Technology Beijing Institute of Artificial Intelligence School of Information Science and Technology Beijing University of Technology China School of Computer Science Beijing University of Technology China The Department of Statistics and Data Science The Department of Computer Science University of Central Florida United States The Department of Computer Science and Engineering Santa Clara University United States

Deep unfolding networks have gained increasing attention in the field of compressed sensing (CS) owing to their theoretical interpretability and superior reconstruction performance. However, most existing deep unfolding methods often face the following issues: 1) they learn directly from single-channel images, leading to a simple feature representation that does not fully capture complex features;and 2) they treat various image components uniformly, ignoring the characteristics of different components. To address these issues, we propose a novel wavelet-domain deep unfolding framework named WTDUN, which operates directly on the multi-scale wavelet subbands. Our method utilizes the intrinsic sparsity and multi-scale structure of wavelet coefficients to achieve a tree-structured sampling and reconstruction, effectively capturing and highlighting the most important features within images. Specifically, the design of tree-structured reconstruction aims to capture the inter-dependencies among the multi-scale subbands, enabling the identification of both fine and coarse features, which can lead to a marked improvement in reconstruction quality. Furthermore, a wavelet domain adaptive sampling method is proposed to greatly improve the sampling capability, which is realized by assigning measurements to each wavelet subband based on its importance. Unlike pure deep learning methods that treat all components uniformly, our method introduces a targeted focus on important subbands, considering their energy and sparsity. This targeted strategy lets us capture key information more efficiently while discarding less important information, resulting in a more effective and detailed reconstruction. Extensive experimental results on various datasets validate the superior performance of our proposed method. Copyright © 2024, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

On the convergence and improvement of stochastic normalized gradient descent

引用

science China(Information sciences) 2021年第3期64卷 105-117页

作者： Shen-Yi ZHAO Yin-Peng XIE Wu-Jun LI National Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing University

Non-convex models, like deep neural networks, have been widely used in machine learning applications. Training non-convex models is a difficult task owing to the saddle points of models. Recently,stochastic normalized gradient descent(SNGD), which updates the model parameter by a normalized gradient in each iteration, has attracted much attention. Existing results show that SNGD can achieve better performance on escaping saddle points than classical training methods like stochastic gradient descent(SGD).However, none of the existing studies has provided theoretical proof about the convergence of SNGD for non-convex problems. In this paper, we firstly prove the convergence of SNGD for non-convex ***, we prove that SNGD can achieve the same computation complexity as SGD. In addition, based on our convergence proof of SNGD, we find that SNGD needs to adopt a small constant learning rate for convergence guarantee. This makes SNGD do not perform well on training large non-convex models in practice. Hence, we propose a new method, called stagewise SNGD(S-SNGD), to improve the performance of SNGD. Different from SNGD in which a small constant learning rate is necessary for convergence guarantee,S-SNGD can adopt a large initial learning rate and reduce the learning rate by stage. The convergence of S-SNGD can also be theoretically proved for non-convex problems. Empirical results on deep neural networks show that S-SNGD achieves better performance than SNGD in terms of both training loss and test accuracy.

关键词： non-convex problems stochastic normalized gradient descent computation complexity

来源：评论

学校读者我要写书评

暂无评论

ATOM: Automated Black-Box Testing of Multi-Label Image Classification Systems

ATOM: Automated Black-Box Testing of Multi-Label Image Class...

引用

IEEE International Conference on Automated software Engineering (ASE)

作者： Shengyou Hu Huayao Wu Peng Wang Jing Chang Yongjun Tu Xiu Jiang Xintao Niu Changhai Nie Department of Computer Science and Technology State Key Laboratory for Novel Software Technology Nanjing University China Guangdong OPPO Mobile Telecommunications Corp. Ltd. China

Multi-label Image Classification Systems (MICSs) developed based on Deep Neural Networks (DNNs) are extensively used in people's daily life. Currently, although there are a variety of approaches to test DNN-based systems, they typically rely on the internals of DNNs to design test cases, and do not take the core specification of MICS (i.e., correctly recognizing multiple objects in a given image) into account. In this paper, we propose ATOM, an automated and systematic black-box testing framework for testing MICS. Specifically, ATOM exploits the label combination as the testing adequacy criteria, hoping to systematically examine the impact of correlations between a fixed number of labels on the classification ability of MICS. Then, ATOM leverages image search engine and natural language processing to find test images that are not only common to the real-world, but also relevant to target label combinations. Finally, ATOM combines metamorphic testing and label information to realize test oracle identification, based on which the ability of MICS in classifying different label combinations is evaluated. To evaluate the effectiveness of ATOM, we have performed experiments on two popular datasets of MICS, VOC and COCO (each with five state-of-the-art DNN models), and one real-world photo tagging application from our industrial partner. The experimental results reveal that the performance of current DNN-based MICSs remains less satisfactory even in recognizing correlations between only two labels, as ATOM triggers a total number of 6,049 such label combination related errors for all MICSs studied. In particular, ATOM reports 587 error-revealing images for the industrial MICS, in which 92% of them are confirmed by the developers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

JavaBench: A Benchmark of Object-Oriented Code Generation for Evaluating Large Language Models

arXiv

引用

arXiv 2024年

作者： Cao, Jialun Chen, Zhiyong Wu, Jiarong Cheung, Shing-Chi Xu, Chang Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong Guangzhou HKUST Fok Ying Tung Research Institute Guangzhou China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

Code generation benchmarks such as HumanEval are widely adopted to evaluate LLMs’ capabilities. However, after consolidating the latest 24 benchmarks, we noticed three significant imbalances. First, imbalanced programming language. 95.8% of benchmarks involve Python, while only 5 benchmarks involve Java, resulting in an insufficient understanding of LLMs’ capability to generate Java code. Second, imbalanced code granularity. Function-/statement-level benchmarks account for over 83.3% of benchmarks. Only a mere handful extends to class-/project-levels, and all are limited to Python. Third, lacking advanced features. Existing benchmarks primarily assess basic coding skills (e.g., variables, operators, and control structures), while overlooking advanced Object-Oriented Programming (OOP) features (i.e., encapsulation, inheritance, and polymorphism). Considering the prevalence of these advanced features in real-world Java project development, constructing benchmarks to test LLMs on handling OOP features is necessary. To fill these gaps, we propose JavaBench, a project-level Java benchmark that exercises OOP features. It comprises four Java projects with 389 methods in 106 Java classes. The test coverage is up to 92%, and JavaBench is attested by 282 undergraduate students, reaching a 90.93/100 average score (i.e., pass rate against the test suite), ensuring the quality of documentation, code skeleton, and tests. To better evaluate LLM’s capability against JavaBench, we introduce a systematic evaluation design covering three context settings and five synthesis strategies at two granularities using three hierarchical metrics. Our extensive experiment yields several interesting findings. First, we noticed that regarding project-level Java programming, LLMs are far behind undergraduate students (no project can be correctly completed by any studied LLMs, and at most 41.17% Pass@5 in a more relaxed evaluation). Second, using method signature as prompt context may strike an ide

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Resource Scheduling Method with Edge Channel Deployment for BPM 19

An Intelligent Resource Scheduling Method with Edge Channel ...

引用

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

作者： Liu, Bowen Dou, Wanchun Zhou, Xiaokang Zhang, Xuyun Qi, Lianyong Dai, Fei Chen, Chaochao Nanjing University State Key Laboratory for Novel Software Technology Nanjing China Shiga University Faculty of Data Science Hikone Japan Macquarie University Department of Computing Sydney Australia College of Computer and Software Qingdao China Southwest Forestry University College of Big Data and Intelligent Engineering Kunming China Zhejiang University College of Computer Science and Technology Hangzhou China

ISBN: (纸本)9798350346558

Edge computing is a novel computing paradigm that offers kinds of resources at the network edge. In edge computing, terminal users are connected to edge servers via the wireless network and there are various channels in each wireless link. These wireless channels are limited resource while different channel has different cost and service ability. The dynamic changes of users' status make it harder to find an appropriate method to satisfy the BPM requirements of channel deployment. With this observation, it is a tricky challenge to make a trade-off between the system cost(rental price) and the service ability(number of users). In view of this challenge, an intelligent resource scheduling method, named EdgeIRS, is proposed in this paper. In the technical sense, the EdgeIRS method can accommodate most users at the edge with a minimum cost of deploying channel resources in an online way. Its performance is analyzed theoretically and the experiments verify the superiority of the method. © 2022 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

On the robustness of median sampling in noisy evolutionary optimization

引用

science China(Information sciences) 2021年第5期64卷 32-44页

作者： Chao BIAN Chao QIAN Yang YU Ke TANG State Key Laboratory for Novel Software Technology Nanjing University Shenzhen Key Laboratory of Computational Intelligence Department of Computer Science and EngineeringSouthern University of Science and Technology

Evolutionary algorithms(EAs) are a sort of nature-inspired metaheuristics, which have wide applications in various practical optimization problems. In these problems, objective evaluations are usually inaccurate, because noise is almost inevitable in real world, and it is a crucial issue to weaken the negative effect caused by noise. Sampling is a popular strategy, which evaluates the objective a couple of times, and employs the mean of these evaluation results as an estimate of the objective value. In this work, we introduce a novel sampling method, median sampling, into EAs, and illustrate its properties and usefulness theoretically by solving OneMax, the problem of maximizing the number of 1 s in a bit string. Instead of the mean, median sampling employs the median of the evaluation results as an estimate. Through rigorous theoretical analysis on OneMax under the commonly used onebit noise, we show that median sampling reduces the expected runtime exponentially. Next, through two special noise models, we show that when the 2-quantile of the noisy fitness increases with the true fitness, median sampling can be better than mean sampling; otherwise,it may fail and mean sampling can be better. The results may guide us to employ median sampling properly in practical applications.

关键词： evolutionary algorithms noisy optimization median sampling computational complexity runtime analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：