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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,699 篇 会议
32 篇 期刊文献
25 册 图书

馆藏范围

2,756 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,682 篇 工学
- 1,477 篇 计算机科学与技术...
- 671 篇 软件工程
- 490 篇 信息与通信工程
- 355 篇 电气工程
- 93 篇 控制科学与工程
- 82 篇 网络空间安全
- 65 篇 生物工程
- 56 篇 电子科学与技术（可...
- 42 篇 动力工程及工程热...
- 39 篇 仪器科学与技术
- 33 篇 机械工程
- 28 篇 建筑学
- 26 篇 交通运输工程
- 26 篇 安全科学与工程
- 25 篇 环境科学与工程（可...
- 24 篇 光学工程
- 20 篇 生物医学工程（可授...
- 17 篇 材料科学与工程（可...
323 篇 理学
- 192 篇 数学
- 67 篇 生物学
- 46 篇 系统科学
- 45 篇 统计学（可授理学、...
- 44 篇 物理学
216 篇 管理学
- 143 篇 管理科学与工程(可...
- 85 篇 图书情报与档案管...
- 73 篇 工商管理
50 篇 法学
- 34 篇 社会学
27 篇 医学
- 21 篇 临床医学
- 17 篇 基础医学(可授医学...
23 篇 经济学
- 20 篇 应用经济学
14 篇 教育学
11 篇 农学
6 篇 文学
3 篇 军事学
2 篇 艺术学

主题

285 篇 distributed comp...
267 篇 cloud computing
135 篇 social networkin...
103 篇 computer archite...
93 篇 protocols
91 篇 computer network...
88 篇 computer science
87 篇 peer to peer com...
83 篇 computational mo...
75 篇 security
69 篇 mobile computing
66 篇 routing
66 篇 servers
61 篇 resource managem...
60 篇 peer-to-peer com...
59 篇 internet of thin...
59 篇 grid computing
57 篇 application soft...
56 篇 quality of servi...
51 篇 software enginee...

机构

29 篇 daffodil interna...
21 篇 beijing univ pos...
13 篇 state key labora...
12 篇 daffodil interna...
10 篇 daffodil interna...
10 篇 shandong provinc...
8 篇 institute of com...
8 篇 school of inform...
5 篇 shenyang institu...
5 篇 tokyo denki univ...
5 篇 rissho universit...
5 篇 department of co...
4 篇 univ chinese aca...
4 篇 nokia research c...
4 篇 beijing univ pos...
4 篇 center for compu...
4 篇 university of ch...
4 篇 hosei univ
4 篇 department of co...
4 篇 department of co...

作者

12 篇 abujar sheikh
12 篇 hossain syed akh...
12 篇 sheikh abujar
11 篇 syed akhter hoss...
8 篇 masum abu kaisar...
8 篇 abu kaisar moham...
7 篇 wehrle klaus
7 篇 dustdar schahram
7 篇 kao odej
7 篇 buyya rajkumar
6 篇 m. takizawa
6 篇 yang yang
6 篇 t. enokido
6 篇 wang ying
6 篇 rothermel kurt
5 篇 wu budan
5 篇 wirtz hanno
5 篇 truong hong-linh
5 篇 ramachandran k.i...
5 篇 bhuiyan md. rafi...

语言

2,687 篇 英文
62 篇 其他
6 篇 中文
2 篇 法文

检索条件"任意字段=11th International Conference on Distributed Computing and Networking"

共 2756 条记录，以下是1981-1990 订阅

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

详细简洁

排序：

引用

11th international conference on Parallel and distributed computing, Applications and Technologies, PDCAT 2010

作者： Shorfuzzaman, Mohammad Graham, Peter Eskicioglu, Rasit Department of Computer Science University of Manitoba Winnipeg MB R3T 2N2 Canada

ISBN: (纸本)9780769542874

Data grids support distributed data-intensive applications that need to access massive datasets stored around the world. Ensuring efficient access to such datasets is hindered by the high latencies of wide-area networks. To speed up access, files can be replicated so a user can access a nearby replica. Replication also provides improved availability, decreased bandwidth use, increased fault tolerance, and improved scalability. Since a grid environment is dynamic, resource availability, network latency, and user requests may change. To address these issues a dynamic replica placement strategy that adapts to changing behaviour is needed. In this paper, we introduce a highly distributed replica placement algorithm for hierarchical data grids. Our algorithm exploits data access histories to identify popular files and determines optimal replication locations to improve access performance by minimizing replication overhead (access and update) assuming a given traffic pattern. the problem is formulated using dynamic programming. We evaluate our algorithm using the OptorSim simulator and find that it offers shorter execution time and reduced bandwidth consumption compared to other dynamic replica placement methods. © 2010 IEEE.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

SemanticCast: Content-based data distribution over self-organizing semantic overlay networks

SemanticCast: Content-based data distribution over self-orga...

引用

11th international conference on Parallel and distributed computing, Applications and Technologies, PDCAT 2010

作者： Zheng, Zhong Wang, Yijie National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9780769542874

Many applications demand distributing data with different contents efficiently in the network environment with unreliable links and a high node churn. Existing approaches mostly focus on optimizing either efficiency or robustness of data distribution, and fail to ensure both of them simultaneously. In this paper, we propose SemanticCast - a content-based data distribution approach over self-organizing semantic overlay networks. SemanticCast maintains a self-organizing semantic overlay based on view exchange (called Crowd). In Crowd, each node seeks neighbors with more similar interests by periodically exchanging its neighbor list (called view) with a chosen neighbor. through these nodes' self-organizing behavior, various interest communities emerge in the overlay. For data distribution over Crowd, SemanticCast adopts random walk to route data between interest communities, and adopts flooding to disseminate data inside the interested communities. the experimental results show that compared to existing approaches, SemanticCast can support efficient content-based data distribution in the unreliable and highly dynamic network environment. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Mining High Utility Web Access Sequences in Dynamic Web Log Data

Mining High Utility Web Access Sequences in Dynamic Web Log ...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, networking, and Parallel/distributed computing (SNPD)

作者： Chowdhury Farhan Ahmed Syed Khairuzzaman Tanbeer Byeong-Soo Jeong Database Laboratory Department of Computer Engineering Kyung Hee University Yongin si Gyeonggi South Korea

ISBN: (纸本)9781424474226;9780769540887

Mining web access sequences can discover very useful knowledge from web logs with broad applications. By considering non-binary occurrences of web pages as internal utilities in web access sequences, e.g., time spent by each user in a web page, more realistic information can be extracted. However, the existing utility-based approach has many limitations such as considering only forward references of web access sequences, not applicable for incremental mining, suffers in the level-wise candidate generation-and-test methodology, needs several database scans and does not show how to mine web traversal sequences with external utility, i.e., different impacts/significances for different web pages. In this paper, we propose a new approach to solve these problems. Moreover, we propose two novel tree structures, called UWAS-tree (utility-based web access sequence tree), and IUWAS-tree (incremental UWAS tree), for mining web access sequences in static and dynamic databases respectively. Our approach can handle both forward and backward references, static and dynamic data, avoids the level-wise candidate generation-and-test methodology, does not scan databases several times and considers both internal and external utilities of a web page. Extensive performance analyses show that our approach is very efficient for both static and incremental mining of high utility web access sequences.

关键词： Web pages Data mining Frequency distributed computing Web mining Software engineering Artificial intelligence distributed databases Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A parallel island-based hybrid genetic algorithm for precedence-constrained applications to minimize energy consumption and makespan

A parallel island-based hybrid genetic algorithm for precede...

引用

2010 11th IEEE/ACM international conference on Grid computing, Grid 2010

作者： Mezmaz, M. Kessaci, Y. Lee, Y.C. Melab, N. Talbi, E.-G. Zomaya, A.Y. Tuyttens, D. University of Mons Belgium Université de Lille1 France Centre for Distributed and High Performance Computing University of Sydney Australia

ISBN: (纸本)9781424493487

Task scheduling algorithms are designed mostly with the sole goal of minimizing makespan (completion time). Almost all research works related to this kind of algorithms do not pay much attention to energy consumption. In this paper, we investigate the energy issue in task scheduling particularly on high-performance computing systems (HCSs). We propose a new island-based bi-objective hybrid algorithm that takes into account, not only makespan, but also energy consumption. the proposed approach uses dynamic voltage scaling (DVS) to minimize energy consumption. Our study provides the significance and potential of DVS. the proposed approach is powerful as it profits from the cooperative paradigm of the island model. Indeed, the obtained results show that our approach outperforms previous scheduling methods, in terms of energy consumption, by a noticeable margin. the obtained schedules are also shorter, in terms of completion time, than those of other algorithms. © 2010 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Mobile metadata for web-based Image Query Services 10

Mobile metadata for web-based Image Query Services

引用

11th IEEE international conference on Mobile Data Management, MDM 2010

作者： Beatty, Daniel Lopez-Benitez, Noé Distributed Computing Lab. Department of Computer Science Texas Tech University Lubbock TX 79409-3104 United States

ISBN: (纸本)9780769540481

Photographic observations of the night sky can best be presented using a data model that conveys the observations, analysis, objects contained with the observations, and results of analysis pertaining to those objects. Such a model is proposed in this paper and it is referred to as the internet Flexible Image Transport System (iFITS), along with a mapping function to transform instances of the Sloan Digital Sky Survey (SDSS) Data Release 1 (DR1) to instances of iFITS, and a hybrid light-weight marshaling method to transfer DR1 data to the implementation of iFITS. iFITS is implemented as a mobile code agent that supports client-based image retrieval in web-based mobile computing environments. the implementation of iFITS was tested against the Image Query Service of SDSS Data Release 6 and the Revised Image Query Service recently proposed. the experiments results reported show a three-fold speedup for iFITS. © 2010 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the Annual international conference on Mobile computing and networking, MOBICOM: Message from the general chairs & program chairs

Proceedings of the Annual International Conference on Mobile...

引用

Proceedings of the Annual international conference on Mobile computing and networking, MOBICOM 2010年

作者： Chandra, Ranveer Katti, Sachin Moscibroda, thomas Microsoft Research United States

来源：评论

学校读者我要写书评

暂无评论

Integration of global and local information in videos for key frame extraction 11

Integration of global and local information in videos for ke...

引用

11th IEEE international conference on Information Reuse and Integration, IRI 2010

作者： Liu, Dianting Shyu, Mei-Ling Chen, Chao Chen, Shu-Ching Department of Electrical and Computer Engineering University of Miami Coral Gables FL 33124 United States Distributed Multimedia Information Systems Laboratory School of Computing and Information Sciences Florida International University Miami FL 33199 United States

ISBN: (纸本)9781424480975

Key frame extraction methods aim to obtain a set of frames that can efficiently represent and summarize video contents and be reused in many video retrieval-related applications. An effective set of key frames, viewed as a high-quality summary of the video, should include the major objects and events of the video, and contain little redundancy and overlapped content. In this paper, a new key frame extraction method is presented, which not only is based on the traditional idea of clustering in the feature extraction phase but also effectively reduces redundant frames using the integration of local and global information in videos. Experimental results on the TRECVid 2007 test video dataset have demonstrated the effectiveness of our proposed key frame extraction method in terms of the compression rate and retrieval precision. © 2010 IEEE.

关键词： Integration

来源：评论

学校读者我要写书评

暂无评论

Integrating DBMSs as a read-only execution layer into Hadoop

Integrating DBMSs as a read-only execution layer into Hadoop

引用

11th international conference on Parallel and distributed computing, Applications and Technologies, PDCAT 2010

作者： An, Mingyuan Wang, Yang Wang, Weiping Sun, Ninghui Key Laboratory of Computer System and Architecture Graduate University of Chinese Academy of Sciences Chinese Academy of Sciences Beijing China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769542874

To obtain the efficiency of DBMS, HadoopDB combines Hadoop and DBMS, and claims the superiority over Hadoop in terms of performance. However, the approach of HadoopDB is simply putting MapReduce onto unmodified single-machined DBMSs which has several obvious weaknesses. In essence, HadoopDB is a parallel DBMS with fault tolerance, which incurs unnecessary overhead due to the DBMS legacy. Instead of augmenting DBMS with Hadoop techniques, we propose a new system architecture integrating modified DBMS engines as a read-only execution layer into Hadoop, where DBMS plays a role of providing efficient readonly operators rather than managing the data. Besides the obtained efficiency from DBMS engine, there are other advantages. the modified DBMS engine is able to directly process data from the HDFS (Hadoop distributed File System) files at the block level, which means that the data replication can be handled by HDFS naturally, and the blocklevel parallelism is easily achieved. the global index access mechanism is added according to the MapReduce paradigm. the data loading speed is also guaranteed by directly writing the data into HDFS with simplified logic. Experiments show that our system outperforms both original Hadoop and HadoopDB styled system. © 2010 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

HPP controller: A system controller dedicated for message passing

HPP controller: A system controller dedicated for message pa...

引用

11th international conference on Parallel and distributed computing, Applications and Technologies, PDCAT 2010

作者： Wang, Kai Chen, Fei Cao, Zheng An, Xuejun Sun, Ninghui National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769542874

the traditional system controller in symmetric multi-processors (SMP) controls the memory, so it is suitable for the shared memory programming model. With the emergence of the processors which integrate memory controllers, the system controller seems less important than before. However, since the system controller resides in the center of a computer system, it acts as an artery which directly connects to the processors and the high-speed IO devices. thus making full use of its position advantage can no doubt gain performance enhancement. By now, the message passing programming model has dominated the high performance computing (HPC) field, however the system controller makes little contribution to it. thus, a system controller called HPP controller which is dedicated for the message passing programming model is presented in this paper. the HPP controller is connected to several processors simultaneously, and the communication between these processors uses the message passing programming model. the HPP controller has powerful DMA engines embedded which can provide flexible and sufficient message passing capability. Two key techniques: supporting arbitrary byte alignment and virtualizing the DMA engine are introduced in detail. the preliminary result of the FPGA prototype shows that the HPP controller has ultra low hardware latency and relatively high bandwidth. Besides, the NPB result shows that it can provide high efficiency for the message passing programming model. © 2010 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

XenHVMAcct: Accurate CPU time accounting for hardware-assisted virtual machine

XenHVMAcct: Accurate CPU time accounting for hardware-assist...

引用

11th international conference on Parallel and distributed computing, Applications and Technologies, PDCAT 2010

作者： Chen, Huacai Jin, Hai Hu, Kan Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769542874

CPU time accounting is a basis of performance measurement and process scheduling in operating system. Accounting operations are traditionally completed in timer interrupt handler since timer interrupt is periodically delivered to OS. However, when virtualization introduced, the CPU time is shared by multiple virtual CPUs (i.e., VCPU for short) and the virtual timer interrupt is paused for those ones be scheduled out. this makes the time accounting be inaccurate, and we should consider new method for VM to provide a stable and reliable data source, especially for the hardware-assisted virtual machines (i.e., HVM for short) which are not aware of VMM. the key point of accurate CPU time accounting is to distinguish the time allocated to "this VCPU" and "other VCPUs". Para-virtualization (i.e., PV for short) achieves this goal by modifying the timer handling routines. For HVM, we propose an accurate accounting method (named XenHVMAcct) within Xen virtual platform. XenHVMAcct is designed by using the mechanisms of virtual interrupt and loadable kernel module, without direct modifications to guest OS. Experimental results show that our accounting method is as accurate as the PV solution. © 2010 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共276页 << < 195 196 197 198 199 200 201 202 203 204 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：