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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

13 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

11 篇 工学
- 11 篇 计算机科学与技术...
- 5 篇 软件工程
- 2 篇 电气工程
- 2 篇 电子科学与技术（可...
- 1 篇 机械工程
- 1 篇 交通运输工程
4 篇 理学
- 3 篇 数学
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 统计学（可授理学、...
1 篇 经济学
- 1 篇 应用经济学
1 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

1 篇 random walk
1 篇 graphs
1 篇 computer science...
1 篇 software enginee...
1 篇 hadoop distribut...
1 篇 supercomputers
1 篇 sorting
1 篇 testbeds
1 篇 discrete event s...
1 篇 parallel program...
1 篇 system performan...
1 篇 database managem...
1 篇 inverse influenc...
1 篇 1. high performa...
1 篇 costs
1 篇 personalized pag...
1 篇 bayesian inferen...
1 篇 network-on-chip
1 篇 finite element m...
1 篇 computer systems...

机构

1 篇 department of co...
1 篇 rechen- und komm...
1 篇 university of te...
1 篇 dipartimento di ...
1 篇 universitat poli...
1 篇 siam univ grad s...
1 篇 llnl
1 篇 sultan qaboos un...
1 篇 technology of so...
1 篇 tennessee tech u...
1 篇 inria mescal res...
1 篇 university of in...
1 篇 rwth aachen univ...
1 篇 tsinghua nationa...
1 篇 department of co...
1 篇 department of co...
1 篇 politecnico di t...
1 篇 huawei technol u...
1 篇 inria mescal res...
1 篇 jordan universit...

作者

1 篇 khan omar
1 篇 graffi kalman
1 篇 montrucchio bart...
1 篇 wei zane
1 篇 michael alexande...
1 篇 wang kai
1 篇 dieter mey
1 篇 liu siping
1 篇 carsten clauss
1 篇 rogers gary l.
1 篇 zhang shujie
1 篇 alexandru costan
1 篇 khan fiaz gul
1 篇 randrianarivony ...
1 篇 julio sahuquillo
1 篇 zheng da
1 篇 wu quanyuan
1 篇 liu hao
1 篇 vittorio scarano
1 篇 vajteršic marián

语言

14 篇 英文

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

共 14 条记录，以下是1-10 订阅

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

详细简洁

排序：

iasted Multiconferences - Proceedings of the iasted international conference on parallel and distributed computing and networks, pdcn 2013

IASTED Multiconferences - Proceedings of the IASTED Internat...

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

ISBN: (纸本)9780889869431

the proceedings contain 18 papers. the topics discussed include: case study on storage characteristics of hadoop;investigating operating system noise in extreme-scale high-performance computing systems using simulation;managing large scale experiments in distributed testbeds;a parallel algorithm for nonnegative matrix factorization based on Newton iteration;parallel butterfly sorting algorithm on GPU;halo-free design for retinex based real-time video enhancement system;performance enhancement of map-reduce framework on GPU;mining cloud environments usage data;parallel processing of analytical Poisson-Boltzmann using higher order FEM;deriving a multi-level program model for efficient parallelization on heterogeneous platforms;and regulate my appetite according to dishes: a distributed on-line optimal stopping web service selection scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel processing of analytical poisson-boltzmann using higher order FEM

Parallel processing of analytical poisson-boltzmann using hi...

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

作者： Randrianarivony, Maharavo Institute for Numerical Simulation University of Bonn Wegelerstrasse 6 Bonn 53115 Germany

ISBN: (纸本)9780889869431

We focus on the efficient parallel processing of meshes from biomolecular data so that they can be subsequently used for FEM simulation. All mesh processing about refinements and coherent indexations are applied in parallel. the simplices of the mesh are needed for the application in FEM having higher polynomial degrees. For biomolecular data, the only inputs are the atom coordinates, the van der Waals radii and the probe radius. Our principal goal is to obtain data which are well balanced among the different processors. To corroborate the parallel mesh processing, we show some application to FEM simulation. For that, we consider the parallel FEM of the linearized Poisson- Boltzmann problem. We compare the FEM numerical results with known theoretical prediction to validate the accuracy of the parallel implementation.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

parallel gauss-seidel on a torus NOC architecture

Parallel gauss-seidel on a torus NOC architecture

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

作者： Day, Khaled Al-Towaiq, Mohammad H. Sultan Qaboos University P.O. Box 36 Al-Khod 123 Oman Jordan University of Science and Technology B. O. Box 3030 Irbid 22110 Jordan

ISBN: (纸本)9780889869431

We propose a parallel Gauss-Seidel (GS) iterative algorithm for solving large systems of linear equations on a 2D torus network-con-chip (NoC) architecture. the proposed parallel algorithm is of O(Nn2/k2) time complexity for solving a system with matrix of order n on a k×k torus NoC architecture requiring N iterations assuming n and N are large compared to k (i.e. for large linear systems that require a large number of iterations). We show that under these conditions the proposed parallel GS algorithm has near optimal speedup and efficiency.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for nonnegative matrix factorization based on newton iteration

A parallel algorithm for nonnegative matrix factorization ba...

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

作者： Flatz, Markus Vajteršic, Marián Department of Computer Sciences University of Salzburg Salzburg Austria

ISBN: (纸本)9780889869431

Nonnegative Matrix Factorization (NMF) is a technique to approximate a nonnegative matrix as a product of two smaller nonnegative matrices. the guaranteed nonnegativity of the factors allows interpreting the approximation as an additive combination of features, a distinctive property that other widely used matrix factorization methods do not have. Several advanced methods for computing this factorization exist, in this paper, we will focus on an algorithm based on Newton iteration. It was adapted for parallel execution on computer clusters, utilizing the message passing communication paradigm. Results of multiple experiments, which were run on a system with up to 80 processor cores, will be presented. We used images as input matrices, which makes it possible to get a visual impression of the NMF approximation quality. the measurements show that for sufficiently large workloads, the parallelized Newton iteration algorithm achieves an almost linear speedup, which makes it a promising candidate for large-scale NMF computations.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

parallel butterfly sorting algorithm on GPU

Parallel butterfly sorting algorithm on GPU

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

作者： Jan, Bilal Montrucchio, Bartolomeo Ragusa, Carlo Khan, Fiaz Gul Khan, Omar Politecnico di Torino Torino Italy Politecnico di Torino Torino Italy

ISBN: (纸本)9780889869431

Efficient sorting is vital for overall performance of the underlying application. this paper presents Butterfly Network Sort (BNS) for sorting large data sets. A minimal version of the algorithm Min-Max Butterfly is also shown for searching minimum and maximum values in data. Both algorithms are implemented on GPUs using OpenCL exploiting data parallelism model. Results obtained on different GPU architectures show better performance of butterfly sorting in terms of sorting time and rate. the comparison of butterfly sorting with other algorithms:bitonic, odd-even and rank sort show significant speedup improvements against all on Nvidia Quadro-6000 GPU with relatively better sorting time and rate.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

Managing large scale experiments in distributed testbeds

Managing large scale experiments in distributed testbeds

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

作者： Ruiz, Cristian C. Richard, Olivier A. Iegorov, Oleg Videau, Brice INRIA Mescal Research Team Grenoble University Grenoble France INRIA Mescal Research Team Joseph Fourier University Grenoble France LIG Laboratory Grenoble University Grenoble France

ISBN: (纸本)9780889869431

Performing experiments that involve a large amount of resources or a complex configuration proves to be a hard task. In this paper we present Expo, which is a tool for conducting experiments on distributed platforms. First, the tool is described along with the concepts of resource and task sets, which abstracts away some of the complexity in the experiment conduction. Next, the tool is compared with other similar solutions based on some qualitative criteria, scalability and expressiveness tests, as well as the feedback coming from using dedicated testbeds. the paper finishes with the evaluation of Expo scalability and some use cases on Grid5000 and PlanetLab testbeds. Our experience showed that Expo is a promising tool to help the user with two primary concerns: performing a large scale experiment efficiently and easily, together with its reproducilibity.

关键词： Testbeds

来源：评论

学校读者我要写书评

暂无评论

On the relative significance of kernelization versus branching for parallel FPT implementations

On the relative significance of kernelization versus branchi...

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

作者： Hagan, Ronald D. Phillips, Charles A. Wang, Kai Rogers, Gary L. Lowcay, Callum Langston, Michael A. University of Tennessee Knoxville TN United States National Institute for Computational Sciences Oak Ridge TN United States Massey University Palmerston North New Zealand

ISBN: (纸本)9780889869431

We investigate the relative significance of kernelization versus branching for parallel FPT implementations. Using the well-known vertex cover problem as a familiar example, we build and experiment with a testbed of five different classes of difficult graphs. For some, we find that kernelization alone obviates the need for parallelism. For others, we show that kernelization and branching work in synergy to produce efficient implementations. And yet for others, kernelization fails completely, leaving branching to solve the entire problem. Structural graph properties are studied in an effort to explicate this trichotomy. the NP-completeness of vertex cover makes scalability an extreme challenge. We mainly employ Hopper, named after the famous computing pioneer Admiral Grace Murray Hopper. the Hopper platform is currently one of the world's fastest supercomputers.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Investigating operating system noise in extreme-scale high-performance computing systems using simulation

Investigating operating system noise in extreme-scale high-p...

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

作者： Engelmann, Christian Oak Ridge National Laboratory Oak Ridge TN United States

ISBN: (纸本)9780889869431

Hardware/software co-design for future-generation highperformance computing (HPC) systems aims at closing the gap between the peak capabilities of the hardware and the performance realized by applications (applicationarchitecture performance gap). Performance profiling of architectures and applications is a crucial part of this iterative process. the work in this paper focuses on operating system (OS) noise as an additional factor to be considered for co-design. It represents the first step in including OS noise in HPC hardware/software co-design by adding a noise injection feature to an existing simulation-based co-design toolkit. It reuses an existing abstraction for OS noise with frequency (periodic recurrence) and period (duration of each occurrence) to enhance the processor model of the Extreme-scale Simulator (xSim) with synchronized and random OS noise simulation. the results demonstrate this capability by evaluating the impact of OS noise on MPI Bcast() and MPI Reduce() in a simulated futuregeneration HPC system with 2,097,152 compute nodes.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Regulate my appetite according to dishes: A distributed on-line optimal stopping web service selection scheme

Regulate my appetite according to dishes: A distributed on-l...

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

作者： Liu, Siping Zhang, Yaoxue Zhou, Yuezhi Liu, Hao Zhang, Di Hu, Wei Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9780889869431

this paper demonstrates a distributed on-line service selection( probe/access) scheme: optimal stopping web service selection scheme based on the rate of return problem from optimal stopping theory. there are three differences between our scheme and the conventional schemes. Firstly, it does not need to probe all web services, and only probe a few web services. Secondly, our scheme focuses on maximizing the average QoS(Quality of Service) return per unit of cost over all stages of probe and access for a long period rather than maximizing QoS return per single stage of probe and access in usual schemes. thirdly, our scheme develops a return function based on three factors: QoS return, user's requirement and probe cost which are seldom considered simultaneously before. through theory analysis and computation, we demonstrate that compared with the conventional schemes our scheme has additional advantages while achieving same good performances.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Solving the NP-Hard Computational Problem in Bayesian networks using Apache Hadoop MapReduce

Solving the NP-Hard Computational Problem in Bayesian Networ...

引用

11th international conference on ICT and Knowledge Engineering (ICT and KE)

作者： Jongsawat, Nipat Premchaiswadi, Wichian Siam Univ Grad Sch Informat Technol Bangkok Thailand

ISBN: (纸本)9781479922574

the problem of exact probabilistic inference in an arbitrary Bayes network is NP-hard. the process is time consuming and complex. To speed up the processing, we need to run parts of the subnetwork in parallel. this work addresses the application of a MapReduce based distributed computing framework, Hadoop, to Bayesian network model to speed up the Bayesian update and inference processes. We present an analytical framework for understanding the transformation of Bayesian network model to Map and Reduce tasks. Computerbased Patient Case Simulation System (422 nodes) is chosen as a case study for the transformation.

关键词： Hadoop MapReduce Hadoop distributed File System Bayesian network Bayesian Inference

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：