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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

344 篇 parallel process...
200 篇 parallel process...
193 篇 computer archite...
157 篇 graphics process...
153 篇 parallel archite...
113 篇 parallel algorit...
109 篇 graphics process...
106 篇 hardware
86 篇 image processing
80 篇 computational mo...
75 篇 signal processin...
71 篇 concurrent compu...
66 篇 instruction sets
65 篇 algorithm design...
65 篇 multicore proces...
63 篇 field programmab...
60 篇 parallel program...
59 篇 parallel computi...
53 篇 gpu
50 篇 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,847 篇 英文
26 篇 其他
13 篇 中文
1 篇 俄文

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

共 2884 条记录，以下是1911-1920 订阅

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

详细简洁

排序：

parallel simulated annealing for materialized view selection in data warehousing environments

Parallel simulated annealing for materialized view selection...

引用

8th international conference on algorithms and architectures for parallel processing

作者： Derakhshan, Roozbeh Stantic, Bela Korn, Othmar Dehne, Frank Swiss Fed Inst Technol Zurich Switzerland Griffith Univ Inst Integrated & Intelligent Syst Brisbane Qld Australia Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9783540695004

In order to facilitate efficient query processing, the information contained in data warehouses is typically stored as a set of materialized views. Deciding which views to materialize represent a challenge in order to minimize view maintenance and query processing costs. Some existing approaches are applicable only for small problems, which are far from reality. In this paper we introduce a new approach for materialized view selection using parallel Simulated Annealing (PSA) that selects views from an input Multiple View processing Plan (MVPP). With PSA, we are able to perform view selection on MVPPs having hundreds of queries and thousands of views. Also, in our experimental study we show that our method provides a significant improvement in the quality of the obtained set of materialized views over existing heuristic and sequential simulated annealing algorithms.

关键词： parallel simulated annealing data warehousing materialized view selection

来源：评论

学校读者我要写书评

暂无评论

A general approach to predict the performance order of TSP family problems

A general approach to predict the performance order of TSP f...

引用

8th international conference on algorithms and architectures for parallel processing

作者： Fritzsche, P. Rexachs, D. Luque, E. Univ Autonoma Barcelona Comp Architecture & Operating Syst Dept Barcelona Spain

ISBN: (纸本)9783540695004

parallel computers provide an efficient and economical way to solve large-scale and/or time-constrained scientific, engineering, and industry problems. Consequently, there is a need to predict the performance order of both deterministic and non-deterministic parallel algorithms. the performance prediction of the traveling salesman problem (TSP) is a challenging problem because similar input data sets may cause significant variability in execution times. parallel performance of data-dependent algorithms depends on the problem size, the number of processors, and other parameters. Discovering the main other parameters is the real key to obtain a good estimation of performance order. this paper presents a novel methodology to the problem of predicting the performance of a parallel algorithm for solving the TSP. the entire process explores data in search of patterns and/or relationships detecting the main parameters that affect performance. then, it uses the measured values for this limited number of inputs to produce a multiple-linear-regression model. Finally, the regression equation allows for predicting how the algorithm will respond when given new input data sets. the preliminary experimental results are quite promising.

关键词： performance prediction TSP data-dependent algorithms parallel computing

来源：评论

学校读者我要写书评

暂无评论

parallel query processing in databases on multicore architectures

Parallel query processing in databases on multicore architec...

引用

8th international conference on algorithms and architectures for parallel processing

作者： Acker, Ralph Roth, Christian Bayer, Rudolf Transact Software Willy Brandt Allee 2 D-81829 Munich Germany Tech Univ Munich Inst Informat D-85747 Garching Germany

ISBN: (纸本)9783540695004

In this paper we present a novel and complete approach on how to encapsulate parallelism for relational database query execution that strives for maximum resource utilization for both CPU and disk activities. Its simple and robust design is capable of modeling intra- and inter-operator parallelism for one or more parallel queries in a most natural way. In addition, encapsulation guarantees that the bulk of relational operators can remain unmodified, as long as their implementation is thread-safe. We will show, that with this approach, the problem of scheduling parallel tasks is generalized, so that it can be safely entrusted to the underlying operating system (OS) without suffering any performance penalties. On the contrary, relocation of all scheduling decisions from the DBMS to the OS guarantees a centralized and therefore near-optimal resource allocation (depending on the OS's abilities) for the complete system that is hosting the database server as one of its tasks. Moreover, with this proposal, query parallelization is fully transparent on the SQL interface of the database system. Configuration of the system for effective parallel query execution can be adjusted by the DB administrator by setting two descriptive tuning parameters. A prototype implementation has been integrated into the Transbase (R) relational DBMS engine.

关键词： relational DBMS parallel query processing encapsulation intraoperator inter-operator scheduling optimization

来源：评论

学校读者我要写书评

暂无评论

parallel processing Puzzle N²-1 on cluster architectures performance analysis

Parallel processing Puzzle N<SUP>2</SUP>-1 on cluster archit...

引用

30th international conference on Information Technology Interfaces

作者： Sanz, Victoria de Giusti, Armando Chichizola, Franco Naiouf, Marcelo De Giusti, Laura Instituto de Investigación en Informática (III-LIDI) School of Computer Sciences UNLP

ISBN: (纸本)9789537138127

An analysis of a parallel solution of N-2-1 Puzzle using clusters, is presented. this problem is interesting due to its complexity and related applications, particularly in the field of robotics. A variation of classic heuristics for forecasting the work to be done in order to reach a solution is analyzed, and it is shown that its use significantly improves the time of sequential algorithm A*. then, a parallel solution on a distributed architecture is presented and speedup is analyzed based on the number of processors, efficiency, and the possible superlinearity when scaling the problem.

关键词： parallel algorithms distributed processing speedup superlinearity efficiency scalability

来源：评论

学校读者我要写书评

暂无评论

Real Time Reconfigurability for UWB Receiver

Real Time Reconfigurability for UWB Receiver

引用

8th IEEE international conference on Ultra-Wideband

作者： Naik, R. Singh, J. Le, H. P. Devlin, J. La Trobe Univ Dept Elect Engn Melbourne Vic 3086 Australia La Trobe Univ Ctr Technol Infus Melbourne Vic 3086 Australia

ISBN: (纸本)9781424422166

Real time reconfigurability of the digital backend of UWB receiver has a potential to achieve significant power saving during the acquisition and synchronisation mode of receiver operation. this paper proposes a novel real time reconfigurabilily algorithm which can estimate number of parallel blocks required for the receiver operation for a particular channel condition and switches off the unwanted blacks. As a part of the real time reconfigurability algorithm, modified CLEAN and priority encoder algorithms are proposed for estimation and effective translation algorithms are developed in order to achieve significant reduction in receiver backend power consumption.

关键词： Adaptive control Adaptive signal processing Intelligent systems Reconfigurable architectures

来源：评论

学校读者我要写书评

暂无评论

3D block-based medial axis transform and chessboard distance transform on the CREW PRAM

3D block-based medial axis transform and chessboard distance...

引用

8th international conference on algorithms and architectures for parallel processing

作者： Lin, Shih-Ying Horng, Shi-Jinn Kao, Tzong-Wann Fahn, Chin-Shyurng Fan, Pingzhi Lee, Cheng-Ling Bourgeois, Anu Southwest Jiaotong Univ Inst Mobile Commun Chengdu 610031 Peoples R China Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei Taiwan Natl Taiwan Univ Sci & Technol Dept Comp Sci & Informat Engn Taipei Taiwan Natl United Univ Dept Elect Engn Miaoli Taiwan Technol & Sci Inst Northern Taiwan Dept Elect Engn Taipei Taiwan Natl United Univ Dept Electroopt Engn Miaoli Taiwan Georgia State Univ Dept Comp Sci Atlanta GA 30302 USA

ISBN: (纸本)9783540695004

Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. We achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size N-3, our parallel algorithm can be run in O(logN) time using N-3 processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively. In addition, we have implemented a message passing interface (MPI) program on an AMD Opteron Model 270 cluster system to verify the proposed parallel algorithm, since the PRAM model is not available in the real world. the experimental results show that the speedup is saturated when the number of processors used is more than four, regardless of the problem size.

关键词： parallel algorithm image processing CREW PRAM model block-based medial axis transform chessboard distance transform Euclidean distance transform

来源：评论

学校读者我要写书评

暂无评论

A Distributed Algorithm for 0-1 Knapsack Problem Based on Mobile Agent

A Distributed Algorithm for 0-1 Knapsack Problem Based on Mo...

引用

8th international conference on Intelligent Systems Design and Applications (ISDA 2008)

作者： Qiao Shanping Wang Shixian Lin Yongzheng Zhao Ling Univ Jinan Sch Informat Sci & Engn Jinan 250022 Peoples R China

ISBN: (纸本)9780769533827

the knapsack problem is a typical one of NPC problems, which is easy to be described but difficult to be solved. It is very important in theory and practice to study it. Nowadays there is a variety of research in algorithm for solving it. As the parallel processing technologies develop, the research of effective parallel algorithms for this problem attracts much attention. To run those algorithms needs high level hardware and high performance parallel computers. Using mobile agent technologies, a more effective model to solve the complex distributed problems can be established. Combines mobile agent with the traditional parallel algorithm, the process in a parallel computer can be evolved into the one performed by some ordinary computers. this can avoid the limitation of experiment conditions and provides convenience in practice. In this paper, a distributed algorithm is proposed for the 0-1 knapsack problem based on the mobile agent, and it is feasible and effective in theoretical analysis.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel Computation Techniques for Ontology Reasoning

Parallel Computation Techniques for Ontology Reasoning

引用

7th international Semantic Web conference (ISWC 2008)

作者： Bock, Juergen FZI Res Ctr Informat Technol Karlsruhe Germany

ISBN: (纸本)9783540885634

As current reasoning techniques are not designed for massive parallelisation, usage of parallel computation techniques in reasoning establishes a major research problem. I will propose two possibilities of applying parallel computation techniques to ontology reasoning: parallel processing of independent ontological modules, and tailoring the reasoning algorithms to parallel architectures.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Scheduling of QR factorization algorithms on SMP and multi-core architectures

Scheduling of QR factorization algorithms on SMP and multi-c...

引用

16th Euromicro international conference on parallel, Distributed and Network-Based processing

作者： Quintana-Orti, Gregorio Quintana-Orti, Enrique S. Chan, Ernie de Geijn, Robert A. van Van Zee, Field G. Univ Jaume 1 Dept Ingn & Ciencia Computadores Castellon de La Plana 12071 Spain Univ Texas Austin Dept Comp Sci Austin TX 78712 USA

ISBN: (纸本)9780769530895

this paper examines the scalable parallel implementation of the QR factorization of a general matrix, targeting SMP and multi-core architectures. Two implementations of algorithms-by-blocks are presented. Each implementation views a block of a matrix as the fundamental unit of data, and likewise, operations over these blocks as the primary unit of computation. the first is a conventional blocked algorithm similar to those included in libFLAME and LAPACK but expressed in a way that allows operations in the so-called critical path of execution to be computed as soon as their dependencies are satisfied. the second algorithm captures a higher degree of parallelism with an approach based on Givens rotations while preserving the performance benefits of algorithms based on blocked Householder transformations. We show that the implementation effort is greatly simplified by expressing the algorithms in code with the FLAME/FLASH API, which allows matrices stared by blocks to be viewed and managed as matrices of matrix blocks. the SuperMatrix run-time system utilizes FLASH to assemble and represent matrices but also provides out-of-order scheduling of operations that is transparent to the programmer Scalability of the solution is demonstrated on ccNUMA platform with 16 processors and an SMP architecture with 16 cores.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

parallel Architecture Implementation of a Reliable (k, n) Image Sharing Scheme

Parallel Architecture Implementation of a Reliable (k, n) Im...

引用

14th international conference on parallel and Distributed Systems

作者： Esposito, Robert Mountney, John Bai, Li Silage, Dennis Temple Univ Dept Elect & Comp Engn Philadelphia PA 19122 USA

ISBN: (纸本)9780769534343

this paper presents a hardware implementation of a secure and reliable k-out-of-n threshold based secret image sharing method. the secret image is divided into n image shares so that any k image shares are sufficient to reconstruct the secret image in a lossless manner, but (k-1) or fewer image shares cannot reveal anything about the secret image. this secret sharing method comprises multiple independent computations which are conducive to parallel processing architectures. Fine-grained field programmable gate array (FPGA) architectures are the near optimal hardware platform for performing parallel processing. this paper illustrates the design and implementation of the secret image sharing method for 8-bit grayscale images on an FPGA which enhances execution time. On average, it was found that the FPGA. executes image sharing and reconstruction approximately 300 times faster than a microprocessor operating on the same image.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共289页 << < 188 189 190 191 192 193 194 195 196 197 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：