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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

550 篇 会议
12 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

436 篇 工学
- 413 篇 计算机科学与技术...
- 274 篇 软件工程
- 109 篇 信息与通信工程
- 76 篇 电气工程
- 60 篇 控制科学与工程
- 24 篇 仪器科学与技术
- 20 篇 电子科学与技术（可...
- 10 篇 动力工程及工程热...
- 9 篇 机械工程
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 土木工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 网络空间安全
- 4 篇 光学工程
- 3 篇 化学工程与技术
115 篇 理学
- 91 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 9 篇 生物学
- 8 篇 化学
- 3 篇 地球物理学
74 篇 管理学
- 50 篇 管理科学与工程(可...
- 40 篇 工商管理
- 35 篇 图书情报与档案管...
7 篇 法学
- 5 篇 社会学
6 篇 经济学
- 6 篇 应用经济学
4 篇 医学
2 篇 农学

主题

42 篇 distributed comp...
32 篇 parallel process...
25 篇 parallel process...
22 篇 distributed comp...
17 篇 parallel algorit...
15 篇 computer archite...
14 篇 parallel computi...
14 篇 cloud computing
12 篇 distributed syst...
11 篇 concurrent compu...
10 篇 message passing
9 篇 fault tolerance
9 篇 data mining
9 篇 computational mo...
8 篇 java
8 篇 scheduling
7 篇 computer science
7 篇 load balancing
7 篇 parallel program...
7 篇 grid computing

机构

3 篇 high-performance...
3 篇 parallel and dis...
3 篇 shanghai jiao to...
3 篇 shanghai jiao to...
3 篇 parallel and dis...
3 篇 univ fed rio gra...
2 篇 high-performance...
2 篇 hpc laboratory c...
2 篇 department of co...
2 篇 washington univ ...
2 篇 institut univers...
2 篇 univ coll dublin...
2 篇 univ seville i3u...
2 篇 univ extremadura...
2 篇 guangxi univ sch...
2 篇 guangxi univ gua...
2 篇 school of comput...
2 篇 university of ch...
2 篇 ibm dublin techn...
2 篇 univ milan milan

作者

5 篇 kuan-ching li
5 篇 li kuan-ching
5 篇 chao-tung yang
5 篇 yang chao-tung
4 篇 gonzalez teofilo...
3 篇 kawamura takao
3 篇 navaux philippe ...
3 篇 kurt rothermel
3 篇 talia domenico
3 篇 zang binyu
3 篇 sugahara kazunor...
3 篇 zhang jilin
3 篇 ohkawa takeshi
3 篇 xia yubin
2 篇 cong guojing
2 篇 jiao han
2 篇 paraboschi stefa...
2 篇 brzezinski krzys...
2 篇 motomura shinich...
2 篇 park joon s.

语言

544 篇 英文
18 篇 其他
2 篇 俄文
2 篇 中文

检索条件"任意字段=19th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 566 条记录，以下是351-360 订阅

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

详细简洁

排序：

Exercise management scheme for a distributed e-learning system

Exercise management scheme for a distributed e-learning syst...

引用

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

作者： Kawamura, Takao Kuramochi, Kazuo Sugahara, Kazunori Department of Information and Knowledge Engineering Tottori University 4-101 Koyama-Minami Tottori Japan

ISBN: (纸本)9780889867048

We have proposed and implemented a distributed asynchronous Web-based training (WBT) system. In order to improve the scalability and robustness of this system, all exercises and functions, such as scores user's answers are realized on mobile agents. these agents are distributed to computers, and they can be constructed with a P2P network that modified Content-Addressable Network (CAN). In this paper, we present the exercise management scheme for the proposed WBT system. In a WBT system based on client/server model, management of exercises is simply achieved by manipulating data, since all contents are concentrated in one server computer. In the proposed system, however, we need to pay attention to distributed agents for management of exercises. In order to achieve operation of exercise management, i.e., adding, deleting and updating exercises on the distributed WBT system, we use steps with considering multi-agent based distributed environment: specifying an agent which provides an exercise and searching its node as pre-operation, and sending an agent to the expected node and notifying other cooperating agents as post-operation.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

Online scheduling of malleable parallel jobs

Online scheduling of malleable parallel jobs

引用

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

作者： Dutton, Richard A. Mao, Weizhen Department of Computer Science College of William and Mary P.O. Box 8795 Williamsburg VA 23187-8795 United States

ISBN: (纸本)9780889867048

In this paper, we study a parallel job scheduling model which takes into account both computation time and the overhead from communication between processors. Assuming that a job Jj has a processing requirement pj and is assigned to kj processors for parallel execution, then the execution time will be modeled by tj = p j / kj+ (kj - 1) c, where c is the constant overhead cost associated with each processor other than the master processor. In this model, (kj - 1)c represents the cost for communication and coordination among the processors. this model attempts to accurately portray the actual execution time for jobs running in parallel on multiple processors. Using this model, we will study the online algorithm Earliest Completion Time (ECT) and show a lower bound for the competitive ratio of ECT for m ≥ 2 processors. For m ≤ 4, we show the matching upper bound to complete the competitive analysis for m = 2,3,4. For large m, we conjecture that the ratio approaches 30/13 ≈ 2.30769.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A totally distributed iterative scheme for web services addressing and discovery

A totally distributed iterative scheme for web services addr...

引用

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

作者： Milanesio, M. Ruffo, G. Schifanella, R. Department of Computer Science University of Turin Torino Italy

ISBN: (纸本)9780889867048

Both web services framework and peer-to-peer networks provide a discovery process, but as current P2P systems focus more on the discovery of content in the form of common files (possibly associated with metadata), a centralized UDDI registry serves content in the form of metadata describing web services. thus, the intersection between P2P and Web services is clear, so that it recently gained lots of interest: there is the need of finding a way to exploit the high potential of web services without paying in terms of scalability or single-point-of-failures. Our aim in this paper is two-fold: on the one hand, we want to present a high level protocol for the addressing and the discovery of web services that is totally decentralized and based on a structured P2P topology. On the other hand, we introduce a way to solve the exact match key-based routing problem, that afflicts structured P2P systems. this model guarantees that all addressed web services will be discovered in a logarithmic number of hops, as it is based on a distributed Hash Table. One of the key innovation is the possibility of customizing the categorization of web services using tags, which are becoming very common in the so called Web 2.0.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Self-tuned passive testers for grey-box distributed systems with indefinite communication delays

Self-tuned passive testers for grey-box distributed systems ...

引用

international conference on parallel and distributed computing and Networks

作者： Brzezinski, Krzysztof M. Malinski, Norbert Warsaw Univ Technol Inst Telecommun Nowowiejska 15-19 PL-00665 Warsaw Poland

ISBN: (纸本)9780889866379

Passive testing is a technique suitable for continuous, non-intrusive, autonomous testing of qualitative behavioural properties (correctness) of a deployed distributed system. A real passive tester has to face observational uncertainty, which may lead to false verdicts. We submit the novel idea of a self-tuned passive tester, which is able to adapt to a priori unknown, and possibly changing delays in communication channels. We propose the structure and algorithms of a passive tester that "tunes itself" basing solely on its own, locally issued verdicts. this seemingly counter-intuitive principle is shown by simulation to be viable and effective.

关键词： protocols algorithms modelling and simulation testing

来源：评论

学校读者我要写书评

暂无评论

引用

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

作者： Behl, Sanjiv Verma, Rakesh M. Computer Science Department University of Houston-Victoria Victoria TX 77901 United States Computer Science Department University of Houston Houston TX 77204 United States

ISBN: (纸本)9780889867048

Multiple-disk architectures are an attractive approach to meet high performance I/O demands in I/O intensive applications such as search engines, web servers and information retrieval systems. this requires that the issues of dynamic load balancing and access parallelism be addressed, which is the goal of this paper. We address the problem of document declustering in a keyword-based information retrieval system for parallel architectures consisting of a single processor and multiple disks. We propose and evaluate experimentally four similarity-based methods, viz., set, multiset, vector, and euclidean, for declustering documents. Interestingly, our results show that for single keyword queries as well as boolean and queries the set and multiset methods generally outperform the vector and euclidean methods with set being the best for the so-called simple plan. We also introduce a highest-frequency first retrieval scenario and compare the methods under this scenario, and find that set and multiset methods are still generally superior to the other methods with the multiset outperforming the set method. We compare these methods with the (theoretically) optimal values, which are practically impossible to achieve. Finally, we approximated the multiset method using the harmonic mean and found that the results were slightly inferior than multiset method, but still better than the vector and euclidean methods.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Self-constrained resource allocation procedures for parallel task graph scheduling on shared computing grids

Self-constrained resource allocation procedures for parallel...

引用

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

作者： N'Takpé, Tchimou Suter, Frédéric Nancy Université / LORIA UMR 7503 CNRS - INPL - INRIA - Nancy 2 - UHP Nancy 1 Campus Scientifique BP 239 F-54506 Vandoeuvre-lès-Nancy France

ISBN: (纸本)9780889867048

Two of the main characteristics of computation grids are their heterogeneity and the sharing of resources between different users. this is the cost of the tremendous computing power offered by such platforms. Scheduling several applications concurrently in such an environment is thus challenging. In this paper we propose a first step towards the scheduling of multiple parallel task graphs (PTG), a class of applications that can benefit of large and powerful platforms, by focusing on the allocation process. We consider the application of a resource constraint on the schedule and determine the number of processors allocated to the different tasks of a PTG while respecting that constraint. We present two different allocation procedures and validate them in simulation over a wide range of scenarios with regard to their respect of the resource constraint and their impact on the completion time of the scheduled applications. We find that our procedures provide a guarantee on the resource usage for a low cost in terms of execution time.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Visualization of large scientific data sets on a parallel system with a tiled display

Visualization of large scientific data sets on a parallel sy...

引用

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

作者： Segee, Bruce Perry, Mary Jane Carter, Caleb Blanchette, Roger Winchenbach, Samuel Department of Electrical and Computer Engineering University of Maine Orono ME United States School of Marine Sciences University of Maine Orono ME United States

ISBN: (纸本)9780889867048

As data collection technologies advance, almost every field of scientific research sees an increase in the amount and frequency of data that can be collected. In many cases, the first best method for preprocessing two and three dimensional data sets is to examine them visually, using some sort of plotting software. Although display technology is advancing and monitors are becoming available with increasing resolutions, this increase in available resolution does not necessarily match the rapid increase in data collection. this mismatch leaves researchers with only three choices for visual processing: to view the data in many small chunks, to view only a representative subset of the data, or to create a custom display for viewing much larger data sets at higher resolutions. this paper discusses one method of fullfilling the third option. the process used here is to create a customized display using nine consumer level monitors mounted in a three by three configuration resulting in a display with nine times the resolution of a single monitor. A custom viewing environment is also developed within this project that is designed to lend itself better to the tiled display than would an existing three dimensional data visualization application. the data used for this project consists of a large set of Oceanographic sensor readings taken from several deployments throughout the Gulf of Maine.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

EPDKS: An efficient proximity-based distributed k-ary structured overlay network

EPDKS: An efficient proximity-based distributed k-ary struct...

引用

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

作者： Alima, Luc Onana Beauport, Stefan Institut d'Informatique Université de Mons-Hainaut Avenue du Champ de Mars 6 57000 Mons Belgium

ISBN: (纸本)9780889867048

Structured peer-to-peer overlay networks provide a means for interconnecting a large set of computing nodes called peers in a distributed, scalable and self-organizing manner. Typically in such systems, each peer maintains contact information about a small subset of other peers called neighbors. these neighbors are often chosen to ensure that each lookup operation takes a logarithmic number of overlay hops under normal conditions. Relying solely on the number of overlay hops as the metric for the quality of the lookup operation is not sufficient both for the applications using the overlay network and, for the effective use of the underlying communication network which is typically the Internet. DKS [1] is a P2P middleware built upon the principle we called distributed K-ary search, which ensures that any lookup takes O(log k(N)) overlay hops, where N is the number of nodes in the system and K is the search arity. In a DKS overlay network, proximity is not considered. As a result, end-to-end latencies could be significantly large. In this paper we present EPDKS, a novel structured peer-to-peer overlay network that is based on the distributed K-ary search principle. EPDKS takes proximity into account by combining round-trip times and the number of IP hops for interconnecting peers, thereby reducing end-to-end latencies and making effective use of the underlying network. Furthermore, we propose improvements for some of the algorithms currently implemented in the DKS. Simulation results confirm our expectations that EPDKS ensures lower end-to-end latencies and smaller number of IP hops when compared to DKS.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Time expenses analysis of discrete state observers computation

Time expenses analysis of discrete state observers computati...

引用

26th iasted international conference on Modelling, Identification and Control

作者： Pelc, Mariusz Opole Univ Technol PL-45233 Opole Poland

ISBN: (纸本)9780889866331

In this paper detailed analysis of discrete state observers from the point of view of potential time expenses required for the observer computation is presented. the aim of this article is to present, what is the influence of choice of observer parameters on computation time consumption. the attention is paid most of all on the analysis of the possibility of application of the control systems in a distributed version in the context of discrete state reconstruction. All of numerical tests are conducted in the LAM/MPI environment.

关键词： parallel computing computer control systems

来源：评论

学校读者我要写书评

暂无评论

Analysis of parallel Binary Merge Sort in a Grid Environment 20

Analysis of Parallel Binary Merge Sort in a Grid Environment

引用

20th international conference on parallel and distributed computing systems, PDCS 2007

作者： Mach, Werner Schikuta, Erich University of Vienna Department of Knowledge and Business Engineering Rathausstraße 19/9 ViennaA-1010 Austria

ISBN: (纸本)9781604233926

this paper presents an analysis of the parallel binary merge sort algorithm and a comparison of its behavior in a generalized multiprocessor framework and a simplified Grid Environment. Based on the well known method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model. © 20th international conference on parallel and distributed computing systems, PDCS 2007. All rights reserved.

关键词： algorithm analysis grid infrastructure parallel sorting workflow orchestration

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：