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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,500 篇 会议
69 篇 期刊文献
4 册 图书

馆藏范围

2,573 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,571 篇 英文
1 篇 葡萄牙文
1 篇 其他

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

共 2573 条记录，以下是61-70 订阅

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

详细简洁

排序：

Secure Cloud Computing: Communication Protocol for Multithreaded Fully Homomorphic Encryption for Remote Data processing 15

Secure Cloud Computing: Communication Protocol for Multithre...

引用

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

作者： Oppermann, Alexander Toro, Federico Grasso Yurchenko, Artem Seifert, Jean-Pierre PTB Dept Metrol IT 8 5 Berlin Germany Tech Univ Berlin Secur Telecommun Berlin Germany

ISBN: (纸本)9781538637906

A significant disadvantage of fully homomorphic encryption is the long periods of time needed to process encrypted data, due to its complex and CPU-intensive arithmetic techniques. In this paper, a communication protocol is developed to ensure authenticity, integrity and privacy of measurement data across a distributed measuring system. the fully homomorphic encryption library LibScarab was extended by integer arithmetics, comparisons, decisions and multithreading to secure data processing. Furthermore, it enhances 32 and 64-bit arithmetic operations, improving them by a higher factor. this extension is integrated into a cloud computing architecture establishing privacy by design. the resulting parallelized algorithm solved the time constraint issues for smart meter gateway tariffs. Several tests were performed, fulfilling tariff specifications, where preserving privacy of accumulated data was necessary. It was concluded that this extension of the fully homomorphic encryption library meets the requirements of real world applications.

关键词： Libraries Encryption Cloud computing Protocols Servers

来源：评论

学校读者我要写书评

暂无评论

parallel Huffman Decoding: Presenting a Fast and Scalable Algorithm for Increasingly Multicore Devices 15

Parallel Huffman Decoding: Presenting a Fast and Scalable Al...

引用

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

作者： Johnston, Beau McCreath, Eric C. Australian Natl Univ Res Sch Comp Sci Canberra ACT Australia

ISBN: (纸本)9781538637906

Huffman encoding provides a simple approach for lossless compression of sequential data. the length of encoded symbols varies and these symbols are tightly packed in the compressed data. thus, Huffman decoding is not easily parallelisable. this is unfortunate since it is desirable to have a parallel algorithm which scales with the increased core count of modern systems. this paper presents a parallel approach for decoding Huffman codes which work by decoding from every location in the bit sequence then concurrently combining the results into the uncompressed sequence. Although requiring more operations than serial approaches the presented approach is able to produce results marginally faster, on sufficiently large data sets, then that of a simple serial implementation. this is achieved by using the large number of threads available on modern GPUs. A variety of implementations, primarily OpenCL, are presented to demonstrate the scaling of this algorithm on CPU and GPU hardware in response to cores available. As devices with more cores become available, the importance of such an algorithm will increase.

关键词： Decoding Program processors Hardware Partitioning algorithms Multicore processing Encoding Image coding

来源：评论

学校读者我要写书评

暂无评论

Efficient Decentralized Attribute-Based Encryption with Outsourced Computation for Mobile Cloud Computing 15

Efficient Decentralized Attribute-Based Encryption with Outs...

引用

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

作者： Shao, Jiaye Zhu, Yanqin Ji, Qijin Soochow Univ Sch Comp Sci & Technol Suzhou Jiangsu Peoples R China

ISBN: (纸本)9781538637906

Multi-authority attribute-based encryption (ABE) is regarded as one of the most promising techniques to handle the problem of the access control of shared data because it provides fine-grained access control of encrypted data in cloud storge. However, most existing multi-authority ABE schemes suffer from expensive computational cost on the user side, which increases with the complexity of access structures. In this paper, we present a novel large universe decentralized ABE scheme with outsourced encryption and decryption based on the multi-authority system for mobile cloud computing. A majority of complex and expensive computation operations are migrated to the encryption and decryption proxy server respectively, so we can minimize the computation overhead for the data users simultaneously. the theoretical analysis indicates that our scheme is correct with static security in the random oracle model. Furthermore, the analytical comparison and extensive experimental results demonstrate that our scheme is efficient.

关键词： distributed processing Conferences Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

A robust adaptive metric for deadline assignment in heterogeneous distributed real-time systems

A robust adaptive metric for deadline assignment in heteroge...

引用

13th parallel processing symposium / 10th symposium on parallel and distributed processing (IPPS/SPDP 1999)

作者： Jonsson, J Chalmers Dept Comp Engn S-41296 Gothenburg Sweden

ISBN: (纸本)0769501435

In a real-rime system, tasks are constrained by global end-to-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over component tasks in an intelligent way. In this paper, we present an improved version of the slicing technique and extend it to heterogeneous distributed hard real-time systems. the salient feature of the new technique is that it utilizes adaptive metrics for assigning local task deadlines. Using experimental results rue show that the new technique exhibits superior performance with respect to the success ratio of a heuristic scheduling algorithm. For smaller systems, the new adaptive metric outperforms a previously-proposed adaptive metric by 300%, and existing non-adaptive metrics by more than an order of magnitude. In addition, the new technique is shown to be extremely robust for various system configurations.

关键词： Robustness Real time systems Application software Software maintenance Costs distributed computing Computer applications Software performance Software reusability parallel processing

来源：评论

学校读者我要写书评

暂无评论

Jaccard Coefficients as a Potential Graph Benchmark 30

Jaccard Coefficients as a Potential Graph Benchmark

引用

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

作者： Kogge, Peter M. Univ Notre Dame CSE Dept Notre Dame IN 46556 USA

ISBN: (纸本)9781509036820

the processing of graphs is of increasing importance in many applications, with the size of such graphs growing rapidly. As with scientific computing, there is a growing need to understand the relationship between system architectures and graph algorithms, especially as both the scale of the system and the size of the graph increase. To date there is one such graph benchmark that has several hundred comparative reports available, namely Breadth First Search, which has over the last few years fueled new algorithms that have improved typical performance very significantly. this paper suggests an additional benchmark based on the computation of neighborhoods and Jaccard coefficients that is of both a different intrinsic complexity and can be recast in multiple ways that may be suitable for different classes of real-world applications.

关键词： parallel algorithms graph benchmarks Jaccard Coefficients

来源：评论

学校读者我要写书评

暂无评论

Research on CPN Model Reduction Focus On parallel Tested Behaviors 15

Research on CPN Model Reduction Focus On Parallel Tested Beh...

引用

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

作者： Sun Tao Zhang Wei Guo Xin Wan Xiaoyun Inner Mongolia Univ Coll Comp Sci Hohhot Peoples R China

ISBN: (纸本)9781538637906

Nowadays parallel software system is very common and practical. However, it is difficult to test parallel software, because the state space of parallel software is very large. therefore, a parallel model simplification method based on CPN (Color Petri Net) is proposed. Based on the original CPN, the CPN model for the tested behavior(Tested Behavior of CPN, TBoCPN) is proposed. the target of the test is described as the tested behavior. the relevant behavior is described as the behavior related to the tested behavior, then, the homogeneous concurrent branch group and the selection branch set are divided. Finally, the branches of the concurrent branch group and the selected branch set, which satisfied the condition of algorithm, are sequentially processed by the inhibitor arcs. the experiment shows that the reduction rate is at least 60%, and before and after the reduction, the full coverage test path generated by the tested behavior is not affected, thus proving that the method is an effective test method.

关键词： parallel software CPN tested behavior related behavior concurrent branch group selection branch set full coverage

来源：评论

学校读者我要写书评

暂无评论

Efficient Differentially Private Tensor Factorization in the parallel and distributed Computing Paradigm 21

Efficient Differentially Private Tensor Factorization in the...

引用

21st ieee international symposium on parallel and distributed processing with applications, 13th ieee international Conference on Big Data and Cloud Computing, 16th ieee international Conference on Social Computing and Networking and 13th international Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Zhang, Feng Wang, Hao Guo, Ruixin Xue, Erkang Qu, Guangzhi China University of Geosciences School of Computer Science Wuhan China Oakland University Department of Computer Science and Engineering Rochester United States

ISBN: (纸本)9798350329223

Tensor factorization plays a fundamental role in multiple areas of AI research. Nevertheless, it encounters significant challenges related to privacy breaches and operational efficiency. In this study, we propose a novel approach that addresses both of these issues simultaneously by integrating differential privacy with parallel and distributed computing. To accommodate diverse scenarios, we introduce two models: DPTF-SVRG and ADMM-DPTF, each leveraging specific techniques. DPTF-SVRG is designed for single-GPU environments and utilizes a unique strategy to reduce gradient variance, enabling faster convergence compared to SGD. Moreover, it achieves parallelism on the GPU through a lock-free asynchronous approach. On the other hand, ADMM-DPTF utilizes distributed ADMM to parallelize DPTF-SVRG, enabling multi-GPU parallelism. Experimental results demonstrate that our algorithms outperform existing benchmarks while maintaining differential privacy. © 2023 ieee.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Human Flesh Search Model Incorporating Network Expansion and GOSSIP with Feedback 09

Human Flesh Search Model Incorporating Network Expansion and...

引用

13th ieee/ACM symposium on distributed Simulation and Real-Time applications (DS-RT 2009)

作者： Wang, Bing Hou, Bonan Yao, Yiping Yan, Laibin Natl Univ Def Technol Sch Comp Sci Changsha Hunan Peoples R China

ISBN: (纸本)9780769538686

With the development of on-line forum technology and the pervasive participation of the public, the Human Flesh Search is becoming an arising phenomenon which makes a great impact on our daily life. there arose big research interests in social, legal issues resulted from HFS, however, very little work has been conducted to understand how it comes into being and how it dynamically evolves. this paper proposes a modeling and simulation approach incorporating network expansion and GOSSIP propagation with feedback for a better understanding of the human flesh search phenomenon. Based on the acquisition and analysis of the netizens' surfing behavior data, the evolution of the HFS Is modeled as a network growth process with proper dynamic input, which is characterized by heavy-tail and burst-oriented distribution, modeling as a Weibulloid process. then, an improved GOSSIP model with feedback is proposed to represent the information propagation, processing and aggregation during the HFS. New insights for HFS are gained through a set of simulation experiments.

关键词： human flesh search(HFS) social network comeplex network distributed problem solving crowdsourcing GOSSIP with feedback

来源：评论

学校读者我要写书评

暂无评论

Automatic parallel Pattern Detection in the Algorithm Structure Design Space 30

Automatic Parallel Pattern Detection in the Algorithm Struct...

引用

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

作者： Huda, Zia Ul Atre, Rohit Jannesari, Ali Wolf, Felix Tech Univ Darmstadt Lab Parallel Programming Darmstadt Germany Rhein Westfal TH Aachen Aachen Germany

ISBN: (纸本)9781509021406

parallel design patterns have been developed to help programmers efficiently design and implement parallel applications. However, identifying a suitable parallel pattern for a specific code region in a sequential application is a difficult task. Transforming an application according to support structures applicable to these parallel patterns is also very challenging. In this paper, we present a novel approach to automatically find parallel patterns in the algorithm structure design space of sequential applications. In our approach, we classify code blocks in a region according to the appropriate support structure of the detected pattern. this classification eases the transformation of a sequential application into its parallel version. We evaluated our approach on 17 applications from four different benchmark suites. Our method identified suitable algorithm structure patterns in the sequential applications. We confirmed our results by comparing them with the existing parallel versions of these applications. We also implemented the patterns we detected in cases in which parallel implementations were not available and achieved speedups of up to 14x.

关键词： parallelism parallel patterns task parallelism

来源：评论

学校读者我要写书评

暂无评论

NUMA-aware CPU core allocation in cooperating dynamic applications 34

NUMA-aware CPU core allocation in cooperating dynamic applic...

引用

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

作者： Dokulil, Jiri Benkner, Siegfried Univ Vienna Fac Comp Sci Vienna Austria

ISBN: (纸本)9781728174457

Building large scientific applications by composing multiple smaller applications is one of current research directions. If the individual component applications are executed together on one compute node, we need to allocate resources to the components. While the operating system is already capable of doing this, it might be possible to get higher efficiency with a more specialized solution. Our goal is to describe opportunities and challenges faced by anyone designing such a system. We look into the specific case where a dynamic runtime system (or multiple such runtime systems) are used by the applications, since we believe the fundamental design of these runtime systems makes them especially suitable for the role. the ideas described in this paper are based on our prior experience in building such a runtime system and our early experiments with cooperating applications. We will focus on CPU core allocation and point out the importance of making non-uniform memory access architectures a prime consideration in such work.

关键词： resource arbitration CPU core allocation dynamic runtime systems cooperating applications NUMA

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：