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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

On the short-term feasibility of using RFID in realizing ambient-intelligence in Indian homes

On the short-term feasibility of using RFID in realizing amb...

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Mahesh, Babu M. Meenakshi, Sundaram A. S. Manikandan, C. Rhymend, Uthariaraj, V Anna Univ Madras Inst Technol Dept Informat Technol Madras 600044 Tamil Nadu India

ISBN: (纸本)9780889866386

We present our research findings on the practicality of using RFID for building context-aware homes in India. Our research is the result of an endeavor to bring this global trend of smart homes to India. Rather than studying the effects of such an influence in its original form-building smart homes equipped with such high-end sensors as real-time, audio-video sensing, and sophisticated, environmental sensors as are popular in a typical smart home-we studied the viability of realizing ambient-intelligence using simple, low-cost, and robust RFID sensors, which we believe would be suitable to Indian dwellings in the near future. We describe the learning and prediction algorithm used in our study;we modeled time as fuzzy-sets and used Markov model for predicting the future locations of inhabitants wearing RFID bracelets. Our system provides context-aware reactive and proactive services. We modeled the uncertainties-involved in inferring users' activities from their location information-using Bayesian Belief Networks or BBNs. This improved the accuracy of prediction considerably. Our experience showed that it is possible to develop cost-effective, easily deployable, context-aware homes using only RFID in India in the short-term before high-end sensing technologies mature and become commercially affordable in the longer run.

关键词： ambient-intelligence probabilistic fuzzy-logic RFID sensing home networks ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Resource brokering in grid environments using evolutionary algorithms

Resource brokering in grid environments using evolutionary a...

引用

iasted international conference on parallel and distributed computing and Networks, as part of the 24th iasted international Multi-conference on APPLIED INFORMATICS

作者： Süss, Wolfgang Jakob, Wilfried Quinte, Alexander Stucky, Karl-Uwe Forschungszentrum Karlsruhe GmbH Institute for Applied Computer Science P.O. Box 3640 D-76021 Karlsruhe Germany

ISBN: (纸本)0889865701

The subject of this paper is the resource management for a grid system that is primarily intended to support computationally expensive tasks like simulations and optimisations on a grid. Applications are represented as workflows that can be decomposed into single grid jobs. The main task of the resource management is resource brokering to optimise a global schedule for all requesting grid jobs and all requested resources. The present contribution shall illustrate the necessity of planning and optimising resource allocation in a grid. Requirements to be met by a resource management system will be defined. These requirements are comparable with the requirements on planning systems in other fields, e.g. production planning systems. Here, various methods have already been developed for optimised planning. Suitable methods are Evolutionary Algorithms (EA). Consequently, a global optimising resource broker (GORBA) is proposed that deploys EA. The paper focuses on the concept of GORBA and the implementation of GORBA prototype.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Studies on braess-like paradoxes for non-cooperative dynamic load balancing in distributed computer systems

Studies on braess-like paradoxes for non-cooperative dynamic...

引用

iasted international conference on parallel and distributed computing and Networks, as part of the 24th iasted international Multi-conference on APPLIED INFORMATICS

作者： El-Zoghdy, Said Fathy Department of Mathematics and Computer Science Faculty of Science Menoufia University Shebin El-koom Egypt

ISBN: (纸本)0889865701

We consider a distributed computer system in Wardrop equilibrium, i.e., situations where no user can reduce its own response time by unilaterally choosing another path, if all the other users retain their present paths. The Braess paradox is a famous example of paradoxical cases where adding capacity to a network degrades the performance of all users. This study examines numerically some examples around the Braess-like paradox in a distributed computer system. We found that Braess's paradox can occur, namely in equilibrium the mean job response time in the network after adding a communication line for the sharing of jobs between nodes, for some system parameter setting, can be greater than the mean job response time in the network before adding the communication line. Indeed, two different types of paradox called weak and strong paradox have been characterized. In the range of parameter values examined, the worst case ratio of performance degradation obtained in the examined network model is about 75% and 65% for the cases of weak and strong paradox respectively.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Reference specification issues in on-line verification by passive testing

Reference specification issues in on-line verification by pa...

引用

iasted international conference on parallel and distributed computing and Networks, as part of the 24th iasted international Multi-conference on APPLIED INFORMATICS

作者： Brzezinski, Krzysztof M. Malinski, Norbert Institute of Telecommunications Warsaw University of Technology Nowowiejska 15/19 00-665 Warsaw Poland

ISBN: (纸本)0889865701

The generic functionality of passive testing is detecting failures (fault manifestations) in a distributed system. We deal with one of the key functions of a passive tester - Trace Analysis (TA). The standard TA algorithms proceed by traversing a Reference Specification (RS), which is usually given in the form of a FSM automaton. The run-time performance of such algorithms is known to be poor for a large, nondeterministic RS (i.e. for real protocols). To improve this aspect of passive testing, instead of considering new TA algorithms, we try to increase the performance of existing algorithms, by changing the form of a RS to an Event Graph (EG). We define an EG and submit a detailed algorithm for its derivation. We then outline the EG-based algorithm for RS traversal. We report on the results of simulation experiments that clearly show considerable improvements in run-time performance of EG-based passive testing over previous approaches, while the functionality of failure detection is strictly retained.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Achieving realtime capabilities in Ethernet networks by edge-coloring of communication conflict-multigraphs

Achieving realtime capabilities in Ethernet networks by edge...

引用

iasted international conference on parallel and distributed computing and Networks

作者： Dopatka, F Wismüller, R Univ Siegen Inst Operating Syst & Distributed Syst Dept 12 Holderlinstr 3 Siegen Germany

ISBN: (纸本)088986568X

This paper presents a top-down Quality-of-Service (QoS) approach to design realtime Ethernet networks for automation systems based upon tree topologies. Therefore, the parallelism of switched unicast communication is utilized by generating an off-line schedule, which considers each port of a switch as an exclusive networking resource. We point out that the schedule can be generated independently for each switch. Starting from a given network infrastructure and QoS-requests, we present a method consisting of attribution to identify routes, specification of conflicts inside the switches, and building of a conflict-multigraph for each switch. The schedule is realized using greedy edge-coloring of the graph together with optional edge pre-sorting and re-coloring after execution of the greedy-algorithm. The method is shown for a class of special cases with unitary packet-sizes and transmission of every request in each cycle-period. Finally, some first results of this method are presented.

关键词： industrial automation graph coloring greedy and QoS

来源：评论

学校读者我要写书评

暂无评论

Welcome Message from the conference Chair - pdcs 2006

Proceedings of the IASTED International Conference on Parall...

引用

Proceedings of the iasted international conference on parallel and distributed computing and systems 2006年

作者： Zheng, S.Q.

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deployment of parallel direct sparse linear solvers within a parallel finite element code

Deployment of parallel direct sparse linear solvers within a...

引用

iasted international conference on parallel and distributed computing and Networks, as part of the 24th iasted international Multi-conference on APPLIED INFORMATICS

作者： Klimowicz, A.N.F. Mihajlović, M.D. Heil, M. School of Computer Science University of Manchester Oxford Road Manchester United Kingdom School of Mathematics University of Manchester Lamb Building Manchester United Kingdom

ISBN: (纸本)0889865701

In this paper we present and evaluate the performance of two different strategies for the deployment of parallel multifrontal and multiple frontal sparse linear solvers in the context of a parallel finite element code. Direct sparse linear solvers are based on sophisticated reorganisation of the standard Gaussian elimination algorithm with the aim of exploring matrix sparsity and reducing the amount of fill-in. Such codes can be successfully applied to very large linear systems, and are especially effective when a sparse linear system needs to be solved for multiple right-hand sides. Unfortunately, many important applications, such as finite element solutions of non-linear, transient problems, require repeated factorisation of the coefficient matrix. In such cases the only way of achieving good performance is parallelisation of both the computation of the finite element matrices and the linear system solution phase. We have developed two different designs for deployment of parallel multifrontal and multiple frontal sparse linear solvers in this context, each deploying three different strategies for the assembly of the global data. These designs are suitable for parallel and heterogeneous architectures. Experiments confirm high efficiency, low communication cost, and reduced initial memory requirements of our deployment designs, compared to a standard deployment strategy.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

A self-stabilizing distributed algorithm for 5-spanner

A self-stabilizing distributed algorithm for 5-spanner

引用

iasted international conference on Networks and Communication systems 2006

作者： Kakugawa, Hirotsugu Masuzawa, Toshimitsu Osaka University 1-3 Machikaneyama Toyonaka Osaka Japan

ISBN: (纸本)0889865906

Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. A self-stabilizing system tolerates any kind and any finite number of transient faults, such as message loss, memory corruption, and topology change. Because message loss and topology change occur so frequently in mobile ad hoc networks, distributed algorithms on them should tolerate such events. In this paper, we propose a self-stabilizing distributed algorithm for computing a 5-spanner, which can be used, for example, as a basis for computing virtual backbone or routing in mobile ad hoc networks.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Effects of processing delay on function-parallel firewalls

Effects of processing delay on function-parallel firewalls

引用

iasted international conference on parallel and distributed computing and Networks, as part of the 24th iasted international Multi-conference on APPLIED INFORMATICS

作者： Farley, Ryan J. Fulp, Errin W. Department of Computer Science Wake Forest University Winston-Salem NC 27109 United States

ISBN: (纸本)0889865701

Comprehensive security policies are an integral part of creating a secure network and commonly firewalls are used to accomplish this. Firewalls inspect and filter traffic arriving or departing a network by comparing packets to a set of rules and performing the matching rule action, which is accept or deny. Unfortunately, traffic inspection of this type can impose significant delays on traffic due to the complexity and size of policies. Therefore, improving firewall performance is important, given the next generation of high-speed networks. This paper investigates the performance of a function parallel firewall architecture that distributes the original policy across an array of firewalls. A packet is processed by all the firewalls simultaneously and a gate then makes a final decision (accept or deny) based on the results of the individual firewalls. Since the individual firewalls have fewer rules to process (only a portion of the original policy), the function parallel system has lower delays (e.g. 74% lower for a four firewall array) and a higher throughput than other data parallel (load-balancing) firewalls. However, the performance increase is dependent on the speed of the gate. The potential speed increase and the impact of the gate will be demonstrated empirically.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Order and balance in continuously-fault-tolerant distributions of objects

Order and balance in continuously-fault-tolerant distributio...

引用

iasted international conference on parallel and distributed computing and Networks

作者： Coucopoulos, G Goel, N Nayak, A Santoro, N Carleton Univ Sch Comp Sci Ottawa ON K1N 5B6 Canada Cistel Technol Inc Ottawa ON K2E 7V7 Canada Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada Carleton Univ Sch Comp Sci Ottawa ON K1N 5B6 Canada

ISBN: (纸本)088986568X

A distributed object systems is said to be K-tolerant if every object is available after the simultaneous failure of up to K nodes. The problem is that a K-tolerant system, after failures, is no longer K-tolerant;that is, subsequent failures may compromise the availability of the objects. A continuously K-tolerant system is one which starting from a K-tolerant configuration, after the failure of up to K nodes, reconfigures itself so to remain K-tolerant. The existing protocols for maintaining continuous K-tolerance do so without regard to the resulting structure of the available data. For example if the distributed set of objects was sorted, this ordering would be most likely lost after restructuring. Analogously, a balanced distribution of the objects among the nodes might also be not achieved in the new distribution after reorganization. In this paper, we present a mechanism for maintaining continuous K-tolerance while keeping the load balanced and the objects sorted. The proposed solution uses minimum amount of replication and has a cost comparable to the one of the known unstructured solutions.

关键词： distributed file fault tolerance continuous K-fault tolerance protocols

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 76 77 78 79 80 81 82 83 84 85 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：