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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,343 篇 会议
44 篇 期刊文献
18 册 图书

馆藏范围

1,405 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,075 篇 工学
- 1,024 篇 计算机科学与技术...
- 463 篇 软件工程
- 189 篇 电气工程
- 99 篇 信息与通信工程
- 49 篇 控制科学与工程
- 34 篇 机械工程
- 30 篇 电子科学与技术（可...
- 19 篇 生物工程
- 13 篇 动力工程及工程热...
- 13 篇 安全科学与工程
- 12 篇 网络空间安全
- 11 篇 仪器科学与技术
- 10 篇 化学工程与技术
- 9 篇 交通运输工程
- 9 篇 生物医学工程（可授...
- 8 篇 石油与天然气工程
- 6 篇 力学（可授工学、理...
222 篇 理学
- 156 篇 数学
- 32 篇 系统科学
- 26 篇 生物学
- 22 篇 物理学
- 21 篇 统计学（可授理学、...
- 17 篇 化学
120 篇 管理学
- 84 篇 管理科学与工程(可...
- 46 篇 工商管理
- 44 篇 图书情报与档案管...
16 篇 经济学
- 16 篇 应用经济学
14 篇 法学
- 12 篇 社会学
10 篇 医学
- 8 篇 临床医学
6 篇 教育学
- 6 篇 教育学
5 篇 农学
3 篇 文学
1 篇 军事学

主题

91 篇 distributed comp...
85 篇 parallel process...
70 篇 grid computing
61 篇 cloud computing
49 篇 concurrent compu...
47 篇 computational mo...
46 篇 computer network...
45 篇 distributed comp...
38 篇 parallel computi...
37 篇 scalability
35 篇 computer archite...
31 篇 costs
30 篇 high performance...
30 篇 distributed data...
29 篇 algorithm design...
29 篇 parallel process...
29 篇 hardware
27 篇 computer science
27 篇 application soft...
27 篇 parallel program...

机构

7 篇 department of co...
6 篇 institute of com...
5 篇 oak ridge natl l...
5 篇 department of co...
4 篇 univ warwick dep...
4 篇 natl univ def te...
4 篇 chinese acad sci...
4 篇 oak ridge natl l...
4 篇 department of co...
4 篇 university of te...
3 篇 nanyang technol ...
3 篇 institute of par...
3 篇 school of engine...
3 篇 argonne natl lab...
3 篇 univ calif davis...
3 篇 univ manchester ...
3 篇 key laboratory o...
3 篇 purdue univ sch ...
3 篇 hiroshima univ d...
3 篇 cnrs laas 7 ave ...

作者

7 篇 jiannong cao
6 篇 el-baz didier
6 篇 wang huaimin
6 篇 rothermel kurt
5 篇 jack dongarra
5 篇 yin gang
4 篇 koldehofe boris
4 篇 li maozhen
4 篇 wang tao
4 篇 jeong chang-sung
4 篇 vlassov v
4 篇 kacsuk peter
4 篇 labarta jesus
4 篇 schulze bruno
4 篇 jin hai
4 篇 ramachandran uma...
3 篇 ould-khaoua moha...
3 篇 fahringer thomas
3 篇 taura kenjiro
3 篇 ito yasuaki

语言

1,394 篇 英文
5 篇 其他
4 篇 俄文
1 篇 西班牙文
1 篇 中文

检索条件"任意字段=7th International Symposium on Parallel and Distributed Computing"

共 1405 条记录，以下是1021-1030 订阅

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

详细简洁

排序：

Evaluating parallel algorithms for solving sylvester-type matrix equations:: Direct transformation-based versus iterative matrix-sign-function-based methods

引用

7th international Workshop on State of the Art in Scientific computing

作者： Granat, Robert Kagstrom, Bo Umea Univ Dept Comp Sci SE-90187 Umea Sweden Umea Univ HPC2N SE-90187 Umea Sweden

ISBN: (纸本)3540290672

Recent ScaLAPACK-style irnplementations of the Bartels-Stewart method and the iterative matrix-sign-function-based method for solving continuous-time Sylvester matrix equations are evaluated with respect to generality of use, execution time and accuracy of computed results. the test problems include well-conditioned as well as ill-conditioned Sylvester equations. A method is considered more general if it can effectively solve a larger set of problems. Ill-conditioning is measured with respect to the separation of the two matrices in the Sylvester operator. Experiments carried out on two different distributed memory machines show that the parallel explicitly blocked Bartels-Stewart algorithm can solve more general problems and delivers far more accuracy for ill-conditioned problems. It is also Lip to four times faster for large enough problems on the most balanced parallel platform (IBM SP), while the parallel iterative algorithm is almost always the fastest of the two oil the less balanced platform (HPC2N Linux Super Cluster).

关键词： Sylvester matrix equation continuous-time Bartels-Stewart method explicit blocking GEMM-based level 3 BLAS matrix sign function c-stable matrices Newton iteration ScaLAPACK PSLICOT

来源：评论

学校读者我要写书评

暂无评论

Robust distributed node localization with error management 06

Robust distributed node localization with error management

引用

7th ACM international symposium on Mobile Ad Hoc Networking and computing, MOBIHOC 2006

作者： Liu, Juan Zhang, Ying Zhao, Feng Palo Alto Research Center United States Microsoft Research

ISBN: (纸本)1595933689

Location knowledge of nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks. this paper introduces a novel iterative method ILS for node localization starting with a relatively small number of anchor nodes in a large network. At each iteration, nodes are localized using a least-squares based algorithm. the computation is lightweight, fast, and any-time. To prevent error from propagating and accumulating during the iteration, the error control mechanism of the algorithm uses an error registry to select nodes that participate in the localization, based on their relative contribution to the localization accuracy. Simulation results have shown that the active selection strategy significantly mitigates the effect of error propagation. the algorithm has been tested on a network of Berkeley Mica2 motes with ultrasound TOA ranging devices. We have compared the algorithm with more global methods such as MDS-MAP and SDP-based algorithm both in simulation and on real hardware. the iterative localization achieves comparable location accuracy in both cases, compared to the more global methods, and has the advantage of being fully decentralized. Copyright 2006 ACM.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

distributed localization using noisy distance and angle information 06

Distributed localization using noisy distance and angle info...

引用

7th ACM international symposium on Mobile Ad Hoc Networking and computing, MOBIHOC 2006

作者： Basu, Amitabh Mitchell, Joseph S.B. Gao, Jie Sabhnani, Girishkumar Stony Brook University Stony Brook NY 11794-4400 United States Stony Brook University Stony Brook NY 11794-3600 United States

ISBN: (纸本)1595933689

Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local information (e.g. distances, angles, orientations etc.), the goal is to reconstruct the global geometry of the network. In this paper, we study the problem of localization with noisy distance and angle information. With no noise at all, the localization problem with both angle (with orientation) and distance information is trivial. However, in the presence of even a small amount of noise, we prove that the localization problem is NP-hard. Localization with accurate distance information and relative angle information is also hard. these hardness results motivate our study of approximation schemes. We relax the non-convex constraints to approximating convex constraints and propose linear programs (LP) for two formulations of the resulting localization problem, which we call the weak deployment and strong deployment problems. these two formulations give upper and lower bounds on the location uncertainty respectively: No sensor is located outside its weak deployment region, and each sensor can be anywhere in its strong deployment region without violating the approximate distance and angle constraints. though LP-based algorithms are usually solved by centralized methods, we propose distributed, iterative methods, which are provably convergent to the centralized algorithm solutions. We give simulation results for the distributed algorithms, evaluating the convergence rate, dependence on measurement noises, and robustness to link dynamics. Copyright 2006 ACM.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

A secure migration mechanism of mobile agents under mobile agent environments

引用

7th international Workshop on State of the Art in Scientific computing

作者： Jeong, Dongwon Kim, Young-Gab Kim, Young-Shil Lee, Lee-Sub Park, Soo-Hyun Baik, Doo-Kwon Kunsan Natl Univ Dept Informat & Stat Gunsan 573701 Jeolabuk Do South Korea Korea Univ Dept Comp Sci & Engn Seoul 136701 South Korea Daelim Coll Div Comp Sci & Informat Anayang Si 431715 Kyounggi Do South Korea Kumoh Natl Inst Technol Dept Comp Engn Gumi Gyeongbuk South Korea Kookmin Univ Sch Business IT Seoul 136701 South Korea

ISBN: (纸本)3540290672

Although mobile agent paradigm provides many advantages for distributed computing, several security issues of the mobile agent paradigm remain as the most import difficulty that should be solved to increase its application. One of the most important mobile agent security issues is that mobile agents securely transfer from a host to other hosts. Until now, many mobile agent systems have been developed, but those systems do not support mechanisms to provide for secure transmission of mobile agents or have several problems. this paper proposes an integrity mechanism that mobile agents can migrate to other hosts securely. this mechanism is independent on specific security frameworks, so it can be used easily under various mobile agent environments.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

A model analysis of a distributed monitoring system using a multi-formalism approach

引用

7th international Conference on Applied parallel computing, PARA 2004

作者： Iacono, Mauro Marrone, Stefano Mazzocca, Nicola Moscato, Francesco Vittorini, Valeria Italy Università di Napoli Federico II Dipartimento di Informatica e Sistemistica Napoli Italy

ISBN: (纸本)3540290672

Automated applications for environmental monitoring are an important aid for security and safety of buildings and for civil (domotic) and industrial use. the relevance of such applications is sound, and ensuring a correct fulfilling of the mission goals implies the need forperformability and dependability requirements. For reasons of cost, flexibility and efficiency, a good candidate architecture is based on mobile agents capable of real time operation on a network of intelligent sensors, in addition of normal monitoring tasks. Design and tuning of these systems is a very hard task. In this paper a multi-formalism approach based on model-checking techniques for Timed Automata and Timed Petri Nets is presented to model a real-time-mobile-agents based monitoring system. With this approach, different component of the system may be modeled by using the most suitable modeling formalism to cope with the need for modeling agent behaviors, real-time constraints and the load of the overall system. © Springer-Verlag Berlin Heidelberg 2006.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Web services interface to run protein sequence tools on grid, testcase of protein sequence alignment

引用

7th international symposium on Biological and Medical Data Analysis

作者： Blanchet, Christophe Combet, Christophe Daric, Vladimir Deleage, Gilbert Univ Lyon 1 CNRS UMR 5086 IBCP IFR 128 7 Passage Vercors F-69007 Lyon France

ISBN: (纸本)9783540680635

Bioinformatics analysis of data produced by high-throughput biology, for instance genome projects, is one of the major challenges for the next years. Some of the requirements of this analysis are to access up-to-date databanks (of sequences, patterns, 3D structures, etc.) and relevant algorithms (for sequence similarity, multiple alignment, pattern scanning, etc.). GPS@ is a Web portal devoted to bioinformatics applications on the grid (Grid Protein Sequence Analysis, http://***). GPS@ is the grid release of the NPS@ bioinformatics portal, and is wrapping the mechanisms required for submitting bioinformatics analyses on the grid infrastructure. For example, we have put online two multiple alignment Web Services that are submitting the computing job on a remote grid environment. One is accessible through a classical Web interface by using a simple Web browser;the other one can be used through a SOAP and workflow client such as Taverna or Triana. these Web services can process the submitted alignment on two different computing environments: a local and classical one which is a cluster of 30 CPUs, but we are also providing biologists with a large-scale distributed one: the grid platform of the EU-EGEE project (more than 20,000 CPUs available at the European scale).

关键词： bioinformatics grid computing Web services protein sequence analysis

来源：评论

学校读者我要写书评

暂无评论

Improved Reflection and Transmission Coefficients of Frequency Selective Surfaces

Improved Reflection and Transmission Coefficients of Frequen...

引用

international symposium on Antennas, Propagation and EM theory (ISAPE)

作者： Fanji Mneg Rugui Yang Huaqing Xiao Institute of Electromagnetics Southwest Jiaotong University Chengdu China

An improved reflection and transmission coefficients are developed for treating electromagnetic problems of scattering from frequency selective surfaces (FSS). the incident field is decomposed into parallel and perpendicular component to the plane of incidence [1] , correspond to reflection and transmission coefficients are given, which are simple formally and applicable to all incidence.

关键词： Frequency selective surfaces Electromagnetic reflection Electromagnetic scattering Dielectrics Concurrent computing Electric potential Permeability Permittivity Erbium Azimuthal component

来源：评论

学校读者我要写书评

暂无评论

Phylospaces: reconstructing evolutionary trees in tuple space 06

Phylospaces: reconstructing evolutionary trees in tuple spac...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： M.L. Smith T.L. Williams Department of Computer Science Colby College Waterville ME USA Department of Computer Science Texas A and M University College Station TX USA

ISBN: (纸本)9781424400546

Phylospaces is a novel framework for reconstructing evolutionary trees in tuple space, a distributed shared memory that permits processes to communicate and coordinate with each other. Our choice of tuple space as a concurrency model is somewhat unusual, given the prominence and success of pure message passing models, such as MPI. We use phylospaces to devise cooperative Rec-I-DCM3, a population-based strategy for navigating tree space. Cooperative Rec-I-DCM3 is based on Rec-I-DCM3, the fastest sequential algorithm under maximum parsimony. We compare the performance of the algorithms on two datasets consisting of 2,000 and 7,769 taxa, respectively. Our results demonstrate that cooperative Rec-I-DCM3 outperforms its sequential counterpart by at least an order of magnitude

关键词： Phylogeny Computer science Message passing Organisms History Concurrent computing Educational institutions Navigation Genetic mutations Binary trees

来源：评论

学校读者我要写书评

暂无评论

DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks 06

DRAND: distributed randomized TDMA scheduling for wireless a...

引用

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing

作者： Injong Rhee Ajit Warrier Jeongki Min Lisong Xu North Carolina State University Raleigh NC University of Nebraska Lincoln Nebraska

ISBN: (纸本)9781595933683

this paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(δ) time and message complexity where δ is the maximum size of a two-hop neighborhood in a wire-less network while message complexity remains O(δ), assuming that message delays can be bounded by an unknown *** is the first fully distributed version of RAND. the algorithm is suitable for a wireless network where most nodes do not move,such as wireless mesh networks and wireless sensor *** implement the algorithm in TinyOS and demonstrate its performance in a real testbed of Mica2 nodes. the algorithm does not require any time synchronization and is shown to be effective in adapting to local topology changes without incurring global overhead in the *** of these features, it can also be used even for other scheduling problems such as frequency or code scheduling (for FDMA or CDMA) or local identifier assignment for wireless networks where time synchronization is not enforced.

关键词： medium access control network performance wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Mobile backbone networks --: construction and maintenance 06

Mobile backbone networks --: construction and maintenance

引用

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing

作者： Anand Srinivas Gil Zussman Eytan Modiano Massachusetts Institute of Technology

ISBN: (纸本)9781595933683

We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than *** such networks,the more capable nodes can serve as Mobile Backbone Nodes and provide a backbone over which end-to-end communication can take place. Our approac consists of controlling the mobility of the Backbone Nodes in order to maintain connectivity. We formulate the problem of minimizing the number of backbone nodes and refer to it as the Connected Disk Cover *** show that it can be decomposed into the Geometric Disk Cover (GDC)problem and the Steiner Tree Problem wit Minimum Number of Steiner Points (STP-MSP). We prove that if these sub-problems are solved separately by γ- and δ- approximation algorithms, the approximation ratio of t e joint solution is γ + δ. then, we focus on the two subproblems and present a number of distributed approximation algorithms that maintain a solution to the GDC problem under mobility A new approach to the solution of the STP-MSP is also described. We show that this approach can be extended in order to obtain a joint approximate solution to the Connected Disk Cover problem. Finally, we evaluate the performance of the algorithms via simulation and show that the proposed GDC algorithms perform very well under mobility and that the new approac for the joint solution can significantly reduce the number of required Mobile Backbone Nodes.

关键词： approximation algorithms wireless networks controlled mobility distributed algorithms disk cover

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共141页 << < 99 100 101 102 103 104 105 106 107 108 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：