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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

parallel matrix distribution library for sparse matrix solvers

Parallel matrix distribution library for sparse matrix solve...

引用

8th international conference on High-Performance Computing in Asia-Pacific Region

作者： Fujii, Akihiro Suda, Reiji Nishida, Akira Kogakuin Univ Tokyo 160 Japan

ISBN: (纸本)0769524869

We have developed the matrix distribution library for sparse matrix solvers. there are few libraries to realize matrix distribution and reordering. It is mainly because the data structure of the large sparse matrix can not be specified to one matrix format. thus the present paper assumes the matrix format as distributed Compressed Row Storage (CRS) format which is used in many sparse linear solvers. We have developed the matrix distribution library based on this format. the input and output matrix format of our library is the same matrix format, so that it can be used for repeated matrix distribution and reordering. the present paper introduces the matrix format, and the implementation of the matrix distribution library, and discusses the efficiency of the various matrix distribution methods for sparse matrix solvers.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Identifying script on word-level with informational confidence

Identifying script on word-level with informational confiden...

引用

8th international conference on Document Analysis and Recognition (ICDAR 2005)

作者： Jaeger, S Ma, HF Doermann, D Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA

ISBN: (纸本)0769524206

In this paper we present a multiple classifier system for script identification. Applying a Gabor filter analysis of textures on word-level, our system identifies Latin and non-Latin words in bilingual printed documents. the classfier system comprises four different architectures based on nearest neighbors, weighted Euclidean distances, Gaussian mixture models, and support vector machines. We report results for Arabic, Chinese, Hindi, and Korean script. Moreover we show that combining informational confidence values using sum-rule can consistently outperform the best single recognition rate.

关键词： Word processing

来源：评论

学校读者我要写书评

暂无评论

An adaptive load balancing framework for parallel database systems based on collaborative agents

An adaptive load balancing framework for parallel database s...

引用

9th international conference on Computer Supported Cooperative Work in Design 2005

作者： Hu, Tian-Lei Chen, Gang Chen, Ke Dong, Jin-Xiang College of Computer Science and Technology Zhejiang University Hangzhou 310027 China

ISBN: (纸本)1846000025

Load balancing is a key technique in parallel computer supported collaborative work (CSCW) systems, parallel database system and P2P system for instance, to boost performance and improve scalability. In order to reduce total cost of ownership (TCO), adaptive/self-tuning administration techniques are gradually and extensively expected in the Cyberspace. In parallel database systems, adaptive load balancing techniques are proposed to face the change in data storage patterns and access patterns in a dynamic real environment. the techniques utilized in both shared-nothing and shared-disk parallel database systems are discussed, and a general flexible framework based on collaborative agents is studied to support these techniques in both architectures. the framework supports two kinds of load balancing - one is passively executing query statements balancedly, and the other one is proactively adjusting data placement and task execution scheme, by means of data and task migration, whenever load unbalance is detected. three categories of agents, scheduling agents, monitoring agents and task agents, are identified in the framework the collaboration protocols and scheduling algorithms to support adaptive load balancing are described. the framework also applies to other parallel systems such as P2P systems and shared file processing systems due to their underlying commonness.

关键词： Computer supported cooperative work

来源：评论

学校读者我要写书评

暂无评论

Lock-free and practical doubly linked list-based deques using single-word compare-and-swap

引用

8th international conference on Principles of Distributed Systems (OPODIS 2004)

作者： Sundell, H Tsigas, P Chalmers Univ Technol Dept Comp Sci S-41296 Gothenburg Sweden Gothenburg Univ S-41296 Gothenburg Sweden

ISBN: (纸本)3540273247

We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of deques are either based on non-available atomic synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses. Our algorithm is based on a general lock-free doubly linked list, and only requires single-word compare-and-swap atomic primitives. It also allows pointers with full precision, and thus supports dynamic deque sizes. We have performed an empirical study using full implementations of the most efficient known algorithms of lock-free deques. For systems with low concurrency, the algorithm by Michael shows the best performance. However, as our algorithm is designed for disjoint accesses, it performs significantly better on systems with high concurrency and non-uniform memory architecture. In addition, the proposed solution also implements a general doubly linked list, the first lock-free implementation that only needs the single-word compare-and-swap atomic primitive.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

An FPGA-based floating-point Jacobi iterative solver

An FPGA-based floating-point Jacobi iterative solver

引用

international Symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： G.R. Morris V.K. Prasanna Department of Electrical Engineering University of Southern California Los Angeles CA USA

Within the parallel computing domain, field programmable gate arrays (FPGA) are no longer restricted to their traditional role as substitutes for application-specific integrated circuits-as hardware "hidden" from the end user. Several high performance computing vendors offer parallel re configurable computers employing user-programmable FPGAs. these exciting new architectures allow end-users to, in effect, create reconfigurable coprocessors targeting the computationally intensive parts of each problem. the increased capability of contemporary FPGAs coupled with the embarrassingly parallel nature of the Jacobi iterative method make the Jacobi method an ideal candidate for hardware acceleration. this paper introduces a parameterized design for a deeply pipelined, highly parallelized IEEE 64-bit floating-point version of the Jacobi method. A Jacobi circuit is implemented using a Xilinx Virtex-II Pro as the target FPGA device. Implementation statistics and performance estimates are presented.

关键词： Jacobian matrices Field programmable gate arrays Hardware High performance computing parallel processing Concurrent computing Computer architecture Coprocessors Coupling circuits Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Maximum loop distribution and fusion for two-level loops considering code size

Maximum loop distribution and fusion for two-level loops con...

引用

international Symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： M. Liu Q. Zhuge Z. Shao C. Xue M. Qiu E.H.-M. Sha Department of Computer Science University of Texas Dallas Richardson TX USA Department of Computing Hong Kong Polytechnic University Hong Kong China

In this paper, we propose a technique combining loop distribution with loop fusion to improve the timing performance without increasing the code size of the transformed loops. We first develop the loop distribution theorems that state the conditions distributing any two-level nested loop in the maximum way. Based on the loop distribution theorems, we design an algorithm to conduct maximum loop distribution. then we propose a technique of maximum loop distribution with direct loop fusion, which performs maximum loop distribution followed by direct loop fusion. the experimental results show that the execution time of the transformed loops by our technique is reduced 41.9% on average compared to the original loops without the increase of the code size.

关键词： Timing parallel processing Fusion power generation Computer science Distributed computing Algorithm design and analysis Memory management Fuses parallel architectures

来源：评论

学校读者我要写书评

暂无评论

GridFTP and parallel TCP support in NaradaBrokering 1

引用

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

作者： Lim, Sang Boem Fox, Geoffrey Kaplan, Ali Pallickara, Shrideep Pierce, Marion Daejeon Korea Republic of Pervasive Technology Labs. Indiana University Bloomington IN 47404-3730 United States

ISBN: (数字)9783540320715

ISBN: (纸本)3540292357

Many of the key features of file transfer mechanisms like reliable file transferring and parallel transferring are developed as part of the service. It makes very hard to re-use the same code for the different systems. We are trying to overcome this disadvantage by decoupling useful features of file transfer mechanisms from the implementation of the service and protocol, and instead placed into the messaging substrate. We may thus treat file transfer operations as a specific usage case for a more general messaging environment. this will allow us to provide file transfer quality of service to other file transfer tools that does not have same features. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Quality of information for data fusion in net centric publish and subscribe architectures

Quality of information for data fusion in net centric publis...

引用

2005 8th international conference on Information Fusion, FUSION

作者： Johnson, M. Edwin Chang, K.C. ITT Industries Advanced Engineering and Sciences Reston VA 22090 United States Dept. of SEOR George Mason University Fairfax VA 22030-4444 United States

ISBN: (纸本)0780392868

this paper examines data fusion and target tracking issues involved within Net Centric Publish and Subscribe architectures with respect to the Quality of Information (QOI) provided to the end user. these architectures are commonly selected in shared knowledge environments to enable access to all information by all users. DoD, DOJ, FAA, and other Government organizations are pushing net centric concepts to move from stovepiped, closed architectures with limited data accessibility toward open architectures where dissemination of new data sources is intrinsically supported. Although these net centric initiatives (such as DoD's GIG) promise tremendous aggregate bandwidth, sensor-to-user bandwidth, end-user processing power and storage capacity, and other real world issues are expected to impact operations. For example, the soldier of the future may require moving target updates on a bandwidth-limited wireless PDA. this paper examines how the Air Force Research Laboratory's Joint Battlespace Infosphere (JBI), a publish-and-subscribe system in conjunction with the OGC's Sensor Web Enablement (SWE) initiative, can be used to update clients in a Quality-of-Information (QOI) paradigm rather than a Quality-of-Service (QOS) paradigm. We conclude that Net Centric architectures can support operational flows that improve the quality of information while reducing resource usage over traditional stove-pipe systems. We also conclude that Net Centric tool implementations should specifically address QOI. © 2005 IEEE.

关键词： Sensor data fusion

来源：评论

学校读者我要写书评

暂无评论

Hierarchical scheduling for moldable tasks

Hierarchical scheduling for moldable tasks

引用

11th international Euro-Par conference, Euro-Par 2005

作者： Dutot, Pierre-François Laboratoire ID-IMAG 38330 Montbonnot St-Martin France

the model of moldable task (MT) was introduced some years ago and has been proven to be an efficient way for implementing parallel applications. It considers a target application at a larger level of granularity than in other models (typically corresponding to numerical routines) where the tasks can themselves be executed in parallel on any number of processors. Clusters of SMPs (symmetric Multi-Processors) are a cost effective alternative to parallel supercomputers. Such hierarchical clusters are parallel systems made from m identical SMPs composed each by k identical processors. these architectures are more and more popular, however designing efficient software that take full advantage of such systems remains difficult. this work describes approximation algorithms for scheduling a set of tree precedence constrained moldable tasks for the minimization of the parallel execution time, with a scheme which is first used for two multi-processors and several bi-processors and then extended to the general case of any number of multi-processors. the best known approximations of competitive ratios for trees in the homogeneous case is 2.62, and although the hierarchical problem is harder our results are close as we obtain a ratio of 3.41 for two multi-processors, 3.73 for several bi-processors and 5.61 for the general case of several SMPs with a large number of processors. To our knowledge, this is the first work on precedence constrained moldable tasks on hierarchical platforms. © Springer-Verlag Berlin Heidelberg 2005.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallel image segmentation with level set methods

Parallel image segmentation with level set methods

引用

5th IASTED international conference on Visualization, Imaging, and Image processing

作者： Jeon, M Alexander, M Pizzi, N Gwangju Inst Sci & Technol Dept Mechatron Kwangju South Korea

ISBN: (纸本)0889865280

Most PDE-based image segmentation algorithms employ an explicit scheme to solve the system equations. However, an explicit scheme has a time step constraint and also when parallelized, data dependency is unavoidable at the boundary of the region assigned to processors, which requires communication between neighboring processors to share the boundary information. Additive Operator Splitting is a semi-implicit scheme that effectively decomposes a multidimensional system into a series of independent one dimensional systems, each composed of multiple tridiagonal systems. Functional parallelism is made possible by this decomposition and within each one dimensional processing step, data parallelism is achieved by solving the independent tridiagonal systems, resulting in a nested parallelism. thus, implementation of parallelism is straightforward, and the, parallel program will be subject to less communication overhead than explicit schemes. In this paper, we employ the AOS scheme for a level set formulation of the segmentation problem, and OpenMP on a shared memory machine for its parallelization. Test results show that parallelization with OpenMP on a shared memory system with 8 processors gives improved computational time with speedup of over 3 for 2-phase image segmentation.

关键词： level set methods image segmentation additive operator splitting parallelization OpenMP

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共289页 << < 215 216 217 218 219 220 221 222 223 224 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：