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

EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC

作者： Tianzhu, Wang Wenhui, Li Yi, Wang Zihou, Ge Dongfeng, Han Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)3540332375

In this paper, we present an efficient method for detecting collisions between highly deformable objects, which is a combination of newly developed stochastic method and Particle Swarm Optimization (PSO) algorithm. Firstly, our algorithm samples primitive pairs within the models to construct a discrete binary search space for PSO, and in this way user can balance performance and detection quality. Besides a particle update process is added in every time step to handle the dynamic environments caused by deformations. Our algorithm is also very general that makes no assumptions about the input models and doesn't need to store additional data structures either. In the end, we give the precision and efficiency evaluation about the algorithm and find it might be a reasonable choice for complex deformable models in collision detection systems. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Intelligent agents

来源：评论

学校读者我要写书评

暂无评论

An extended system method for consistent fundamental matrix estimation

An extended system method for consistent fundamental matrix ...

引用

International Conference on Intelligent Computing, ICIC 2005

作者： Zhong, Huixiang Feng, Yueping Pang, Yunjie Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)9783540282266

This paper is concerned with solution of the consistent fundamental matrix estimation in a quadratic measurement error model. First an extended system for determining the estimator is proposed, and an efficient implementation for solving the system-a continuation method is developed to fix on an interval in which a local minimum belongs. Then an optimization method using a quadratic interpolation is used to exactly locate the minimum. The proposed method avoids solving total eigenvalue problems. Thus the computational cost is significantly reduced. Synthetic and real images are used to verify and illustrate the effectiveness of the proposed approach. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computer systems

来源：评论

学校读者我要写书评

暂无评论

The BBC news hunter: A novel crawler for BBC news 2nd

The BBC news hunter: A novel crawler for BBC news

引用

2nd International Conference on Young Computer Scientists, Engineers and Educators, ICYCSEE 2016

作者： Wang, Mingxin Wang, Ning Wang, Boran Tian, Can Liang, Yanchun Zhao, Guozhong Han, Xiaosong College of Software Jilin University Changchun130012 China Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory for Symbol Computation Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Zhuhai519041 China Daqing Oilfield Personnel Development Institute CNPC Daqing163000 China

ISBN: (纸本)9789811020971

In order to distinguish and extract the topic information from other interferential information on the BBC news website for the study in social computing, the BBC News Hunter was proposed in this paper. The whole system consists of 6 subsystems, respectively named: UI, Control, Download, Analysis, Storage and Log. Numerical experiments show that satisfactory results can be obtained from the BBC news website, whose average accuracy as well as efficiency are acceptable. © Springer Science+Business Media Singapore 2016.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

An AutoEncoder-Based Matrix Factorization Approach to Estimating Cell Proportion from Bulk Tumor RNA-seq Data

An AutoEncoder-Based Matrix Factorization Approach to Estima...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Xu, Yingze Wang, Yan Xie, Xuping Wang, Feilong Chen, Qiong Sun, Huiyan Jilin University College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun China Jilin University School of Artificial Intelligence Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun China

ISBN: (纸本)9781665401265

The deconvolution of infiltrating immune cells and stromal cells from complex tumor tissues is significant for studying the impact of these cells on tumor development, as well as assisting cancer therapies. Integrating cell-specific marker genes from several references, we put forward an AutoEncoder-based matrix factorization method to estimate the cell proportion in heterogeneous samples. The proportion predicted by our method achieved over 0.95 Pearson correlation coefficient (PCC) with the ground truth. Moreover, through analyzing association between cell proportion of tumor tissues and clinical information of the tumor patients, we found that the proportion of cancer-associated fibroblast (CAF) gradually increased with the progress of tumor, and the proportion of B cell in tissues was significantly related to the five-year survival rate of tumor patients. © 2021 IEEE.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

An integration of cotraining and KNN for LPU problem

An integration of cotraining and KNN for LPU problem

引用

2nd Indian International Conference on Artificial Intelligence, IICAI 2005

作者： Xin, RuiMing Zuo, WanLi Yang, Ping Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology JiLin University Changchun 130012 China

ISBN: (纸本)0972741216

Under the framework of LPU (learning from positive data and unlabeled data), this paper originally proposes a three-step algorithm. First, Co-Training is employed for filtering out the "suspect positive" data from the unlabeled dataset U. If CoTraining filter out the most of positive data mixed in U, the remainder of U can be viewed as a negative set with a little noise. Second, a constrained KNN approach attempts to pick out the positive data from "suspect positive" dataset which is produced in first step. Those data picked out can be supplied to positive dataset P. Finally, a linear SVM will learn from both the purified U as negative and the expanded P as positive. Because of the algorithm's characteristic of automatic expanding positive dataset, the proposed algorithm especially performs well in situations where given positive dataset P is insufficient. A comprehensive experiment proves that our algorithm is preferable to the existing ones. Copyright © IICAI 2005.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Canonical Huffman code based full-text index

引用

Progress in Natural Science:Materials International 2008年第3期18卷 325-330页

作者： Yi Zhang a,b, Zhili Pei a, Jinhui Yanga, Yanchun Liang a, a College of Computer Science and Technology, Jilin University, key laboratory of symbol computation and knowledge engineering of the Ministry of Education, Changchun 130012, China b Department of Computer Science, Jilin Technology and Business College, Changchun 130062, China College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China Department of Computer Science Jilin Technology and Business College Changchun 130062 China

Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) bits and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.

关键词： Full-text index Su?x automaton Canonical Hu?man code

来源：评论

学校读者我要写书评

暂无评论

Improved filter feature selection methods by samples localization

引用

Journal of Bionanoscience 2013年第4期7卷 371-377页

作者： Sun, Ying Wang, Yan Chen, Liang Du, Wei Cao, Zhongbo Zhou, You College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China College of Chemistry Jilin University Changchun 130012 China

With the development of high-throughput microarray technology, a large number of microarray data has been obtained by tens of thousands of simulation experiments on gene expression. However, due to the high cost, gene expression data of each experiment has a small number of samples for tens of thousands of genes. Furthermore, most of the genes, such as the features, are unrelated to classification. Therefore, developing an effective and robust method to extract informative genes subset from high dimensional microarray data is a challenging and important issue for microarray data analysis. In this article, we propose an improved feature selection method by samples localization. We only use localized samples to select genes subset, in order to effectively overcome the influence on the results of feature selection by outlier samples and the distribution of samples. Experimental results obtained by SVM classifiers on Leukemia dataset, Prostate dataset, Colon dataset, Breast dataset, DLBCL dataset and Lung dataset demonstrate that the proposed method is superior to those original filter feature selection methods both in best and average accuracies. Copyright © 2013 American Scientific Publishers. Website © 2013 Publishing Technology.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Noise suppression of fluorescein angiogram sequences using bilateral filter

Noise suppression of fluorescein angiogram sequences using b...

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Guo, Xiao-Xin Lu, Yi-Nan Xu, Zhi-Wen Liu, Zhan-Hui Wang, Yun-Xiao Pang, Yun-Jie Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Qianjin Street 2699 Changchun 130012 China

ISBN: (纸本)078039092X

In this paper, a relatively flexible filter called extended bilateral filter is proposed, by which some particular filters can be designed via selecting an appropriate pixel of interest (POI) and defining a kernel for the filter according to some specified requirements. Based on the filter, a fluorescein-angiogram-oriented filter, high-intensity preserving (HIP) filter is introduced to solve the problems of high-intensity preservation when denoising. The results of the experiments show that the HIP filter has the ability of noise suppression, and the ability of high-intensity preservation, which can keep the intensities of bright pixels from degrading via distributing the weights adaptively according to the location and the intensity of each pixel. © 2005 IEEE.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

Automatic localization of macular area based on structure label transfer

引用

International Journal of Ophthalmology(English edition) 2018年第3期11卷 422-428页

作者： Xiao-Xin Guo Qun Li Chao Sun Yi-Nan LU Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun130012 Jilin Province China College of Computer Science and Technology Jilin University Changchun 130012 Jilin Province China

AIM： To explore feasibility and practicability of macula localization independent of macular morphological features. METHODS： A novel method was proposed to identify macula in fundus images by using structure label transfer. Its main idea was to match a processed image with the candidate images with known structures, and then transfer the structure label representing the macular to the processed image as a result of macula localization. In this way, macula localization couldn＇t be influenced by lesion or other interference any more. RESULTS： The average success rate in four datasets was 98.18%. For accuracy, the average error distance in four datasets was 0.151 optic disc diameter （ODD）. Even for severe lesion images, the proposed method can still maintain high success rate and high accuracy, e.g., 95.65% and 0.124 ODD in the case of STARE dataset, respectively, which indicated that the proposed method was highly robust and stable in the complicated situations. CONCLUSION： The proposed method can avoid the interference of lesion to macular morphological features in macula localization, and can locate macula with high accuracy and robustness, verifying its feasibility.

关键词： fundus image optic disc macula structurelabel transfer

来源：评论

学校读者我要写书评

暂无评论

An approach for calculating semantic similarity between words using WordNet

An approach for calculating semantic similarity between word...

引用

2011 2nd International Conference on Digital Manufacturing and Automation, ICDMA 2011

作者： Hao, Dou Zuo, Wanli Peng, Tao He, Fengling College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun China

ISBN: (纸本)9780769544557

This paper presents a new edge-counting based method using Word Net to compute the similarity. The method achieves a similarity that perfectly fits with human rating and effectively simulate the human tHought process that is people prefer to consider more differences when the semantic distance between two word is closer, and vice versa. At last, we weigh up our model against a benchmark set by human similarity judgment, and obtain a much improved result compared with other methods. © 2011 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：