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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

117 篇 会议
23 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

102 篇 工学
- 82 篇 计算机科学与技术...
- 73 篇 软件工程
- 19 篇 信息与通信工程
- 12 篇 控制科学与工程
- 10 篇 农业工程
- 7 篇 光学工程
- 6 篇 机械工程
- 6 篇 生物工程
- 5 篇 仪器科学与技术
- 5 篇 电子科学与技术（可...
- 5 篇 化学工程与技术
- 4 篇 动力工程及工程热...
- 3 篇 生物医学工程（可授...
- 3 篇 网络空间安全
- 2 篇 安全科学与工程
- 1 篇 力学（可授工学、理...
52 篇 理学
- 41 篇 数学
- 10 篇 统计学（可授理学、...
- 9 篇 物理学
- 9 篇 生物学
- 4 篇 化学
- 2 篇 系统科学
41 篇 管理学
- 34 篇 图书情报与档案管...
- 10 篇 管理科学与工程(可...
- 3 篇 工商管理
12 篇 农学
- 10 篇 作物学
3 篇 法学
- 3 篇 社会学
3 篇 艺术学
- 3 篇 设计学（可授艺术学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学

主题

6 篇 semantics
4 篇 forestry
3 篇 international cr...
3 篇 support vector m...
3 篇 information tech...
3 篇 data mining
3 篇 websites
3 篇 decoding
3 篇 information and ...
3 篇 forecasting
2 篇 object detection
2 篇 trees (mathemati...
2 篇 knowledge manage...
2 篇 face recognition
2 篇 iterative method...
2 篇 optimization
2 篇 contrastive lear...
2 篇 mapreduce
2 篇 computational li...
2 篇 syntactics

机构

30 篇 key lab. of inte...
21 篇 school of comput...
19 篇 key lab. of inte...
14 篇 key lab. of inte...
13 篇 key lab. of inte...
12 篇 school of cyber ...
10 篇 peng cheng labor...
10 篇 school of cyber ...
8 篇 key laboratory o...
8 篇 alibaba group
7 篇 bdkm university ...
7 篇 graduate univers...
6 篇 institute of inf...
6 篇 institute of dig...
5 篇 university of ch...
5 篇 graduate univers...
4 篇 sklois institute...
4 篇 graduate school ...
4 篇 sklois institute...
4 篇 key lab of intel...

作者

18 篇 huang qingming
16 篇 liu qun
15 篇 xu qianqian
13 篇 yang zhiyong
12 篇 cao xiaochun
9 篇 wang zitai
9 篇 gao wen
9 篇 zhuge hai
7 篇 mi haitao
7 篇 qingming huang
7 篇 zhiyong yang
7 篇 qianqian xu
7 篇 huang liang
6 篇 xiaochun cao
6 篇 chen xilin
6 篇 xiong hao
6 篇 sun xiaoping
5 篇 jiang wenbin
5 篇 xing yunpeng
5 篇 bao shilong

语言

137 篇 英文
2 篇 其他
1 篇 中文

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

共 140 条记录，以下是41-50 订阅

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

详细简洁

排序：

Are school-of-thought words characterizable?

Are school-of-thought words characterizable?

引用

51st Annual Meeting of the Association for Computational Linguistics, ACL 2013

作者： Jiang, Xiaorui Sun, Xiaoping Zhuge, Hai Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Beijing China Nanjing University of Posts and Telecommunications Nanjing China Aston University Birmingham United Kingdom

ISBN: (纸本)9781937284510

School of thought analysis is an important yet not-well-elab.rated scientific knowledge discovery task. This paper makes the first attempt at this problem. We focus on one aspect of the problem: do characteristic school-of-thought words exist and whether they are characterizable? To answer these questions, we propose a probabilistic generative School-Of-Thought (SOT) model to simulate the scientific authoring process based on several assumptions. SOT defines a school of thought as a distribution of topics and assumes that authors determine the school of thought for each sentence before choosing words to deliver scientific ideas. SOT distinguishes between two types of school-of-thought words for either the general background of a school of thought or the original ideas each paper contributes to its school of thought. Narrative and quantitative experiments show positive and promising results to the questions raised above © 2013 Association for Computational Linguistics. © 2013 Association for Computational Linguistics.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

An improved correlation method based on rotation invariant feature for automatic particle selection

An improved correlation method based on rotation invariant f...

引用

10th International Symposium on Bioinformatics Research and Applications, ISBRA 2014

作者： Chen, Yu Ren, Fei Wan, Xiaohua Wang, Xuan Zhang, Fa Key Lab. of Intelligent Information Processing and Advanced Computing Research Lab Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing Beijing China Yanshan University Yanshan China

ISBN: (纸本)9783319081700

Particle selection from cryo-electron microscopy (cryo-EM) images is very important for high-resolution reconstruction of macromolecular structure. However, the accuracy of existing selection methods are normally restricted to noise and low contrast of cryo-EM images. In this paper, we presented an improved correlation method based on rotation invariant features for automatic, fast particle selection. We first selected a preliminary particle set applying rotation invariant features, then filtered the preliminary particle set using correlation to reduce the interference of high noise background and improve the precision of correlation method. We used Divide and Conquer technique and cascade strategy to improve the recognition ability of features and reduce processing time. Experimental results on the benchmark of cryo-EM images show that our method can improve the accuracy of particle selection significantly. © 2014 Springer International Publishing Switzerland.

关键词： Correlation methods

来源：评论

学校读者我要写书评

暂无评论

Forest-based semantic role lab.ling

Forest-based semantic role labeling

引用

作者： Xiong, Hao Mi, Haitao Liu, Yang Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China

ISBN: (纸本)9781577354659

Parsing plays an important role in semantic role lab.ling (SRL) because most SRL systems infer semantic relations from I-best parses. Therefore, parsing errors inevitably lead to lab.ling mistakes. To alleviate this problem, we propose to use packed forest, which compactly encodes all parses for a sentence. We design an algorithm to exploit exponentially many parses to learn semantic relations efficiently. Experimental results on the CoNLL-2005 shared task show that using forests achieves an absolute improvement of 1.2% in terms of Fi score over using 1-best parses and 0.6% over using 50-best parses. Copyright © 2010, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Skin color weighted disparity competition for hand segmentation from stereo camera

Skin color weighted disparity competition for hand segmentat...

引用

2010 21st British Machine Vision Conference, BMVC 2010

作者： Wang, Qi Chen, Xilin Gao, Wen Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute of Digital Media School of EE and CS Peking University Beijing China

ISBN: (纸本)1901725405

Hand segmentation is the basis of many vision-based hand gesture applications in human computer interaction (HCI). This paper proposes a novel method of skin color weighted disparity competition to incorporate the skin color and depth cues for hand segmentation in clutter environment from stereo camera. The basic idea is that the hand disparity will be apparently different from most of the background disparities. Note that we refer to the scene except the user as the background. The proposed method validates a hand pixel by verifying whether the pixel satisfies the disparity limit of the hand more than of the background. Its novelty lies in incorporating the skin color probability to weight the disparity competition to improve the robustness of validation and the accuracy of boundary location. Experiments demonstrate the efficiency of the proposed method. © 2010. The copyright of this document resides with its authors.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient network routing with discrete cost functions

Energy-efficient network routing with discrete cost function...

引用

9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012

作者： Wang, Lin Fernández Anta, Antonio Zhang, Fa Hou, Chenying Liu, Zhiyong Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Institute IMDEA Networks Spain China State Key Lab. for Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China

ISBN: (纸本)9783642299513

Energy consumption is an important issue in the design and use of networks. In this paper, we explore energy savings in networks via a rate adaptation model. This model can be represented by a cost-minimization network routing problem with discrete cost functions. We formulate this problem as an integer program, which is proved to be NP-hard. Then a constant approximation algorithm is developed. In our proposed method, we first transform the program into a continuous-cost network routing problem, and then we approximate the optimal solution by a two-step rounding process. We show by analysis that, for uniform demands, our method provides a constant approximation for the uniform network routing problem with discrete costs. A bicriteria network routing problem is also developed so that a trade-off can be made between energy consumption and network delay. Analytical results for this latter model are also presented. © 2012 Springer-Verlag.

关键词： Network routing

来源：评论

学校读者我要写书评

暂无评论

From use case model to service model: An environment ontology based approach

From use case model to service model: An environment ontolog...

引用

International Conference on Grid and Cloud computing

作者： Zhao, Bin Cai, Guangjun Jin, Zhi Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Graduate University of the Chinese Academy of Sciences Beijing China Software Engineering Institute Peking University Beijing China

ISBN: (纸本)9780769543130

One fundamental problem in services computing is how to bridge the gap between business requirements and various heterogeneous IT services. This involves eliciting business requirements and building a solution accordingly by reusing availab.e services. While the business requirements are commonly elicited through use cases and scenarios, it is not straightforward to transform the use case model into a service model, and the existing manual approach is cumbersome and error-prone. In this paper, the environment ontology, which is used to model the problem space, is utilized to facilitate the model transformation process. The environment ontology provides a common understanding between business analysts and software engineers. The required software functionalities as well as the availab.e services' capabilities are described using this ontology. By semi-automatically matching the required capability of each use case to the availab.e capabilities provides by services, a use case is realized by that set of services. At the end of this paper, a fictitious case study was used to illustrate how this approach works. © 2010 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A compression algorithm for multi-streams based on GEP

A compression algorithm for multi-streams based on GEP

引用

3rd International Conference on Genetic and Evolutionary computing, WGEC 2009

作者： Ding, Chao Yuan, Chang-An Qin, Xiao Peng, Yu-Zhong Computer and Information Engineering College Guangxi Teachers Education University Nanning 530001 China First Middle School of Mengcheng Anhui Mengcheng233500 China Key Lab. of Scientific Computing and Intelligent Information Processing in Universities of Guangxi Guangxi Teachers Education University Nanning China

ISBN: (纸本)9780769538990

This paper applied the Methods which based on GEP in compress multi-streams. The contributions of this paper include: 1) giving an introduction to data function finding based on GEP(DFF-GEP), defining the main conception of Multi-Streams, and revealing the map relation in it;2) putting forward the Compression Algorithm for Multi-Streams according to map relation lied in data between data streams;and 3)providing an experience with the real data and find that (3.1) the compression ratio of the new methods is 120-150 times as the traditional wavelets method, and 35-70 times as the wavelets and coincidence method;(3.2) the relative error of the new method is about 3??,yet maximum relative error is 0.01 by using the traditional relative error standard, the precision is improved from 7% to 15% as compared with the traditional method. © 2009 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Classification Between Rumors and Explanations of Rumors Based on Common and Difference Subsequences of Sentences 12th

Classification Between Rumors and Explanations of Rumors Bas...

引用

12th IFIP TC 12 International Conference on intelligent information processing, IIP 2022

作者： Sun, Xiaoping Zhang, Junsheng Sang, Yufei Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute of Scientific and Technical Information of China Beijing China School of Economics Capital University of Economics and Business Beijing China

ISBN: (纸本)9783031039478

Preventing explosion of rumors on the Internet asks for a quick automatic detection mechanism that can detect rumors according to the given true information. Previous automatic rumors detection models are mainly built by training a supervised classification model on a lab.led dataset containing rumor samples and true information samples. However, in many real cases, there is only one short piece of availab.e true information sample given by an authority in form of an explanation or a correction of a rumor. The explanation sample is often short and very similar to rumor samples, making it difficult to train a discriminative classifier to check whether a piece of information is a rumor or an explanation of rumors. It is necessary to build a model to detect whether a short text is a rumor text or an explanation of rumors, which can be used to as evidences for detecting and refuting rumors. In this paper, we presented a sentence preprocessing method that extracts the leftmost longest common sequence to obtain the common and difference subsequences between the rumor text and its explanation text to compose samples and train a supervised model for classification between rumors and explanation of rumors. Experiments show the effectiveness of the proposed method. © 2022, IFIP International Federation for information processing.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Counter designs in quantum-dot cellular automata

Counter designs in quantum-dot cellular automata

引用

2010 10th IEEE Conference on Nanotechnology, NANO 2010

作者： Kong, Kun Shang, Yun Lu, Ruqian Institute of Mathematics Academy of Mathematics and Systems Science CAS Beijing 100190 China Shanghai Key Lab. of Intelligent Information Processing Fudan University Shanghai 200433 China CAS Key Lab. of IIP Institute of Computing Technology CAS Beijing 100190 China

ISBN: (纸本)9781424470334

In this paper, we present a new method for the design of an n-bit synchronous binary up counter in quantum-dot cellular automata (QCA). This method is based on the JK flip-flop which almost always produces the simplest combinational logic in traditional sequential circuits. We implement a new QCA architecture for the JK flip-flop. Compared to the existing QCA JK flip-flop, the majority gate count, cell count, clock cycle count, and area of our QCA JK flip-flop are reduced by 57.1%, 88.1%, 55.6%, and 92.0%, respectively. Based on our QCA JK flip-flop, a method of extending state cells is proposed to design the QCA layout of the n-bit counter, such that all the clock cycle counts between any two state cells become 1. This feature can ensure that one count just takes one clock cycle, in existing methods, however, one count needs to take n-1 clock cycles. Comparisons indicate that, by applying our method, the hardware requirements (i.e., complexity and area) for QCA n-bit counter can be greatly reduced. ©2010 IEEE.

关键词： Design

来源：评论

学校读者我要写书评

暂无评论

Sub-sentence division for tree-based machine translation

Sub-sentence division for tree-based machine translation

引用

Joint Conference of the 47th Annual Meeting of the Association for Computational Linguistics and 4th International Joint Conference on Natural Language processing of the AFNLP, ACL-IJCNLP 2009

作者： Xiong, Hao Xu, Wenwen Mi, Haitao Liu, Yang Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Key Lab. of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China

ISBN: (纸本)9781617382581

Tree-based statistical machine translation models have made significant progress in recent years, especially when replacing 1-best trees with packed forests. However, as the parsing accuracy usually goes down dramatically with the increase of sentence length, translating long sentences often takes long time and only produces degenerate translations. We propose a new method named subsentence division that reduces the decoding time and improves the translation quality for tree-based translation. Our approach divides long sentences into several sub-sentences by exploiting tree structures. Large-scale experiments on the NIST 2008 Chinese-to-English test set show that our approach achieves an absolute improvement of 1.1 BLEU points over the baseline system in 50% less time. © 2009 ACL and AFNLP.

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：