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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

991 篇 会议
20 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

764 篇 工学
- 736 篇 计算机科学与技术...
- 526 篇 软件工程
- 195 篇 信息与通信工程
- 78 篇 控制科学与工程
- 59 篇 电子科学与技术（可...
- 58 篇 电气工程
- 21 篇 动力工程及工程热...
- 19 篇 机械工程
- 16 篇 生物医学工程（可授...
- 15 篇 生物工程
- 13 篇 建筑学
- 12 篇 环境科学与工程（可...
- 11 篇 安全科学与工程
- 8 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 土木工程
256 篇 理学
- 209 篇 数学
- 34 篇 统计学（可授理学、...
- 31 篇 系统科学
- 21 篇 物理学
- 20 篇 生物学
- 12 篇 化学
221 篇 管理学
- 170 篇 管理科学与工程(可...
- 111 篇 工商管理
- 67 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 7 篇 社会学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 农学
3 篇 文学
2 篇 教育学

主题

95 篇 distributed comp...
71 篇 parallel process...
53 篇 grid computing
50 篇 peer to peer com...
48 篇 distributed comp...
33 篇 parallel process...
32 篇 servers
31 篇 fault tolerance
30 篇 computer archite...
29 篇 computational mo...
27 篇 distributed data...
24 篇 protocols
21 篇 concurrent compu...
21 篇 software enginee...
21 篇 cloud computing
19 篇 parallel program...
18 篇 graphics process...
18 篇 algorithm design...
18 篇 artificial intel...
17 篇 bandwidth

机构

11 篇 institute of com...
10 篇 institute of com...
5 篇 academic center ...
5 篇 department of in...
4 篇 institute of par...
4 篇 national laborat...
4 篇 graduate univers...
4 篇 national laborat...
3 篇 school of comput...
3 篇 chinese academy ...
3 篇 institute of inf...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 computer science...
2 篇 pervasive techno...
2 篇 inria
2 篇 disca univ. poli...
2 篇 state key labora...
2 篇 west bengal univ...
2 篇 dcse college of ...

作者

7 篇 valentin cristea
5 篇 kurt rothermel
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
4 篇 dongarra jack
4 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,001 篇 英文
19 篇 其他

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010"

共 1020 条记录，以下是491-500 订阅

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

详细简洁

排序：

Peer Interest-based Discovery for Decentralized Peer-to-Peer systems

Peer Interest-based Discovery for Decentralized Peer-to-Peer...

引用

international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Andreea Visan Mihai Istin Florin Pop Fatos Xhafa Valentin Cristea Faculty of Automatics and Computer Science University POLITEHNICA of Bucharest Romania Department of Languages and Informatics Systems Technical University of Catalonia Barcelona Spain

The success of content distribution oriented peer-to-peer systems heavily depends on the resource discovery mechanism. In case of large-scale distributed systems, this mechanism must be scalable and robust. The paper proposes a structured solution for resource discovery in decentralized peer-to-peer systems, which is guided by peer interest in collaborating with other peers. The problem of discovering peers of interest has many applications in file sharing, in data-aware scheduling, and in optimizing the files and documents downloads. Moreover, if trust is added as another parameter to define peers of interest, the interest-based discovery is useful in trusted P2P applications. We focused on developing the overlay network to ensure a very small number of messages required to retrieve, insert or delete a file even in the case of a very large network containing millions of nodes. In the experimental validation we used Over Sim, a simulation tool for P2P systems. The experimental results highlight the good performance obtained regarding message communication and system's scalability.

关键词： Peer to peer computing Network topology Topology Routing Scalability Computer architecture Testing

来源：评论

学校读者我要写书评

暂无评论

Grid and P2P Middleware for Scientific computing systems

Grid and P2P Middleware for Scientific Computing Systems

引用

international conference on Complex, Intelligent and Software Intensive systems, CISIS

作者： Fatos Xhafa Sabri Pllana Leonard Barolli Department of Computer Science and Information Systems Birkbeck University of London London UK Department of Scientific Computing Faculty of Computer Science University of Technology Vienna Vienna Austria Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan

ISBN: (纸本)9781424459179;9780769539676

Grid and P2P systems have achieved a notable success in the domain of scientific and engineering applications, which commonly demand considerable amounts of computational resources. However, Grid and P2P systems remain still difficult to be used by the domain scientists and engineers due to the inherent complexity of the corresponding middleware and the lack of adequate documentation. In this paper we survey recent developments of Grid and P2P middleware in the context of scientific computing systems. The differences on the approaches taken for Grid and P2P middleware as well as the common points of both paradigms are highlighted. In addition, we discuss the corresponding programming models, languages, and applications.

关键词： Middleware Scientific computing Grid computing Power engineering computing distributed computing Application software Computer science Documentation Computer applications parallel processing

来源：评论

学校读者我要写书评

暂无评论

Component Scheduling in the distributed Simulation Based on BOM

Component Scheduling in the Distributed Simulation Based on ...

引用

international conference on Computer Modeling and Simulation, ICCMS

作者： Chunguang Peng Qiang He Xiaocheng Liu Xinye Zhao Mechatronics and Automation school National University of Defense Technology Changsha Hunan China

According to the principle of Base Object Model (BOM), there is a new method for developing a federation, which is developed not on the base of federates, but on the base of simulation model components-BOMs. In the context of constructing large-scale distributed simulation systems, the problem about Components Scheduling is investigated. Through analyzing the Component Scheduling Model and types of components, the paper proposes the parallel Components Group Creating Algorithm and the Assignation Algorithm. The experiment suggests that all components can be deployed in the given distributed environment to construct a simulation system efficiently and reasonably in this way.

关键词： Bills of materials Processor scheduling Computational modeling Computer simulation Polynomials distributed computing Large-scale systems Context modeling Scheduling algorithm Standards organizations

来源：评论

学校读者我要写书评

暂无评论

Dynamic task scheduling using fuzzy logic in distributed memory systems

Dynamic task scheduling using fuzzy logic in distributed mem...

引用

The international conference on Informatics and systems (INFOS)

作者： Fatma A. Omara Rasha M. Zohier Computer Science Department Faculty of Computer & Information Cairo University Egypt Computer Science Department Institute of Statistical Studies and Research Cairo University Egypt

ISBN: (纸本)9781424458288;9789774033964

The scheduling and mapping of the precedence-constrained task graphs of parallel programs to processors is considered one of the most crucial NP-complete problems in parallel and distributed computing systems. In this paper, a dynamic task scheduling model based on fuzzy logic is proposed. The main objective of this technique is to improve the fuzzy decision which is used in task scheduling on a network of processing elements by introducing new input parameters to an existing fuzzy model and, in the same time, improving the load balance on the network in a dynamic environment. The proposed Fuzzy Model is capable of processing inputs from on the fly data that arises from the current state of the processors. According to the proposed model, tasks are generated randomly and are served based on the First-Come-First-Serve rule. When the task is ready to be assigned, its information is passed to the processors for bidding. Each processor has a local scheduler for managing its own activities, which supplies information on its current state and follows whatever decision is given where the fuzzy logic mechanism is used in making decision on the task assignment. A comparative study between the existed fuzzy model and our modified fuzzy model has been done. The comparative results show that our modified fuzzy model outperforms the existed one.

关键词： Dynamic scheduling Fuzzy logic Processor scheduling Computer science distributed computing Iterative methods Load management Concurrent computing NP-complete problem Fuzzy systems

来源：评论

学校读者我要写书评

暂无评论

Enzymatic numerical P systems - a new class of membrane computing systems

Enzymatic numerical P systems - a new class of membrane comp...

引用

international conference on Bio-Inspired computing: Theories and Applications, BICTA

作者： Ana Pavel Octavian Arsene Catalin Buiu Laboratory of Natural Computing and Robotics Politehnica University of Bucharest Bucharest Romania Faculty of Biology University of Bucharest Romania

A P system represents a distributed and parallel computing model in which basic data structures are multi-sets, strings or numerical variables. Numerical P systems have been introduced for possible applications in economics. A simulator for numerical P systems (SNUPS) has been designed, implemented and made available to the scientific community by the authors of this paper. SNUPS allows the development of a wide range of applications, from modeling and simulation of ordinary differential equations, to design and simulation of computational blocks for cognitive architectures and of membrane controllers for autonomous mobile robots. This paper introduces a new class of membrane computing systems, that of enzymatic numerical P systems, in which enzyme-like variables allow the existence of more than one production function in each membrane. The way this new type of deterministic numerical P systems works and the corresponding implementation in SNUPS are detailed, together with an illustrative example.

关键词： Robots Biology Biomembranes Computational modeling Compounds Production

来源：评论

学校读者我要写书评

暂无评论

Simulation System of Earthquake Precursory Observatory Equipment Based on STM

Simulation System of Earthquake Precursory Observatory Equip...

引用

IEEE international conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Weifeng Shan Husheng Liao Beijing University of Technology Beijing CN College of Computer Science Beijing University of Technology Beijing China

Transactional Memory(TM) is being studied widely by researchers, which is viewed as a new parallel programming model for synchronizing concurrent accesses to shared data object in multi-core or many-core systems. Research result shows that TM has a good performance over Lock using micro-benchmarks. The performance of real applications based on TM is still not clear. In this paper, we describe how to build Simulation System of Earthquake Precursory Observatory Equipment (SSEPOE) using Dynamic Software Transactional Memory (DSTM) and compare the scalability of it to that of lock-based one. Experimental result shows that the performance of SSEPOE based on STM have no advantages than lock-based one and it has a little convenience than lock in programming SSEPOE, this is because SSEPOE is rather simple and the experimentation computer only has two cores. If the computer has more cores and the real application is more complex, the version based on STM will outperform the lock-based one. Another hand, because DSTM2 did not support long transactions, SSEPOE Server did not realize all synchronization of threads using transactions. We only used transactions in the execution process of command instead of locks. We also gave insights into development techniques to encounter in developing SSEPOE Server and discussed the shortcomings of DSTM APIs.

关键词： Servers Instruments Production facilities Earthquakes Synchronization Software parallel programming

来源：评论

学校读者我要写书评

暂无评论

VirtCFT: A Transparent VM-Level Fault-Tolerant System for Virtual Clusters

VirtCFT: A Transparent VM-Level Fault-Tolerant System for Vi...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Minjia Zhang Hai Jin Xuanhua Shi Song Wu Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

A virtual cluster consists of a multitude of virtual machines and software components that are doomed to fail eventually. In many environments, such failures can result in unanticipated, potentially devastating failure behavior and in service unavailability. The ability of failover is essential to the virtual cluster's availability, reliability, and manageability. Most of the existing methods have several common disadvantages: requiring modifications to the target processes or their OSes, which is usually error prone and sometimes impractical; only targeting at taking checkpoints of processes, not whole entire OS images, which limits the areas to be applied. In this paper we present VirtCFT, an innovative and practical system of fault tolerance for virtual cluster. VirtCFT is a system-level, coordinated distributed checkpointing fault tolerant system. It coordinates the distributed VMs to periodically reach the globally consistent state and take the checkpoint of the whole virtual cluster including states of CPU, memory, disk of each VM as well as the network communications. When faults occur, VirtCFT will automatically recover the entire virtual cluster to the correct state within a few seconds and keep it running. Superior to all the existing fault tolerance mechanisms, VirtCFT provides a simpler and totally transparent fault tolerant platform that allows existing, unmodified software and operating system (version unawareness) to be protected from the failure of the physical machine on which it runs. We have implemented this system based on the Xen virtualization platform. Our experiments with real-world benchmarks demonstrate the effectiveness and correctness of VirtCFT.

关键词： Virtual machining Fault tolerant systems Fault tolerance Checkpointing Protocols Kernel

来源：评论

学校读者我要写书评

暂无评论

CP-Nets Based Methodology for Integrating Functional Verification and Performance Analysis of Network Protocol

CP-Nets Based Methodology for Integrating Functional Verific...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Jing Liu Xinming Ye Jun Li Chinese Academy of Sciences Beijing Beijing CN Inner Mongolia University for the Nationalities Hohhot China Institute of Computing Technology Chinese Academy and Sciences China

ISBN: (纸本)9781424474226;9780769540887

It is very risky to improve the performance of network protocols without the assurance of its functional correctness, especially for protocols that with complicated and concurrent behaviors. However, in most of current model based protocol engineering projects, two independent models are adopted for individual functional verification and performance analysis, which could not guarantee the performance model satisfying the functionality correctness, and usually cost more in protocol design and maintenance. In this paper, we propose a colored Petri nets (CP-nets) based method to integrate functional verification and performance analysis procedures, and focus on the BitTorrent protocol as a representative example to illustrate the practical effectiveness of our proposed methodology. That is, the functional CP-nets models of BitTorrent protocol are constructed and validated firstly, and then performance related temporal constrains are added into above models to form its performance CP-nets models for corresponding simulation based performance analysis. Because such closely related CP-nets models are utilized where every occurrence sequence in the performance model corresponds to an occurrence sequence in its functional model, it is guaranteed that both models satisfy the functionality requirements of protocol systems. Besides, model maintenance becomes more convenient.

关键词： Performance analysis Protocols Petri nets Computers Analytical models Stochastic processes Software engineering Artificial intelligence distributed computing Design engineering

来源：评论

学校读者我要写书评

暂无评论

A Two-Key Agreement Based Supervising Mechanism for Cluster-Based Peer-to-Peer Applications

A Two-Key Agreement Based Supervising Mechanism for Cluster-...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Chun-Chieh Huang Chi-Chun Lo Institute of Information Management National Chiao Tung University Hsinchu Taiwan

Peer-to-Peer (P2P) technologies are developing rapidly and have gained popularity. The application of P2P to areas such as file sharing, collaborative business environment, and distributed computing requires secure communication among the nodes. Cluster-based P2P structure provides an efficient way to do file sharing and distributed computing. A key agreement protocol is a set of communication rules whereby two users establish a shared common key. The shared key is used by users in future secure communications. Supervising services for governing communications between two nodes is an important topic, especially in the area of government affairs. The proposed paper provides a framework for supporting a supervising mechanism in cluster-based P2P networks based on the concept of two-key agreement protocol. This mechanism uses the idea of hash-based two-key agreement protocol to help the nodes in higher level supervise the nodes in lower level for cluster-based P2P communication environment. In the proposed paper, a global cluster head supervises the whole network, cluster heads in each cluster supervise their own clusters' communications. Security analyses show that the proposed mechanism is secure enough for P2P. Any two nodes within the same cluster generate their common session key by themselves. In the same cluster, no nodes gain this session key except the cluster head. Moreover, there are only two kinds of operations, hash operation and XOR operation, in the proposed mechanism. Hence, the proposed mechanism provides an efficient way to supervise the P2P network.

关键词： Peer to peer computing Nickel Protocols Public key

来源：评论

学校读者我要写书评

暂无评论

Solving the Multi-Operator Placement Problem in Large-Scale Operator Networks

Solving the Multi-Operator Placement Problem in Large-Scale ...

引用

international conference on Computer Communications and Networks (ICCCN)

作者： Stamatia Rizou Frank Dürr Kurt Rothermel Universität Stuttgart Institute of Parallel and Distributed Systems Stuttgart Germany

Processing streams of data in an overlay network of operators distributed over a wide-area network is a common idea shared by different applications such as distributed event correlation systems and large-scale sensor networks. In order to utilize network resources efficiently and allow for the parallel deployment of a large number of large-scale operator networks, suitable placement algorithms are vital that place operators on physical nodes. In this paper, we present a distributed placement algorithm that minimizes the bandwidth-delay product of data streams between operators of the network in order to reduce the induced network load. Since the fundamental optimization problem is NP-hard, we propose a heuristic solution. First, we calculate an optimal solution in an intermediate continuous search space, called latency space. Subsequently the continuous solution is mapped to the physical network. Our evaluations show that this algorithm reduces the resulting network load significantly compared to state of the art algorithms and achieves results close to the optimum.

关键词： Peer to peer computing Approximation algorithms Delay Optimization distributed databases Approximation methods

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 46 47 48 49 50 51 52 53 54 55 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：