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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,079 篇 工学
- 1,016 篇 计算机科学与技术...
- 377 篇 软件工程
- 174 篇 电气工程
- 102 篇 信息与通信工程
- 49 篇 控制科学与工程
- 48 篇 电子科学与技术（可...
- 17 篇 动力工程及工程热...
- 16 篇 机械工程
- 14 篇 网络空间安全
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 8 篇 材料科学与工程（可...
- 7 篇 建筑学
- 7 篇 土木工程
- 7 篇 石油与天然气工程
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 仪器科学与技术
- 6 篇 安全科学与工程
220 篇 理学
- 172 篇 数学
- 33 篇 系统科学
- 24 篇 物理学
- 24 篇 统计学（可授理学、...
- 15 篇 生物学
120 篇 管理学
- 84 篇 管理科学与工程(可...
- 48 篇 图书情报与档案管...
- 32 篇 工商管理
14 篇 医学
- 14 篇 临床医学
8 篇 教育学
- 8 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
7 篇 法学
4 篇 农学

主题

127 篇 distributed comp...
106 篇 distributed comp...
95 篇 grid computing
91 篇 concurrent compu...
73 篇 parallel process...
66 篇 computer science
60 篇 application soft...
60 篇 computer archite...
55 篇 computer network...
50 篇 cloud computing
46 篇 parallel algorit...
46 篇 computational mo...
42 篇 parallel process...
36 篇 hardware
35 篇 delay
32 篇 costs
30 篇 real time system...
30 篇 high performance...
29 篇 workstations
28 篇 algorithm design...

机构

8 篇 shanghai jiao to...
8 篇 national laborat...
6 篇 argonne natl lab...
4 篇 national laborat...
4 篇 mathematics and ...
3 篇 tech univ munich...
3 篇 rhein westfal th...
3 篇 ibm thomas j. wa...
3 篇 oak ridge nation...
3 篇 rwth aachen univ...
3 篇 univ sci & techn...
3 篇 high performance...
3 篇 argonne natl lab...
3 篇 school of comput...
3 篇 pacific northwes...
3 篇 university of so...
3 篇 czestochowa univ...
3 篇 inst rech inform...
3 篇 department of co...
3 篇 university of te...

作者

7 篇 boukerche azzedi...
7 篇 yang laurence t.
5 篇 tudruj marek
5 篇 yang chao-tung
4 篇 wang jing
4 篇 s. ranka
4 篇 jack dongarra
4 篇 berenbrink petra
4 篇 li ml
4 篇 cristea valentin
4 篇 yong dou
4 篇 buyya rajkumar
4 篇 roman wyrzykowsk...
3 篇 see s
3 篇 fahringer thomas
3 篇 ertl christoph
3 篇 cong guojing
3 篇 zhang lei
3 篇 kamei sayaka
3 篇 vishwanath venka...

语言

1,500 篇 英文
9 篇 其他
7 篇 中文

检索条件"任意字段=5th International Symposium on Parallel and Distributed Computing"

共 1516 条记录，以下是351-360 订阅

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

详细简洁

排序：

parallel computing of a large scale spatially distributed model using the Soil and Water Assessment Tool (SWAT)

Parallel computing of a large scale spatially distributed mo...

引用

5th Biennial Conference of the international Environmental Modelling and Software Society: Modelling for Environment's Sake, iEMSs 2010

作者： Yalew, S.G. Van Griensven, A. Kokoszkiewicz, L. UNESCO-IHE Institute for Water Education Department of Hydroinformatics and Knowledge Management 2601 DA Delft Netherlands CERN - European Organization for Nuclear Research Switzerland

ISBN: (纸本)9788890357411

the Soil and Water Assessment Tool (SWAT) has been used widely for large scale applications, reaching entire continents. Within the EU funded EnviroGrids project, a detailed application of SWAT on the Black Sea Basin is envisaged using high resolution data. In order to support the computation, the model is run on a computer grid. the use of the SWAT allowed for such computations with little adaptations to the source. A 3-step procedure is needed. In the first step, a program is run in order to split the model into several sub-models. Afterwards, the sub-models are run in parallel. In a last step, the outputs of the sub-basins are collected at a central computer and the routing is performed. High computations are also needed when simulations have to be repeated, such as for sensitivity, calibration and uncertainty analysis. In these cases, the simulations are repeated for different parameter sets. In this paper, we discuss the gridification of the algorithm "LH-OAT" that performs sensitivity analysis and has been linked to the SWAT model. the results show a clear improvement in calculation time. Nevertheless, it is concluded that the parallel computing of a distributed model is mainly beneficial for large scale applications with high resolution, while running the sensitivity analysis algorithm has more general and obvious benefit. In a next step, the gridification will be optimised depending on the application and the overheads that are due to submission and receiving of files, as well as potential waiting times for executions on the grid.

关键词： SWAT

来源：评论

学校读者我要写书评

暂无评论

Extrapolation in distributed adaptive integration 5

Extrapolation in distributed adaptive integration

引用

5th international Conference on High Performance computing

作者： de Doncker, E Gupta, A Zanny, R Maile, J Western Michigan Univ Dept Comp Sci Kalamazoo MI 49008 USA

ISBN: (纸本)0818691948

this paper addresses the design of distributed methods which incorporate numerical extrapolation into adaptive multivariate integration, in order to increase the functionality of the integration algorithms. When attempting to deal with singularities, adaptive integration algorithms need a very fine subdivision in the proximity of these "hot spots". this is not practical in higher dimensions where a vast number of subregions result. these problems may be alleviated through the use of a suitable extrapolation strategy. We present a strategy which, incorporated as a global extrapolation method in distributed adaptive integration, allows for load balancing.

关键词： Extrapolation

来源：评论

学校读者我要写书评

暂无评论

Comparative study on the variations of quantum approximate optimization algorithms to the Traveling Salesman Problem

Comparative study on the variations of quantum approximate o...

引用

37th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Qian, Wenyang Basili, Robert Eshaghian-Wilner, Mary Khokhar, Ashfaq Luecke, Glenn Vary, James P. Univ Santiago de Compostela Inst Galego Fis Altas Enerxias IGFAE E-15782 Galicia Spain Iowa State Univ Dept Math Dept Phys & Astron Ames IA USA Iowa State Univ Dept Math Ames IA USA Iowa State Univ Dept Elect & Comp Engn Ames IA USA Iowa State Univ Dept Math Ames IA USA Iowa State Univ Dept Phys & Astron Ames IA USA

ISBN: (纸本)9798350311990

the Traveling Salesman Problem (TSP) is one of the most often-used NP-Hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also being used heavily as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this work, we formulate the symmetric TSP as an optimization problem, which we solve using the quantum approximate optimization algorithm (QAOA) approach. By adopting an improved qubit encoding strategy and a layerwise learning optimization protocol, we obtain numerical results on the gate-based digital quantum simulator for the 3-, 4-, and 5city TSPs. Specifically, we focus on three QAOA mixer designs to evaluate their performances in terms of numerical accuracy and optimization cost. Based on our results, we propose that a well-balanced QAOA mixer design is more prominent on gatebased simulators or realistic quantum devices in the near future. In addition, we study the sensitivity of TSP graph properties such as graph skewness and penalty weight in the TSP-QAOA simulation. Overall, our results prove digital quantum simulation is a powerful candidate for obtaining the optimal solution to the TSP.

关键词： Quantum computing Quantum Simulation Quantum Approximate Optimization Algorithm Traveling Salesman Proble

来源：评论

学校读者我要写书评

暂无评论

Enhancing scalability and load balancing of parallel Selected Inversion via tree-based asynchronous communication 30

Enhancing scalability and load balancing of Parallel Selecte...

引用

30th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Jacquelin, Mathias Yang, Chao Lin, Lin Wichmann, Nathan Lawrence Berkeley Natl Lab Scalable Solvers Grp Berkeley CA 94720 USA Univ Calif Berkeley Dept Math Berkeley CA 94720 USA Lawrence Berkeley Natl Lab Berkeley CA 94720 USA Cray Inc Seattle WA USA

ISBN: (纸本)9781509021406

We develop a method for improving the parallel scalability of computations that involve asynchronous task execution. We apply this method to the recently developed parallel selected inversion algorithm [Jacquelin, Lin and Yang 2014], named PSelInv, on massively parallel distributed memory machines. In the PSelInv method, we compute selected elements of the inverse of a sparse matrix A that can be decomposed as A = LU, where L is lower triangular and U is upper triangular. computing these selected elements of A(-1) requires restricted collective communications among a subset of processors within each column or row communication group created by a block cyclic distribution of L and U. We describe how this type of restricted collective communication can be implemented using asynchronous point-to-point MPI communications combined with a binary tree based data propagation scheme. Because multiple restricted collective communications may take place at the same time, we need to use a heuristic to prevent processors participating in multiple collective communications from receiving too many messages. this heuristic allows us to reduce communication load imbalance and improve the overall scalability of the selected inversion algorithm. For instance, when 6, 400 processors are used, we observe that the use of this heuristic leads to over 5x speedup for a number of test matrices. It also mitigates the performance variability introduced by an inhomogeneous network topology.

关键词： selected inversion distributed memory parallel algorithm asynchronous data communication collective communication high performance computation load balancing

来源：评论

学校读者我要写书评

暂无评论

Blockchain:the new era of Technology 5

Blockchain:The new era of Technology

引用

5th IEEE international Conference on parallel, distributed and Grid computing (PDGC)

作者： Sapra, Riya Dhaliwal, Parneeta Manav Rachna Univ Dept Comp Sci & Technol Faridabad Haryana India

ISBN: (纸本)9781728106465

Now a days many applications are being built using the immutability and robustness of blockchain. Blockchain is a new class of information technology which combines cryptography and distributed ledger that already exists. the model is composed of a group of computers that collaborate towards maintaining a secured database, without storing the data at any central unit. It is the technology behind all the crypto currencies like Bitcoin, Litecoin, Etherum and now finding its way to record everything possible. this paper focuses on the basic framework of blockchain model, its development history, prerequisites and challenges of blockchain. Finally, various current real time applications of the technology are discussed.

关键词： blockchain bitcoin distributed ledger merkle root applications consensus challenges pre-requisites

来源：评论

学校读者我要写书评

暂无评论

Implementation of fuzzy logic controller for parallel hybrid electric vehicle

Implementation of fuzzy logic controller for parallel hybrid...

引用

Joint 5th international Conference on Soft computing and Intelligent Systems and 11th international symposium on Advanced Intelligent Systems, SCIS and ISIS 2010

作者： Nashed, Maged N.F. Wahsh, Said Galal, Hamed Dakroury, Tarek Electronic Research Institute Giza Egypt Benha University Egypt

In this paper;implantation of fuzzy logic controller for parallel hybrid electric vehicles (PHEV) is presented. In PHEV the required torque is generated by a combination of internal-combustion engine (ICE) and an electric motor. the controller simulated using the SIMULINK / MATLAB package. the controller is designed based on the desired speed for driving and the state of speed error. In the other hand, performance of PHEV and ICE under different road cycle is given. the hardware setup is done for electric propulsion system;the system contains the induction motor, the three phase IGBT inverter with control circuit using microcontroller. the closed loop control system used a DC permanent generator whose output voltage is related to motor speed. Comparison between simulation and experimental results show accurate matching.

关键词： Hybrid vehicles

来源：评论

学校读者我要写书评

暂无评论

Two parallel Implementations of Ehrlich-Aberth Algorithm for Root-Finding of Polynomials on Multiple GPUs with OpenMP and MPI 19

Two Parallel Implementations of Ehrlich-Aberth Algorithm for...

引用

19th IEEE international Conference on Computational Science and Engineering, 14th IEEE international Conference on Embedded and Ubiquitous computing and 15th international symposium on distributed computing and Applications to Business, Engineering and Science, CSE-EUC-DCABES 2016

作者： Ghidouche, Kahina Sider, Abderrahmane Khodja, Lilia Ziane Couturier, Raphaël Laboratoire LIMED Faculté des Sciences Exactes Université de Bejaia 06000 Algeria University Bourgogne Franche-Comte France

ISBN: (纸本)9781509035939

Finding the roots of polynomials is a very important part of solving real-life problems but the higher the degree of the polynomials is, the less easy it becomes. In this paper, we present two different parallel algorithms of the Ehrlich-Aberth method to find roots of sparse and fully defined polynomials of high degrees. Both algorithms are based on CUDA technology to be implemented on multi-GPU computing platforms but each use different parallel paradigms: OpenMP or MPI. the experiments show a quasi-linear speedup by using up-to 4 GPU devices compared to 1 GPU to find the roots of polynomials of degree up-to 1.4 million. Moreover, other experiments show it is possible to find the roots of polynomials of degree up-to 5 million. © 2016 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

MADARP:: A distributed agent-based system for on-line DARP

引用

5th international symposium on parallel and distributed Processing and Applications/ISPA 2007 international Workshops

作者： Cubillos, Claudio Crawford, Broderick Rodriguez, Nibaldo Pontificia Univ Catolica Valparaiso Escuela Ingn Informat Av Brasil 2241 Valparaiso Chile

ISBN: (纸本)9783540747413

the present work describes the design of a distributed agent system devoted to the Dial-a-Ride Problem. this routing and scheduling problem consists in finding a set of routes and schedules for each vehicle that satisfies a set of trip requests comming from users. the agent system distributes an improved insertion heuristic for the scheduling of passengers' trip requests over a fleet of vehicles. Agents make use of the contract-net protocol as base coordination mechanism for the planning and scheduling of passenger trips.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

CyGraph: A Reconfigurable Architecture for parallel Breadth-First Search 28

CyGraph: A Reconfigurable Architecture for Parallel Breadth-...

引用

28th IEEE international parallel & distributed Processing symposium Workshops (IPDPSW)

作者： Attia, Osama G. Johnson, Tyler Townsend, Kevin Jones, Philip Zambreno, Joseph Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA

ISBN: (纸本)9781479941162

Large-scale graph structures are considered as a keystone for many emerging high-performance computing applications in which Breadth-First Search (BFS) is an important building block. For such graph structures, BFS operations tends to be memory-bound rather than compute-bound. In this paper, we present an efficient reconfigurable architecture for parallel BFS that adopts new optimizations for utilizing memory bandwidth. Our architecture adopts a custom graph representation based on compressed-sparse raw format (CSR), as well as a restructuring of the conventional BFS algorithm. By taking maximum advantage of available memory bandwidth, our architecture continuously keeps our processing elements active. Using a commercial high-performance reconfigurable computing system (the Convey HC-2), our results demonstrate a 5x speedup over previously published FPGA-based implementations.

关键词： Reconfigurable computing Breadth-First Search Graphs FPGA Convey HC-2

来源：评论

学校读者我要写书评

暂无评论

Grouping Synchronous to Eliminate Stragglers with Edge computing in distributed Deep Learning 19

Grouping Synchronous to Eliminate Stragglers with Edge Compu...

引用

19th IEEE international symposium on parallel and distributed Processing with Applications (IEEE ISPA)

作者： Gui, Zhiyi Yang, Xiang Yang, Hao Li, Wei Zhang, Lei Qi, Qi Wang, Jingyu Sun, Haifeng Liao, Jianxin Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China Huawei Beijing Peoples R China

ISBN: (纸本)9781665435741

With the development of artificial intelligence(AI) applications, a large number of data are generated from mobile or IoT devices at the edge of the network. Deep learning tasks are executed to obtain effective information in the user data. However, the edge nodes are heterogeneous and the network bandwidth is limited in this case, which will cause general distributed deep learning to be inefficient. In this paper, we propose Group Synchronous parallel (GSP), which uses a density-based algorithm to group edge nodes with similar training speeds together. In order to eliminate stragglers, group parameter servers are responsible for coordinating communication of nodes in the group with Stale Synchronous parallel and aggregating the gradients of these nodes. And a global parameter server is responsible for aggregating the gradients from the group parameter servers to update the global model. To save network bandwidth, we further propose Grouping Dynamic Sparsification (GDS). It adjusts the gradient sparsification rate of nodes dynamically based on GSP so as to differentiates the communication volume and makes the training speed of all nodes tend to be the same. We evaluate GSP and GDS's performance on LeNet-5, ResNet, VGG, and Seq2Seq with Attention. the experimental results show that GSP speedups the training by 45% similar to 120% with 16 nodes. GDS on top of GSP can make up for some test accuracy loss, up to 0.82% for LeNet-5.

关键词： distributed deep training gradient compression parameter server gradient sparsification

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共152页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：