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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

589 篇 会议
538 篇 期刊文献

馆藏范围

1,127 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

782 篇 工学
- 614 篇 计算机科学与技术...
- 532 篇 软件工程
- 153 篇 信息与通信工程
- 96 篇 控制科学与工程
- 77 篇 生物工程
- 68 篇 生物医学工程（可授...
- 58 篇 机械工程
- 55 篇 电子科学与技术（可...
- 51 篇 化学工程与技术
- 45 篇 光学工程
- 45 篇 电气工程
- 26 篇 仪器科学与技术
- 22 篇 交通运输工程
- 22 篇 航空宇航科学与技...
- 19 篇 土木工程
- 14 篇 建筑学
- 13 篇 动力工程及工程热...
426 篇 理学
- 300 篇 数学
- 94 篇 生物学
- 73 篇 统计学（可授理学、...
- 58 篇 物理学
- 52 篇 化学
- 30 篇 系统科学
258 篇 管理学
- 138 篇 管理科学与工程(可...
- 123 篇 图书情报与档案管...
- 40 篇 工商管理
44 篇 医学
- 36 篇 临床医学
- 28 篇 基础医学(可授医学...
- 24 篇 药学(可授医学、理...
19 篇 农学
17 篇 法学
- 15 篇 社会学
7 篇 经济学
6 篇 教育学
4 篇 艺术学
3 篇 文学
2 篇 军事学

主题

64 篇 computer science
57 篇 educational inst...
50 篇 knowledge engine...
50 篇 laboratories
50 篇 educational tech...
39 篇 data mining
27 篇 computer science...
24 篇 ontology
22 篇 feature extracti...
21 篇 image segmentati...
21 篇 semantics
16 篇 deep learning
16 篇 genetic algorith...
15 篇 reinforcement le...
14 篇 ontologies
14 篇 contrastive lear...
14 篇 topology
13 篇 clustering algor...
11 篇 support vector m...
11 篇 recommender syst...

机构

489 篇 college of compu...
286 篇 key laboratory o...
84 篇 key laboratory o...
45 篇 college of softw...
44 篇 key laboratory o...
36 篇 key laboratory o...
31 篇 college of compu...
31 篇 school of artifi...
22 篇 jilin university...
20 篇 jilin university...
19 篇 key laboratory o...
19 篇 key laboratory o...
19 篇 key laboratory o...
18 篇 school of comput...
16 篇 jilin university...
15 篇 key laboratory o...
15 篇 department of co...
15 篇 key laboratory o...
14 篇 key laboratory o...
14 篇 college of compu...

作者

46 篇 yang bo
35 篇 liang yanchun
34 篇 sun geng
31 篇 ouyang dantong
29 篇 li ximing
29 篇 li xiongfei
28 篇 dantong ouyang
26 篇 bo yang
25 篇 ouyang jihong
24 篇 niyato dusit
24 篇 yanchun liang
22 篇 liu dayou
22 篇 yanheng liu
22 篇 liu yanheng
21 篇 guan renchu
21 篇 chen haipeng
21 篇 huang lan
21 篇 li jiahui
20 篇 da-you liu
19 篇 zuo wanli

语言

954 篇 英文
153 篇 其他
21 篇 中文

检索条件"机构=Key Laboratory for Symbolic Computation and Knowledge Engineering of the Ministry of Education"

共 1127 条记录，以下是1051-1060 订阅

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

详细简洁

排序：

A New Position Updating Algorithm for Moving Objects

A New Position Updating Algorithm for Moving Objects

引用

International Multi-Symposiums on Computer and computational Sciences (IMSCCS)

作者： Xinying Wang Shengsheng Wang Zhengxuan Wang Tianyang Lv Xizhe Zhang College of Computer Science and Technology Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Continuous queries are important in moving objects databases and spatio-temporal reasoning. The traditional synchronous updating algorithms of moving object pervasively focus on improving queries' execution efficiency, while ignore the fact that the communication cost is also the bottleneck for improving query efficiency. We propose an asynchronous updating algorithm for continuous queries of moving objects. Three types of continuous range queries are discussed in the paper. Theoretical analysis and experiment results show that our algorithm substantially outperforms the traditional synchronous updating algorithms at aspects of monitoring accuracy, communication cost and CPU load balance

关键词： Costs Geographic Information Systems Spatiotemporal phenomena Vehicles Spatial databases Artificial intelligence Memory management Telecommunication computing Hardware educational institutions

来源：评论

学校读者我要写书评

暂无评论

Identification of Transcription Factor Binding Sites Using GA and PSO

Identification of Transcription Factor Binding Sites Using G...

引用

International Conference on Intelligent Systems Design and Applications (ISDA)

作者： Xiao-yu Chang Chun-guang Zhou Yan-wen Li Ping Hu College of Computer Science Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University China College of Computer Science Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education department of computer science Northeast Normal University Changchun China

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

关键词： Evolutionary computation Pulse width modulation Genomics Bioinformatics Genetic algorithms Particle swarm optimization Biology computing Evolution (biology) educational institutions Computer science

来源：评论

学校读者我要写书评

暂无评论

ASYNCHRONOUS UPDATING ALGORITHM FOR CONTINUOUS MOVING OBJECTS QUERIES

ASYNCHRONOUS UPDATING ALGORITHM FOR CONTINUOUS MOVING OBJECT...

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： XIN-YING WANG SHENG-SHENG WANG ZHENG-XUAN WANG College of computer science and technology Key laboratory of symbolic computing and knowledge engineering of ministry of education Jilin University Changchun 130012China

Continuous queries for moving objects are becoming more and more important due to the increasing number of application domains that deal with moving entities. The asynchronous updating algorithm for continuous queries of moving objects is superior to synchronous updating algorithms in communication cost. By improving Haibo Hu's rectangle safe region strategy we proposed a new continuous queries algorithm. Circle safe region and dynamic interval are adopted in our algorithm. Theory proof and experiment results show that our algorithm substantially outperforms the traditional periodic monitoring and the rectangle safe region algorithms in terms of monitoring accuracy, communication cost and CPU time. Furthermore, the mobile terminals need not have any computation ability in our algorithm.

关键词： Moving objects database continuous spatial query spatio-temporal reasoning

来源：评论

学校读者我要写书评

暂无评论

Improved Algorithm for Continuous Moving Objects Queries

Improved Algorithm for Continuous Moving Objects Queries

引用

Firth IEEE International Conference on Cognitive Informatics(第五届认知信息国际会议)

作者： Shengsheng Wang Xinying Wang Da-you Liu Qiangyuan Yu College of computer science and technology Key laboratory of symbolic computing and knowledge engineering of ministry of education Jilin University Changchun 130012China

ISBN: (纸本)1424404754

Moving objects databases are becoming more and more popular due to the increasing number of application domains that deal with moving entities. Continuous queries are important in moving objects databases. We summarize three types of continuous queries, but only two of them have been studied before. We proposed new algorithms to process the other two types of queries. Experiment results all show that our algorithms is excellent in monitoring accuracy, communication cost and CPU load balance.

关键词： Moving Database algorithms

来源：评论

学校读者我要写书评

暂无评论

Mutual conversion of regression and classification based on least squares support vector machines

Mutual conversion of regression and classification based on ...

引用

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

作者： Jiang, Jing-Qing Song, Chu-Yi Wu, Chun-Guo Liang, Yang-Chun Yang, Xiao-Wei Hao, Zhi-Feng Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China College of Mathematics and Computer Science Inner Mongolia University for Nationalities Tongliao 028043 China Key Laboratory of Information Science and Engineering Beijing Jiaotong University Railway Ministry Beijing 100044 China School of Mathematical Science South China University of Technology Guangzhou 510640 China

ISBN: (纸本)354034439X

Classification and regression are most interesting problems in the fields of pattern recognition. The regression problem can be changed into binary classification problem and least squares support vector machine can be used to solve the classification problem. The optimal hyperplane is the regression function. In this paper, a one-step method is presented to deal with the multi-category problem. The proposed method converts the problem of classification into the function regression problem and is applied to solve the converted problem by least squares support vector machines. The novel method classifies the samples in all categories simultaneously only by solving a set of linear equations. Demonstrations of numerical experiments are performed and good performances are obtained. Simulation results show that the regression and classification can be converted each other based on least squares support vector machines. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Combining Greedy Method and Genetic Algorithm to Identify Transcription Factor Binding Sites

Combining Greedy Method and Genetic Algorithm to Identify Tr...

引用

International Conference on Hybrid Intelligent Systems (HIS)

作者： Wanyu Wang Xiaoyu Chang Chunguang Zhou College of Computer Science Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prediction of Transcription Factor Binding Sites Using Genetic Algorithm

Prediction of Transcription Factor Binding Sites Using Genet...

引用

IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Xiaoyu Chang Wengang Zhou Chunguang Zhou Yanchun Liang College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China

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 new approach to predict TFBS. This approach uses position weight matrix (PWM) to represent binding sites and uses genetic algorithm (GA) to search the best matrix. A new coding method so called multiple-variable coding is proposed in GA. We apply it on two transcription factors rebl and mgl. The result shows that this approach can find most of the known sites, which indicates that this method is very effective

关键词： Genetic algorithms Pulse width modulation Sequences Genomics Bioinformatics Hidden Markov models Proteins Computer science educational technology knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

ADVANCES IN MULTI-AGENT COORDINATION

ADVANCES IN MULTI-AGENT COORDINATION

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： LI JIANG DA-YOU LIU College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Dnowledge Engineering of Ministry of Education Jilin Univ

Coordination is essential for five reasons: preventing anarchy or chaos;efficiency;meeting global constraints;distributed information, expertise or resources;and dependencies between the agents' actions. Coordination is also an important method for cooperation. Due to this significance,coordination have been paid great attention in recent years, from coordination models, mechanisms, methods, etc. to resource management. In this paper, we will survey these advances and give our view of future research direction.

关键词： Multi-agent coordination coordination mechanisms coordination methodologies coordination models resource management

来源：评论

学校读者我要写书评

暂无评论

Intelligent Sub-Object Image Retrieval System

Intelligent Sub-Object Image Retrieval System

引用

World Congress on Intelligent Control and Automation (WCICA)

作者： Wenhui Li Dongfeng Han Yi Wang Xiaosuo Lu Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science&Technology Jilin University Changchun Jilin China

This paper describes a sub-object retrieval system based on a segmentation method. We also use dynamic partial function (DPF) and indexing by locality sensitive hashing (LSH) for improving system performance. Such a system is useful for finding a sub-object from a large image database. In order to obtain the sub-object from a sample image, we use a segmentation method to cut out the object. The system utilizes the segmentation results to capture the higher-level concept of images and gets a stable and accurate result. Experimental and comparison results, which are performed using a general purpose database containing 20,000 images, are encouraging

关键词： Image retrieval Image segmentation Image databases Vehicle dynamics Indexing Information retrieval Content based retrieval Spatial databases Humans Laboratories

来源：评论

学校读者我要写书评

暂无评论

Fuzzy kernel clustering based on particle swarm optimization

Fuzzy kernel clustering based on particle swarm optimization

引用

IEEE International Conference on Granular Computing (GRC)

作者： Libiao Zhang Chunguang Zhou Ming Ma Xiaohua Liu Chunxia Li Caitang Sun Miao Liu College of Computer Science and Technology Key Laboratory for Symbol Computation and Knowledge Engineering of the National Education Ministry of China Jilin University Changchun China

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共113页 << < 102 103 104 105 106 107 108 109 110 111 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：