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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

BAD-Check§ : Bulk Asynchronous distributed Checkpointing 10

BAD-Check§ : Bulk Asynchronous Distributed Checkpointing

引用

10th parallel Data Storage Workshop, PDSW 2015

作者： Bent, John Settlemyer, Brad Bao, Haiyun Faibish, Sorin Sauer, Jeremy Zhang, Jingwang Los Alamos National Laboratory United States

ISBN: (纸本)9781450340083

Leadership-scale scientific simulations running as tens of thousands of tightly-coupled MPI processes are vulnerable to interruption due to a single process or node failure. Due to the dependence of each state calculation on the successful completion of each of the prior state calculations, checkpoint restart is the most widely-used technique to achieve fault tolerance. To write a consistent view of distributed state as a checkpoint, applications typically synchronize and pause while writing data to persistent media. In this paper we present a transactional protocol that enables asynchronous distributed creation of checkpoint data sets, and describe the conditions under which it is beneficial. With simulations, we demonstrate that scientific applications exhibiting computational variance without frequent synchronization can use our protocol to either reduce run time by up to 27% or reduce required storage system capability by up to 40%. © 2015 ACM.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

the implementation of distributed retrieval system for a large number of collections

The implementation of distributed retrieval system for a lar...

引用

8th international conference on parallel and distributed computing, applications and technologies

作者： Kim, Kwang-Young Kim, Jin-Suk Lee, Seok-Hyong Lee, Min-Ho Choi, Sung-Pil Choi, Yun-Soo Jin, Du-Seok Cho, Min-Hee Jeong, Chang-Hoo Kang, Nam-Gyu Choe, Ho-Seop Seo, Jerry Yoon, Hwa-Mook Korea Inst Sci & Technol Informat Taejon South Korea

ISBN: (纸本)9780769530499

With the development of internet technologies, internet has been more complexly consisted of a large amount of Web documents, science technology documents, data-base and etc. distributed retrieval system is more required to support effective retrieval and management about a large amount of Web documents, science technology documents and etc. distributed retrieval system has to support for user to search quickly and exactly. A distributed retrieval system has to support for DB manager to manage easily. So we have developed the distributed retrieval system called dKRISTAL(1) which finds indexing files and manages database system in real time. We have developed new dKRISTAL system which can support searching and managing database. We measured the integrated search speed of distributed retrieval system. Also this system effectively manages documents at real-time. this paper made an experiment using a large mount of science technology information system and Web documents using dKRISTAL. this paper analyzed the result of experiment.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Privacy preserving set intersection protocol secure against malicious behaviors

Privacy preserving set intersection protocol secure against ...

引用

8th international conference on parallel and distributed computing, applications and technologies

作者： Sang, Yingpeng Shen, Hong Univ Adelaide Sch Comp Sci Adelaide SA 5005 Australia

ISBN: (纸本)9780769530499

When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper we address the Privacy Preserving Set Intersection (PPSI) problem, in which each of the N parties learns no elements other than the intersection of their N private datasets. We propose an efficient protocol in the malicious model, where the adversary may control arbitrary number of parties and execute the protocol for its own benefit. A related work in [12] has a correctness probability of (N-1/N)(N) (N is the size of the encryption scheme's plaintext space), a computation complexity of O(N(2)S(2)lgN) (S is the size of each party's data set). Our PPSI protocol in the malicious model has a correctness probability of (N-1/N)(N-1), and achieves a computation cost of O(c(2)S(2)lgN) (c is the number of malicious parties and c <= N-1).

关键词： cryptographic protocol privacy preservation distributed datasets set intersection zero-knowledge proof

来源：评论

学校读者我要写书评

暂无评论

Consistency aware dead reckoning threshold tuning with server assistance in client-server-based DVEs

Consistency aware dead reckoning threshold tuning with serve...

引用

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

作者： Li, Yusen Cai, Wentong Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9780769541082

In distributed virtual environments (DVEs), maintaining a consistent view of the virtual world among all users is a primary task. Due to the resource limitations such as network capacity and computational power, the consistency of the virtual world cannot be guaranteed sometimes. In this paper, we try to address this problem in client-server-based DVEs by considering server side network capacity limitation. We look at the position update packets from client to server and show the impact of packet loss due to server side network capacity limitation on the consistency of the virtual world. We assume clients use Dead Reckoning (DR) models to control position updates. In order to adapt client updates with the server side network capacity to avoid update packet loss, two server assistant DR threshold tuning policies for different updating schemas are proposed in this paper. the proposed tuning polices are validated to have good performance by simulation results. © 2010 IEEE.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

Allocation of hard real-time periodic tasks for reliability maximization in distributed systems

Allocation of hard real-time periodic tasks for reliability ...

引用

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

作者： Faragardi, Hamid Reza Shojaee, Reza Mirzazad-Barijough, Maziar Nosrati, Roozbeh Univ Tehran Sch Elect & Comp Engn Tehran Iran Anglia Ruskin Univ Fac Sci & Technol Dept Comp & Technol Cambridge Essex England

ISBN: (纸本)9781467351652;9780769549149

A real-time parallel application can be divided into a number of tasks and executed concurrently on distinct nodes of a distributed System (DS). distributed System Reliability (DSR) can be defined as the probability that all the tasks in the system run successfully. Due to different hazard rates of nodes and links, DSR critically depends on the optimal allocation of these tasks onto the available nodes. In this paper, we have presented a mathematical model for analyzing DSR in a DS on which hard real-time periodic tasks are executed. In addition, to maximize reliability besides satisfying the constraints, we have proposed an offline task allocation algorithm. the algorithm is a new swarm intelligence approach based on Ant Colony Optimization (ACO). For evaluating the algorithm, ACO is compared with Honey Bee Mating Optimization (HBMO) and Particle Swarm Optimization (PSO). Simulation results manifest that ACO produces better solutions than PSO and HBMO. Meanwhile, it leads to shorter execution time. the results also reveal the flexibility and scalability of the proposed algorithm.

关键词： distributed system reliability hard real-time system task allocation Ant Colony optimization

来源：评论

学校读者我要写书评

暂无评论

Analysis of parallel computing environment overhead of OpenMP for loop with multi-core processors

Analysis of parallel computing environment overhead of OpenM...

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Li, Wan-Qing Ying, Tang Li, Yunfa Wei, Zhang Feng, Jangcong Jilin, Zhang School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China College of Optical and Electronic Technology China Jiliang University Hangzhou China

ISBN: (纸本)9780769542874

this paper analyze the parallel computing environment overhead of OpenMP for loop with multi-core processors including the case of data-race. the different solutions of data-race are discussed in present paper, such as critical pragma, atomic pragma and reduction clause. A new method is also presented in this paper which produces the least parallel environment overhead compared with other methods and the codes are presented too. the conclusions and discussions are beneficial to save computing time and improve the computational efficiency. © 2010 IEEE.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

QbDJ: A Novel Framework for Handling Skew in parallel Join Processing on distributed Memory

QbDJ: A Novel Framework for Handling Skew in Parallel Join P...

引用

15th IEEE international conference on High Performance computing and Communications (HPCC) /11th IEEE/IFIP international conference on Embedded and Ubiquitous computing (EUC)

作者： Cheng, Long Kotoulas, Spyros Ward, Tomas E. theodoropoulos, Georgios Natl Univ Ireland Maynooth Kildare Ireland IBM Res Dublin Ireland Univ Durham Durham DH1 3HP England

ISBN: (纸本)9780769550886

the performance of parallel distributed data management systems becomes increasingly important with the rise of Big Data. parallel joins have been widely studied both in the parallel processing and the database communities. Nevertheless, most of the algorithms so far developed do not consider the data skew, which naturally exists in various applications. State of the art methods designed to handle this problem are based on extensions to either of the two prevalent conventional approaches to parallel joins - the hash-based and duplication-based frameworks. In this paper, we introduce a novel parallel join framework, query-based distributed join (QbDJ), for handling data skew on distributed architectures. Further, we present an efficient implementation of the method based on the asynchronous partitioned global address space (APGAS) parallel programming model. We evaluate the performance of our approach on a cluster of 192 cores (16 nodes) and datasets of 1 billion tuples with different skews. the results show that the method is scalable, and also runs faster with less network communication compared to state-of-art PRPD approach in [1] under high data skew.

关键词： distributed join parallel join data skew high performance X10

来源：评论

学校读者我要写书评

暂无评论

Network Traffic Load Balancing in Hierarchical Peer-To-Peer Systems 10

Network Traffic Load Balancing in Hierarchical Peer-To-Peer ...

引用

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

作者： Moro, Gianluca Pirini, Tommaso Sartori, Claudio Univ Bologna Dept Comp Sci & Engn I-40126 Bologna Italy

ISBN: (纸本)9781467394734

the management of huge amounts of data distributed across multiple sites has become a necessity more and more demanding. Peer-to-peer systems (P2P) can afford the requirements of managing, indexing, searching and analyzing data with scalability and self-organization. Until now, most efforts have focused primarily on improving the number of hops and structure maintenance messages. However, the non-uniform distribution of data and the hierarchical structures, together with heavy load, can cause unbalanced traffic load. In this paper we improve our previous work on the overlay structure G-Grid, merging it with a Small World network. the Small World networks make a compromise between order and randomness, they are derived from social networks and show an almost uniform traffic distribution. Experiments show how this new hybrid structure obtains the best performance in traffic distribution.

关键词： P2P Systems Multidimensional Indexing distributed Systems Hierarchical Data Structure Network Load Balancing

来源：评论

学校读者我要写书评

暂无评论

A minimal Linux environment for High Performance computing systems

A minimal Linux environment for High Performance computing s...

引用

10th World Multi-conference on Systemics, Cybernetics and Informatics, WMSCI 2006, Jointly with the 12th international conference on Information Systems Analysis and Synthesis, ISAS 2006

作者： Laros III, James H. Segura, Cynthia Dauchy, Nathan Sandia National Laboratories Albuquerque NM 87123 United States High Performance Technologies Inc. Reston VA 20190 United States

ISBN: (纸本)980656068X

this paper describes the use of standard Linux® [1] and Open Source software to produce an environment to support parallel scientific applications on High Performance Computers (HPC). the goals of this approach are to maximize the HPC resources delivered to the application, to improve system stability and predictability, and to reduce software management burdens. the simplicity of this approach provides an additional benefit. the paper presents the reader with background, motivations, and a discussion of advantages and drawbacks of the light-os.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

the non-eye typhoon center locating with parallel computing

The non-eye typhoon center locating with parallel computing

引用

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

作者： Liu, ZG Wu, B Xue, JT Liu, HZ Tianjin Univ Sch Engn Elect & Automat Tianjin 300072 Peoples R China

ISBN: (纸本)0780378407

A new mathematical morphology-based algorithm is proposed to achieve automatic center location of non-eye typhoon. the center of a non-eye typhoon is near the geometric center of the cloud system and has higher temperature. For each infrared satellite cloud image, the locating procedures are as follows: a) noises filtering, b) main cloud systems segmenting, c) center locating and d) multispectral image verification. the algorithms are based on operations of mathematical morphology, and designed in IBM SP2 massively parallel computer. the experiment results show that the algorithm locates the centers of most non-eye typhoons successfully and achieves faster, more precise and non-human interactive non-eye typhoon center positioning.

关键词： satellite cloud image non-eye typhoon locating parallel algorithm mathematical morphology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：