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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

144 篇 会议
83 篇 期刊文献

馆藏范围

227 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

158 篇 工学
- 117 篇 计算机科学与技术...
- 105 篇 软件工程
- 23 篇 生物医学工程（可授...
- 21 篇 信息与通信工程
- 17 篇 生物工程
- 15 篇 控制科学与工程
- 13 篇 化学工程与技术
- 10 篇 机械工程
- 10 篇 光学工程
- 10 篇 电子科学与技术（可...
- 6 篇 电气工程
- 5 篇 仪器科学与技术
- 5 篇 建筑学
- 4 篇 土木工程
- 4 篇 交通运输工程
- 3 篇 农业工程
106 篇 理学
- 72 篇 数学
- 26 篇 生物学
- 19 篇 统计学（可授理学、...
- 17 篇 物理学
- 14 篇 化学
- 4 篇 系统科学
49 篇 管理学
- 26 篇 管理科学与工程(可...
- 26 篇 图书情报与档案管...
- 8 篇 工商管理
11 篇 医学
- 11 篇 临床医学
- 9 篇 基础医学(可授医学...
- 8 篇 药学(可授医学、理...
9 篇 农学
- 6 篇 作物学
4 篇 法学
- 4 篇 社会学
2 篇 经济学
1 篇 教育学
1 篇 军事学

主题

16 篇 data mining
15 篇 computer science
14 篇 educational inst...
11 篇 knowledge engine...
9 篇 image segmentati...
9 篇 laboratories
9 篇 educational tech...
8 篇 ontology
7 篇 semantics
7 篇 genetic algorith...
6 篇 support vector m...
6 篇 feature extracti...
6 篇 clustering algor...
5 篇 deep learning
5 篇 ant colony optim...
5 篇 hidden markov mo...
4 篇 cancer
4 篇 deep neural netw...
4 篇 neural networks
4 篇 image retrieval

机构

59 篇 college of compu...
19 篇 key laboratory o...
15 篇 key laboratory o...
13 篇 key laboratory o...
13 篇 key laboratory o...
12 篇 key laboratory o...
11 篇 key laboratory o...
10 篇 college of softw...
10 篇 department of co...
9 篇 key laboratory o...
9 篇 key laboratory f...
9 篇 college of compu...
8 篇 key laboratory o...
7 篇 school of artifi...
6 篇 college of compu...
6 篇 college of compu...
5 篇 institute of hig...
5 篇 key laboratory o...
4 篇 zhuhai laborator...
4 篇 department of in...

作者

25 篇 liang yanchun
20 篇 yanchun liang
11 篇 li xiongfei
9 篇 zuo wanli
9 篇 wu chunguo
9 篇 yan wang
8 篇 han xiaosong
8 篇 wang yan
8 篇 wanli zuo
8 篇 chunguang zhou
7 篇 liang yan-chun
6 篇 wei du
6 篇 jindong zhang
6 篇 xiaosong han
6 篇 yan-chun liang
6 篇 song haiyu
6 篇 renchu guan
6 篇 zhang yonggang
6 篇 wang pengjie
5 篇 xuchu dong

语言

221 篇 英文
4 篇 中文
2 篇 其他

检索条件"机构=Key Laboratory of Symbol Computation and KnowledgeEngineering of Ministry of Education"

共 227 条记录，以下是181-190 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Graph-based fast image segmentation

Graph-based fast image segmentation

引用

Joint IAPR International Workshops on Structural, Syntactic, and Statistical Pattern Recognition, SSPR 2006 and SPR 2006

作者： Han, Dongfeng Li, Wenhui Lu, Xiaosuo Li, N. Wang, Yi Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)3540372369

In this paper, we describe a fast semi-automatic segmentation algorithm. A nodes aggregation method is proposed for improving the running time and a Graph-Cuts method is used to model the segmentation problem. The whole process is interactive. Once the users specify the interest regions by drawing a few lines, the segmentation process is reliably computed automatically no additional users' efforts are required. It is convenient and efficient in practical applications. Experiments are given and outputs are encouraging. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A novel method for mining sequential patterns in datasets

A novel method for mining sequential patterns in datasets

引用

ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications

作者： Xiaoyu, Chang Chunguang, Zhou Zhe, Wang Ping, Hu Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun 130012 China

ISBN: (纸本)0769525288

Sequential pattern mining is one of the most important fields in data mining. In this paper, we propose a novel algorithm FSPAN (Fast Sequential Pattern mining algorithm) to do the sequence mining. FSPAN can mine all the frequent sequential patterns in large datasets and it integrates a depth-first traversal approach with an effective pruning mechanism. This pruning mechanism solves the problem of searching frequent sequences in a sequence database by searching frequent items or frequent itemsets, which makes this method very efficient. Moreover, the databases scanned via FSPAN keep shrinking quickly, which makes the algorithm more efficient when the sequential patterns are longer. Experiments on standard test data show that FSPAN is very effective. © 2006 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Combining greedy method and genetic algorithm to identify transcription factor binding sites

Combining greedy method and genetic algorithm to identify tr...

引用

6th International Conference on Hybrid Intelligent Systems and 4th Conference on Neuro-Computing and Evolving Intelligence, HIS-NCEI 2006

作者： Wanyu, Wang Xiaoyu, Chang Chunguang, Zhou Key Laboratory of Symbol Computation and Knowledge Engineering Juin University Ministry of Education Changchun 130012 China

ISBN: (纸本)0769526624

Identification of Transcription Factor Binding Sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a novel approach to identify transcription factor binding sites. This approach combines greedy method and genetic algorithm (CGGA) to search conserved segment in the given sequence set. A new greedy method which can efficiently search a local optimal result is proposed. In order to solve the high complexity of this algorithm, we also give an effective improvement for this method. Then, we describe how to combine genetic algorithm with this greedy method to find the more optimal results. Greedy method is combined to the fitness function of the genetic algorithm. We apply this approach on two different TFBS sets and the results show that it can find correct result both effective and efficient, and for CRP binding sites, it get a more accurate result than Gibbs Sampler, AlignACE and MDGA. © 2006 IEEE.

关键词： Transcription factors

来源：评论

学校读者我要写书评

暂无评论

An adaptive stochastic collision detection between deformable objects using particle swarm optimization

An adaptive stochastic collision detection between deformabl...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Modeling and refining directional relations based on fuzzy mathematical morphology

Modeling and refining directional relations based on fuzzy m...

引用

High-Power Diode Laser Technology and Applications IV

作者： Sun, Haibin Li, Wenhui Key Laboratory of Symbol Computation Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 China

ISBN: (纸本)0819461466

In this paper, we investigate the deficiency of Goyal and Egenhofer's method for modeling cardinal directional relations between simple regions and provide the computational model based on the concept of mathematical morphology, which can be a complement and refinement of Goyal and Egenhofer's model for crisp regions. Based on fuzzy set theory, we extend Goyal and Egenhofer's model to handle fuzziness and provide a computational model based on alpha-morphology, which combines fuzzy set theory and mathematical morphology, to refine the fuzzy cardinal directional relations. Then the computational problems are investigated. We also give an example of spatial configuration in 2-dimensional discrete space. The experiment results confirm the cognitive plausibility of our computational models. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

Identification of transcription factor binding sites using GA and PSO

Identification of transcription factor binding sites using G...

引用

6th International Conference on Intelligent Systems Design and Applications (ISDA 2006)

作者： Chang, Xiao-Yu Zhou, Chun-Guang Li, Yan-Wen Hu, Ping Key Laboratory of Symbol Computation and J Knowledge Engineering Jilin University Ministry of Education China Department of Computer Science Northeast Normal University Changchun 130012 China

ISBN: (纸本)0769525288

Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve this challenging issue. Under this framework, we use two prevalent evolutionary algorithms: Genetic, Algorithm (GA) and Particle Swarm Optimization (PSO) to find unknown sites in a collection of relatively long intergenic sequences that are suspected of being bound by the same factor. This paper represents binding sites motif to position weight matrix (PWM) and introduces how to code PWM to genome for GA and how to code it to particle for PSO. We apply these two algorithms to 5 different yeast Saccharomyces Cerevisiae transcription factor binding sites and CRP binding sites. The results on Saccharomyces Cerevisiae show that it can find the correct binding sites motifs, and the result on CRP shows that these two algorithms can achieve more accuracy than MEME and Gibbs Sampler.

关键词： Binding sites

来源：评论

学校读者我要写书评

暂无评论

An efficient method for very large scale out-of-core terrain visualization

An efficient method for very large scale out-of-core terrain...

引用

16th International Conference on Artificial Reality and Telexistence - Workshops, ICAT 2006

作者： Zhang, Huijie Sun, Jigui Yu, Haihong Qi, Changsong College of Computer Science and Technology Jilin University College of Computer Science Northeast Normal University Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education

ISBN: (纸本)076952754X

Large scale terrain visualization with high-resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method based on multi-resolution storage techniques. In external memory, the terrain data set is subdivided from top to bottom to build a multi-resolution hierarchical structure based on a quad-tree. The hierarchical structure can decimate the elevation data that must be loaded into internal memory. Thus it can improve the efficiency of I/O access greatly. Moreover, in order to implement rapid data retrieval of the real time terrain flyover, an efficient indexing algorithm is proposed, in which those nodes in the hierarchical structure will be divided into several clusters in terms of the similarities of static error and the closed space constraint. In addition, a method for crack-free is also proposed here. The comprehensive experiment conducted on the GTOP30 data set shows that this approach outperforms the Block and the Hierarchy algorithms in the both ways of efficiency and simplification ratio. © 2006 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Adaptive support vector clustering for multi-relational data mining

Adaptive support vector clustering for multi-relational data...

引用

3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks

作者： Ling, Ping Zhou, Chun-Guang Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China School of Computer Science Xuzhou Normal University Xuzhou 221116 China

ISBN: (纸本)354034439X

A novel self Adaptive Support Vector Clustering algorithm (ASVC) is proposed in this paper to cluster dataset with diverse dispersions. And a Kernel function is defined to measure affinity between multi-relational data. Task of clustering multi-relational data is addressed by integrating the designed Kernel into ASVC. Experimental results indicate that the designed Kernel can capture structured features well and ASVC is of fine performance. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A spectrum-based support vector algorithm for relational data semi-supervised classification

引用

13th International Conference on Neural Information Processing, ICONIP 2006

作者： Ping, Ling Zhe, Wang Chunguang, Zhou Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China School of Computer Science Xuzhou Normal University Xuzhou 221116 China

ISBN: (纸本)3540464794

A Spectrum-based Support Vector Algorithm (SSVA) to resolve semi-supervised classification for relational data is presented in this paper. SSVA extracts data representatives and groups them with spectral analysis. Label assignment is done according to affinities between data and data representatives. The Kernel function encoded in SSVA is defined to rear to relational version and parameterized by supervisory information. Another point is the selftuning of penalty coefficient and Kernel scale parameter to eliminate the need of searching parameter spaces. Experiments on real datasets demonstrate the performance and efficiency of SSVA. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Fuzzy neural network optimization by a particle swarm optimization algorithm

Fuzzy neural network optimization by a particle swarm optimi...

引用

3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks

作者： Ma, Ming Zhang, Li-Biao Ma, Jie Zhou, Chun-Guang Key Laboratory for Symbol Computation and Knowledge Engineering Jilin University National Education Ministry of China Changchun 130012 China Information Manage Center Beihua University Jilin 132013 China

ISBN: (纸本)354034439X

Designing a set of fuzzy neural networks can be considered as solving a multi-objective optimization problem. An algorithm for solving the multi-objective optimization problem is presented based on particle swarm optimization through the improvement of the selection manner for global and individual extremum. The search for the Pareto Optimal Set of fuzzy neural networks optimization problems is performed, Numerical simulations for taste identification of tea show the effectiveness of the proposed algorithm. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共23页 << < 14 15 16 17 18 19 20 21 22 23 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：