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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Addressing the P2P Bootstrap Problem for Small Overlay networks

Addressing the P2P Bootstrap Problem for Small Overlay Netwo...

引用

international conference on Peer-to-Peer computing

作者： D. I. Wolinsky P. St. Juste P. O. Boykin R. Figueiredo Advanced Computing Information Systems Laboratory University of Florida USA

Peer-to-Peer (P2P) overlays provide a framework for building distributed applications consisting of few to many resources with features including self-configuration, scalability, and resilience to node failures. Such systems have been successfully adopted in large-scale Internet services for content delivery networks, file sharing, and data storage. In small-scale systems, they can be useful to address privacy concerns as well as support for network applications that lack dedicated servers. The bootstrap problem, finding an existing peer in the overlay, remains a challenge to enabling these services for small-scale P2P systems. In large networks, the solution to the bootstrap problem has been the use of dedicated services, though creating and maintaining these systems requires expertise and resources, which constrain their usefulness and make them unappealing for small-scale systems. This paper surveys and summarizes requirements that allow peers potentially constrained by network connectivity to bootstrap small-scale overlays through the use of existing public overlays. In order to support bootstrapping, a public overlay must support the following requirements: a method for reflection in order to obtain publicly reachable addresses, so peers behind network address translators and firewalls can receive incoming connection requests; communication relaying to share public addresses and communicate when direct communication is not feasible; and rendezvous for discovering remote peers, when the overlay lacks stable membership. After presenting a survey of various public overlays, we identify two overlays that match the requirements: XMPP overlays, such as Google Talk and Live Journal Talk, and Brunet, a structured overlay based upon Symphony. We present qualitative experiences with prototypes that demonstrate the ability to bootstrap small-scale private structured overlays from public Brunet or XMPP infrastructures.

关键词： Peer to peer computing IP networks Servers Virtual private networks Internet Book reviews IEEE Communications Society

来源：评论

学校读者我要写书评

暂无评论

An efficient weighted distributed clustering algorithm for mobile ad hoc networks

An efficient weighted distributed clustering algorithm for m...

引用

international conference on Computer Engineering and Systems

作者： AbdelRahman Hussein Sufian Yousef Samir Al-Khayatt Omar S. Arabeyyat Jerash Private University Jerash Jordan Anglia Ruskin University Chelmsford UK Sheffield Hallam University Sheffield UK AI-Balqa Applied University Al-Salt Jordan

Clustering approach is an important research topic for MANETs and widely used in efficient network management, hierarchical routing protocol design, network modeling, Quality of Service, etc. Many researchers' recent focus has been on clustering management which is one of the fundamental problems in mobile ad hoc networks. The main objective of clustering in mobile ad-hoc network environments is how can an optimal clusterhead be elected and how can the optimal number of clusters be achieved through division without degrading the whole network's performance. In this paper, we propose new weighted distributed clustering algorithm, called CBMD. It takes into consideration the parameters: connectivity (C), residual battery power (B), average mobility (M), and distance (D) of the nodes to choose locally optimal clusterheads. The goals of this algorithm are maintaining stable clustering structure with a lowest number of clusters formed, to minimise the overhead for the clustering formation and maintenance and to maximise the lifespan of mobile nodes in the system. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the number of clusters formed, reaffiliation count and numbers of clusterhead changes. Results show that our algorithm performs better than existing ones and is also tuneable to different kinds of network conditions.

关键词： Clustering algorithms Batteries Mobile communication Measurement Algorithm design and analysis Mobile computing Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Regional Clustering Scheme in Densely Deployed Wireless Sensor networks for Weather Monitoring Systems

Regional Clustering Scheme in Densely Deployed Wireless Sens...

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Dong-Min Choi Sang-Man Moh Il-Yong Chung Department of Computer Engineering Chosun University Gwangju South Korea

Clustering protocol that is used in wireless sensor network is an efficient method that extends the lifetime of the entire network. However, when this method is applied to an environment in which collected data of the sensor node easily overlap, sensor nodes unnecessarily consumes so much energy. In the case of clustering technique that use a threshold, the lifetime of the network is extended but the degree of accuracy of collected data is low. Therefore it is hard to trust the data and improvement is needed. In addition, it is hard for the clustering protocol that uses multi-hop transmission to normally collect data because the selection of a cluster head node occurs at random and therefore the link of nodes is often disconnected. Considering the whole networks, nodes nearer the sink have to take heavier traffic load. Therefore, nodes around the sink would deplete their energy faster, leading to what is called an energy hole around the sink. Accordingly this paper suggested a cluster-formation algorithm that reduces unnecessary energy consumption and that works with an alleviated link disconnection. According to the result of performance analysis that used environment data, the suggested method lets the nodes consume less energy than the existing clustering method and the transmission efficiency is increased and the entire lifetime is prolonged by about 30%.

关键词： Protocols Accuracy Energy consumption Data communication Energy measurement Clustering methods distributed databases

来源：评论

学校读者我要写书评

暂无评论

YETI on the Cloud

YETI on the Cloud

引用

IEEE international conference on Software Testing Verification and Validation Workshop, ICSTW

作者： Manuel Oriol Faheem Ullah Department of Computer Science University of York Yorkshire UK Department of Computer Science ETH Zurich Zurich Switzerland

The York Extensible Testing Infrastructure (YETI) is an automated random testing tool that allows to test programs written in various programming languages. While YETI is one of the fastest random testing tools with over a million method calls per minute on fast code, testing large programs or slow code -- such as libraries using intensively the memory -- might benefit from parallel executions of testing sessions. This paper presents the cloud-enabled version of YETI. It relies on the Hadoop package and its map/reduce implementation to distribute tasks over potentially many computers. This would allow to distribute the cloud version of YETI over Amazon's Elastic Compute Cloud (EC2).

关键词： Clouds Java Software testing Automatic testing Libraries System testing Computer science distributed computing Prototypes Computer languages

来源：评论

学校读者我要写书评

暂无评论

Modeling and analyzing the effects of firewalls and NATs in P2P swarming systems

Modeling and analyzing the effects of firewalls and NATs in ...

引用

IEEE international Symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： L. D'Acunto M. Meulpolder R. Rahman J.A. Pouwelse H.J. Sips Department of Computer Science Delft University of Technnology Netherlands

ISBN: (纸本)9781424465330

Many P2P systems have been designed without taking into account an important factor: a large fraction of Internet users nowadays are located behind a network address translator (NAT) or a firewall, making them unable to accept incoming connections (i.e. unconnectable). Peers suffering from this limitation cannot fully enjoy the advantages offered by the P2P architecture and thus they are likely to get a poor performance. In this work, we present a mathematical model to study the performance of a P2P swarming system in the presence of unconnectable *** quantify the average download speeds of peers and find that unconnectable peers achieve a lower average download speed compared to connectable peers, and this difference increases hyperbolically as the percentage of unconnectable peers grows. More interestingly, we notice that connectable peers actually benefit from the existence of peers behind NATs/firewalls, since they alone can enjoy the bandwidth that those peers offer to the system. Inspired by these observations, we propose a new policy for the allocation of the system's bandwidth that can mitigate the performance issues of unconnectable peers. In doing so, we also find an intrinsic limitation in the speed improvement that they can possibly achieve.

关键词： Network address translation Channel allocation Bandwidth Performance analysis Quality of service Computer science IP networks Mathematical model Peer to peer computing Streaming media

来源：评论

学校读者我要写书评

暂无评论

Mining and Composition of Emergent Collectives in Mixed Service-Oriented Systems

Mining and Composition of Emergent Collectives in Mixed Serv...

引用

IEEE international conference on E-Commerce Technology Workshops

作者： Daniel Schall Florian Skopik Distributed Systems Group University of Technology Vienna Vienna Austria

Complex service-oriented systems typically span interactions between people and services. Compositions in such systems demand for flexible interaction models. In this work we introduce an approach for discovering experts based on their dynamically changing skills and interests. We discuss human provided services and an approach for managing user preferences and network structures. Experts offer their skills and capabilities as human provided services that can be requested on demand. Our main contributions center around an expert discovery method based on the concept of hubs and authorities in Web-based environments. The presented discovery and interaction approach takes trust-relations and link properties in social networks into account to estimate the hub-expertise of users. Furthermore, we show how our approach supports flexible interactions in mixed service-oriented systems.

关键词： Context Humans Social network services Communities Measurement Receivers Collaboration

来源：评论

学校读者我要写书评

暂无评论

A Region-Based Hierarchical Location Service with Road-Adapted Grids for Vehicular networks

A Region-Based Hierarchical Location Service with Road-Adapt...

引用

international conference on parallel Processing Workshops (ICPPW)

作者： Guey-Yun Chang Yun-Yu Chen Jang-Ping Sheu Department of Computer Science National Tsing Hua University Hsinchu Taiwan Department of Computer Science and Information Engineering National Central University Jhong Li Taiwan

In VANETs, it is very important to communicate between two vehicles, but how to get the correct position of a vehicle is not easy. Due to vehicles are moving fast, topology in VANETs changes rapidly. As a result, location services processed in VANETs are more difficult than in MANETs. In our thesis, we propose a hierarchical location service system, it provides a low cost and rapid service. First, we select the main arteries to divide network into grids because of there are more vehicles than in normal roads, and then design a mechanism that when vehicles need to send update packets. This mechanism can decrease the number of update packets and still gain correct vehicles' location. Second, we design grids with three levels, the higher the level, the larger the area. Each level stores update packets sent within its area. Vehicles using our system can find the destination vehicle distributedly within a small area; if the target is not within this area, then find within a larger area. Besides, we propose a packets collection method, it can be adjusted with different size of collection area. The simulation results show that our scheme could decrease the number of location update packets effectively, and keep high success rate of location service.

关键词： Vehicles Arteries Roads Servers Protocols Mobile computing Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Weighted barrier functions for computation of force distributions with friction cone constraints

Weighted barrier functions for computation of force distribu...

引用

IEEE international conference on Robotics and Automation (ICRA)

作者： Per Henrik Borgstrom Maxim A. Batalin Gaurav S. Sukhatme William J. Kaiser Department of Electrical Engineering University of California Los Angeles USA Center for Embedded Networked Sensing University of California Los Angeles USA Department of Computer Science University of Southern California USA Department of Electrical Engineering University of California Los Angeles

ISBN: (纸本)9781424450381

We present a novel Weighted Barrier Function (WBF) method of efficiently computing optimal grasping force distributions for multifingered hands. Second-order conic friction constraints are not linearized, as in many previous works. The force distributions are smooth and rapidly computable, and they enable flexibility in selecting between firm, stable grasps or looser, more efficient grasps. Furthermore, fingers can be disengaged and re-engaged in a smooth manner, which is a critical capability for a large number of manipulation tasks. We present efficient solution methods that do not incur the increased computational complexity associated with solving the Semi-Definite Programming formulations presented in previous works. We present results from static and dynamic simulations which demonstrate the flexibility and computational efficiency associated with WBF force distributions.

关键词： distributed computing Friction Grasping Fingers Service robots Constraint optimization Vectors Chebyshev approximation Computer networks Embedded computing

来源：评论

学校读者我要写书评

暂无评论

Intra-mobility for Hospital Wireless Sensor networks Based on 6LoWPAN

Intra-mobility for Hospital Wireless Sensor Networks Based o...

引用

international conference on Wireless and Mobile Communications (ICWMC)

作者： Antonio J. Jara Miguel A. Zamora Antonio F.G. Skarmeta Department of Information and Communications Engineering Computer Science Faculty University of Murcia Murcia Spain

Low-power personal area networks (LoWPANs) are still in its early stage of development, but the range of conceivable usage scenarios is tremendous. The numerous possible applications of Wireless Sensor networks (WSNs) make obvious that mesh and multi-technology topologies will be prevalent in LoWPAN environments and mobility support will be a necessity. Mobility based communication can prolong the lifetime of devices and increase the connectivity between nodes and clusters. Using distributed LoWPANs is possible to sculpt the devices density to cluster around areas of interest, cover large areas, and work more efficiently. The required mobility is heavily dependent on the individual service scenario and the LoWPAN architecture, for that reason in this paper is defined a mobility protocol for clinical environments. This paper presents an intra-mobility protocol for Hospital Wireless Sensor networks based on 6LoWPAN, where we have defined a protocol optimized for our continuous vital signs monitoring architecture. This protocol presents how to exploit the other elements of the architecture with high capacity and resources (6LoWPAN Border Router, gateways etc.) to reduce latency, power consumption and the number of interchanged messages with respect to other solutions such as Mobile IP (MIPv6).

关键词： Protocols Hospitals Mobile communication Wireless sensor networks Mobile computing Security Logic gates

来源：评论

学校读者我要写书评

暂无评论

Prolonging network operation lifetime with new maximum battery capacity routing in wireless mesh network

Prolonging network operation lifetime with new maximum batte...

引用

international conference on Computer and Automation Engineering, ICCAE

作者： Afsane Saee Arezoomand Mohammadali Pourmina Department of Electronic and Communication Science and Research Branch Islamic Azad University Tehran Iran

ISBN: (纸本)9781424455690

The wireless mesh network is a novel wireless network architecture that supports clients to communicate with different types of networks, Internet etc. It consists of mesh routers and mesh clients. These mesh routers are minimal mobile and mesh clients are totally mobile which operate on batteries. Hence, power consumption becomes an important issue in mesh clients. The protocols of Ad hoc networks can be used in WMNs. But in the paper we only consider the routing algorithm with limited battery energy of each mesh clients. To maximize the lifetime of mesh mobile networks, the power consumption rate of each node must be evenly distributed, it is essential to prolong each individual node (mobile) lifetime since the lack of mobile nodes can result in partitioning of the network, causing interruptions in communications between mobile nodes, and finally the overall transmission power for each connection request must be minimized. These two objectives cannot be satisfied simultaneously due to the NP hardness of the problem so a trade-off between these two conflict optimization objectives is needed. In this article we propose a new metric to find a proper route in wireless Mesh network.

关键词： Batteries Routing Wireless mesh networks Peer to peer computing Mobile communication Energy consumption Ad hoc networks Spine Costs Intelligent transportation systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 218 219 220 221 222 223 224 225 226 227 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：