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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

564 篇 电子文献
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.

语言

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

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

共 564 条记录，以下是411-420 订阅

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

详细简洁

排序：

A resource management system for data-intensive applications in desktop grid environments

A resource management system for data-intensive applications...

引用

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

作者： Toyama, Toshiaki Yamada, Yoshito Konishi, Katsumi Kogakuin Univ Grad Sch Informat Dept Comp Sci & Commun Engn Tokyo Japan Tokyo Inst Technol Grad Sch Engn Dept Commun & Integrated Syst Tokyo Japan Kogakuin Univ Fac Informat Dept Comp Sci Tokyo Japan

ISBN: (纸本)9780889866386

Grid computing using idle desktop PCs is popular as a low-cost platform for high-throughput applications. However, they require high-cost data transfer systems from file servers to calculating nodes when very large amounts of data are handled. this high cost derives from inexpensive I/O of worker PCs and small inexpensive file systems of desktop grid computing. this work describes a desktop grid computing system and proposes a resource management system for volume visualization. the resource management system proposed in this work overcomes problems with high-cost data transfer and helps us to use desktop grid computing for data-intensive applications. the resource management system provides efficient scheduling while considering the data file location and consists of three technical parts: resource management, multiple data replication, and worker selection. the proposed system uses these techniques to make an intelligent reuse of data which has been previously copied. this paper evaluates the proposed system compared with a traditional system that does not consider data file location. the proposed resource management System provides efficient scheduling and appears to achieve good performance for data-intensive applications.

关键词： desktop grid computing PC grid resource management data-intensive applications volume visualization parallel visualization

来源：评论

学校读者我要写书评

暂无评论

Power-aware parametric dispatching in distributed real-time systems

Power-aware parametric dispatching in distributed real-time ...

引用

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

作者： Elsharkawy, Sameh M. Younis, Mohamed F. Moulds, Clint Catholic Univ Amer Dept Elect Engn & Comp Sci Washington DC 20064 USA Univ Maryland Baltimore Cty Dept Elect Engn & Comp Sci Baltimore MD 21228 USA

ISBN: (纸本)9780889866386

the majority of battery operated computing devices have the capability to employ Dynamic Voltage Scaling (DVS) as an effective method to minimize the power used by their processors. Algorithms employing DVS in real-time systems must guarantee the satisfaction of all tasks' timing constraints while minimizing power consumption. In this paper, we present a framework for scheduling and dispatching a distributed set of hard real-time tasks with relative timing constraints. In our approach, the scheduler employs the parametric real-time scheduling methodology to provide on-time completion guarantees for periodic hard real-time tasks. Moreover, the scheduler associates with each hard real-time task a feasibility range parameterized by timing parameters generated at run-time. the run-time dispatcher uses this information to calculate the system's dynamic slack time. It uses the slack time to set the CPU speed using DVS in the time interval till the next scheduling point. the dispatcher reclaims the additional slack generated when a job uses fewer execution cycles than its worst-case estimate to further reduce power consumption. the proposed power-aware dispatching method has running-time of O(1) with no need for off-line computations. Our simulation results show significant improvement in power savings over previously presented DVS-based scheduling methods.

关键词： real-time scheduling power management Digital Voltage Scaling distributed systems parametric dispatching

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Approximating the Buffer Allocation Problem using epochs

Approximating the Buffer Allocation Problem using epochs

引用

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

作者： Pedersen, Jan Baekgaard Brodsky, Alex Univ Nevada Sch Comp Sci 4505 Maryland Pkwy Las Vegas NV 89154 USA Univ Winnipeg Dept Appl Comp Sci Winnipeg MB R3B 2E9 Canada

ISBN: (纸本)9780889866386

the correctness of applications that perform asynchronous message passing typically relies on the underlying hardware having a sufficient amount of memory (message buffers) to hold all undelivered messages-such applications may deadlock when executed on a system with an insufficient number of message buffers. thus, determining the minimum number of buffers that an application needs to prevent deadlock is an important task when writing or porting parallel applications. Unfortunately, both this problem (called the Buffer Allocation Problem) and the simpler problem of determining whether an application may deadlock for a given number of available message buffers are intractable [1]. We present a new epoch-based polynomial-time approach for approximating the Buffer Allocation Problem. Our approach partitions application executions into epochs and intersperses barrier synchronizations between them, thus limiting the number of message buffers necessary to ensure deadlock-freedom. this approach produces near optimal solutions for many common cases and can be adapted to guide application modifications that ensure deadlock freedom when the application is ported. Lastly, we describe a space-time trade-off between the number of available message buffers and the number of barrier synchronizations, and describe how this trade-off can be used to fine-tune application performance.

关键词： resource allocation parallel programming message passing systems

来源：评论

学校读者我要写书评

暂无评论

parallel Meta-Heuristic Approaches for Deployment of Heterogonous Sensing Devices 19

Parallel Meta-Heuristic Approaches for Deployment of Heterog...

引用

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： Ramadan, Rabie Al-Nawaiseh, Ala El-Rewini, Hesham Abdelghany, Khaled Dept. of Computer Science & Engineering Southern Methodist University DallasTX75275 United States Dept. of Environmental and Civil Engineering Southern Methodist University DallasTX75275 United States

ISBN: (纸本)9781604236446

Genetic Algorithms and Simulated Annealing have been used to solve many combinatorial problems. their results are proven to be efficient in solving such problems. the running time of these techniques is generally less than the running time needed to find the optimal solution. However, in very large-scale problems such as sensor deployment, their running time is extremely high. In this paper, we introduce several parallelization methods to speedup the genetic and simulated annealing heuristics used for the deployment of sensing devices on a field with differential security/surveillance requirements. the parallelization methods are classified into two categories: slave based, and master based. We implemented these two categories using iteration division, and chromosome division. A large number of experiments were conducted on a PVM cluster with 14 nodes to show the speed up and efficiency of these parallelization techniques. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Design of the SAgent security framework for JADE

Design of the SAgent security framework for JADE

引用

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

作者： Gunupudi, Vandana Tate, Stephen R. Univ North Texas Dept Comp Sci & Engn Denton TX 76203 USA

ISBN: (纸本)9780889866386

In this paper, we present the design of SAgent, a general-purpose mobile agent security framework. SAgent is designed for comprehensive protection of mobile agent computations and data in potentially hostile environments and works with the JADE (Java Agent DEvelopment) platform [1], a FIPA-compliant multi-agent environment. Using good software engineering design techniques of software reusability and abstraction, SAgent allows agent protection protocols and applications to be developed independently of each other. To accomplish this, a clean conceptual framework is presented which encapsulates in several general class interfaces the common security functionality required by secure agent applications. Since SAgent is designed to generically protect the computations of mobile agent applications, we provide implementations of two secure multiagent protocols that protect the confidentiality of agent data as well as implementations of four methods that protect the integrity of mobile agent data. Experimental results showing the feasibility of these methods are available in separate publications [2] [3]. the goal of SAgent is to provide a framework where proposed theoretical techniques can be used and experimentally evaluated. SAgent allows a new security provider to implement and experiment with new techniques for protecting mobile agents in a well-defined manner and is generic enough to support both software-based and hardware-based protections.

关键词： software development software reuse distributed agents mobile agent security frameworks for mobile agents

来源：评论

学校读者我要写书评

暂无评论

Efficient routing in non-uniform DHTs for range query support

Efficient routing in non-uniform DHTs for range query suppor...

引用

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

作者： Abdallah, Maha Buyukkaya, Eliya Univ Paris 06 LIP6 8 Rue Capitaine Scott F-75015 Paris France

ISBN: (纸本)9780889866386

By randomly mapping items and nodes to a common address space, most P2P index structures based on DHTs provide only exact match data look-ups. this compromises their use in data-oriented applications where more advanced query facilities, such as range queries, are needed. We have previously proposed a P2P index structure that refines the Chord DHT by mapping data items to the Chord address space in an order-preserving way. Load balancing of skewed data is then achieved deterministically by pulling nodes to zones where too many data items reside. However, based on Chord's underlying routing infrastructure, our previous solution can no longer ensure logarithmic routing cost when the node distribution over the address space becomes highly skewed. In this paper, we push our previous study one step further and propose a simple yet efficient refinement to Chord's routing component. By offering nodes more flexibility in the choice of their neighbors, our solution ensures logarithmic routing cost, with high probability. Most importantly, our solution is dynamic in the sense that it adapts to any node distribution, including highly adversarial ones.

关键词： peer-to-peer systems distributed hash tables (DHTs) range queries routing load-balancing

来源：评论

学校读者我要写书评

暂无评论

Repeat analysis in dna sequences with parallel computing method on Grid

Repeat analysis in dna sequences with parallel computing met...

引用

18th iasted international conference on parallel and distributed computing and systems, PDCS 2006

作者： Arefin, Md. Ahsan Anwar, Abdullah Ibney Wasif, Abu Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka Bangladesh

the development of Grid environment provides an efficient way for implementing the parallel algorithm. Here we focus on the discovery of short recurring patterns in DNA sequences that represent binding sites for certain proteins in the process of gene regulation. We develop parallel computing algorithm for solving this problem by partitioning the overall DNA sequences. this provides us an option to implement the algorithm on Grid and to evaluate its performance. We use the open source software "Alchemi" for building the Grid environment. Also by using a merging repeat approach to find these patterns, we address other related problems, including finding of repetition with insertion and deletion.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 38 39 40 41 42 43 44 45 46 47 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：