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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

284 篇 会议
114 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

300 篇 工学
- 260 篇 计算机科学与技术...
- 223 篇 软件工程
- 53 篇 信息与通信工程
- 49 篇 控制科学与工程
- 20 篇 电子科学与技术（可...
- 16 篇 机械工程
- 14 篇 生物工程
- 13 篇 材料科学与工程（可...
- 12 篇 电气工程
- 10 篇 仪器科学与技术
- 9 篇 安全科学与工程
- 8 篇 动力工程及工程热...
- 8 篇 化学工程与技术
- 8 篇 生物医学工程（可授...
- 7 篇 光学工程
- 7 篇 建筑学
- 5 篇 交通运输工程
- 5 篇 农业工程
177 篇 理学
- 145 篇 数学
- 36 篇 统计学（可授理学、...
- 26 篇 系统科学
- 21 篇 物理学
- 14 篇 生物学
- 7 篇 化学
86 篇 管理学
- 48 篇 管理科学与工程(可...
- 42 篇 图书情报与档案管...
- 24 篇 工商管理
13 篇 法学
- 11 篇 社会学
12 篇 经济学
- 12 篇 应用经济学
6 篇 医学
- 6 篇 临床医学
5 篇 艺术学
4 篇 农学
2 篇 教育学

主题

15 篇 semantics
8 篇 computer science
7 篇 conferences
7 篇 ordinary differe...
7 篇 computational mo...
7 篇 software quality
6 篇 forecasting
5 篇 image classifica...
5 篇 cloud computing
5 篇 random processes
5 篇 web services
4 篇 collaborative fi...
4 篇 hybrid systems
4 篇 programming
4 篇 ant colony optim...
4 篇 image segmentati...
4 篇 graphics process...
4 篇 educational inst...
4 篇 optimization
4 篇 data mining

机构

69 篇 state key lab. f...
39 篇 state key lab. o...
28 篇 state key lab. o...
24 篇 state key lab. o...
24 篇 university of ch...
22 篇 state key lab. o...
14 篇 graduate univers...
13 篇 department of co...
12 篇 state key lab. f...
9 篇 nanjing universi...
8 篇 state key lab of...
8 篇 state key labora...
8 篇 school of comput...
8 篇 school of comput...
7 篇 state key lab. o...
7 篇 graduate univers...
6 篇 international sc...
5 篇 department of co...
5 篇 key lab. of inte...
5 篇 intelligence eng...

作者

21 篇 zhan naijun
18 篇 xue bai
13 篇 huang qingming
12 篇 liu jin
11 篇 zhan bohua
10 篇 jiang shuqiang
10 篇 wang hongan
8 篇 tian qi
8 篇 bai xue
8 篇 liu wei
8 篇 dai guozhong
8 篇 barmpalias georg...
7 篇 ye mao
7 篇 wang shuling
7 篇 zhang tian
7 篇 tian feng
7 篇 yu xiao
7 篇 mingjun xiao
7 篇 sheng zhang
6 篇 zhuzhong qian

语言

385 篇 英文
9 篇 其他
7 篇 中文

检索条件"机构=State Key Lab. of Computer Science Inst. of Software"

共 401 条记录，以下是221-230 订阅

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

详细简洁

排序：

Early effort estimation by AHP: A case study of project metrics in small organizations

Early effort estimation by AHP: A case study of project metr...

引用

2012 IEEE International Conference on computer science and Automation Engineering, CSAE 2012

作者： Zhang, Yan Zhang, Xiaokun Zhao, Xuying Zhang, Tian Department of Computer Science and Technology Beijing Electronic Science and Technology Institute Beijing 100070 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9781467300865

Project effort estimation in the early phase of software development is a significant activity for every software organization to improve the development process. Small organizations need some simple and easily used method to estimate effort because of insufficient resources including human and finance. Analytic Hierarchy Process (AHP), which integrates qualitative and subjective approach with quantitative and objective approach, can meet the need of small organizations. We use the data of three real projects to demonstrate the application of AHP for early project effort estimation. By the analysis of the estimation results, we point that AHP can not only predict the project effort in the early phase of development, but also help managers to find the principal factors that contribute to the project effort in their organizations. In summary, AHP is appropriate for early project effort estimation in a small organization. © 2012 IEEE.

关键词： Analytic hierarchy process

来源：评论

学校读者我要写书评

暂无评论

Unblockable compositions of software components 12

Unblockable compositions of software components

引用

15th ACM SIGSOFT Symposium on Component Based software Engineering, CBSE'12

作者： Dong, Ruzhen Faber, Johannes Liu, Zhiming Srba, Jiří Zhan, Naijun Zhu, Jiaqi UNU-IIST China Dept. of Computer Science Aalborg University Denmark State Key Lab. of Comp. Sci. Institute of Software CAS China

ISBN: (纸本)9781450313452

We present a new automata-based interface model describing the interaction behavior of software components. Contrary to earlier component- or interface-based approaches, the interface model we propose specifies all the non-blockable interaction behaviors of a component with any environment. To this end, we develop an algorithm to compute the un-blockable interaction behavior, called the interface model of a component, from its execution model. Based on this model, we introduce composition operators for the components and prove important compositionality results, showing the conditions under which composition of interface models preserves unblockable sequences of provided services. Copyright © 2012 ACM.

关键词： component-based design interface theory composition

来源：评论

学校读者我要写书评

暂无评论

A practical local hacking scheme on device-independent bell test based quantum randomness expansion

A practical local hacking scheme on device-independent bell ...

引用

Frontiers in Optics, FIO 2012

作者： Li, Junhui Yu, Quanfu Liu, Yu Guo, Hong CREAM Group State Key Lab. of Advanced Optical Communication Systems and Networks Inst. of Quantum Electronics School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

Violation of Bell inequality cannot guarantee non-locality, thus an applicable hacking scheme on device-independent Bell test based quantum randomness expansion is given, together with a more secure upper bound on gen... 详细信息

ISBN: (纸本)9781557529565

关键词： Personal computing

来源：评论

学校读者我要写书评

暂无评论

Tag ranking by propagating relevance over tag and image graphs 12

Tag ranking by propagating relevance over tag and image grap...

引用

4th International Conference on Internet Multimedia Computing and Service, ICIMCS 2012

作者： Li, Minxian Tang, Jinhui Li, Haojie Zhao, Chunxia School of Computer Science and Technology Nanjing University of Science and Technology Nan Jing China State Key Lab. for Novel Software Technology Nanjing University Nan Jing China School of Software Dalian University of Technology Dalian China

ISBN: (纸本)9781450316002

In this paper, we explore the problem of tag ranking by propagating relevance over community-contributed images and their associated tags. To rank the tags more accurately, we propose a novel tag ranking scheme through a two-stage graph-based relevance propagation approach. The first stage constructs a tag graph on each image and implements a random walk process on it in order to get the initial relevance of each tag for one image and the second stage builds a κNN-sparse image graph and propagates the relevance of tags among the web images. The proposed approach is purely data-driven, since the explicit relevance models between tags and images are not assumed. More importantly, compared to existing tag ranking approaches, we propose to leverage the relevance propagation over two graphs, which take into count not only the relationship among tags but also the relationship among images. Extensive experiments have conducted on the NUS-WIDE dataset have demonstrated the effectiveness of the proposed approach. Copyright © 2012 ACM.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Hierarchical clustering on HDP topics to build a semantic tree from text

Hierarchical clustering on HDP topics to build a semantic tr...

引用

2nd International Workshop on Searching and Integrating New Web Data Sources: Very Large Data Search, VLDS 2012

作者： Si, Jianfeng Li, Qing Qian, Tieyun Deng, Xiaotie Dept. of Computer Science City University of Hong Kong Hong Kong Hong Kong State Key Lab. of Software Eng. Wuhan University Wuhan China

An ideal semantic representation of text corpus should exhibit a hierarchical topic tree structure, and topics residing at different node levels of the tree should exhibit different levels of semantic abstraction (i.e., the deeper level a topic resides, the more specific it would be). inst.ad of learning every node directly which is a quite time consuming task, our approach bases on a nonparametric Bayesian topic model, namely, Hierarchical Dirichlet Processes (HDP). By tuning on the topic's Dirichlet scale parameter settings, two topic sets of different levels of abstraction are learned from the HDP separately and further integrated into a hierarchical clustering process. We term our approach as HDP Clustering(HDP-C). During the hierarchical clustering process, a lower level of specific topics are clustered into a higher level of more general topics in an agglomerative style to get the final topic tree. Evaluation of the tree quality on several real world datasets demonstrates its competitive performance.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Context-aware role mining for mobile service recommendation 12

Context-aware role mining for mobile service recommendation

引用

27th Annual ACM Symposium on Applied Computing, SAC 2012

作者： Wang, Jian Zeng, Cheng He, Chuan Hong, Liang Zhou, Liang Wong, Raymond K. Tian, Jilei State Key Lab. of Software Engineering Wuhan University China School of Computer Science and Engineering University of New South Wales Australia Nokia Research Center Beijing China

ISBN: (纸本)9781450308571

Finding and recommending suitable services for mobile users are increasingly important due to the popularity of mobile Internet. While recent research has attempted to use role-based approaches to recommend services, role discovery is still an ongoing research topic. In particular, numerous role mining approaches have been proposed in the context of RBAC (Role-Based Access Control) in which only two dimensions of parameters are considered (i.e., 〈user, permission〉);and the notion of context-awareness has been disregarded. This paper proposes a context-aware role mining method to automatically group users according to their interests and habits, such that popular mobile services can be recommended to other members in the same group in a context dependent manner. Experiments show that our approach is efficient and practical for mobile service recommendation. © 2012 ACM.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Probabilistic reasoning in DL-lite

Probabilistic reasoning in DL-lite

引用

12th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2012

作者： Ramachandran, Raghav Qi, Guilin Wang, Kewen Wang, Junhu Thornton, John School of Information and Communication Technology Griffith University Australia School of Computer Science and Engineering Southeast University China State Key Lab. for Novel Software Technology Nanjing University China

ISBN: (纸本)9783642326943

The problem of extending description logics with uncertainty has received significant attention in recent years. In this paper, we investigate a probabilistic extension of DL-Lite, a family of tractable description logics. We first present a new probabilistic semantics for terminological knowledge bases based on the notion of types. The semantics proposed is not capable of handling assertional knowledge. In order to reason with both terminological and assertional probabilistic knowledge, we propose a probabilistic semantics based on a finite semantics for DL-Lite called features. This approach enables us to infer new information from the existing knowledge base by drawing on the inherent relation between a probabilistic TBox and a probabilistic ABox. © 2012 Springer-Verlag.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for frequent itemset mining using Patricia* structures

A fast algorithm for frequent itemset mining using Patricia*...

引用

14th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2012

作者： Qu, Jun-Feng Liu, Mengchi State Key Lab. of Software Engineering School of Computer Wuhan University Wuhan 430072 China School of Computer Science Carleton University Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9783642325830

Efficient mining of frequent itemsets from a database plays an essential role in many data mining tasks such as association rule mining. Many algorithms use a prefix-tree to represent a database and mine frequent itemsets by constructing recursively conditional prefix-trees from the prefix-tree. A (conditional) prefix-tree can be stored in various structures. The construction and traversal costs of prefix-trees, or rather their storage structures, take a large proportion in the whole cost for such algorithms. The PatriciaMine algorithm employs a Patricia trie to store a prefix-tree and shows good performance. In this study, we introduce an efficient Patricia*structure for storing a prefix-tree. A Patricia*structure is more compact and contiguous than a corresponding Patricia trie, and thus the construction and traversal costs of the former are less than those of the latter. Previous prefix-tree-based algorithms adopt a similar mining procedure, in which most nodes in a prefix-tree are repeatedly accessed when the prefix-tree is processed. The paper presents a novel mining procedure in which node accesses for a prefix-tree are greatly reduced. We propose the PatriciaMine* algorithm that is the combination of the Patricia*structure with the proposed procedure. Experimental data show that PatriciaMine*outperforms not only PatriciaMine but also several fast algorithms, such as FPgrowth*and dEclat, for various databases. © 2012 Springer-Verlag.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Test effectiveness index: Integrating product metrics with process metrics

Test effectiveness index: Integrating product metrics with p...

引用

2012 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems, CYBER 2012

作者： Zhang, Yan Zhao, Xuying Zhang, Xiaokun Zhang, Tian Department of Computer Science and Technology Beijing Electronic Science and Technology Institute Beijing 100070 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9781467314213

Defect measurement is an important method in the improvement of software quality. Recent approaches of defect measurement are inappropriate to small software organizations by reason of their intricacy. This paper gives a simple approach of defect measurement, which integrates the power of product metrics with process metrics, i.e., it can not only detect the defect-prone modules, but also find the problems in the software process. This approach uses the results of successive two rounds of testing to create the test effectiveness index constructively. A case study is conducted and the results indicate that the defectprone modules can be identified and problems of testing process can be discovered by test effectiveness index. © 2012 IEEE.

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

Mining high utility itemsets without candidate generation 12

Mining high utility itemsets without candidate generation

引用

21st ACM International Conference on Information and Knowledge Management, CIKM 2012

作者： Liu, Mengchi Qu, Junfeng State Key Lab. of Software Engineering School of Computer Wuhan University Wuhan 430072 China School of Computer Science Carleton University Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9781450311564

High utility itemsets refer to the sets of items with high utility like profit in a database, and efficient mining of high utility itemsets plays a crucial role in many real-life applications and is an important research issue in data mining area. To identify high utility itemsets, most existing algorithms first generate candidate itemsets by overestimating their utilities, and subsequently compute the exact utilities of these candidates. These algorithms incur the problem that a very large number of candidates are generated, but most of the candidates are found out to be not high utility after their exact utilities are computed. In this paper, we propose an algorithm, called HUI-Miner (High Utility Itemset Miner), for high utility itemset mining. HUI-Miner uses a novel structure, called utility-list, to store both the utility information about an itemset and the heuristic information for pruning the search space of HUI-Miner. By avoiding the costly generation and utility computation of numerous candidate itemsets, HUI-Miner can efficiently mine high utility itemsets from the utility-lists constructed from a mined database. We compared HUI-Miner with the state-of-the-art algorithms on various databases, and experimental results show that HUI-Miner outperforms these algorithms in terms of both running time and memory consumption. © 2012 ACM.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共41页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：