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

Monotonicity and nonmonotonicity in L3-valued propositional logic

Frontiers of Computer Science 2022年第4期16卷 33-43页

作者： Wei Li Yuefei Sui State Key Laboratory of Software Development Environment Beihang UniversityBeijing100083China Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing100190China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing100049China

A sequent is a pair (Γ, Δ), which is true under an assignment if either some formula in Γ is false, or some formula in Δ is true. In L_(3)-valued propositional logic, a multisequent is a triple Δ∣Θ∣Γ, which is true under an assignment if either some formula in Δ has truth-value t, or some formula in Θ has truth-value m, or some formula in Γ has truth-value f. There is a sound, complete and monotonic Gentzen deduction system G for sequents. Dually, there is a sound, complete and nonmonotonic Gentzen deduction system G′ for co-sequents Δ: Θ: Γ. By taking different quantifiers some or every, there are 8 kinds of definitions of validity of multisequent Δ∣Θ∣Γ and 8 kinds of definitions of validity of co-multisequent Δ: Θ: Γ, and correspondingly there are 8 sound and complete Gentzen deduction systems for sequents and 8 sound and complete Gentzen deduction systems for co-sequents. Correspondingly their monotonicity is discussed.

关键词： sequent mulisequent gentzen deduction system monotonicity nonmonotonicity

来源：评论

学校读者我要写书评

暂无评论

How to Train Your Neural Network for Molecular Structure Generation from Mass Spectra?

How to Train Your Neural Network for Molecular Structure Gen...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Zhao, Kai Liu, Yanmin Dian, Longyang Sun, Shiwei Cui, Xuefeng Shandong University School of Computer Science and Technology Qingdao China Shandong University State Key Laboratory of Microbial Technology Qingdao China Chinese Academy of Sciences Key Lab of Intelligent Information Processing Institute of Computing Technology Beijing China

ISBN: (纸本)9798350386226

Mass spectrometry serves as a pivotal tool for the analysis of small molecules through an examination of their mass-to-charge ratios. Recent advancements in deep learning have markedly enhanced the analysis of mass spectrometric data, facilitating the prediction of novel small molecule structures without the necessity of extensive databases. Nonetheless, the paucity of annotated datasets impedes the efficacious training of molecular generation models predicated on MS2 spectra. To mitigate this limitation, we introduce ctMSNovelist, an avant-garde method that amalgamates pre-training, fine-tuning, and co-training techniques to construct a more precise model for the generation of molecular structures from tandem mass spectrometry data. This novel approach augments both the training regimen and the predictive accuracy of the MSNovelist model, thereby surmounting the obstacle of limited data. The methodology commences with the pretraining of a Variational Autoencoder (VAE) to generate molecular fingerprints derived from SMILES strings. Subsequently, it undergoes fine-tuning to emulate noisy fingerprints originating from mass spectrometry (MS) data. Concurrently, MSNovelist is co-trained utilizing these simulated fingerprints, inclusive of the highly noisy variants produced in the early stages of VAE training. The incorporation of a substantial volume of noisy data serves to enhance model accuracy and avert overfitting. We evaluated ctMSNovelist using the GNPS dataset and attained a SMILES prediction accuracy of 48.8%, representing a 4.1% enhancement over MSNovelist. It is pertinent to note that the sole distinction between ctMSNovelist and MSNovelist in this experiment was the training process. The code and models are publicly available at https://***/xfcui/ctMSNovelist. © 2024 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

K-MEANS CLUSTERING BASED SPARSE CROSS-ENTROPY MINIMIZATION ALGORITHM FOR DOA ESTIMATION

K-MEANS CLUSTERING BASED SPARSE CROSS-ENTROPY MINIMIZATION A...

引用

IET International Radar Conference 2023, IRC 2023

作者： Guo, Qiang Jiang, Hanyu Xiang, Jianhong Zhong, Yu College of Information and Communication Harbin Engineering University Harbin China Key Laboratory of Advanced Ship Communication and Information Technology Harbin Engineering University Harbin China Agile and Intelligent Computing Key Laboratory Chengdu China

ISBN: (纸本)9781839539954

Aiming at the problem that traditional greedy class compressed sensing algorithms are influenced by noise in the estimation of direction of arrival (DOA), this paper proposes the K-Means Clustering based Sparse Cross-Entropy Minimization (KMCSCEM) algorithm. First the algorithm selects atoms by minimizing the sparse cross-entropy to improve the accuracy of atom selection at the low signal-to-noise ratio (SNR). Subsequently, K-mean clustering is added in each iteration to reduce the range of atom selection, which further improves the estimation accuracy. Finally, the speed of convergence is improved by introducing an orthogonal least squares (OLS) criterion. Simulation experiments show that the proposed algorithm has an exact estimation ratio close to 90% when the SNR is less than -5 dB. © The Institution of Engineering & technology 2023.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Simulation analysis of erosion characteristics of slurry pipelines based on CFD-DDPM pipeline parameters 43

Simulation analysis of erosion characteristics of slurry pip...

引用

43rd Chinese Control Conference, CCC 2024

作者： Yuan, Haoran Wu, Jiande Xiong, Xin Yunnan University Yunnan Key Laboratory of Intelligent Systems and Computing Yunnan Kunming650500 China Kunming University of Science and Technology Faculty of Information Engineering and Automation Yunnan Kunming650500 China Kunming University of Science and Technology Yunnan Key Laboratory of Intelligent Control and Application Yunnan Kunming650500 China

ISBN: (纸本)9789887581581

In order to explore the impact of pipe diameter, bend-diameter ratio and bend angle on the erosion of slurry pipe, a numerical simulation method approach grounded in Computational Fluid Dynamics - Dense Discrete Phase Model (CFD-DDPM) is proposed. Firstly, the geometric models of bends with different pipe diameters, bend-diameter ratios, and bend angles are constructed;secondly, the slurry pipe erosion model based on Dense Discrete Phase Model (DDPM) is constructed;then, model validation is conducted on the slurry pipe erosion model to affirm the accuracy of the model;finally, the computational fluid dynamics method is employed to simulate the erosion and wear behavior of the pipeline, to investigate the impact of pipe diameter, bend-diameter ratio and bend angle on the erosion and wear of the slurry pipeline. At the same time, gray correlation analysis was also used to analyze the significant relationship between the three pipeline factors and erosion and wear. The results show that the main erosion area is not determined, with the change of the pipeline parameters, the most serious erosion area will move;the effect of different pipeline parameter variations on the erosion rate is different, in which the pipe diameter of the largest impact, the second largest bend-diameter ratio, the smallest impact of the bend angle. Therefore, in the design of slurry pipeline, should first consider the influence of pipe diameter factors. © 2024 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： Slurry pipelines

来源：评论

学校读者我要写书评

暂无评论

Leveraging Catastrophic Forgetting to Develop Safe Diffusion Models against Malicious Finetuning 38

Leveraging Catastrophic Forgetting to Develop Safe Diffusion...

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Pan, Jiadong Gao, Hongcheng Wu, Zongyu Hu, Taihang Su, Li Huang, Qingming Li, Liang Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS China University of Chinese Academy of Sciences China The Pennsylvania State University United States Nankai University China

Diffusion models (DMs) have demonstrated remarkable proficiency in producing images based on textual prompts. Numerous methods have been proposed to ensure these models generate safe images. Early methods attempt to incorporate safety filters into models to mitigate the risk of generating harmful images but such external filters do not inherently detoxify the model and can be easily bypassed. Hence, model unlearning and data cleaning are the most essential methods for maintaining the safety of models, given their impact on model parameters. However, malicious fine-tuning can still make models prone to generating harmful or undesirable images even with these methods. Inspired by the phenomenon of catastrophic forgetting, we propose a training policy using contrastive learning to increase the latent space distance between clean and harmful data distribution, thereby protecting models from being fine-tuned to generate harmful images due to forgetting. The experimental results demonstrate that our methods not only maintain clean image generation capabilities before malicious fine-tuning but also effectively prevent DMs from producing harmful images after malicious fine-tuning. Our method can also be combined with other safety methods to maintain their safety against malicious fine-tuning further. WARNING: This paper contains offensive images generated by models. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A prompt-based approach to adversarial example generation and robustness enhancement

引用

Frontiers of Computer Science 2024年第4期18卷 85-96页

作者： Yuting YANG Pei HUANG Juan CAO Jintao LI Yun LIN Feifei MA Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing TechnologyCASBeijing 100190China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China Department of Computer Science Stanford UniversityCA 94305USA School of Computing National University of SingaporeSingapore 119077Singapore Laboratory of Parallel Software and Computational Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China

Recent years have seen the wide application of natural language processing(NLP)models in crucial areas such as finance,medical treatment,and news media,raising concerns about the model robustness and *** find that prompt paradigm can probe special robust defects of pre-trained language *** prompt texts are first constructed for inputs and a pre-trained language model can generate adversarial examples for victim models via *** results show that prompt paradigm can efficiently generate more diverse adversarial examples besides synonym ***,we propose a novel robust training approach based on prompt paradigm which incorporates prompt texts as the alternatives to adversarial examples and enhances robustness under a lightweight minimax-style optimization *** on three real-world tasks and two deep neural models show that our approach can significantly improve the robustness of models to resist adversarial attacks.

关键词： robustness adversarial example prompt learning pre-trained language model

来源：评论

学校读者我要写书评

暂无评论

Collaborative Pushing and Grasping in Complex Scenarios via a Generator-Evaluator Network with Multiple Action Primitives 17th

Collaborative Pushing and Grasping in Complex Scenarios vi...

引用

17th International Conference on intelligent Robotics and Applications, ICIRA 2024

作者： Zuo, Guoyu Wang, Zihao Luo, Yongkang Yu, Shuangyue Zhao, Min School of Information Science and Technology Beijing University of Technology Beijing100124 China Beijing Key Laboratory of Computing Intelligence and Intelligent Systems Beijing100124 China The State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China

ISBN: (纸本)9789819607761

As robotic technologies advance, robotic arm manipulation tasks in complex environments become increasingly important. This paper presents a new collaborative pushing and grasping strategy to address two major challenges robotic arms encounter in complex environments: invisibility and tight enclosure of target objects. We propose a generator-evaluator network architecture based on multiple action primitives, incorporating hierarchical reinforcement learning and Double DQN techniques to optimize the operational efficiency of the robotic arm. By introducing a new action primitive to prioritize pushing operations around the topmost objects in space, our approach effectively reveals and locates obscured target objects. Additionally, utilizing the Spatial Correlation Test (SCT), our method explores all possible collision-free operational positions in the action space, selecting the optimal position from among them. Experimental results demonstrate that our approach achieves high efficiency and success rates in scenarios with randomly distributed objects, objects tightly enclosed by others, and invisible objects. This strategy enhances the speed and accuracy of tasks and improves the robot’s adaptability to complex environments. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Robotic arms

来源：评论

学校读者我要写书评

暂无评论

Task Separation and Knowledge Sharing for Class Incremental Learning 5

Task Separation and Knowledge Sharing for Class Incremental ...

引用

5th International Conference on intelligent computing and Human-Computer Interaction, ICHCI 2024

作者： Zhang, Jiali Qiao, Xiaoyan School of Computer Science and Technology Shandong Technology and Business University Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Technology and Evaluation Shandong Engineering Research Center Shandong Yantai China School of Mathematics and Information Science Shandong Technology and Business University Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Technology and Evaluation Shandong Engineering Research Center Shandong Yantai China

ISBN: (纸本)9798350368284

Methods based on dynamically expanding architectures can effectively mitigate catastrophic forgetting in class incremental learning (CIL), but they often overlook information sharing and integration between subnetworks, leading to performance degradation and increased parameter count and memory consumption as the network expands. To address these complex issues, we introduce a new method called Task Separation and Knowledge Sharing (TSKS), which transfers knowledge at both the logical and feature levels through Hybrid Knowledge Distillation (HKD). In logical distillation, we combine Global Knowledge Distillation (GKD) and Task Knowledge Distillation (TKD) to establish connections between tasks. To prevent the model from favoring new classes, we design an Attention- Based Feature Fusion (ABFF) mechanism to capture important features. Additionally, we introduce a Soft-Margin Auxiliary Loss (SMAL) to help the model learn new concepts. Extensive experiments show that TSKS outperforms existing models on CIFAR100 and ImageNet100, regardless of whether memory samples are used. Notably, TSKS demonstrates superior performance in memory-free settings, indicating a reduced reliance on rehearsal memory. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Vision based intelligent traffic light management system using Faster R‐CNN

引用

CAAI Transactions on Intelligence technology 2024年第4期9卷 932-947页

作者： Syed Konain Abbas Muhammad Usman Ghani Khan Jia Zhu Raheem Sarwar Naif R.Aljohani Ibrahim A.Hameed Muhammad Umair Hassan Department of Computer Science and Engineering University of Engineering and TechnologyLahorePakistan Zhejiang Key Laboratory of Intelligent Education Technology and Application Zhejiang Normal UniversityJinhuaChina OTHEM Manchester Metropolitan UniversityManchesterUK Faculty of Computing and Information Technology King Abdulaziz UniversityJeddahSaudi Arabia Department of ICT and Natural Sciences Norwegian University of Science and Technology(NTNU)ÅlesundNorway

Transportation systems primarily depend on vehicular flow on roads. Developed coun-tries have shifted towards automated signal control, which manages and updates signal synchronisation automatically. In contrast, traffic in underdeveloped countries is mainly governed by manual traffic light systems. These existing manual systems lead to numerous issues, wasting substantial resources such as time, energy, and fuel, as they cannot make real‐time decisions. In this work, we propose an algorithm to determine traffic signal durations based on real‐time vehicle density, obtained from live closed circuit television camera feeds adjacent to traffic signals. The algorithm automates the traffic light system, making decisions based on vehicle density and employing Faster R‐CNN for vehicle detection. Additionally, we have created a local dataset from live streams of Punjab Safe City cameras in collaboration with the local police authority. The proposed algorithm achieves a class accuracy of 96.6% and a vehicle detection accuracy of 95.7%. Across both day and night modes, our proposed method maintains an average precision, recall, F1 score, and vehicle detection accuracy of 0.94, 0.98, 0.96 and 0.95, respectively. Our proposed work surpasses all evaluation metrics compared to state‐of‐the‐art methodologies.

关键词： access control artificial intelligence computer vision intelligent control

来源：评论

学校读者我要写书评

暂无评论

A Gradient-Guided Evolutionary Approach to Training Deep Neural Networks

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2022年第9期33卷 4861-4875页

作者： Yang, Shangshang Tian, Ye He, Cheng Zhang, Xingyi Tan, Kay Chen Jin, Yaochu Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei China Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Southern University of Science and Technology Shenzhen China Department of Computing The Hong Kong Polytechnic University Hong Kong SAR Department of Computer Science University of Surrey Guildford U.K

It has been widely recognized that the efficient training of neural networks (NNs) is crucial to classification performance. While a series of gradient-based approaches have been extensively developed, they are criticized for the ease of trapping into local optima and sensitivity to hyperparameters. Due to the high robustness and wide applicability, evolutionary algorithms (EAs) have been regarded as a promising alternative for training NNs in recent years. However, EAs suffer from the curse of dimensionality and are inefficient in training deep NNs (DNNs). By inheriting the advantages of both the gradient-based approaches and EAs, this article proposes a gradient-guided evolutionary approach to train DNNs. The proposed approach suggests a novel genetic operator to optimize the weights in the search space, where the search direction is determined by the gradient of weights. Moreover, the network sparsity is considered in the proposed approach, which highly reduces the network complexity and alleviates overfitting. Experimental results on single-layer NNs, deep-layer NNs, recurrent NNs, and convolutional NNs (CNNs) demonstrate the effectiveness of the proposed approach. In short, this work not only introduces a novel approach for training DNNs but also enhances the performance of EAs in solving large-scale optimization problems.

关键词： Artificial neural networks Training Optimization Search problems Scalability Complexity theory Genetic algorithms Deep neural networks (DNNs) evolutionary algorithm (EA) genetic operator gradient descent sparsity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：