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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

211 篇 工学
- 197 篇 计算机科学与技术...
- 98 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
55 篇 理学
- 35 篇 数学
- 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

语言

510 篇 英文
2 篇 其他
2 篇 中文

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

共 513 条记录，以下是311-320 订阅

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

详细简洁

排序：

dIP: A Non-intrusive Debugging IP for Dynamic Data Race Detection in Many-Core

dIP: A Non-intrusive Debugging IP for Dynamic Data Race Dete...

引用

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

作者： Chi-Neng Wen Shu-Hsuan Chou Tien-Fu Chen National Chung Cheng University Chiayi Taiwan

Traditional debug facilities are limited in providing debugging requirements for multicore parallel programming. Synchronization problems or bugs due to race conditions are particularly difficult to detect with software debugging tools. This work presents a fast and feasible hardware-assistant solution for many-core non-intrusive debugging. The key idea is to keep tracks of data accesses of shared memory areas and their lock synchronization activities by proposed data structures in proposed debugging IP (dIP). A page-based shared variable cache is provided to keep shared variables as long as possible, and an inexpensive pluggable off-chip RAM can eliminate the false-positive rate efficiently. To decrease the debugging traffic block, this work provides a thread library to specify shared memory/lock events and transmit those events to the dIP by a small proper hardware co-processor (eXtend dIP) of each core. Our experimental result shows the debugging traffic block (worse-case) by increasing cores, and adding tolerance buffers in XdIP can efficiently ease off. Moreover, the real workloads (SPLASH-2, MPEG-4, and H.264) are executed by the dIP non-instructive race-detection with only 4.7%~12.2% slow down in average. Finally, the hardware cost of dIP is also low when the growing of many-core.

关键词： Random access memory Hardware Multicore processing parallel programming Computer bugs Software debugging Data structures Read-write memory Yarn Libraries

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Music Information Retrieval and Gathering Engine (MIRAGE)

Design and Implementation of Music Information Retrieval and...

引用

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

作者： Jenq-Shiou Leu Chieh Changfan Kuan-Wu Su Chi-Feng Chen National Taiwan University of Science and Technology Taipei Taiwan Cadence Design Systems San Jose USA

Query by Singing/Humming (QBSH) is a most natural way for music recognition. A QBSH system can help find songs by matching a part of melody users sing or hum. Many Music Information Retrieval (MIR) techniques have been used to carry out the QBSH goal. In the past, little studies had ever been revealed about how to design and implement a simple QBSH system. In this article, we combine Short-Time-Fourier-Transform, Fourier Transform and Spectrum Analysis techniques at the client end, and Dynamic Time Warping (DTW) and dynamic programming techniques at the server end to implement Music Information Retrieval And Gathering Engine (MIRAGE), which can take input queries issued by users from web-based client-ends toward MIRAGE deployed at the server-end. MIRAGE can identify melody when a user only knows the rhythm of a song without any other information.

关键词： Music information retrieval Rhythm Dynamic programming Search engines Algorithm design and analysis Information analysis Data mining Internet Web server Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Spatial Context-Awareness in Vehicular Ad Hoc Networks

Spatial Context-Awareness in Vehicular Ad Hoc Networks

引用

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

作者： Attila Török Péter Laborczi Balázs Mezny Bay Zoltán Foundation for Applied Research Budapest Hungary

Distributed traffic information systems apply inter-vehicular ad hoc communication to disseminate road traffic information. The high amount of traffic information carried and flooded along the road network leads to superfluous forwarding, which is usually reduced by using rate- or spatial- adaptivity in the dissemination mechanisms. However, in certain cases due to the lack of context-aware information, the current protocols employing distributed spatial adaptivity will fail to achieve the desired performance. Therefore, an off-line heuristic algorithm (SPACE) was proposed to calculate on a digital map the Domain of Interest (DoI) of traffic jams. Based on this information, the dissemination protocol will be able to reduce more efficiently the superfluous forwarding. This paper takes a further step by proposing an Integer Linear programming (ILP) formulation for DoI optimizations, and analytically investigating the effect of spatial context-awareness on traffic information dissemination. The behavior of such a dissemination protocol is also explored through extensive simulations. Important characteristics on spatial adaptivity regarding the information dissemination strategies are concluded from the analytical and simulation results.

关键词： Ad hoc networks Telecommunication traffic Protocols Context Roads Information analysis Information systems Heuristic algorithms Integer linear programming Traffic control

来源：评论

学校读者我要写书评

暂无评论

Linear optimization on modern GPUs

Linear optimization on modern GPUs

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Daniele G. Spampinato Anne C. Elster Department of Computer and Information Science Norwegian University of Science and Technology Trondheim Norway Norges teknisk-naturvitenskapelige universitet Trondheim NO

Optimization algorithms are becoming increasingly more important in many areas, such as finance and engineering. Typically, real problems involve several hundreds of variables, and are subject to as many constraints. Several methods have been developed trying to reduce the theoretical time complexity. Nevertheless, when problems exceed reasonable sizes they end up being very computationally intensive. Heterogeneous systems composed by coupling commodity CPUs and GPUs are becoming relatively cheap, highly performing systems. Recent developments of GPGPU technologies give even more powerful control over them. In this paper, we show how we use a revised simplex algorithm for solving linear programming problems originally described by Dantzig for both our CPU and GPU implementations. Previously, this approach has showed not to scale beyond around 200 variables. However, by taking advantage of modern libraries such as ATLAS for matrix-matrix multiplication, and the NVIDIA CUDA programming library on recent GPUs, we show that we can scale to problem sizes up to at least 2000 variables in our experiments for both architectures. On the GPU, we also achieve an appreciable precision on large problems with thousands of variables and constraints while achieving between 2X and 2.5X speed-ups over the serial ATLAS-based CPU version. With further tuning of both the algorithm and its implementations, even better results should be achievable for both the CPU and GPU versions.

关键词： Linear programming Computer graphics Hardware Finance Libraries Optimization methods Design automation Information science Power engineering computing High performance computing

来源：评论

学校读者我要写书评

暂无评论

Irregular Grid Raycasting Implementation on the Cell Broadband Engine

Irregular Grid Raycasting Implementation on the Cell Broadba...

引用

international symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： Guilherme Cox Andre Maximo Cristiana Bentes Ricardo Farias Department of System Engineering State University of Rio De janeiro Rio de Janeiro Rio de Janeiro Brazil Centro de Tecnologia Federal University of Rio de Janeiro Rio de Janeiro Rio de Janeiro Brazil

Direct volume rendering has become a popular technique for visualizing volumetric data from sources such as scientific simulations, analytic functions, medical scanners, among others. Volume rendering algorithms, such as raycasting, can produce high-quality images, however, the use of raycasting has been limited due to its high demands on computational power and memory bandwidth. In this paper, we propose a new implementation of the raycasting algorithm that takes advantage of the highly parallel architecture of the Cell Broadband Engine processor, with 9 heterogeneous cores, in order to allow efficient raycasting of irregular datasets. All the computational power of the Cell BE processor, though, comes at the cost of a different programming model. Applications need to be rewritten, which requires using multithreading and vectorized code. In our approach, we tackle this problem by distributing ray computations using the visible faces, and vectorizing the lighting integral operations inside each core. Our experimental results show that we can obtain good speedups reducing the overall rendering time significantly.

关键词： Engines Rendering (computer graphics) Data visualization Computational modeling Analytical models Medical simulation Biomedical imaging Bandwidth parallel architectures Costs

来源：评论

学校读者我要写书评

暂无评论

parallelizing Optimal Multiple Sequence Alignment by Dynamic programming

Parallelizing Optimal Multiple Sequence Alignment by Dynamic...

引用

IEEE international symposium on parallel and Distributed Processing with Applications

作者： Helal, Manal El-Gindy, Hossam Mullin, Lenore Gaeta, Bruno Univ New S Wales Sch Engn & Comp Sci Fac Engn Sydney NSW Australia Natl Sci Fdn Washington DC USA

ISBN: (纸本)9780769534718

Optimal multiple sequence alignment by dynamic programming, like many highly dimensional scientific computing problems, has failed to benefit from the improvements in computing performance brought about by multi-processor systems, due to the lack of suitable scheme to manage partitioning and dependencies. A scheme for parallel implementation of the dynamic programming multiple sequence alignment is presented, based on a peer to peer design and a multidimensional array indexing method. This design results in up to 5-fold improvement compared to a previously described master/slave design, and scales favourably with the number of processors used. This study demonstrates an approach for parallelising multi-dimensional dynamic programming and similar algorithms utilizing multi-processor architectures.

关键词： Sequence Alignment dynamic programming Multiprocessor computational performance PROCESSOR Processor architectures

来源：评论

学校读者我要写书评

暂无评论

Task parallelism for object oriented programs

Task parallelism for object oriented programs

引用

9th international symposium on parallel architectures, algorithms and Networks, I-SPAN 2008

作者： Giacaman, Nasser Sinnen, Oliver Department of Electrical and Computer Engineering University of Auckland New Zealand

ISBN: (纸本)9780769531250

parallel computing is notoriously challenging due to the difficulty in developing correct and efficient programs. With the arrival of multi-core processors for desktop systems, desktop applications must now be parallelised. However achieving task parallelism for such object-oriented programs has traditionally been, and still remains, difficult. This paper presents a powerful task concept for parallel object-oriented programming and presents the results from a source-to-source compiler and runtime system. With the addition of a single keyword, the sequential code does not require restructuring and asynchronous task management is performed on behalf of the programmer;the parallel code required to realise task parallelism looks very much like the sequential counterpart. An intuitive solution is provided to handle task dependencies as well as integrating different task concepts into one model. © 2008 Crown Copyright.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

parallel execution of multi-set constraint rewrite rules 08

Parallel execution of multi-set constraint rewrite rules

引用

PPDP 2008: 10th international ACM SIGPLAN symposium on Principles and Practice of Declarative programming

作者： Sulzmann, Martin Lam, Edmund S. L. Programming Logics and Semantics Group IT University of Copenhagen Rued Langgaards Vej 7 2300 Copenhagen S Denmark School of Computing National University of Singapore S16 Level 5 3 Science Drive 2 Singapore 117543 Singapore

ISBN: (纸本)9781605581170

Multi-set constraint rewriting allows for a highly parallel computational model and has been used in a multitude of application domains such as constraint solving, agent specification etc. Rewriting steps can be applied simultaneously as long as they do not interfere with each other. We wish that the underlying constraint rewrite implementation executes rewrite steps in parallel on increasingly popular becoming multi-core architectures. We design and implement efficient algorithms which allow for the parallel execution of multi-set constraint rewrite rules. Our experiments show that we obtain some significant speed-ups on multi-core architectures. Copyright © 2008 ACM.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

On the Performance of parallel Neural Network Implementations on Distributed Memory architectures 08

On the Performance of Parallel Neural Network Implementation...

引用

8th IEEE international symposium on Cluster Computing and the Grid

作者： Ganeshamoorthy, K. Ranasinghe, D. N. Univ Colombo Sch Comp Dept Computat & Intelligent Syst Colombo 07 Sri Lanka

ISBN: (纸本)9781424442379

In this paper, we study the impact of multi processor memory systems in particular, the distributed memory (I)M) and virtual shared memory (VSM), on the implementation of parallel backpropagation neural network algorithms. In the first instance, neural network is partitioned into sub neural networks by applying a hybrid partitioning scheme. In the second, each partitioned network is evaluated with matrix multiplication. Three different sizes of neural networks are used and exchange rate prediction used as a reference problem. parallel implementations for each of the distributed memory and virtual shared memory scenarios is obtained. These algorithms are implemented on a high performance cluster, "Monolith" consisting of over 396 nodes. programming is realized using Message Passing Interface (MPI) library and C-Linda. The partitioned, matrix multiplication has the fastest execution time, and DM/MPI implementation is always faster than the VSM/Linda equivalent. However in VSM/Linda it is possible to allow the parallel neural network to choose the optimum number of processors dynamically.

关键词： VSM DM Hybrid partition parallel neural network

来源：评论

学校读者我要写书评

暂无评论

Hardware implementation of P systems using microcontrollers. An operating environment for implementing a partially parallel distributed architecture

Hardware implementation of P systems using microcontrollers....

引用

2008 10th international symposium on Symbolic and Numeric algorithms for Scientific Computing, SYNASC 2008

作者： Canaval, Sandra María Gómez Rodríguez, Abraham Gutiérrez Villaverde, Santiago Alonso Natural Computing Group Universidad Politécnica de Madrid Madrid Spain

ISBN: (纸本)9780769535234

Nowadays, important efforts in the research of the Transition P Systems have been focused on the simulation/ implementation of the massively parallel character of the model. The distributed implementation of P Systems has met with the communications bottleneck problem. In this sense, there are several research works on analysis for distributed architectures that are technology independent and avoiding communication collisions. Recent works present analysis on the suitability for implementing theses architectures using an universal membrane hardware/software component based on microcontrollers. These implementations are directly programming on hardware components and the resulting data is analyzed by means of a specific program which translates the execution bit code into intelligible data for researchers. The aim of this work is to present an operating environment to automate manual tasks performed during the loading, execution and interpretation of P System into distributed architectures based on microcontrollers as well as the interpretation from inner binary data representation inside of microcontrollers. © 2008 IEEE.

关键词： Microcontrollers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：