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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Routing with uncertainty in wireless mesh networks

Routing with uncertainty in wireless mesh networks

引用

international Workshop on Quality of Service

作者： Fajun Chen Jiangchuan Liu Zongpeng Li Yijie Wang Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defense Technology China School of Computing Science Simon Fraser University Department of Computer Science University of Caglary

Existing routing protocols for Wireless Mesh networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP). Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51.15~73.02%) and improvement on packet delivery ratio (99.76%) are observed.

关键词： Uncertainty Wireless mesh networks Delay Routing protocols Physical layer Statistics Stochastic processes Relays Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Some Thoughts on the Legal Background of the Continuously Increasing Privacy Risk in Information Systems and on How to Deal with It

Some Thoughts on the Legal Background of the Continuously In...

引用

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

作者： Gerald Quirchmayr Chrsitopher C. Wills School of Computer and Information Science University of South Australia Mawson Lakes Australia Department of Distributed and Multimedia Systems University of Technology Vienna Vienna Austria Faculty of Computing Information Systems and Mathematics Kingston University Kingston Upon Thames UK

This paper tries to give an overview of the rising concerns raised by the issue of privacy protection that is associated with the European Data Retention Directive. After relating this risk to the requirements as stated in the European Data Protection Directive, an approach for a security-integrated view on the design of information systems is discussed. The paper then finishes with an outlook on the possible impact on IT governance.

关键词： Law Legal factors Information systems Data privacy Protection Government Surveillance Humans Terrorism Computer networks

来源：评论

学校读者我要写书评

暂无评论

Why collisions happen: A pathology of CSMA for wireless sensor networks in high contention

Why collisions happen: A pathology of CSMA for wireless sens...

引用

international conference on Networked Sensing Systems (INSS)

作者： Henoc Agbota Computing Department Lancaster University UK

Contention is highly prevalent in wireless sensor network applications, especially those where the measured physical phenomenon is triggered by spatially and temporally co-located events, such as in distributed acoustic localisation. As a fundamental performance aspect, characterising and understanding the impact of contention on the packet reception rate is an important step towards building robust real-world communication protocols. As a step forward, based on measurements taken with CC2420-equipped iMote2 nodes, this paper empirically identifies two areas of packet reception with contrasting link characteristics in relation to the contention level. It also reveals the “deaf node problem”, which causes conflicting carrier sense results and can thereby lead to packet collisions, even in optimal topologies.

关键词： Lead Acoustic measurements Multiaccess communication Wireless communication Demodulation Protocols Encryption

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Handling latency in broadcast disk system for mobile computing

Handling latency in broadcast disk system for mobile computi...

引用

international conference on (DFMA) distributed Frameworks for Multimedia Applications

作者： Putra Sumari Rozaida Darus School of Computer Science University of Science Malaysia Minden Penang Malaysia

The rapidly expanding technology of cellular communications, wireless local area network (LAN), wireless data networks and satellite will give mobile users capability of accessing information anywhere and anytime. Data broadcasting algorithm plays an important role as it instructs the server to disseminate large amount of data at fast rate and send to many mobile clients. One of the work known as Broadcast Disk method is creating a sequence of slots containing data and broadcasting them in circular manner to the air. Mobile clients keep listening to the air and catch those slots that interest them. However based on Broadcast Disk method, some slots are empty, which results into bandwidth waste and client waiting time increment. Empty slots are randomly exists which difficult to locate. In this paper we enhance the Broadcast Disk method to overcome the empty slots aims to reduce the latency of users in accessing the service. We manage to locate these empty slots and fill them with popular data. We show by case studies and simulation that our scheme eliminates empty slots and minimizes client latency.

关键词： Mobile communication Servers Broadcasting Bandwidth Information systems Transmitters Silicon

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Adaptive Routing Protocol for Extreme Emergency Ad Hoc Communication

A Hybrid Adaptive Routing Protocol for Extreme Emergency Ad ...

引用

international conference on Computer Communications and networks (ICCCN)

作者： Tipu Arvind Ramrekha Christos Politis Wireless Multimedia & Networking WMN Research Group Kingston London University UK

The autonomous nature of Mobile Ad hoc networks (MANETs) makes them suitable for the support of extreme emergency rescuer IP communications for next generation networks. A major hurdle towards the deployment of emergency MANETs (eMANETs) is the design of a distributed routing protocol that can adapt to its highly dynamic topology where the number of nodes in the network frequently varies. This paper presents ChaMeLeon (CML), a hybrid and adaptive routing protocol designed to adapt to the rapid topological changes in extreme emergency MANETs (eMANETs) when operating within a predefined disaster area. CML adaptively changes its routing behavior according to the number of nodes in the network, so that it can provide a more efficient routing approach than purely proactive or reactive routing protocols for varying size networks. The protocol can operate in one of three routing phases which are the reactive phase (R-phase) for large networks, proactive phase (P-phase) for small networks and oscillation phase (O-phase) for phase transitions based on a network size threshold. This threshold is determined using simulation based performance statistics of the purely reactive or proactive routing protocols. We then present results to demonstrate that CML outperforms its routing counterparts over the simulated range of network sizes and particular critical area.

关键词： Routing Routing protocols Delay Oscillators Ad hoc networks Mobile computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Research on data mining models for the internet of things

Research on data mining models for the internet of things

引用

international conference on Image Analysis and Signal Processing, IASP

作者： Shen Bin Liu Yuan Wang Xiaoyi University of Zhejiang Ningbo China College of Management University of Zhejiang Hangzhou China

In this paper, we propose four data mining models for the Internet of Things, which are multi-layer data mining model, distributed data mining model, Grid based data mining model and data mining model from multi-technology integration perspective. Among them, multi-layer model includes four layers: (1) data collection layer, (2) data management layer, (3) event processing layer, and (4) data mining service layer. distributed data mining model can solve problems from depositing data at different sites. Grid based data mining model allows Grid framework to realize the functions of data mining. Data mining model from multi-technology integration perspective describes the corresponding framework for the future Internet. Several key issues in data mining of IoT are also discussed.

关键词： Data mining Internet Radiofrequency identification Intelligent sensors Pervasive computing Mobile communication Communications technology IP networks Educational institutions Technology management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 216 217 218 219 220 221 222 223 224 225 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：