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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,712 篇 会议
29 册 图书
24 篇 期刊文献

馆藏范围

1,765 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,296 篇 工学
- 1,195 篇 计算机科学与技术...
- 535 篇 软件工程
- 235 篇 电气工程
- 203 篇 信息与通信工程
- 72 篇 控制科学与工程
- 45 篇 电子科学与技术（可...
- 31 篇 机械工程
- 31 篇 生物工程
- 19 篇 动力工程及工程热...
- 17 篇 力学（可授工学、理...
- 16 篇 网络空间安全
- 14 篇 仪器科学与技术
- 13 篇 化学工程与技术
- 13 篇 石油与天然气工程
- 12 篇 建筑学
- 12 篇 生物医学工程（可授...
- 11 篇 土木工程
- 10 篇 材料科学与工程（可...
- 10 篇 交通运输工程
243 篇 理学
- 172 篇 数学
- 33 篇 生物学
- 33 篇 系统科学
- 31 篇 物理学
- 20 篇 化学
- 19 篇 统计学（可授理学、...
164 篇 管理学
- 116 篇 管理科学与工程(可...
- 58 篇 图书情报与档案管...
- 49 篇 工商管理
65 篇 医学
- 60 篇 临床医学
18 篇 经济学
- 18 篇 应用经济学
11 篇 法学
5 篇 教育学
4 篇 农学
3 篇 文学
1 篇 军事学

主题

154 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
67 篇 cloud computing
51 篇 artificial intel...
50 篇 computational mo...
46 篇 computer archite...
46 篇 software enginee...
46 篇 distributed data...
44 篇 parallel program...
38 篇 parallel computi...
35 篇 application soft...
32 篇 big data
31 篇 parallel algorit...
31 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 resource managem...

机构

7 篇 chinese acad sci...
6 篇 univ adelaide sc...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 univ stuttgart i...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 institute of com...
4 篇 national laborat...
3 篇 huazhong univ sc...
3 篇 univ sydney sch ...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 huazhong univ sc...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 rothermel kurt
10 篇 shen hong
7 篇 jack dongarra
6 篇 li y
6 篇 albert y. zomaya
6 篇 roman wyrzykowsk...
5 篇 fahringer thomas
5 篇 duerr frank
5 篇 jerzy waśniewski
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 nakayama shigeru
5 篇 konrad karczewsk...
5 篇 huang z.
5 篇 lee young choon
4 篇 leung k.
4 篇 yang yang
4 篇 prodan radu

语言

1,727 篇 英文
30 篇 俄文
4 篇 其他
3 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1765 条记录，以下是341-350 订阅

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

详细简洁

排序：

Breaking weak 1024-bit RSA keys with CUDA

Breaking weak 1024-bit RSA keys with CUDA

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Scharfglass, Kerry Weng, Darrin White, Joseph Lupo, Christopher Calif Polytech State Univ San Luis Obispo Dept Comp Sci San Luis Obispo CA 93407 USA

ISBN: (纸本)9780769548791

An exploit involving the greatest common divisor (GCD) of RSA moduli was recently discovered [1]. this paper presents a tool that can efficiently and completely compare a large number of 1024-bit RSA public keys, and identify any keys that are susceptible to this weakness. NVIDIA's graphics processing units (GPU) and the CUDA massively-parallel programming model are powerful tools that can be used to accelerate this tool. Our method using CUDA has a measured performance speedup of 27.5 compared to a sequential CPU implementation, making it a more practical method to compare large sets of keys. A computation for finding GCDs between 200,000 keys, i.e., approximately 20 billion comparisons, was completed in 113 minutes, the equivalent of approximately 2.9 million 1024-bit GCD comparisons per second.

关键词： CUDA RSA greatest common divisor parallel computation

来源：评论

学校读者我要写书评

暂无评论

Applying Grid technologies to Bioinformatics

Applying Grid technologies to Bioinformatics

引用

10th Annual IEEE international Symposium on High Performance distributed computing

作者： Karo, M Dwan, C Freeman, J Weissman, J Livny, M Retzel, E Univ Minnesota Ctr Comp Genom & Bioinformat Minneapolis MN 55455 USA

ISBN: (纸本)0769512968

ne science of bioinformatics provides researchers with the tools necessary to unravel the mysteries of life and evolution, discover cures for disease, and control the evolution of living organisms. To assist researchers in managing the growing data processing and management demands associated with bioinformatics, we have created a production system that draws upon Grid based technologies to control several aspects of the process. We briefly discuss system architecture, results, and future directions of the project.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Sparse Matrix-Vector Multiplication: A Data Mapping-Based Architecture 15

Sparse Matrix-Vector Multiplication: A Data Mapping-Based Ar...

引用

15th international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Mansour, Ahmad Goetze, Juergen Hsu, Wei-Chun Ruan, Shanq-Jang TU Dortmund Informat Proc Lab Dortmund Germany Natl Taiwan Univ Sci & Technol Low Power Syst Design Grp Microsyst Lab Taipei Taiwan

ISBN: (纸本)9781479983346

the performance of the sparse matrix-vector multiplication (SMVM) on a parallel system is strongly affected by the distribution of data among its components. Two costs arise as a result of the used data mapping method: arithmetic and communication. the communication cost often dominates the arithmetic cost, and the gap between these costs tends to increase. therefore, finding a mapping method that reduces the communication cost is of high importance. On the other hand, the load distribution among the processing units must not be sacrificed. In this paper, a data mapping method is proposed for SMVM on Network-on-Chip which achieves balanced working load and reduces the communication cost. Afterwards, an FPGA-based architecture is introduced which is designed to fit with the proposed data mapping method.

关键词： data distribution parallel system Communication Research MAPPING(MAthEMATICAL) Multiplication Load distribution ARCHITECTURE Building construction arithmetic Workload

来源：评论

学校读者我要写书评

暂无评论

parallel retrograde analysis on different architecture

Parallel retrograde analysis on different architecture

引用

10th Annual IEEE international Symposium on High Performance distributed computing

作者： Wu, R Beal, DF HP Laboratories Hewlett-Packard Company Palo Alto CA United States

ISBN: (纸本)0769512968

Retrograde analysis is an efficient exhaustive search method. It is a powerful tool that can be used in solving problems where end states have known values but starting states do not. It has been widely used to solve mathematically-precise games such as chess endgames, and is potentially usable in energy-minimization problems. With increasing computing power, both in speed and storage capacity, retrograde analysis will become more and more useful. this paper looks at successful applications to games, the challenges ahead, and the modifications that are required to utilize distributed hardware. the power and the usefulness of retrograde analysis are still limited by the computing resources one has access to. Today, the best sequential retrograde algorithms are capable of solving problems with about 109 states in a few hours on a standard personal computer Bigger problems need more powerful computers, or take much longer to solve, or are simply out of reach of today's technologies, Introducing parallelism to retrograde analysis is a natural way to attack the bigger problems. there are today three main architectures available for doing parallel retrograde analysis: namely Symmetric Multiprocessor systems, High-speed network based distributed systems, and Internet based distributed systems. In this paper, we discuss some of the key issues in doing parallel retrograde analysis on these different architectures. Technical challenges are addressed in detail, as well as some examples and proposals. these examples and proposals are drawn from various board games, but the ideas can be applied to other problem domains.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing in parallel KD-Tree k-Means

Dynamic load balancing in parallel KD-Tree k-Means

引用

10th IEEE international conference on Computer and Information Technology, CIT-2010, 7th IEEE international conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable computing and Communications, ScalCom-2010

作者： Di Fatta, Giuseppe Pettinger, David School of Systems Engineering University of Reading Whiteknights Reading Berkshire RG6 6AY United Kingdom

ISBN: (纸本)9780769541082

One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions. the amount of computation can be significantly reduced by adopting geometrical constraints and an efficient data structure, notably a multi-dimensional binary search tree (KD-Tree). these techniques allow to reduce the number of distance computations the algorithm performs at each iteration. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. this issue has so far limited the adoption of these efficient k-Means variants in parallel computing environments. In this work, we provide a parallel formulation of the KD-Tree based k-Means algorithm for distributed memory systems and address its load balancing issue. three solutions have been developed and tested. Two approaches are based on a static partitioning of the data set and a third solution incorporates a dynamic load balancing policy. © 2010 IEEE.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of partition algorithms for parallel solution of nonlinear systems of equations

Performance analysis of partition algorithms for parallel so...

引用

4th international conference on parallel and distributed computing, applications and technologies (PDCAT 2003)

作者： Yang, G Rong, CM Nanjing Univ Posts & Telecommun Dept Comp Sci & Technol Nanjing 210003 Peoples R China

ISBN: (纸本)0780378407

In this paper, we discuss performance of partition algorithms for parallel solution of large-scale nonlinear systems of equations. We describe first a block Broyden algorithm for solving a nonlinear system in which a diagonal matrix is used as an iterative matrix. then, we analyze the parallelism of the algorithm and discuss in details different partitioning schemes. Finally, we give some numerical results and analyze performance of the partitioning schemes. the numerical results show that the algorithms combining block Broyden method with partitioning techniques are effective, and that they can be used in the large-scale problems arising from scientific and engineering computing.

关键词： parallel computation block partitioning supercomputing nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 15th IEEE international conference on Computational Science and Engineering, CSE 2012 and 10th IEEE/IFIP international conference on Embedded and Ubiquitous computing, EUC 2012

Proceedings - 15th IEEE International Conference on Computat...

引用

15th IEEE international conference on Computational Science and Engineering, CSE 2012 and 10th IEEE/IFIP international conference on Embedded and Ubiquitous computing, EUC 2012

ISBN: (纸本)9780769549149

the proceedings contain 93 papers. the topics discussed include: building input adaptive parallel applications: a case study of sparse grid interpolation;a lightweight middleware for developing P2P applications with component and service-based principles;automatic scaling of complex-event processing applications in eucalyptus;DCA: dynamic challenging level adapter for real-time strategy games;a grasp-based heuristic for the project portfolio selection problem;allocation of hard real-time periodic tasks for reliability maximization in distributed systems;automatic clustering assessment through a social tagging system;a new concise representation method of generalized frequent itemsets;parameter sweep and optimization of loosely coupled simulations using the DAKOTA toolkit;implementation of a data-driven workflow management system;and a new approach for indexing powder diffraction data based on dichotomy method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A novel parallel turbo coding technique based on frame split and trellis terminating

A novel parallel turbo coding technique based on frame split...

引用

4th international conference on parallel and distributed computing, applications and technologies (PDCAT 2003)

作者： Wan, K Chen, QC Fan, PZ SW Jiaotong Univ Chengdu 610031 Peoples R China

ISBN: (纸本)0780378407

In this paper, a new parallel Turbo encoding and decoding technique is introduced. In this technique, a long information data frame is first divided into sub-blocks which are then encoded with trellis terminating and decoded by parallel multiple SISO modules. It is shown that, at a slight increase in hardware complexity and a slight loss in the transmission efficiency due to the extra terminating bits appended, the proposed scheme can effectively reduce the decoding delay, and at the same time achieve noticeably better error performance compared with the regular schemes, especially in high code rate situation.

关键词： turbo codes parallel decoding trellis terminating

来源：评论

学校读者我要写书评

暂无评论

Evaluating the performance of a parallel multiobjective artificial bee colony algorithm for inferring phylogenies on multicore architectures

Evaluating the performance of a parallel multiobjective arti...

引用

2012 10th IEEE international Symposium on parallel and distributed Processing with applications, ISPA 2012

作者： Santander-Jiménez, Sergio Vega-Rodríguez, Miguel A. Gómez-Pulido, Juan A. Sánchez-Pérez, Juan M. University of Extremadura Department of Technologies of Computers and Communications ARCO Research Group 10003. Cáceres Spain

ISBN: (纸本)9780769547015

A wide variety of optimization problems requires the combination of Bioinspired and parallel computing to address the complexity needed to get optimal solutions in reduced times. the multicore era allows the researcher to exploit modern arqitectures to resolve these NP-Hard problems. Inferring phylogenetic trees which describe a hypothesis of the evolution of species is a well-known example of this kind of problems. As the space of possible tree topologies increases exponentially with the number of species, exhaustive searches cannot be applied. Also, additional difficulties arise when we must consider simultaneously multiple optimality measures to resolve the problem. In this paper, we report a performance study on multicore machines of a parallel multiobjective adaptation of the Artificial Bee Colony algorithm for inferring phylogenies according to the maximum parsimony and maximum likelihood criteria. Experimental results reveal that our proposal can improve other approaches based on advanced High Performance computing techniques on large data sets. © 2012 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

An Agent-based Model for Autonomous Planning in Distrubuted Critical Systems 10

An Agent-based Model for Autonomous Planning in Distrubuted ...

引用

10th international conference on P2P, parallel, Grid, Cloud and Internet computing 3PGCIC

作者： Amato, Flora Moscato, Francesco Dario, Pianese Univ Naples Federico II DIETI Naples Italy Univ Naples 2 DiSciPol Naples Italy

ISBN: (纸本)9781467394734

Critical distributed systems are usually employed in situation where automation is appealing when dealing with dangerous situations. Anyway, the complexity of these systems is growing up faster and faster. distributed autonomous elements like sensors networks, drones etc. are now widely used in critical system. In this systems, each autonomous element must implement procedures in order to reach their goals in a distributed, usually collaborative environments. New planning algorithms have to be coped with existing ones in order to fulfil performance and soundness requirements. In this paper we propose an autonomous planning methodology that is based on multi-agent models. the planning methodology exploits both classical and a new counter-example based approaches in order to build an effective multi-expert system able to face with increasing complexity of these systems. We also describe a framework we implemented in order to enact the methodology and we will present results from the study of a critical distributed system.

关键词： Counter Example Critical System distributed System Multi Agent System Planning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：