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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

The impact of error in user-provided bandwidth estimates on multi-site parallel job scheduling performance

The impact of error in user-provided bandwidth estimates on ...

引用

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

作者： Jones, William M. Electrical and Computer Engineering Department United States Naval Academy Mail Stop 14B 105 Maryland Avenue Annapolis MD 21402-5025 United States

ISBN: (纸本)9780889867048

Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully mapping jobs across potentially many clusters, jobs that would otherwise wait in the queue for local cluster resources can begin execution much earlier;thereby improving system utilization and reducing average queue waiting time. Recent research in this area leverages user-provided estimates of job communication characteristics to effectively partition the job across cluster boundaries. In this paper, we address the impact of inaccuracies in these estimates on overall system performance. Furthermore, we demonstrate that multi-site job scheduling techniques benefit from these estimates, even in the presence of considerable inaccuracy.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Grid-enabled ensemble subsurface modeling

Grid-enabled ensemble subsurface modeling

引用

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

作者： Li, Xin Lei, Zhou White, Christopher D. Allen, Gabrielle Qin, Guan Tsai, Frank T.-C. Center for Computation and Technology Louisiana State University United States Department of Petroleum Engineering Louisiana State University United States Department of Civil and Environmental Engineering Louisiana State University United States Institute of Scientific Computing Texas A and M University United States

ISBN: (纸本)9780889867048

Ensemble Kalman Filter (EnKF) uses a randomized ensemble of subsurface models for performance estimation. However, the complexity of geological models and the requirement of a large number of simulation runs make routine applications extremely difficult due to expensive computation cost. Grid computing technologies provide a cost-efficient way to combine geographically distributed computing resources to solve large-scale data and computation intensive problems. We design and implement a grid-enabled EnKF solution to ill-posed model inversion problems for subsurface modeling. It has been integrated into the Res-Grid, a problem solving environment aimed at managing distributed computing resources and conducting subsurface-related modeling studies. Two use cases in reservoir studies indicate that the enhanced ResGrid efficiently performs EnKF inversions to obtain relatively accurate, uncertainty-ware predictions on reservoir production. This grid-enabled EnKF solution is also being applied for data assimilation of large-scale groundwater hydrology nonlinear models.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

Visagefs dynamic storage features for wide-area workflows

Visagefs dynamic storage features for wide-area workflows

引用

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

作者： Thiebolt, François Ortiz, Aurélien M'zoughi, Abdelaziz IRIT Institut de Recherche en Informatique de Toulouse Université Paul Sabatier Toulouse III France

ISBN: (纸本)9780889867048

Nowadays, the disk storage's skyrocketing capacity has led to an amazing situation : grid-scale gathered storage of client nodes can overcome even the largest centralised storage units. Thus, one of the key challenges related to the grid environment is to federate such spread storage resources together. Thereby, we have developed Vis-ageFS, a Posix compliant, wide-area file system. It is mainly built upon a storage virtualization layer, plug-ins aware coherency layer and a multi-tiered administration and monitoring service. However, once featured with a global namespace fuelled by heterogeneous storage, the wide-area job scheduler is willing to be aware of data location. Furthermore, depending on workload, it may be highly desirable to make use of local storage facilities without data staging penalties. In this paper, we present one dynamic storage feature intended to provide transparent local storage access while remaining within the VisageFS global namespace.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Searching using probabilistic hints in unstructured peer-to-peer networks

Searching using probabilistic hints in unstructured peer-to-...

引用

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

作者： Li, Xiuqi Wu, Jie Xu, Jun Department of Computer Science and Engineering Florida Atlantic University Boca Raton FL 33431 United States College of Computing Georgia Institute of Technology Atlanta GA 30332 United States

ISBN: (纸本)9780889867048

Peer-to-peer (P2P) networking is designed for sharing resources at the edge of the Internet. Searching in file-sharing P2P networks has been an important research topic, and it has drawn significant attention recently. Hints can be utilized to improve query success rates. Determining how to efficiently and effectively propagate hints is a challenging issue. In this paper, we propose a searching protocol called HS-SDBF (Hint-based Search by Scope Decay Bloom Filter) that addresses this issue. HS-SDBF uses a data structure named SDBF (Scope Decay Bloom Filter) to represent and propagate probabilistic hints. Compared to existing proactive schemes, HS-SDBF can answer many more queries successfully at a lower amortized cost considering both the query traffic and hint propagation traffic. The experimental results support the performance improvement of our protocol.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

引用

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

来源：评论

学校读者我要写书评

暂无评论

One-to-all personalized communication in torus networks

One-to-all personalized communication in torus networks

引用

iasted international conference on parallel and distributed computing and Networks, PDCN 2007

作者： Mao, Weizhen Chen, Jie Watson III, William Department of Computer Science College of William and Mary Williamsburg VA 23187 United States High Performance Computing Group Jefferson Lab. Newport News VA 23606 United States

ISBN: (纸本)9780889866379

Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each of the other processors in the network. Under the assumptions of same-size data to each processor, storeand-forward routing, and all-port processors, we formulate the one-to-all personalized communication problem as an optimization problem with the goal to minimize the total elapsed time (measured in the number of time steps) for all data to reach their respective destinations. We design an optimal algorithm based on partitioning the torus network into disjoint subnetworks. We also present a heuristic algorithm based on a greedy strategy. We implement the algorithms on two Linux clusters with Gigabit Ethernet torus connection, currently in use at the Jefferson National Lab and configured as a 2-dimensional 8 x 8 torus and a 3-dimensional 4 x 8 x 8 torus, respectively. We analyze the performance of the algorithms using data collected in experiments.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 68 69 70 71 72 73 74 75 76 77 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：