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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

486 篇 会议
16 篇 期刊文献
9 册 图书

馆藏范围

511 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

209 篇 工学
- 195 篇 计算机科学与技术...
- 97 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
54 篇 理学
- 34 篇 数学
- 6 篇 生物学
- 4 篇 系统科学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 9 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学

主题

97 篇 programming
82 篇 parallel process...
79 篇 parallel archite...
71 篇 parallel program...
63 篇 concurrent compu...
59 篇 computer archite...
46 篇 hardware
43 篇 computational mo...
39 篇 programming prof...
39 篇 algorithm design...
36 篇 parallel algorit...
34 篇 computer science
26 篇 dynamic programm...
24 篇 runtime
24 篇 heuristic algori...
22 篇 program processo...
22 篇 partitioning alg...
21 篇 costs
21 篇 instruction sets
21 篇 clustering algor...

机构

6 篇 school of comput...
5 篇 school of comput...
4 篇 school of comput...
3 篇 department of co...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
2 篇 department of co...
2 篇 univ minnesota d...
2 篇 school of scienc...
2 篇 soochow univ sch...
2 篇 college of optoe...
2 篇 school of comput...
2 篇 beijing research...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 vision computing...

作者

9 篇 zhong cheng
6 篇 cheng zhong
6 篇 jigang wu
5 篇 hui li
4 篇 shikai guo
4 篇 yeh-cheng chen
4 篇 zhang jinxiong
4 篇 yidong li
4 篇 rong chen
4 篇 sivasankaran raj...
4 篇 hong shen
3 篇 chen danyang
3 篇 wei liu
3 篇 liu jun
3 篇 ruey-shun chen
3 篇 wang shunxu
3 篇 rajamanickam siv...
3 篇 naixue xiong
3 篇 guangzhong sun
3 篇 tonglai liu

语言

508 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=Seventh International Symposium on Parallel Architectures, Algorithms and Programming"

共 511 条记录，以下是231-240 订阅

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

详细简洁

排序：

Improving parallel FDTD method performance using SSE instructions

Improving parallel FDTD method performance using SSE instruc...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Zhang, Lihong Yu, Wenhua School of Information Engineering Communication University of China Beijing China Fundamentals Department Chinese People's Armed Police Force Academy Langfang Hebei China Penn State University University Park PA United States

ISBN: (纸本)9780769545752

Electromagnetic researchers are often faced with long execution time and therefore algorithmic and implementation-level optimization can dramatically increase the overall performance of electromagnetism simulation using FDTD method. In this paper, we focus on acceleration implementation of 3D parallel FDTD method by taking advantage of the extended instruction sets found in modern processors, in particular the SSE instruction set. We present a SSE version of 3D parallel FDTD Method that results in a considerable 3× speedup. © 2011 IEEE.

关键词： Finite difference time domain method

来源：评论

学校读者我要写书评

暂无评论

A parallel computing procedure for the lower and upper bounds on the functionals of solutions to PDE: Application to the J-integral in functionally graded materials

A parallel computing procedure for the lower and upper bound...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Xuan, Z.C. Department of Computer Science Tianjin University of Technology and Education Tianjin 300222 China

ISBN: (纸本)9780769545752

A parallel computing procedure for computing the bounds on the J-integral in functionally graded materials is presented based on a Neumann element a-posteriori error bound. The finite element solution of J-integral is first obtained on a coarser finite element mesh, then a-posteriori bounding procedure based on the finite element error estimate is used to compute the lower and upper bounds on the J-integral. The computation of the error estimate is performed by solving independent elemental Neumann subproblems decomposed from the finite element model, thus the computing procedure is parallel and potential to solve large scale structural problems. An example is given in the end of paper to compute the lower and upper bounds on the J-integral of functionally graded materials. © 2011 IEEE.

关键词： Functionally graded materials

来源：评论

学校读者我要写书评

暂无评论

Thread-level parallel generating inter-class test cases

Thread-level parallel generating inter-class test cases

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Cheng, Zhong Wu, Xi-Hua School of Computer and Electronics and Information Guangxi University Nanning China

ISBN: (纸本)9780769545752

A complicated class-cluster is transformed into several test blocks, and these test blocks are assigned to the processing cores on multi-core computer. Each processing core executes in parallel multiple threads to handle some test blocks. The relationship among classes in each block is represented by relational pairs, and the mutation program for each relational pair is generated by applying μJava. The generated mutants and model checker Java PathFinder(JPF) are applied to create automatically counterexample, and the test cases for class-cluster are extracted by analyzing the counterexample. The experimental results show that the presented method can speed up test generation and obtain test cases with higher quality. © 2011 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

programming Real-time Autofocus on a Massively parallel Reconfigurable Architecture using Occam-pi

Programming Real-time Autofocus on a Massively Parallel Reco...

引用

IEEE 19th Annual international symposium on Field-Programmable Custom Computing Machines (FCCM)

作者： Zain-ul-Abdin Ahlander, Anders Svensson, Bertil Halmstad Univ Ctr Res Embedded Syst Halmstad Sweden Saab Grp Business Area Elect Def Syst Gothenburg Sweden

ISBN: (纸本)9780769543017

Recently we proposed occam-pi as a high-level language for programming massively parallel reconfigurable architectures. The design of occam-pi incorporates ideas from CSP and pi-calculus to facilitate expressing parallelism and reconfigurability. The feasability of this approach was illustrated by building three occam-pi implementations of DCT executing on an Ambric. However, because DCT is a simple and well-studied algorithm it remained uncertain whether occam-pi would also be effective for programming novel, more complex algorithms. In this paper, we demonstrate the applicability of occam-pi for expressing various degrees of parallelism by implementing a significantly large case-study of focus criterion calculation in an autofocus algorithm on the Ambric architecture. Autofocus is a key component of synthetic aperture radar systems. Two implementations of focus criterion calculation were developed and evaluated on the basis of performance. The comparison of the performance results with a single threaded software implementation of the same algorithm show that the throughput of the two implementations are 11x and 23x higher than the sequential implementation despite a much lower (9x) clock frequency. The two designs are, respectively, 29x and 40x more energy efficient.

关键词： Ambric architecture CSP Computer architecture Concurrent programming models DCT Hardware Interpolation Mobile communication parallel processing Pixel Reconfigurable Arcitectures Semantics high level languages high-level language massively parallel reconfigurable architecture occam-pi parallel architectures pi-calculus real-time autofocus reconfigurable architectures single threaded software implementation synthetic aperture radar systems

来源：评论

学校读者我要写书评

暂无评论

A test sequence selection method for parallel software systems

A test sequence selection method for parallel software syste...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Sun, Tao Ye, Xinming Liu, Jing College of Computer Science Inner Mongolia University Hohhot China

ISBN: (纸本)9780769545752

Modeling and testing for a parallel software system is very difficult, because parallel behaviors leads to system state explosion. Many testing methods are testing with a large number of redundancies. In this paper, a test sequence selection method for parallel software systems is shown. The method is based on linear behavior sequences which is preparing for testing, called LBSPT. Firstly, a formal model for software system specification is constructed based on Coloured Petri Net (CPN), called system model, and LBSPT is also modeled based on CPN, called LBSPT model. A test sequence selection method is defined on these models. The method could select all of test sequences related to LBSPT, and does not contain any redundancy. The state explode problem in software testing is solved to a certain extent. Practices show that the effect of this method is better than other methods such as random walk. © 2011 IEEE.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

A parallel K-means clustering algorithm with MPI

A parallel K-means clustering algorithm with MPI

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Zhang, Jing Wu, Gongqing Hu, Xuegang Li, Shiying Hao, Shuilong School of Computer Science and Information Engineering Hefei University of Technology Hefei 230009 China

ISBN: (纸本)9780769545752

Clustering is one of the most popular methods for data analysis, which is prevalent in many disciplines such as image segmentation, bioinformatics, pattern recognition and statistics etc. The most popular and simplest clustering algorithm is K-means because of its easy implementation, simplicity, efficiency and empirical success. However, the real-world applications produce huge volumes of data, thus, how to efficiently handle of these data in an important mining task has been a challenging and significant issue. In addition, MPI (Message Passing Interface) as a programming model of message passing presents high performances, scalability and portability. Motivated by this, a parallel K-means clustering algorithm with MPI, called MKmeans, is proposed in this paper. The algorithm enables applying the clustering algorithm effectively in the parallel environment. Experimental study demonstrates that MKmeans is relatively stable and portable, and it performs with low overhead of time on large volumes of data sets. © 2011 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A parallel PCG solver for large-scale groundwater flow simulation based on OpenMP

A parallel PCG solver for large-scale groundwater flow simul...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Li, Dandan Ji, Xiaohui Wang, Qun Beijing China

ISBN: (纸本)9780769545752

Groundwater flow simulation has become one of the top international issues in new generation of environmental applications. When managing large-scale groundwater flow problems, the intensive computational ability and large amounts of memory space required for modeling are the main bottlenecks for researchers. In order to solve three-dimensional large-scale groundwater flow problems more rapidly, the OpenMP was adopted to parallelize the preconditioned conjugate gradient (PCG) algorithm in this paper. And this paper carried out a numerical experiment of the three-dimensional groundwater flow model on a computer with four cores. Based on the numerical experiment, it is found that the execution time of the original serial PCG program is about 1.74 to 2.86 times of the parallel PCG program executed with different number of threads. The experimental results also demonstrate that the PCG solver based on OpenMP is an effective way for solving large-scale three-dimensional groundwater flow problem. © 2011 IEEE.

关键词： Groundwater flow

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of OMPit: An OpenMP compiler characterized by logs for parallel and work-sharing

The design and implementation of OMPit: An OpenMP compiler c...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Luo, Qiuming Cai, Ye Liu, Chengjian Kong, Chang College of Computer Science and Software Engineering Shenzhen University China

ISBN: (纸本)9780769545752

There are many tools for OpenMP benchmarking which measure the various aspects of the performance, such as the overheads of OpenMP directives and the characteristics of the whole system. But we lack some tools to show us the work-sharing details when the OpenMP program finished running. The OMPit (OMPi for tutoring) is designed to provide the work-sharing information during the running, which can be used for tutoring and might help debugging or tuning. The work-sharing logging includes the work assignment and the timestamps for three different work-sharing behaviors. The logging information can be output as a text files or visualized figures. The designing of OMPit is provided and the details of how to inserting the logging code into the OMPi compiler is discussed too. © 2011 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

PCAR: parallelism based cache replacement scheme to exploit inter-disks parallelism and intra-disk spatial locality in parallel disk array

PCAR: Parallelism based cache replacement scheme to exploit ...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Shi, Xiaodong Feng, Dan Computer College Huazhong University of Science and Technology Wuhan Hubei 430074 China Wuhan National Laboratory for Optoelectronics Wuhan Hubei 430074 China

ISBN: (纸本)9780769545752

For parallel disk array systems, the parallelism among disks is the key factor influencing the performance and the scale of systems. Unfortunately, the parallelism of cached blocks is largely ignored by cache management schemes that focus on reducing the number of cache misses. Therefore, the performance of parallel disks array systems for workloads with a skew access pattern can be seriously degraded. To solve this problem, we propose a parallelism based Cache Replacement scheme (PCAR) for parallel disks array systems, which can exploit both of the inter-disks parallelism and the intra-disk spatial locality. We have implemented the prototype of PCAR algorithm in Linux 2.6.18. And, the experimental results show that PCAR outperforms DULO and LRU by up to 22.8% and 33.1% in terms of the average response time, and by up to 20% and 43.9% in terms of throughput. © 2011 IEEE.

关键词： Computer operating systems

来源：评论

学校读者我要写书评

暂无评论

parallel optimization of queries in XML dataset using GPU

Parallel optimization of queries in XML dataset using GPU

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Si, Xujie Yin, Airu Huang, Xiaocheng Yuan, Xiaojie Liu, Xiaoguang Wang, Gang College of Software Nankai University Tianjin 300071 China College of I.T. Nankai University Tianjin 300071 China

ISBN: (纸本)9780769545752

As XML is playing a crucial role in web services, databases, and document processing, efficient processing of XML queries has become an important issue. On the other hand, due to the increasing number of users, high throughput of XML queries is also required to execute tens of thousands of queries in a short time. Given the great success of GPGPU (General-Purpose computations on the Graphics Processors), we propose a parallel XML query model based on GPU, which mainly consists of two efficient task distribution strategies, to improve the efficiency and throughput of XML queries. We have developed a parallel simplified XPath language using Compute Unified Device Architecture (CUDA) on GPU, and evaluate our model on a recent NVIDIA GPU in comparison with its counterpart on eight-core CPU. The experiment results show that our model achieves both higher throughput and efficiency than CPU-based XML query. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：