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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

608 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

341 篇 工学
- 332 篇 计算机科学与技术...
- 204 篇 软件工程
- 122 篇 信息与通信工程
- 34 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 电子科学与技术（可...
- 8 篇 动力工程及工程热...
- 8 篇 测绘科学与技术
- 7 篇 机械工程
- 7 篇 建筑学
- 6 篇 生物工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 生物医学工程（可授...
- 2 篇 仪器科学与技术
109 篇 理学
- 90 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 9 篇 物理学
- 9 篇 生物学
- 5 篇 化学
- 2 篇 大气科学
- 2 篇 地球物理学
76 篇 管理学
- 51 篇 管理科学与工程(可...
- 43 篇 工商管理
- 27 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 医学
- 4 篇 临床医学
2 篇 法学
1 篇 教育学
1 篇 农学

主题

174 篇 distributed comp...
111 篇 computer network...
100 篇 software enginee...
93 篇 artificial intel...
73 篇 concurrent compu...
55 篇 computer science
47 篇 grid computing
47 篇 distributed comp...
45 篇 peer to peer com...
39 篇 application soft...
31 篇 parallel process...
31 篇 wireless sensor ...
30 篇 network topology
29 篇 parallel process...
29 篇 delay
28 篇 costs
25 篇 algorithm design...
25 篇 large-scale syst...
24 篇 protocols
23 篇 resource managem...

机构

3 篇 department of co...
3 篇 department of co...
3 篇 school of inform...
3 篇 national laborat...
3 篇 institute of com...
3 篇 school of comput...
3 篇 school of comput...
2 篇 univ sci & techn...
2 篇 huazhong univ sc...
2 篇 department of co...
2 篇 univ adelaide sc...
2 篇 school of comput...
2 篇 univ technol syd...
2 篇 department of co...
2 篇 school of manage...
2 篇 sharif universit...
2 篇 school of comput...
2 篇 lab. com. phys. ...
2 篇 natl univ def te...
2 篇 school of comput...

作者

4 篇 xicheng lu
4 篇 aaron harwood
4 篇 nong xiao
3 篇 shietung peng
3 篇 hong chen
3 篇 rui chu
3 篇 wenhong wei
3 篇 yongxuan lai
3 篇 huanguo zhang
3 篇 engelmann christ...
3 篇 gerald kunzmann
3 篇 wenjun xiao
2 篇 nandi asoke k.
2 篇 xing-ming li
2 篇 choi k.
2 篇 ling zhang
2 篇 wu cheng
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...

语言

620 篇 英文

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

共 620 条记录，以下是111-120 订阅

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

详细简洁

排序：

AN optimal moving policy for a mobile agent in distributed networks

AN optimal moving policy for a mobile agent in distributed n...

引用

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

作者： Inoie, Atsushi Ishizaka, Michihiro Department of Network Engineering Kanagawa Institute of Technology 1030 Shimo-ogino Atsugi-city Kanagawa 243-0292 Japan

ISBN: (纸本)9780889867048

An optimal mobile agent moving policy for a mobile agent network where a single mobile agent moves and collects management information, is studied. The network has one management station that maintains many network elements each of which generates the management information (e.g., the updated state of the element). We formulate this network model as a semi-Markov decision process (SMDP) and compute an optimal policy with a policy iteration algorithm. It is shown that an optimal mobile agent moving policy achieved by the policy iteration algorithm has a cost reduction effect for the network in comparison to a heuristic policy.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for reducing communication cost of time-dependent Monte Carlo transport

A new algorithm for reducing communication cost of time-depe...

引用

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

作者： Li, Deng Haiyan, Xu Lab. Com. Phys. Institute of Applied Physics and Computational Mathematics China

ISBN: (纸本)0889865701

parallel algorithm of time-independent Monte Carlo transport problem is successful because particles are typically independent and easily distributed to multiple processors. However, for time-dependent Monte Carlo transport problem, due to the communication of each time-step about scattering source attribute and meshes, it reduces the parallel efficiency and limits enlarge of parallel scale. We research two algorithms. Where adaptive processor assignment and the optimized processor choice are obtained. We propose a scheme that is based upon Monte Carlo stratified sampling technique for treatment of scattering source communication. It greatly reduces the communication cost. The parallel scalability is obviously improved. The larger speedup over the basic algorithm is obtained.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Grid load balancing using an ECHO system of intelligent ants

Grid load balancing using an ECHO system of intelligent ants

引用

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

作者： Salehi, Mohsen Amini Deldari, Hossain Department of Software Engineering Faculty of Engineering Ferdowsi University of Mashhad Iran

ISBN: (纸本)0889865701

A computational grid is a widespread computing environment that provides huge computational power for large-scale distributed applications. One of the most important issues in such an environment is resource management for which agent-based approaches are appropriate. Load balancing as a part of resource management, has a considerable effect on performance. Ant colony is a metaheuristic that can be instrumental for grid load balancing. This paper presents an echo system of intelligent, autonomous and cooperative ants. The ants in this environment can procreate and also may commit suicide depending on existing conditions. A new concept called Ant level load balancing is presented for improving the performance of the mechanism. A performance evaluation model is derived. Theoretical analyses and simulation results indicate that this new mechanism surpasses its predecessor.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Static mapping of integrating historical data neural networks on parallel computer

Static mapping of integrating historical data neural network...

引用

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

作者： Turchenko, Volodymyr O. Res. Inst. Intelligent Comp. Syst. Ternopil Academy of National Economy 3 Peremoga Square 46006 Ternopil Ukraine Italy

The experimental researches of efficiency of coarse-grain parallel method of artificial neural networks training with static mapping onto processors of parallel computer are presented in this paper. The features of parallel algorithm implementation using C language and MPI library are described. The research of parallel method is carried out using analysis of its speed-up and efficiency.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

parallel refinement of tetrahedral meshes on distributed-memory machines

Parallel refinement of tetrahedral meshes on distributed-mem...

引用

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

作者： Blazy, Stephan Marquardt, Oliver Paderborn Center for Parallel Computing Paderborn University Fürstenallee 11 33102 Paderborn Germany

In this paper we present a scalable parallel refinement algorithm for tetrahedral meshes which is based on a regular refinement strategy with closure tetrahedra. This algorithm works efficiently on distributed-memory machines. We focus on the parallel implementation of the boundary updates of each mesh partition. Additionally we show that it is sufficient to exchange only boundary edge information between neighboring mesh partitions to obtain a conforming distributed three-dimensional tetrahedral mesh. The algorithm is implemented using the padfem2 framework.

关键词： parallel processing 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

来源：评论

学校读者我要写书评

暂无评论

Grid resource negotiation: Survey with a machine learning perspective

Grid resource negotiation: Survey with a machine learning pe...

引用

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

作者： Briquet, Cyril De Marneffe, Pierre-Arnoul Department of EE and CS University of Liège Montefiore Institute B37 B-4000 Liège Belgium

ISBN: (纸本)0889865701

Grid computing can be defined as coordinated resource sharing and problem solving in dynamic, multi-institutional collaborations [1], As more Grids are deployed worldwide, the number of multi-institutional collaborations is rapidly growing. However, for Grid computing to realize its full potential, it is expected that Grid participants are able to use one another resources. Resource negotiation (i.e. exchange or trading of resources between Grids) enables Grid participants to face an unstable request environment. The aim of this position paper is to present a survey of the current state and challenges of resource negotiation research, with a Machine Learning perspective. We support the view that negotiation and learning are intrinsically linked. In particular, we show the expected benefits of integrating Machine Learning techniques with resource negotiation.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Improved asynchronous group mutual exclusion in token-passing networks

Improved asynchronous group mutual exclusion in token-passin...

引用

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

作者： Lin, David Moh, Teng-Sheng Moh, Melody San Jose State Univ Dept Comp Sci San Jose CA 95192 USA

ISBN: (纸本)9780889866386

Group mutual exclusion (GME) was first introduced by Joung [5] as a generalization of the n-process mutual exclusion problem, and subsequently modeled as the Congenial Talking Philosophers problem. GME allows processes requesting for the same resource to concurrently access the shared resource. However, a process requesting a resource that is different from the one currently being used will not be able to access the requested resource at the same time. Two solutions to the GME problem for a ring network exist. One by Wu and Joung had an unbounded message size problem [11, 12], the second one by Cantarell, et. al. provided a bound for message size, but could potentially generate an unbounded number of messages [2, 3]. This work presents a GME algorithm for a token-passing network that solves both problems by providing a bound both to the number of messages and to message size. Analysis results of time and message complexities and of correctness are presented. Performance is evaluated by simulation experiments, which further validate complexity analyses.

关键词： distributed algorithm group mutual exclusion message passing token passing

来源：评论

学校读者我要写书评

暂无评论

Recursive construction of distributors by merging

Recursive construction of distributors by merging

引用

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

作者： Li, Shuo-Yen Robert Tan, Xuesong Department of Information Engineering Chinese University of Hong Kong Shatin N. T. Hong Kong

A distributor is a time-multiplexed switch that routes active input signals to output ports in the round-robin fashion. This paper presents the Merge-Distribute algorithm for the recursive construction of distributors in the form of parallel distributed-control networks, as analogous to the recursive construction of sorting networks by the Mergesort algorithm. The Merge-Distribute algorithm achieves the best known depths for distribution networks of all sizes within the practical range. The rigorous algebraic formulation AMkeeps the algorithmic construction transparent and affords many variations in the construction so as to flexibly cope with ad hoc engineering constraints in implementation.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：