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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,317 篇 会议
46 篇 期刊文献
30 册 图书

馆藏范围

2,393 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,393 篇 工学
- 1,180 篇 计算机科学与技术...
- 600 篇 软件工程
- 296 篇 信息与通信工程
- 175 篇 电气工程
- 101 篇 控制科学与工程
- 97 篇 电子科学与技术（可...
- 59 篇 动力工程及工程热...
- 55 篇 机械工程
- 41 篇 仪器科学与技术
- 31 篇 生物工程
- 26 篇 网络空间安全
- 25 篇 生物医学工程（可授...
- 21 篇 建筑学
- 16 篇 环境科学与工程（可...
- 16 篇 安全科学与工程
- 15 篇 光学工程
- 15 篇 土木工程
357 篇 管理学
- 290 篇 管理科学与工程(可...
- 99 篇 图书情报与档案管...
- 95 篇 工商管理
327 篇 理学
- 195 篇 数学
- 63 篇 物理学
- 63 篇 系统科学
- 44 篇 生物学
- 30 篇 统计学（可授理学、...
- 15 篇 化学
26 篇 经济学
- 26 篇 应用经济学
23 篇 法学
- 18 篇 社会学
15 篇 农学
- 14 篇 作物学
15 篇 医学
- 14 篇 临床医学
10 篇 文学
2 篇 艺术学
1 篇 军事学

主题

275 篇 peer to peer com...
237 篇 distributed comp...
203 篇 computer network...
176 篇 wireless sensor ...
132 篇 protocols
131 篇 grid computing
120 篇 cloud computing
107 篇 computational mo...
102 篇 routing
91 篇 delay
89 篇 computer archite...
88 篇 mobile computing
87 篇 servers
81 篇 algorithm design...
79 篇 ad hoc networks
78 篇 mobile communica...
77 篇 bandwidth
75 篇 concurrent compu...
75 篇 network topology
68 篇 computer science

机构

22 篇 institute of com...
16 篇 institute of com...
10 篇 national laborat...
8 篇 school of comput...
8 篇 school of comput...
8 篇 graduate univers...
8 篇 school of comput...
8 篇 school of comput...
7 篇 national laborat...
7 篇 seikei universit...
7 篇 key laboratory o...
6 篇 department of co...
6 篇 rissho universit...
6 篇 national laborat...
6 篇 chinese academy ...
5 篇 key laboratory o...
5 篇 graduate univers...
4 篇 inria
4 篇 department of ma...
4 篇 nokia research c...

作者

8 篇 kurt rothermel
7 篇 zhang desheng
7 篇 makoto takizawa
7 篇 valentin cristea
7 篇 rothermel kurt
6 篇 zomaya albert y.
6 篇 li jinbao
6 篇 ailixier aikebai...
6 篇 frank dürr
5 篇 wei liu
5 篇 tang tao
5 篇 lin yisong
5 篇 min geyong
5 篇 tomoya enokido
5 篇 jin hai
5 篇 guo longjiang
5 篇 kai xiang
5 篇 jiannong cao
4 篇 qishi wu
4 篇 zhang lei

语言

2,386 篇 英文
5 篇 中文
2 篇 其他

检索条件"任意字段=2010 International Conference on Parallel and Distributed Computing and Networks, PDCN 2010"

共 2393 条记录，以下是2351-2360 订阅

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

详细简洁

排序：

Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds 10

Dynamic Load-Balanced Multicast for Data-Intensive Applicati...

引用

IEEE/ACM international Symposium on Cluster computing and the Grid (CCGRID)

作者： Tatsuhiro Chiba Mathijs den Burger Thilo Kielmann Satoshi Matsuoka Department of Math and Computing Sciences Tokyo Institute of Technology Meguro Tokyo Japan Department of Computer Science Vrije Universiteit Amsterdam Amsterdam Netherlands National Institute of Information Japan

ISBN: (纸本)9780769540399

Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algorithms have been proposed for clusters and grid environments. The most common approach is to construct one or more spanning trees based on the network topology and network monitoring data in order to maximize available bandwidth and avoid bottleneck links. However, delivering optimal performance becomes difficult once the available bandwidth changes dynamically. In this paper, we focus on Amazon EC2/S3 (the most commonly used cloud platform today) and propose two high performance multicast algorithms. These algorithms make it possible to efficiently transfer large amounts of data stored in Amazon S3 to multiple Amazon EC2 nodes. The three salient features of our algorithms are (1) to construct an overlay network on clouds without network topology information, (2) to optimize the total throughput dynamically, and (3) to increase the download throughput by letting nodes cooperate with each other. The two algorithms differ in the way nodes cooperate: the first `non-steal' algorithm lets each node download an equal share of all data, while the second `steal' algorithm uses work stealing to counter the effect of heterogeneous download bandwidth. As a result, all nodes can download files from S3 quickly, even when the network performance changes while the algorithm is running. We evaluate our algorithms on EC2/S3, and show that they are scalable and consistently achieve high throughput. Both algorithms perform much better than having each node downloading all data directly from S3.

关键词： Multicast algorithms Cloud computing Concurrent computing Application software Bandwidth distributed computing Grid computing Throughput Network topology Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Network Address Assignment In Mobile Ad-Hoc networks

Network Address Assignment In Mobile Ad-Hoc networks

引用

international conference on Ultra Modern Telecommunications and Workshops (ICUMT)

作者： Mohammad Al-Shurman Mamoun F. Al-Mistarihi Ahmad Qudaimat Network Engineering and Security Department Jordan University of Science and Technology Irbid Jordan Electrical Engineering Department Jordan University of Science and Technology Irbid Jordan

In this paper a dynamic address allocation protocol for mobile Ad Hoc networks (MANETs) capable of assigning an address to network nodes with low latency and communication overhead has been proposed. The protocol divides the network nodes into root, leaders and normal nodes based on their functions within the protocol. Address space are distributed between leaders in disjoint address tables. The leaders are responsible for assigning the addresses to unconfigured nodes. The leaked addresses which lost by the nodes that left the network abruptly, are reclaimed in an efficient way in order to preserve the addresses. Network partitioning and merging problem was solved in the protocol with low cost. The proposed protocol is scalable and proves its effectiveness in terms of time delay and communication overhead.

关键词： Lead Protocols Ad hoc networks Mobile computing IP networks Merging Databases

来源：评论

学校读者我要写书评

暂无评论

parallel information theory based construction of gene regulatory networks 08

引用

Proceedings of the 15th international conference on High performance computing

作者： Jaroslaw Zola Maneesha Aluru Srinivas Aluru Department of Electrical and Computer Engineering Iowa State University Ames IA Department of Genetics Cellular and Developmental Biology Iowa State University Ames IA

ISBN: (纸本)9783540898931

We present a parallel method for construction of gene regulatorynetworks from large-scale gene expression data. Our method integratesmutual information, data processing inequality and statisticaltesting to detect significant dependencies between genes, and efficientlyexploits parallelism inherent in such computations. We present a novelmethod to carry out permutation testing for assessing statistical significancewhile reducing its computational complexity by a factor of Θ(n2),where n is the number of genes. Using both synthetic and known regulatorynetworks, we show that our method produces networks of qualitysimilar to ARACNE, a widely used mutual information based *** present a parallelization of the algorithm that, for the first time, allowsconstruction of whole genome networks from thousands of microarrayexperiments using rigorous mutual information based *** report the construction of a 15,147 gene network of the plant Arabidopsisthaliana from 2,996 microarray experiments on a 2,048-CPUBlue Gene/L in 45 minutes, thus addressing a grand challenge problemin the NSF Arabidopsis 2010 initiative.

关键词： gene networks mutual information parallel computational biology systems biology

来源：评论

学校读者我要写书评

暂无评论

A distributed computing Architecture to Support Field Engineering in Networked Systems

A Distributed Computing Architecture to Support Field Engine...

引用

international conference on Complex, Intelligent and Software Intensive Systems

作者： Kashif Khan Robert Haines John M. Brooke School of Computer Science The University of Manchester

ISBN: (纸本)9781424459179;9780769539676

Field workforces have to implement day-to-day control decisions to keep the large scale real-world systems (e.g. Water Distribution Systems) operational. However, existing customized Decision Support Tools (DSTs) for field workforces operate on static and predefined datasets, available in the workers' devices. This results in planning control actions that may appear safe in the local context but can cause conflicts and disturbances elsewhere in the system. To enable informed decision making, we discuss a generic architecture that supports the development of dynamic predictive DSTs for the field workforces. The predictive DSTs would not only provide up-to-date information but also allow field workforces to perform 'What-If simulations. We extend our previous work, on accessing simulations via lightweight mobile devices, by updating the 'What-If simulations with the real-time Wireless Sensor Network (WSN) data and the scheduled future control actions. The calibration with the sensor network data enables the simulations to predict the real-time state of the system, while the incorporation of future control actions reduces the risk of unexpected feedback between different parts of the system. Hence, considering both the current and possible future state in simulations enables the field workforces to take informed control decisions in the real-world system.

关键词： Decision Support Tools Field Workforces Simulations Water Distribution System Wireless Sensor Network Water distribution systems decision support tool simulating Wireless sensor networks field engineer network data Mobile devices control action

来源：评论

学校读者我要写书评

暂无评论

Scalable P2P Reconciliation Infrastructure for Collaborative Text Editing

Scalable P2P Reconciliation Infrastructure for Collaborative...

引用

international conference on Advances in Databases, Knowledge, and Data Applications, DBKDA

作者： Mounir Tlili Reza Akbarinia Esther Pacitti Patrick Valduriez INRIA-LINA Nantes France INRIA-LIRMM Montpellier France

ISBN: (纸本)9781424460816

We address the problem of optimistic replication for collaborative text editing in Peer-to-Peer (P2P) systems. This problem is challenging because of concurrent updating at multiple peers and dynamic behavior of peers. Operational transformation (OT) is a typical approach used for handling optimistic replication in the context of distributed text editing. However, most of OT solutions are neither scalable nor suited for P2P networks due to the dynamic behavior of peers. In this paper, we propose a scalable P2P reconciliation infrastructure for OT that assures eventual consistency and liveness despite dynamicity and failures. We propose a P2P logging and timestamping service called P2P-LTR (P2P Logging and Timestamping for Reconciliation) which exploits a distributed hash table (DHT) for reconciliation. While updating replica copies at collaborating peer editors, updates are stored in a highly available P2P log. To enforce eventual consistency, these updates must be retrieved in a specific total order to be reconciled at the peer editors. P2P-LTR provides an efficient mechanism for determining the total order of updates. It also deals with the case of peers that may join and leave the system during the update operation. We evaluated the performance of P2P-LTR through simulation; the results show the efficiency and the scalability of our solution.

关键词： Collaborative work Scalability Peer to peer computing Databases international collaboration Fault tolerant systems Large-scale systems Buildings Fault tolerance Network servers

来源：评论

学校读者我要写书评

暂无评论

A METHOD OF CLOUD STORAGE ALGORTHOM FOR CROP IMAGES INFORMATION

A METHOD OF CLOUD STORAGE ALGORTHOM FOR CROP IMAGES INFORMAT...

引用

2012 IEEE 2nd international conference on Cloud computing and Intelligence Systems

作者： Chunjiang Zhao Ronghua Gao Huarui Wu National Engineering Research Center for Information Technology in Agriculture Key Laboratory for Information Technologies in Agriculture Ministry of Agriculture

With the development of high resolution images technique, large scale data intensive computing and computing-intensity is highly demanded. However, isolated storage and dispersive management cannot meet exponentially increasing demand for storage and management of crop images. On the basis of the crop images grasped by our independent developed agricultural intelligent search engine, a kind of extraction technique will be studied to extract the special feature behind scattered image data and to build up a cloud platform for the crop images information. Fast and accurate searching for crop images and its highly efficient management under cloud computation environment are achieved through map-reduce parallel mechanism.

关键词： Cloud storage Massive image Pyramid distributed computing

来源：评论

学校读者我要写书评

暂无评论

Optimizing Segment Caching for Mobile Peer-to-Peer Interactive Streaming

Optimizing Segment Caching for Mobile Peer-to-Peer Interacti...

引用

IEEE international conference on Communications (ICC)

作者： J. Li S.-H. Chan Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China

With the penetration of broadband wireless access network and devices, interactive multimedia streaming to handhelds has become a reality. However, it is still challenging to offer such services to a large number of users in a cost-effective manner. With the increase of battery lifetime, memory capacity and processing capability, and the fact that many mobile devices nowadays are equipped with multiple interfaces (3G, Wi-Fi, bluetooth, etc.), we study wireless peer-to-peer (P2P) streaming for scalable interactive streaming. In the network, videos are divided into segments and collaboratively cached and accessed among mobile devices. The major challenge is then which segment to cache at each mobile to achieve efficient access (in terms of low segment access cost). We first formulate the problem of segment caching to minimize segment access cost. We show that the optimization problem is NP-hard and present OPSEC (Optimized Segment Caching), a distributed algorithm which achieves collaborative and efficient segment caching, given heterogeneous caching capacities of the participating users. Using simulation, we show that OPSEC achieves much lower network access cost as compared with some recent schemes for interactive wireless video streaming.

关键词： Peer to peer computing Streaming media Costs Videos Communications Society Wireless networks Bluetooth Collaboration Network servers Computer science

来源：评论

学校读者我要写书评

暂无评论

Sensor-Aware Adaptive Push-Pull Query Processing in Wireless Sensor networks

Sensor-Aware Adaptive Push-Pull Query Processing in Wireless...

引用

international conference on Intelligent Environments (IE)

作者： Raja Bose Abdelsalam Helal Nokia Research Center Palo Alto CA USA Mobile and Pervasive Computing Laboratory University of Florida Gainesville FL USA

Till date, sensor network research has assumed that the cost of transmitting a sensor reading over the network is much higher than the cost of sampling a sensor. However, this assumption is no longer always valid, due to availability of new generation sensor platform hardware, which utilizes industry standard mesh-networking protocols such as ZigBee on top of relatively high-speed, yet low-power wireless radios. In fact, we have experimentally verified that the energy consumed for acquiring a sample from a sensor can be significantly higher than the energy consumed for transmitting its reading over the network. Hence, new querying strategies need to be formulated, which optimize the order of sampling sensors across the network in such a manner that sensors with expensive acquisition costs are not sampled unless absolutely required. We propose distributed pull-push querying mechanisms, which optimize the query plan by adapting to variable costs of acquiring readings from different sensors across the network. The goal of these mechanisms is to minimize the energy consumption of nodes executing a query while ensuring that the latency of query response does not exceed user-specified bounds. To validate our approach, we also describe experimental results, which analyze the performance of various plan options in terms of energy consumption and latency under the effect of various parameters such as selectivity of data and number of sensors participating in the query.

关键词： Energy consumption Sensors Zigbee Microcontrollers Query processing Mathematical model Hardware

来源：评论

学校读者我要写书评

暂无评论

Reduction of Messages Unnecessarily Ordered in Scalable Group Communication

Reduction of Messages Unnecessarily Ordered in Scalable Grou...

引用

international conference on Complex, Intelligent and Software Intensive Systems, CISIS

作者： Isamu Tsuneizumi Ailixier Aikebaier Tomoya Enokido Makoto Takizawa Seikei University Japan Rissho University Japan

ISBN: (纸本)9781424459179;9780769539676

In distributed peer-to-peer (P2P) applications, a group of multiple peer processes (peers) are required to cooperate with each other. Messages sent by peers have to be causally delivered. In this paper, we discuss a scalable group communication protocol for a group of multiple peers in P2P overlay networks. Due to the message overhead O(n) for the number n of peers, the vector clock cannot be used to causally deliver messages is a scalable group. On the other hand, the linear clock implies the message length O(1), but some pair of messages are unnecessarily ordered. Recently, more accurate physical clocks can be used with the GPS time server and network time protocol (NTP). In this paper, we consider a group where every member peer can use a physical clock which is synchronized with the time server in the network time protocol (NTP). Even if each physical clock is synchronized with a time server, every physical clock does not show the same accurate time. The accuracy of the physical clock depends on distance to the time server, traffic in a network and operating system. In this paper, we reduce the number of messages unnecessarily ordered by taking advantage of the linear time and physical time.

关键词： Clocks Network servers Protocols Synchronization Global Positioning System Telecommunication traffic Delay effects Peer to peer computing Competitive intelligence Communication system software

来源：评论

学校读者我要写书评

暂无评论

An accurate crosstalk noise estimation method for two simultaneously switched on-chip VLSI distributed RLCG global interconnects

An accurate crosstalk noise estimation method for two simult...

引用

international conference on Signal and Image Processing (ICSIP)

作者： R. Kar V. Maheshwari A. Choudhary A. Singh A. K. Mal A. K. Bhattacharjee Department of Electronics & Communication Engineering National Institute of Technology Durgapur West Bengal India Department of Electronics & Communication Engg. National Institute of Technology Durgapur-9 West Bengal INDIA

On-chip inductive effects are becoming predominant in deep submicron (DSM) interconnects due to increasing clock speed, circuit complexity and decreasing interconnect lengths. Inductance causes noise in the signal waveforms, which could adversely affect the performance of the circuit and signal integrity. The traditional analysis of crosstalk in a transmission line begins with a lossless LC representation, yielding a wave equation governing the system response. This paper proposes a difference model approach to derive crosstalk in the transform domain. A closed form solution for crosstalk is obtained by incorporating initial conditions using difference modal approach for distributed RLCG interconnects. We have derived the crosstalk metric for two parallel lines when both are switching simultaneously. A raw evaluation of the crosstalk could be at the origin of a malfunction of the circuit. Cross talk can be analyzed by computing the signal linkage between aggressor or attacker nets and victim nets. The attacker net carries a signal that couples to the victim net through the mutual inductance. In order to determine the effects that this cross talk will have on circuit operation, the resulting voltage expressions at the victim and aggressor must be calculated. This paper proposes a difference model approach for the effective voltages at the victim and aggressor using superposition theorem. The accuracy of our approach is justified by the results obtained from SPICE simulation.

关键词： Crosstalk Integrated circuit interconnections Inductance Power transmission lines Couplings Capacitance Equations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 231 232 233 234 235 236 237 238 239 240 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：