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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,440 篇 会议
60 篇 期刊文献
17 册 图书

馆藏范围

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

日期分布

学科分类号

1,080 篇 工学
- 1,017 篇 计算机科学与技术...
- 378 篇 软件工程
- 174 篇 电气工程
- 102 篇 信息与通信工程
- 49 篇 控制科学与工程
- 48 篇 电子科学与技术（可...
- 17 篇 动力工程及工程热...
- 16 篇 机械工程
- 14 篇 网络空间安全
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 8 篇 材料科学与工程（可...
- 7 篇 建筑学
- 7 篇 土木工程
- 7 篇 石油与天然气工程
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 仪器科学与技术
- 6 篇 安全科学与工程
220 篇 理学
- 172 篇 数学
- 33 篇 系统科学
- 24 篇 物理学
- 24 篇 统计学（可授理学、...
- 15 篇 生物学
121 篇 管理学
- 84 篇 管理科学与工程(可...
- 49 篇 图书情报与档案管...
- 32 篇 工商管理
14 篇 医学
- 14 篇 临床医学
8 篇 教育学
- 8 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
7 篇 法学
4 篇 农学

主题

127 篇 distributed comp...
106 篇 distributed comp...
95 篇 grid computing
91 篇 concurrent compu...
73 篇 parallel process...
66 篇 computer science
60 篇 application soft...
60 篇 computer archite...
55 篇 computer network...
50 篇 cloud computing
46 篇 parallel algorit...
46 篇 computational mo...
43 篇 parallel process...
36 篇 hardware
35 篇 delay
32 篇 costs
30 篇 real time system...
30 篇 high performance...
29 篇 workstations
28 篇 algorithm design...

机构

8 篇 shanghai jiao to...
8 篇 national laborat...
6 篇 argonne natl lab...
4 篇 national laborat...
4 篇 mathematics and ...
3 篇 tech univ munich...
3 篇 rhein westfal th...
3 篇 ibm thomas j. wa...
3 篇 oak ridge nation...
3 篇 rwth aachen univ...
3 篇 univ sci & techn...
3 篇 high performance...
3 篇 argonne natl lab...
3 篇 school of comput...
3 篇 pacific northwes...
3 篇 university of so...
3 篇 czestochowa univ...
3 篇 inst rech inform...
3 篇 department of co...
3 篇 university of te...

作者

7 篇 boukerche azzedi...
7 篇 yang laurence t.
5 篇 tudruj marek
5 篇 yang chao-tung
4 篇 wang jing
4 篇 s. ranka
4 篇 jack dongarra
4 篇 berenbrink petra
4 篇 li ml
4 篇 cristea valentin
4 篇 yong dou
4 篇 buyya rajkumar
4 篇 roman wyrzykowsk...
3 篇 see s
3 篇 fahringer thomas
3 篇 ertl christoph
3 篇 cong guojing
3 篇 zhang lei
3 篇 kamei sayaka
3 篇 vishwanath venka...

语言

1,493 篇 英文
17 篇 其他
7 篇 中文

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

共 1517 条记录，以下是831-840 订阅

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

详细简洁

排序：

Study on Near distributed Dynamic Model of a Multifountain-and-multiconfluent Network System of Steam Main-pipeline and parallel Coursing Units

Study on Near Distributed Dynamic Model of a Multifountain-a...

引用

the 5th international symposium on Measurement Techniques for Multiphase Flows(5th ISMTMF)

作者： Pan Lei Shen Jiong School of Energy and Environment,Southeast University,Nanjing,China

According to the deficiency of the prior modeling methods on main-pipeline system,the paper advances a near distributed modeling way based on subsection,combination and delamination for parallel coursing units and main-pipehne system to fully show its distributed dynamics by an easy-simulated mode of ***,a principle is established to plot out the main-pipeline into some short pipe-sections between each pair of fountain/confluent points. Secondly,a near distributed decouphng transfer function matrix model without steady error for each pipe-section is built by rationally approximate deduction and then joined with the dynamic models of the fountain/confluent at the two ends of the pipe-section to form the near distributed model of each ***,a smooth arithmetic is adopted to joint all the conterminous subsections into a whole system *** modeling method above decreases the dimension of matter space and integrates more influence factors on the systern dynamic characteristics into the built model,such as pipe length,diameter and the thermodynamics of working fluid,so it more particularly reflects the distributed dynamic characteristics of a multifountain-and-multiconfluent network system of steam main-pipeline and parallel coursing units than before,and can act well as the simulated research object for advanced main-pipeline system control arithmetic and distributed control technology or even validates *** simulation experiments have been done and produced good results to prove the validity of the modeling method.

关键词： parallel coursing unit dynamic mathematic model distributed parameter decoupling control multifountain-and-multiconfluent networks

来源：评论

学校读者我要写书评

暂无评论

Remove the memory wall: from performance modeling to architecture optimization 06

Remove the memory wall: from performance modeling to archite...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Xian-He Sun Department of Computer Science Illinois Institute of Technology USA

ISBN: (纸本)9781424400546

Summary form only given. Data access is a known bottleneck of high performance computing (HPC). the prime sources of this bottleneck are the performance gap between the processor and memory storage and the large memory requirements of ever-hungry applications. Although advanced memory hierarchies and parallel file systems have been developed in recent years, they only provide high bandwidth for contiguous, well-formed data streams, performing poorly for accessing small, noncontiguous data. Unfortunately, many HPC applications make a large number of requests for small and noncontiguous pieces of data, as do high-level I/O libraries such as HDF-5. the problematic memory wall remains after years of study and, in fact, is becoming the most important issue of HPC. We propose a new I/O architecture for HPC. Unlike traditional I/O designs where data is stored and retrieved by request, our architecture is based on a novel "server-push" model in which a data access server proactively pushes data from a file server to the compute node's memory or to it's cache directly based on the architecture design. Simulation results show that with the new approach the cache hit rates increase well above 90% for various benchmark applications that are notorious for poor cache performance. Performance evaluation is the driven force of the push-based model. Mechanisms of performance modeling, evaluation, and optimization are applied to data access pattern identification, prefetching algorithm design, data replacement strategy development, and architecture optimization to enable the "server-push" model. Our current success illustrates the power and unique role of performance evaluation in computing

关键词： Computer architecture File servers Design optimization High performance computing File systems Bandwidth Libraries Information retrieval Computational modeling Prefetching

来源：评论

学校读者我要写书评

暂无评论

Random distributed multiresolution representations with significance querying

Random distributed multiresolution representations with sign...

引用

international symposium on Information Processing in Sensor Networks (IPSN)

作者： W. Wang K. Ramchandran Department of Electrical Engineering and Computer Sciences University of California Berkeley USA

We propose random distributed multiresolution representations of sensor network data, so that the most significant encoding coefficients are easily accessible by querying a few sensors, anywhere in the network. Less significant encoding coefficients are available by querying a larger number of sensors, local to the region of interest. Significance can be defined in a multiresolution way, without any prior knowledge of the source data, as global summaries versus local details. Alternatively, significance can be defined in a data-adaptive way, as large differences between neighboring data values. We propose a distributed encoding algorithm that is robust to arbitrary wireless communication connectivity graphs, where links can fail or change with time. this randomized algorithm allows distributed computation that does not require strict global coordination or awareness of network connectivity at individual sensors. Because computations involve sensors in local neighborhoods of the communication graph, they are communication-efficient. Our framework uses local interaction among sensors to enable flexible information retrieval at the global level

关键词： Signal processing algorithms Encoding Robustness Signal resolution Computer networks distributed computing Wireless sensor networks Spatial resolution Wireless communication Permission

来源：评论

学校读者我要写书评

暂无评论

the low power energy aware processing (LEAP) embedded networked sensor system

The low power energy aware processing (LEAP) embedded networ...

引用

international symposium on Information Processing in Sensor Networks (IPSN)

作者： D. Mclntire K. Ho B. Yip A. Singh W. Wu W.J. Kaiser Electrical Engineering Department University of California Los Angeles Los Angeles CA USA

A broad range of embedded networked sensor (ENS) systems for critical environmental monitoring applications now require complex, high peak power dissipating sensor devices, as well as on-demand high performance computing and high bandwidth communication. Embedded computing demands for these new platforms include support for computationally intensive image and signal processing as well as optimization and statistical computing. To meet these new requirements while maintaining critical support for low energy operation, a new multiprocessor node hardware and software architecture, low power energy aware processing (LEAP), has been developed. the LEAP architecture integrates fine-grained energy dissipation monitoring and sophisticated power control scheduling for all subsystems including sensor subsystems. this paper also describes a new distributed node testbed demonstrating that by exploiting high high energy efficiency components and enabling proper on-demand scheduling, the LEAP architecture may meet both sensing performance and energy dissipation objectives for a broad class of applications

关键词： Sensor systems Embedded computing Sensor systems and applications Monitoring Energy dissipation High performance computing Bandwidth Signal processing Hardware Software architecture

来源：评论

学校读者我要写书评

暂无评论

Geographic gossip: efficient aggregation for sensor networks

Geographic gossip: efficient aggregation for sensor networks

引用

international symposium on Information Processing in Sensor Networks (IPSN)

作者： A.G. Dimakis A.D. Sarwate M.J. Wainwright Department of EECS University of California Berkeley USA Department of EECS Department of Statistics University of California Berkeley USA

Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain environments. However, gossip algorithms can waste significant energy by essentially passing around redundant information multiple times. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is caused by slow mixing times of random walks on those graphs. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing a simple resampling method, we can demonstrate substantial gains over previously proposed gossip protocols. In particular, for random geometric graphs, our algorithm computes the true average to accuracy 1/n a using O(n 1.5 radic(logn)) radio transmissions, which reduces the energy consumption by a radic(n/logn) factor over standard gossip algorithms

关键词： Peer to peer computing Wireless sensor networks Solid modeling Protocols Energy consumption Temperature sensors distributed computing Permission Statistics Robustness

来源：评论

学校读者我要写书评

暂无评论

Shared receive queue based scalable MPI design for InfiniBand clusters 06

Shared receive queue based scalable MPI design for InfiniBan...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： S. Sur Lei Chai Hyun-Wook Jin D.K. Panda Network-Based Computing Laboratory The Ohio State University USA

ISBN: (纸本)9781424400546

Clusters of several thousand nodes interconnected with InfiniBand, an emerging high-performance interconnect, have already appeared in the Top 500 list. the next-generation InfiniBand clusters are expected to be even larger with tens-of-thousands of nodes. A high-performance scalable MPI design is crucial for MPI applications in order to exploit the massive potential for parallelism in these very large clusters. MVAPICH is a popular implementation of MPI over InfiniBand based on its reliable connection oriented model. the requirement of this model to make communication buffers available for each connection imposes a memory scalability problem. In order to mitigate this issue, the latest InfiniBand standard includes a new feature called shared receive queue (SRQ) which allows sharing of communication buffers across multiple connections. In this paper, we propose a novel MPI design which efficiently utilizes SRQs and provides very good performance. Our analytical model reveals that our proposed designs take only 1/10 th the memory requirement as compared to the original design on a cluster sized at 16,000 nodes. Performance evaluation of our design on our 8-node cluster shows that our new design was able to provide the same performance as the existing design while requiring much lesser memory. In comparison to tuned existing designs our design showed a 20% and 5% improvement in execution time of NAS Benchmarks (Class A) LU and SP, respectively. the high performance Linpack was able to execute a much larger problem size using our new design, whereas the existing design ran out of memory

关键词： Sun Large-scale systems Computer networks Laboratories Computer science parallel processing Scalability Communication standards Analytical models Radio access networks

来源：评论

学校读者我要写书评

暂无评论

SmartGossip: an improved randomized broadcast protocol for sensor networks

SmartGossip: an improved randomized broadcast protocol for s...

引用

international symposium on Information Processing in Sensor Networks (IPSN)

作者： A.V. Kini V. Veeraraghavan N. Singhal S. Weber Department of ECE Drexel University Philadelphia PA USA

We investigate four performance metrics for randomized broadcast protocols on sensor networks: the fraction of nodes that receive the message (coverage), the number of first-time receivers per transmission (energy efficiency), the node-average normalized time till reception (per hop latency), and the average number of control messages per node (overhead). Our focus is to evaluate the extent to which the exchange of local information (either active or passive) can improve protocol performance. To this end, we study via simulation three protocols from the literature that exploit local information and compare their performance against the well known GOSSIP1 protocol, which does not employ any local information in making transmission decisions. Our findings are that i) local information is of course quite valuable in increasing protocol performance, and ii) it is possible to obtain high coverage and efficiency but one must then incur either increased delay or increased overhead. We study the strengths and weaknesses of the above protocols and propose the new SmartGossip protocol, which combines several ideas from the above protocols, as well as several new mechanisms, to achieve superior performance

关键词： Broadcasting Delay Permission Routing protocols Measurement Energy efficiency Computer networks distributed computing Algorithm design and analysis Sensor phenomena and characterization

来源：评论

学校读者我要写书评

暂无评论

Securing the Deluge network programming system

Securing the Deluge network programming system

引用

international symposium on Information Processing in Sensor Networks (IPSN)

作者： P.K. Dutta J.W. Hui D.C. Chu D.E. Culler Computer Science Division University of California Berkeley Berkeley CA USA

A number of multi-hop, wireless, network programming systems have emerged for sensor network retasking but none of these systems support a cryptographically-strong, public-key-based system for source authentication and integrity verification. the traditional technique for authenticating a program binary, namely a digital signature of the program hash, is poorly suited to resource-contrained sensor nodes. Our solution to the secure programming problem leverages authenticated streams, is consistent with the limited resources of a typical sensor node, and can be used to secure existing network programming systems. Under our scheme, a program binary consists of several code and data segments that are mapped to a series of messages for transmission over the network. An advertisement, consisting of the program name, version number, and a hash of the very first message, is digitally signed and transmitted first. the advertisement authenticates the first message, which in turn contains a hash of the second message. Similarly, the second message contains a hash of the third message, and so on, binding each message to the one logically preceding it in the series through the hash chain. We augmented the Deluge network programming system with our protocol and evaluated the resulting system performance

关键词： Wireless sensor networks Computer security Spread spectrum communication Communication system security Sensor systems Cryptography Computer networks distributed computing Wireless application protocol Permission

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient data representation and routing for wireless sensor networks based on a distributed wavelet compression algorithm

Energy-efficient data representation and routing for wireles...

引用

international symposium on Information Processing in Sensor Networks (IPSN)

作者： A. Ciancio S. Pattem A. Ortega B. Krishnamachari Department of Electrical Engineering-Systems University of Southern California Los Angeles CA USA

We address the problem of energy consumption reduction for wireless sensor networks, where each of the sensors has limited power and acquires data that should be transmitted to a central node. the final goal is to have a reconstructed version of the data measurements at the central node, with the sensors spending as little energy as possible, for a given data reconstruction accuracy. In our scenario, sensors in the network have a choice of different coding schemes to achieve varying levels of compression. the compression algorithms considered are based on the lifting factorization of the wavelet transform, and exploit the natural data flow in the network to aggregate data by computing partial wavelet coefficients that are refined as data flows towards the central node. the proposed algorithm operates by first selecting a routing strategy through the network. then, for each route, an optimal combination of data representation algorithms i.e. assignment at each node, is selected. A simple heuristic is used to determine the data representation technique to use once path merges are taken into consideration. We demonstrate that by optimizing the coding algorithm selection the overall energy consumption can be significantly reduced when compared to the case when data is just quantized and forwarded to the central node. Moreover, the proposed algorithm provides a tool to compare different routing techniques and identify those that are most efficient overall, for given node locations. We evaluate the algorithm using both a second-order autoregressive (AR) model and empirical data from a real wireless sensor network deployment

关键词： Energy efficiency Routing Wireless sensor networks Compression algorithms Energy consumption Energy measurement Wavelet transforms Aggregates Computer networks Data flow computing

来源：评论

学校读者我要写书评

暂无评论

Ultra-low power data storage for sensor networks

Ultra-low power data storage for sensor networks

引用

international symposium on Information Processing in Sensor Networks (IPSN)

作者： Gaurav Mathur P. Desnoyers Deepak Ganesan Prashant Shenoy Department of Computer Science University of Massachusetts Amherst MA USA

Local storage is required in many sensor network applications, both for archival of detailed event information, as well as to overcome sensor platform memory constraints. While extensive measurement studies have been performed to highlight the trade-off between computation and communication in sensor networks, the role of storage has received little attention. the storage subsystems on currently available sensor platforms have not exploited technology trends, and consequently the energy cost of storage on these platforms is as high as that of communication. Current flash memories, however, offer a low-priced, high-capacity and extremely energy-efficient storage solution. In this paper, we perform a comprehensive evaluation of the active and sleep-mode energy consumption of available flash-based storage options for sensor platforms. Our results demonstrate more than a 100-fold decrease in per-byte energy consumption for surface-mount parallel NAND flash in comparison with the MicaZ on-board serial flash. In addition, this dramatically reduces storage energy costs relative to communication, introducing a new dimension in traditional computation vs communication trade-offs. Our results have significant ramifications on the design of sensor platforms as well as on the energy consumption of sensing applications. We quantify the potential energy gains for two commonly used sensor network services: communication and in-network data aggregation. Our measurements show significant improvements in each service: 50-fold and up to 10-fold reductions in energy for communication and data aggregation respectively

关键词： Energy storage Energy consumption Performance evaluation Costs Memory management Computer networks High performance computing Flash memory Energy efficiency Potential energy

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共152页 << < 80 81 82 83 84 85 86 87 88 89 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：