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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,692 篇 会议
58 册 图书
54 篇 期刊文献

馆藏范围

2,804 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,847 篇 工学
- 1,632 篇 计算机科学与技术...
- 845 篇 软件工程
- 339 篇 电气工程
- 221 篇 电子科学与技术（可...
- 214 篇 信息与通信工程
- 84 篇 控制科学与工程
- 62 篇 光学工程
- 57 篇 机械工程
- 46 篇 仪器科学与技术
- 38 篇 生物医学工程（可授...
- 38 篇 生物工程
- 31 篇 材料科学与工程（可...
- 25 篇 动力工程及工程热...
- 21 篇 化学工程与技术
- 20 篇 建筑学
- 17 篇 交通运输工程
- 15 篇 土木工程
- 15 篇 网络空间安全
504 篇 理学
- 342 篇 数学
- 113 篇 物理学
- 51 篇 系统科学
- 48 篇 生物学
- 31 篇 化学
- 30 篇 统计学（可授理学、...
178 篇 管理学
- 124 篇 管理科学与工程(可...
- 62 篇 图书情报与档案管...
- 49 篇 工商管理
40 篇 医学
- 30 篇 临床医学
- 14 篇 基础医学(可授医学...
15 篇 法学
- 15 篇 社会学
9 篇 经济学
9 篇 农学
8 篇 文学
2 篇 军事学
1 篇 教育学

主题

360 篇 parallel process...
219 篇 computer archite...
205 篇 graphics process...
146 篇 parallel archite...
135 篇 graphics process...
129 篇 hardware
116 篇 parallel algorit...
112 篇 image processing
98 篇 computational mo...
94 篇 concurrent compu...
87 篇 instruction sets
86 篇 field programmab...
83 篇 algorithm design...
79 篇 multicore proces...
77 篇 signal processin...
76 篇 parallel process...
66 篇 parallel program...
60 篇 throughput
60 篇 gpu
59 篇 kernel

机构

11 篇 natl univ def te...
6 篇 college of compu...
6 篇 school of comput...
6 篇 hosei univ dept ...
6 篇 natl univ def te...
5 篇 univ aizu dept c...
5 篇 carleton univ sc...
5 篇 school of comput...
5 篇 computer science...
5 篇 inria rennes
5 篇 city university ...
4 篇 chinese acad sci...
4 篇 univ michigan ad...
4 篇 institute of com...
4 篇 univ chinese aca...
4 篇 school of comput...
4 篇 univ jaume 1 dep...
4 篇 hainan internati...
4 篇 tech univ cluj n...
4 篇 department of co...

作者

11 篇 jack dongarra
10 篇 roman wyrzykowsk...
9 篇 konrad karczewsk...
9 篇 quintana-orti en...
7 篇 dongarra jack
7 篇 kothapalli kisho...
6 篇 hannig frank
6 篇 liu jie
6 篇 su jinshu
6 篇 nakano koji
6 篇 peng shietung
6 篇 li yamin
6 篇 chu wanming
6 篇 wyrzykowski roma...
6 篇 thulasiraman par...
5 篇 ito yasuaki
5 篇 jerzy waśniewski
5 篇 wang guojun
5 篇 geyong min
5 篇 wanlei zhou

语言

2,757 篇 英文
22 篇 其他
15 篇 中文
11 篇 俄文
2 篇 乌克兰文
1 篇 西班牙文

检索条件"任意字段=10th International Conference on Algorithms and Architectures for Parallel Processing"

共 2804 条记录，以下是661-670 订阅

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

详细简洁

排序：

A Generic High throughput Architecture for Stream processing 27

A Generic High Throughput Architecture for Stream Processing

引用

27th international conference on Field Programmable Logic and Applications (FPL)

作者： Rousopoulos, Christos Karandeinos, Ektoras Chrysos, Grigorios Dollas, Apostolos Pnevmatikatos, Dionisios N. Tech Univ Crete Sch Elect & Comp Engn Khania 73100 Greece

ISBN: (纸本)9789090304281

Stream join is a fundamental and computationally expensive data mining operation for relating information from different data streams. this paper presents two FPGA-based architectures that accelerate stream join processing. the proposed hardware-based systems were implemented on a multi-FPGA hybrid system with high memory bandwidth. the experimental evaluation shows that our proposed systems can outperform a software-based solution that runs on a high-end, 48-core multiprocessor platform by at least one order of magnitude. In addition, the proposed solutions outperform any other previously proposed hardware-based or software-based solutions for stream join processing. Finally, our proposed hardware-based architectures can be used as generic templates to map stream processing algorithms on reconfigurable logic, taking into consideration real-world challenges and restrictions.

关键词： Computer architecture Hardware throughput Bandwidth Field programmable gate arrays parallel processing

来源：评论

学校读者我要写书评

暂无评论

parallel Computing Accelerated Image Inpainting using GPU CUDA, theano, and Tensorflow

Parallel Computing Accelerated Image Inpainting using GPU CU...

引用

international conference on Information Technology and Electrical Engineering (ICITEE)

作者： Heronimus Tresy Renata Adie Ignatius Aldi Pradana Pranowo Department of Informatic Engineering Universitas Atma Jaya Yogyakarta Yogyakarta Indonesia

Image inpainting refers to image restoration process that reconstruct damaged image to obtain it lost information based on existing information. PDE-based approach is commonly used for image interpolation especially inpainting. Since PDE process express convolution and continuous change, the approach may take a lot of computational resources and will run slow on standard computer CPU. To overcome that, GPU parallel computing method for PDE-based image inpainting are proposed. these days, some handy platform or frameworks to utilize GPU are already exist like CUDA, theano and Tensorflow. CUDA is well-known as parallel computing platform and programming model to work with programming language such as C/C++. In other hand theano and Tensorflow is a bit different thing, both of them is a machine learning framework based on Python that also able to utilize GPU. Although theano and Tensorflow are specialized for machine learning and deep learning, the system is general enough to applied for computational process like image inpainting. the results of this work show benchmark performance of PDE image inpainting running on CPU using C++, theano, and Tensorflow and on GPU with CUDA, theano, and Tensorflow. the benchmark shows that parallel computing accelerated PDE image inpainting can run faster on GPU either with CUDA, theano, or Tensorflow compared to PDE image inpainting running on CPU.

关键词： Graphics processing units parallel processing Mathematical model Handheld computers Convolution Heating systems Acceleration

来源：评论

学校读者我要写书评

暂无评论

HIGHLY parallel HEVC MOTION ESTIMATION BASED ON MULTIPLE TEMPORAL PREDICTORS AND NESTED DIAMOND SEARCH 24

HIGHLY PARALLEL HEVC MOTION ESTIMATION BASED ON MULTIPLE TEM...

引用

24th IEEE international conference on Image processing (ICIP)

作者： Hojati, Esmaeil Franche, Jean-Francois Coulombe, Stephane Vazquez, Carlos Ecole Technol Super Montreal PQ Canada

ISBN: (纸本)9781509021758

Rate-constrained motion estimation (RCME) is the most computationally intensive task of H.265/HEVC encoding. Massively parallel architectures, such as graphics processing units (GPUs), used in combination with a multi-core central processing unit (CPU), provide a promising computing platform to achieve fast encoding. However, the dependencies in deriving motion vector predictors (MVPs) prevent the parallelization of prediction units (PUs) processing at a frame level. Moreover, the conditional execution structure of typical fast search algorithms is not suitable for GPUs designed for data-intensive parallel problems. In this paper, we propose a novel highly parallel RCME method based on multiple temporal motion vector (MV) predictors and a new fast nested diamond search (NDS) algorithm well-suited for a GPU. the proposed framework provides fine-grained encoding parallelism. Experimental results show that our approach provides reduced GPU load with better BD-Rate compared to prior full search parallel methods based on a single MV predictor.

关键词： HEVC rate-constrained motion estimation GPU massively parallel architecture

来源：评论

学校读者我要写书评

暂无评论

Implementing a space-aware stochastic simulator on low-power architectures: a systems biology case study 25

Implementing a space-aware stochastic simulator on low-power...

引用

25th Euromicro international conference on parallel, Distributed and Network-Based processing (PDP)

作者： Morganti, Lucia Corni, Elena Ferraro, Andrea Cesini, Daniele D'Agostino, Daniele Merelli, Ivan Italian Inst Nucl Phys CNAF Bologna Italy Natl Res Council Italy Inst Appl Math & Informat Technol E Magenes Genoa Italy Natl Res Council Italy Inst Biomed Technol Segrate Mi Italy

ISBN: (纸本)9781509060580

In the last decade, different computing paradigms and modelling frameworks for the description and simulation of biochemical systems based on stochastic modelling have been proposed. From a computational point of view, many simulations of the model are necessary to identify the behaviour of the system. the execution of thousands of simulations can require huge amount of time, therefore the parallelization of these algorithms is highly desirable. In particular, models that consider the size of volumes and objects involved in the reaction are very time-consuming, since many rules should be considered to take into account the position of the different molecules. In this work we present an implementation of a stochastic space-aware simulator which exploits the benefit and features of hybrid low-power computing architectures. this work shows that the simulator dynamic probabilistic approach to select possible chemical reactions can be applied and implemented in hybrid low-power low-cost architectures as well as current industry high-end servers.

关键词： Computational modeling Biological system modeling Stochastic processes Computer architecture Evolution (biology) Biomembranes Power system dynamics

来源：评论

学校读者我要写书评

暂无评论

Configuring Concurrent Computation of Phylogenetic Partial Likelihoods: Accelerating Analyses Using the BEAGLE Library 17th

Configuring Concurrent Computation of Phylogenetic Partial L...

引用

17th international conference on algorithms and architectures for parallel processing (ICA3PP)

作者： Ayres, Daniel L. Cummings, Michael P. Univ Maryland Ctr Bioinformat & Computat Biol College Pk MD 20742 USA

ISBN: (纸本)9783319654829;9783319654812

We describe our approach in augmenting the BEAGLE library for high-performance statistical phylogenetic inference to support concurrent computation of independent partial likelihoods arrays. Our solution involves identifying independent likelihood estimates in analyses of partitioned datasets and in proposed tree topologies, and configuring concurrent computation of these likelihoods via CUDA and opencL frameworks. We evaluate the effect of each increase in concurrency on throughput performance for our partial likelihoods kernel for a four-state nucleotide substitution model on a variety of parallel computing hardware, such as NVIDIA and AMD GPU5, and Intel multicore cPus, observing up to 16-fold speedups over our previous implementation. Finally, we evaluate the effect of these gains on an domain application program, MrBayes. For a partitioned nucleotide-model analysis we observe an average speedup for the overall run time of 2.1-fold over our previous parallel implementation, and 10-fold over the native MrBayes with SSE.

关键词： Bayes methods Biology computing Evolution (biology) Phylogeny Maximum likelihood estimation Multicore processing parallel programming High performance computing

来源：评论

学校读者我要写书评

暂无评论

Application of Batch and Stream Collaborative Computing in Urban Traffic Data processing 17th

Application of Batch and Stream Collaborative Computing in U...

引用

17th international conference on algorithms and architectures for parallel processing (ICA3PP)

作者： Zhang, Tao Zhao, Shuai Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

ISBN: (纸本)9783319654829;9783319654812

Analysis of urban traffic data has obtained a great attention in recent years. In the study of urban traffic data processing, the batch computing based on historical data and the stream computing based on real-time data are isolated, and the two computing frameworks are not synergized. therefore, a method of urban traffic data processing based on batch and stream collaborative computing is proposed. Batch computing has the advantage of high throughput, so it is more suitable for calculating the historical data of urban traffic and the results of stream computing deeply. Stream computing with the advantage of low delay can be used to calculate the traffic data in real time, combined with the results of batch computing, then the conclusion of urban traffic data processing are more comprehensive and accurate.

关键词： Batch computing Stream computing Collaborative computing Urban traffic data processing

来源：评论

学校读者我要写书评

暂无评论

parallel MEAN SHIFT ACCURACY AND PERFORMANCE TRADE-OFFS

PARALLEL MEAN SHIFT ACCURACY AND PERFORMANCE TRADE-OFFS

引用

IEEE international conference on Image processing

作者： Kirsty R. Duncan Robert Stewart Greg Michaelson School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh United Kingdom

this paper decomposes the algorithmic parameters that affect the accuracy and parallel run times of mean shift segmentation. Following Comaniciu and Meer, rather than perform calculations in the feature space of the image, the joint spatial-range domain is represented by the image space, with feature space information associated with each point. We report parallel speedup and segmentation accuracy using a standardised segmentation dataset and the Probabilistic Rand index (PRI) accuracy measure. Changes to the algorithmic parameters are analysed and a sweet spot between PRI and run time is found. Using a range window radius of 20, spatial window radius of 10 and threshold of 50, the PRI is improved by 0.17, an increase of 34% which is comparable to state of the art. Mean shift clustering run time is reduced by 97% with parallelism, a speedup of 32 on a 64-core CPU.

关键词： Microsoft Windows Image segmentation Merging Clustering algorithms Indexes Probabilistic logic parallel processing

来源：评论

学校读者我要写书评

暂无评论

Nearly Balanced Work Partitioning for Heterogeneous algorithms 46

Nearly Balanced Work Partitioning for Heterogeneous Algorith...

引用

46th international conference on parallel processing Workshops (ICPPW)

作者： Mallipeddi, Hardhik Banerjee, Dip Sankar Ramamoorthy, Kiran Raj Srinathan, Kannan Kothapalli, Kishore Int Inst Informat Technol Hyderabad 500032 Andhra Pradesh India Indian Inst Informat Technol Gopinath Bordoloi GNB Rd Gauhati 781001 India

ISBN: (纸本)9781538610428

the architectural trend towards heterogeneity has pushed heterogeneous computing to the fore of parallel computing research. Heterogeneous algorithms, often carefully hand-crafted, have been designed for several important problems from parallel computing such as sorting, graph algorithms, matrix computations, and the like. A majority of these algorithms follow a work partitioning approach where the input is divided into appropriate sized parts so that individual devices can process the "right" parts of the input. However, arriving at a good work partitioning is usually non-trivial and may require extensive empirical search. Such an extensive empirical search can potentially offset any gains accrued out of heterogeneous algorithms. Other recently proposed approaches too are in general inadequate. In this paper, we propose a simple and effective technique for work partitioning in the context of heterogeneous algorithms. Our technique is based on sampling and therefore can adapt to both the algorithm used and the input instance. Our technique is generic in its applicability as we will demonstrate in this paper. We validate our technique on three problems: finding the connected components of a graph (CC), multiplying two unstructured sparse matrices (spmm), and multiplying two scale-free sparse matrices. For these problems, we show that using our method, we can find the required threshold that is under 10% away from the best possible thresholds.

关键词： Partitioning algorithms Algorithm design and analysis Sparse matrices Runtime Graphics processing units Sampling methods parallel processing

来源：评论

学校读者我要写书评

暂无评论

Accelerating Exhaustive Pairwise Metagenomic Comparisons 17th

Accelerating Exhaustive Pairwise Metagenomic Comparisons

引用

17th international conference on algorithms and architectures for parallel processing (ICA3PP)

作者： Perez-Wohlfeil, Esteban Torreno, Oscar Trelles, Oswaldo Univ Malaga Dept Comp Architecture Blvd Louis Pasteur 35 Malaga Spain

ISBN: (纸本)9783319654829;9783319654812

In this manuscript, we present an optimized and parallel version of our previous work IMSAME, an exhaustive gapped aligner for the pairwise and accurate comparison of metagenomes. parallelization strategies are applied to take advantage of modern multiprocessor architectures. In addition, sequential optimizations in CPU time and memory consumption are provided. these algorithmic and computational enhancements enable IMSAME to calculate near optimal alignments which are used to directly assess similarity between metagenomes without requiring reference databases. We show that the overall efficiency of the parallel implementation is superior to 80% while retaining scalability as the number of parallel cores used increases. Moreover, we also show that sequential optimizations yield up to 8x speedup for scenarios with larger data.

关键词： High Performance Computing Pairwise comparison parallel computing Next Generation Sequencing Metagenome comparison

来源：评论

学校读者我要写书评

暂无评论

Educational Multiprocessor Simulator "E14" and Its Usage for Expanding the Formula of Amdahl's Law 25

Educational Multiprocessor Simulator "E14" and Its Usage for...

引用

25th Euromicro international conference on parallel, Distributed and Network-Based processing (PDP)

作者： Eremin, Evgeny A. Perm State Humanitarian Pedag Univ Perm Russia

ISBN: (纸本)9781509060580

this paper describes demonstrative software simulator "E14", helpful in studying on an ordinary PC essentials of parallel calculations. It contains five virtual processors with identical instruction set, one of which controls the other four. Simulator has several mechanisms of data exchange between processors, so it can be used for studying both architectures with shared and distributed memory. parallel architecture of "E14" naturally extends classical single-processor one, hence proposed approach makes students' knowledge more systematic. "E14" may also be employed as a platform for the estimation of parallel algorithms' performance. the example, considered in the paper, clearly demonstrates how data exchange between processors may essentially degrade speedup, predicted by Amdahl's law.

关键词： multiprocessor mullticore computer architecture parallel calculations speedup Amdahl's law education simulator

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共281页 << < 63 64 65 66 67 68 69 70 71 72 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：