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

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

来源：评论

学校读者我要写书评

暂无评论

XGRouter： high-quality global router in X-architecture with particle swarm optimization

引用

Frontiers of Computer Science 2015年第4期9卷 576-594页

作者： Genggeng LIU Wenzhong GUO Rongrong LI Yuzhen NIU Guolong CHEN College of Mathematics and Computer Science Fuzhou University Fuzhou 350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350116 China

This paper presents a high-quality very large scale integration （VLSI） global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming （ILP） techniques, partition strategy and particle swarm optimization （PSO）. A new ILP formulation, which can achieve more uniform routing solution than other formu- lations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing re- gion is extended progressively from the most congested re- git）n. In the post-processing stage of XGRouter, maze rout- ing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global rout- ing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global touters, XGRouter has no overflow.

关键词： global routing overflow total wire length con-gestion uniformity X-architecture particle swarm optimiza-tion integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Security-Reliability Analysis and Optimization for cognitive Two-Way Relay Network with Energy Harvesting

引用

China Communications 2024年第11期21卷 163-179页

作者： Luo Yi Zhou Lihua Dong Jian Sun Yang Xu Jiahui Xi Kaixin Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha 410081China School of Electronic Information Central South UniversityChangsha 410075China

This paper investigates the security and reliability of information transmission within an underlay wiretap energy harvesting cognitive two-way relay *** the network,energy-constrained secondary network(SN)nodes harvest energy from radio frequency signals of a multi-antenna power *** SN sources exchange their messages via a SN decode-and-forward relay in the presence of a multiantenna eavesdropper by using a four-phase time division broadcast protocol,and the hardware impairments of SN nodes and eavesdropper are *** alleviate eavesdropping attacks,the artificial noise is applied by SN *** physical layer security performance of SN is analyzed and evaluated by the exact closed-form expressions of outage probability(OP),intercept probability(IP),and OP+IP over quasistatic Rayleigh fading ***,due to the complexity of OP+IP expression,a self-adaptive chaotic quantum particle swarm optimization-based resource allocation algorithm is proposed to jointly optimize energy harvesting ratio and power allocation factor,which can achieve security-reliability tradeoff for *** simulations demonstrate the correctness of theoretical analysis and the effectiveness of the proposed optimization algorithm.

关键词： artificial noise energy harvesting cognitive two-way relay network hardware impairments physical layer security security-reliability tradeoff self-adaptive quantum particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Asymptotic solution of a wide moving jam to a class of higher-order viscous traffic flow models

引用

Applied Mathematics and Mechanics(English Edition) 2018年第5期39卷 609-622页

作者： Chunxiu WU College of Mathematics and Computer Science Quanzhou Normal UniversityQuanzhou 362000Fujian ProvinceChina Fujian Provincial Key Laboratory of Data Intensive Computing Quanzhou 362000Fujian ProvinceChina Key Laboratory of Intelligent Computing and Information Processing Quanzhou 362000Fujian ProvinceChina

The boundary-layer method is used to study a wide moving jam to a class of higher-order viscous models. The equations for characteristic parameters are derived to determine the asymptotic solution. The sufficient and essential conditions for the wide moving jam formation are discussed in detail, respectively, and then used to prove or disprove the existence of the wide moving jam solutions to many well-known higher-order models. It is shown that the numerical results agree with the analytical results.

关键词： higher-order traffic flow model wide moving jam boundary-layer method,weighted essentially nonoscillatory （WENO） scheme

来源：评论

学校读者我要写书评

暂无评论

LMP-GAN: Out-Of-Distribution Detection For Non-Control Data Malware Attacks

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Wood, David Kapp, David Kebede, Temesgen Hirakawa, Keigo Wuhan University School of Computer Science China Wuhan University National Engineering Research Center for Multimedia Software Hubei Key Laboratory of Multimedia and Network Communication Engineering China Zhongguancun Academy China Wuhan University State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing China Sun Yat-sen University School of Geography and Planning China Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Chongqing University College of Computer Science China The University of Tokyo Japan RIKEN Center for Advanced Intelligence Project Japan Intelligent Science & Technology Academy Limited CASIC China iFlytek Company Ltd. National Engineering Research Center of Speech and Language Information Processing China Nanyang Technological University College of Computing & Data Science Singapore Henan Academy of Sciences Aerospace Information Research Institute China

Anomaly detection is a common application of machine learning. Out-of-distribution (OOD) detection in particular is a semi-supervised anomaly detection technique where the detection method is trained only on the inlier (in-distribution) samples - unlike the fully supervised variant, the distribution of the outlier samples are never explicitly modeled in OOD detection tasks. In this work, we design a novel GAN-based OOD detection network specifically designed to protect a cyber-physical signal systems from novel Trojan malware called non-control data (NCD) attack that evades conventional malware detection techniques. Inspired in part by the classical locally most powerful (LMP) test in statistical inferences, the proposed LMP-GAN trains the OOD detector (discriminator) by generating OOD samples that are aimed at making maximal alteration to the inlier samples while evading detection. We experimentally compare the results to the state-of-the-art anomaly detection methods to demonstrate the benefits and the appropriateness of the LMP-GAN OOD detector. © 2025 IEEE.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

The M-computations induced by accessibility relations in nonstandard models M of Hoare logic

引用

Frontiers of Computer Science 2016年第4期10卷 717-725页

作者： Cungen CAO Yuefei SUI Zaiyue ZHANG Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Department of Computer Science Jiangsu University of Sciences and Technology Zhenjiang 212003 China

Hoare logic is a logic used as a way of specifying semantics of programming languages, which has been extended to be a separation logic to reason about mutable heap structure. In a model M of Hoare logic, each program α induces an M-computable function fα M on the universe of M; and the M-recursive functions are defined on M. It will be proved that the class of all the M-computable functions fα M induced by programs is equal to the class of all the M- recursive functions. Moreover, each M-recursive function is ∑ 1 NM -definable in M, where the universal quantifier is a num- ber quantifier ranging over the standard part of a nonstandard model M.

关键词： Hoare logic recursive ：Function computable function nonstandard model of Peano arithmetic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：