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

A Fast Clustering Based Evolutionary Algorithm for Super-Large-Scale Sparse Multi-Objective Optimization

IEEE/CAA Journal of Automatica Sinica 2023年第4期10卷 1048-1063页

作者： Ye Tian Yuandong Feng Xingyi Zhang Changyin Sun Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information TechnologyAnhui UniversityHefei 230601China School of Computer Science and Technology Anhui UniversityHefei 230601China School of Artificial Intelligence Anhui UniversityHefei 230601China School of Automation Southeast UniversityNanjing 210096China

During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable ***,due to the stochastic search strategies,the performance of most EAs deteriorates drastically when handling a large number of decision *** tackle the curse of dimensionality,this work proposes an efficient EA for solving super-large-scale multi-objective optimization problems with sparse optimal *** proposed algorithm estimates the sparse distribution of optimal solutions by optimizing a binary vector for each solution,and provides a fast clustering method to highly reduce the dimensionality of the search *** importantly,all the operations related to the decision variables only contain several matrix calculations,which can be directly accelerated by *** existing EAs are capable of handling fewer than 10000 real variables,the proposed algorithm is verified to be effective in handling 1000000 real ***,since the proposed algorithm handles the large number of variables via accelerated matrix calculations,its runtime can be reduced to less than 10%of the runtime of existing EAs.

关键词： Evolutionary computation fast clustering sparse multi-objective optimization super-large-scale optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deep Representation Learning for Electron Ionization Mass Spectra Retrieval

Deep Representation Learning for Electron Ionization Mass Sp...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

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

ISBN: (纸本)9798350386226

The task of retrieving and analyzing mass spectra is indispensable for the identification of compounds in mass spectrometry (MS). This methodology is of critical importance as it enables researchers to correlate observed spectra with established databases, thereby precisely determining the chemical composition of samples. The primary challenges to its efficacy lie in optimizing the balance between retrieval accuracy and processing speed. Empirical studies have demonstrated that by converting mass spectra into embeddings via deep learning, it is possible to achieve both high accuracy and speed in retrieval. Nevertheless, there are complex challenges associated with employing deep learning for spectral embedding, particularly within the domain of electron ionization mass spectrometry (EI-MS). In this paper, we introduce a novel representation learning technique termed EI-MS2VEC for EI-MS retrieval. Our spectrum retrieval methodology surpasses current state-of-the-art techniques such as FastEI. For the in-silico library, we attain hit rate@1 and hit rate@10 of 43.6% and 84.5%, respectively, compared to FastEI's 36.7% and 80.4%. Moreover, our retrieval approach operates with an order of magnitude greater speed than FastEI. The source code is available on Github (https://***/xfcui/EI-MS2VEC). © 2024 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Extending generalized unsupervised manifold alignment

引用

Science China(information Sciences) 2022年第7期65卷 139-156页

作者： Xiaoyi YIN Zhen CUI Hong CHANG Bingpeng MA Shiguang SHAN Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences School of Computer Science and Engineering Nanjing University of Science and Technology CAS Center for Excellence in Brain Science and Intelligence Technology

Building connections between different data sets is a fundamental task in machine learning and related application community. With proper manifold alignment, the correspondences between data sets will assist us with comprehensive study of data processes and analyses. Despite the several progresses in semi-supervised and unsupervised scenarios, potent manifold alignment methods in generalized and realistic circumstances remain in absence. Besides, theretofore unsupervised algorithms seldom prove themselves mathematically. In this paper, we devise an efficient method to properly solve the unsupervised manifold alignment problem and denominate it as extending generalized unsupervised manifold alignment(EGUMA)method. More specifically, an explicit relaxed integer programming method is adopted to solve the unsupervised manifold alignment problem, which reconciles three factors covering the updated local structure matching, the the feature comparability and geometric preservation. An additional effort is retained on extending the Frank Wolfe algorithm to tacking our optimization problem. Besides our previous endeavors we adopt a new strategy for neighborhood discovery in the manifolds. The main advantages over previous methods accommodate(1) simultaneous alignment and discovery of manifolds;(2) complete unsupervised learning structure without any prerequisite correspondence;(3) more concise local geometry for the embedding space;(4) efficient alternative optimization;(5) strict mathematical analysis on the convergence and efficiency issues. Experiments on real-world applications verify the high accuracy and efficiency of our proposed method.

关键词： unsupervised manifold alignment relaxed integer programming Frank Wolfe algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

GNSS Signal Acquisition Based on Compressive Sensing and Improved Measurement Matrix 6

GNSS Signal Acquisition Based on Compressive Sensing and Imp...

引用

6th International Conference on Electronic Engineering and Informatics, EEI 2024

作者： Zhang, Wenjun Chen, Jie Guo, Yincun Zhao, Yongchen School of Communication and Information Engineering Shanghai University Shanghai China Shanghai Aerospace Electronic Technology institute Shanghai Aerospace Electronic Technology Institute Shanghai Key Laboratory of Intelligent Computing for Spatial Heterogeneous Network Shanghai China

ISBN: (纸本)9798350353594

The main task of Global Navigation Satellite System (GNSS) receiver is to obtain satellite signals, but the signal acquisition operations performed in this process consume a large amount of hardware resources. Compressed sensing is a new signal sampling theory that can reduce the calculation amount of the acquisition process, but it will also bring a certain signal-to-noise ratio loss. In order to improve the acquisition performance on the basis of reducing the amount of signal acquisition calculations, this paper proposes an improved measurement matrix compressed sensing signal partial matched filter-fast Fourier transform (PMF -FFT) acquisition method, which improves the Gaussian random matrix through singular value decomposition and improves the incoherence of the measurement matrix. Simulation results show that this method significantly reduces the amount of acquisition calculations without greatly reducing the acquisition performance. © 2024 IEEE.

关键词： Matched filters

来源：评论

学校读者我要写书评

暂无评论

A Unified Framework Integrating Knowledge and Data for Collaborative Root Cause Identification 5

A Unified Framework Integrating Knowledge and Data for Colla...

引用

5th International Conference on Sensing, Measurement and Data Analytics in the Era of Artificial Intelligence, ICSMD 2024

作者： Yu, Jiefei Cao, Zicheng He, Siyi Gu, Zuyi Xu, Yingcheng Zhong, Kai Institutes of Physical Science and Information Technology Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui China School of Big Data and Statistics Anhui University Anhui China

ISBN: (纸本)9798331529192

Capturing the root cause and propagation path of the fault is critical to ensuring the safety and efficiency of industrial processes, especially those that inadequately utilize process knowledge and data. To address this issue, a unified framework integrating knowledge and data for collaborative root cause identification is proposed. First, the knowledge causal graph (KCG) is constructed using expert knowledge and industrial flow charts, providing a preliminary reference for subsequent causality analysis. Next, by replacing the traditional vector autoregression (VAR) model in Granger Causality (GC) with the gated recurrent unit (GRU), a more reliable causal relationship between variables is obtained. Additionally, a causality fusion propagation path identification method (CF-PPI) is designed to identify the root cause and propagation path of the fault, so that the obtained fault propagation path has less redundancy and higher accuracy. Finally, the method is validated using data from the ASHRAE RP-1043 centrifugal chiller. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

SynPrompt: Syntax-aware Enhanced Prompt Engineering for Aspect-based Sentiment Analysis 30

SynPrompt: Syntax-aware Enhanced Prompt Engineering for Aspe...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Yin, Wen Liu, Cencen Xu, Yi Wahla, Ahmad Yiting, Huang Zheng, Dezhang School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu610054 China Laboratory of Intelligent Collaborative Computing Chengdu611731 China Bashu Middle School Chongqing400013 China

ISBN: (纸本)9782493814104

Although there have been some studies uses prompt learning for the Aspect-based Sentiment Analysis(ABSA) tasks, their methods of prompt-tuning are simple and crude. Compared with vanilla fine-tuning methods, prompt learning intuitively bridges the objective form gap between pre-training and fine-tuning. Concretely, simply constructing prompt related to aspect words fails to fully exploit the potential of Pre-trained Language Models, and conducting more robust and professional prompt engineering for downstream tasks is a challenging problem that needs to be solved urgently. Therefore, in this paper, we propose a novel syntax-aware enhanced prompt method (SynPrompt), which sufficiently mines the key syntactic information related to aspect words from the syntactic dependency tree. Additionally, to effectively harness the domain-specific knowledge embedded within PLMs for the ABSA tasks, we constructed two adaptive prompt frameworks to enhance the perception ability of the above method. After conducting extensive experiments on three benchmark datasets, we have found that our method consistently achieves favorable results. These findings not only demonstrate the effectiveness and rationality of our proposed methods but also provide a powerful alternative to traditional prompt-tuning. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

A Novel Construction of Two-Dimensional Z-Complementary Array Code Sets Based on Extended Boolean Functions

引用

IEEE Transactions on Vehicular technology 2025年第5期74卷 7821-7834页

作者： Tian, Liying Song, Xiaoshi Li, Yubo Zhang, Haijun Northeastern University School of Computer Science and Engineering Shenyang110819 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110189 China Yanshan University School of Information Science and Engineering Qinhuangdao066004 China Hebei Key Laboratory of Information Transmission and Signal Processing Qinhuangdao066004 China University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China

Two-dimensional (2-D) array sets with good 2-D correlation properties have received considerable attention in wireless communication systems. This paper focuses on 2-D Z-complementary array code sets (ZCACSs), which have ideal 2-D correlation properties within a rectangular zone around the origin. By developing a theory linking 2-D extended Boolean functions with 2-D arrays, we establish an efficient construction of 2-D ZCACSs. In contrast to previous work, the proposed construction is capable of producing 2-D ZCACSs with new flexible parameters. Constructions of three-dimensional (3-D) and higher-dimensional ZCACSs are further investigated. We remark that 2-D and higher-dimensional complete complementary codes (CCCs) can also be generated from the proposed constructions. © 1967-2012 IEEE.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：