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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是21-30 订阅

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

详细简洁

排序：

Asynchronous group-based ADMM algorithm under efficient communication structure 16

Asynchronous group-based ADMM algorithm under efficient comm...

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Zhou, Jianhui Lei, Yongmei Shanghai Univ Sch Comp Engn & Sci Shanghai Peoples R China

ISBN: (纸本)9781728111414

Alternating direction method of multipliers (ADMM) has been recognized as an efficient approach for solving many large-scale machine learning problems. However, the ADMM under master-slave mode suffers from several limitations, e.g., can't make full use of multi-core cluster environment and single master load is too heavy, resulting in huge time overhead. In this paper, we propose a hierarchical communication structure. Since intra-node communications mostly use shared memory, we divide the processes of the same node into one group, the processes within the group synchronize communication, and each group communicate asynchronously with the master. Combining this structure with the ADMM algorithm, a hierarchical asynchronous group-based ADMM algorithm (HAG-ADMM) is proposed. theoretical analysis and experiments show that the hierarchical communication structure can improve the communication efficiency of the algorithm and has no effect on the convergence.

关键词： distributed optimization ADMM asynchronous hierarchical communication structure group-based ADMM parallel computing

来源：评论

学校读者我要写书评

暂无评论

Reducing Time and/or Memory Consumption of the SOG construction in a parallel Context 16

Reducing Time and/or Memory Consumption of The SOG construct...

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Ouni, Hiba Klai, Kais Abid, Chiheb Ameur Zouari, Belhassen Univ Tunis El Manar Fac Sci Tunis Tunis 2092 Tunisia Univ Paris 13 CNRS UMR 7030 LIPNSorbonne Paris Cite Villetaneuse France Univ Carthage Higher Sch Commun Tunis Mediatron Lab Tunis Tunisia

ISBN: (纸本)9781728111414

An efficient way to cope with the combinatorial explosion problem induced by the model checking process is to compute the Symbolic Observation Graph (SOG). Such a graph is a condensed representation of the state space that is obtained by taking advantage of symbolic representation of the nodes. Each node, called aggregate, represents a set of explicit states and is encoded using Multi-valued decision diagrams. In a previous work, we have shown that parallel and distributed approaches can improve drastically the performances of the SOG computation regarding a sequential construction. In this paper, we go a step forward in improving the SOG construction process by reducing, on the fly, the size of its aggregates. We propose a Multi-valued decision diagrams (MDDs) based algorithm to determine a single representative for each strongly connected component in every aggregate allowing to remove from memory a consequent number of states which are no more necessary for the construction process. Two parallel approaches for the building of an SOG are proposed using such an optimization. the first approach is based on a shared memory architecture, while the second is based on a distributed memory one. the results of our preliminary experiments show that, in first case, the canonization allows to obtain more compact SOG (in terms of memory consumption) while increasing the computation time. However, for the distributed memory based approach, the canonization allows to reduce the size of exchanged messages and therefore reducing communication time.

关键词： Canonization distributed Model Checking parallel Model checking

来源：评论

学校读者我要写书评

暂无评论

Radix: Enabling High-throughput Georeferencing for Phenotype Monitoring over Voluminous Observational Data 16

Radix: Enabling High-throughput Georeferencing for Phenotype...

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Roselius, Maxwell Pallickara, Sangmi Lee Colorado State Univ Dept Comp Sci Ft Collins CO 80523 USA

ISBN: (纸本)9781728111414

Remote sensing of plant traits and their environment facilitates non-invasive, high-throughput monitoring of the plant's physiological characteristics. Effective ingestion of these sensing data into a storage subsystem while georeferencing phenotyping setups is key to providing timely access to scientists and modelers. In this study, we propose RADIX, a high-throughput distributed data ingestion framework with support for fine-grained georeferencing. Our methodology includes a novel spatial indexing scheme, the nested hash grid, for fine-grained georeferencing of data while conserving memory footprints and ensuring acceptable latency. We include empirical evaluations performed on a commodity machine cluster with up to 1TB of data. Our benchmarks demonstrate the efficacy of our approach.

关键词： high-throughput georeferencing distributed analytics High-throughput phenotyping. data ingestion sensor data

来源：评论

学校读者我要写书评

暂无评论

Recovering scalable spin locks

Recovering scalable spin locks

引用

8th ieee symposium on parallel and distributed processing

作者： Bohannon, P Lieuwen, D Silberschatz, A Bell Lab Murray Hill United States

ISBN: (纸本)0818676833

We present a mechanism for making a scalable spin lock protocol, the MCS lock, recoverable thereby ensuring that a lock never becomes permanently unavailable, even if one or more processes using the lock die. this is achieved by modifying the original protocol to write additional information to shared memory and introducing a cleanup process which returns locks to a usable state in case of process death(s). Our method does not require kernel or hardware support other than the swap instruction, and maintains performance comparable to the original protocol (one third as fast in the uncontested case). We have proven the correctness of our scheme in the face of the weak memory models provided by modem systems.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

distributed parallelizability Analysis of Legacy Code 16

Distributed Parallelizability Analysis of Legacy Code

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Zhao, Junfeng Zhao, Zhimei Yang, Hongji Inner Mongolia Univ Coll Comp Sci Hohhot Peoples R China Univ Leicester Dept Informat Leicester Leics England

ISBN: (纸本)9781728111414

With the emergence of cloud computing and big data, migrating legacy systems to a cloud platform has become a trend. To make full use of the parallel advantage of cloud computing, it is necessary to refactor the legacy code according to the programming model of cloud computing. Before that, the parallelizability analysis is the first thing to do. In this paper, an approach is proposed for the distributed parallelizability analysis of legacy code, which is based on the analysis of dependency between loop iterations. According to the categories of the traditional dependency, the dependency between loop iterations is divided into three types, and the judgment rules of the dependency between loop iterations are proposed. then a distributed parallelizability Analysis Tool (DPAT) based on Abstract Syntax Tree (AST) was developed to identify and annotate the parallelizable loops. Experimental results show that the approach can effectively identify the parallelizable code fragments, which will be the target objects of refactoring. In contrast to the existing approaches, our method can identify parallelizability between loop iterations and not limit the type of the loop.

关键词： legacy code abstract syntax tree distributed parallelizability analysis dependency between loop iterations

来源：评论

学校读者我要写书评

暂无评论

Bitwise aggregate networks

Bitwise aggregate networks

引用

8th ieee symposium on parallel and distributed processing

作者： Hoare, R Dietz, H Mattox, T Kim, S Purdue Univ West Lafayette United States

ISBN: (纸本)0818676833

Typical communication networks for parallel processing are based on sending data from one processor to one, or all, of the other processors. Using such a network, many simple operations that require information from every processor requires many point-to-point or broadcast communications. these aggregate operations can be as simple as a barrier synchronization or as complex as an arithmetic reduction. In this paper we discuss a class of networks that directly implement a wide range of aggregate operations. these networks are capable of performing aggregate operations in a single communication operation using only simple bitwise combining logic in a trivially scalable tree configuration. this work has been supported in part by ONR Grant No. N0001-91-J-4013 and NSF Grant No. CDA-9015696.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

LogoPhish: A New Two-dimensional Code Phishing Attack Detection Method 16

LogoPhish: A New Two-dimensional Code Phishing Attack Detect...

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Yao, Wenbin Ding, Yuanhao Li, Xiaoyong Beijing Univ Posts & Telecommun Beijing Key Lab Intelligent Telecommun Software & Beijing Peoples R China Beijing Univ Posts & Telecommun Minist Educ Key Lab Trustworthy Distributed Comp & Serv BUPT Beijing Peoples R China

ISBN: (纸本)9781728111414

Traditional phishing detection methods are mostly based on computer platforms and cannot be directly applied to mobile devices. this paper proposes a new two-dimensional code phishing detection method called LogoPhish. We use the logo to determine the identity between a two-dimensional code's actual identity and the described identity. the method includes two processes: logo extraction and identity detection. the first process uses a mobile phone to scan the two-dimensional code to extract the logo and perform image processing. the second process uses the Google image search engine to determine the identity of the logo. Since the relationship between the logo and the domain name is exclusive, it is reasonable to use the domain name as an identifier. the experimental results show that LogoPhish has a good effect and is superior to the traditional detection method in the detection of two-dimensional code phishing attacks.

关键词： Phishing attack Two-dimensional code Logo recognition

来源：评论

学校读者我要写书评

暂无评论

Fast deterministic sorting on large parallel machines

Fast deterministic sorting on large parallel machines

引用

8th ieee symposium on parallel and distributed processing

作者： Dachraoui, T Narayanan, L Concordia Univ Montreal Canada

ISBN: (纸本)0818676833

Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random data. Unfortunately many real-world applications require sorting on data that is not uniformly distributed. In this paper;we consider distributions of varying entropies. We describe A-Ranksort, a new sorting algorithm for parallel machines, whose behavior on input distributions of different entropies is relatively stable. Our algorithm is based on a deterministic strategy to find approximate ranks for all keys. We implemented A-Ranksort, B-Flashsort [10], Radixsort [5], and Bitonic sort [2] on a 2048 processor Maspar MP-1. Our experiments show that A-Ranksort out-performs all the other algorithms on a variety of input distributions, when the output is required to be balanced. We are also able to provide bounds on the average-case and worst-case complexities of our algorithm in terms of the costs of some chosen primitive operations. the predicted performance is very close to the empirical results, thus justifying our model.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Implementing cooperative software with high-level communication packages

Implementing cooperative software with high-level communicat...

引用

8th ieee symposium on parallel and distributed processing

作者： Forst, A Kuhn, E Univ of Technology Vienna Vienna Austria

ISBN: (纸本)0818676833

the use of appropriate tools is crucial for the development of robust and distributed software. the programming of heterogeneous environments is more demanding than programming single, stand-alone computers. We believe that client/sewer technology is not a satisfactory solution. Most problems do not naturally decompose into an asymmetric client/server structure. Better abstraction mechanisms are needed. We propose a new coordination framework that we have developed. It supports shared objects as reliable communication media, advanced transactions and concurrency through processes that form reliable software contracts. For a discussion, we compare the realization of a typical distributed application, that belongs to the domain of cooperative work, with three different tools: Our coordination framework, a representative of the classical client/server and message paradigm, and the Linda communication model.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

parallel Model Checking on Pushdown Systems 16

Parallel Model Checking on Pushdown Systems

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Wei, Hansheng Chen, Xinyu Ye, Xin Fu, Neng Huang, Yanhong Shi, Jianqi East China Normal Univ Natl Trusted Embedded Software Engn Technol Res C Shanghai Peoples R China Hardware Software Codesign Technol & Applicat Eng Shanghai Peoples R China Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China LIPN Paris France Paris Univ 7 Paris France

ISBN: (纸本)9781728111414

Pushdown systems (PDSs) have been widely used in program verification, such as recursive programs, malware detection, and other model-checking problems. As programs become more complicated, the model-checking process of PDSs represents a real challenge, which is the well-known state explosion problem. this problem may be cost expensive both in terms of memory and time. parallel computing has been introduced to overcome this limitation, especially GPU computing. In this paper, we propose novel parallel algorithms to accelerate model checking on PDSs according to the characteristics of automata-theoretic. To represent the model-checking process on parallel architectures, we propose two new models: multi-threaded P-automaton and multi-threaded Buchi pushdown systems. Moreover, we design a highly efficient data structure for PDSs and dynamic task management to accommodate the GPU. Compared with Moped, a popular model checker for PDSs, our approach achieves promising performance.

关键词： CUDA GPU Model Checking parallel computing Pushdown Systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：