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

arXiv 2022年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Li, Guorong Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Shenzhen518107 China University of Chinese Academy of Sciences Beijing100049 China Peng Cheng Laboratory Shenzhen518055 China

Rank aggregation with pairwise comparisons has shown promising results in elections, sports competitions, recommendations, and information retrieval. However, little attention has been paid to the security issue of such algorithms, in contrast to numerous research work on the computational and statistical characteristics. Driven by huge profit, the potential adversary has strong motivation and incentives to manipulate the ranking list. Meanwhile, the intrinsic vulnerability of the rank aggregation methods is not well studied in the literature. To fully understand the possible risks, we focus on the purposeful adversary who desires to designate the aggregated results by modifying the pairwise data in this paper. From the perspective of the dynamical system, the attack behavior with a target ranking list is a fixed point belonging to the composition of the adversary and the victim. To perform the targeted attack, we formulate the interaction between the adversary and the victim as a game-theoretic framework consisting of two continuous operators while Nash equilibrium is established. Then two procedures against HodgeRank and RankCentrality are constructed to produce the modification of the original data. Furthermore, we prove that the victims will produce the target ranking list once the adversary masters the complete information. It is noteworthy that the proposed methods allow the adversary only to hold incomplete information or imperfect feedback and perform the purposeful attack. The effectiveness of the suggested target attack strategies is demonstrated by a series of toy simulations and several real-world data experiments. These experimental results show that the proposed methods could achieve the attacker’s goal in the sense that the leading candidate of the perturbed ranking list is the designated one by the adversary. Copyright © 2022, The Authors. All rights reserved.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Closed-Loop Safe Correction for Reinforcement Learning Policy 4th

Closed-Loop Safe Correction for Reinforcement Learning Poli...

引用

4th International Conference on Ubiquitous Security, UbiSec 2024

作者： Yi, Zhi Lv, Qi Chen, Shuhong Liang, Ying Dai, Yinglong Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China School of Computer Science and Cyber Engineering Guangzhou University Guangzhou510006 China Blockchain Innovation Lab Swinburne University of Technology MelbourneVIC3122 Australia Molecular Nutrition Branch National Engineering Research Center of Rice and By-product Deep Processing College of Food Science and Engineering Central South University of Forestry and Technology Hunan Changsha410004 China

ISBN: (纸本)9789819648351

Trial and error learning is an approach with uncertain consequences. How to maintain policy security, stability, and efficiency under controlled circumstances, posing a significant academic challenge. Such as Reinforcement Learning (RL) leverages the neural network parameter space to identify the optimal solution for achieving the optimal mapping of the policy space. However, even a slight fluctuation in the parameter space can lead to policy collapse. To solve it, we propose a method called Closed-loop Safe Correction (CLSC). This method employs twin agents to establish a closed-loop framework for policy and sampling data distribution, gradually improving policy efficiency while ensuring policy safety. Base on theoretical and experimental analysis, CLSC elucidates the performance, influencing factors, and advantages of this approach in policy safety scenarios. These findings provide novel research insights and practical directions for advancing safe RL. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

The Existence Theory of the Nonlinear Discrete System and the Convergence Theory of the Gummel Iteration for the PNP Equations

引用

Journal of Scientific computing 2025年第1期104卷

作者： Liu, Yang Shu, Shi Yang, Ying Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan Xiangtan411105 China School of Mathematics Hunan Institute of Science and Technology Hunan Yueyang414006 China Guilin University of Electronic Technology Guangxi Guilin541004 China

The Poisson-Nernst-Planck equations play a crucial role in modeling ion mass conservation and electrostatic diffusion in various applications, such as biological ion channels, semiconductor devices, and nanopore systems. Due to the inherent strong coupling and nonlinearity, developing robust theoretical frameworks for discrete schemes and associated fast algorithms is challenging. While the finite element method and some improved methods are widely used to solve these equations, existing theoretical analyses are insufficient, particularly regarding the existence of solutions for discrete methods or nonlinear discrete systems, and the convergence of fast algorithms. This study aims to contribute to this area by proposing a framework that includes establishing the existence of solutions for an abstract discrete scheme, which encompasses schemes such as standard finite element and edge-averaged finite element methods. We establish the existence theory for the nonlinear discrete system by carefully constructing a suitable compact convex set for the fixed-point operator and then using the Brouwer’s fixed-point theorem. Additionally, we present a convergence theory for the Gummel iteration, a commonly used iteration for the Poisson-Nernst-Planck equations, associated with our abstract discrete scheme. We further explore the theoretical results for both standard and edge-averaged finite element schemes as applications of the framework. Numerical experiments are conducted to verify the theoretical results for the Gummel iteration of these two schemes. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Fixed point arithmetic

来源：评论

学校读者我要写书评

暂无评论

Group-wise Inhibition based Feature Regularization for Robust Classification

Group-wise Inhibition based Feature Regularization for Robus...

引用

International Conference on Computer Vision (ICCV)

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

The convolutional neural network (CNN) is vulnerable to degraded images with even very small variations (e.g. corrupted and adversarial samples). One of the possible reasons is that CNN pays more attention to the most discriminative regions, but ignores the auxiliary features when learning, leading to the lack of feature diversity for final judgment. In our method, we propose to dynamically suppress significant activation values of CNN by group-wise inhibition, but not fixedly or randomly handle them when training. The feature maps with different activation distribution are then processed separately to take the feature independence into account. CNN is finally guided to learn richer discriminative features hierarchically for robust classification according to the proposed regularization. Our method is comprehensively evaluated under multiple settings, including classification against corruptions, adversarial attacks and low data regime. Extensive experimental results show that the proposed method can achieve significant improvements in terms of both robustness and generalization performances, when compared with the state-of-the-art methods. Code is available at https://***/LinusWu/TENET_Training.

关键词： Training Computer vision Codes Heuristic algorithms Robustness Classification algorithms Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

An Image Denoising Method Based on Deep Residual GAN 4

An Image Denoising Method Based on Deep Residual GAN

引用

2020 4th International Workshop on Advanced Algorithms and Control Engineering, IWAACE 2020

作者： Wang, Ziyuan Wang, Lidan Duan, Shukai Li, Yunfei Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing400715 China Schoolof Electronic and Information Engineering Southwest University Chongqing400715 China College of Artificiall Intelligence Southwest University Chongqing400715 China Braininspired Computing and Intelligent Control of Chongqing Key Lab Chongqing400715 China National and Local Joint Engineering Laboratory of Intelligent Transmission and Control Technology Chongqing400715 China Chongqing Brain Science Collaborative Innovation Center Chongqing400715 China

As people come into contact with image data more often, high quality and clear images attract more attention. Many methods have been proposed to deal with image noise problem including deep learning (DL). However most of them is lack of capability when customers want more perceptual details of the image without information loss. In this paper, a deep residual network based on generative adversarial (GAN) network was proposed to complete the image denoising mission. Firstly, a generative-adversarial network structure based on residual blocks was designed. Secondly, a refined loss function was given to train the GAN network. The well designed loss function can help the generated image to be very close to the clear counterpart (ground truth) while enhancing more details in colours and brightness. Finally, extensive experiments show that our network is not only convincing for images denoising, but also effective for other image process tasks, such as image defogging, medical CT denoising etc., presenting impressive and competitive effects. © Published under licence by IOP Publishing Ltd.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

A Novel Economical Design of Multistage Decimators for Low Latency Audio Applications 22

A Novel Economical Design of Multistage Decimators for Low L...

引用

22nd IEEE International Conference on High Performance computing and Communications, 18th IEEE International Conference on Smart City and 6th IEEE International Conference on Data Science and Systems, HPCC-SmartCity-DSS 2020

作者： Hu, Wei Zheng, Chongwei Wang, Yonghao Liu, Jing Chen, Cen Zeng, Zeng Wuhan University of Science and Technology College of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan China Birmingham City University Digital Media Technology Lab Birmingham United Kingdom Institute for Infocomm Research Singapore

ISBN: (纸本)9781728176499

The oversampling sigma-delta analog-To-digital converter (ADC) is widely used in digital audio systems for its low hardware cost and high precision. The digital filter part of the ADC is the primary source of the silicon and power cost. In this work, we proposed an economical multistage decimation filter architecture to meet the requirements of commercial ADC specifications with a further novel multi-objective optimization strategy. We took group delay and computational cost as objective functions and used annealing algorithm to readjust the stopband attenuation, stopband edge and passband ripple of each filter. Our multistage architecture combines cascaded integrator-comb (CIC) filters, compensating filters and equiripple finite impulse response (FIR) filters at the different stages to balance the overall performance. The experimental results showed that our design approach worked with multi-objective optimization strategy could achieve low group delay with lower cost compared to traditional designs. © 2020 IEEE.

关键词： Group delay

来源：评论

学校读者我要写书评

暂无评论

Constructing Sample-to-Class Graph for Few-Shot Class-Incremental Learning

SSRN

引用

SSRN 2024年

作者： Hu, Fuyuan Zhang, Jian Lyu, Fan Zhao, Linglan Liu, Chengyan Zhang, Tao Yu, Baoqing School of Electronics and Information Engineering Suzhou University of Science and Technology No.99 Xuefu Road Jiangsu Suzhou215000 China Jiangsu Industrial Intelligent Low Carbon Technology Engineering Center Jiangsu Suzhou215009 China Suzhou Key Laboratory of Intelligent Low Carbon Technology Application Jiangsu Suzhou215009 China New Laboratory of Pattemn Recognition Institute of Automation Chinese Academy of Sciences College of Intelligence and Computing No.95 Zhongguancun East Road Beijing100190 China Tencent Youtu Lab Shanghai201600 China Seventh People’s Hospital Shanghai University of Traditional Chinese Medicine No.358 Datong Road Pudong New District Shanghai200137 China

Few-shot class-incremental learning (FSCIL) aims to build machine learning models that can continually learn novel classes from a few training samples, without forgetting knowledge of old classes. The challenges of FSCIL lie in the limited data of novel classes, which not only lead to significant overfitting issues but also exacerbate the notorious catastrophic forgetting problems. As proved in early studies, building sample relationships is beneficial for learning from few-shot classes. In this paper, we advance the idea to the incremental scenario and propose a Sample-to-Class (S2C) graph learning method for FSCIL. Concretely, we propose a Sample-level Graph Network (SGN) that focuses on analyzing sample relationships within a single session. This network helps aggregate similar samples, ultimately leading to the extraction of more refined class-level features. Then, we present a Class-level Graph Network (CGN) that establishes connections across class-level features of both novel and old classes. This network plays a crucial role in linking the knowledge between different sessions and helps improve overall learning performance in the FSCIL scenario. Moreover, we design a multi-stage strategy for training the S2C model, which mitigates the training challenges posed by limited data in the incremental learning process. The multi-stage training strategy is designed to build an S2C graph from base to incremental sessions and improve the capacity via an extra pseudo-incremental stage. Extensive experiments on three popular benchmark datasets show that our method outperforms the baselines and sets new state-of-the-art results in FSCIL. Our codes will be available upon acceptance. © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

The chordata olfactory receptor database

引用

Protein & Cell 2025年第4期 283-292页

作者： Wei Han Siyu Bao Jintao Liu Yiran Wu Liting Zeng Tao Zhang Ningmeng Chen Kai Yao Shunguo Fan Aiping Huang Yuanyuan Feng Guiquan Zhang Ruiyi Zhang Hongjin Zhu Tian Hua Zhijie Liu Lina Cao Xingxu Huang Suwen Zhao iHuman Institute Shanghai Tech University Research Center for Life Sciences Computing Zhejiang Lab Department of Intelligent Edge Cloud China Telecom Cloud Technology Co. Ltd. School of Life Science and Technology Shanghai Tech University School of Information Science and Technology Shanghai Tech University Shanghai Key Laboratory of High-Resolution Electron Microscopy Shanghai Tech University Zhejiang Provincial Key Laboratory of Pancreatic Disease The First Affiliated Hospital and Institute of Translational Medicine Zhejiang University School of Medicine Shanghai Clinical Research and Trial Center

Introduction of database Olfaction is one of the oldest chemosensory systems in chordates, playing crucial roles in their foraging, predator evasion, social communication, mating and parental care (Guo et al., 2023; Li and Liberles, 2015; Liberles,2014). The initial step of olfaction is the binding and activation of olfactory receptors (ORs) by odorants in a combinatorial way (Malnic et al., 1999).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Aligning Recommendation and Conversation via Dual Imitation

arXiv

引用

arXiv 2022年

作者： Zhou, Jinfeng Wang, Bo Huang, Minlie Zhao, Dongming Huang, Kun He, Ruifang Hou, Yuexian College of Intelligence and Computing Tianjin University Tianjin China State Key Laboratory of Communication Content Cognition People’s Daily Online Beijing China The CoAI Group DCST Institute for Artificial Intelligence State Key Lab of Intelligent Technology and Systems Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China AI Lab China Mobile Communication Group Tianjin Co. Ltd. China

Human conversations of recommendation naturally involve the shift of interests which can align the recommendation actions and conversation process to make accurate recommendations with rich explanations. However, existing conversational recommendation systems (CRS) ignore the advantage of user interest shift in connecting recommendation and conversation, which leads to an ineffective loose coupling structure of CRS. To address this issue, by modeling the recommendation actions as recommendation paths in a knowledge graph (KG), we propose DICR (Dual Imitation for Conversational Recommendation), which designs a dual imitation to explicitly align the recommendation paths and user interest shift paths in a recommendation module and a conversation module, respectively. By exchanging alignment signals, DICR achieves bidirectional promotion between recommendation and conversation modules and generates high-quality responses with accurate recommendations and coherent explanations. Experiments demonstrate that DICR outperforms the state-of-the-art models on recommendation and conversation performance with automatic, human, and novel explainability metrics. © 2022, CC BY.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

DeepContact: High throughput quantification of membrane contact site based on electron microscopy imaging

DeepContact: High throughput quantification of membrane cont...

引用

2022生物物理大会

作者： Liqing Liu Shuxin Yang Yang Liu Xixia Li Junjie Hu Li Xiao Tao Xu National Laboratory of Biomacromolecules Institute of Biophysics Chinese Academy of Sciences Center for Biological Imaging Institute of Biophysics Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences School of Computer and Control Engineering University of Chinese Academy of Sciences College of Life Science University of Chinese Academy of Sciences Ningbo HuaMei Hospital University of Chinese Academy of Sciences School of Biomedical Engineering Guangzhou Medical University

Membrane contact site (MCS)-mediated organelle interactions plays essential roles in the cell. Quantitative analysis of the MCS reveals vital clues for cellular responses under various physiological and pathological conditions. However, an efficient tool is lacking. Here, we developed "DeepContact", a deep learning protocol for optimizing organelle segmentation and contact analysis based on label-free electron microscopy(EM).

关键词： DeepContact High throughput quantification of membrane contact site based on electron microscopy imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：