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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,016 篇 工学
- 1,781 篇 计算机科学与技术...
- 945 篇 软件工程
- 297 篇 信息与通信工程
- 292 篇 电气工程
- 246 篇 电子科学与技术（可...
- 95 篇 控制科学与工程
- 52 篇 机械工程
- 49 篇 生物工程
- 44 篇 光学工程
- 41 篇 生物医学工程（可授...
- 37 篇 仪器科学与技术
- 28 篇 动力工程及工程热...
- 27 篇 化学工程与技术
- 21 篇 土木工程
- 20 篇 力学（可授工学、理...
- 19 篇 材料科学与工程（可...
- 18 篇 建筑学
542 篇 理学
- 386 篇 数学
- 107 篇 物理学
- 57 篇 生物学
- 48 篇 系统科学
- 32 篇 化学
- 32 篇 统计学（可授理学、...
197 篇 管理学
- 121 篇 管理科学与工程(可...
- 81 篇 图书情报与档案管...
- 56 篇 工商管理
51 篇 医学
- 42 篇 临床医学
- 16 篇 基础医学(可授医学...
19 篇 文学
17 篇 经济学
- 17 篇 应用经济学
15 篇 法学
- 14 篇 社会学
12 篇 农学
4 篇 教育学
3 篇 军事学

主题

345 篇 parallel process...
200 篇 parallel process...
192 篇 computer archite...
157 篇 graphics process...
153 篇 parallel archite...
113 篇 parallel algorit...
109 篇 graphics process...
106 篇 hardware
86 篇 image processing
81 篇 computational mo...
75 篇 signal processin...
71 篇 concurrent compu...
66 篇 instruction sets
65 篇 algorithm design...
65 篇 multicore proces...
63 篇 field programmab...
60 篇 parallel program...
58 篇 parallel computi...
53 篇 gpu
51 篇 optimization

机构

10 篇 natl univ def te...
8 篇 college of compu...
6 篇 hosei univ dept ...
6 篇 college of compu...
5 篇 univ aizu dept c...
5 篇 inria rennes
5 篇 national univers...
5 篇 natl univ def te...
5 篇 city university ...
5 篇 science and tech...
4 篇 chinese acad sci...
4 篇 school of comput...
4 篇 carleton univ sc...
4 篇 univ chinese aca...
4 篇 school of comput...
4 篇 charles univ pra...
4 篇 department of co...
4 篇 school of comput...
4 篇 hainan internati...
4 篇 purple mountain ...

作者

10 篇 liu jie
9 篇 jack dongarra
8 篇 roman wyrzykowsk...
7 篇 wang qinglin
7 篇 konrad karczewsk...
7 篇 quintana-orti en...
6 篇 gepner pawel
6 篇 peng shietung
6 篇 li kuan-ching
6 篇 li yamin
6 篇 chu wanming
6 篇 prasanna viktor ...
6 篇 rothermel kurt
6 篇 yang chao-tung
5 篇 dongarra jack
5 篇 olas tomasz
5 篇 hannig frank
5 篇 wanlei zhou
5 篇 qian depei
5 篇 ewa deelman

语言

2,822 篇 英文
51 篇 其他
17 篇 中文
1 篇 俄文

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

共 2885 条记录，以下是1491-1500 订阅

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

详细简洁

排序：

Collecting and Using Comparable Corpora for Statistical Machine Translation 8

Collecting and Using Comparable Corpora for Statistical Mach...

引用

8th international conference on Language Resources and Evaluation (LREC)

作者： Skadina, Inguna Aker, Ahmet Mastropavlos, Nikos Su, Fangzhong Tufis, Dan Verlic, Mateja Vasiljevs, Andrejs Babych, Bogdan Clough, Paul Gaizauskas, Robert Glaros, Nikos Paramita, Monica Lestari Pinnis, Marcis Tilde United Kingdom University of Sheffield United Kingdom Institute for Language and Speech Processing United Kingdom University of Leeds United Kingdom Research Institute for Artificial Intelligence Romanian Academy Romania Zemanta Romania

ISBN: (纸本)9782951740877

Lack of sufficient parallel data for many languages and domains is currently one of the major obstacles to further advancement of automated translation. the ACCURAT project is addressing this issue by researching methods how to improve machine translation systems by using comparable corpora. In this paper we present tools and techniques developed in the ACCURAT project that allow additional data needed for statistical machine translation to be extracted from comparable corpora. We present methods and tools for acquisition of comparable corpora from the Web and other sources, for evaluation of the comparability of collected corpora, for multi-level alignment of comparable corpora and for extraction of lexical and terminological data for machine translation. Finally, we present initial evaluation results on the utility of collected corpora in domain-adapted machine translation and real-life applications.

关键词： comparable corpora under-resourced languages machine translation

来源：评论

学校读者我要写书评

暂无评论

parallelization of EULAG Model on Multicore architectures with GPU Accelerators

Parallelization of EULAG Model on Multicore Architectures wi...

引用

9th international conference on parallel processing and Applied Mathematics (PPAM)

作者： Rojek, Krzysztof Szustak, Lukasz Czestochowa Tech Univ PL-42201 Czestochowa Poland

ISBN: (纸本)9783642314995;9783642315008

EULAG (Eulerian/semi-Lagrangian fluid solver) is an established computational model developed by the group headed by Piotr K. Smolarkiewicz for simulating thermo-fluid flows across a wide range of scales and physical scenarios. In this paper we focus on development of the most time-consuming calculations of the EULAG model, which is multidimensional positive definite advection transport algorithm (MPDATA). Our work consists of two parts. the first part is based on the GPU parallelization using ATI Radeon HD 5870 GPU, NVIDIA Tesla C1060 GPU, and Fermi based NVIDIA Tesla M2070-Q, while the second one assumes the multicore CPU parallelization using AMD Phenom II X6 CPU, and Intel Xeon E3-1200 CPU with Sandy Bridge architecture. In our work, we use such standards for multicore and GPGPU programming as OpenCL and OpenMP. the GPU parallelization is based on decomposition of the algorithm into several smaller tasks called kernels. they are executed in a FIFO order corresponding to the dependency tree expressing data dependencies between kernels. To optimize performance of the resulting implementation, we utilize the extensive vectorization of each kernel, as well as overlapping of data transfer with computations. At the same time, when considering CPU parallelization we focus on multicore processing, vectorization and cache reusing. To achieve high efficiency of computations, the SIMD processing is applied using standard SSE and new AVX extensions. In this paper we provide performance analysis based on the Roof line Model, which shows inherent hardware limitations for MPDATA, as well as potential benefit and priority of optimizations. In order to alleviate memory bottleneck and improve efficient cache reusing, we propose to use the loop tiling technique.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A spiking neural P system simulator based on CUDA

A spiking neural P system simulator based on CUDA

引用

12th international conference on Membrane Computing, CMC 2011

作者： Cabarle, Francis George C. Adorna, Henry Martínez, Miguel A. Algorithms and Complexity Lab. Department of Computer Science University of the Philippines Diliman Diliman 1101 Quezon City Philippines Research Group on Natural Computing Department of Computer Science and Artificial Intelligence University of Seville Avda. Reina Mercedes s/n 41012 Sevilla Spain

ISBN: (纸本)9783642280238

In this paper we present a Spiking Neural P system (SNP system) simulator based on graphics processing units (GPUs). In particular we implement the simulator using NVIDIA CUDA enabled GPUs. the massively parallel architecture of current GPUs is very suitable for the maximally parallel computations of SNP systems. We simulate a wider variety of SNP systems, after presenting a previous work on SNP system matrix representation which led to their simulation in GPUs, and the simulation algorithm included here. Finally, we compare and present the performance speedups of the CPU-GPU based simulator over the CPU only simulator. © 2012 Springer-Verlag.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Text Simplification Tools for Spanish 8

Text Simplification Tools for Spanish

引用

8th international conference on Language Resources and Evaluation (LREC)

作者： Bott, Stefan Saggion, Horacio Mille, Simon Univ Pompeu Fabra Dept Informat & Commun Technol Barcelona 08018 Spain

ISBN: (纸本)9782951740877

In this paper we describe the development of a text simplification system for Spanish. Text simplification is the adaptation of a text to the special needs of certain groups of readers, such as language learners, people with cognitive difficulties and elderly people, among others. there is a clear need for simplified texts, but manual production and adaptation of existing texts is labour intensive and costly. Automatic simplification is a field which attracts growing attention in Natural Language processing, but, to the best of our knowledge, there are no simplification tools for Spanish. We present a prototype for automatic simplification, which shows that the most important structural simplification operations can be successfully treated with an approach based on rules which can potentially be improved by statistical methods. For the development of this prototype we carried out a corpus study which aims at identifying the operations a text simplification system needs to carry out in order to produce an output similar to what human editors produce when they simplify texts.

关键词： Text Simplification Monolingual parallel Corpora Dependency Tree Transduction

来源：评论

学校读者我要写书评

暂无评论

Introducing 'bones': A parallelizing source-to-source compiler based on algorithmic skeletons 5

Introducing 'bones': A parallelizing source-to-source compil...

引用

5th Workshop on General-Purpose Computation on Graphics processing Units, GPGPU-5 - Held in Cooperation with ACM ASPLOS XVII

作者： Nugteren, Cedric Corporaal, Henk Eindhoven University of Technology Netherlands

ISBN: (纸本)9781450312332

Recent advances in multi-core and many-core processors requires programmers to exploit an increasing amount of parallelism from their applications. Data parallel languages such as CUDA and OpenCL make it possible to take advantage of such processors, but still require a large amount of effort from programmers. A number of parallelizing source-to-source compilers have recently been developed to ease programming of multi-core and many-core processors. this work presents and evaluates a number of such tools, focused in particular on C-to-CUDA transformations targeting GPUs. We compare these tools both qualitatively and quantitatively to each other and identify their strengths and weaknesses. In this paper, we address the weaknesses by presenting a new classification of algorithms. this classification is used in a new source-to-source compiler, which is based on the algorithmic skeletons technique. the compiler generates target code based on skeletons of parallel structures, which can be seen as parameterisable library implementations for a set of algorithm classes. We furthermore demonstrate that the presented compiler requires little modifications to the original sequential source code, generates readable code for further fine-tuning, and delivers superior performance compared to other tools for a set of 8 image processing kernels. © 2012 ACM.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

An experimental comparison of load balancing strategies in a web computing environment

An experimental comparison of load balancing strategies in a...

引用

9th international conference on parallel processing and Applied Mathematics, PPAM 2011

作者： Gehweiler, Joachim Kling, Peter Meyer Auf Der Heide, Friedhelm Heinz Nixdorf Institute and Computer Science Department University of Paderborn Paderborn 33102 Germany

ISBN: (纸本)9783642314995

Web Computing is a variant of parallel computing where the idle times of PCs donated by worldwide distributed users are employed to execute parallel programs. the PUB-Web library developed by us supports this kind of usage of computing resources. A major problem for the efficient execution of such parallel programs is load balancing. In the Web Computing context, this problem becomes more difficult because of the dynamic behavior of the underlying "parallel computer": the set of available processors (donated PCs) as well as their availability (idle times) change over time in an unpredictable fashion. In this paper, we experimentally evaluate and compare load balancing algorithms in this scenario, namely a variant of the well-established Work Stealing algorithm and strategies based on a heterogeneous version of distributed hash-tables (DHHTs) introduced recently. In order to run a meaningful experimental evaluation, we employ, in addition to our Web Computing library PUB-Web, realistic data sets for the job input streams and for the dynamics of the availability of the resources. Our experimental evaluations suggest that Work Stealing is the better strategy if the number of processes ready to run matches the number of available processors. But a suitable variant of DHHTs outperforms Work Stealing if there are significantly more processes ready to run than available processors. © 2012 Springer-Verlag.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Cloud statistical significance estimation for optimal local alignment of huge DNA sequences

Cloud statistical significance estimation for optimal local ...

引用

the international conference on Informatics and Systems (INFOS)

作者： Ahmad M. Hosny Howida A. Shedeed Ashraf S. Hussein Mohamed F. Tolba Department of Scientific Computing Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt

Confidence in a pairwise local sequence alignment is a fundamental problem in bioinformatics. For huge DNA sequences, this problem is highly compute-intensive because it involves evaluating thousands of local alignments to construct an empirical score distribution. Recent parallel solutions support only small sequence sizes and/or are based on sophisticated infrastructures that are not available for most research labs. this paper presents an efficient parallel solution for evaluating the statistical significance for a pair of huge DNA sequences using cloud infrastructures. this solution can receive requests from various researchers via web-portal and allocate resources according to the demand. As it is cloud-based solution, it improves robustness, scalability and performance. the fundamental innovation in this research work is proposing an efficient solution that utilizes both shared and distributed memory architectures using the cloud technology to enhance the performance of evaluating the statistical significance for pair of DNA sequences. In this manner, the condition of the sequence size is released to be in megabyte-scale, which was not supported before. the present solution was verified against other recent parallel solutions, and the performance evaluation was carried out on Microsoft's Cloud. the results show that the performance scales with relatively linear speedup, as the number of instances increases.

关键词： Cloud computing Computer architecture DNA Estimation Bioinformatics Computers parallel processing

来源：评论

学校读者我要写书评

暂无评论

SIMT Microscheduling: Reducing thread Stalling in Divergent Iterative algorithms

SIMT Microscheduling: Reducing Thread Stalling in Divergent ...

引用

Euromicro conference on parallel, Distributed and Network-Based processing

作者： Steffen Frey Guido Reina thomas Ertl Visualization Research Center University of Stuttgart Stuttgart Germany

the global scheduler of a current GPU distributes thread blocks to symmetric multiprocessors (SM), which schedule threads for execution with the granularity of a warp. threads in a warp execute the same code path in lockstep, which potentially leads to a large amount of wasted cycles for divergent control flow. In order to overcome this general issue of SIMT architectures, we propose techniques to relax divergence on the fly within a computation kernel in order to achieve a much higher total utilization of processing cores. We propose techniques for branch and loop divergence (which may also be combined) switching to suitable tasks during a GPU kernel run every time divergence occurs. Our newly introduced techniques can easily be applied to arbitrary iterative algorithms and we evaluate the performance and effectiveness of our approach exemplarily via synthetic and real world applications.

关键词： Instruction sets Context Switches Kernel Graphics processing unit Memory management Hardware

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm calibration for two objective scheduling parallel jobs on hierarchical grids

Genetic algorithm calibration for two objective scheduling p...

引用

9th international conference on parallel processing and Applied Mathematics, PPAM 2011

作者： Yaurima-Basaldua, Victor Hugo Tchernykh, Andrei Castro-Garcia, Yair Villagomez-Ramos, Victor Manuel Burtseva, Larisa CESUES Superior Studies Center San Luis R.C. Mexico CICESE Research Center Ensenada Mexico Autonomous University of Baja California Mexicali Mexico

ISBN: (纸本)9783642314995

this paper addresses non-preemptive offline scheduling parallel jobs on a Grid. We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to a suitable Grid site, while at the second stage, local scheduling is independently applied to each site. In this environment, one of the big challenges is to provide a job allocation that allows more efficient use of resources and user satisfaction. In general, the criteria that help achieve these goals are often in conflict. To solve this problem, two-objective genetic algorithm is proposed. We conduct comparative analysis of five crossover and three mutation operators, and determine most influential parameters and operators. To this end multi factorial analysis of variance is applied. © 2012 Springer-Verlag.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Configurable Booth-encoded Modulo 2(exp n)±1 Multipliers

Configurable Booth-encoded Modulo 2(exp n)±1 Multipliers

引用

PRIME 2012;8th conference on Ph.D. Research in Microelectronics & Electronics

作者： Evangelos Vassalos Dimitris Bakalis Haridimos T. Vergos

Multi-moduli architectures are very useful for reconfigurable digital processors and fault-tolerant systems that utilize the Residue Number System (RNS). In this paper we propose a novel architecture for configurable modulo 2 (exp n)±1 multipliers. It uses the modified Booth encoding of the input operand for deriving the required partial products and an adder tree followed by a sparse parallel-prefix final adder for their addition. Experimental results show that the proposed multipliers offer significant savings in area and delay compared to those previously reported in the literature. Keywords - modulo 2 (exp n)±1 arithmetic; modulo multipliers; Boothencoding; configurable circuits; residue number system

关键词： Adders Logic gates Delay Computer architecture Digital signal processing Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共289页 << < 146 147 148 149 150 151 152 153 154 155 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：