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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

482 篇 会议
4 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

298 篇 工学
- 289 篇 计算机科学与技术...
- 165 篇 软件工程
- 94 篇 信息与通信工程
- 38 篇 电气工程
- 26 篇 电子科学与技术（可...
- 20 篇 控制科学与工程
- 12 篇 机械工程
- 9 篇 建筑学
- 7 篇 动力工程及工程热...
- 5 篇 土木工程
- 4 篇 力学（可授工学、理...
- 4 篇 测绘科学与技术
- 3 篇 光学工程
- 3 篇 化学工程与技术
- 3 篇 航空宇航科学与技...
- 3 篇 农业工程
- 3 篇 生物工程
112 篇 理学
- 96 篇 数学
- 14 篇 统计学（可授理学、...
- 12 篇 系统科学
- 9 篇 物理学
- 7 篇 生物学
- 5 篇 化学
- 3 篇 地球物理学
62 篇 管理学
- 43 篇 管理科学与工程(可...
- 38 篇 工商管理
- 21 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 3 篇 法学
5 篇 文学
- 5 篇 新闻传播学
3 篇 农学
2 篇 教育学
1 篇 医学
1 篇 军事学

主题

111 篇 distributed comp...
69 篇 computer network...
54 篇 concurrent compu...
43 篇 grid computing
38 篇 distributed comp...
37 篇 peer to peer com...
36 篇 intelligent netw...
36 篇 artificial intel...
35 篇 software enginee...
30 篇 parallel process...
30 篇 computer archite...
27 篇 application soft...
26 篇 computer science
25 篇 parallel process...
24 篇 delay
20 篇 scalability
18 篇 routing
18 篇 bandwidth
17 篇 costs
16 篇 network servers

机构

5 篇 institute of com...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 institute of com...
2 篇 department of co...
2 篇 department of in...
2 篇 school of comput...
2 篇 the leslie and s...
2 篇 school of comput...
2 篇 univ valencia ir...
2 篇 national laborat...
2 篇 graduate univers...
2 篇 college of infor...
2 篇 department of co...
2 篇 national key lab...
2 篇 seikei universit...
2 篇 department of co...
2 篇 chinese academy ...
2 篇 univ catania dep...
2 篇 china mobile com...

作者

5 篇 mikkilineni rao
4 篇 morana giovanni
3 篇 messina fabrizio
3 篇 huaikou miao
3 篇 engelmann christ...
3 篇 sungwon kang
2 篇 choi k.
2 篇 yongquan fu
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...
2 篇 dongsheng li
2 篇 guangyu shi
2 篇 shietung peng
2 篇 satoshi fujita
2 篇 hao gong
2 篇 ming-chien yang
2 篇 pawaskar sachin
2 篇 alias norma
2 篇 yijie wang

语言

488 篇 英文

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2009"

共 488 条记录，以下是121-130 订阅

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

详细简洁

排序：

Resource aggregation networks

Resource aggregation networks

引用

iasted international conference on parallel and distributed computing and networks, as part of the 23rd iasted international Multi-conference on Applied Informatics

作者： Nagargadde, Aparna Gopalan, Srividya Sridhar, V. Applied Research Group Satyam Computer Services Limited #14 Langford Avenue Lalbhag Road Bangalore - 560025 India

Resource management is central to grid computing and plays a vital role in ensuring that the jobs execute both successfully and economically on the grid. In this paper, we present an analysis of the factors affecting resource allocation and illustrate the same in the case of disk space aggregation. We explore the feasibility of a comprehensive resource aggregation network that can bind fragmented resources together to provide a unified resource for grid jobs. We provide an implementation framework to realise resource aggregation, by adopting and enhancing the Alchemi [1] framework.

关键词： distributed computer 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

来源：评论

学校读者我要写书评

暂无评论

A set-based approach to packet classification

A set-based approach to packet classification

引用

Proceedings of the Fifteenth iasted international conference on parallel and distributed computing and Systems

作者： Ranganath, Venkatesh Prasad Andresen, Daniel Department of Computing Science Kansas State University

ISBN: (纸本)088986392X

Firewalls, and packet classification in general, are becoming more and more significant as data rates soar and hackers become increasingly sophisticated - and more forceful. In this paper, we present a new packet-classification approach that uses set theory to classify packets. This approach has significant theoretical advantages over current approaches. We demonstrate its practicality by implementing a firewall subsystem in Linux which approaches the performance of today's naive packet-filtering implementations.

关键词： Packet networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Comparison of centralized and decentralized service discovery in a grid environment

Comparison of centralized and decentralized service discover...

引用

Proceedings of the Fifteenth iasted international conference on parallel and distributed computing and Systems

作者： Ludwig, Simone A. Brunel University Uxbridge Middlesex UB8 3PH United Kingdom

ISBN: (纸本)088986392X

In this paper three different Service Discovery approaches based on centralized and distributed registries within so called Virtual Organizations are assessed. The first approach is a centralized model, the second a completely decentralized and the third is a hybrid of both models. The Grid environment is typically comprised of heterogeneous resources over wide-area networks, It addresses all distributed computing issues, especially the problem of service discovery. The benefits and drawbacks of all three models are discussed and a comparison regarding issues such as administration, management, scalability and security is followed. Furthermore, measurements are executed in order to investigate the performance of all three models, and a reliability analysis is conducted.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Future networking for scalable I/O

Future networking for scalable I/O

引用

iasted international conference on parallel and distributed computing and networks

作者： Chen, H Decker, J Bierbaum, N Sandia Natl Labs POB 969 Livermore CA 94550 USA

ISBN: (纸本)088986568X

Large clustered computers provide low-cost compute cycles, and therefore have promoted the development of sophisticated parallel-programming algorithms based on the Message Passing Interface. Storage platforms, however, fall to keep pace with similar advances. This paper compares standard 4X InfiniBand (IB) to 10-Gigabit Ethernet (GbE) for Use as a common storage infrastructure in addition to message passing. Considering IB's native ability to accelerate protocol processing in hardware, the Ethernet hardware in this study provided similar acceleration using TCP Offload Engines. We evaluated their I/O perfon-nance using the IOZONE benchmark on the iSCSI-based TerraGRID parallel filesystem. Our evaluations show that 10GbE, with or without protocol-offload, offered better throughput and latency than IB to socket-based applications. Although protocol-offload in both 10GbE and IB demonstrated significant improvement in I/O performance, large amount of CPU are still being consumed to handle the associated data-copies and interrupts. The emerging RDMA technologies hold promises to remove the remaining CPU overhead. We plan to continue our study to research the applications of RDMA in parallel I/O.

关键词： InfiniBand 10GbE TOE parallel I/O cluster HPC

来源：评论

学校读者我要写书评

暂无评论

Realizing distributed system models with programmable networks

Realizing distributed system models with programmable networ...

引用

Proceedings of the Fifteenth iasted international conference on parallel and distributed computing and Systems

作者： Houatra, Drissa France Telecom R and D 38-40 rue du General Leclerc 92794 Issy Moulineaux Cedex 9 France

ISBN: (纸本)088986392X

An important problem in the construction of distributed systems is the openness of these systems to dynamic computations, i.e. the ability of these systems to support new infrastructure services and applications during their operations. Algorithms and services have been designed using several system models: synchronous, asynchronous bonded-delay, asynchronous, etc. In practice, most of the existing systems implement a limited number of system models, and can be hardly adapted to new applications. For example, a metropolitan area network used to develop a reliable data communication system can hardly support real-time audio-communications. In this paper, we describe new principles and an architectural basis for the development of distributed system infrastructures supporting multiple system models, that can be dynamically modified to be adapted to new application requirements, using programmable networks. The paper provides a framework for the application of network programmability and active networks to distributed system design, and their use to dynamically enforce multiple and concurrent system models. Such systems can be used to support multiple application profiles with the same computing and communication resources.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：