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

6th International Conference on Frontier Technologies of information and Computer, ICFTIC 2024

作者： Song, Hao Lei, Yuxia Zi, Kangli Quan, Fuyuan Zhang, Tianhang Li, Qi School of Computer Science Qufu Normal University Shandong Rizhao China Institute of Computing Technology Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Beijing China

ISBN: (纸本)9798331541750

Entity alignment plays a crucial role in the integration of knowledge graphs. However, current knowledge graphs often suffer from inconsistent construction standards, structural heterogeneity, and imprecise semantic representation of entities, which can lead to suboptimal embedding of structural information. Moreover, most existing entity alignment methods rely heavily on structural information, which limits alignment efficiency. To address these challenges, this paper presents Onto-IMF, an ontology-enhanced entity alignment method based on multi-feature fusion. This approach aims to enhance the semantic representation of entities by incorporating ontology information, thereby reducing structural discrepancies among heterogeneous graphs and improving the embedding of structural information. The multi-feature fusion entity alignment leverages diverse semantic features, including relations, attributes, and entity names, to achieve more accurate alignment. Experimental results on various DBP15K subsets indicate that the proposed method achieves Hits@l scores of 86.6%, 93.0%, and 97.7%, respectively, representing an average improvement of 7.9% over the best-performing baseline models. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA Network With Application to Competitive Coordination of Multiple Robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

Speculative Decoding with CTC-based Draft Model for LLM Inference Acceleration 38

Speculative Decoding with CTC-based Draft Model for LLM Infe...

引用

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Wen, Zhuofan Gui, Shangtong Feng, Yang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences China Key Laboratory of Al Safety Chinese Academy of Sciences China University of Chinese Academy of Sciences Beijing China

Inference acceleration of large language models (LLMs) has been put forward in many application scenarios and speculative decoding has shown its advantage in addressing inference acceleration. Speculative decoding usually introduces a draft model to assist the base LLM where the draft model produces drafts and the base LLM verifies the draft for acceptance or rejection. In this framework, the final inference speed is decided by the decoding speed of the draft model and the acceptance rate of the draft provided by the draft model. Currently the widely used draft models usually generate draft tokens for the next several positions in a non-autoregressive way without considering the correlations between draft tokens. Therefore, it has a high decoding speed but an unsatisfactory acceptance rate. In this paper, we focus on how to improve the performance of the draft model and aim to accelerate inference via a high acceptance rate. To this end, we propose a CTC-based draft model which strengthens the correlations between draft tokens during the draft phase, thereby generating higher-quality draft candidate sequences. Experiment results show that compared to strong baselines, the proposed method can achieve a higher acceptance rate and hence a faster inference speed. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive Multi-Updating Strategy Based Particle Swarm Optimization

引用

intelligent Automation & Soft computing 2023年第9期37卷 2783-2807页

作者： Dongping Tian Bingchun Li Jing Liu Chen Liu Ling Yuan Zhongzhi Shi School of Computer Science and Technology Kashi UniversityKashi844006China Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing100190China

Particle swarm optimization(PSO)is a stochastic computation tech-nique that has become an increasingly important branch of swarm intelligence ***,like other evolutionary algorithms,PSO also suffers from premature convergence and entrapment into local optima in dealing with complex multimodal *** this paper puts forward an adaptive multi-updating strategy based particle swarm optimization(abbreviated as AMS-PSO).To start with,the chaotic sequence is employed to generate high-quality initial particles to accelerate the convergence rate of the ***,according to the current iteration,different update schemes are used to regulate the particle search process at different evolution *** be specific,two different sets of velocity update strategies are utilized to enhance the exploration ability in the early evolution stage while the other two sets of velocity update schemes are applied to improve the exploitation capability in the later evolution *** by the unequal weightage of acceleration coefficients is used to guide the search for the global worst particle to enhance the swarm *** addition,an auxiliary update strategy is exclusively leveraged to the global best particle for the purpose of ensuring the convergence of the PSO ***,extensive experiments on two sets of well-known benchmark functions bear out that AMS-PSO outperforms several state-of-the-art PSOs in terms of solution accuracy and convergence rate.

关键词： Particle swarm optimization local optima acceleration coefficients swarm diversity premature convergence

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preservation Method for Attributed Social Network Based on Negative Representation of information

引用

Computer Modeling in Engineering & Sciences 2024年第7期140卷 1045-1075页

作者： Hao Jiang Yuerong Liao Dongdong Zhao Wenjian Luo Xingyi Zhang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei230601China Chongqing Research Institute School of Computer Science and Artificial IntelligenceWuhan University of TechnologyWuhan430070China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and TechnologyHarbin Institute of TechnologyShenzhen518055China

Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many *** by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network ***,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called ***,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept ***,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social *** evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social *** experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding *** experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.

关键词： Attributed social network topology privacy node attribute privacy negative representation of information negative survey negative database

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SDGNN: Symmetry-Preserving Dual-Stream Graph Neural Networks

引用

IEEE/CAA Journal of Automatica Sinica 2024年第7期11卷 1717-1719页

作者： Jiufang Chen Ye Yuan Xin Luo the College of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing 400065 the Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China the College of Computer and Information Science Southwest UniversityChongqing 400715China IEEE

Dear Editor,This letter proposes a symmetry-preserving dual-stream graph neural network(SDGNN) for precise representation learning to an undirected weighted graph(UWG). Although existing graph neural networks(GNNs) are influential instruments for representation learning to a UWG, they invariably adopt a unique node feature matrix for illustrating the sole node set of a UWG.

关键词： representation preserving undirected

来源：评论

学校读者我要写书评

暂无评论

Joint state-sharing and truncation BCJR for power-efficient coherent optical interconnections utilizing symbol-rate sampling DSP over a hollow-core fiber

引用

Optics Letters 2025年第10期50卷 3461-3464页

作者： Wang, Chenchen Li, Zhipei Dong, Ze Gao, Ran Song, Junyuan Mai, Tianle Guo, Dong Chang, Huan Pan, Xiaolong Zhu, Lei Xin, Xiangjun School of Information and Electronics Beijing Institute of Technology Beijing100081 China National Key Laboratory of Science and Technology on Space-Born Intelligent Information Processing Beijing100081 China School of Integrated Circuits Beijing University of Posts and Telecommunications Beijing100876 China

Power-efficient digital signal processing (DSP) architectures are indispensable for enabling the sustainable scalability of optical networks in next-generation data center interconnects (DCIs). This paper introduces a minimalist symbol-rate sampling (SRS) DSP framework for coherent optical systems, seamlessly integrated with a hollow-core fiber (HCF) to enable ultra-low-complexity signal processing. The core of this framework is the joint state-sharing and truncation Bahl–Cocke–Jelinek–Raviv (JSST-BCJR) algorithm, which enhances hardware efficiency by eliminating up to 91% of state-space computations, significantly reducing computational complexity while maintaining negligible performance degradation. Experimental validation confirms the feasibility of the proposed minimalist SRS-DSP framework through the successful transmission of a 100-Gbaud 16QAM signal over 20.6 km of HCF. This work underscores the viability of SRS-DSP in power-constrained DCIs and highlights the synergistic integration of low-complexity DSP and HCF, offering a pathway toward power-efficient, high-throughput optical networks. © 2025 Optica Publishing Group. All rights are reserved.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

FUZZY ALIGNMENTS IN DIRECTED ACYCLIC GRAPH FOR NON-AUTOREGRESSIVE MACHINE TRANSLATION 11

FUZZY ALIGNMENTS IN DIRECTED ACYCLIC GRAPH FOR NON-AUTOREGRE...

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Ma, Zhengrui Shao, Chenze Gui, Shangtong Zhang, Min Feng, Yang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Harbin Institute of Technology Shenzhen China

Non-autoregressive translation (NAT) reduces the decoding latency but suffers from performance degradation due to the multi-modality problem. Recently, the structure of directed acyclic graph has achieved great success in NAT, which tackles the multi-modality problem by introducing dependency between vertices. However, training it with negative log-likelihood loss implicitly requires a strict alignment between reference tokens and vertices, weakening its ability to handle multiple translation modalities. In this paper, we hold the view that all paths in the graph are fuzzily aligned with the reference sentence. We do not require the exact alignment but train the model to maximize a fuzzy alignment score between the graph and reference, which takes captured translations in all modalities into account. Extensive experiments on major WMT benchmarks show that our method substantially improves translation performance and increases prediction confidence, setting a new state of the art for NAT on the raw training data. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：