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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

134 篇 期刊文献
123 篇 会议
12 册 图书
3 篇 学位论文

馆藏范围

271 篇 电子文献
4 种 纸本馆藏

日期分布

学科分类号

230 篇 工学
- 199 篇 计算机科学与技术...
- 47 篇 电气工程
- 33 篇 软件工程
- 13 篇 信息与通信工程
- 11 篇 控制科学与工程
- 5 篇 机械工程
- 3 篇 材料科学与工程（可...
- 3 篇 动力工程及工程热...
- 3 篇 电子科学与技术（可...
- 2 篇 力学（可授工学、理...
- 2 篇 化学工程与技术
- 2 篇 交通运输工程
- 1 篇 仪器科学与技术
- 1 篇 土木工程
- 1 篇 测绘科学与技术
44 篇 理学
- 30 篇 数学
- 7 篇 物理学
- 3 篇 系统科学
- 3 篇 统计学（可授理学、...
- 2 篇 化学
- 2 篇 地球物理学
- 2 篇 生物学
- 1 篇 天文学
25 篇 管理学
- 20 篇 管理科学与工程(可...
- 6 篇 图书情报与档案管...
- 2 篇 工商管理
9 篇 教育学
- 9 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 法学
- 1 篇 社会学
1 篇 农学
1 篇 军事学

主题

272 篇 parallel and dis...
13 篇 high performance...
10 篇 big data
8 篇 load balancing
8 篇 education
8 篇 voltage and reac...
7 篇 dependability
7 篇 mapreduce
7 篇 scientific compu...
6 篇 acoustics
6 篇 gpu
5 篇 simulation
5 篇 optimization
5 篇 admm
5 篇 ray-tracing meth...
5 篇 computer science...
5 篇 cloud computing
5 篇 domain decomposi...
4 篇 mpi
4 篇 hadoop

机构

4 篇 brock univ dept ...
4 篇 china univ geosc...
4 篇 oakland univ dep...
3 篇 plymouth state u...
3 篇 rutgers state un...
3 篇 meiji univ
3 篇 swarthmore coll ...
2 篇 shanghai jiao to...
2 篇 univ tokyo ctr i...
2 篇 univ chinese aca...
2 篇 yanshan univ ins...
2 篇 st petersburg st...
2 篇 ecole cent paris...
2 篇 sacred heart uni...
2 篇 microsoft res re...
2 篇 bloomsburg univ ...
2 篇 natl ilan univ d...
2 篇 univ complutense...
2 篇 ecole centrale p...
2 篇 univ new orleans...

作者

11 篇 fukuyama yoshika...
6 篇 magoules frederi...
5 篇 yoshida hotaka
5 篇 shen zhizhang
5 篇 cheng eddie
5 篇 qiu ke
4 篇 wang lizhe
3 篇 parashar m
3 篇 nahhal tarik
3 篇 marin mauricio
3 篇 zhang feng
3 篇 meier h
3 篇 elbyed abdeltif
3 篇 glebova olga
3 篇 lei xinya
3 篇 newhall tia
3 篇 guo ruixin
3 篇 zhang wei
2 篇 yang junwen
2 篇 jilkov vesselin ...

语言

258 篇 英文
11 篇 其他
3 篇 中文

检索条件"主题词=Parallel and distributed computing"

共 272 条记录，以下是211-220 订阅

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

详细简洁

排序：

A Role of Symbolic Computations in Beam Physics

A Role of Symbolic Computations in Beam Physics

引用

12th CASC International Workshop

作者： Andrianov, Serge N. St Petersburg State Univ Fac Appl Math & Control Proc St Petersburg 198504 Russia

ISBN: (纸本)9783642152733

It is known that accelerator physics technology has made essential contributions to other branches of science and technology. Experiments realized on linear and circular accelerators have made remarkable discoveries about the basic nature of matter. In particular, there are now two accelerator projects. The first of them is already realized the Large Hadron Collider, the second the pilot project for future dedicated EDM machine. These and other similar projects (i. e., the project NICA JINR, Dubna) demand some special requirements for simulation methods and technologies. Indeed, the successful functioning of these accelerators requires essential advancement in theory and technology leading to new particle accelerators capabilities. The complexity of accelerator physics problems makes comprehensive use of modern analytical, numerical, and symbolic methods. Only if we integrate these approaches the corresponding computational technologies will be effective. In the present report, we discuss sonic problems of correlation between symbolic and numerical manipulation. The main approach for beam dynamics is based on Lie algebraic methods and corresponding matrix formalism as presentation tools. All suggested approaches are realized using symbolic algorithms, and the corresponding symbolic formulae are assumed as a basis of numerical algorithms. This approach allows to realize the necessary numerical modeling using parallel and distributed computational systems for some practical problems.

关键词： Symbolic algebra beam physics code generation Lie algebraic methods parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Component-wise Meshing Approach and Evaluation of Bonding Strategy on the Interface of Components for Assembled Finite Element Analysis of Structures

Component-wise Meshing Approach and Evaluation of Bonding St...

引用

9th International Conference on Fracture and Damage Mechanics

作者： Yamada, Tomonori Kushida, Noriyuki Araya, Fumimasa Nishida, Akemi Nakajima, Norihiro Japan Atom Energy Agcy Ctr Computat Sci & eSyst Taito Ku Tokyo 1100015 Japan

ISBN: (纸本)9780878492411

The finite elements are extensively utilized to solve various problems in engineering fields with the growth of computing technologies. However, there is a lack of methodology for analyses of huge assembled structures. The mechanics on the interface of each components, for instance, contact, bolt joint and welding in assembly is a key issue for important huge structure such as nuclear power plants. On the other hand, it is well known that as finite element models become large and complex, construction of detailed mesh becomes a bottleneck in the CAE procedures. To solve these problems, the authors would like to introduce component-wise meshing approach and bonding strategy on the interface of components. In order to assemble component-wise meshes, the penalty method is introduced not only to constrain the displacements, but also to introduce classical spring connection on the joint interface, although penalty method is claimed that it is not suitable for iterative solver. In this paper, the convergence performance of an iterative solver with penalty method is investigated and the detailed component-wise distributed computation scheme is described with numerical examples.

关键词： Finite Element Method parallel and distributed computing Iterative Solver Assembled Structure

来源：评论

学校读者我要写书评

暂无评论

Low Randomness Rumor Spreading via Hashing

Low Randomness Rumor Spreading via Hashing

引用

29th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Giakkoupis, George Sauerwald, Thomas Sun, He Woelfel, Philipp Univ Calgary Dept Comp Sci Calgary AB Canada Max Planck Inst Informat Saarbrucken Germany Fudan Univ Inst Modern Math & Phys Shanghai Peoples R China

ISBN: (纸本)9783939897354

We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple push-based protocols, in which nodes choose the neighbor they send the information to in each round using pairwise independent hash functions, or a pseudo-random generator, respectively. For several wellstudied topologies our algorithms use exponentially fewer random bits than previous protocols. For example, in complete graphs, expanders, and random graphs only a polylogarithmic number of random bits are needed in total to spread the rumor in O(log n) rounds with high probability. Previous explicit algorithms, e.g., [10, 17, 6, 15], require Omega(n) random bits to achieve the same round complexity. For complete graphs, the amount of randomness used by our hashing-based algorithm is within an O(log n)-factor of the theoretical minimum determined by Giakkoupis and Woelfel [15].

关键词： parallel and distributed computing Randomness Rumor Spreading

来源：评论

学校读者我要写书评

暂无评论

Evaluation of several variants of explicitly restarted Lanczos eigensolvers and their parallel implementations

Evaluation of several variants of explicitly restarted Lancz...

引用

7th International Conference on High Performance computing for Computational Science

作者： Hernandez, V. Roman, J. E. Tomas, A. Univ Politecn Valencia D Sist Informat & Computac Camino Vera S-N E-46022 Valencia Spain

ISBN: (纸本)9783540713500

It is well known that the Lanczos process suffers from loss of orthogonality in the case of finite-precision arithmetic. Several approaches have been proposed in order to address this issue, thus enabling the successful computation of approximate eigensolutions. However, these techniques have been studied mainly in the context of long Lanczos runs, but not for restarted Lanczos eigensolvers. Several variants of the explicitly restarted Lanczos algorithm employing different reorthogonalization strategies have been implemented in SLEPc, the Scalable Library for Eigenvalue Computations. The aim of this work is to assess the numerical robustness of the proposed implementations as well as to study the impact of reorthogonalization in parallel efficiency.

关键词： numerical methods parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

parallel Domain Decomposition Methods for Ray-Tracing on multi-cores and multi-processors

Parallel Domain Decomposition Methods for Ray-Tracing on mul...

引用

10th International Symposium on distributed computing and Applications to Business, Engineering and Science (DCABES)

作者： Venet, Cedric Magoules, Frederic Ecole Cent Paris Appl Math & Syst Lab Chatenay Malabry France

ISBN: (纸本)9780769544151

In this paper, an original parallel domain decomposition method for ray-tracing is proposed to solve numerical acoustic problems on multi-cores and multi-processors computers. A hybrid method between the ray-tracing and the beam-tracing method is first introduced. Then, a new parallel method based on domain decomposition principles is proposed. This method allows to handle large scale open domains for parallel computing purpose, better than other existing methods. parallel numerical experiments, carried out on a real world problem-namely the acoustic pollution analysis within a large city-illustrate the performance of this new domain decomposition method.

关键词： Domain decomposition methods parallel and distributed computing Acoustics Ray-tracing methods Beam-tracing methods

来源：评论

学校读者我要写书评

暂无评论

The engineering handbook of smart technology for aging, disability, and independence /

引用

2008年

作者： edited by Abdelsalam (Sumi) Helal Mounir Mokhtari Bessam Abdulrazak.

来源：内蒙古大学图书馆图书评论

学校读者我要写书评

暂无评论

Optimization design for parallel coloring of a set of graphs in the High-Performance computing 15

Optimization design for parallel coloring of a set of graphs...

引用

IEEE 15th International Scientific Conference on Informatics (INFORMATICS)

作者： Dudas, Adam Skrinarova, Jarmila Vesel, Eduard Univ Zilina Fac Management Sci & Informat Zilina Slovakia Matej Bel Univ Fac Nat Sci Banska Bystrica Slovakia

ISBN: (纸本)9781728131795

This paper presents solution to problem of edge coloring of sizable set of cubic graphs and examination of relations between these graphs. We solved this problem on various computing systems and for various sizes of the problem (various number of graphs). For the computations we used High-Performance computing Cluster and Amazon Web Services cloud environment. We measured and analyzed time of computation of edge coloring and other properties. Largest set we worked with contained almost 10 million graphs. We created new methodology, which can be used to finding order of the edges which optimizes time of computation of edge coloring for certain subset of graphs. On the basis of this methodology, we implemented algorithm for parallel edge coloring of set of graphs. For testing of the methodology, we designed 8 experiments. Results showed, that worst time of edge coloring of graph from set of 19 935 graphs before use of the methodology was 1260 ms. After application of our methodology, we found same order of edge coloring for whole group of 19 935 graphs and the highest time of coloring was 10 ms.

关键词： parallel and distributed computing HPC virtual machines edge coloring of cubic graphs

来源：评论

学校读者我要写书评

暂无评论

Operator Placement for Efficient distributed Complex Event Processing in MANETs 11

Operator Placement for Efficient Distributed Complex Event P...

引用

11th IEEE International Conference on Wireless and Mobile computing, Networking and Communications (WiMob)

作者： Starks, Fabrice Plagemann, Thomas Peter Univ Oslo Dept Informat Oslo Norway

ISBN: (纸本)9781467377010

Complex Event Processing (CEP) and Mobile Adhoc networks (MANETs) are two technologies that can be used to enable monitoring applications for Emergency and Rescue missions (ER). MANETs are characterized by energy limitations, and in-network processing or distributed CEP is one possible solution. Operator placement mechanism for distributed CEP has a direct impact on energy consumption. Existing operator placement mechanisms focus on static network topologies and are therefore inappropriate for MANETs scenarios. We propose a novel energy efficient decentralized distributed placement mechanism, designed to achieve fast convergence with minimal data transmission cost while achieving a near optimal placement assignment. We compare our decentralized placement mechanism with a centralized approach under different mobility scenarios. Furthermore, we evaluate the distributed CEP under different workload scenarios in order to gain additional insight into different performance characteristics of the system. Finally, we measure the impact of a simple placement replication scheme on the overall system performance in terms of delay and message overhead. Our decentralized placement mechanism achieves up to almost 50% lower message overhead compared to the centralized approach, and it has lower message overhead across different mobility scenarios compared to the centralized approach. The placement replication scheme achieves up to 51% lower delay compared to the decentralized placement mechanism with no replication.

关键词： Computer networks Mobile computing parallel and distributed computing Performance Wireless communications

来源：评论

学校读者我要写书评

暂无评论

Unplugged parallelism for First-Year CS Majors 2022

Unplugged Parallelism for First-Year CS Majors

引用

53rd Annual ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE)

作者： Anthony, Barbara M. Erdil, D. Cenk Glebova, Olga Montante, Robert Southwestern Univ Georgetown 78626 TX Guyana Sacred Heart Univ Fairfield CT 06825 USA Georgia State Univ Atlanta GA 30302 USA Bloomsburg Univ Bloomsburg PA 17815 USA

ISBN: (纸本)9781450390705

We use "unplugged" activities to introduce parallel concepts in a first-year seminar for Computer Science majors. Student teams explore parallel approaches to computational tasks. Pre- and post-activity surveys, and a reflection paper, measure the impact of these activities on students' views about parallel programming. Our goal is to encourage parallel thinking about programming tasks before sequential approaches become ingrained. Computer Science curricula have traditionally focused on sequential approaches to programming, which were well matched to earlier computer systems. However, current systems almost all use multiprocessor CPUs, and are frequently used in clusters or networks of multiple computers. Recent curricular guidelines from organizations such as ACM and ABET recommend exposure to parallel computing concepts.

关键词： parallel and distributed computing unplugged activities computing education

来源：评论

学校读者我要写书评

暂无评论

MRA*: parallel and distributed Path in Large-Scale Graph Using MapReduce-A* Based Approach 3rd

MRA*: Parallel and Distributed Path in Large-Scale Graph Usi...

引用

3rd International Symposium on Ubiquitous Networking (UNet)

作者： Hamilton Adoni, Wilfried Yves Nahhal, Tarik Aghezzaf, Brahim Elbyed, Abdeltif Hassan II Univ Fac Sci Casablanca LIMSAD Km 8 Route EI JadidaBP 5366 Casablanca 20100 Morocco

ISBN: (纸本)9783319681795;9783319681788

In this paper, we present a contribution for the Single Source Shortest Path Problem (SSSPP) in large-scale graph with A* algorithm. A* is one of the most efficient graph traversal algorithm because it is driven by a heuristic which determines the optimal path. A* approach is not efficient when the graph is too large to be processed due to exponential time complexity. We propose a MapReduce-based approach called MRA*: MapReduce-A* which consists to combine the A* algorithm with MapReduce paradigm to compute the shortest path in parallel and distributed environment. We perform experiments in a Hadoop multi-node cluster and our results prove that the proposed approach outperforms A* algorithm and reduces significantly the computational time.

关键词： A* algorithm Large-scale graph Shortest path problem Hadoop MapReduce parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共28页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：