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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是2251-2260 订阅

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

详细简洁

排序：

FEED: Fault tolerant, energy efficient, distributed Clustering for WSN

FEED: Fault tolerant, energy efficient, distributed Clusteri...

引用

international conference on Advanced Communication Technology (ICACT)

作者： Mohammad Mehrani Jamshid Shanbehzadeh Abdolhossein Sarrafzadeh Seyed Javad Mirabedini Chris Manford Islamic Azad University Dezful Iran Department of computer Tarbiat Moalem University Tehran Iran Department of Computing UNITEC Auckland New Zealand Islamic Azad University Tehran Iran

ISBN: (纸本)9781424454273;9788955191455

Increasing network lifetime, scalability and load balancing are important factors for wireless sensor networks. Clustering is a useful technique through which we can effect these factors. In this paper, we propose a new method of clustering which prolongs network lifetime by using energy, density and centrality factors and also the distances between nodes for making clusters. We assume a supervisor node for every cluster head which is to be its replacement when the cluster head fails. This property causes an increase in network lifetime and also helps the network to be fault tolerant. Simulation results demonstrate that using the proposed method offers significant improvement in clustering especially in network lifetime in comparison with the LEACH and HEED methods.

关键词： Feeds Fault tolerance Energy efficiency Wireless sensor networks Clustering algorithms Lead Base stations Routing protocols Java Scalability

来源：评论

学校读者我要写书评

暂无评论

An Overhearing-based Scheme for Improving Data Persistence in Wireless Sensor networks

An Overhearing-based Scheme for Improving Data Persistence i...

引用

IEEE international conference on Communications

作者： Junbin Liang Jianxin Wang Jianer Chen School of Computer and Electronic Information Guangxi University Nanning China School of Information Science and Engineering Central South University Changsha China Department of Computer Science College Station Texas A and M University TX USA

How to improve the data persistence, i.e., the availability of all source data, is an important issue in wireless sensor networks. The issue requires that each source node can disseminate its data (packet) to a subset of nodes in the network for effective storage. In this paper, a distributed scheme based on LT (Luby Transform)-codes, named LTSIDP, is proposed. LT codes are the first rateless erasure codes that are very efficient as the amount of data grows. In LTSIDP, each node uses overhearing to get information whether a packet has been transmitted by one of its neighbors. When a node needs to transmit a packet, it randomly chooses one of its neighbors that does not transmit the packet as receiver. On the other hand, each node can compute a key parameter of LT codes by using some properties of the packet transmission mechanism, and then store the data accordingly. After the process of storage is finished, a collector (e.g., a motor vehicle) can recover all data by visiting a small subset of nodes. To the best of our knowledge, LTSIDP is the first scheme that uses overhearing to improve the data persistence. Theoretical analyses and simulations show that LTSIDP can achieve higher data persistence and energy efficiency than existing schemes.

关键词： Wireless sensor networks Peer to peer computing Availability Global Positioning System Communications Society Information science Data engineering Computer networks Computer science USA Councils

来源：评论

学校读者我要写书评

暂无评论

A distributed hierarchical key management scheme for mobile Ad hoc networks

A distributed hierarchical key management scheme for mobile ...

引用

international conference on Information Networking and Automation (ICINA)

作者： Saju P John Philip Samuel Department of Computer Science Thejus Engineering College Thrissur India School of Engineering Cochin University of Science and Technology India

In MANET, when a node is compromised it tends to reveal the other node's key information and corrupts the whole network. The scalable method of cryptographic key management (SMOCK) proposes a method to deal with such node compromise attacks. But it has certain main drawbacks such as over dependent on centralized server and increase in key-pair when node increases. To deal with these drawbacks, we present an enhanced hierarchical key management scheme using a stable and power efficient cluster management technique. Each cluster head retains the public key of its member nodes only and act as a router when dealing with nodes of other cluster members. Using this technique, the overhead on centralized server is reduced. Moreover, the need of each node storing all public keys are diminished thus minimizing the storage overhead on each node. By Simulation results, we show that our proposed scheme achieves better delivery ratio and resilience with reduced delay and overhead.

关键词： Mobile computing Resilience Cryptography Ad hoc networks IEEE 802.11 Standards

来源：评论

学校读者我要写书评

暂无评论

Dynamic TinyOS: Modular and Transparent Incremental Code-Updates for Sensor networks

Dynamic TinyOS: Modular and Transparent Incremental Code-Upd...

引用

IEEE international conference on Communications

作者： Waqaas Munawar Muhammad Hamad Alizai Olaf Landsiedel Klaus Wehrle Computer Systems and Telematics Freie Universität Berlin Germany Distributed Systems Group RWTH Aachen University Germany

Long-term deployments of sensor networks in physically inaccessible environments make remote re-programmability of sensor nodes a necessity. Ranging from full image replacement to virtual machines, a variety of mechanisms exist today to deploy new software or to fix bugs in deployed systems. However, TinyOS - the current state of the art sensor node operating system - is still limited to full image replacement as nodes execute a statically-linked system-image generated at compilation time. In this paper we introduce Dynamic TinyOS to enable the dynamic exchange of software components and thus incrementally update the operating system and its applications. The core idea is to preserve the modularity of TinyOS, i.e. its componentization, which is lost during the normal compilation process, and enable runtime composition of TinyOS components on the sensor node. The proposed solution integrates seamlessly into the system architecture of TinyOS: It does not require any changes to the programming model of TinyOS and existing components can be reused transparently. Our evaluation shows that Dynamic TinyOS incurs a low performance overhead while keeping a smaller - up to one third - memory footprint than other comparable solutions.

关键词： Sensor systems Peer to peer computing Runtime Operating systems Virtual machining Wireless sensor networks Bandwidth Costs Joining processes Protocols

来源：评论

学校读者我要写书评

暂无评论

An Architecture for Distributing Scalable Content over Peer-to-Peer networks

An Architecture for Distributing Scalable Content over Peer-...

引用

international conference on Advances in Multimedia, MMEDIA

作者： Nicola Capovilla Michael Eberhard Silvano Mignanti Riccardo Petrocco Janne Vehkaperä STMicroelectronics Milan Italy Klagenfurt University Klagenfurt Austria University of Rome ‘Sapienza’ Rome Italy Technische Universiteit Delft Delft Netherlands VTT Technical Research Centre Oulu Finland

Peer-to-Peer systems are nowadays a very popular solution for multimedia distribution, as they provide significant cost benefits compared with traditional server-client distribution. Additionally, the distribution of scalable content enables the consumption of the content in a quality suited for the available bandwidth and the capabilities of the end-user devices. Thus, the distribution of scalable content over P2P networks is a very actual research topic. This paper presents an architecture for the distribution of scalable content in a fully distributed Peer-to-Peer network. The architectural description includes how the scalable layers of the content are mapped to the pieces distributed in the Peer-to-Peer system and detailed descriptions of the producer- and consumer-site architecture of the system. The presented system is to our knowledge the first open-source Peer-to-Peer network with full Scalable Video Coding support.

关键词： Peer to peer computing Satellite ground stations Orbits Artificial satellites Space stations Statistics Orbital calculations Satellite constellations Space vehicles Satellite navigation systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic Power Conservation Routing in MANETs: A New Approach

Dynamic Power Conservation Routing in MANETs: A New Approach

引用

international conference on Emerging Trends in Engineering and Technology, ICETET

作者： Vijay Borges Sanil Borkar Chinmay Sardesai Ankeeta Kamat Purva Kamat Department of Information Technology Goa College of Engineering Goa India Computer Engineering Goa College of Engineering Goa India

In mobile ad-hoc wireless networks (MANETs), a node is expected to forward packets from the source to the destination (on the behalf of the source), over multiple hops, for the benefit of other nodes. The residual battery level of a node in an ad-hoc network is a very critical and crucial resource as the life of the node is determined it. In this paper, our intention is to conserve the battery power of a node. To accomplish this, we make an effort to apply Nash Equilibrium and the underlying Game Theory concepts to an ad-hoc network in a dynamic way. We define an ad-hoc network model and identify the conditions under which the nodes participating in the communication can form equilibrium. We are following a distributed approach in calculating the routes to a destination depending on the individual battery energy of each of the nodes in that route. For this we are using Nash Equilibrium as a greedy algorithm, dynamically, to determine whether a node will use its battery power for routing packets through it.

关键词： Ad hoc networks Batteries Nash equilibrium Routing Mobile computing Protocols Computers

来源：评论

学校读者我要写书评

暂无评论

Storage Access Optimization with Virtual Machine Migration During Execution of parallel Data Processing on a Virtual Machine PC Cluster

Storage Access Optimization with Virtual Machine Migration D...

引用

international conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Shiori Toyoshima Saneyasu Yamaguchi Masato Oguchi Ochanomizu University Bunkyo Tokyo Japan Kogakuin University Shinjuku Tokyo Japan

We have constructed a virtual machine PC cluster that uses a virtual machine as worker nodes, and proposed a method that acquires insufficient resources dynamically from cloud computing systems while basic computation is performed on its own local clusters. Virtual machine environments enable us to manage computer resources flexibly and make use of migration. For data access, we have used iSCSI protocol which supports to access data through IP networks, and migrated virtual machine to cloud where data is stored over a high latency network. We have confirmed that the execution time becomes shorter with the migration of virtual machines even the cost of migration is taken into account, compared with the case of accessing data over a network when an I/O-intensive application is executed.

关键词： Virtual machining Data processing Cloud computing Operating systems Costs Resource management Platform virtualization Virtual machine monitors Environmental management Application virtualization

来源：评论

学校读者我要写书评

暂无评论

Real-time interactive object extraction system for high resolution remote sensing images based on parallel computing architecture

Real-time interactive object extraction system for high reso...

引用

international conference on Geoinformatics

作者： Yan Li Manchun Li Feixue Li Xiaogu Sun Wei Liu School of Geographic and Oceanographic Science Nanjing University Nanjing China Department of Electronic Science and Technology University of Science and Technology Hefei China

ISBN: (纸本)9781424473014

Random Walks has less interaction, better accuracy and higher computing independency. We introduce local intensity entropy to modify the weight function in Random Walks, in order to consider not only the intensity change of adjacent pixels, but also the statistical features of regions. Then we put forward a real-time interactive object extraction system for high resolution remote sensing images based on improved Random Walks method, and implement this system on general-purpose GPU with nVidia CUDA platform. Experiment results show that the improved Random Walks we provide could accurately extract the boundaries of residential area, water area, plant area as well as road networks. The whole system is built on NVidia 8800GTX GPU using CUDA platform, and still achieves real-time performance when dealing with high resolution RS images larger than 100M pixels.

关键词： Pixel Graphics processing unit Real time systems Entropy Mathematical model Equations Remote sensing

来源：评论

学校读者我要写书评

暂无评论

Achieving Fair Throughput for TCP Flows in Multi-Hop Wireless Backhaul networks

Achieving Fair Throughput for TCP Flows in Multi-Hop Wireles...

引用

IEEE international conference on Communications (ICC)

作者： C.-W. Hsu T.-C. Hou Department of Electrical Engineering & Department of Communications Engineering National Chung Cheng University Chiayi Taiwan

The use of multihop wireless networks based on the 802.11 technology has been growing. The primary advantages of this approach are mature technology and ease of deployment. However, the fairness property provided by the 802.11 DCF (distributed coordination function) in a single hop environment has been shown to be non-existent in a multihop environment. For example, in the multihop wireless backhaul network, nodes that are more hops away from the gateway are starved by nodes that are closer to the gateway. This paper focuses on the fairness study when TCP flows are carried over wireless backhaul networks. By not modifying lower layer protocols, this work identifies TCP parameters that impact throughput fairness and proposes adjusting those parameters to reduce frame collisions and improve throughput fairness. With the aid of simple mathematical formulations and ns2 simulations, this study finds that the frame transmissions from each node can be effectively controlled by properly controlling the delayed ACK timer and using a suitable advertised window. For chain topology with long hops, the fairness index of our proposed method outperforms basic 802.11 DCF by over 90 percent. The proposed methods are simple and easy to deploy.

关键词： Throughput Spread spectrum communication Peer to peer computing Wireless LAN Wireless networks Delay effects Degradation Media Access Protocol Communications Society Paper technology

来源：评论

学校读者我要写书评

暂无评论

Consensus in Anonymous distributed Systems: Is There a Weakest Failure Detector?

Consensus in Anonymous Distributed Systems: Is There a Weake...

引用

international conference on Advanced Information Networking and Applications (AINA)

作者： François Bonnet Michel Raynal IRISA Université de Rennes 1 Rennes France

ISBN: (纸本)9781424466955;9780769540184

This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable channels. Anonymity means that any two processes cannot be distinguished one from the other: they have no name and execute the same code. The paper has several contributions. It first introduces two new classes of failures detectors, denoted AP and AΩ, and presents an AP-based algorithm and an AΩ-based algorithm that solve the consensus problem despite the three computational adversaries that are asynchrony, failures and anonymity. Then, the paper shows that, in crash-prone non-anonymous systems, (a) AP and the class of perfect failure detectors (denoted P) are equivalent, and (b) AΩ and the class of eventual leader failure detectors (denoted Ω) are also equivalent. Finally, the paper addresses the question of the weakest failure detector to solve consensus in an asynchronous crash-prone anonymous system. In non-anonymous systems, the class P of perfect failure detectors is strictly stronger than the class Ω of eventual leader failure detectors that has been shown to be the weakest failure detector class for consensus in asynchronous crashprone system. Quite surprisingly, the paper shows that their anonymous counterparts cannot be compared. Hence, while Ω is the weakest failure detector class to solve consensus in non-anonymous systems, it is possible that there are several (hence incomparable) classes of weakest failure detectors for this problem in anonymous systems.

关键词： Detectors Computer crashes distributed computing Uncertainty Message passing Real time systems Concurrent computing parallel processing Scalability Privacy

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 222 223 224 225 226 227 228 229 230 231 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：