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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,437 篇 会议
108 篇 期刊文献
3 册 图书

馆藏范围

3,548 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,425 篇 工学
- 2,335 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 335 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,527 篇 英文
20 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3548 条记录，以下是701-710 订阅

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

详细简洁

排序：

Towards a peer-to-peer framework for parallel and distributed computing

Towards a peer-to-peer framework for parallel and distribute...

引用

22nd International symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2010

作者： Senger, Luciano Jośe De Souza, Ḿarcio Augusto Foltran Jr., Dierone Cesar Departamento de Inforḿatica Universidade Estadual de Ponta Grossa Av. Gal. Carlos Cavalcanti 4748 CEP 84030-900 Ponta Grossa PR Brazil

ISBN: (纸本)9780769542164

This paper presents a framework for developing and executing parallel and distributed applications using the peer-to-peer computing model. The framework - called P2PComp - follows the main philosophy of the pure peer-to-peer model, since there is no hierarchy among the peers, all peers have the same functions and there is no central authority server responsible for the system organization. SPMD parallel applications can be implemented by extending the framework functionalities, which includes functions for starting and monitoring processes, searching resources and communicating by message passing. This paper presents a detailed description of the framework and examples of its utilization for building and executing parallel applications. The results obtained show that the framework can be effectively used for executing computational programs in a flexible peer-to-peer environment. © 2010 ieee.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

distributed landmark election and routing protocol for grid-based wireless sensor networks

Distributed landmark election and routing protocol for grid-...

引用

ieee International symposium on parallel and distributed processing With Applications

作者： Liang, Chiu-Kuo Lin, Jian-Da Dept. of Computer Science and Information Engineering Chung Hua University Hsinchu Taiwan

ISBN: (纸本)9780769541907

In wireless sensor networks, a well landmark-based routing protocol considers both the cost of initial construction and data routing. If there are holes (regions without any sensor) in the environment, it is reliable by electing some landmarks to assist data transmission, like HVC (Hexagonal Virtual Coordinate), which is a non-GPS devices supporting protocol. But it wastes some cost on flooding restrictively for constructing a virtual coordinates system by finding which nodes should be landmarks of the network. Besides, each node must maintain HVC chart that the relative coordinates among the landmarks in the network. Once there are significant amount of landmarks in the network, the resource usage of sensors will increase due to huge and complex HVC chart. However, based on HVC chart, a source node can find an auxiliary routing path (ARP) to indicate the direction of the journey from the source to the destination. In order to achieve a suitably virtual coordinates system, HVC must restrict transmission radius and the hops of flooding. If there are less landmarks in the network, that may also lose the meaning for assisting. In this paper, we propose a distributed landmark election and routing (LER) protocol to reduce the overall cost of construction and routing. Simulation results show that LER achieves a better solution in total consumption of construction and routing. © 2010 ieee.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

parallel de novo assembly of large genomes from high-throughput short reads

Parallel de novo assembly of large genomes from high-through...

引用

24th ieee International parallel and distributed processing symposium, IPDPS 2010

作者： Jackson, B.G. Regennitter, M. Yang, X. Schnable, P.S. Aluru, S. Department of Electrical and Computer Engineering Iowa State University Ames IA United States Department of Agronomy Iowa State University Ames IA United States

ISBN: (纸本)9781424464432

The advent of high-throughput short read technology is revolutionizing life sciences by providing an inexpensive way to sequence genomes at high coverage. Exploiting this technology requires the development of a de novo short read assembler, which is an important open problem that is garnering significant research effort. Current methods are largely limited to microbial organisms, whose genomes are two to three orders of magnitude smaller than complex mammalian and plant genomes. In this paper, we present the design and development of a parallel de novo short read assembler that can scale to large genomes with high coverage. Our approach is based on the string graph formulation. Input reads are mapped to short paths, and the genome is reconstructed as a superpath anchored by distance constraints inferred from read pairs. Our method can handle a mixture of multiple read sizes and multiple paired read distances. We present parallel algorithms for string graph construction, string graph compaction, graph based error detection and removal, and computing aggregate summarization of paired read links across graph edges. Using this, we navigate the final graph structure to reproduce large contiguous sequences from the underlying genome. We present a validation of our framework on experimental and simulated data from multiple known genomes and present scaling results on IBM Blue Gene/L. © 2010 ieee.

关键词： Mammals

来源：评论

学校读者我要写书评

暂无评论

Adaptive sampling-based profiling techniques for optimizing the distributed JVM runtime

Adaptive sampling-based profiling techniques for optimizing ...

引用

24th ieee International parallel and distributed processing symposium, IPDPS 2010

作者： Lam, King Tin Luo, Yang Wang, Cho-Li Department of Computer Science University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9781424464432

Extending the standard Java virtual machine (JVM) for cluster-awareness is a transparent approach to scaling out multithreaded Java applications. While this clustering solution is gaining momentum in recent years, efficient runtime support for fine-grained object sharing over the distributed JVM remains a challenge. The system efficiency is strongly connected to the global object sharing profile that determines the overall communication cost. Once the sharing or correlation between threads is known, access locality can be optimized by collocating highly correlated threads via dynamic thread migrations. Although correlation tracking techniques have been studied in some page-based sof Tware DSM systems, they would entail prohibitively high overheads and low accuracy when ported to fine-grained object-based systems. In this paper, we propose a lightweight sampling-based profiling technique for tracking inter-thread sharing. To preserve locality across migrations, we also propose a stack sampling mechanism for profiling the set of objects which are tightly coupled with a migrant thread. Sampling rates in both techniques can vary adaptively to strike a balance between preciseness and overhead. Such adaptive techniques are particularly useful for applications whose sharing patterns could change dynamically. The profiling results can be exploited for effective thread-to-core placement and dynamic load balancing in a distributed object sharing environment. We present the design and preliminary performance result of our distributed JVM with the profiling implemented. Experimental results show that the profiling is able to obtain over 95% accurate global sharing profiles at a cost of only a few percents of execution time increase for fine- to medium- grained applications. © 2010 ieee.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

distributed monitoring of conditional entropy for anomaly detection in streams

Distributed monitoring of conditional entropy for anomaly de...

引用

2010 ieee International symposium on parallel and distributed processing, Workshops and Phd Forum, IPDPSW 2010

作者： Arackaparambil, Chrisil Bratus, Sergey Brody, Joshua Shubina, Anna Dept. of Computer Science Dartmouth College Hanover NH 03755 United States

ISBN: (纸本)9781424465347

In this work we consider the problem of monitoring information streams for anomalies in a scalable and efficient manner. We study the problem in the context of network streams where the problem has received significant attention. Monitoring the empirical Shannon entropy of a feature in a network packet stream has previously been shown to be useful in detecting anomalies in the network traffic. Entropy is an information-theoretic statistic that measures the variability of the feature under consideration. Anomalous activity in network traffic can be captured by detecting changes in this variability. There are several challenges, however, in monitoring this statistic. Computing the statistic efficiently is non-trivial. Further, when monitoring multiple features, the streaming algorithms proposed previously would likely fail to keep up with the everincreasing channel bandwidth of network traffic streams. There is also the concern that an adversary could attempt to mask the effect of his attacks on variability by a mimicry attack disguising his traffic to mimic the distribution of normal traffic in the network, thus avoiding detection by an entropy monitoring sensor. Also, the high rate of false positives is a big problem with Intrusion Detection Systems, and the case of entropy monitoring is no different. In this work we propose a way to address the above challenges. First, we leverage recent progress in sketching algorithms to develop a distributed approach for computing entropic statistics accurately, at reasonable memory costs. Secondly, we propose monitoring not only regular entropy, but the related statistic of conditional entropy, as a more reliable measure in detecting anomalies. We implement our approach and evaluate it with real data collected at the link layer of an 802.11 wireless network. © 2010 ieee.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers

Algorithmic mechanisms for internet-based master-worker comp...

引用

24th ieee International parallel and distributed processing symposium, IPDPS 2010

作者： Anta, Antonio Fernández Georgiou, Chryssis Mosteiro, Miguel A. LADyR GSyC Universidad Rey Juan Carlos Spain Dept. of Computer Science University of Cyprus Cyprus Dept. of Computer Science Rutgers University Universidad Rey Juan Carlos United States

ISBN: (纸本)9781424464432

We consider Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of untrusted worker processors, and collects their responses;examples of such computations are the "@home" projects such as SETI. Prior work dealing with Internet-based task computations has either considered only rational, or only malicious and altruistic workers. Altruistic workers always return the correct result of the task, malicious workers always return an incorrect result, and rational workers act based on their self-interest. However, in a massive computation platform, such as the Internet, it is expected that all three type of workers coexist. Therefore, in this work we study Internet-based master-worker computations in the presence of Malicious, Altruistic, and Rational workers. A stochastic distribution of the workers over the three types is assumed. Considering all the three types of workers renders a combination of game-theoretic and classical distributed computing approaches to the design of mechanisms for reliable Internet-based computing. Indeed, in this work, such an algorithmic mechanism that makes use of realistic incentives to obtain the correct task result with a parametrized probability is designed. Only when necessary, the incentives are used to force the rational players to a certain equilibrium (which forces the workers to be truthful) that overcomes the attempts of the malicious workers to deceive the master. Finally, the mechanism is analyzed in two realistic Internet-based master-worker applications. This work is an example of how game theory can be used as a tool to formalize and solve a practical distributed Computing problem such as Internet super computing. ©2010 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing in parallel KD-Tree k-Means

Dynamic load balancing in parallel KD-Tree k-Means

引用

10th ieee International Conference on Computer and Information Technology, CIT-2010, 7th ieee International Conference on Embedded Software and Systems, ICESS-2010, 10th ieee Int. Conf. Scalable Computing and Communications, ScalCom-2010

作者： Di Fatta, Giuseppe Pettinger, David School of Systems Engineering University of Reading Whiteknights Reading Berkshire RG6 6AY United Kingdom

ISBN: (纸本)9780769541082

One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting geometrical constraints and an efficient data structure, notably a multi-dimensional binary search tree (KD-Tree). These techniques allow to reduce the number of distance computations the algorithm performs at each iteration. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient k-Means variants in parallel computing environments. In this work, we provide a parallel formulation of the KD-Tree based k-Means algorithm for distributed memory systems and address its load balancing issue. Three solutions have been developed and tested. Two approaches are based on a static partitioning of the data set and a third solution incorporates a dynamic load balancing policy. © 2010 ieee.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Exploiting the forgiving nature of applications for scalable parallel execution

Exploiting the forgiving nature of applications for scalable...

引用

24th ieee International parallel and distributed processing symposium, IPDPS 2010

作者： Meng, Jiayuan Raghunathan, Anand Chakradhar, Srimat Byna, Surendra NEC Laboratories America Princeton NJ United States Department of Computer Science University of Virginia Charlottesville VA United States School of Electrical and Computer Engineering Purdue University West Lafayette IN United States

ISBN: (纸本)9781424464432

It is widely believed that most Recognition and Mining (RM) workloads can easily take advantage of parallel computing platforms because these workloads are data-parallel. Contrary to this popular belief, we present RM workloads for which conventional parallel implementations scale poorly on multi-core platforms. We identify off-chip memory transfers and overheads in the parallel runtime library as the primary bottlenecks that limit speedups to be well below the ideal linear speedup expected for data-parallel workloads. To achieve improved parallel scalability, we identify and exploit several interesting properties of RM workloads - sparsity of model updates, low spatial locality among model updates, presence of insignificant computations, and the inherently self-healing nature of these algorithms in the presence of errors. We leverage these domain-specific characteristics to improve parallel scalability in two major ways. First, we utilize data dependency relaxation to simultaneously execute multiple training iterations in parallel, thereby increasing the granularity of the parallel tasks and significantly lowering the run-time overheads of fine-grained threading. Second, we strategically drop selected computations that are insignificant to the accuracy of the final result, but account for a disproportionately large amount of off-chip (memory and coherence) traffic. Through the application of the proposed techniques, we show that much higher speedups are possible on multi-core platforms for two important RM applications - document search using semantic indexing, and eye detection in images using generalized learning vector quantization. On an 8-core platform, we achieve application speedups of 5.5× and 7.3× compared to sequential implementations. Compared to conventional parallel implementations of these applications using Intel's TBB, the proposed techniques result in 4.3× and 4.9× improvements. Although the optimized parallel implementations are not numerically eq

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

IPDPS 2009 - proceedings of the 2009 ieee International parallel and distributed processing symposium: Preface

2009 International Conference on Network and Service Securit...

引用

2009 International Conference on Network and Service Security, N2S 2009 2009年 i页

作者： Badra, Mohamad Sklavos, Nicolas LIMOS Laboratory CNRS France Technological Educational Institute Patras Greece

来源：评论

学校读者我要写书评

暂无评论

Exploiting parallelism of MPEG-4 decoder with dataflow programming on multicore processor

Exploiting parallelism of MPEG-4 decoder with dataflow progr...

引用

ieee International symposium on parallel and distributed processing With Applications

作者： Chen, Zhong-Ho Chen, Ta-Chun Chien, Jung-Yin Su, Alvin Shieh, Ce-Kuen Dept. of CSIE National Cheng-Kung of University Tainan Taiwan Dept. of EE National Cheng-Kung of University Tainan Taiwan

ISBN: (纸本)9780769541907

Multicore processor provides large computation capability but also involves the complicate parallel programming. One of major considerations in parallel programming is the performance. Traditional design methodologies which usually start a design on a selected platform spend a lot of effort and time on tuning performance and debugging. When platform is changed even with different number of cores, considerable redesign effort is required. Hence a flexible design methodology is necessary. In this paper, a design methodology is presented for video codec, by using MPEG-4 SP decoder as an example, on multicore processor. The parallelisms of MPEG-4 decoder are discussed and exposed with the dataflow model. The dataflow model provides a high-level abstraction of underlying hardware. Computation and communication of MPEG-4 decoder are separated and represented as modules and channels, respectively. It is possible to synthesize the model targeting to either dedicate hardware or software on multiprocessor. To map the high level dataflow model to Cell processor, the mapping flow, including offline profiling, task allocation and runtime libraries, are developed. According to the profiling results, the allocation algorithm could allocate tasks on multiprocessors as balanced as possible. An efficient synchronization mechanism on Cell processor is also proposed. We also discuss the impact of the model and the mapping flow corresponding to decoding speed. The results show that the proposed methodology gets considerable performance boost when the number of cores is increased. © 2010 ieee.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 67 68 69 70 71 72 73 74 75 76 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：