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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1431-1440 订阅

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

详细简洁

排序：

Enhancing parallelism of Tile Bidiagonal Transformation on Multicore architectures Using Tree Reduction 1

引用

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

作者： Ltaief, Hatem Luszczek, Piotr Dongarra, Jack KAUST Supercomputing Laboratory Thuwal Saudi Arabia University of Tennessee Knoxville TN USA Oak Ridge National Laboratory USA University of Manchester United Kingdom

ISBN: (数字)9783642314643

ISBN: (纸本)9783642314636;9783642314643

the objective of this paper is to enhance the parallelism of the tile bidiagonal transformation using tree reduction on multicore architectures. First introduced by Ltaief et. al [LAPACK Working Note # 247, 2011], the bidiagonal transformation using tile algorithms with a two-stage approach has shown very promising results on square matrices. However, for tall and skinny matrices, the inherent problem of processing the panel in a domino- like fashion generates unnecessary sequential tasks. By using tree reduction, the panel is horizontally split, which creates another dimension of parallelism and engenders many concurrent tasks to be dynamically scheduled on the available cores. the results reported in this paper are very encouraging. the new tile bidiagonal transformation, targeting tall and skinny matrices, outperforms the state-of-the-art numerical linear algebra libraries LAPACK V3.2 and Intel MKL ver. 10.3 by up to 29-fold speedup and the standard two-stage PLASMA BRD by up to 20-fold speedup, on an eight socket hexa-core AMD Opteron multicore shared-memory system.

关键词： Bidiagonal Transformation Tree Reduction High Performance Computing Multicore Architecture Dynamic Scheduling

来源：评论

学校读者我要写书评

暂无评论

Mining bilingual linguistic patterns with aligned and parsed bilingual corpus

Mining bilingual linguistic patterns with aligned and parsed...

引用

8th international conference on Information Science and Digital Content Technology, ICIDT 2012

作者： Wang, Bo Meng, Fanqi Hou, Yuexian School of Computer Science and Technology Tianjin University Tianjin 300072 China

ISBN: (纸本)9788988678695

Classical grammar for natural languages, which is defined by the linguistics, is widely used in many natural languages processing (NLP) tasks, such as information extraction, machine translation and parsing. the classical grammar is well defined but is context free and does not include the complex patterns which contain multiple linguistic units. On the other hand, there are also many simple patterns which are not included in the classical grammar but are useful in the NLP tasks. therefore, the recognition of special linguistic patterns from natural language is an important step in various NLP systems. We propose an unsupervised method to automatically discover the complex monolingual linguistic patterns from a classically parsed and aligned bilingual corpus. And all the patterns in one language are qualified by the other parallel language. A specialized and efficient algorithm is applied to mine the frequent bilingual subtrees in the forest and the found subtrees are formalized as the linguistic patterns. © 2012 AICIT.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Design of Unified Support Vector Machine Circuit for Pedestrians and Cars Detection

Design of Unified Support Vector Machine Circuit for Pedestr...

引用

10th IEEE international New Circuits and Systems conference (NEWCAS)

作者： Kim, Soojin Lee, Seonyoung Min, Kyoungwon Cho, Kyeongsoon Hankuk Univ Foreign Studies Dept Elect & Informat Engn Yongin South Korea Korea Elect Technol Inst SoC Platform Res Ctr Sungnam South Korea

ISBN: (纸本)9781467308595

this paper describes the design of unified support vector machine circuit for pedestrians and cars detection. By unifying the algorithms and architectures of linear and nonlinear SVM classifications, the proposed circuit can support both linear and non-linear classifications very efficiently in terms of circuit size and performance. the circuit size is minimized by sharing most of the resources required in the computation for both classification types. parallel architecture with pipeline is adopted to accelerate the processing speed to handle a large amount of operations for real-time processing. 48x96 and 64x64 sliding windows with 6 window strides are used to detect pedestrians and cars, respectively. the synthesized circuit using 65nm standard cell library consists of 848,349 gates and its maximum operating frequency is 435MHz. the circuit can process 91.9 640x480 image frames per second assuming three cameras equipped on front, right and left side positions of the vehicle.

关键词： Pedestrians Cars Support Vector Network maximum operating frequency ARCHITECTURE processing SPEED Building construction pipeline Linear

来源：评论

学校读者我要写书评

暂无评论

A verified library of algorithmic skeletons on evenly distributed arrays

A verified library of algorithmic skeletons on evenly distri...

引用

12th international conference on algorithms and architectures for parallel processing, ICA3PP 2012

作者： Bousdira, Wadoud Loulergue, Frédéric Tesson, Julien LIFO University of Orléans France Kochi University of Technology Japan

ISBN: (纸本)9783642330773

To make parallel programming as widespread as parallel architectures, more structured parallel programming paradigms are necessary. One of the possible approaches are algorithmic skeletons. they can be seen as higher order functions implemented in parallel. Algorithmic skeletons offer a simple interface to the programmer without all the details of parallel implementations as they abstract the communications and the synchronisations of parallel activities. To write a parallel program, users have to combine and compose the skeletons. Orléans Skeleton Library (OSL) is an efficient meta-programmed C++ library of algorithmic skeletons that manipulate distributed arrays. A prototype implementation of OSL exists as a library written with the function parallel language Bulk Synchronous parallel ML (BSML). In this paper we are interested in verifying the correctness of a subset of this prototype implementation. To do so, we give a functional specification of a subset of OSL and we prove the correctness of the BSML implementation with respect to this functional specification, using the Coq proof assistant. To illustrate how the user could use these skeletons, we prove the correctness of two applications implemented with them. © 2012 Springer-Verlag.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

GAIA extended research infrastructure: Sensing, connecting, and processing the real world

GAIA extended research infrastructure: Sensing, connecting, ...

引用

8th international ICST conference on Testbeds and Research Infrastructures: Development of Networks and Communities, TridentCom 2012

作者： Martinez-Julia, Pedro Jara, Antonio J. Skarmeta, Antonio F. Department of Communication and Information Engineering University of Murcia 30100 Murcia Spain

ISBN: (纸本)9783642355752

the GAIA Extended Research Infrastructure is located at the southeast of Spain. It targets the research of Future Internet architectures and comprises several facilities from the University of Murcia and the Spanish government. It offers a vertical infrastructure, composed of a backend with high capacity of data storage, communication, and processing, together with a frontend with an extended set of multidisciplinary testbeds, deployments, and living labs for the ubiquitous monitoring, sensing, and processing. that said, it offers a highly flexible framework for experimentation with architectures and protocols for the Future Internet. In fact, it has been used in many research projects to evaluate their outputs from the communications and telematics point of view. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

关键词： Testbeds

来源：评论

学校读者我要写书评

暂无评论

Overcoming the scalability limitations of parallel star schema data warehouses

Overcoming the scalability limitations of parallel star sche...

引用

12th international conference on algorithms and architectures for parallel processing, ICA3PP 2012

作者： Costa, João Pedro Cecílio, José Martins, Pedro Furtado, Pedro ISEC-Institute Polytechnic of Coimbra Portugal University of Coimbra Portugal

ISBN: (纸本)9783642330773

Most Data Warehouses (DW) are stored in Relational Database Management Systems (RDBMS) using a star-schema model. While this model yields a trade-off between performance and storage requirements, huge data warehouses experiment performance problems. Although parallel shared-nothing architectures improve on this matter by a divide-and-conquer approach, issues related to parallelizing join operations cause limitations on that amount of improvement, since they have implications concerning placement, the need to replicate data and/or on-the-fly repartitioning. In this paper, we show how these limitations can be overcome by replacing the star schema by a universal relation approach for more efficient and scalable parallelization. We evaluate the proposed approach using TPC-H benchmark, to both demonstrate that it provides highly predictable response times and almost optimal speedup. © 2012 Springer-Verlag.

关键词： Data warehouses

来源：评论

学校读者我要写书评

暂无评论

parallel FEM Adaptation on Hierarchical architectures 1

引用

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

作者： Olas, Tomasz Wyrzykowski, Roman Gepner, Pawel Czestochowa Tech Univ Dabrowskiego 69 PL-42201 Czestochowa Poland Intel Corp Santa Clara CA 95051 USA

ISBN: (数字)9783642314643

ISBN: (纸本)9783642314636;9783642314643

the parallel FEM package NuscaS allows us to solve adaptive FEM problems with 3D unstructured meshes on distributed-memory parallel computers such as PC-clusters. In our previous works, a new method for parallelizing the FEM adaptation was presented, based on using the 8-tetrahedra longest-edge partition. this method relies on a decentralized approach, and is more scalable in comparison to previous implementations requiring a centralized synchronizing node. At present nodes of clusters contain more and more processing cores. their efficient utilization is crucial for providing high performance of numerical codes. In this paper, different schemes of mapping the mesh adaptation algorithm on such hierchical architectures are presented and compared. these schemes use either the pure message-passing model, or the hybrid approach which combines shared-memory and message-passing models. Also, we investigate an approach for adapting the pure MPI model to hierarchical topology of clusters with multi-core nodes.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Study of Hierarchical N-Body Methods for Network-on-Chip architectures 1

引用

17th international Euro-Par conference on parallel processing

作者： Xu, thomas Canhao Liljeberg, Pasi Tenhunen, Hannu Turku Ctr Comp Sci Joukahaisenkatu 3-5 B Turku 20520 Finland Univ Turku Dept Informat Technol Turku 20014 Finland

ISBN: (数字)9783642297403

ISBN: (纸本)9783642297403;9783642297397

In this paper, we study two hierarchical N-Body methods for Network-on-Chip (NoC) architectures. the modern Chip Multiprocessor (CMP) designs are mainly based on the shared-bus communication architecture. As the number of cores increases, it suffers from high communication delays. therefore, NoC based architecture is proposed. the N-Body problem is a classical problem of approximating the motion of bodies. Two methods, namely Barnes-Hut (Barnes) and Fast Multipole (FMM), have been developed for fast simulation. the two algorithms have been implemented and studied in conventional computer systems and Graphics processing Units (GPUs). However, as a promising unconventional multicore architecture, the evaluation of N-Body methods in a NoC platform has not been well addressed. We define a NoC model based on state-of-the-art systems. Evaluation results are presented using a cycle accurate full system simulator. Experiments show that, Barnes scales better (53.7x/Barnes and 36.6x/FMM for 64 processing elements) and requires less cache than FMM. However, we observe hot-spot traffic in Barnes. Our analysis and experiment results provide a guideline for studying N-Body methods in a NoC platform.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for parabolic problems on graphs

Parallel algorithms for parabolic problems on graphs

引用

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

作者： Čiegis, Raimondas Tumanova, Natalija Vilnius Gediminas Technical University Sauletekio al. 11 Vilnius LT10223 Lithuania

ISBN: (纸本)9783642314995

In this paper two parallel numerical algorithms for solution of parabolic problems on graphs are investigated. the fully implicit and predictor-corrector finite difference schemes are proposed to approximate the differential equations on the given graph. the parallelization of the discrete algorithm is based on the domain decomposition method. Scalability analysis of the parallel algorithms is done. Some results of numerical simulations are presented and the efficiency of the proposed parallel algorithms is investigated. © 2012 Springer-Verlag.

关键词： Finite difference method

来源：评论

学校读者我要写书评

暂无评论

Crayons: An Azure Cloud based parallel System for GIS Overlay Operations

Crayons: An Azure Cloud based Parallel System for GIS Overla...

引用

25th ACM/IEEE international conference for High Performance Computing, Networking, Storage and Analysis (SC)

作者： Agarwal, Dinesh Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9780769549569;9781467362184

processing of extremely large polygonal (vector-based) spatial datasets has been a long-standing research challenge for scientists in the Geographic Information Systems and Science (GIS) community. Surprisingly, it is not for the lack of individual parallel algorithm; we discovered that the irregular and data intensive nature of the underlying processing is the main reason for the meager amount of work by way of system design and implementation. Furthermore, of all the systems reported in the literature, very few deal with the complexities of vector-based datasets and none, including commercial systems, on the cloud platform. We have designed and implemented an open-architecture-based system named Crayons for Windows Azure cloud platform using state-of-the-art techniques. We have implemented three different architectures of Crayons with different load balancing schemes. Crayons scales well for sufficiently large data sets, achieving end-to-end absolute speedup of over 28-fold employing 100 Azure processors. For smaller and more irregular workload, it still yields over 10-fold speedup.

关键词： cloud computing geographic information systems parallel algorithms resource allocation software architecture vectors

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共289页 << < 140 141 142 143 144 145 146 147 148 149 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：