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

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

作者： Chengchang Liu Cheng Chen Luo Luo John C.S. Lui Department of Computer Science & Engineering The Chinese University of Hong Kong Shanghai Key Laboratory of Trustworthy Computing East China Normal University School of Data Science Fudan University

This paper studies quasi-Newton methods for solving nonlinear equations. We propose block variants of both good and bad Broyden's methods, which enjoy explicit local superlinear convergence rates. Our block good Broyden's method has a faster condition-number-free convergence rate than existing Broyden's methods because it takes the advantage of multiple rank modification on Jacobian estimator. On the other hand, our block bad Broyden's method directly estimates the inverse of the Jacobian provably, which reduces the computational cost of the iteration. Our theoretical results provide some new insights on why good Broyden's method outperforms bad Broyden's method in most of the cases. The empirical results also demonstrate the superiority of our methods and validate our theoretical analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Feature Distribution Smoothing Network Based on Gaussian Distribution for QoS Prediction

A Feature Distribution Smoothing Network Based on Gaussian D...

引用

IEEE International Conference on Web Services (ICWS)

作者： Tongxin Lu Xiaohong Zhang Ziliang Wang Meng Yan Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society (Chongqing University) China School of Big Data and Software Engineering Chongqing University Chongqing China

With the increasing number of services and their homogenization, the use of Quality of Service (QoS) for recommendations has become necessary. However, existing QoS prediction solutions have limitations in solving the noise and label imbalance problems of dataset, which greatly limit the improvement of QoS prediction accuracy. In this paper, we propose FSNet that contains a feature distribution smoothing module and an improved W-Huber loss function. The feature distribution smoothing module mitigates the effect of noise problem by fitting potential Gaussian distribution of known features with a supervised feedforward neural network. W-Huber loss function mitigates the impact of label imbalance problem on QoS prediction by reweighting the two components of Huber loss function. We conduct extensive experiments on real large-scale QoS dataset, and the results demonstrate that the proposed FSNet method outperforms existing QoS prediction methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fingerprint Presentation Attack Detector Using Global-Local Model

arXiv

引用

arXiv 2024年

作者： Liu, Haozhe Zhang, Wentian Liu, Feng Wu, Haoqian Shen, Linlin The Computer Vision Institute College of Computer Science and Software Engineering SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society The National Engineering Laboratory for Big Data System Computing Technology The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China

The vulnerability of automated fingerprint recognition systems (AFRSs) to presentation attacks (PAs) promotes the vigorous development of PA detection (PAD) technology. However, PAD methods have been limited by information loss and poor generalization ability, resulting in new PA materials and fingerprint sensors. This paper thus proposes a global-local model-based PAD (RTK-PAD) method to overcome those limitations to some extent. The proposed method consists of three modules, called: 1) the global module;2) the local module;and 3) the rethinking module. By adopting the cut-out-based global module, a global spoofness score predicted from nonlocal features of the entire fingerprint images can be achieved. While by using the texture in-painting-based local module, a local spoofness score predicted from fingerprint patches is obtained. The two modules are not independent but connected through our proposed rethinking module by localizing two discriminative patches for the local module based on the global spoofness score. Finally, the fusion spoofness score by averaging the global and local spoofness scores is used for PAD. Our experimental results evaluated on LivDet 2017 show that the proposed RTK-PAD can achieve an average classification error (ACE) of 2.28% and a true detection rate (TDR) of 91.19% when the false detection rate (FDR) equals 1.0%, which significantly outperformed the state-of-the-art methods by ∼10% in terms of TDR (91.19% versus 80.74%). Copyright © 2024, The Authors. All rights reserved.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

AR-CNN: an attention ranking network for learning urban perception

引用

Science China(Information Sciences) 2022年第1期65卷 164-174页

作者： Zhetao LI Ziwen CHEN Wei-Shi ZHENG Sangyoon OH Kien NGUYEN Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan University School of Data and Computer Science Sun Yat-sen University Department of Computer and Information Engineering Ajou University Graduate School of Engineering Chiba University

An increasing number of deep learning methods is being applied to quantify the perception of urban environments, study the relationship between urban appearance and resident safety, and improve urban appearance. Most advanced methods extract image feature representations from street-level images through conventional visual computation algorithms or deep convolutional neural networks and then directly predict the results using features. Unfortunately, these methods take color and texture information together during processing. Color and texture are prime image features, and they affect human perception and judgment differently. We argue that color and texture should be operated differently; therefore, we formulate an end-to-end learning methodology to process input images according to color and texture information before inputting it into the neural network. The processed images and the original image constitute three input streams for the triad attention ranking convolutional neural network(AR-CNN) model proposed in this *** accordance with the aspects of color and texture, an improved attention mechanism in the convolution layer is proposed. Our objective is to obtain the scores of humans on urban appearance in accordance with the prediction results computed from pairwise comparisons generated by the AR-CNN model.

关键词： ranking network urban perception attribute learning attention network colour and texture

来源：评论

学校读者我要写书评

暂无评论

Article reranking by memory-enhanced key sentence matching for detecting previously fact-checked claims 59

Article reranking by memory-enhanced key sentence matching f...

引用

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Sheng, Qiang Cao, Juan Zhang, Xueyao Li, Xirong Zhong, Lei Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

ISBN: (纸本)9781954085527

False claims that have been previously fact-checked can still spread on social media. To mitigate their continual spread, detecting previously fact-checked claims is indispensable. Given a claim, existing works retrieve fact-checking articles (FC-articles) for detection and focus on reranking candidate articles in the typical two-stage retrieval framework. However, their performance may be limited as they ignore the following characteristics of FC-articles: (1) claims are often quoted to describe the checked events, providing lexical information besides semantics;and (2) sentence templates to introduce or debunk claims are common across articles, providing pattern information. In this paper, we propose a novel reranker, MTM (Memoryenhanced Transformers for Matching), to rank FC-articles using key sentences selected using event (lexical and semantic) and pattern information. For event information, we propose to finetune the Transformer with regression of ROUGE. For pattern information, we generate pattern vectors as a memory bank to match with the parts containing patterns. By fusing event and pattern information, we select key sentences to represent an article and then predict if the article fact-checks the given claim using the claim, key sentences, and patterns. Experiments on two real-world datasets show that MTM outperforms existing methods. Human evaluation proves that MTM can capture key sentences for explanations. The code and the dataset are at https://***/ICTMCG/MTM. © 2021 Association for Computational Linguistics

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Class Incremental Learning for Knowledge Acquisition Based on Prototype Network Gating Mechanism

Class Incremental Learning for Knowledge Acquisition Based o...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Yuming Feng Xiaolong Jin Haozhe Liang Jiafeng Guo School of Computer Science and Technology University of Chinese Academy of Sciences CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Institute of Systems Engineering Academy of Military Science

ISBN: (数字)9798350377613

ISBN: (纸本)9798350377620

With the development of information technology, the medical field has accumulated a large amount of medical data, which continues to grow. Efficient extraction and effective utilization of knowledge from this vast amount of medical data are crucial for realizing its immense value. Traditional knowledge acquisition algorithms face challenges in effectively identifying and acquiring new types of knowledge in practical applications. To address this, this paper proposes a class-incremental learning method based on a prototype network gating mechanism, called PGMoE. This method integrates multiple experts through a prototype network-based gating mechanism, dynamically adjusting the model's response to new and old knowledge, thereby effectively mitigating the issue of catastrophic forgetting in class-incremental learning. PGMoE not only improves the stability and accuracy of the model in continuous learning processes but also ensures the model's ability to remember historical knowledge. Comparative experiments on multiple datasets with existing class-incremental learning methods demonstrate that PGMoE has significant performance advantages in handling continuous learning tasks.

关键词： Learning systems Accuracy Incremental learning Knowledge acquisition Scalability Heuristic algorithms Prototypes Logic gates Stability analysis Information technology

来源：评论

学校读者我要写书评

暂无评论

Byzantine-Robust Federated Learning on Non-IID data via Inversing Artificial Gradients

Byzantine-Robust Federated Learning on Non-IID Data via Inve...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Minyang Li Xiangyun Tang Tao Zhang Guangyuan Liu Yu Weng Key Laboratory of Ethnic Language Intelligent Analysis and Security Governance Minzu University of China China School of Software Engineering Beijing Jiaotong University China College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Federated Learning (FL) is a distributed machine learning framework that enhances privacy by enabling multiple participants to train a global model without sharing their raw data. However, FL still faces the threat posed by data and Byzantine attacks (e.g., data poisoning and model poisoning attacks) from malicious clients aimed to decrease the FL global training accuracy. Previous studies have proposed solutions to improve the robustness of FL systems. However, these robust approaches have not effectively defended against Byzantine attacks from malicious clients in non-Independent and Identically Distributed (non-IID) environments, decreasing overall training accuracy. In this work to address this issues, we propose a new defence framework that aims to enhance model accuracy against Byzantine attacks from malicious clients in non-IID environments. In our approach, the central server performs the Inverse Deep Learning Gradient attack using the gradient data submitted by users in each round, obtaining an inversed artificial gradient. We then assess the squared L2 norm difference between this inversed gradient and the actual gradients to detect malicious clients. Simultaneously, we assign weights to each client involved in the aggregation based on differences in the squared L2 norm, aiming to minimize the impact of malicious actors on the overall model. We have experimentally evaluated our method and demonstrated its ability to maintain training accuracy under attack in non-IID environments using standard datasets.

关键词： Training Accuracy Federated learning Distributed databases Robustness data models Servers Global communication Standards Faces

来源：评论

学校读者我要写书评

暂无评论

Towards Effective and Efficient Error Handling Code Fuzzing Based on Software Fault Injection

Towards Effective and Efficient Error Handling Code Fuzzing ...

引用

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Kang Chen Ming Wen Haoxiang Jia Rongxin Wu Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology (HRUST) Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security Jin YinHu Laboratory Wuhan China School of Informatics Xiamen University Xiamen China School of Computer Science and Technology HUST Wuhan China Cluster and Grid Computing Lab

ISBN: (数字)9798350330663

ISBN: (纸本)9798350330670

Software systems often encounter various errors or exceptions in practice, and thus proper error handling code is essential to ensure the reliability of software systems. Unfortunately, error handling code is often bug-prone, while sufficiently testing them is challenging as such code often cannot be triggered under normal conditions. Motivated by this, recent studies have proposed to leverage software fault injection (SFI) based fuzzing to discover potential bugs in complicated error handling code. Despite the promising results achieved, their effectiveness and efficiency are still compromised in practice due to the huge search space of error sites, inadequate fuzzing guidance, and the overhead induced by context-sensitive SFI. To achieve effective and efficient testing of error handling code, this study presents AFL-FI, which first utilizes a similarity-based method to identify suspicious error sites, and then incorporates the idea of error site coverage to guide the fuzzing process. Finally, the design of lightweight context-sensitive SFI enables AFL-FI to execute test cases efficiently. We evaluate AFL-FI on eight large-scale open-source projects, and the results show that it can outperform existing state-of-the-art fuzzing tools significantly in terms of branch code coverage. More importantly, AFL-FI has discovered 13 previously unknown bugs, and all of them have been confirmed while 12 of them have been fixed. Besides, our evaluation also demonstrates that all the key designs of AFL- F I are effective that contribute significantly to its overall performance.

关键词： Codes Computer bugs Fuzzing Software systems Software reliability Testing

来源：评论

学校读者我要写书评

暂无评论

Modality-Aware Shot Relating and Comparing for Video Scene Detection

arXiv

引用

arXiv 2024年

作者： Tan, Jiawei Wang, Hongxing Dang, Kang Li, Jiaxin Ou, Zhilong Key Laboratory of Dependable Service Computing Cyber Physical Society Chongqing University Ministry of Education China School of Big Data and Software Engineering Chongqing University China Xi’an Jiaotong-Liverpool University Suzhou China

Video scene detection involves assessing whether each shot and its surroundings belong to the same scene. Achieving this requires meticulously correlating multi-modal cues, e.g. visual entity and place modalities, among shots and comparing semantic changes around each shot. However, most methods treat multi-modal semantics equally and do not examine contextual differences between the two sides of a shot, leading to sub-optimal detection performance. In this paper, we propose the Modality-Aware Shot Relating and Comparing approach (MASRC), which enables relating shots per their own characteristics of visual entity and place modalities, as well as comparing multi-shots similarities to have scene changes explicitly encoded. Specifically, to fully harness the potential of visual entity and place modalities in modeling shot relations, we mine long-term shot correlations from entity semantics while simultaneously revealing short-term shot correlations from place semantics. In this way, we can learn distinctive shot features that consolidate coherence within scenes and amplify distinguishability across scenes. Once equipped with distinctive shot features, we further encode the relations between preceding and succeeding shots of each target shot by similarity convolution, aiding in the identification of scene ending shots. We validate the broad applicability of the proposed components in MASRC. Extensive experimental results on public benchmark datasets demonstrate that the proposed MASRC significantly advances video scene detection. © 2024, CC BY-NC-ND.

关键词： Footage counters

来源：评论

学校读者我要写书评

暂无评论

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

引用

IEEE Transactions on Mobile computing 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing Advanced Information Network Laboratory Beijing China College of Computing and Data Science Singapore University of Miami Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing Coral Gables33146 United States University of Miami Department of Industrial and Systems Engineering Coral Gables33146 United States Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China North Carolina State University Department of Computer Science RaleighNC27695 United States Beijing Key Laboratory of Network System Architecture and Convergence China Beijing University of Posts and Telecommunications Beijing Advanced Information Network Laboratory Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025 IEEE. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：