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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,364 篇 工学
- 1,234 篇 计算机科学与技术...
- 550 篇 软件工程
- 241 篇 信息与通信工程
- 219 篇 电气工程
- 74 篇 控制科学与工程
- 50 篇 电子科学与技术（可...
- 43 篇 生物工程
- 34 篇 机械工程
- 26 篇 动力工程及工程热...
- 22 篇 仪器科学与技术
- 21 篇 力学（可授工学、理...
- 20 篇 建筑学
- 19 篇 土木工程
- 18 篇 生物医学工程（可授...
- 15 篇 材料科学与工程（可...
- 15 篇 安全科学与工程
- 14 篇 化学工程与技术
- 13 篇 石油与天然气工程
329 篇 理学
- 227 篇 数学
- 55 篇 物理学
- 51 篇 生物学
- 29 篇 系统科学
- 28 篇 统计学（可授理学、...
- 20 篇 化学
213 篇 管理学
- 157 篇 管理科学与工程(可...
- 66 篇 图书情报与档案管...
- 49 篇 工商管理
71 篇 医学
- 62 篇 临床医学
15 篇 法学
- 13 篇 社会学
14 篇 经济学
- 14 篇 应用经济学
9 篇 文学
8 篇 教育学
6 篇 农学
1 篇 军事学

主题

108 篇 distributed comp...
79 篇 parallel process...
76 篇 distributed comp...
61 篇 cloud computing
51 篇 parallel computi...
44 篇 computational mo...
41 篇 parallel program...
39 篇 computer archite...
35 篇 distributed data...
34 篇 fault tolerance
29 篇 concurrent compu...
29 篇 middleware
28 篇 parallel algorit...
28 篇 mapreduce
28 篇 parallel process...
26 篇 resource managem...
25 篇 application soft...
25 篇 big data
24 篇 wireless sensor ...
24 篇 protocols

机构

14 篇 saint petersburg...
7 篇 chinese acad sci...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
5 篇 plekhanov russia...
4 篇 saint petersburg...
4 篇 harbin inst tech...
4 篇 meshcheryakov la...
4 篇 centre for distr...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 st petersburg st...
4 篇 science and tech...
3 篇 huazhong univ sc...
3 篇 joint institute ...
3 篇 king saud univer...
3 篇 department of co...
3 篇 university of el...

作者

17 篇 zomaya albert y.
10 篇 bogdanov alexand...
10 篇 shen hong
9 篇 korkhov vladimir
8 篇 degtyarev alexan...
8 篇 albert y. zomaya
6 篇 li y
6 篇 taheri javid
5 篇 dustdar schahram
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 kutovskiy nikola...
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 sousa leonel
5 篇 gankevich ivan
5 篇 rothermel kurt
4 篇 jerzy waśniewski
4 篇 leung k.

语言

1,704 篇 英文
40 篇 其他
18 篇 中文
9 篇 俄文

检索条件"任意字段=9th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1770 条记录，以下是911-920 订阅

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

详细简洁

排序：

Scalable distributed Fast Multipole Methods

Scalable Distributed Fast Multipole Methods

引用

14th IEEE international conference on High Performance computing and Communications (HPCC) / IEEE 9th international conference on Embedded Software and Systems (ICESS)

作者： Hu, Qi Gumerov, Nail A. Duraiswami, Ramani Univ Maryland Inst Adv Comp Studies UMIACS College Pk MD 20742 USA

ISBN: (纸本)9780769547497

the Fast Multipole Method (FMM) allows O(N) evaluation to any arbitrary precision of N-body interactions that arises in many scientific contexts. these methods have been parallelized, with a recent set of papers attempting to parallelize them on heterogeneous CPU/GPU architectures [1]. While impressive performance was reported, the algorithms did not demonstrate complete weak or strong scalability. Further, the algorithms were not demonstrated on nonuniform distributions of particles that arise in practice. In this paper, we develop an efficient scalable version of the FMM that can be scaled well on many heterogeneous nodes for nonuniform data. Key contributions of our work are data structures that allow uniform work distribution over multiple computing nodes, and that minimize the communication cost. these new data structures are computed using a parallel algorithm, and only require a small additional computation overhead. Numerical simulations on a heterogeneous cluster empirically demonstrate the performance of our algorithm.

关键词： fast multipole methods GPGPU N-body simulations heterogeneous algorithms scalable algorithms parallel data structures

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 14th IEEE international conference on High Performance computing and Communications, HPCC-2012 - 9th IEEE international conference on Embedded Software and Systems, ICESS-2012

Proceedings of the 14th IEEE International Conference on Hig...

引用

14th IEEE international conference on High Performance computing and Communications, HPCC-2012 - 9th IEEE international conference on Embedded Software and Systems, ICESS-2012

ISBN: (纸本)9780769547497

the proceedings contain 264 papers. the topics discussed include: analytical assessment of the suitability of multicast communications for the SpiNNaker neuromimetic system;exploring potential parallelism of sequential programs with superblock reordering;a parallel multi-core team of multiobjective evolutionary algorithms to discover DNA motifs;fully distributed on-chip instruction memory design for stream architecture based on field-divided VLIW compression;parallel speculative DOM-based XML parser;implementation of motion estimation based on heterogeneous parallel computing system with OpenCL;a parallel multiobjective artificial bee colony algorithm for dealing with the traffic grooming problem;space-efficient sparse matrix storage formats for massively parallel systems;architectural support for exploiting fine grain parallelism;and MHPM: multi-scale hybrid programming model: a flexible parallelization methodology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Effect of Traffic Locality on Power Consumption of distributed computing Network with a Data Center

Effect of Traffic Locality on Power Consumption of Distribut...

引用

9th international conference on Communications (COMM)

作者： Ogawa, Yukio Hasegawa, Go Murata, Masayuki Hitachi Ltd Telecommun & Network Syst Div Tokyo Japan Osaka Univ Grad Sch Informat Sci & Technol Suita Osaka Japan

ISBN: (纸本)9781467325738

A distributed computing network (DCN), such as a content delivery network, not only improves the response time to clients but also reduce the traffic from/to the data center over a wide area network (WAN), thereby decreasing the power consumed in the WAN. In this paper, we focus on the energy-saving aspect of the DCN and evaluate its effectiveness, especially considering traffic locality, i.e., the amount of traffic related to the geographical vicinity. Numerical evaluations show that the DCN has a small advantage when the traffic has no locality. Meanwhile, when there is strong traftic locality, the system's power consumption is reduced to 64 tic of the power consumption in the case where a DCN is not used.

关键词： WAN power consumption distributed computing network traffic locality energy saving

来源：评论

学校读者我要写书评

暂无评论

A distributed SVM ensemble for image classification and annotation

A distributed SVM ensemble for image classification and anno...

引用

2012 9th international conference on Fuzzy Systems and Knowledge Discovery, FSKD 2012

作者： Alham, Nasullah Khalid Li, Maozhen Liu, Yang Ponraj, Mahesh Qi, Man School of Engineering and Design Brunel University Uxbridge UB8 3PH United Kingdom Key Laboratory of Embedded Systems and Service Computing Ministry of Education Tongji University China Department of Computing Canterbury Christ Church University Canterbury-Kent CT1 1QU United Kingdom

ISBN: (纸本)9781467300223

Combination of classifiers leads to a substantial reduction of classification errors in a wide range of applications. Among them SVM ensembles with bagging have shown better performance in classification than a single SVM. However, the training process of SVM ensembles is notably computationally intensive especially when the number of replicated training datasets is large. this paper presents MRESVM, a MapReduce based distributed SVM ensemble algorithm for image annotation which re-samples the training dataset based on bootstrapping and trains SVM on each dataset in parallel using a cluster of computers. MRESVM is evaluated in a experimental environment and the results show that the MRESVM algorithm reduces the training time significantly while achieves high level of accuracy in classifications. © 2012 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Application specific hardware architecture for high-throughput short-length LDPC decoders

Application specific hardware architecture for high-throughp...

引用

IEEE international conference on Intelligent Computer Communication and Processing

作者： Bogdan Belean Sergiu Nedevschi Monica Borda National Institute for R&D of Isotopic and Molecular Technologies INCDTIM Computer Science Dept. Technical University of Cluj-Napoca Communication Dept. Technical University of Cluj-Napoca

ISBN: (纸本)9781479914920

LDPC codes have been intensively used in various wireless communication applications, due to their increased BER performance. the present paper summarizes the state of the art applications of short length LDPC codes and proposes FPGA based application specific hardware architectures for short-length LDPC decoders. the decoding algorithms considered for implementation are both belief propagation and min-sum algorithm. Due to the increased BER performances, the proposed architecture make use of parallel computation capabilities offered by FPGA technology in order to implement the belief propagation algorithm. In spite of the iterative nature and increased computational complexity of the LDPC decoding algorithm, the proposed architecture achieves high-throughput, mandatory in real-time application and data transmission. the architecture for the LDPC belief propagation based decoder is based on arctangent hyperbolic function approximation used for check nodes update.

关键词： LDPC codes FPGA Decoding algorithms Hardware implementations parallel computing

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient Support for parallel I/O in Java HPC

Towards Efficient Support for Parallel I/O in Java HPC

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Awan, Ammar Ahmad Ayub, Muhammad Sohaib Shafi, Aamir Lee, Sungyoung Kyung Hee Univ Dept Comp Engn Yongin South Korea Natl Univ Sci & Technol SEECS Islamabad Pakistan

ISBN: (纸本)9780769548791

Modern HPC applications put forward significant I/O requirements. To deal with them, MPI provides the MPI-IO API for parallel file access. ROMIO library implements MPI-IO and provides efficient support for parallel I/O in C and Fortran based applications. On the other hand, Java based MPI-like libraries such as MPJ Express and F-MPJ have emerged but they lack parallel I/O support. Little research has been done to provide Java based ROMIO-like libraries due to the non-availability of MPI-IO-like API for the Java language. In this paper, we take the first step towards the development of parallel I/O API in Java by evaluating the newly introduced Java NIO API versus the legacy Java I/O API. We propose two simple approaches for performing parallel file I/O using NIO and evaluate them on two different computational platforms. the implementation of proposed approaches exploits the view buffers concept of NIO API to perform efficient array based file I/O operations from multiple processes. We report encouraging speedups and suggest that design of a parallel I/O API in Java should be based on the NIO API.

关键词： Performance Evaluation parallel I/O in Java MPJ Express MPI-I/O

来源：评论

学校读者我要写书评

暂无评论

EFFICIENTLY PRESERVING DATA-PRIVACY RANGE QUERIES IN TWO-TIERED WIRELESS SENSOR NETWORKS

EFFICIENTLY PRESERVING DATA-PRIVACY RANGE QUERIES IN TWO-TIE...

引用

IEEE 9th international conference on Ubiquitous Intelligence and computing (UIC) / IEEE 9th international conference on Autonomic and Trusted computing (ATC)

作者： Nguyen, thuc D. Bui, thach V. Dang, Van H. Choi, Deokjai Univ Sci Fac Informat Technol Ho Chi Minh City Vietnam Chonnam Natl Univ Dept Comp Sci Gwangju South Korea

ISBN: (纸本)9780769548432;9781467330848

Wireless Sensor Networks (WSNs) gain popularity these days. WSNs have been one of key technologies for the future with broad applications from the military to everyday life. there are two kinds of WSNs model models with sensors for sensing data and a server for receiving and processing queries from users;and models with special additional nodes, their common names are storage nodes, between the sensors and the sink. Among the latter type, a two-tiered model has been widely adopted because of its storage and energy saving benefits for weak sensors, as proved by the advent of commercial storage node products such as Stargate and RISE. In this paper, we consider two-tiered WSNs model that consists of sensor nodes receiving data from the environment and transferred to storage nodes, the queries from the server will be done through these storage nodes. In this model, the problem is how to ensure privacy of data at the storage nodes, which is mostly located in the hostile area. Data encryption is the popular solution to make the unreadable for storage node. However, if the server needs data in the range, then storage node must read the data to reply server's query. In order to solve this problem, we proposed to use a d-disjunct matrix, an order-preserving function and a permutation function that encode data of each sensor. An order-preserving function is used to query. Simultaneously, the permutation function and d-disjunct matrix will be used to encrypt data and determine the exact frequency of any value. With this approach, we have proved that our solution guarantees to preserve data-privacy while allowing the range query efficiently. In particular, it just takes less than 60 seconds when we encrypt or query less than 200000 values.

关键词： Servers Range searching Data privacy Sensors Ganglia Wireless sensor networks Permutation Future technologies RISE Vernacular names Storage

来源：评论

学校读者我要写书评

暂无评论

Exploring Potential parallelism of Sequential Programs with Superblock Reordering

Exploring Potential Parallelism of Sequential Programs with ...

引用

14th IEEE international conference on High Performance computing and Communications (HPCC) / IEEE 9th international conference on Embedded Software and Systems (ICESS)

作者： Ye, John M. Chen, Tianzhou Zhejiang Univ Coll Comp Sci Intel Technol Ctr Hangzhou 310003 Zhejiang Peoples R China

ISBN: (纸本)9780769547497

the growing number of processing cores in a single CPU is demanding more parallelism from sequential programs. But in the past decades few work has succeeded in automatically exploiting enough parallelism, which casts a shadow over the many-core architecture and the automatic parallelization research. However, actually few work was tried to understand the nature, inner structure, or amount, of the potentially available parallelism in programs. In this paper we will try to analyze at runtime the dynamic data dependencies among superblocks of sequential programs. We designed a Meta Reorder Buffer (Meta-RB) to measure and exploit the available parallelism, with which the superblocks are dynamically analyzed, reordered and dispatched to run in parallel on an ideal many-core processor, and the data dependencies and program correctness are still maintained. In our experiments, we observed that with the superblock reordering, the potential speedup ranged from 1.627 to 95.275, and reached 22.852 on average. the results shows that the potential parallelism of normal programs is still far from fully exploited by existing technologies, which makes the automatic parallelization a promising research direction for many-core architectures.

关键词： parallel computing automatic parallelization many-core parallelism measurement

来源：评论

学校读者我要写书评

暂无评论

parallel IMPLEMENTATION OF LBP BASED FACE RECOGNITION ON GPU USING OPENCL

PARALLEL IMPLEMENTATION OF LBP BASED FACE RECOGNITION ON GPU...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Dwith, C. Y. N. Rathna, G. N. Natl Inst Technol Dept Elect & Commun Engn Warangal Andhra Pradesh India Indian Inst Sci Dept Elect Engn Bangalore Karnataka India

ISBN: (纸本)9780769548791

In this paper, we implement a novel parallelized approach of Local Binary Pattern (LBP) based face recognition algorithm on GPU. High performance rates have been achieved through maximizing the resource exploitation available in the GPU. the launch of GPU programming tools like Open source Computation Language (OpenCL) and (CUDA) have boosted the development of various applications on GPU. In this paper we implement a parallelized LBP algorithm on GPU using OpenCL programming tools. Programs developed under the OpenCL enable us to utilize GPU for general purpose computation with increased performance efficiency in terms of execution time. the experimental results based on the implementation on AMD 6500 GPU processor are observed to increase the computational performance of the system by to 30 folds in case of 1024x1024 images. the relative computational efficiency increases with increase in the size of the Image. this paper addresses several parallelization problems related to memory access and updating, divergent execution paths, understanding and realizing the OpenCL's concurrency and Execution models.

关键词： GPU OpenCL Face recognition Local Binary Patter

来源：评论

学校读者我要写书评

暂无评论

Managing Communication Latency-Hiding at Runtime for parallel Programming Languages and Libraries

Managing Communication Latency-Hiding at Runtime for Paralle...

引用

14th IEEE international conference on High Performance computing and Communications (HPCC) / IEEE 9th international conference on Embedded Software and Systems (ICESS)

作者： Kristensen, Mads Ruben Burgdorff Vinter, Brian Univ Copenhagen Niels Bohr Inst DK-1168 Copenhagen Denmark

ISBN: (纸本)9780769547497

this work introduces a runtime model for managing communication with support for latency-hiding. the model enables non-computer science researchers to exploit communication latency-hiding techniques seamlessly. For compiled languages, it is often possible to create efficient schedules for communication, but this is not the case for interpreted languages. By maintaining data dependencies between scheduled operations, it is possible to aggressively initiate communication and lazily evaluate tasks to allow maximal time for the communication to finish before entering a wait state. We implement a heuristic of this model in DistNumPy, an auto-parallelizing version of numerical Python that allows sequential NumPy programs to run on distributed memory architectures. Furthermore, we present performance comparisons for six benchmarks with and without automatic latency-hiding. the results shows that our model reduces the time spent on waiting for communication as much as 27 times, from a maximum of 54% to only 2% of the total execution time, in a stencil application.

关键词： HPC Latency-Hiding Python

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 88 89 90 91 92 93 94 95 96 97 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：