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

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Liang, Hanzhe Xie, Guoyang Hou, Chengbin Wang, Bingshu Gao, Can Wang, Jinbao College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Audencia Financial Technology Institute Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Intelligent Manufacturing CATL Ningde China School of Computing and Artificial Intelligence Fuyao University of Science and Technology Fuzhou China School of Software Northwestern Polytechnical University Xi’an China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China

ISBN: (纸本)157735897X

3D anomaly detection has recently become a significant focus in computer vision. Several advanced methods have achieved satisfying anomaly detection performance. However, they typically concentrate on the external structure of 3D samples and struggle to leverage the internal information embedded within samples. Inspired by the basic intuition of why not look inside for more, we introduce a straightforward method named Internal Spatial Modality Perception (ISMP) to explore the feature representation from internal views fully. Specifically, our proposed ISMP consists of a critical perception module, Spatial Insight Engine (SIE), which abstracts complex internal information of point clouds into essential global features. Besides, to better align structural information with point data, we propose an enhanced key point feature extraction module for amplifying spatial structure feature representation. Simultaneously, a novel feature filtering module is incorporated to reduce noise and redundant features for further aligning precise spatial structure. Extensive experiments validate the effectiveness of our proposed method, achieving object-level and pixel-level AUROC improvements of 4.2% and 13.1%, respectively, on the Real3D-AD benchmarks. Note that the strong generalization ability of SIE has been theoretically proven and is verified in both classification and segmentation tasks. © 2025, Association for the Advancement of Artificial intelligence (***). All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Natural Language Processing in Virtual Assistants Current Approaches and Challenges

Natural Language Processing in Virtual Assistants Current Ap...

引用

science, Technology, engineering and Management (ICSTEM), International Conference on

作者： Gautam Solaimalai J. Maria Shanthi Sampath Kumar S Priyanka Khabiya K. Geetha Gokul Talele US. Bank Software Engineering Manager Georgia United States of America Department of Artificial Intelligence and Machine Learning J B. Institute of Engineering and Technology Hyderabad Telangana India Department of Computer Science and Engineering Sri Eshwar College of Engineering Coimbatore Tamil Nadu India Department of Computer Science Engineering Mandsaur University Mandsaur Madhya Pradesh India Department of Computer Science G. T.N Arts College Dindigul Tamil Nadu India Department of Data Science Organization name Accenture Pune Maharashtra India

ISBN: (数字)9798350376913

ISBN: (纸本)9798350388473

The proliferation of virtual sidekicks in colorful disciplines has prodded a swell of interest in advancing Natural Language Processing(NLP) ways to enhance their effectiveness. This paper provides a comprehensive review of the current approaches and challenges encountered in integrating NLP into virtual sidekicks. It begins by outlining the foundational generalities of NLP and its vital part in enabling mortal- suchlike relations with virtual sidekicks. latterly, it delves into a discussion of the different methodologies employed in NLP for understanding and generating mortal language, ranging from rule-grounded systems to deep literacy models. likewise, the paper highlights the crucial challenges such as nebulosity resolution, environment understanding, and handling different verbal variations that stymie the flawless functioning of virtual sidekicks. By synthesizing perceptivity from recent exploration trials, this paper offers precious perspectives on the state-of-the-art NLP ways and directions for unborn exploration to overcome the challenges and propel the development of further intelligent and intuitive virtual sidekicks.

关键词： Reviews Virtual assistants Propulsion Natural language processing Distance measurement

来源：评论

学校读者我要写书评

暂无评论

Active Learning with the nnUNet and Sample Selection with Uncertainty-Aware Submodular Mutual Information Measure 7

Active Learning with the nnUNet and Sample Selection with Un...

引用

7th International Conference on Medical Imaging with Deep Learning, MIDL 2024

作者： Föllmer, Bernhard Schulze, Kenrick Wald, Christian Stober, Sebastian Samek, Wojciech Dewey, Marc Department of Radiology Charité-Universitätsmedizin Berlin Freie Universität Berlin Humboldt-Universität zu Berlin Berlin10117 Germany Institute of Mathematics Technical University of Berlin Berlin Germany Artificial Intelligence Lab. Otto-von-Guericke-Universität Magdeburg Germany Department of Artificial Intelligence Fraunhofer Heinrich Hertz Institute Berlin Germany BIFOLD – Berlin Institute for the Foundations of Learning and Data Berlin Germany Department of Electrical Engineering and Computer Science Technical University of Berlin Berlin Germany partner site Berlin Berlin Germany

Annotating medical images for segmentation tasks is a time-consuming process that requires expert knowledge. Active learning can reduce this annotation cost and achieve optimal model performance by selecting only the most informative samples for annotation. However, the effectiveness of active learning sample selection strategies depends on the model architecture and training procedure used. The nnUNet has achieved impressive results in various automated medical image segmentation tasks due to its self-configuring pipeline for automated model design and training. This raises the question of whether the nnUNet is applicable in an active learning setting to avoid cumbersome manual configuration of the training process and improve accessibility for non-experts in deep learning-based segmentation. This paper compares various sample selection strategies in an active learning setting in which the self-configuring nnUNet is used as the segmentation model. Additionally, we propose a new sample selection strategy for UNet-like architectures: USIM - Uncertainty-Aware Submodular Mutual Information Measure. The method combines uncertainty and submodular mutual information to select batches of uncertain, diverse, and representative samples. We evaluate the performance gain and labeling costs on three medical image segmentation tasks with different segmentation challenges. Our findings demonstrate that utilizing nnUNet as the segmentation model in an active learning setting is feasible, and most sampling strategies outperform random sampling. Furthermore, we demonstrate that our proposed method yields a significant improvement compared to existing baseline methods. © 2024 CC-BY 4.0, B. Föllmer, K. Schulze, C. Wald, S. Stober, W. Samek & M. Dewey.

关键词： Active learning

来源：评论

学校读者我要写书评

暂无评论

Deepwalk-aware graph convolutional networks

引用

science China(Information sciences) 2022年第5期65卷 81-95页

作者： Taisong JIN Huaqiang DAI Liujuan CAO Baochang ZHANG Feiyue HUANG Yue GAO Rongrong JI Media Analytics and Computing Lab Department of Computer Science and Technology School of InformaticsXiamen University Media Analytics and Computing Lab Department of Artificial Intelligence School of InformaticsXiamen University School of Automation Science and Electrical Engineering Beihang University Tencent Youtu Lab School of Software Tsinghua University

Graph convolutional networks(GCNs) provide a promising way to extract the useful information from graph-structured data. Most of the existing GCNs methods usually focus on local neighborhood information based on specific convolution operations, and ignore the global structure of the input data. To extract the latent representation for the graph-structured data more effectively, we introduce a deepwalk strategy into GCNs to efficiently explore the global graph information. This strategy can complement the local neighborhood information of a graph, resulting in the more robust representation for the graph *** fusion of the local neighboring and global structured information of a graph can further facilitate deep feature learning at the output layer of GCNs for node classification. Experimental results show that the proposed model has achieved state-of-the-art results on three benchmark datasets including Cora, Citeseer,and Pubmed citation networks.

关键词： graph convolutional networks global information fusion node classification

来源：评论

学校读者我要写书评

暂无评论

Robin: A Novel Method to Produce Robust Interpreters for Deep Learning-Based Code Classifiers

Robin: A Novel Method to Produce Robust Interpreters for Dee...

引用

IEEE International Conference on Automated software engineering (ASE)

作者： Zhen Li Ruqian Zhang Deqing Zou Ning Wang Yating Li Shouhuai Xu Chen Chen Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Hubei Engineering Research Center on Big Data Security Department of Computer Science University of Colorado Colorado Springs USA Center for Research in Computer Vision University of Central Florida USA School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep learning makes it hard to interpret and understand why a classifier (i.e., classification model) makes a particular prediction on a given example. This lack of interpretability (or explainability) might have hindered their adoption by practitioners because it is not clear when they should or should not trust a classifier's prediction. The lack of interpretability has motivated a number of studies in recent years. However, existing methods are neither robust nor able to cope with out-of-distribution examples. In this paper, we propose a novel method to produce Robust interpreters for a given deep learning-based code classifier; the method is dubbed Robin. The key idea behind Robin is a novel hybrid structure combining an interpreter and two approximators, while leveraging the ideas of adversarial training and data augmentation. Experimental results show that on average the interpreter produced by Robin achieves a 6.11% higher fidelity (evaluated on the classifier), 67.22% higher fidelity (evaluated on the approximator), and 15.87x higher robustness than that of the three existing interpreters we evaluated. Moreover, the interpreter is 47.31% less affected by out-of-distribution examples than that of LEMNA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Secrecy Energy Efficiency Maximization in IRS-Assisted VLC MISO Networks with RSMA: A DS-PPO Approach

引用

IEEE Transactions on Wireless Communications 2025年

作者： Guo, Yangbo Fan, Jianhui Zhang, Ruichen Chang, Baofang Ng, Derrick Wing Kwan Niyato, Dusit Kim, Dong In Henan Normal University School of Computer and Information Engineering Xinxiang453007 China Engineering Lab of Intelligence Business and Internet of Things Henan453007 China Nanyang Technological University College of Computing and Data Science Singapore Singapore University of New South Wales School of Electrical Engineering and Telecommunications NSW2052 Australia Sungkyunkwan University Department of Electrical and Computer Engineering Suwon16419 Korea Republic of

This paper investigates intelligent reflecting surface (IRS)-assisted multiple-input single-output (MISO) visible light communication (VLC) networks utilizing the rate-splitting multiple access (RSMA) scheme. In these networks, an eavesdropper (Eve) attempts to eavesdrop on communications intended for legitimate users (LUs). To enhance information security and energy efficiency simultaneously, we formulate a secrecy energy efficiency (SEE) maximization problem by jointly optimizing the beamforming vectors, RSMA common rates, direct current (DC) bias, and IRS alignment matrices. The problem is constrained by total power budget, quality of service (QoS) requirements, linear operating region of light emitting diodes (LEDs), and common information rate allocation. Due to the non-convex and NP-hard nature of the formulated problem, we propose a deep reinforcement learning (DRL)-based dual-sampling proximal policy optimization (DS-PPO) approach. The approach leverages dual sample strategies and generalized advantage estimation (GAE). In addition, the maximum ratio transmission (MRT) and zero-forcing (ZF) are adopted to design the beamforming vectors. Simulation results show that the proposed DS-PPO approach outperforms traditional baseline approaches. Moreover, the implementation of the RSMA scheme and IRS contributes to overall system performance, achieving approximately 19.67% improvement over traditional multiple access schemes and 25.74% improvement over networks without IRS deployment. © 2002-2012 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

arXiv

引用

arXiv 2024年

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado SpringsCO United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab China JinYinHu Laboratory Wuhan China

software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter-Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulnerability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. Copyright © 2024, The Authors. All rights reserved.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

A Secure Authentication Framework for Consumer Mobile Crowdsourcing Networks

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Aldosary, Abdallah Tanveer, Muhammad Ahmad, Musheer Maghrabi, Louai A. Ahmed, Emad A. Hussain, Amir El-Latif, Ahmed A. Abd Department of Computer Engineering Prince Sattam bin Abdulaziz University Riyadh Wadi Addwasir11991 Saudi Arabia University of Management and Technology Department of Computer Science Lahore54770 Pakistan Jamia Millia Islamia Department of Computer Engineering New Delhi110025 India University of Business and Technology College of Engineering Department of Software Engineering Jeddah Saudi Arabia South Valley University Faculty of Computers and Information Department of Computer Science Qena Egypt Edinburgh Napier University United Kingdom Prince Sultan University EIAS Data Science Lab College of Computer and Information Sciences Center of Excellence in Quantum and Intelligent Computing Riyadh11586 Saudi Arabia Menoufia University Faculty of Science Department of Mathematics and Computer Science Shebin El-Koom32511 Egypt

The Mobile crowdsourcing network (MCN) leverages collaborative intelligence to solve complex tasks through group cooperation. It comprises three main components: the end-user, the service provider, and the mobile user. The end-user requests crowd-sensing and computing services from the service provider, who handles task decomposition, distribution, re-composition, and recommendation. Mobile users perform the crowd sensing and computing tasks. Despite its benefits, MCN faces significant security and privacy challenges. Communications between the service provider and the end-user involve sensitive data, and mobile users and service providers communicate over open channels, making them vulnerable to security threats. To address these concerns, we propose a secure authentication framework for MCN, called SAF-MCN. This framework combines the lightweight cryptographic primitive ' ASCON' with elliptic curve cryptography. SAF-MCN allows the service provider to authenticate mobile users before they join the MCN. Once authenticated, a secure channel is established for encrypted communication over the public Internet. The security of SAFMCN is validated using both formal and informal methods, demonstrating its resilience against potential attacks. The use of Scyther further ensures the security of SAF-MCN. Comparative analysis shows that SAF-MCN is superior in terms of security features, computational efficiency, and communication cost. © 1975-2011 IEEE.

关键词： ASCON Authenticated Encryption Authentication Mobile Crowdsourcing Network Scyther Security

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

International Conference on software engineering (ICSE)

作者： Zhen Li Ning Wang Deqing Zou Yating Li Ruqian Zhang Shouhuai Xu Chao Zhang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Jin YinHu Laboratory Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado Springs Colorado USA Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers; and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities.

关键词： Deep learning Detectors Open source software software engineering

来源：评论

学校读者我要写书评

暂无评论

Training Artificial Neural Networks by Coordinate Search Algorithm

arXiv

引用

arXiv 2024年

作者： Rokhsatyazdi, Ehsan Rahnamayan, Shahryar Miyandoab, Sevil Zanjani Bidgoli, Azam Asilian Tizhoosh, H.R. Lab Department of Electrical Computer and Software Engineering Ontario Tech University OshawaON Canada Department of Engineering Brock University St. CatharinesON Canada Faculty of Science Wilfrid Laurier University WaterlooON Canada Rhazes Lab Department of Artificial Intelligence and Informatics Mayo Clinic RochesterMN United States

Training Artificial Neural Networks (ANNs) poses a challenging and critical problem in machine learning. Despite the effectiveness of gradient-based learning methods, such as Stochastic Gradient Descent (SGD), in training neural networks, they do have several limitations. For instance, they require differentiable activation functions, and cannot optimize a model based on several independent non-differentiable loss functions simultaneously;for example, the F1-score, which is used during testing, can be used during training when a gradient-free optimization algorithm is utilized. Furthermore, the training (i.e., optimization of weights) in any DNN can be possible with a small size of the training dataset. To address these concerns, we propose an efficient version of the gradient-free Coordinate Search (CS) algorithm, an instance of General Pattern Search (GPS) methods, for training (i.e., optimizing) neural networks. The proposed algorithm can be used with non-differentiable activation functions and tailored to multi-objective/multi-loss problems. Finding the optimal values for weights of ANNs is a large-scale optimization problem. Therefore, instead of finding the optimal value for each variable, which is the common technique in classical CS, we accelerate optimization and convergence by bundling the variables (i.e., weights). In fact, this strategy is a form of dimension reduction for optimization problems. Based on the experimental results, the proposed method is comparable with the SGD algorithm, and in some cases, it outperforms the gradient-based approach. Particularly, in situations with insufficient labeled training data, the proposed CS method performs better. The performance plots demonstrate a high convergence rate, highlighting the capability of our suggested method to find a reasonable solution with fewer function calls. As of now, the only practical and efficient way of training ANNs with hundreds of thousands of weights is gradient-based algorithms such

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：