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

arXiv 2025年

作者： Jiang, Feibo Tu, Siwei Dong, Li Wang, Kezhi Yang, Kun Liu, Ruiqi Pan, Cunhua Wang, Jiangzhou Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Information Science and Engineering Hunan Normal University Changsha410081 China School of Computer Science Hunan University of Technology and Business Changsha410205 China Xiangjiang Laboratory Changsha410205 China Department of Computer Science Brunel University London United Kingdom School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China Wireless and Computing Research Institute ZTE Corporation Beijing100029 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China National Mobile Communications Research Laboratory Southeast University Nanjing China Purple Mountain Laboratories Nanjing China

Semantic Communication (SemCom) is a promising new paradigm for next-generation communication systems, emphasizing the transmission of core information, particularly in environments characterized by uncertainty, noise, and bandwidth constraints. However, existing image SemCom systems face several challenges, such as inefficient knowledge base construction, insufficient semantic encoding, and lack of multi-user semantic sharing. To address these issues, we propose a Lightweight Vision Model-based Multi-user Semantic Communication System (LVM-MSC). First, we construct a Lightweight Knowledge Base (LKB) based on the fast Segment Anything Model (SAM). LKB incorporates the extensive image knowledge of the SAM model while significantly reducing the number of parameters through its convolutional architecture. Next, we design an Efficient Semantic Codec (ESC) based on the Masked AutoEncoder (MAE) architecture. ESC enhances semantic compression at both the pixel and semantic levels and implements lightweight semantic decoding tailored for user devices. Furthermore, we propose a Multi-user Semantic Sharing (MSS) transmission for the multi-user SemCom. By calculating the similarity of semantic information among different users in the sharing semantic space, we unify the transmissions of similar semantic information through broadcasting, further improving the transmission efficiency. Finally, simulation results demonstrate the feasibility and effectiveness of the proposed LVM-MSC system. Copyright © 2025, The Authors. All rights reserved.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

Informative gene selection using the Algebraic Connectivity Strength of Point and Scoring Criteria

引用

Chinese Science Bulletin 2013年第6期58卷 657-661页

作者： WANG Nian SU LiangLiang TANG Jun YE AiXia Key Laboratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui University School of Electronics and Information Engineering Anhui University

This paper presents a novel method that integrates the Algebraic Connectivity Strength of Point(ACSP) and Scoring Criteria to identify genes associated with tumor ***,for each gene,the ACSP is used to identify reliable expression levels of the gene in all the *** informative genes are then selected using Scoring Criteria based on these reliable expression ***,the Support Vector Machine(SVM) classifier is used to classify the two datasets of gene expression *** results show that the informative genes selected by the proposed method have higher credibility than those selected by Scoring Criteria alone.

关键词：基因选择评分标准信息化强度连通代数基因表达谱支持向量机

来源：评论

学校读者我要写书评

暂无评论

Combined model assisted evolutionary algorithm with complementary fill sampling criterion for expensive multi/many-objective optimization

引用

Swarm and Evolutionary Computation 2025年 96卷

作者： Qiuzhen Wang Feng Xie Yuan Liu Juan Zou Jinhua Zheng Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Computer Science Xiangtan Hunan Province China Faculty of School of Computer Science Xiangtan University Xiangtan 411105 China

In this paper, we design an algorithm to address the challenges of expensive multi-objective optimization problems by improving the surrogate model and sampling criterion. Firstly, we introduce a combined model which aims to enhance the impact of points that do not play a negative role, thus improving prediction accuracy. Subsequently, we develop two complementary indicators to accommodate various shapes of Pareto frontiers to better balance convergence and diversity in the sampling criterion. Experimental results on several benchmarks show that our proposed method is highly competitive in solving expensive multi-objective optimization problems compared to other state-of-the-art algorithms.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

DMFVAE:miRNA-disease associations prediction based on deep matrix factorization method with variational autoencoder

引用

Frontiers of Computer Science 2024年第6期18卷 259-270页

作者： Pijing WEI Qianqian WANG Zhen GAO Ruifen CAO Chunhou ZHENG Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial IntelligenceAnhui UniversityHefei 230601China

MicroRNAs(miRNAs)are closely related to numerous complex human diseases,therefore,exploring miRNA-disease associations(MDAs)can help people gain a better understanding of complex disease *** increasing number of computational methods have been developed to predict ***,the sparsity of the MDAs may hinder the performance of many *** addition,many methods fail to capture the nonlinear relationships of miRNA-disease network and inadequately leverage the features of network and neighbor *** this study,we propose a deep matrix factorization model with variational autoencoder(DMFVAE)to predict potential *** first decomposes the original association matrix and the enhanced association matrix,in which the enhanced association matrix is enhanced by self-adjusting the nearest neighbor method,to obtain sparse vectors and dense vectors,***,the variational encoder is employed to obtain the nonlinear latent vectors of miRNA and disease for the sparse vectors,and meanwhile,node2vec is used to obtain the network structure embedding vectors of miRNA and disease for the dense ***,sample features are acquired by combining the latent vectors and network structure embedding vectors,and the final prediction is implemented by convolutional neural network with channel *** evaluate the performance of DMFVAE,we conduct five-fold cross validation on the HMDD v2.0 and HMDD v3.2 datasets and the results show that DMFVAE performs ***,case studies on lung neoplasms,colon neoplasms,and esophageal neoplasms confirm the ability of DMFVAE in identifying potential miRNAs for human diseases.

关键词： miRNA-disease association deep matrix factorization self-adjusted nearest neighbor variational encoder network structure

来源：评论

学校读者我要写书评

暂无评论

Well limit behaviors of term rewriting systems

引用

中国高等学校学术文摘·计算机科学 2007年第3期1卷 283-296页

作者： MA Shilong SUI Yuefei XU Ke State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100083China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of SciencesBeijing 100080China

The limit behaviors of computations have not been fully *** is necessary to consider such limit behaviors when we consider the properties of infinite objects in computer science,such as infinite logic programs,the symbolic solutions of infinite polynomial ***,we can use finite objects to approximate infinite objects,and we should know what kinds of infinite objects are approximable and how to approximate them effectively.A sequence {Rκ:κω}of term rewriting systems has the well limit behavior if under the condition that the sequence has the Set-theoretic limit or the distance-based limit,the sequence {Th(Rκ):κ∈ω} of corresponding theoretic closures of Rκ has the set-theoretic or distance-based limit,and limκ→∞ Th(Rκ) is equal to the theoretic closure of the limit of {Rκ:κ∈ω).Two kinds of limits of term rewriting systems are considered:one is based on the set-theoretic limit,the other is on the distance-based *** is proved thatgiven a sequence {Rκ:κ∈ω) of term rewriting systems Rκ,if there is a well-founded ordering (-＜) on terms such that every Rκ is (-＜)-well-founded,and the set-theoretic limit of {Rκ:κ∈ω).exists,then {Rκ:κ∈ω).has the well limit behavior;and if (1) there is a well-founded ordering(-＜)on terms such that every Rκ is(-＜-well-founded,(2) there is a distance d on terms which is closed under substitutions and contexts and (3) {Rκ:κ∈ω).is Cauchy under d then {Rκ:κ∈ω).has the well limit *** results are used to approximate the least Herbrand models of infinite Horn logic programs and real Horn logic programs,and the solutions and Cr(o)bner bases of (infinite) sets of real polynomials by sequences of (finite) sets of rational polynomials.

关键词： term rewriting systems limits Gr(o)bner bases well-foundedness

来源：评论

学校读者我要写书评

暂无评论

An improved method of multi-strategy ontology mapping

An improved method of multi-strategy ontology mapping

引用

2010 International Conference on Computer Modeling and Simulation, ICCMS 2010

作者： Lv, Gang Wang, Kunlun Liu, Dengsheng Key Laboratory of Network and Intelligent Information Processing Hefei University Hefei China

ISBN: (纸本)9780769539416

In this paper, an improved multi-strategy ontology mapping method is proposed to improve the accuracy of the ontology mapping. The structural characteristics of ontology and the effect of instance mapping upon the similarity of ontology are considered generally. Furthermore, our approach represents and measures the structure of the conceptual nodes through the design of a "code" method, and judges the similarity of the nodes via utilizing the similarity of their ancestor nodes within the influential domain. A 1:1 mapping method is also put forward when operating the selection of initial candidates. In this paper, the tools of WordNet, Jena, protégé, etc. are employed. Finally, the experimental results show the promise of our approach and improve the recall and precision of the retrieve. © 2010 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Self-selecting sub-secret keys sharing scheme: Based on polynomials over elliptic curve

Self-selecting sub-secret keys sharing scheme: Based on poly...

引用

5th International Conference on information Assurance and Security, IAS 2009

作者： Caimei, Wang Zhengmao, Li Hefei University Key Laboratory of Network and Intelligent Information Processing Hefei China

ISBN: (纸本)9780769537443

Traditional secret sharing scheme generally exists two shortages:each participant's sub-secret key is distributed by the certification center;the sub-secret keys can not be repeated to use. Both shortages brought to the practical application a lot of inconvenience, and n sub-secret keys can only be used to share a master key in terms of resources is a waste. This article based on the reference [6] proposed a scheme with sub-secret keys be selected by participants, and those sub-secret keys can be reused. The scheme based on the security of elliptic curve discrete most of the difficult nature is more practical than the reference [6], and the realization of the process can solve the problem about the authenticity of the sub-secret keys. © 2009 IEEE.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Research and design of of intelligent generating test paper system

Research and design of of intelligent generating test paper ...

引用

2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009

作者： Wu, Xiaoqin Key Laboratory of Network and Intelligent Information Processing Hefei University Hefei China

ISBN: (纸本)9781424445073

According to the functional demand of intelligent Test Paper system, we have designed four functional modules: examination database, test paper-generation, grade analysis and system setup. Test paper generation module is the core of the system, The improved Genetic Algorithms is more efficient and easier to get over premature convergence than the traditional algorithms. It is proved by a number of experiments provided by this article. the test paper formed by the algorithm meets all the users' requirements if the quantity of test questions is moderate and reasonable. ©2009 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Fusing PLSA model and Markov random fields for automatic image annotation

引用

High Technology Letters 2014年第4期20卷 409-414页

作者：田东平 Zhao Xiaofei Shi Zhongzhi Institute of Computer Software Baoji University of Arts and Sciences Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences

A novel image auto-annotation method is presented based on probabilistic latent semantic analysis(PLSA) model and multiple Markov random fields(MRF).A PLSA model with asymmetric modalities is first constructed to estimate the joint probability between images and semantic concepts,then a subgraph is extracted served as the corresponding structure of Markov random fields and inference over it is performed by the iterative conditional modes so as to capture the final annotation for the *** novelty of our method mainly lies in two aspects:exploiting PLSA to estimate the joint probability between images and semantic concepts as well as multiple MRF to further explore the semantic context among keywords for accurate image *** demonstrate the effectiveness of this approach,an experiment on the Corel5 k dataset is conducted and its results are compared favorably with the current state-of-the-art approaches.

关键词： automatic image annotation probabilistic latent semantic analysis （PLSA） expectation maximization Markov random fields （MRF） image retrieval

来源：评论

学校读者我要写书评

暂无评论

A knowledge-enhanced interest segment division attention network for click-through rate prediction

引用

Neural computing and Applications 2024年第34期36卷 21817-21837页

作者： Liu, Zhanghui Chen, Shijie Chen, Yuzhong Su, Jieyang Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Click-through rate (CTR) prediction aims to estimate the probability of a user clicking on a particular item, making it one of the core tasks in various recommendation platforms. In such systems, user behavior data are crucial for capturing user interests, which has garnered significant attention from both academia and industry, leading to the development of various user behavior modeling methods. However, existing models still face unresolved issues, as they fail to capture the complex diversity of user interests at the semantic level, refine user interests effectively, and uncover users’ potential interests. To address these challenges, we propose a novel model called knowledge-enhanced Interest segment division attention network (KISDAN), which can effectively and comprehensively model user interests. Specifically, to leverage the semantic information within user behavior sequences, we employ the structure of a knowledge graph to divide user behavior sequence into multiple interest segments. To provide a comprehensive representation of user interests, we further categorize user interests into strong and weak interests. By leveraging both the knowledge graph and the item co-occurrence graph, we explore users’ potential interests from two perspectives. This methodology allows KISDAN to better understand the diversity of user interests. Finally, we extensively evaluate KISDAN on three benchmark datasets, and the experimental results consistently demonstrate that the KISDAN model outperforms state-of-the-art models across various evaluation metrics, which validates the effectiveness and superiority of KISDAN. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：