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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,317 篇 会议
46 篇 期刊文献
30 册 图书

馆藏范围

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

日期分布

学科分类号

1,393 篇 工学
- 1,180 篇 计算机科学与技术...
- 600 篇 软件工程
- 296 篇 信息与通信工程
- 175 篇 电气工程
- 101 篇 控制科学与工程
- 97 篇 电子科学与技术（可...
- 59 篇 动力工程及工程热...
- 55 篇 机械工程
- 41 篇 仪器科学与技术
- 31 篇 生物工程
- 26 篇 网络空间安全
- 25 篇 生物医学工程（可授...
- 21 篇 建筑学
- 16 篇 环境科学与工程（可...
- 16 篇 安全科学与工程
- 15 篇 光学工程
- 15 篇 土木工程
357 篇 管理学
- 290 篇 管理科学与工程(可...
- 99 篇 图书情报与档案管...
- 95 篇 工商管理
327 篇 理学
- 195 篇 数学
- 63 篇 物理学
- 63 篇 系统科学
- 44 篇 生物学
- 30 篇 统计学（可授理学、...
- 15 篇 化学
26 篇 经济学
- 26 篇 应用经济学
23 篇 法学
- 18 篇 社会学
15 篇 农学
- 14 篇 作物学
15 篇 医学
- 14 篇 临床医学
10 篇 文学
2 篇 艺术学
1 篇 军事学

主题

275 篇 peer to peer com...
237 篇 distributed comp...
203 篇 computer network...
176 篇 wireless sensor ...
132 篇 protocols
131 篇 grid computing
120 篇 cloud computing
107 篇 computational mo...
102 篇 routing
91 篇 delay
89 篇 computer archite...
88 篇 mobile computing
87 篇 servers
81 篇 algorithm design...
79 篇 ad hoc networks
78 篇 mobile communica...
77 篇 bandwidth
75 篇 concurrent compu...
75 篇 network topology
68 篇 computer science

机构

22 篇 institute of com...
16 篇 institute of com...
10 篇 national laborat...
8 篇 school of comput...
8 篇 school of comput...
8 篇 graduate univers...
8 篇 school of comput...
8 篇 school of comput...
7 篇 national laborat...
7 篇 seikei universit...
7 篇 key laboratory o...
6 篇 department of co...
6 篇 rissho universit...
6 篇 national laborat...
6 篇 chinese academy ...
5 篇 key laboratory o...
5 篇 graduate univers...
4 篇 inria
4 篇 department of ma...
4 篇 nokia research c...

作者

8 篇 kurt rothermel
7 篇 zhang desheng
7 篇 makoto takizawa
7 篇 valentin cristea
7 篇 rothermel kurt
6 篇 zomaya albert y.
6 篇 li jinbao
6 篇 ailixier aikebai...
6 篇 frank dürr
5 篇 wei liu
5 篇 tang tao
5 篇 lin yisong
5 篇 min geyong
5 篇 tomoya enokido
5 篇 jin hai
5 篇 guo longjiang
5 篇 kai xiang
5 篇 jiannong cao
4 篇 qishi wu
4 篇 zhang lei

语言

2,386 篇 英文
5 篇 中文
2 篇 其他

检索条件"任意字段=2010 International Conference on Parallel and Distributed Computing and Networks, PDCN 2010"

共 2393 条记录，以下是241-250 订阅

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

详细简洁

排序：

An algorithm to construct FP-Tree on VODCA

An algorithm to construct FP-Tree on VODCA

引用

2010 international conference on Intelligent Computation Technology and Automation, ICICTA 2010

作者： Tong, Yongmu Zheng, Xiaoyan Tianjin University of Technology and Education Tianjin 300222 China

ISBN: (纸本)9780769540771

To construct FP-Tree in mining frequent pattern, we propose a parallel algorithm CFPV (Construct FP-Tree on VODCA) for construct FP-Tree. This method is based on a new parallel computing environment on the distributed shared memory, called View-Oriented, distributed, Cluster-based Approach to parallel computing (VODCA). It discusses the fact of views division and the results when generate FP-Tree on VODCA, and discusses the dynamic task allocation strategy of the algorithm. The experimental results prove the correctness and effectiveness of CFPV algorithm. © 2010 IEEE.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

A two-key agreement based supervising mechanism for cluster-based peer-to-peer applications

A two-key agreement based supervising mechanism for cluster-...

引用

16th IEEE international conference on parallel and distributed Systems, ICPADS 2010

作者： Huang, Chun-Chieh Lo, Chi-Chun Institute of Information Management National Chiao Tung University Hsinchu Taiwan

ISBN: (纸本)9780769543079

Peer-to-Peer (P2P) technologies are developing rapidly and have gained popularity. The application of P2P to areas such as file sharing, collaborative business environment, and distributed computing requires secure communication among the nodes. Cluster-based P2P structure provides an efficient way to do file sharing and distributed computing. A key agreement protocol is a set of communication rules whereby two users establish a shared common key. The shared key is used by users in future secure communications. Supervising services for governing communications between two nodes is an important topic, especially in the area of government affairs. The proposed paper provides a framework for supporting a supervising mechanism in cluster-based P2P networks based on the concept of two-key agreement protocol. This mechanism uses the idea of hash-based two-key agreement protocol to help the nodes in higher level supervise the nodes in lower level for cluster-based P2P communication environment. In the proposed paper, a global cluster head supervises the whole network, cluster heads in each cluster supervise their own clusters' communications. Security analyses show that the proposed mechanism is secure enough for P2P. Any two nodes within the same cluster generate their common session key by themselves. In the same cluster, no nodes gain this session key except the cluster head. Moreover, there are only two kinds of operations, hash operation and XOR operation, in the proposed mechanism. Hence, the proposed mechanism provides an efficient way to supervise the P2P network. © 2010 IEEE.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

Mobile and Ubiquitous computing 16th

Mobile and Ubiquitous Computing

引用

16th international Euro-Par conference on parallel Processing

作者： Schiele, Gregor De Pietro, Giuseppe Al-Muhtadi, Jalal Yu, Zhiwen University of Mannheim Germany ICAR-CNR Italy King Saud University Saudi Arabia Polytechnical University Hong Kong

ISBN: (纸本)9783642152900

The tremendous advances in wireless networks, mobile computing, sensor networks along with the rapid growth of small, portable and powerful computing devices offers opportunities for pervasive computing and communications. Topic 14 deals with cutting-edge research in various aspects related to the theory or practice of mobile computing or wireless and mobile networking, including architectures, algorithms, networks, protocols, modeling and performance, applications, services, and data management. © 2010, Springer-Verlag Berlin Heidelberg.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

VON/KVM: A high performance virtual overlay network integrated with KVM

VON/KVM: A high performance virtual overlay network integrat...

引用

2010 international conference on Apperceiving computing and Intelligence Analysis, ICACIA 2010

作者： Tang, Yuan Li, Jian-Ping School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China International Centre for Wavelet Analysis and Its Applications Logistical Engineering University Chongqing 400016 China

ISBN: (纸本)9781424480265

The virtual computing environments integrated with virtual machines (VMs) and virtual overlay ne tworks play an important role in distributed computing and cloud computing. Overlay network with a layer 2 abstraction provides a powerful model for virtualized wide-area distributed computing resources on collections of virtual machines (VMs). However, the performance of existing virtual overlay network can not support the high-performance distributed computing. In this paper, we describe the design and implementation of a virtual overlay network system that has negligible latency and bandwidth in LAN networks. Our system, VON/KVM, is integrated with KVM (Kernel-based Virtual Machine), an open-sourced virtual machine monitor (VMM). VON/KVM achieves native performance and negligible overheads on 1 Gbps Ethernet networks. © 2010 IEEE.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

The failure trace archive: Enabling comparative analysis of failures in diverse distributed systems 10

The failure trace archive: Enabling comparative analysis of ...

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Kondo, Derrick Javadi, Bahman Iosup, Alexandru Epema, Dick INRIA France TU Delft Netherlands

ISBN: (纸本)9781424469871

With the increasing functionality and complexity of distributed systems, resource failures are inevitable. While numerous models and algorithms for dealing with failures exist, the lack of public trace data sets and tools has prevented meaningful comparisons. To facilitate the design, validation, and comparison of fault-tolerant models and algorithms, we have created the Failure Trace Archive (FTA) as an online public repository of availability traces taken from diverse parallel and distributed systems. Our main contributions in this study are the following. First, we describe the design of the archive, in particular the rationale of the standard FTA format, and the design of a toolbox that facilitates automated analysis of trace data sets. Second, applying the toolbox, we present a uniform comparative analysis with statistics and models of failures in nine distributed systems. Third, we show how different interpretations of these data sets can result in different conclusions. This emphasizes the critical need for the public availability of trace data and methods for their analysis. © 2010 IEEE.

关键词： Online systems

来源：评论

学校读者我要写书评

暂无评论

A Refined distributed parallel Algorithm For The Eigenvalue Problem Of Large-scale Matrix

A Refined Distributed Parallel Algorithm For The Eigenvalue ...

引用

2010 3rd international conference on Biomedical Engineering and Informatics (BMEI 2010)

作者： Zhao, Lu Zhuang, Yi Liu, Yi Ni, Tian Quan Nanjing Univ Aeronaut & Astronaut Coll Informat Sci & Technol Nanjing 210016 Peoples R China Nanjing Univ Aeronaut & Astronaut Coll Aerosp Engn Nanjing 210016 Peoples R China Tongji Univ Coll Aerosp Engn & Appl Mech Shanghai 200092 Peoples R China China Shipbldg Ind Corp Inst 723 Yangzhou 225001 Jiangsu Peoples R China

ISBN: (纸本)9781424464968

In view of eigenvalue problems of large-scale matrix, this paper proposes a refined distributed parallel algorithm named RDPC-DTM based on direct transformation method and DPC-DTM algorithm which is a distributed parallel design of direct transformation method. This new method solves the problem that increasing the number of substructure could not effectively enhance the computing efficiency when the scale of matrix is too large. Numerical experiment proves that RDPC-DTM is more efficient than DPC-DTM, especially when calculating eigenvalue of super large-scale matrix. Numerical experiment also demonstrates that RDPC-DTM has higher degree of parallelism and is more suitable for cluster or MPP parallel computer compared to DPC-DTM.

关键词： eigenvalue problem substructure method finite element distributed parallel algorithm Subspace iteration algorithm mode synthesis

来源：评论

学校读者我要写书评

暂无评论

Efficient Strategies for Many-task Frequent Pattern Mining in Cloud computing Environments

Efficient Strategies for Many-task Frequent Pattern Mining i...

引用

IEEE international conference on Systems, Man and Cybernetics

作者： Lin, Kawuu W. Luo, Yu-Chin Natl Kaohsiung Univ Appl Sci Dept Comp Sci & Informat Engn Kaohsiung 807 Taiwan

ISBN: (纸本)9781424465880

The goal of data mining is to discover the hidden useful information from large databases. Mining frequent patterns from transaction databases is an important problem in data mining field. As the size of database increases, the computation time and the required memory increase severely. parallel and distributed computing techniques have attracted extensive attentions on the ability to manage and compute the significant amount of data in the past decades. The difficulty of mining large database launched the research of designing parallel and distributed algorithms to solve the problem. However, most of the past studies did not focus on the many-task issue that is very important, especially in cloud computing environments. In cloud computing environments, application is provided as service like Google search engine, meaning that it will be used by many users at the same time. In this paper, we propose a set of strategies for many-task frequent pattern mining. Through empirical evaluations on various simulation conditions, the proposed strategies deliver excellent performance in terms of execution time.

关键词： Data mining cloud computing association rule mining frequent pattern mining

来源：评论

学校读者我要写书评

暂无评论

Rupeas: Ruby powered event analysis DSL

Rupeas: Ruby powered event analysis DSL

引用

international conference on Networked Sensing Systems

作者： Woehrle, Matthias Plessl, Christian Thiele, Lothar Computer Engineering and Networks Lab ETH Zurich Switzerland Paderborn Center for Parallel Computing University of Paderborn Germany

ISBN: (纸本)9781424479108

Wireless Sensor networks (WSNs) are unique embedded computer systems for distributed sensing of a dispersed phenomenon. As WSNs are deployed in remote locations for longterm unattended operation, assurance of correct functioning of the system is of prime concern. Thus, the design and development of WSNs requires specialized tools to allow for testing. To this end, we present a novel language, Rupeas, for analyzing WSNs based on collected events during system operation. Rupeas is independent from test specifics and thus generally applicable for analyzing event logs of WSN test executions. © 2010 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A bi-criteria algorithm for scheduling parallel task graphs on clusters 10

A bi-criteria algorithm for scheduling parallel task graphs ...

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Desprez, Frédéric Suter, Frédéric INRIA LIP ENS Lyon Lyon France IN2P3 Computing Center CNRS/IN2P3 Lyon-Villeurbanne France

ISBN: (纸本)9781424469871

Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a long-standing challenge. In the case of a single homogeneous cluster, most of the existing algorithms focus on the reduction of the application completion time (makespan). But in presence of resource managers such as batch schedulers and due to accentuated pressure on energy concerns, the produced schedules also have to be efficient in terms of resource usage. In this paper we propose a novel bi-criteria algorithm, called biCPA, able to optimize these two performance metrics either simultaneously or separately. Using simulation over a wide range of experimental scenarios, we find that biCPA leads to better results than previously published algorithms. © 2010 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel scheduling for distributed heterogeneous resources in multi-domain optical network

Parallel scheduling for distributed heterogeneous resources ...

引用

2010 3rd IEEE international conference on Broadband Network and Multimedia Technology, IC-BNMT2010

作者： Zhang, Kai Wang, Hongxiang Ji, Yuefeng Key Laboratory of Information Photonics and Optical Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing 100876 China

ISBN: (纸本)9781424467709

As the amount of services and users is increasing rapidly, the traditional optical network is evolved to multi-layer and multi-domain optical networks. A key research point in such a distributed environment is how to scheduling various resources effectively. For this reason, a parallel scheduling strategy for heterogeneous resources in multi-domain optical networks was proposed in this paper. Proposed scheme support parallel scheduling of heterogeneous resources with different QoS requirements, and improves scheduling flexibility and reliability therefore. It offers a parallel strategy to search and schedule resources combining with setting up the optical path. Proposed strategy is deployed in a distributed optical network test-bed and the experimental results show that heterogeneous resources in multidomain networks can be scheduled parallel. © 2010 IEEE.

关键词： Fiber optic networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：