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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Enhancing Data Availability through Automatic Replication in the Hadoop Cloud System

Enhancing Data Availability through Automatic Replication in...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Tsozen Yeh Yiming Tu Department of CSIE Fu Jen Catholic University New Taipei City Taiwan

ISBN: (纸本)9781538694046;9781538694039

As the era of the Internet of Things (IoT) arrives, the colossal volume of data generated has far exceeded what conventional computer systems can handle and process. As a result, cloud computing has shown its promising future for storing and handling the enormous amount of data. The data availability is one of the most critical issues related to data management. Losing data, in particular for those important, could cause unrecoverable damage in many cases. Most cloud platforms maintain multiple copies of data to lower the risk of losing data from hardware failure or natural disasters. Hadoop is one of the most popular cloud platforms in the cloud community. Its default file system, Hadoop Distributed File System (HDFS), keeps multiple copies for every file. Moreover, HDFS provides users a snapshot function to make point-in-time copies of files in the file system for system recovery in the future. Usually files in snapshots are considered crucial to users, otherwise users would not even bother to keep them in snapshots. Ideally, important data files should have more replicas to increase their availability during the occurrence of hardware failure or disasters. However, the current snapshot scheme only records the contents of files at various snapshot moments and it does not affect their numbers of replicas kept in HDFS. It would be desirable if files in snapshots could have more copies so their data availability can be enhanced accordingly. Unfortunately, HDFS cannot achieve this in an efficient way. We improved and modified HDFS to automatically increase the numbers of replicas for files in snapshots. Consequently, the data availability of important files involved in snapshots can be bettered. The experimental results show that our design and implementation noticeably outperforms what the current HDFS can do in the course of taking snapshots and increasing the number of replicas for files in snapshots.

关键词： Cloud computing Internet of Things Hardware Accidents File systems Tools programming

来源：评论

学校读者我要写书评

暂无评论

Two-View Mammographic Mass Retrieval Using Deep Hashing

Two-View Mammographic Mass Retrieval Using Deep Hashing

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Wei Liu Xi-ming Li Meng-fei Wu Rong-yao Xu Kai Fei Jia-wei Yang School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an China

ISBN: (纸本)9781665496407

Breast cancer is the most commonly diagnosed cancer among women all over the world. Content-based mammographic mass retrieval can assist radiologists to retrieve biopsy-proven masses content similar to the diagnostic ones, which can help radiologists to improve the diagnostic performance. However, although screening mammograms usually consists of two-view (mediolateral oblique view and craniocaudal view) mammography of the same breast, most breast computer-aided diagnosis(CAD) methods incorporated with content-based image retrieval (CBIR) techniques are based on a single-view principle where query mass within a view is analyzed independently. With the advance of deep neural networks in image representation, the deep hashing technique for CBIR maps images into binary feature vectors, which can greatly reduce time and memory costs. In this paper, according to our previous studies, we propose a two-view mammographic mass retrieval approach based on deep hashing. In our retrieval paradigm, a convolutional neural network(CNN) is used to learn both image representation and hash function based on paired labels and class labels. The last layer of CNN will output the image binary codes. Subsequently, the learned binary codes of mass pair are used for matching and ranking within a traditional query-by-example(QBE) framework. Using a dataset that contains a total of 3000 masses collected from the public Digital Database for Screening Mammography(DDSM), this method can yield a retrieval accuracy of 0.8975, which demonstrates its encouraging performance.

关键词： Hash functions Deep learning Neural networks Image retrieval Binary codes Image representation programming

来源：评论

学校读者我要写书评

暂无评论

On symbolic scheduling and parallel complexity of loops

On symbolic scheduling and parallel complexity of loops

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Tao Yang O.H. Ibarra Department of Computer Science University of California Santa Barbara CA USA

We first consider the symbolic scheduling and performance prediction of a partitioned single loop on message passing architectures with non zero communication and a sufficient number of processors. The loop body contains a set of coarse grain tasks whose computational weights change during the course of the iterations. Using the macro dataflow task: model and software pipelining techniques, we develop an algorithm for computing a heuristic schedule, and provide analytic and experimental results on the correctness and asymptotic performance of this schedule. Using this result, we can show the impact of partitioning on the performance of parallelization. While this result is effective for a class of loops, there are many other methods proposed for loop parallelization. An interesting fundamental question is whether every instance of a nested loop can be efficiently executed, We present some positive and negative results on this issue.

关键词： Processor scheduling Message passing Computer architecture Software performance Pipeline processing Partitioning algorithms Software algorithms Scheduling algorithm Performance analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Interactive Debugging of Dynamic Dataflow Embedded Applications

Interactive Debugging of Dynamic Dataflow Embedded Applicati...

引用

IEEE international symposium on parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Kevin Pouget Patricia López Cueva Miguel Santana Jean-François Méhaut STMicroelectronics Crolles France LIG University of Grenoble Grenoble France

Debugging parallel and concurrent applications is well-recognized as a time-consuming task, which often requires a significant part of the application development process. In the context of embedded systems, Multi-Processor-System-on-Chip(MPSoC) architectures feature numerous multicore processors which may be coupled with heterogeneous processors like Digital Signal Processors (DSPs) and/or application-specific accelerators. In this situation, it is important that developers are provided with high-level programming environments able to efficiently exploit these architectures, as well as suitable debugging tools. Dataflow programming models were explicitly designed to program parallel architectures and they have the ability to abstract away heterogeneous computing complexity. In addition, the stream-processing aspect of multimedia algorithms naturally exhibits data-dependency graphs, which simplifies application design and implementation. In this paper, we propose a new approach for interactive debugging of dataflow applications. Going beyond the long-established ability of interactive debuggers to support sequential programming languages, we describe the functionalities they should be able to provide to debug embedded and parallel dataflow applications. Then we demonstrate our solution to this problem with a proof-of-concept debugger targeting the dataflow framework used on an industrial MPSoC platform. We also explain the development challenges we faced during the implementation of this GDB-based debugger and illustrate its efficiency through a case study of a video decoder debugging session.

关键词： Debugging Object oriented modeling Program processors programming Computer architecture Data models Context

来源：评论

学校读者我要写书评

暂无评论

parallelizing Optimal Multiple Sequence Alignment by Dynamic programming

Parallelizing Optimal Multiple Sequence Alignment by Dynamic...

引用

international symposium on parallel and Distributed Processing with Applications, ISPA

作者： Manal Helal Hossam El-Gindy Lenore Mullin Bruno Gaeta School of Computer Science and Engineering Faculty of Engineering University of New South Wales Sydney Australia National Science Foundation WA USA

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.

关键词： Dynamic programming Sequences Indexing Computer architecture Concurrent computing High performance computing Peer to peer computing Tensile stress Multidimensional systems Master-slave

来源：评论

学校读者我要写书评

暂无评论

Impact of instruction re-ordering on the correctness of shared-memory programs

Impact of instruction re-ordering on the correctness of shar...

引用

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

作者： L. Higha J. Kawash Dept. of Comput. Sci. Calgary Univ. Alta. Canada Department of Computer Science American University of Sharjah UAE University of Calgary

Sequential consistency is an intuitive consistency model that simplifies reasoning about concurrent multiprocessor programs. Most implementations of high-performance multiprocessors, however, utilize mechanisms that al low instructions to execute out of order resulting in consistency models that are weaker than sequential consistency and further complicating the job of programmers. This paper invests all possible combinations of re-ordering of read and write instructions and their effects on the correctness of programs that are designed for sequential consistency. It shows that with certain combinations of re-orderings, any program that accesses shared memory through only reads and writes and that is correct assuming sequential consistency, can be transformed to a new program that does not use any explicit synchronization, and that remains correct in spite of the instruction re-ordering. With other combinations of re-ordering, such transformations do not exist, and even solutions to the mutual exclusion problem are impossible without resorting to explicit synchronization.

关键词： Read-write memory Computer science Out of order programming profession Algorithm design and analysis Councils Hardware Optimizing compilers Java Virtual machining

来源：评论

学校读者我要写书评

暂无评论

The PASM project: a study of reconfigurable parallel computing

The PASM project: a study of reconfigurable parallel computi...

引用

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

作者： H.J. Siegel T.D. Braun H.G. Dietz M.B. Kulaczewski M. Maheswaran P. Pero J.M. Siegel J.J.E. So Min Tan M.D. Theys Lee Wang School of Electrical and Computer Engineering Parallel Processing Laboratory Purdue University West Lafayette IN USA

PASM is a concept for a parallel processing system that allows experimentation with different architectural design alternatives. PASM is dynamically reconfigurable along three dimensions: partitionability into independent or communicating submachines, variable interprocessor connections, and mixed-mode SIMD/MIMD parallelism. With mixed-mode parallelism, a program can switch between SIMD (synchronous) and MIMD (asynchronous) parallelism at instruction-level granularity, allowing the use of both modes in a single machine. The PASM concept is presented, showing the ways in which reconfiguration can be accomplished. Trade-offs among SIMD/MIMD, and mixed-mode parallelism are explored. The small-scale PASM prototype with 16 processing elements is described. The ELP mixed-mode programming language used on the prototype is discussed. An example of a prototype-based study that demonstrates the potential of mixed-mode parallelism is given.

关键词： parallel processing Switches Prototypes Concurrent computing Costs Communication switching Broadcasting Decoding Yarn Hardware

来源：评论

学校读者我要写书评

暂无评论

An adaptive processor allocation strategy for mesh-connected systems

An adaptive processor allocation strategy for mesh-connected...

引用

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

作者： Kyung-Hee Seo Sung-Chun Kim Department of Computer Science Sogang University Seoul South Korea

ISBN: (纸本)0818682596

We propose an adaptive processor allocation strategy based on shape manipulations of required submesh for large mesh-connected systems. When an incoming job requests a rectangular submesh, our strategy first tries to allocate the conventional rectangular submeshes including 90-degree rotation and folding techniques. If it fails, our strategy further tries to allocate more flexible and robust L-shaped submeshes instead of signaling the allocation failure. Thus, our strategy accommodates incoming job earlier than conventional strategies. Simulation results indicate that our strategy performs more efficiently than other strategies in terms of the external fragmentation, the job response time, and the system utilization. Our strategy is transparent to application programmers and does not require additional hardware supports. Moreover, with our L-shaped submesh allocation strategy, application programmers using the mesh-connected system may no longer limit their request to rectangular submeshes. They can request the L-shaped submesh with the number of processors much closer to the exactly needed value to execute their job.

关键词： Shape Delay Computer science Robustness Hardware programming profession Topology Very large scale integration Prototypes Hypercubes

来源：评论

学校读者我要写书评

暂无评论

An Early Evaluation of the Scalability of Graph algorithms on the Intel MIC Architecture

An Early Evaluation of the Scalability of Graph Algorithms o...

引用

IEEE international symposium on parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Erik Saule Ümit V. Çatalyürek Department of Biomedical Informatics Ohio State University USA Department of Biomedical Informatics Department of Electrical and Computer Engineering Ohio State University USA

Graph algorithms are notorious for not getting good speedup on parallel architectures. These algorithms tend to suffer from irregular dependencies and a high synchronization cost that prevent an efficient execution on distributed memory machines. Hence such algorithms are mostly parallelized on shared memory machines. However, current commodity shared memory machines do not typically offer enough parallelism to process these problems. In this paper, we are presenting an early investigation of the scalability of such algorithms on Intel's upcoming Many Integrated Core (Intel MIC) architecture which, when it will be released in 2012, is expected to provide more than 50 physical cores with SMT capability. The Intel MIC architecture can be programmed through many programming models, here we investigate the three most popular of these models namely OpenMP, Cilk Plus and Intel's TBB. We present scalability results of a parallel graph coloring algorithm, three variations of a breadth-first search algorithm and a micro benchmark for irregular computations using these three programming models. Our results on a prototype board show that the multi-threaded architecture of Intel MIC can be effectively used for hiding latencies in irregular applications to achieve almost perfect speedup.

关键词： Microwave integrated circuits programming Instruction sets Computer architecture Computational modeling Kernel Image color analysis

来源：评论

学校读者我要写书评

暂无评论

New Effective Multithreaded Matching algorithms

New Effective Multithreaded Matching Algorithms

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Fredrik Manne Mahantesh Halappanavar Department of Informatics University of Bergen Bergen Norway Pacific Northwest National Laboratory Richland WA USA

Matching is an important combinatorial problem with a number of applications in areas such as community detection, sparse linear algebra, and network alignment. Since computing optimal matchings can be very time consuming, several fast approximation algorithms, both sequential and parallel, have been suggested. Common to the algorithms giving the best solutions is that they tend to be sequential by nature, while algorithms more suitable for parallel computation give solutions of lower quality. We present a new simple 1/2-approximation algorithm for the weighted matching problem. This algorithm is both faster than any other suggested sequential 1/2-approximation algorithm on almost all inputs and when parallelized also scales better than previous multithreaded algorithms. We further extend this to a general scalable multithreaded algorithm that computes matchings of weight comparable with the best sequential deterministic algorithms. The performance of the suggested algorithms is documented through extensive experiments on different multithreaded architectures.

关键词： Approximation algorithms Algorithm design and analysis Heuristic algorithms Electronics packaging Dynamic programming Instruction sets Optimal matching

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：