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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Towards an automatic distribution system - Issues and challenges

Towards an automatic distribution system - Issues and challe...

引用

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

作者： Oudshoorn, Michael J. Fuad, Mohammad M. Deb, Debzani Department of Computer Science Montana State University Bozeman MT 59717 United States

There is great potential if one could effectively harness the computation power of the plethora of low priced powerful yet under-utilized workstations connected by high-speed networks. In recent years, rapid improvement of advanced hardware and progress in networking technology is also making PC clusters a competitive platform for parallel computing. Traditionally, cluster programming has been performed with message passing libraries. As the performance, especially the latency, of the communication network improves, the expectation to support a shared-memory programming model on clusters is reviving. In this paper, we put forward a system having both a distributed shared memory cluster and heterogeneous computers as system nodes which can support automatic distribution, migration, communication and coordination of multithreaded applications on a heterogeneous platform. This will be a creative application-driven experimental infrastructure that will explore challenging problems in distribution management and control, in middleware integration and deployment, in software architecture and software engineering.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for constructing multicast trees

Distributed algorithms for constructing multicast trees

引用

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

作者： Lo Re, Giuseppe Gatani, Luca Ist. Calcolo/Reti Alte Prestazioni Consiglio Nazionale delle Ricerche Palermo Italy

ISBN: (纸本)088986392X

This paper proposes two distributed algorithms for the heuristic solution of the Steiner Tree Problem in Network (SPN). The problem has a practical application in the construction of a minimum cost distribution tree for multicast transmission. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Currently, given the lack of efficient distributed methods, the existing protocols build the multicast distribution tree using some selected central node. The proposed distributed algorithms allow the construction of effective distribution trees using a coordination protocol among the network nodes. The algorithms have been implemented and tested both in simulation and on experimental active networks, and their performance values are presented.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved prioritization method for task scheduling in heterogeneous computing systems

An improved prioritization method for task scheduling in het...

引用

20th iasted international conference on parallel and distributed computing and Systems, PDCS 2008

作者： Yu, Han Home and Networks Mobility Motorola Inc. 1299 E. Algonquin Road Schaumburg IL 60196 United States

ISBN: (纸本)9780889867741

Scheduling the execution of computing tasks for heterogeneous computing systems is a widely studied problem in the field of parallel and distributed computing. Many algorithms belong to list scheduling algorithms in which tasks are scheduled sequentially in the order of their pre-assigned priorities. The determination of task priorities is typically based on problem-specific heuristics, which is critical to the performance of a list scheduling algorithm. We design a list scheduling algorithm for heterogeneous computing systems in which task priorities are determined by both the completion time and upward rank of a task. We extend the notion of upward ranks used in HEFT and our method of calculating a task's upward rank improves over the method used in HEFT, with the inclusion of additional domain knowledge embedded in scheduling problems. As a result, more accurate estimation of the execution time of remaining tasks can be achieved. Experimental results on benchmark task graphs show that our algorithm consistently outperforms HEFT with higher execution speedups.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed processing for modelling real-time multimodal perception in a virtual robot

Distributed processing for modelling real-time multimodal pe...

引用

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

作者： Chevallier, Sylvain Paugam-Moisy, Hélène Lemaître, François Institute for Cognitive Science UMR CNRS 5015 Lyon France Ecole Centrale de Lyon Ecully France

Built from a need for modelling cognitive processes, a modular neural network is designed as the "brain" of a virtual robot moving in a prey-predator environment. The robot decides its path from the animals it identifies around. Both a parallel implementation of distributed processes and a temporal coding of spiking neurons allow the robot to develop multimodal' perception with attentional mechanisms and to react in real-time to its dynamic environment.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

An overview of IP telephony security issues and recommended solutions

An overview of IP telephony security issues and recommended ...

引用

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

作者： Knezevic, Petar Srsen, Vedran Segaric, Kresimir Faculty of Electrical Engineering and Computing Unska 3 Croatia

In the last few years one of the most interesting questions in IT world is that of convergence between data and voice networks. This procedure cuts down overall expenses of implementation, usage and support of a telephone network, as the expenses of other telephone. Beside the procedures that are prerequisite for the realization of this concept (e.g. ensuring the quality of the transferred voice), it is necessary to ensure the security of that traffic from various threats «inherited» from data traffic. This paper is about preventive protection of voice traffic transferred through a converged data/voice network.

关键词： Internet telephony

来源：评论

学校读者我要写书评

暂无评论

distributed hierarchical task planning on a network of clusters

Distributed hierarchical task planning on a network of clust...

引用

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

作者： Kabanza, Froduald Lu, Shuyun Goodwin, Scott Computer Science University of Sherbrooke Sherbrooke Que. J1K 2R1 Canada Computer Science University of Windsor Windsor Ont. N9B 3P4 Canada

A wide range of planning applications are combinatorial in nature, making the design of general purpose planning algorithms a still very challenging endeavor. In order to cope with this combinatorial complexity, some of the most recent work in artificial intelligence (AI) planning focuses on the use of sophisticated heuristics, domain search control knowledge, random search and efficient abstract state space encodings such as binary decision diagrams. The additional performance needed by complex planning applications can be provided by adopting massively parallel computing systems, such as networks of clusters. This paper describes a simple, general approach for turning backtrack search based planners into more powerful distributed systems that run on networks of clusters. Our approach consists in distributing backtrack search points to different processes on the network. We illustrate its potential using DSHOP, a distributed version of the SHOP planner.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

Self-Correcting Broadcast in distributed Hash Tables

Self-Correcting Broadcast in Distributed Hash Tables

引用

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

作者： Ghodsi, Ali Alima, Luc Onana El-Ansary, Sameh Brand, Per Haridi, Seif IMIT-Royal Institute of Technology Kista Sweden Swed. Institute of Computer Science Kista Sweden

ISBN: (纸本)088986392X

We present two broadcast algorithms that can be used on top of distributed hash tables (DHTs) to perform group communication and arbitrary queries. Unlike other P2P group communication mechanisms, which either embed extra information in the DHTs or use random overlay networks, our algorithms take advantage of the structured DHT overlay networks without maintaining additional information. The proposed algorithms do not send any redundant messages. Furthermore the two algorithms ensure 100% coverage of the nodes in the system even when routing information is outdated as a result of dynamism in the network. The first algorithm performs some correction of outdated routing table entries with a low cost of correction traffic. The second algorithm exploits the nature of the broadcasts to extensively update erroneous routing information at the cost of higher correction traffic. The algorithms are validated and evaluated in our stochastic distributed-algorithms simulator.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

Mapping distributed heterogeneous systems to a common language by applying ontologies

Mapping distributed heterogeneous systems to a common langua...

引用

作者： Vinek, Elisabeth Beran, Peter Paul Schikuta, Erich CERN CH-1211 Genève 23 Switzerland Workflow Systems and Technology Group University of Vienna Rathausstrasse 19/9 1010 Vienna Austria

ISBN: (纸本)9780889868649

The classification and selection of services within distributed, heterogeneous environments is a non trivial task. For a proper selection and composition of services in such environments - for example in a Grid or Cloud - it is required to dispose of detailed information about the existing resources and their characteristics. Particularly for applying appropriate optimization strategies these metadata are indispensable in order to decide which is the actual best resource for a given task, respectively query. It is thus a crucial task to first identify, classify and describe all system components and their attributes in a common language. Therefore a generic, high-level model of a service ontology is proposed, that exposes the fundamental building blocks of a distributed, service-oriented environment, by providing a structured collection of components and their functional and non-functional attributes. Finally, the applicability of the proposed ontology is verified by applying it to two distinct application scenarios, one from the domain of distributed Database Management Systems, and one from a High-Energy Physics experiment.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

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 dependency based bandwidth aware dynamic job grouping grid scheduler with deadline based network-ToS

A dependency based bandwidth aware dynamic job grouping grid...

引用

19th iasted international conference on parallel and distributed computing and Systems

作者： Singh, Vivek Sheel Misra, Manoj Department of Electronics and Computer Engineering Indian Institute of Technology Roorkee India

ISBN: (纸本)9780889867048

The past decade has witnessed a boost in the acceptance of Grid computing as an alternative to traditional supercomputing environments. The evolution of Computers, networks and the Internet has boosted the growth of Grid computing. However applications with fine grained jobs tend to be unfavorable for this environment. Further applications that possess jobs that are dependent upon each other need to be grouped together and represented in a coarse-grained manner to lower the overheads involved with fine grained jobs, and rescheduling of dependent jobs. Also, there is a need to impose ordering on resource selection based on their processing capabilities and dynamic bandwidth scenarios. Users with different priorities must be provided differentiated Network ToS to ensure high Success Rates of job completion. In this paper, we investigate a dependency based, Network Aware, dynamic job grouping scheduler, which provides Network ToS to Users based on their deadlines.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：