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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

419 篇 会议
120 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

412 篇 工学
- 315 篇 计算机科学与技术...
- 266 篇 软件工程
- 108 篇 信息与通信工程
- 41 篇 控制科学与工程
- 37 篇 生物工程
- 28 篇 电子科学与技术（可...
- 21 篇 电气工程
- 20 篇 机械工程
- 20 篇 光学工程
- 14 篇 动力工程及工程热...
- 12 篇 仪器科学与技术
- 11 篇 化学工程与技术
- 11 篇 农业工程
- 11 篇 生物医学工程（可授...
- 8 篇 安全科学与工程
- 7 篇 建筑学
196 篇 理学
- 138 篇 数学
- 43 篇 统计学（可授理学、...
- 37 篇 物理学
- 37 篇 生物学
- 12 篇 系统科学
- 11 篇 化学
142 篇 管理学
- 95 篇 图书情报与档案管...
- 61 篇 管理科学与工程(可...
- 29 篇 工商管理
13 篇 法学
- 11 篇 社会学
11 篇 经济学
- 11 篇 应用经济学
11 篇 农学
- 11 篇 作物学
11 篇 医学
- 10 篇 临床医学
- 9 篇 基础医学(可授医学...
3 篇 艺术学
2 篇 教育学
1 篇 文学
1 篇 军事学

主题

16 篇 semantics
11 篇 network coding
10 篇 bandwidth
10 篇 data mining
10 篇 training
9 篇 feature extracti...
8 篇 computational mo...
8 篇 clustering algor...
8 篇 cloud computing
7 篇 collaborative fi...
7 篇 data models
6 篇 object detection
6 篇 educational inst...
6 篇 servers
6 篇 mapreduce
6 篇 computational li...
6 篇 real-time system...
6 篇 entropy
6 篇 web services
5 篇 scalability

机构

30 篇 key lab. of inte...
29 篇 university of ch...
20 篇 tianjin key lab....
19 篇 key lab. of inte...
13 篇 key lab. of inte...
13 篇 school of comput...
11 篇 graduate univers...
11 篇 key laboratory o...
11 篇 state key lab. f...
10 篇 shenyang institu...
10 篇 peng cheng labor...
10 篇 hunan provincial...
9 篇 school of comput...
9 篇 graduate univers...
9 篇 liaoning key lab...
8 篇 state key labora...
8 篇 key laboratory o...
7 篇 key lab. of inte...
7 篇 school of cyber ...
7 篇 institute of com...

作者

25 篇 liu qun
19 篇 yin zhenyu
19 篇 kai lei
19 篇 li hui
18 篇 huang qingming
13 篇 guosheng kang
10 篇 gao wen
9 篇 zhang degan
9 篇 liu jianxun
9 篇 xu qianqian
9 篇 jianxun liu
9 篇 zhuge hai
8 篇 kang guosheng
8 篇 zhang feiqing
8 篇 cao jiannong
7 篇 fan chao
7 篇 jiang shuqiang
7 篇 mi haitao
7 篇 wang tao
7 篇 yang yan

语言

513 篇 英文
21 篇 中文
5 篇 其他

检索条件"机构=Key Lab. of Cloud Computing Technology"

共 539 条记录，以下是21-30 订阅

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

详细简洁

排序：

BCStore: Bandwidth-Efficient in-memory kv-store with batch coding 33

BCStore: Bandwidth-Efficient in-memory kv-store with batch c...

引用

33rd International Conference on Massive Storage Systems and technology, MSST 2017

作者： Li, Shenglong Zhang, Quanlu Yang, Zhi Dai, Yafei Peking University China Institute of Big Data Technologies Shenzhen Key Lab for Cloud Computing Technology and Applications China

In-memory key-value store KV-store is a crucial building block for many systems including large-scale web services and databases. Recent research works pay close attention to data availab.lity of in-memory KV-store. Replication is a common solution to achieve data availab.lity, but the significant memory consumption makes it not applicable for memoryintensive applications. Integrating erasure coding into inmemory KV-store is an emerging approach to achieve memory efficiency. However, traditional in-place update mechanism of erasure coding incurs significant bandwidth cost for writeintensive workload due to frequent broadcast of data update. In this paper, we build BCStore, a bandwidth-efficient inmemory KV-store with erasure coding. We propose a novel batch coding mechanism to optimize the bandwidth cost, and verify its feasibility and efficiency through theoretical analysis. To recycle the memory space due to delete and update operations, we design an efficient move-based garbage collection (GC) mechanism with a novel data layout called virtual coding stripe. Besides, BCStore guarantees consistent data read and write under these new designs, and supports fast online data recovery. We evaluate the performance of BCStore under various workloads. Experimental results show that BCStore can save up to 41% memory compared with replication, and achieve up to 2.4x throughput improvement and 51% bandwidth saving compared to erasure coding with in-place update. © 33rd International Conference on Massive Storage Systems and technology, MSST 2017. All rights reserved.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

TopicDSDR: Combining topic decomposition and data reconstruction for summarization

TopicDSDR: Combining topic decomposition and data reconstruc...

引用

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Zhang, Zhiming Li, Hongjie Huang, Lian'En Shenzhen Key Lab for Cloud Computing Technology and Applications Peking University Shenzhen Graduate School Shenzhen Guangdong China

ISBN: (纸本)9783642385612

Multi-document summarization attempts to select the most important information to generate a compressed summary from a collection of documents. From the perspective of data reconstruction, a good summary may also well reconstruct the original documents. A document generally contains a variety of information centered around a main topic and covers different aspects of the main topic. In this paper we propose a novel model that combines data reconstruction and topic decomposition to summarize the documents, named TopicDSDR, which can not only best reconstruct the original documents but also capture the semantic similarity and main topics. We discuss two kinds of reconstructions: linear reconstruction and nonnegative reconstruction. We use the generalized Kullback-Leibler(KL) divergence as the loss function to evaluate the quality of summary for linear and nonnegative reconstruction and develop two new algorithms respectively. We conduct experiments on DUC2006 and DUC2007 summarization data sets, the experimental results demonstrate the effectiveness of our proposed methods. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Semantic-driven management and search for resources in research community

Semantic-driven management and search for resources in resea...

引用

2006 2nd International Conference on Semantics Knowledge and Grid, SKG

作者： Junsheng, Zhang Zhixian, Yan Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences

ISBN: (纸本)0769532055

In recent years, semantic search has become one hot motivation of the semantic web. In this paper, we propose a semantic-based resource management and search architecture and its implementation in research community, including most of the research relevant resources. We have built two authoring tools respectively for concepts and instances. With the authoring tools, semantic search portal is provided, which has three different interfaces, respectively for retrieval of concept, instance and semantic relationship. Compared with the traditional search methods, semantic search methodology not only gives us more interesting and satisfying search results, whose precision is higher than those of traditional ones only based on keywords, but also displays the results in a more structural and semantic way. © 2006 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Study of a code comment decision method based on structural features

Study of a code comment decision method based on structural ...

引用

2019 International Conference on Intelligent computing, Automation and Systems, ICICAS 2019

作者： Wang, Renmin Wang, Tao Wang, Huaimin Key Lab. of Parallel and Distributed Computing National University of Defense Technology Changsha China

ISBN: (纸本)9781728161068

Code comment is one of the most effective ways to help programmers to understand the source code. High-quality comment decisions can not only cover the core code snippets in the software system but also avoid generating redundant code comments. However, in actual development, there is no uniform comment specification, and most of the comment decisions depend on personal experience and domain knowledge. This paper has learned a common comment decision specification from a large number of code comment examples to assist programmers in making appropriate comment decisions during code development. This paper proposes a method to extract the code structure from the context code of the current code line, and use the machine learning algorithm to determine the possibility that the current code needs to add comments. The proposed method was evaluated on 8 well-known open-source Python projects in GitHub and the experimental results show the feasibility and effectiveness of the method in some code types. © 2019 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Comments-oriented document summarization based on multi-aspect co-feedback ranking

Comments-oriented document summarization based on multi-aspe...

引用

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Huang, Lifu Li, Hongjie Huang, Lian'En Shenzhen Key Lab for Cloud Computing Technology and Applications Peking University Shenzhen Graduate School Shenzhen Guangdong 518055 China

ISBN: (纸本)9783642385612

With the popularity of Web 2.0, comments left by readers on web documents have drawn much attention. In this paper, we study the problem of comments-oriented document summarization, which aims to summarize a web document by considering not only its content but also the comments. Generally, most of the comments usually convey one or a few aspects of the document. Given a sentence set from both the web document and its corresponding comments to summarize, we can divide different sentences into different clusters (named "aspects") according to the content. It is challenging and interesting to summarize the web document based on these clusters. Motivated by this, we propose a novel model: MultiAspectCoRank, for comments-oriented document summarization. Firstly we rank all the sentences based on the multiple aspects obtained from the whole document, and then provide each ranking list as feedback to others until the top-N results of each ranking list are unchanged. We get the final result by integrating these different ranking lists together. Experimental results on a set of real-world blog data with manually lab.led sentences show the promising performance of our approach. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Optimized event storyline generation based on mixture-event-aspect model

Optimized event storyline generation based on mixture-event-...

引用

2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013

作者： Huang, Lifu Huang, Lian'en Shenzhen Key Lab for Cloud Computing Technology and Applications Peking University Shenzhen Graduate School Shenzhen Guangdong518055 China

ISBN: (纸本)9781937284978

Recently, much research focuses on event storyline generation, which aims to produce a concise, global and temporal event summary from a collection of articles. Generally, each event contains multiple sub-events and the storyline should be composed by the component summaries of all the sub-events. However, different sub-events have different part-whole relationship with the major event, which is important to correspond to users' interests but seldom considered in previous work. To distinguish different types of sub-events, we propose a mixture-event-aspect model which models different sub-events into local and global aspects. Combining these local/global aspects with summarization requirements together, we utilize an optimization method to generate the component summaries along the timeline. We develop experimental systems on 6 distinctively different datasets. Evaluation and comparison results indicate the effectiveness of our proposed method. © 2013 Association for Computational Linguistics.

关键词： Mixtures

来源：评论

学校读者我要写书评

暂无评论

A novel biased diversity ranking model for Query-oriented multidocument summarization

A novel biased diversity ranking model for Query-oriented mu...

引用

2013 International Conference on Vehicle and Mechanical Engineering and Information technology, VMEIT 2013

作者： Lei, Kai Zeng, Yi Fan The Shenzhen Key Lab for Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen Guangdong 518055 China

ISBN: (纸本)9783037858202

Query-oriented multi-document summarization (QMDS) attempts to generate a concise piece of text byextracting sentences from a target document collection, withthe aim of not only conveying the key content of that corpus,also, satisfying the information needs expressed by that *** to its great applicable value, QMDS has been intensively studied in recent decades. Three properties are supposed crucial for a good summary, i.e., relevance, prestige and low redundancy (orso-called diversity). Unfortunately, most existing work either disregarded the concern of diversity, or handled it with non-optimized heuristics, usually based on greedy sentences election. Inspired by the manifold-ranking process, which deals with query-biased prestige, and DivRank algorithm which captures query-independent diversity ranking, in this paper, we propose a novel biased diversity ranking model, namedManifoldDivRank, for query-sensitive summarization tasks. The top-ranked sentences discovered by our algorithm not only enjoy query-oriented high prestige, more importantly, they are dissimilar with each other. Experimental results on DUC2005and DUC2006 benchmark data sets demonstrate the effectivenessof our proposal. © (2013) Trans Tech Publications, Switzerland.

关键词： Conveying

来源：评论

学校读者我要写书评

暂无评论

Prologue: Unified polymorphic routing towards flexible architecture of reconfigurable infrastructure 9

Prologue: Unified polymorphic routing towards flexible archi...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Pan, Kai Li, Hui Liu, Weiyang Zhu, Zhipu Chen, Fuxing Zhu, Bing Shenzhen Engineering Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen518055 China

ISBN: (纸本)9783319133256

Today’s Internet architecture was designed and proposed in the 60s and 70s with the intention to interconnect several computing resources across a geographically distributed user group. With the advent of substantially various Internet businesses, traditional Internet is increasingly powerless to satisfy the unprecedented demands. This paper probed the polymorphic routing prototype based on proposed Flexible Architecture of Reconfigurable Infrastructure (FARI) which attempts to emerge as a clean-slate revolution of future Internet and resorts to centralized control manner. Routers in FARI were reconfigurable to adapt to different businesses in terms of identifier type. Moreover, a preliminary framework of FARI is proposed in the end of the article. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： Reconfigurable architectures

来源：评论

学校读者我要写书评

暂无评论

Semi-centralized name routing mechanism for reconfigurable network 9

Semi-centralized name routing mechanism for reconfigurable n...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Chen, Fuxing Liu, Weiyang Li, Hui Zhu, Zhipu Shenzhen Engineering Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen518055 China

ISBN: (纸本)9783319133256

Dedicated to overcoming weakness of current Internet architecture, some novel internet architectures have been proposed recently. Examples of these architectures contain Information Centric Networking (ICN), Name Data Networking (NDN), reconfigurable networking etc. As far as we know, the most efficient name based routing mechanism which suites the new architectures has not been found yet. This paper proposed a Semi-Centralized Name Routing (SCNR) protocol for reconfigurable network to enhance the routing efficiency. Results of this paper show that SCNR has good performance in ICN, which can be regarded as one of the many sub-networks in reconfigurable network. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Optimization-based atomic capability routing model for flexible architecture of reconfigurable infrastructure 9

Optimization-based atomic capability routing model for flexi...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Liu, Weiyang Li, Hui Chen, Fuxing Pan, Kai Shenzhen Engineering Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen518055 China

ISBN: (纸本)9783319133256

There are more and more emerging problems in today’s Internet, indicating today’s Internet architecture can not meet the quality requirement of various applications and service. With conventional Internet under mounting pressure, a new future Internet architecture named as Flexible Architecture of Reconfigurable Infrastructure (FARI) has been developed and implemented in China. Aiming at designing a routing mechanism which is one of the most essential issue in any Internet architecture, this paper explores to establish an optimization-based atomic capability routing model that is able to optimally select or generate a routing protocol based on the current network quality of service (QoS) requirement. In experiments, the feasibility of this routing model is verified and results of complexity analysis are satisfying. ©Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：