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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,133 篇 会议
24 篇 期刊文献
20 册 图书

馆藏范围

1,177 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

976 篇 工学
- 909 篇 计算机科学与技术...
- 419 篇 软件工程
- 228 篇 信息与通信工程
- 147 篇 电气工程
- 67 篇 电子科学与技术（可...
- 42 篇 控制科学与工程
- 39 篇 生物工程
- 29 篇 机械工程
- 29 篇 动力工程及工程热...
- 24 篇 测绘科学与技术
- 19 篇 生物医学工程（可授...
- 15 篇 安全科学与工程
- 11 篇 光学工程
- 9 篇 建筑学
- 9 篇 网络空间安全
- 8 篇 仪器科学与技术
- 8 篇 材料科学与工程（可...
- 8 篇 化学工程与技术
210 篇 理学
- 138 篇 数学
- 42 篇 生物学
- 35 篇 系统科学
- 34 篇 统计学（可授理学、...
- 19 篇 物理学
133 篇 管理学
- 98 篇 管理科学与工程(可...
- 62 篇 工商管理
- 43 篇 图书情报与档案管...
17 篇 经济学
- 17 篇 应用经济学
17 篇 农学
- 15 篇 作物学
14 篇 法学
- 10 篇 社会学
13 篇 医学
- 9 篇 临床医学
2 篇 教育学
2 篇 军事学
1 篇 艺术学

主题

36 篇 cloud computing
33 篇 parallel process...
27 篇 parallel computi...
24 篇 network topology
22 篇 neural networks
19 篇 machine learning
17 篇 deep learning
17 篇 network security
16 篇 grid computing
15 篇 scalability
15 篇 computer archite...
15 篇 cluster computin...
14 篇 parallel program...
14 篇 computational mo...
14 篇 network architec...
14 篇 edge computing
13 篇 mapreduce
13 篇 high performance...
12 篇 monitoring
12 篇 topology

机构

17 篇 university of ch...
14 篇 institute of com...
9 篇 national univers...
6 篇 college of compu...
6 篇 shandong univ in...
5 篇 university of sc...
5 篇 school of comput...
5 篇 services computi...
5 篇 college of intel...
4 篇 college of physi...
4 篇 qingdao univ col...
4 篇 school of comput...
4 篇 univ bologna dei...
4 篇 jilin univ coll ...
4 篇 imperial vision ...
4 篇 institute of com...
3 篇 college of compu...
3 篇 national enginee...
3 篇 tsinghua univers...
3 篇 department of co...

作者

14 篇 jin hai
7 篇 li daxing
6 篇 liu yang
6 篇 dvorsky jiri
6 篇 shi xuanhua
6 篇 hsu ching-hsien
6 篇 vojacek lukas
5 篇 qian depei
5 篇 xiao limin
4 篇 man ka lok
4 篇 liu jie
4 篇 drazdilova pavla
4 篇 rossi davide
4 篇 benini luca
4 篇 tan guangming
4 篇 zhang jie
4 篇 daxing li
4 篇 beferull-lozano ...
4 篇 li wei
4 篇 tong tong

语言

1,170 篇 英文
5 篇 中文
3 篇 其他

检索条件"任意字段=8th IFIP International Conference on Network and Parallel Computing"

共 1177 条记录，以下是581-590 订阅

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

详细简洁

排序：

One-to-One Disjoint Path Covers in DCell

One-to-One Disjoint Path Covers in DCell

引用

10th ifip international conference on network and parallel computing (NPC)

作者： Wang, Xi Fan, Jianxi Cheng, Baolei Liu, Wenjun Wang, Yan Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Peoples R China

ISBN: (纸本)9783642408199;9783642408205

DCell has been proposed for one of the most important data center networks as a server centric data center network structure. DCell can support millions of servers with outstanding network capacity and provide good fault tolerance by only using commodity switches. In this paper, we prove that there exist r vertex disjoint paths {P(i vertical bar)1 <= i <= r} between any two distinct vertices u and v of DCell(k) (k >= 0) where r = n + k - 1 and n is the vertex number of DCell(0). the result is optimal because of any vertex in DCell(k) has r neighbors with r = n + k - 1.

关键词： DCell Data Center network Disjoint Path Covers Hamiltonian

来源：评论

学校读者我要写书评

暂无评论

A NAT-ed Peer Organization Model in Kademlia Protocol

A NAT-ed Peer Organization Model in Kademlia Protocol

引用

8th international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Shen, Bingqing Guo, Jingzhi Chen, C. L. Philip Univ Macau Fac Sci & Technol Macau Peoples R China

ISBN: (纸本)9780769550947

Peer-to-peer network and application have boomed for the recent decade. However, network Address Translation (NAT) devices obstruct its wide application by restricting the access to peers from private network. In this paper, we devise a peer strongly connected model to adapt Kademlia protocol to NAT-involved environment to minimize the impact on routine algorithm and meanwhile to make the target system reliable and scalable. Evaluation shows that our organization model highly outperforms existing model in delivery rate and scalability.

关键词： network Address Translate (NAT) NAT Traversal Peer-to-peer (P2P) Peer Organization Kademlia

来源：评论

学校读者我要写书评

暂无评论

A novel method for computing encoding delay and bandwidth on network coding node

A novel method for computing encoding delay and bandwidth on...

引用

2013 IEEE 8th international conference on networking, Architecture and Storage, NAS 2013

作者： Wu, Yuxing Zhang, Xingjun Cen, Song Wang, Li Dong, Xiaoshe Department of Computer Science and Technology Xi'An Jiaotong University Xi'an China

ISBN: (纸本)9780769550343

computing the encoding delay and bandwidth on the nodes is important for the deployment and implementation of network coding. However, the existing researches merely use the methods of experimental measurement or rough estimation to investigate it. In order to accurately compute the delay and bandwidth on the nodes with network coding implemented, this paper proposes a novel method to quantify encoding delay and encoding bandwidth. Firstly, network coding is applied to design a new network. And then, the encoding procedure is systematically investigated on the source node, the intermediate node, and also the decoding procedure is systematically investigated at the destination node. And the method, which can be used to compute the node encoding delay and encoding bandwidth, is presented, thus the method of computing total delay of network with network coding is derived. Finally, the experiments validate the correctness of this method. © 2013 IEEE.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Content-based Switching network: A Flexible Architecture for Future Content Distribution Optical networks

Content-based Switching Network: A Flexible Architecture for...

引用

8th international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Michard, Christophe Tanigawa, Yosuke Tode, Hideki Osaka Prefecture Univ Grad Sch Engn Dept Comp Sci & Intelligent Syst Naka Ku Sakai Osaka 5998531 Japan

ISBN: (纸本)9780769550947

Conventional hybrid networks implement a horizontal separation over the entire network (from edge to edge), which leads to a rigid separation of the resources. In this paper, we propose a network, called Content-based Switching network, whose nodes can flexibly choose their switching paradigm (store-and-forward, optical bypass, electrical bypass) during a path establishment. thanks to this, the network does not have to choose through which plane a content should be transmitted before the transfer. the global architecture and signaling schemes of our proposal are given. Simulation results comparing the Content-based Switching network to an Optical Circuit Switching illustrate its behavior and performances.

关键词： Content-based Switching network Optical network Wavelength Division Multiplexing Hybrid network

来源：评论

学校读者我要写书评

暂无评论

Electrical Energy Aware parallel computing with MPI and CUDA

Electrical Energy Aware Parallel Computing with MPI and CUDA

引用

8th international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Igumenov, Aleksandr Zilinskas, Julius Vilnius State Univ Inst Math & Informat Vilnius Lithuania

ISBN: (纸本)9780769550947

the object of research of the article is environment-friendly technologies that can minimize electrical energy consumption of parallel and distributed computers. the study revealed that even without computations computer clusters consume considerable amount of electrical power. A technique to save electrical energy is proposed to automatically shut down compute nodes when they are not needed for computation, leaving only network cards on waiting for the tasks. When the tasks are assigned, electrical power consumption increases, but not evenly for each core each next core increases consumption of power less than the previous one. therefore for efficient use of electricity computer's cores must be loaded as much as possible, rather than parallel tasks divided among several computers. Graphics processing units consume a lot of electrical power. However their high computational performance makes computing electrical energy efficient when they are used with care.

关键词： energy aware parallel computing GPU CUDA technologies

来源：评论

学校读者我要写书评

暂无评论

A fully distributed resilient routing scheme for switch-based networks

A fully distributed resilient routing scheme for switch-base...

引用

8th international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： thanh Son Pham Carlier, Jacques Lattmann, Joel Lutton, Jean-Luc Nace, Dritan Valeyre, Laurent Orange Lab Issy Les Moulineaux France Univ Technol Compiegne CNRS Lab Heudiasyc UMR 7253 Compiegne France

ISBN: (纸本)9780769550947

this paper proposes a fully distributed scalable resilient routing scheme for virtual networks using switches. the scheme is very easy to implement and does not require global information on the state of the network. Failures are treated purely locally, and the other nodes in the network do not need to know anything about it or to undertake special actions. In contrast to conventional IP routing schemes, each node routes the traffic on the basis of the entering arc and on the destination. We show that this is sufficient for dealing with all single link/node failure situations in the network, assuming that the network is two-link (respectively two-node) connected.

关键词： switching networks telecommunication network routing telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Total Exchange Routing on Hierarchical Dual-Nets

Total Exchange Routing on Hierarchical Dual-Nets

引用

10th ifip international conference on network and parallel computing (NPC)

作者： Li, Yamin Chu, Wanming Hosei Univ Tokyo 1848584 Japan Univ Aizu Aizu Wakamatsu Fukushima Japan

ISBN: (纸本)9783642408199;9783642408205

the hierarchical dual-net (HDN) is a newly proposed interconnection network for massive parallel computers. the HDN is constructed based on a symmetric product graph (base network). A k-level hierarchical dual-net, HDN(B, k, S), contains n(k) = (2n(0))(2k) /(2 Pi(k)(i=1) s(i)) nodes, where S = {G(1)', G(2)', ... , G(k)'}, G(i)' is a super-node and s(i) = vertical bar G(i)'vertical bar is the number of nodes in the super-node at the level i for 1 <= i <= k, and n(0) is the number of nodes in the base network B. the S is used mainly for adjusting the scale of the system. the node degree of HDN(B, k, S) is d(0) + k, where d(0) is the node degree of the base network. the HDN is node and edge symmetric and can contain huge number of nodes with small node-degree and short diameter. the total exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper, we show that the total exchange routing can be done on HDN efficiently.

关键词： interconnection network total exchange routing

来源：评论

学校读者我要写书评

暂无评论

MyCloud: On-Demand Virtual Cluster Provisioning on HPC Resources

MyCloud: On-Demand Virtual Cluster Provisioning on HPC Resou...

引用

15th IEEE international conference on High Performance computing and Communications (HPCC) /11th IEEE/ifip international conference on Embedded and Ubiquitous computing (EUC)

作者： Li, Min Yang, Xin Yu, Ze Li, Xiaolin Univ Florida Scalable Software Syst Lab Gainesville FL 32611 USA

ISBN: (纸本)9780769550886

Advances in the industry are gaining attentions from the scientific computing community. Programming models and frameworks such as MapReduce and Hadoop are attracting scientists due to their easy-to-use interfaces and autonomic parallel processing abilities. Compared with the conventional HPC execution environments, clouds possess desirable features such as administrative privilege, customizable software environments, and are more capable of supporting new frameworks and boosting inter-organization collaborations. Isolated private clouds and public clouds are used by scientists. However, extra administrative and monetary costs are inevitable in both cases. In this paper, we propose MyCloud, a resource management framework integrating cloud-based techniques into HPC systems. MyCloud supports both conventional HPC jobs and cloudlike on-demand virtual cluster provisioning on the same HPC cluster simultaneously. Dynamic resource sharing between the two environments is beneficial for cluster utilization and burst usages handling. the design of MyCloud is friendly to the state-of-the-art Software Defined networking technologies and opens opportunities for fine-grained application-aware network engineering.

关键词： High Performance computing Clouds Resource sharing management of resources Frameworks CLOUDS Virtual

来源：评论

学校读者我要写书评

暂无评论

A Cloud Resource Allocation Mechanism Based on Mean-Variance Optimization and Double Multi-Attribution Auction

A Cloud Resource Allocation Mechanism Based on Mean-Variance...

引用

10th ifip international conference on network and parallel computing (NPC)

作者： Gao, Chengxi Wang, Xingwei Huang, Min Northeastern Univ Coll Informat Sci & Technol Shenyang Peoples R China

ISBN: (纸本)9783642408199;9783642408205

As a new kind of commercial model, cloud computing can integrate various kinds of resources in the network. Resource providers offer these resources to users in the form of service and receive corresponding profits. To make more rational use of the cloud resources, an effective mechanism is necessary for allocating the resources. In this paper, the price attribution and non-price attributions of both traders are analyzed. the support vector machine algorithm is utilized to predict the price, further determining the quote and bid. then, the BP neural network algorithm is used to transfer the non-price attributions to the quality index. Finally, to maximize the total satisfaction of resource providers and resource consumers, the mean-variance optimization algorithm is adopted to obtain the optimized cloud resource allocation scheme. Simulation results have shown that the proposed mechanism is feasible and effective.

关键词： Cloud resource Double multi-attribution auction BP neural network Support vector machine Mean-variance optimization

来源：评论

学校读者我要写书评

暂无评论

Arbor: Efficient Large-Scale Graph Data computing Model

<i>Arbor</i>: Efficient Large-Scale Graph Data Computing Mod...

引用

15th IEEE international conference on High Performance computing and Communications (HPCC) /11th IEEE/ifip international conference on Embedded and Ubiquitous computing (EUC)

作者： Zhou, Wei Li, Bo Han, Jizhong Xu, Zhiyong Chinese Acad Sci Inst Informat Engn Beijing Peoples R China Suffolk Univ Dept Math & Comp Sci Boston MA 02114 USA

ISBN: (纸本)9780769550886

Graph data is the default data organization mechanism used in large-scale Social network Service (SNS) applications. Traditional graph data computing models are used to dig out useful hidden information inside the data. However, the ever growing data volume is adding more and more pressures. To retrieve and discover the information, the system has to introduce a larger number of data iterations. this makes the data analysis operations becoming slower. To speed up these operations on large-scale graph data, recent research works focus on developing efficient parallel iteration processing strategies. However, the synchronization requirements between successive iterations can severely jeopardize the effectiveness of parallel operations. In this paper, we propose a novel large-scale graph data processing model, Arbor, to address these issues. Arbor substitutes time-constrained synchronization operations with non-time-constrained control message transmissions to increase the degree of parallelism. Furthermore, it develops a new graph data organization format, which can not only save storage space, but also accelerate graph data processing operations. We compare Arbor with other graph processing models using a large-scale experimental graph data, and the results show that it outperforms the state-of-the-art systems.

关键词： graph data graph data processing graph query graph aggregation graph analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 55 56 57 58 59 60 61 62 63 64 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：