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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16,237 篇 会议
368 篇 期刊文献
22 册 图书

馆藏范围

16,627 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

9,336 篇 工学
- 8,536 篇 计算机科学与技术...
- 4,019 篇 软件工程
- 1,983 篇 电气工程
- 1,384 篇 信息与通信工程
- 676 篇 电子科学与技术（可...
- 536 篇 控制科学与工程
- 229 篇 网络空间安全
- 188 篇 仪器科学与技术
- 141 篇 机械工程
- 115 篇 生物医学工程（可授...
- 106 篇 动力工程及工程热...
- 105 篇 测绘科学与技术
- 97 篇 光学工程
- 91 篇 生物工程
- 82 篇 建筑学
- 70 篇 土木工程
- 63 篇 环境科学与工程（可...
- 62 篇 安全科学与工程
1,974 篇 理学
- 1,506 篇 数学
- 245 篇 物理学
- 204 篇 统计学（可授理学、...
- 177 篇 系统科学
- 115 篇 生物学
- 100 篇 地球物理学
- 69 篇 化学
1,464 篇 管理学
- 1,206 篇 管理科学与工程(可...
- 468 篇 工商管理
- 321 篇 图书情报与档案管...
106 篇 医学
- 86 篇 临床医学
96 篇 经济学
- 93 篇 应用经济学
56 篇 法学
53 篇 农学
18 篇 教育学
12 篇 文学
9 篇 军事学
1 篇 艺术学

主题

2,212 篇 parallel process...
1,199 篇 computer archite...
1,130 篇 concurrent compu...
1,116 篇 distributed comp...
1,063 篇 computational mo...
1,037 篇 application soft...
1,017 篇 distributed proc...
990 篇 hardware
905 篇 computer science
708 篇 graphics process...
595 篇 runtime
527 篇 scalability
518 篇 parallel process...
507 篇 algorithm design...
494 篇 parallel program...
490 篇 parallel algorit...
470 篇 graphics process...
460 篇 kernel
446 篇 processor schedu...
440 篇 conferences

机构

38 篇 ibm thomas j. wa...
33 篇 college of compu...
31 篇 school of comput...
27 篇 oak ridge nation...
26 篇 university of ch...
26 篇 oak ridge natl l...
25 篇 georgia inst tec...
25 篇 ohio state univ ...
24 篇 department of co...
23 篇 tsinghua univers...
23 篇 pacific northwes...
21 篇 argonne national...
21 篇 oak ridge nation...
20 篇 georgia inst tec...
19 篇 college of compu...
19 篇 school of comput...
19 篇 department of co...
19 篇 argonne natl lab...
19 篇 pacific northwes...
19 篇 national laborat...

作者

39 篇 jack dongarra
31 篇 dongarra jack
29 篇 zomaya albert y.
26 篇 bader david a.
23 篇 feng wu-chun
22 篇 boukerche azzedi...
19 篇 hoefler torsten
18 篇 gagan agrawal
18 篇 schulz martin
16 篇 dhabaleswar k. p...
16 篇 p. sadayappan
16 篇 wang yijie
15 篇 ito yasuaki
15 篇 yves robert
14 篇 h. casanova
14 篇 alexey lastovets...
14 篇 azad ariful
13 篇 dongsheng li
13 篇 wang guojun
13 篇 kishore kothapal...

语言

16,553 篇 英文
44 篇 其他
27 篇 中文
2 篇 土耳其文
1 篇 葡萄牙文

检索条件"任意字段=IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 16627 条记录，以下是381-390 订阅

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

详细简洁

排序：

When distributed Hash Tables Meet Chemical Programming for Autonomic Computing

When Distributed Hash Tables Meet Chemical Programming for A...

引用

26th ieee international parallel and distributed processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Obrovac, Marko Tedeschi, Cedric Univ Rennes 1 INRIA IRISA F-35014 Rennes France

ISBN: (纸本)9780769546766

With the rise of Service Computing, applications are more and more built as temporal compositions of autonomous services, in which services are combined dynamically to satisfy constantly arriving users' requests. These applications run on top of web-based, large, unreliable, and heterogeneous platforms, in which there is a high demand for autonomic behaviours, such as self-optimisation, self-adaptation, or self-healing. Chemistry-inspired computing consists in envisioning a computation as a succession of implicitly parallel, distributed and autonomous reactions, each reaction consuming molecules of data to produce new ones, until the state of inertia, where no more reactions are possible. This vision of a computation makes it a promising candidate to inject autonomic behaviours in service computing. However, while the benefits of such a model are manifold, its deployment over large scale platforms remains a widely open issue. In this paper, after identifying the main obstacles towards such a deployment, we propose a peer-to-peer framework able to execute chemical specifications at large scale. It combines distributed hash tables and algorithms for the atomic capture of molecules, and proposes an efficient method for inertia detection, which is a critical problem, in particular when addressed in a large scale environment. The sustainability of the framework is established through a complete complexity analysis.

关键词： Hash table Fault tolerant computing deployment Distribute Computing Service IT services Inertial forces Legal Services

来源：评论

学校读者我要写书评

暂无评论

Accurate Analytical Performance Model of Communications in MPI applications

Accurate Analytical Performance Model of Communications in M...

引用

23rd ieee international parallel and distributed processing symposium

作者： Martinez, D. R. Cabaleiro, J. C. Pena, T. F. Rivera, F. F. Blanco, V. Univ Santiago de Compostela Dept Elect & Comp Sci Santiago De Compostela Spain La Laguna Univ Dept Comp Sci & Stat San Cristobal la Laguna Spain

ISBN: (纸本)9781424437511

This paper presents a new LogP-based model, called LoOgGP, which allows an accurate characterization of MPI applications based on microbenchmark measurements. This new model is an extension of LogP for long messages in which both overhead and gap parameters perform a linear dependency with message size. The LoOgGP model has been fully integrated into a modelling framework to obtain statistical models of parallel applications, providing the analyst with an easy and automatic tool for LoOgGP parameter set assessment to characterize communications. The use of LoOgGP model to obtain a statistical performance model of an image deconvolution application is illustrated as a case of study.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Dynamic Batch parallel Algorithms for Updating PageRank 36

Dynamic Batch Parallel Algorithms for Updating PageRank

引用

36th ieee international parallel and distributed processing symposium (ieee IPDPS)

作者： Sahu, Subhajit Kothapalli, Kishore Banerjee, Dip Sankar Int Inst Informat Technol Hyderabad Hyderabad India Indian Inst Technol Jodhpur Jodhpur Rajasthan India

ISBN: (纸本)9781665497473

The design and implementation of parallel algorithms for dynamic graph problems is attracting significant research attention in the recent years, driven by numerous applications to social network analysis, neuroscience, and protein interaction networks. One such problem is the computation of PageRank values of vertices in a directed graph. This paper presents two new parallel algorithms for recomputing the PageRank values of vertices in a dynamic graph. Our techniques require the recomputation of the PageRank of only the vertices affected by the insertion/deletion of a batch of edges. We conduct detailed experimental studies of our algorithm on a set of 11 real-world graphs. Our results on Intel Xeon Silver 4116 CPU and NVIDIA Tesla V100 PCIe 16GB GPU indicate that our algorithms outperform static and dynamic update algorithms by 6.1x and 8.6x on the CPU, and by 9.8x and 9.3x on the GPU respectively. We also compare the performance of the algorithms in batched mode to cumulative single-edge updates.

关键词： Proteins Silver distributed processing Neuroscience Social networking (online) Heuristic algorithms Graphics processing units

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Android Security Extension against Privilege Escalation Attacks 15

An Adaptive Android Security Extension against Privilege Esc...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Xu, Yang Ren, Ju Zhang, Yaoxue Wang, Guojun Cent South Univ Sch Informat Sci & Engn Changsha Hunan Peoples R China Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781538637906

Android is the world's most popular mobile platform. Nevertheless, in spite of continuous efforts on its permission system, it is still incapable of resisting privilege escalation attacks, specially, the confused deputy attacks on numerous poor-designed applications. Worse yet, most existing security solutions become costly or rigid in recent Android dynamic permission environment. In this paper, we proposed a flexible and efficient security extension to Android middleware for protecting the vulnerable privileged applications from being abused by malwares in the dynamic permission scenario. Our framework maintains fresh permission states of applications at runtime and enforces access control on inter-component communications conservatively by checking the capability differences between applications, so as to provide more precise and temperate protection for applications. Moreover, we also introduced an efficient cache mechanism together with an optimized proactive updating method for decisions, which contributes significantly to improving the inspection efficiency. Finally, experimental results reveal that our framework is effective and adaptable in defending against confused deputy attacks on applications with negligible overhead and limited impact on application usability.

关键词： Android privilege escalation confused deputy attack dynamic permission access control efficiency

来源：评论

学校读者我要写书评

暂无评论

FGPA: Fine-Grained Pipelined Acceleration for Depthwise Separable CNN in Resource Constraint Scenarios 19

FGPA: Fine-Grained Pipelined Acceleration for Depthwise Sepa...

引用

19th ieee international symposium on parallel and distributed processing with applications (ieee ISPA)

作者： Xiao, Chunhua Xu, Dandan Qiu, Shi Shi, Chen Ning, Kun Chongqing Univ Coll Comp Sci Chongqing Peoples R China

ISBN: (纸本)9781665435741

Depthwise Separable Convolution can effectively reduce parameters and operations with little loss in precision, which becomes more and more popular in many innovative neural networks such as MobileNet and Xception. Due to limited computing resources and storage space, how to deploy Depthwise Separable CNN(DSCNN) in a more efficient manner for resource constraint scenarios is still an open and important problem to be explored. In this paper, a Fine-Grained Pipelined Acceleration scheme (FGPA) is proposed. Different from existing works, we partition the DSCNN accelerator into multiple computational modules that support fine-grained operations according to resource constraint and data dependency analysis, which is able to support starting next layer computation before previous layer completion. Along with the proposed scheduling strategy Start as Soon as Possible (SSP), we can accelerate DSCNN in a pipelined parallel manner, and all the intermediate data between layers can be kept on-chip memory to avoid the stream-out cost. In this way, we can not only improve the utilization of on-chip memory and computing resources but also reduce the network computational delay. As a case study, MobileNetV1 is implemented on Zynq XC7Z045. Experimental results indicate that the proposed DSCNN accelerator can achieve 99.68 GOPS and 0.17 GOPS/DSP under 250MHz clock frequency.

关键词： depthwise separable CNN fine-grained partition pipelined parallel FPGA

来源：评论

学校读者我要写书评

暂无评论

Deploying Graph Algorithms on GPUs: an Adaptive Solution

Deploying Graph Algorithms on GPUs: an Adaptive Solution

引用

ieee 27th international parallel and distributed processing symposium (IPDPS)

作者： Li, Da Becchi, Michela Univ Missouri Dept Elect & Comp Engn Columbia MO 65211 USA

ISBN: (纸本)9780769549712

Thanks to their massive computational power and their SIMT computational model, Graphics processing Units (GPUs) have been successfully used to accelerate a wide variety of regular applications (linear algebra, stencil computations, image processing and bioinformatics algorithms, among others). However, many established and emerging problems are based on irregular data structures, such as graphs. Examples can be drawn from different application domains: networking, social networking, machine learning, electrical circuit modeling, discrete event simulation, compilers, and computational sciences. It has been shown that irregular applications based on large graphs do exhibit runtime parallelism;moreover, the amount of available parallelism tends to increase with the size of the datasets. In this work, we explore an implementation space for deploying a variety of graph algorithms on GPUs. We show that the dynamic nature of the parallelism that can be extracted from graph algorithms makes it impossible to find an optimal solution. We propose a runtime system able to dynamically transition between different implementations with minimal overhead, and investigate heuristic decisions applicable across algorithms and datasets. Our evaluation is performed on two graph algorithms: breadth-first search and single-source shortest paths. We believe that our proposed mechanisms can be extended and applied to other graph algorithms that exhibit similar computational patterns.

关键词： data structures decision making graph theory graphics processing units parallel processing tree searching

来源：评论

学校读者我要写书评

暂无评论

Flexible Light Curves Generation System for Astronomical Catalogs 15

Flexible Light Curves Generation System for Astronomical Cat...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Li, Kun Yu, Ce Tang, Shanjiang Sun, Chao Huang, Siyuan Kang, Qinlong Zhao, Qing Tianjin Univ Sch Comp Sci & Technol Tianjin Peoples R China Tianjin Univ Sci & Technol Sch Comp Sci & Informat Engn Tianjin Peoples R China

ISBN: (纸本)9781538637906

Light curves are fundamental tools for variable star astronomy. They describe the change of celestial objects light intensity as time goes on. Because of the sharp increase of data in astronomical researches, the general methods are now utilized cannot meet the requirement of time-domain astronomical observation. In this paper, FLCGS, a Flexible Light Curves Generation System is proposed to achieve scalability and parallelism for generating light curves from astronomical catalogs. We design metadata files for light curves generation based on sky partition. Moreover, a new partition strategy is defined to keep workload balance. The function works very well via dynamic programming when the distribution of Big Data is skewed. We focus on the cross-matching between celestial objects from different catalogs and introduce a new method to determine whether they are the same celestial objects for light curves generation. Experimental results show that FLCGS is nearly 11 times faster than using MySQL, especially when the data is massive.

关键词： Astronomical catalogs Cross-match Light curves Partition Function parallel system

来源：评论

学校读者我要写书评

暂无评论

Projective Hard Thresholding Pursuit for Nonnegative Sparse Recovery 15

Projective Hard Thresholding Pursuit for Nonnegative Sparse ...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Zhang, Xiaoya Jiang, Hao Sun, Tao Cheng, Lizhi Huang, Chun Yang, Canqun Natl Univ Def Technol Coll Sci Changsha 410072 Hunan Peoples R China Natl Univ Def Technol Coll Comp Changsha 410072 Hunan Peoples R China UCLA Dept Math 601 Westwood Plz Los Angeles CA 90095 USA Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha 410072 Hunan Peoples R China

ISBN: (纸本)9781538637906

The data in scientific and engineering computations is usually gifted physical meaning in the presence of nonnegativity. For high performance and effectiveness, it is necessary and beneficial to consider the prior nonnegativity in processing the nonnegative information. In this paper, we propose a Projective Hard Thresholding Pursuit (PHTP) method for the nonnegative sparse signal recovery. It reconstructs sparse signal by combining the nonnegative projection with HTP. Theoretically, we prove that the proposed algorithm can find all nonnegative s-sparse signals provided the sensing matrix has suitable restricted isometry property. Moreover, We extend this result to its fast version. Besides, we verify PHTP's convergence with the measurement error being nonzero. Numerical experiments demonstrate that PHTP outperforms HTP and Nonnegative Least Squares(NNLS) for nonnegative sparse recovery and denoising.

关键词： Hard thresholding pursuit sparse recovery restricted isometry property nonnegative constraint

来源：评论

学校读者我要写书评

暂无评论

parallel Derandomization for Coloring 38

Parallel Derandomization for Coloring

引用

international parallel and distributed processing symposium (IPDPS)

作者： Coy, Sam Czumaj, Artur Davies-Peck, Peter Mishra, Gopinath Univ Warwick Dept Comp Sci Coventry W Midlands England Univ Durham Dept Comp Sci Durham England Natl Univ Singapore Dept Comp Sci Singapore Singapore

ISBN: (纸本)9798350387117;9798350387124

Graph coloring problems are among the most fundamental problems in parallel and distributed computing, and have been studied extensively in both settings. In this context, designing efficient deterministic algorithms for these problems has been found particularly challenging. In this work we consider this challenge, and design a novel framework for derandomizing algorithms for coloring-type problems in the Massively parallel Computation (MPC) model with sublinear space. We give an application of this framework by showing that a recent (degree + 1)-list coloring algorithm by Halldorsson et al. (STOC'22) in the LOCAL model of distributed computation can be translated to the MPC model and efficiently derandomized. Our algorithm runs in O(log log log n) rounds, which matches the complexity of the state of the art algorithm for the (Delta + 1)-coloring problem.

关键词： parallel algorithms Graph coloring Derandomization

来源：评论

学校读者我要写书评

暂无评论

parallel Particle-in-Cell Performance Optimization: A Case Study of Electrospray Simulation 31

Parallel Particle-in-Cell Performance Optimization: A Case S...

引用

31st ieee international parallel and distributed processing symposium Workshops (IPDPS)

作者： Narayanan, Ramachandran K. Madduri, Kamesh RNET Technol Inc Dayton OH 45459 USA Penn State Univ University Pk PA 16802 USA

ISBN: (纸本)9780769561493

The particle-in-cell (PIC) numerical technique is frequently used in physics and engineering simulations. In this work, we describe ES-PIC, a new shared-memory parallel implementation of the PIC technique for electrospray simulations. Electrospray simulations are used in aerospace applications, and the goal of an electrospray simulation is to understand behavior of an electrospray thruster or a colloid thruster. We discuss performance optimizations for various steps of a PIC-based electrospray simulation. One of the main steps in this simulation is solving the Poisson partial differential equation, and this step can be in turn converted to solving a system of linear equations. We develop a parallel implementation of the Multigrid method for this step. We demonstrate that ES-PIC is significantly faster than other parallel PIC electrospray simulation implementations on Intel Xeon multicore platforms. Further, ES-PIC can serve as a real-world scientific computing benchmark for analyzing parallel system performance.

关键词： multigrid OpenMP particle in cell PIC shared-memory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：