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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,157 篇 会议
72 篇 期刊文献
65 册 图书

馆藏范围

3,293 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,338 篇 工学
- 2,058 篇 计算机科学与技术...
- 1,036 篇 软件工程
- 414 篇 电气工程
- 326 篇 信息与通信工程
- 310 篇 电子科学与技术（可...
- 112 篇 控制科学与工程
- 69 篇 机械工程
- 67 篇 光学工程
- 67 篇 生物工程
- 62 篇 生物医学工程（可授...
- 35 篇 动力工程及工程热...
- 33 篇 仪器科学与技术
- 32 篇 建筑学
- 30 篇 材料科学与工程（可...
- 29 篇 化学工程与技术
- 25 篇 土木工程
- 21 篇 力学（可授工学、理...
721 篇 理学
- 482 篇 数学
- 174 篇 物理学
- 79 篇 生物学
- 65 篇 系统科学
- 60 篇 统计学（可授理学、...
- 36 篇 化学
246 篇 管理学
- 158 篇 管理科学与工程(可...
- 102 篇 图书情报与档案管...
- 70 篇 工商管理
63 篇 医学
- 53 篇 临床医学
- 21 篇 基础医学(可授医学...
22 篇 农学
- 19 篇 作物学
21 篇 法学
- 19 篇 社会学
15 篇 经济学
12 篇 文学
11 篇 教育学
4 篇 军事学

主题

327 篇 parallel process...
204 篇 graphics process...
203 篇 computer archite...
157 篇 parallel archite...
136 篇 parallel process...
123 篇 parallel algorit...
121 篇 graphics process...
115 篇 hardware
113 篇 image processing
86 篇 concurrent compu...
86 篇 computational mo...
76 篇 signal processin...
72 篇 parallel program...
71 篇 field programmab...
68 篇 instruction sets
68 篇 multicore proces...
67 篇 parallel computi...
65 篇 algorithm design...
58 篇 throughput
57 篇 gpu

机构

9 篇 college of compu...
9 篇 natl univ def te...
8 篇 carleton univ sc...
8 篇 national laborat...
6 篇 hosei univ dept ...
6 篇 inria rennes
6 篇 st francis xavie...
5 篇 chinese acad sci...
5 篇 univ aizu dept c...
5 篇 polish japanese ...
5 篇 computer science...
5 篇 college of compu...
5 篇 city university ...
4 篇 shanghai jiao to...
4 篇 charles univ pra...
4 篇 rwth aachen univ...
4 篇 hainan internati...
4 篇 department of co...
4 篇 university of ch...
4 篇 universidad carl...

作者

11 篇 jack dongarra
10 篇 roman wyrzykowsk...
8 篇 dongarra jack
7 篇 liu jie
7 篇 konrad karczewsk...
7 篇 quintana-orti en...
6 篇 hannig frank
6 篇 li dongsheng
6 篇 teich juergen
6 篇 li chao
6 篇 nakano koji
6 篇 peng shietung
6 篇 li yamin
6 篇 chu wanming
6 篇 krulis martin
5 篇 zhang lei
5 篇 ito yasuaki
5 篇 li kenli
5 篇 wanlei zhou
5 篇 tudruj marek

语言

3,230 篇 英文
53 篇 其他
15 篇 中文

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

共 3294 条记录，以下是1621-1630 订阅

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

详细简洁

排序：

parallel SAD for fast dense disparity map using a shared memory programming

Parallel SAD for fast dense disparity map using a shared mem...

引用

5th FTRA international conference on Information Technology Convergence and Services, ITCS 2013 and the 3rd international conference on Intelligent Robotics, Automations, Telecommunication Facilities, and Applications, IRoA 2013

作者： Kim, Cheong Ghil

ISBN: (纸本)9789400769953

the depth map extraction from stereo video is a key technology of stereoscopic 3D video as well as view synthesis and 2D-3D video conversions. Sum of Absolute Differences (SAD) is a representative method to reconstruct disparity map. However, dense disparity map implementation requires heavy computations and extensive memory accesses. In this situation, the rapid advance of computer hardware and popularity of multimedia applications enable multi-core processors to become a dominant market trend in desk-top PCs as well as high end mobile devices;this movement allows many parallel programming technologies to be realized in users computing devices. therefore, this paper proposes a parallel algorithm for SAD operation using a shared memory programming, OpenMP, which can provide the advantage to simplify managing and synchronization of program threads. the parallel implementation results show the 2.5 times of performance improvements on the processing speed compared with the serial implementation. © 2013 Springer Science+Business Media Dordrecht.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

A parallel, BLACK-BOX COUPLING ALGORIthM FOR FLUID-STRUCTURE INTERACTION

A PARALLEL, BLACK-BOX COUPLING ALGORITHM FOR FLUID-STRUCTURE...

引用

5th international conference on Computational Methods for Coupled Problems in Science and Engineering

作者： Uekermann, Benjamin Bungartz, Hans-Joachim Gatzhammer, Bernhard Mehl, Miriam Tech Univ Munich IAS Lichtenbergstr 2a D-85748 Garching Germany Tech Univ Munich Inst Informat D-85748 Garching Germany

ISBN: (纸本)9788494140761

the simulation of multi-physics scenarios, in particular fluid-structure interaction has gained more and more importance in the last years due to increasing accuracy requirements for a large range of applications from biomedical fields to technical design problems. At the same time, this type of simulation has become feasible due to the increased computing power of modern supercomputers. Note that only the combination of a highly accurate and, thus, highly resolved, discretization with the multi-physics model yields more detailed and more realistic results than a simple single-physics simulation. However, modern computing architectures require a good scalability of simulation methods on massively parallel systems. For fluid-structure interactions, if done in a partitioned way using separate fluid and structure codes, in particular the usually applied staggered scheme executing fluid and structure solver one after the other hinders a good scalability. this is due to the in general largely different computational costs of the two solvers. In this paper, we propose two new coupling schemes for an implicit coupling of black-box fluid and structure solvers that execute the two solvers in parallel and still yield good convergence and stability even for incompressible fluids which is shown by means of numerical results for the flow through a flexible tube.

关键词： Fluid-Structure Interaction Strong Coupling Black-Box Coupling Partitioned Coupling High Performance Computing Scientific Computing

来源：评论

学校读者我要写书评

暂无评论

Work efficient parallel algorithms for large graph exploration

Work efficient parallel algorithms for large graph explorati...

引用

international conference on High Performance Computing

作者： Dip Sankar Banerjee Shashank Sharma Kishore Kothapalli International Institute of Information Technology Hyderabad India

Graph algorithms play a prominent role in several fields of sciences and engineering. Notable among them are graph traversal, finding the connected components of a graph, and computing shortest paths. there are several efficient implementations of the above problems on a variety of modern multiprocessor architectures. It can be noticed in recent times that the size of the graphs that correspond to real world data sets has been increasing. parallelism offers only a limited succor to this situation as current parallel architectures have severe short-comings when deployed for most graph algorithms. At the same time, these graphs are also getting very sparse in nature. this calls for particular work efficient solutions aimed at processing large, sparse graphs on modern parallel architectures. In this paper, we introduce graph pruning as a technique that aims to reduce the size of the graph. Certain elements of the graph can be pruned depending on the nature of the computation. Once a solution is obtained for the pruned graph, the solution is extended to the entire graph. We apply the above technique on three fundamental graph algorithms: breadth first search (BFS), Connected Components (CC), and All Pairs Shortest Paths (APSP). To validate our technique, we implement our algorithms on a heterogeneous platform consisting of a multicore CPU and a GPU. On this platform, we achieve an average of 35% improvement compared to state-ofthe-art solutions. Such an improvement has the potential to speed up other applications that rely on these algorithms.

关键词： Graphics processing units Arrays Algorithm design and analysis parallel architectures Instruction sets parallel processing

来源：评论

学校读者我要写书评

暂无评论

Adaptive task size control on high level programming for GPU/CPU work sharing

Adaptive task size control on high level programming for GPU...

引用

13th international conference on algorithms and architectures for parallel processing, ICA3PP 2013

作者： Odajima, Tetsuya Boku, Taisuke Sato, Mitsuhisa Hanawa, Toshihiro Kodama, Yuetsu Namyst, Raymond thibault, Samuel Aumage, Olivier Graduate School of Systems and Information Engineering University of Tsukuba Japan Center for Computational Sciences University of Tsukuba Japan University of Bordeaux LaBRI INRIA Bordeaux Sud-Ouest France

ISBN: (纸本)9783319038889

On the work sharing among GPUs and CPU cores on GPU equipped clusters, it is a critical issue to keep load balance among these heterogeneous computing resources. We have been developing a runtime system for this problem on PGAS language named XcalableMP-dev/ StarPU [1]. through the development, we found the necessity of adaptive load balancing for GPU/CPU work sharing to achieve the best performance for various application codes. In this paper, we enhance our language system XcalableMP-dev/ StarPU to add a new feature which can control the task size to be assigned to these heterogeneous resources dynamically during application execution. As a result of performance evaluation on several benchmarks, we confirmed the proposed feature correctly works and the performance with heterogeneous work sharing provides up to about 40% higher performance than GPU-only utilization even for relatively small size of problems. © Springer international Publishing Switzerland 2013.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A linguistic-based method for automatically extracting spatial relations from large non-structured data

A linguistic-based method for automatically extracting spati...

引用

13th international conference on algorithms and architectures for parallel processing, ICA3PP 2013

作者： Elia, Annibale Guglielmo, Daniela Maisto, Alessandro Pelosi, Serena Department of Political Social and Communication Science SemanticItaLab University of Salerno via Giovanni Paolo II 132 84084 Fisciano Italy Department of Electric Engineering and Information Technologies University of Naples Federico II via Claudio 21 80125 Napoli Italy

ISBN: (纸本)9783319038889

this paper presents a Lexicon-Grammar based method for automatic extraction of spatial relations from Italian non-structured data. We used the software Nooj to build sophisticated local grammars and electronic dictionaries associated with the lexicon-grammar classes of the Italian intransitive spatial verbs (i.e. 234 verbal entries) and we applied them to the Italian text Il Codice da Vinci ('the Da Vinci Code', by Dan Brown) in order to parse the spatial predicate-arguments structures. In addition, Nooj allowed us to automatically annotate (in XML format) the words (or the sequence of words) that in each sentence (S) of the text play the 'spatial roles' of Figure (F), Motion (M) and Ground (G). Finally the results of the experiment and the evaluation of this method will be discussed. © Springer international Publishing Switzerland 2013.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Scheduling Precedence-Constrained Jobs on Two Resources to Minimize the Total Weighted Completion Time

Scheduling Precedence-Constrained Jobs on Two Resources to M...

引用

5th international conference on Industrial Engineering and Systems Management (IEEE IESM)

作者： Rajneesh, R. Elmaghraby, S. E. SAS Inst Inc Cary NC 27513 USA N Carolina State Univ Raleigh NC 27695 USA

ISBN: (纸本)9782960053241

We study a problem of scheduling precedence-constrained jobs on two pre-specified resources, in which a job may require either resource or both resources with the objective of minimizing the weighted completion time. We present two mathematical formulations of the problem: a dynamic programming (DP) model and a binary integer programming (BIP) model. Due to the strong NP-hardness of the problem, we restrict our analysis to series-parallel (s/p) graphs. We focus on reducing the state space in the DP model to obtain an optimal, or near optimal, solution. We compare, through a number of experiments with varying number of jobs, resource requirements, and topology of the precedence among the jobs, the performance of the DP and the BIP models relative to the quality of the final result and the time taken to reach a conclusion.

关键词： Completion time jobs HSPA5 gene data processing state space Problem Formulation optimal solution

来源：评论

学校读者我要写书评

暂无评论

2013 IEEE international conference on Computational Photography, ICCP 2013

2013 IEEE International Conference on Computational Photogra...

引用

2013 5th IEEE international conference on Computational Photography, ICCP 2013

ISBN: (纸本)9781467364645

the proceedings contain 20 papers. the topics discussed include: a generative focus measure with application to omnifocus imaging;combining the power of internal and external denoising;descattering of transmissive observation using parallel high-frequency illumination;edge-based blur kernel estimation using patch priors;focal sweep videography with deformable optics;high-rank coded aperture projection for extended depth of field;image enhancement in projectors via optical pixel shift and overlay;multi-modality depth map fusion using primal-dual optimization;outdoor photometric stereo;post-processing approach for radiometric self-calibration of video;random coded sampling for high-speed HDR video;simultaneous HDR image reconstruction and denoising for dynamic scenes;super-resolution with randomly shaped pixels and sparse regularization;and transformation guided image completion.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fifth international conference on Machine Vision, ICMV 2012: Computer Vision, Image Analysis and processing

Fifth International Conference on Machine Vision, ICMV 2012:...

引用

5th international conference on Machine Vision: Computer Vision, Image Analysis and processing, ICMV 2012

ISBN: (纸本)9780819495877

the proceedings contain 69 papers. the topics discussed include: an extension of the Felzenszwalb-Huttenlocher segmentation to 3D point clouds;multi-vehicles tracking in traffic crossroad based on fast approximate optimal objective function with label costs;super-resolution analysis for passive microwave images using FIPOCS;warped document image correction method based on heterogeneous registration strategies;a NIR scene simulation method based on reflection properties of target;a GPU-paralleled implementation of an enhanced face recognition algorithm;feasibility analysis on integration of luminous environment measuring and design based on exposure curve calibration;a new approach to the form and position error measurement of the auto frame surface based on laser;and research on energy-saving optimal control of trains in a following operation under a fixed four-aspect autoblock system based on multi-dimension parallel GA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

High performance GPU accelerated local optimization in TSP

High performance GPU accelerated local optimization in TSP

引用

2013 IEEE 37th Annual Computer Software and Applications conference, COMPSAC 2013

作者： Rocki, Kamil Suda, Reiji University of Tokyo Graduate School of Information Science and Technology Department of Computer Science 7-3-1 Hongo Bunkyo-ku Tokyo Japan

ISBN: (纸本)9780769549798

this paper presents a high performance GPU accelerated implementation of 2-opt local search algorithm for the Traveling Salesman Problem (TSP). GPU usage significantly decreases the execution time needed for tour optimization, however it also requires a complicated and well tuned implementation. With the problem size growing, the time spent on local optimization comparing the graph edges grows significantly. According to our results based on the instances from the TSPLIB library, the time needed to perform a simple local search operation can be decreased approximately 5 to 45 times compared to a corresponding parallel CPU code implementation using 6 cores. the code has been implemented in OpenCL and as well as in CUDA and tested on AMD and NVIDIA devices. the experimental studies show that the optimization algorithm using the GPU local search converges from up to 300 times faster compared to the sequential CPU version on average, depending on the problem size. the main contributions of this paper are the problem division scheme exploiting data locality which allows to solve arbitrarily big problem instances using GPU and the parallel implementation of the algorithm itself. © 2013 IEEE.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Blending SQL and NewSQL Approaches Reference architectures for Enterprise Big Data Challenges

Blending SQL and NewSQL Approaches Reference Architectures f...

引用

5th international conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)

作者： Doshi, Kshitij A. Zhong, Tao Lu, Zhongyan Tang, Xi Lou, Ting Deng, Gang Intel Software & Serv Grp Santa Clara CA 95052 USA

ISBN: (纸本)9780769551067

As it becomes ever more pervasively engaged in data driven commerce, a modern enterprise becomes increasingly dependent upon reliable and high speed transaction services. At the same time it aspires to capitalize upon large inflows of information to draw timely business insights and improve business results. these two imperatives are frequently in conflict because of the widely divergent strategies that must be pursued: the need to bolster on-line transactional processing generally drives a business towards a small cluster of high-end servers running a mature, ACID compliant, SQL relational database;while high throughput analytics on massive and growing volumes of data favor the selection of very large clusters running non-traditional (NoSQL/NewSQL) databases that employ softer consistency protocols for performance and availability. this paper describes an approach in which the two imperatives are addressed by blending the two types (scale-up and scale-out) of data processing. It breaks down data growth that enterprises experience into three classes-Chronological, Horizontal, and Vertical;and picks out different approaches for blending SQL and NewSQL platforms for each class. To simplify application logic that must comprehend both types of data platforms, the paper describes two new capabilities: (a) a data integrator to quickly sift out updates that happen in an RDBMS and funnel them into a NewSQL database, and (b) extensions to the Hibernate-OGM framework that reduce the programming sophistication required for integrating HBase and Hive backends with application logic designed for relational front ends. Finally the paper details several instances in which these approaches have been applied in real-world, at a number of software vendors with whom the authors have collaborated on design, implementation and deployment of blended solutions.

关键词： Databases SQL NoSQL NewSQL Big Data Clustering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共330页 << < 159 160 161 162 163 164 165 166 167 168 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：