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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,748 篇 会议
29 册 图书
27 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,390 篇 工学
- 1,274 篇 计算机科学与技术...
- 598 篇 软件工程
- 238 篇 信息与通信工程
- 218 篇 电气工程
- 87 篇 控制科学与工程
- 53 篇 电子科学与技术（可...
- 44 篇 机械工程
- 41 篇 生物工程
- 33 篇 动力工程及工程热...
- 26 篇 石油与天然气工程
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 17 篇 生物医学工程（可授...
- 17 篇 网络空间安全
- 15 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 力学（可授工学、理...
- 14 篇 安全科学与工程
307 篇 理学
- 202 篇 数学
- 48 篇 生物学
- 41 篇 物理学
- 39 篇 系统科学
- 30 篇 统计学（可授理学、...
- 25 篇 化学
198 篇 管理学
- 130 篇 管理科学与工程(可...
- 77 篇 图书情报与档案管...
- 57 篇 工商管理
72 篇 医学
- 64 篇 临床医学
16 篇 法学
15 篇 经济学
- 15 篇 应用经济学
15 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

105 篇 distributed comp...
102 篇 distributed comp...
74 篇 parallel process...
60 篇 cloud computing
44 篇 computational mo...
44 篇 parallel computi...
38 篇 grid computing
38 篇 distributed data...
37 篇 parallel program...
36 篇 parallel algorit...
33 篇 computer archite...
31 篇 big data
31 篇 parallel process...
28 篇 application soft...
26 篇 fault tolerance
26 篇 machine learning
25 篇 resource managem...
24 篇 scalability
24 篇 middleware
23 篇 concurrent compu...

机构

9 篇 laboratory of in...
8 篇 zhejiang univ co...
7 篇 plekhanov russia...
7 篇 chinese acad sci...
7 篇 science and tech...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 department of in...
5 篇 shanghai jiao to...
4 篇 college of compu...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 school of inform...
4 篇 univ otago dept ...
3 篇 huazhong univ sc...
3 篇 fuyang rongda co...
3 篇 key laboratory o...
3 篇 department of co...
3 篇 university of el...
3 篇 school of comput...

作者

13 篇 zomaya albert y.
11 篇 shen hong
8 篇 todorov venelin
8 篇 rothermel kurt
7 篇 li kuan-ching
6 篇 leymann frank
6 篇 li y
6 篇 liu jie
6 篇 kopp oliver
5 篇 dimov ivan
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 gankevich ivan
5 篇 albert y. zomaya
5 篇 breitenbuecher u...
5 篇 yang chao-tung
4 篇 li kenli
4 篇 blochinger wolfg...
4 篇 liu yang
4 篇 leung k.

语言

1,765 篇 英文
21 篇 其他
13 篇 中文
10 篇 俄文

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

共 1804 条记录，以下是891-900 订阅

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

详细简洁

排序：

A Test Generation Method Based on Model Reduction for parallel Software

A Test Generation Method Based on Model Reduction for Parall...

引用

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

作者： Sun, Tao Ye, Xinming Liu, Jing Inner Mongolia Univ Coll Comp Sci Hohhot Peoples R China

ISBN: (纸本)9780769548791

Modeling and testing for parallel software systems is difficult, because the number of states and execution fragments expand significantly caused by parallel behaviors, so that many traditional testing methods cannot work effectively for this kind of software. In this paper, a test sequence generation method based on model reduction for parallel software systems is shown. Firstly, a formal model for software system specification is constructed based on Coloured Petri Net (CPN), called system model;and a model reduction method based on trace-equivalent principle is shown and applied on system model, which could generate an external behavior equivalent model with smaller scale. Secondly, a linear behavior sequence of the system is specified using CPN, called LBS model, which represents testing purpose in a test case, and some operations between state space diagrams of system model and LBS model are defined, so that a sub-graph of system model state space diagram is generated, which could cover all executions of system model that involves behaviors of LBS. Finally, a performance analysis shows the effectiveness of the method.

关键词： test generation reduction Coloured Petri Net

来源：评论

学校读者我要写书评

暂无评论

LPFSC: A Light Weight parallel Framework for Super computing

LPFSC: A Light Weight Parallel Framework for Super Computing

引用

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

作者： Ou, Yulong Li, Bo Yuan, Zheng Hao, Qiang Luan, Zhongzhi Qian, Depei Beihang Univ Sino German Joint Software Inst Dept Comp Sci & Engn Beijing 100191 Peoples R China

ISBN: (纸本)9780769548791

Supercomputing on the heterogeneous architectures that integrate multi-core or many-cores processors has been developed at a dramatically speed. It is widely used in theoretical physics, theoretical chemistry, climate modeling, biology simulation and medicine research for high-performance and energy-efficient computing. Yet it is still a big challenge to users when trying to run their scientific applications efficiently on large-scale supercomputers constructed by using heterogeneous multiprocessors. On the other hand, overhead cost issues of a large supercomputer for its resource managements, job scheduling, and system reliability become more and more important. In this paper, LPFSC, a light weight parallel framework for supercomputing, is presented, which helps programmers in planning their tasks on a supercomputer. In a huge supercomputer system, there might be a hundred of thousands of nodes, over a million processor cores and many other kinds of processors, general main-slave computing mode can hardly handle the huge amount of heterogeneous processors. LPFSC consists of modules for multiple master-slave support, load balance among huge amount computing tasks, and reliability support. Additional features will be added in the near future and it is supposed to provide good support for large heterogeneous computer systems. Finally, large amount tasks of 2D-FFT in varying size are tested under the framework for evaluation, which can scale to more than 300 processors.

关键词： LPSFC heterogeneous architecture supercomputing

来源：评论

学校读者我要写书评

暂无评论

Lung Cancer Detection in Chest X-Ray Images with parallel Genetic Algorithm

Lung Cancer Detection in Chest X-Ray Images with Parallel Ge...

引用

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

作者： Peng Gang Liu Li Zeng Kehan Li Tian Nakayama, Shigeru Huizhou Univ Dept Comp Sci & Technol Huizhou City 516007 Guangdong Peoples R China Kagoshima Univ Dept Informat Sci & Biomed Engn Kagoshima Japan

this paper discusses lung cancer detection in chest X-ray images with a parallel genetic algorithm (GA). the template matching method and local search techniques are combined to the algorithm and JavaSpaces is used to... 详细信息

ISBN: (纸本)9780769548791

关键词： lung cancer chest X-ray image genetic algorithm parallel system

来源：评论

学校读者我要写书评

暂无评论

Garbage Collection for Service Oriented distributed Reliable Environment D-ReServE

Garbage Collection for Service Oriented Distributed Reliable...

引用

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

作者： Brzezinski, Jerzy Danilecki, Arkadiusz Holenko, Mateusz Kobusinska, Anna Zierhoffer, Piotr Poznan Univ Tech Inst Comp Sci Poznan Poland

ISBN: (纸本)9780769548791

D-ReServE increases reliability of SOA-based systems in case of failure occurrence. the fault-tolerant information in D-ReServE is stored in the Stable Storage, which available space depletes with time. thus, in this paper we propose a garbage collection protocol for D-ReServE that allows the periodic purging of the Stable Storage, and discuss the challenges of garbage collection due to the nature of SOA systems.

关键词： SOA fault tolerance reliability rollback-recovery garbage-collection

来源：评论

学校读者我要写书评

暂无评论

Revisiting Snapshot Algorithms by Refinement-based Techniques

Revisiting Snapshot Algorithms by Refinement-based Technique...

引用

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

作者： Andriamiarina, Manamiary Bruno Mery, Dominique Singh, Neeraj Kumar Univ Lorraine LORIA Vandoeuvre Les Nancy France Univ York York N Yorkshire England

ISBN: (纸本)9780769548791

the snapshot problem addresses a collection of important algorithmic issues related to the distributed computations, which are used for debugging or recovering the distributed programs. Among the existing solutions, Chandy and Lamport propose a simple distributed algorithm. In this paper, we explore the correct-by-construction process to formalize the snapshot algorithms in distributed system. the formalization process is based on a modeling language Event B, which supports a refinement-based incremental development using RODIN platform. these refinement-based techniques help to derive a correct distributed algorithm. Moreover, we demonstrate how this class of other distributed algorithms can be revisited. A consequence is to provide a fully mechanized proof of the distributed algorithms.

关键词： distributed algorithms correctness by construction snapshot verification

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for Partitioning a Tree into Sibling Subtree Clusters Weighted in a Given Range

An Algorithm for Partitioning a Tree into Sibling Subtree Cl...

引用

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

作者： Chen, Hao Luo, GuangCun Qin, Ke Peng, NingDuo Hao, Wen Univ Elect Sci & Technol China Chengdu Peoples R China Air force Command Automat Stn Chengdu Peoples R China

ISBN: (纸本)9780769548791

Assume that each vertex of an arbitrary n-vertex tree T is assigned a nonnegative integer weight. this paper considers partitioning the vertices of tree T into p disjoint clusters such that the total weight of each cluster is at least l and at most u, where l and u are given integers with lthms for trees only allow that a cluster corresponds to a subtree, our algorithm also considers clusters containing several subtrees as long as these subtrees have the same parent node or their root vertices are adjacent siblings. We call this [l, u] sibling partitioning. We deal with two problems of [l, u] sibling partitioning for a given tree: the minimal partition problem is to find an [l, u] sibling partitioning with the minimum number of clusters;the p-partition problem is to find an [l, u] sibling partitioning with a given number p of clusters. In this paper, we present the first polynomial-time algorithm to solve the two problems.

关键词： Tree partition Sibling Subtrees Dynamic Programming distributed computing

来源：评论

学校读者我要写书评

暂无评论

Models to Solve the Duplication Problem in Treaty Systems

Models to Solve the Duplication Problem in Treaty Systems

引用

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

作者： Zhao, Yining Wood, Alan Univ York Dept Comp Sci York YO10 5DD N Yorkshire England

ISBN: (纸本)9780769548791

Capabilities are a more scalable and adaptive access control approach compared with the conventional approaches such as ACLs, due to their being held and managed by users or agents in systems, but not the middleware. this feature makes capabilities more suitable in distributed environments that have dynamic populations. Treaties have been proposed to enhance the capability approach by introducing sequences of actions, such that treaties can capture characteristics of behaviours, and provide finer control over accesses. However there is a new problem brought by the behaviour modeling of treaties which is called duplication problem, which concerns preventing users from gaining unauthorised behaviour by duplicating treaties. In this paper we discuss this problem and propose three models of treaty systems that aim to solve the duplication problem.

关键词： Behaviour Control Access Control Duplication Problem Treaties distributed computing

来源：评论

学校读者我要写书评

暂无评论

Mechanised verification of distributed state-space algorithms for security protocols

Mechanised verification of distributed state-space algorithm...

引用

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

作者： Gava, Frederic Hidalgo, Arthur Fortin, Jean Univ Paris East Paris France

ISBN: (纸本)9780769548791

Explicit model-checking (MC) is a classical solution to find flaws in a security protocol. But it is well-known that for non trivial protocols, MC may enumerate state-spaces of astronomical sizes-the famous state-space explosion problem. distributed model checking is a solution but complex and subject to bugs: a MC can validate a model but miss an invalid state. In this paper, we focus on using a verification condition generator that takes annotated distributed algorithms and ensures their termination and correctness. We study five algorithms (one sequential and four distributed where three of them are dedicated and optimised for security protocol) of state-space construction as a first step towards mechanised verification of distributed model-checkers.

关键词： BSP Mechanized proof Security protocol

来源：评论

学校读者我要写书评

暂无评论

distributed XML processing over various topologies: Pipeline and parallel processing characterization

Distributed XML processing over various topologies: Pipeline...

引用

8th international conference on Web Information Systems and technologies, WEBIST 2012

作者： Uratani, Yoshiyuki Koide, Hiroshi Cavendish, Dirceu Oie, Yuji Global Scientific Information and Computing Center Tokyo Institute of Technology O-okayama 2-12-1 Meguroku Tokyo 152-8550 Japan Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Kawazu 680-4 Iizuka Fukuoka 820-8502 Japan Network Design Research Center Kyushu Institute of Technology Kawazu 680-4 Iizuka Fukuoka 820-8502 Japan

ISBN: (纸本)9789898565082

this paper characterizes distributed XML processing on networking nodes. XML documents are sent from a client node to a server node through relay nodes, which process the documents before arriving at the server. According as the node topology, the XML documents are processed in a pipelining manner or a parallel fashion. We evaluate distributed XML processing with synthetic and realistic XML documents on real and virtual environments. Characterization of well-formedness and grammar validation processing via pipelining and parallel models reveals inherent advantages of the parallel processing model.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

REST: A Redundancy-based Energy-efficient Cloud Storage System

REST: A Redundancy-based Energy-efficient Cloud Storage Syst...

引用

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

作者： Li, Hongyan Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)9780769548791

Energy consumption has increasingly become a serious problem in contemporary data centers. the electricity bill contributes a significant fraction of the Total Cost of Ownership (TCO), and it has been predicted to increase at an even faster pace in the following years. In an attempt to reduce the energy consumption in cloud infrastructures, we propose REST, an energy-efficient cloud storage built upon an open source cluster-based object store similar to GFS. It achieves high energy-efficiency by cleverly exploiting the redundancy and its asymmetric accesses existing in the system without compromising inherent well-established mechanisms, while maintaining reasonable performance level. By slightly altering the data-layout policy, REST can safely keep a large amount of redundant storage nodes in standby mode or even powered off most of the time. Deploying a sophisticated real-time workload monitor, it provides flexibility to power up standby or powered down nodes to accommodate the variations in workloads. In addition, trade-offs between energy and performance can be conveniently made by simply adjusting a trade-off metric in REST. the FileBench experimental results have demonstrated that power savings can be as high as 29%, still providing comparable or even better performance.

关键词： cloud storage data centre distributed storage energy efficient power saving

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共181页 << < 86 87 88 89 90 91 92 93 94 95 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：