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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是991-1000 订阅

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

详细简洁

排序：

Assessment of two pressure-velocity coupling strategies for local meshless numerical method

引用

9th international conference on Advances in Fluid Mechanics - Advances in Fluid Mechanics IX, AFM 2012

作者： Kosec, G. Vertnik, R. Šarler, B. Jožef Stefan Institute Laboratory for Parallel and Distributed Computing Slovenia University of Nova Gorica Laboratory for Multiphase Processes Slovenia Štore steel d.o.o. Research Slovenia Centre of Excellence for Biosensors Automation and Process Control Laboratory for Advanced Materials Systems Slovenia

ISBN: (纸本)9781845646004

the performance of two pressure-velocity coupling strategies, associated with the primitive variable solution of incompressible Newtonian fluid with the meshless Local Radial Basis Function Collocation Method (LRBFCM), is compared with respect to computational efficiency, stability, accuracy and spatial convergence. the LRBFCM is structured with multiquadrics on five noded support domains. the explicit time stepping is used. the Backward- Facing Step problem (BFS) has been selected as a benchmark problem, previously tackled by several numerical methods. the semi-local fractional step method (FSM) and completely local pressure-velocity couplings (LPVC) are compared. the numerical results are validated against previously published data. the results are represented and compared in terms of a convergence plot of the reattachment position. We show that both approaches provide reasonable results;however, LVPC is less computationally complex and less stable in comparison to FSM. © 2012 WIT Press.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

An Implementation of parallel 1-D FFT on the K Computer

An Implementation of Parallel 1-D FFT on the K Computer

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Daisuke Takahashi Atsuya Uno Mitsuo Yokokawa Faculty of Engineering Information and Systems University of Tsukuba Tsukuba Ibaraki Japan Rikagaku Kenkyujo Yokohama Campus Yokohama Kanagawa JP

In this paper, we propose an implementation of a parallel one-dimensional fast Fourier transform (FFT) on the K computer. the proposed algorithm is based on the six-step FFT algorithm, which can be altered into the recursive six-step FFT algorithm to reduce the number of cache misses. the recursive six-step FFT algorithm improves performance by utilizing the cache memory effectively. We use the recursive six-step FFT algorithm to implement the parallel one-dimensional FFT algorithm. the performance results of one-dimensional FFTs on the K computer are reported. We successfully achieved a performance of over 18 TFlops on 8192 nodes of the K computer (82944 nodes, 128 GFlops/node, 10.6 PFlops peak performance) for a 2 41 -point FFT.

关键词： Computers Arrays Registers Equations Indexes Kernel distributed databases

来源：评论

学校读者我要写书评

暂无评论

A parallel Multi-Core Team of Multiobjective Evolutionary Algorithms to Discover DNA Motifs

A Parallel Multi-Core Team of Multiobjective Evolutionary Al...

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： David L. Gonz'lez-Álvarez Miguel A. Vega-Rodríguez Juan A. Gómez-Pulido Juan M. S'nchez-Pérez University of Extremadura Department Technologies of Computers and Communications Escuela Politécnica Campus Universitario s/n Cáceres Spain

this paper proposes the use of a parallel multi-core team to exploit the characteristics of several algorithms, when solving one of the best known biological problems, the Motif Discovery Problem (MDP). Often, when we solve an optimization problem, we have to tackle very different scenarios. this complicates finding a single technique or algorithm that will be able to solve all of them adequately. One possible solution to this problem is to combine different algorithms in a team that allows us to solve all scenarios. A parallel methodology is designed in this work, which combines the operation of four multiobjective evolutionary algorithms by using OpenMP to solve different motif discovery scenarios. Our conclusions show that our parallel multi-core team is quite flexible and accurate for this application, and an important tool for discovering relevant DNA motifs.

关键词： Sociology Statistics Evolutionary computation DNA Optimization Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Mads Ruben Burgdorff Kristensen Brian Vinter Niels Bohr Institute University of Copenhagen Denmark

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.

关键词： Arrays Runtime Computational modeling Computer languages parallel processing Libraries Schedules

来源：评论

学校读者我要写书评

暂无评论

A distributed virtual geographic environment system for risk assessment of Dam-break

A distributed virtual geographic environment system for risk...

引用

international conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Zhu Jun Hu Ya Yungang Cao Faculty of Geosciences and Environmental Engineering Southwest Jiaotong University Chengdu Chengdu China Faculty of Geosciences and Environmental Engineering Southwest Jiaotong University Chengdu China

To improve working efficiency of the risk assessment of Dam-break in Barrier Lake, this paper employs theories and technologies of the distributed virtual reality and geographic information system (GIS) to construct a distributed virtual geographic environment system. the proposed web-based GIS system provides geographically distributed users with a shared virtual space and a collaborative platform in order to implement risk assessment work. A five-layer system framework was firstly designed to integrate and share geographically distributed resources as well as modeling procedures. Meantime some key technologies including distributed virtual scene modeling, mobile agent computing service and simulation analysis of dam-break flood routing, were discussed to offer a shared and interactive virtual collaborative work geographic environment. Finally, a prototype system was implemented to support risk assessment and impact analysis of dam-break in Barrier Lake.

关键词： Lakes Risk management Computational modeling Floods Geographic information systems Solid modeling Analytical models

来源：评论

学校读者我要写书评

暂无评论

MapReduce model-based optimization of range queries

MapReduce model-based optimization of range queries

引用

international conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Hui Zhao Shuqiang Yang Zhikun Chen Songcang Jin Hong Yin Long Li Department of Computer National University of Defense Technology ChangSha China

In recent years, MapReduce parallel computing model has gained lots of attentions from industry and academia. In Google, Yahoo, Facebook, etc., it has played a very good effect, which greatly simplifies the design of large-scale data-intensive applications. MapReduce-based systems were originally used to manage massive unstructured and semi-structured data, for example: to generate the inverted index, to calculate web page rank, log analysis, etc. therefore, current MapReduce systems don't give more considerations to the optimization of structured data, for example: it uses the brute-force scanning mode to process the whole datasets, which confront the common workflow of structured data processing, range query and analysis. To address the problem, this paper propose to build a global B-tree like index on top of hadoop distributed file system for structured data, and use the global index to eliminate unnecessary map tasks during range queries, thereby reducing the overhead of data I/O and tasks scheduling, which not only reduces query response time, but also greatly optimizes system resource utilization.

关键词： Indexes Optimization Time factors distributed databases parallel processing Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Scalable distributed Fast Multipole Methods

Scalable Distributed Fast Multipole Methods

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Qi Hu Nail A. Gumerov Ramani Duraiswami University of Maryland Institute for Advanced Computer Studies (UMIACS) USA

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.

关键词： Receivers Partitioning algorithms Octrees Graphics processing unit Vegetation Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Smart Traffic Cloud: An Infrastructure for Traffic applications

Smart Traffic Cloud: An Infrastructure for Traffic Applicati...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Wen Qiang Wang Xiaoming Zhang Jiangwei Zhang Hock Beng Lim Intelligent Systems Centre Nanyang Technological University Singapore

With rapid development of sensor technologies and wireless network infrastructure, research and development of traffic related applications, such as real time traffic map and on-demand travel route recommendation have attracted much more attentions than ever before. Both archived and real-time data involved in these applications could potentially be very big, depending on the number of deployed sensors. Emerging Cloud infrastructure can elastically handle such big data and conveniently providing nearly unlimited computing and storage resources to hosted applications, to carry out analysis not only for long-term planning and decision making, but also analytics for near real-time decision support. In this paper, we propose Smart Traffic Cloud, a software infrastructure to enable traffic data acquisition, and manage, analyze and present the results in a flexible, scalable and secure manner using a Cloud platform. the proposed infrastructure handles distributed and parallel data management and analysis using ontology database and the popular Map-Reduce framework. We have prototyped the infrastructure in a commercial Cloud platform and we developed a real-time traffic condition map using data collected from commuters' mobile phones.

关键词： Roads Global Positioning System Real-time systems Vehicles Ontologies distributed databases Smart phones

来源：评论

学校读者我要写书评

暂无评论

Demystifying performance predictions of distributed FFT3D implementations

Demystifying performance predictions of distributed FFT3D im...

引用

9th IFIP international conference on Network and parallel computing, NPC 2012

作者： Orozco, Daniel Garcia, Elkin Pavel, Robert Ayala, Orlando Wang, Lian-Ping Gao, Guang Electrical and Computer Engineering University of Delaware United States Mechanical Engineering University of Delaware United States

ISBN: (纸本)9783642356056

this paper presents a comprehensive story of the development of simpler performance models for distributed implementations of the Fast Fourier Transform in 3 Dimensions (FFT3D). We start by providing an overview of several implementations and their performance models. then, we present arguments to support the use of a simple power function instead of the full performance models proposed by other publications. We argue that our model can be obtained for a particular problem size with minimal experimentation while other models require significant tuning to determine their constants. Our advocacy for simpler performance models is inspired by the difficulties found when estimating the performance of FFT3D programs. Correctly estimating how well large-scale programs (such as FFT3D) will work is one of the most challenging problems faced by scientists. the significant effort devoted to this problem has resulted in the appearance of numerous works on performance modeling. the results produced by an exhaustive performance modeling study may predict the performance of a program with a reasonably good accuracy. However, those studies may become unusable because their aim for accuracy can make them so difficult and cumbersome to use that direct experimentation with the program may be preferable, defeating their original purpose. We propose an alternative approach in this paper that does not require a full, accurate, performance model. Our approach mitigates the problem of existing performance models, each one of the parameters and constants in the model has to be carefully measured and tuned, a process that is intrinsically harder than direct experimentation with the program at hand. Instead, we were able to simplify our approach by (1) building performance models that target particular applications in their normal operating conditions and (2) using simpler models that still produce good approximations for the particular case of a program's normal operating environment. We hav

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Exploring Potential parallelism of Sequential Programs with Superblock Reordering

Exploring Potential Parallelism of Sequential Programs with ...

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： John M. Ye Tianzhou Chen Zhejiang University-Intel Technology Center College of Computer Science University of Zhejiang Hangzhou Zhejiang China

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 processing Benchmark testing Performance analysis Runtime Schedules Graphics processing unit Registers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 96 97 98 99 100 101 102 103 104 105 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：