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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

360 篇 会议
203 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

354 篇 工学
- 266 篇 计算机科学与技术...
- 227 篇 软件工程
- 73 篇 信息与通信工程
- 36 篇 生物工程
- 35 篇 控制科学与工程
- 34 篇 机械工程
- 27 篇 化学工程与技术
- 23 篇 光学工程
- 22 篇 电子科学与技术（可...
- 18 篇 电气工程
- 16 篇 生物医学工程（可授...
- 12 篇 仪器科学与技术
- 11 篇 农业工程
- 10 篇 建筑学
- 7 篇 材料科学与工程（可...
- 7 篇 动力工程及工程热...
184 篇 理学
- 109 篇 数学
- 48 篇 生物学
- 45 篇 物理学
- 31 篇 统计学（可授理学、...
- 20 篇 化学
- 10 篇 系统科学
128 篇 管理学
- 91 篇 图书情报与档案管...
- 40 篇 管理科学与工程(可...
- 15 篇 工商管理
15 篇 农学
- 12 篇 作物学
13 篇 医学
- 9 篇 临床医学
- 8 篇 基础医学(可授医学...
9 篇 法学
- 9 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
3 篇 艺术学
2 篇 教育学
2 篇 文学
1 篇 军事学

主题

37 篇 semantics
23 篇 training
21 篇 feature extracti...
15 篇 deep learning
15 篇 data models
14 篇 computational mo...
13 篇 computer vision
12 篇 visualization
11 篇 face recognition
11 篇 data mining
9 篇 object detection
9 篇 neural networks
9 篇 robustness
8 篇 forecasting
7 篇 support vector m...
7 篇 optimization
7 篇 navigation
7 篇 databases
7 篇 humans
7 篇 detectors

机构

101 篇 university of ch...
65 篇 key lab of intel...
51 篇 key lab of intel...
30 篇 key lab. of inte...
23 篇 school of comput...
20 篇 key laboratory o...
19 篇 key lab. of inte...
17 篇 key lab of intel...
16 篇 peng cheng labor...
15 篇 key lab. of inte...
14 篇 shanghai key lab...
14 篇 key lab. of inte...
13 篇 school of cyber ...
13 篇 shanghai collabo...
12 篇 institute of dig...
12 篇 school of cyber ...
11 篇 institute of com...
10 篇 graduate univers...
9 篇 key lab of intel...
9 篇 graduate school ...

作者

28 篇 huang qingming
28 篇 zhuge hai
24 篇 xilin chen
21 篇 cao juan
19 篇 gao wen
18 篇 liu qun
17 篇 shiguang shan
17 篇 xu qianqian
14 篇 qing he
14 篇 cao xiaochun
13 篇 yang zhiyong
13 篇 qingming huang
13 篇 sun xiaoping
12 篇 shuqiang jiang
12 篇 sheng qiang
11 篇 hai zhuge
11 篇 jiang yu-gang
11 篇 he qing
10 篇 jiang shuqiang
10 篇 chen xilin

语言

548 篇 英文
11 篇 其他
9 篇 中文

检索条件"机构=Key Lab of Scientific Computing and Intelligent Information Processing"

共 565 条记录，以下是511-520 订阅

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

详细简洁

排序：

Sgde-gep: A novel algorithm of gep

Sgde-gep: A novel algorithm of gep

引用

International Conference on Computer Science and Software Engineering, CSSE 2008

作者： Peng, Yu-Zhong Yuan, Chang-An Wang, Yan Qin, Xiao Key Lab of Scientific Computing Intelligent Information processing in Universities of Guangxi Guangxi Teachers Education University Nanning China

ISBN: (纸本)9780769533360

Traditional GEP algorithm takes up many system resources in decoding and evaluating due to the operation of the tree construction and corresponding traversing. This paper aims to introduce a novel GEP algorithm to alleviate the drawback mentioned above. The main contributions include:(1) presenting a new method for decoding and evaluating chromosome (SGDE), and proposing the corresponding ETs construction schema;(2) proving the relative natures of SGDE-GEP;(3)The experiments showed that the average efficiency of SGDE-GEP can be raised from 18.94% to 23.11% compared with the traditional GEP. © 2008 IEEE.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Automatically discovering semantic links among documents

Automatically discovering semantic links among documents

引用

4th International Conference on Semantics, Knowledge, and Grid, SKG 2008

作者： Hai, Zhuge Junsheng, Zhang Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science Beijing China

ISBN: (纸本)9780769534015

Knowing semantic links among documents is the basis for intelligent applications over large-scale document resources. Discovering these semantic links with little human interference is a challenge issue. This paper proposes an approach to automatically discover semantic links in document set based on a probabilistic documentary semantic link network model. The approach has the following advantages: 1) It supports probabilistic relational reasoning. 2) The semantic link networks and relevant rules automatically evolve. 3) It does not rely on any predefined ontology. 4) It can adapt to the update of the adopted techniques. Experiments on document sets of different types (scientific papers and Web pages) and different scales show the proposed approach feasible. The approach can be used to automatically construct semantic overlays on large document sets to support advanced applications like various relational queries on scientific documents. © 2008 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Focused crawling with heterogeneous semantic information

Focused crawling with heterogeneous semantic information

引用

2008 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2008

作者： Huang, Rui Lin, Fen Shi, Zhongzhi Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences 100190 Beijing China Graduate University Chinese Academy of Sciences 100049 Beijing China

ISBN: (纸本)9780769534961

Focused crawlers selectively retrieve Web documents that are relevant to a predefined set of topics. To intelligently make predictions and decisions about relevant URLs and web pages, different topic models have been introduced to represent topic-specific knowledge. Yet it is difficult to support semantic interoperability among different models. Moreover, some manually specified additional semantic information, such as semantic markups and social annotations, could not be effectively used to improve crawling. This paper proposes to boost focused crawling with four kinds of semantic models and semantic information, including thesauruses, categories, ontologies, and folksonomies. A statistical semantic association model is proposed to integrate different semantic models, represent heterogeneous semantic information, and support semantic relevance computation. A focused crawling framework is developed which adopts both keyword based contents and different kinds of additional information for relevance prediction and ranking. Experiments show that the proposed model and framework effectively integrates heterogeneous semantic information for focused crawling. © 2008 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Refinements in BTG-based Statistical Machine Translation 3

Refinements in BTG-based Statistical Machine Translation

引用

3rd International Joint Conference on Natural Language processing, IJCNLP 2008

作者： Xiong, Deyi Zhang, Min Aw, Aiti Mi, Haitao Liu, Qun Lin, Shouxun Human Language Technology Institute for Infocomm Research 21 Heng Mui Keng Terrace 119613 Singapore Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100080 China

Bracketing Transduction Grammar (BTG) has been well studied and used in statistical machine translation (SMT) with promising results. However, there are two major issues for BTG-based SMT. First, there is no effective mechanism available for predicting orders between neighboring blocks in the original BTG. Second, the computational cost is high. In this paper, we introduce two refinements for BTG-based SMT to achieve better reordering and higher-speed decoding, which include (1) reordering heuristics to prevent incorrect swapping and reduce search space, and (2) special phrases with tags to indicate sentence beginning and ending. The two refinements are integrated into a well-established BTG-based Chinese-to- English SMT system that is trained on largescale parallel data. Experimental results on the NIST MT-05 task show that the proposed refinements contribute significant improvement of 2% in BLEU score over the baseline system. © 2008 IJCNLP 2008 - 3rd International Joint Conference on Natural Language processing, Proceedings of the Conference. All rights reserved.

关键词： Computer aided language translation

来源：评论

学校读者我要写书评

暂无评论

Word lattice reranking for Chinese word segmentation and part-of-speech tagging

Word lattice reranking for Chinese word segmentation and par...

引用

22nd International Conference on Computational Linguistics, Coling 2008

作者： Jiang, Wenbin Mi, Haitao Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Graduate University of Chinese Academy of Sciences Beijing 100049 China

ISBN: (纸本)9781905593446

In this paper, we describe a new reranking strategy named word lattice reranking, for the task of joint Chinese word segmentation and part-of-speech (POS) tagging. As a derivation of the forest reranking for parsing (Huang, 2008), this strategy reranks on the pruned word lattice, which potentially contains much more candidates while using less storage, compared with the traditional n-best list reranking. With a perceptron classifier trained with local features as the baseline, word lattice reranking performs reranking with non-local features that can't be easily incorporated into the perceptron baseline. Experimental results show that, this strategy achieves improvement on both segmentation and POS tagging, above the perceptron baseline and the n-best list reranking. © 2008. Licensed to the Coling.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

SGDE-GEP: A Novel Algorithm of GEP

SGDE-GEP: A Novel Algorithm of GEP

引用

International Conference on Computer Science and Software Engineering

作者： Yu-zhong Peng Chang-an Yuan Yan Wang Xiao Qin Graduate Student of Key Lab of Scientific Computing &Intelligent Information processing in Universities of Guangxi Guangxi Teachers Education University Nanning China Information processing in Universities of Guangxi Guangxi Teachers Education University Nanning China

关键词： Educational institutions Biological cells Decoding scientific computing Competitive intelligence information processing Systems engineering education Genetic programming Tail Software algorithms

来源：评论

学校读者我要写书评

暂无评论

A cascaded linear model for joint Chinese word segmentation and part-of-speech tagging

A cascaded linear model for joint Chinese word segmentation ...

引用

46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT

作者： Jiang, Wenbin Huang, Liang Liu, Qun Lü, Yajuan Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Department of Computer and Information Science Levine Hall University of Pennsylvania 3330 Walnut Street Philadelphia PA 19104 United States

ISBN: (纸本)9781932432046

We propose a cascaded linear model for joint Chinese word segmentation and partof- speech tagging. With a character-based perceptron as the core, combined with realvalued features such as language models, the cascaded model is able to efficiently utilize knowledge sources that are inconvenient to incorporate into the perceptron directly. Experiments show that the cascaded model achieves improved accuracies on both segmentation only and joint segmentation and part-of-speech tagging. On the Penn Chinese Treebank 5.0, we obtain an error reduction of 18.5% on segmentation and 12% on joint segmentation and part-of-speech tagging over the perceptron-only baseline. © 2008 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Forest-based translation

Forest-based translation

引用

46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT

作者： Mi, Haitao Huang, Liang Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Department of Computer and Information Science Levine Hall University of Pennsylvania 3330 Walnut Street Philadelphia PA 19104 United States

ISBN: (纸本)9781932432046

Among syntax-based translation models, the tree-based approach, which takes as input a parse tree of the source sentence, is a promising direction being faster and simpler than its string-based counterpart. However, current tree-based systems suffer from a major drawback: they only use the 1-best parse to direct the translation, which potentially introduces translation mistakes due to parsing errors. We propose a forest-based approach that translates a packed forest of exponentially many parses, which encodes many more alternatives than standard n-best lists. Large-scale experiments show an absolute improvement of 1.7 BLEU points over the 1-best baseline. This result is also 0.8 points higher than decoding with 30-best parses, and takes even less time. © 2008 Association for Computational Linguistics.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Forest-based translation rule extraction

Forest-based translation rule extraction

引用

2008 Conference on Empirical Methods in Natural Language processing, EMNLP 2008, Co-located with AMTA 2008 and the International Workshop on Spoken Language Translation

作者： Mi, Haitao Huang, Liang Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Dept. of Computer and Information Science University of Pennsylvania Levine Hall 3330 Walnut St. Philadelphia PA 19104 United States

Translation rule extraction is a fundamental problem in machine translation, especially for linguistically syntax-based systems that need parse trees from either or both sides of the bitext. The current dominant practice only uses 1-best trees, which adversely affects the rule set quality due to parsing errors. So we propose a novel approach which extracts rules from a packed forest that compactly encodes exponentially many parses. Experiments show that this method improves translation quality by over 1 BLEU point on a state-of-the-art tree-to-string system, and is 0.5 points better than (and twice as fast as) extracting on 30- best parses. When combined with our previous work on forest-based decoding, it achieves a 2.5 BLEU points improvement over the baseline, and even outperforms the hierarchical system of Hiero by 0.7 points. © 2008 Association for Computational Linguistics.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

PKU at ImageCLEF 2008: Experiments with query extension techniques for text-based and content-based image retrieval

PKU at ImageCLEF 2008: Experiments with query extension tech...

引用

2008 Working Notes for CLEF Workshop, CLEF 2008 - Co-located with the 12th European Conference on Digital Libraries, ECDL 2008

作者： Zhou, Zhi Tian, Yonghong Li, Yuanning Liu, Ting Huang, Tiejun Gao, Wen Institute of Digital Media School of EE and CS Peking University Beijing100871 China Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science Beijing100190 China Graduate University Chinese Academy of Sciences Beijing100080 China

In this paper, we present our solutions for the WikipediaMM task at ImageCLEF 2008. The aim of this task is to investigate effective retrieval approaches in the context of a large-scale and heterogeneous collection of Wikipedia images that are searched by textual queries (and/or sample images and/or concepts) describing a user's information need. We first experimented with a text-based image retrieval approach with query extension, where the expansion terms are automatically selected from a knowledge base that is (semi-)automatically constructed from Wikipedia. We show how this open, constantly evolving encyclopedia can yield inexpensive knowledge structures that are specifically tailored to effectively enhance the semantics of queries. Encouragingly, the experimental results rank in the first place among all submitted runs. The second approach we experimented with is content-based image retrieval (CBIR), in which we first train 1-vs-all classifiers for all query concepts by using the training images obtained by Yahoo! search, and then treat the retrieval task as visual concept detection in the given Wikipedia image set. By comparison, this approach performs better than other submitted CBIR runs. Finally, we experimented with a cross-media image retrieval approach by combining and re-ranking text-based and content-based retrieval results. Despite the final experimental results were not formally submitted before the deadline, this approach performs remarkably better than the text-based retrieval or CBIR approaches.

关键词： Content based retrieval

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：