检索结果-南通市图书馆

Analysis of Gene Networks for Arabidopsis Flowering

在线全文

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2012年第6期17卷 682-690页

作者： Yansen Su Dazhi Meng Eryan Li Shudong Wang Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China College of Applied Sciences Beijing University of Technology Beijing 100124 China Institute of information Science and Engineering Shandong University of Science and Technology Qingdao 266510 China

The flowering time of Arabidopsis is sensitive to climate variability, with lighting conditions being a major determinant of the flowering time. Long-days induce early flowering, while short-days induce late flowering or even no flowers. This study investigates the intrinsic mechanisms for Arabidopsis flowering in different lighting conditions using mutual information networks and logic networks. The structure parameters of the mutual information networks show that the average degree and the average core clearly distinguish these networks. A method is then given to find the key structural genes in the mutual information networks and the logic networks respectively. Ten genes are found to possibly promote flowering with three genes that may restrain flowering. The sensitivity of this method to find the genes that promote flowering is 80%, while the sensitivity of the method to find the genes that restrain flowering is 100%.

关键词： flowering gene gene network high-order logic mutual information systems biology

Chinese Term Extraction Based on PAT Tree

在线全文

学校读者我要写书评

暂无评论

Journal of Beijing Institute of Technology 2006年第2期15卷 162-166页

作者：张锋樊孝忠许云 School of Computer Science and Technology Beijing Institute of Technology

A new method of automatic Chinese term extraction is proposed based on Patricia （PAT） tree. mutual information is calculated based on prefix searching in PAT tree of domain corpus to estimate the internal associative strength between Chinese characters in a string. It can improve the speed of term candidate extraction largely compared with methods based on domain corpus directly. Common collocation suffix, prefix bank are constructed and term part of speech （POS） composing rules are summarized to improve the precision of term extraction. Experiment results show that the F-measure is 74.97%.

关键词： term extraction PAT tree mutual information corpus

Intrusion Detection Method Based on Improved Growing Hierarchical Self-Organizing Map

在线全文

学校读者我要写书评

暂无评论

Transactions of Tianjin University 2016年第4期22卷 334-338页

作者：张亚平布文秀苏畅王璐瑶许涵 School of Software Tianjin University School of Mathematical Science Nankai University

Considering that growing hierarchical self-organizing map(GHSOM) ignores the influence of individual component in sample vector analysis, and its accurate rate in detecting unknown network attacks is relatively lower, an improved GHSOM method combined with mutual information is proposed. After theoretical analysis, experiments are conducted to illustrate the effectiveness of the proposed method by accurately clustering the input data. Based on different clusters, the complex relationship within the data can be revealed effectively.

关键词： growing hierarchical self-organizing map(GHSOM) hierarchical structure mutual information intrusion detection network security

The Theoretical and Experimental Analysis of the Maximal information Coefficient Approximate Algorithm

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science and information 2021年第1期9卷 95-104页

作者： Fubo SHAO Hui LIU State Key Laboratory of Rail Trufic Control and Safety Beijing Jiaotong UniversityBeijing 100044China The Post-Doctor Stalion of the CRRC Corporation Limited Beijing 100067ChinaCRRC AcademyBeijing 100067China School of Mathematics and Physics Qingdao Universily of Science and TechnologyQingdao 266061China

In the era of big data,correlation analysis is significant because it can quickly detect the correlation between *** then,it has been received much *** to the good properties of generality and equitability of the maximal information coefficient(MIC),MIC is a hotspot in the research of correlation ***,if the original approximate algorithm of MIC is directly applied into mining correlations in big data,the computation time is very *** the theoretical time complexity of the original approximate algorithm is analyzed in depth and the time complexity is n2.4 when parameters are *** the experiments show that the large number of candidate partitions of random relationships results in long computation *** analysis is a good preparation for the next step work of designing new fast algorithms.

关键词： statistical correlation the maximal information coefficient approximate algorithm mutual information dynamic programming algorithm

AUTOMATIC SEGMENTATION OF HIPPOCAMPAL SUBFIELDS BASED ON MULTI-ATLAS IMAGE SEGMENTATION TECHNIQUES

在线全文

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2014年第2期31卷 121-128页

作者： Shi Yonggang Zhang Xueping Liu Zhiwen Department of Electronic Engineering School of Information and ElectronicsBeijing Institute of Technology

The volume of hippocampal subfields is closely related with early diagnosis of Alzheimer's *** to the anatomical complexity of hippocampal subfields,automatic segmentation merely on the content of MR images is extremely *** presented a method which combines multi-atlas image segmentation with extreme learning machine based bias detection and correction technique to achieve a fully automatic segmentation of hippocampal *** diffeomorphic registration driven by symmetric mutual information energy was implemented in atlas registration,which allows multi-modal image registration and accelerates execution *** exponential function based label fusion strategy was proposed for the normalized similarity measure case in segmentation combination,which yields better combination *** test results show that this method is effective,especially for the larger subfields with an overlap of more than 80%,which is competitive with the current methods and is of potential clinical significance.

关键词： Hippocampal subfields Image segmentation Symmetric diffeomorphism mutual information Label fusion Extreme Learning Machine(ELM)

Performance Evaluation Approach for Image Mosaicing Algorithm 25th

在线全文

学校读者我要写书评

暂无评论

Performance Evaluation Approach for Image Mosaicing Algorith...

Web Database Sampling Approach Based on Attribute Correlation

第25届中国控制与决策会议

作者： Zhang Weibo Li Jianxun Zhang Zhi Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and information Processing M inistry of Education of China

ISBN: (纸本)9781467355339

In order to evaluate performance of any image mosaic algorithm objectively, a complete evaluation indicators system is constructed in this paper based on reference panoramas or non-reference panoramas. The involved indicators reflect human visual effect, image registration accuracy and image fusion effect. Then the formula of registration error （RE） is improved from TRE. M eanwhile, a blind evaluation approach related on the indicators system is proposed to avoid any manual interventions and to keep the computational simplicity. Exhaustive tests show that the proposed approach can reflect performance of image mosaic algorithm comprehensively and the result of experiment is consistent with subjective evaluation.

关键词： Image mosaicing indicators system registration error mutual information reference panorama

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2010年第4期15卷 297-302页

作者： TIAN Jianwei, LI Shijun, TANG Xiaoyue School of Computer, Wuhan University, Wuhan 430072, Hubei, China School of Computer Wuhan University Wuhan Hubei China

In this paper,we present a novel approach utilizing attributes correlation for the sampling task on nonuniform hidden databases. We propose the method of calculating the attributes dependency and construct the sampling template according to the attributes dependency. Then,we use the sampling template to gen-erate initial sampling queries and propose a bottom-up algorithm to search the sampling template. We also conduct extensive ex-periments over real deep Web sites and controlled databases to illustrate that our sampling method has good performance both on the quality and efficiency.

关键词： attributes correlation hidden database sampling template mutual information

Achievable information rate optimization in C‑band optical fber communication system

在线全文

学校读者我要写书评

暂无评论

Frontiers of Optoelectronics 2023年第2期16卷 123-128页

作者： Zheng Liu Tianhua Xu Ji Qi Joshua Uduagbomen Jian Zhao Tiegen Liu School of Precision Instrument and Opto-Electronics Engineering Tianjin UniversityTianjin 300072China School of Engineering University of WarwickCoventry CV47ALUK Department of Electronic and Electrical Engineering University College LondonLondon WC1E 7JEUK

Optical fber communication networks play an important role in the global telecommunication ***,nonlinear efects in the optical fber and transceiver noise greatly limit the performance of fber communication *** this paper,the product of mutual information(MI)and communication bandwidth is used as the metric of the achievable information rate(AIR).The MI loss caused by the transceiver is also considered in this work,and the bit-wise MI,generalized mutual information(GMI),is used to calculate the *** loss is more signifcant in the use of higher-order modulation *** AIR analysis is carried out in the QPSK,16QAM,64QAM and 256QAM modulation formats for the communication systems with diferent communication bandwidths and transmission distances based on the enhanced Gaussian noise(EGN)*** paper provides suggestions for the selection of the optimal modulation format in diferent transmission scenarios.

关键词： Optical fber communication Achievable information rate mutual information Generalized mutual information

Unpaired image to image transformation via informative coupled generative adversarial networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2021年第4期15卷 83-92页

作者： Hongwei GE Yuxuan HAN Wenjing KANG Liang SUN College of Computer Science and Technology Dalian University of TechnologyDalian 116024China

We consider image transformation problems,and the objective is to translate images from a source domain to a target *** problem is challenging since it is difficult to preserve the key properties of the source images,and to make the details of target being as distinguishable as *** solve this problem,we propose an informative coupled generative adversarial networks(ICoGAN).For each domain,an adversarial generator-and-discriminator network is ***,we make an approximately-shared latent space assumption by a mutual information mechanism,which enables the algorithm to learn representations of both domains in unsupervised setting,and to transform the key properties of images from source to ***,to further enhance the performance,a weightsharing constraint between two subnetworks,and different level perceptual losses extracted from the intermediate layers of the networks are *** quantitative and visual results presented on the tasks of edge to photo transformation,face attribute transfer,and image inpainting,we demonstrate the ICo-GAN’s effectiveness,as compared with other state-of-the-art algorithms.

关键词： generative adversarial networks image transformation mutual information perceptual loss