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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

250 篇 会议
7 篇 期刊文献
1 册 图书

馆藏范围

258 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

190 篇 工学
- 182 篇 计算机科学与技术...
- 86 篇 信息与通信工程
- 72 篇 软件工程
- 68 篇 电气工程
- 37 篇 机械工程
- 24 篇 测绘科学与技术
- 19 篇 控制科学与工程
- 13 篇 动力工程及工程热...
- 7 篇 电子科学与技术（可...
- 7 篇 网络空间安全
- 3 篇 建筑学
- 3 篇 化学工程与技术
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 交通运输工程
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
24 篇 理学
- 15 篇 数学
- 5 篇 系统科学
- 3 篇 化学
- 1 篇 物理学
- 1 篇 生物学
- 1 篇 统计学（可授理学、...
19 篇 管理学
- 13 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
6 篇 医学
- 6 篇 临床医学
3 篇 经济学
- 3 篇 应用经济学
1 篇 农学

主题

63 篇 wireless sensor ...
18 篇 protocols
12 篇 routing
12 篇 sensors
10 篇 sensor nodes
10 篇 wireless communi...
10 篇 monitoring
10 篇 internet
10 篇 sensor networks
8 篇 6lowpan
7 篇 quality of servi...
7 篇 security
7 篇 zigbee
7 篇 distributed comp...
6 篇 reliability
6 篇 computer archite...
6 篇 logic gates
6 篇 wireless sensor ...
6 篇 mobile communica...
6 篇 mobile computing

机构

4 篇 department of co...
3 篇 cent s univ sch ...
3 篇 physics departme...
3 篇 zhejiang univ st...
2 篇 uppsala univ upp...
2 篇 univ valencia ir...
2 篇 university of pi...
2 篇 univ elect sci &...
2 篇 univ stuttgart i...
2 篇 inria rocquencou...
2 篇 school of inform...
2 篇 school of comput...
2 篇 swedish inst com...
2 篇 department of ap...
2 篇 school of comput...
2 篇 department of co...
2 篇 univ navarra cei...
2 篇 department of in...
2 篇 department of el...
2 篇 swedish inst com...

作者

5 篇 voigt thiemo
5 篇 duquennoy simon
4 篇 wang guojun
3 篇 roedig utz
3 篇 oikonomou george
3 篇 wang zhi
3 篇 nikoletseas soti...
3 篇 raza shahid
2 篇 watteyne thomas
2 篇 shao shihai
2 篇 baqer m.
2 篇 younis mohamed
2 篇 tang youxi
2 篇 dimitriou tassos
2 篇 minet pascale
2 篇 francisco j. a. ...
2 篇 al nahas beshr
2 篇 wang wei
2 篇 mohamed younis
2 篇 insausti xabier

语言

258 篇 英文

检索条件"任意字段=6th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2010"

共 258 条记录，以下是251-260 订阅

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

详细简洁

排序：

Time-Critical data delivery in wireless sensor networks 10

Time-Critical data delivery in wireless sensor networks

引用

Proceedings of the 6th ieee international conference on distributed computing in sensor systems

作者： Petcharat Suriyachai James Brown Utz Roedig Lancaster University UK

ISBN: (纸本)9783642136504

A number of wireless sensor network (WSN) applications demand timely data delivery. However, existing WSNs are designed to conserve energy and not to support timely data transmission. this paper shows how WSNs can be dimensioned, deployed and operated such that both reliable and timely data delivery is ensured while scarce energy is preserved. the presented solution employs a novel Medium Access Control (MAC) protocol that incorporates topology control mechanisms to ensure timely data delivery and reliability control mechanisms to deal with inherently fluctuating wireless links. An industrial process automation and control scenario at an oil refinery in Portugal is used to define protocol requirements. the paper details a TinyOS implementation of the protocol and its evaluation in a testbed. Under high traffic load, the protocol delivers 100% of data in time using a maximum node duty cycle as little as 2.48%. In an idle network a maximum node duty cycle of only 0.62% is achieved. this proposed protocol is thus an extremely energy efficient solution for time-critical data delivery.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A novel mobility management scheme for target tracking in cluster-based sensor networks 10

A novel mobility management scheme for target tracking in cl...

引用

Proceedings of the 6th ieee international conference on distributed computing in sensor systems

作者： Zhibo Wang Wei Lou Zhi Wang Junchao Ma Honglong Chen State Key Laboratory of Industrial Control Technology Zhejiang University Hangzhou P.R. China Department of Computing The Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9783642136504

Target tracking is a typical and important application of wireless sensor networks (WSNs). In the consideration of scalability and energy efficiency for target tracking in large scale WSNs, it has been employed as an effective solution by organizing the WSNs into clusters. However, tracking a moving target in cluster-based WSNs suffers the boundary problem when the target moves across or along the boundary among clusters. In this paper, we propose a novel scheme, called hybrid cluster-based target tracking (HCTT), which integrates on-demand dynamic clustering into a cluster-based WSN for target tracking. To overcome the boundary problem, when the target moves close to the boundary among clusters, a dynamic cluster will be constructed for the management of target tracking. As the target moves, static clusters and on-demand dynamic clusters alternately manage the tracking task. Simulation results show that the proposed scheme performs better in tracking the moving target when compared with other typical target tracking protocols.

关键词： boundary problem mobility management target tracking wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Almost optimal distributed M2M multicasting in Wireless Mesh Networks

Almost optimal distributed M2M multicasting in Wireless Mesh...

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Qin Xin Fredrik Manne Yan Zhang Jianping Wang Zeyu Zheng Simula Research Laboratory Oslo Norway Department of Informatics University of Bergen Bergen Norway Department of Computer Science City University of Hong Kong Hong Kong China

Wireless Mesh Network (WMN) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. In this paper, we study the problem of multipoint-to-multipoint (M2M) multicasting in a WMN which aims to use the minimum number of time slots to exchange messages among a group of k mesh nodes in a multi-hop WMN with n mesh nodes. We study the M2M multicasting problem in a distributed environment where each participant only knows that there are k participants and it does not know who are other k -1 participants among n mesh nodes. It is known that the computation of an optimal M2M multicasting schedule is NP-hard. We present a fully distributed deterministic algorithm for such an M2M multicasting problem and analyze its time complexity. We show that if the maximum hop distance between any two out of the k participants is d, then the studied M2M multicasting problem can be solved in time O(d log 2 n+k log 3 n/log k) with a polynomial-time computation, which is an almost optimal scheme due to the lower bound Omega(d+ k log n/log k) given in [5]. Our algorithm also improves the currently best known result with running time O(d log 2 n + k log 4 n) in [13]. In this paper, we also propose a distributed deterministic algorithm which accomplishes the M2M multicasting in time O(d+k) with a polynomial-time computation in unit disk graphs. this is an asymptotically optimal algorithm in the sense that there exists a WMN topology, e.g., a line, a ring, a star or a complete graph, in which the M2M multicasting cannot be completed in less than Omega(d+k) units of time.

关键词： Wireless mesh networks Multicast algorithms Broadcasting Mesh networks Network topology Telecommunication network reliability Polynomials distributed computing Routing Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

Stateful mobile modules for sensor networks 10

Stateful mobile modules for sensor networks

引用

Proceedings of the 6th ieee international conference on distributed computing in sensor systems

作者： Moritz Strübe Rüdiger Kapitza Klaus Stengel Michael Daum Falko Dressler Dept. of Computer Science Friedrich-Alexander University Erlangen-Nuremberg Germany

ISBN: (纸本)9783642136504

Most sensor network applications are dominated by the acquisition of sensor values. Due to energy limitations and high energy costs of communication, in-network processing has been proposed as a means to reduce data transfers. As application demands may change over time and nodes run low on energy, get overloaded, or simply face debasing communication capabilities, runtime adaptation is required. In either case, it is useful to be able to migrate computations between neighboring nodes without losing runtime state that might be costly or even impossible to recompute. We propose stateful mobile modules as a basic infrastructure building block to improve adaptiveness and robustness of in-network processing applications. Stateful mobile modules are binary modules linked on the node itself. Even more importantly, they can be transparently migrated from one node to another, thereby keeping statically as well as dynamically allocated memory. this is achieved by an optimized binary format, a memory-efficient linking process and an advanced programming support.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing synchronization in mobile sensor networks with covering 10

Self-stabilizing synchronization in mobile sensor networks w...

引用

Proceedings of the 6th ieee international conference on distributed computing in sensor systems

作者： Joffroy Beauquier Janna Burman University Paris Sud LRI UMR 8623 Orsay Dept. of Industrial Engineering & Management Technion Haifa Israel

ISBN: (纸本)9783642136504

Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides a form of a logical time. this paper presents a self-stabilizing (a tolerating state-corrupting transient faults) phase clock algorithm suited to the model of population protocols with covering. this model has been proposed recently for sensor networks with a very large, possibly unknown number of anonymous mobile agents having small memory. Agents interact in pairs in an asynchronous way subject to the constraints expressed in terms of the cover times of agents. the cover time expresses the “frequency” of an agent to communicate with all the others and abstracts agent’s communication characteristics (e.g. moving speed/patterns, transmitting/receiving capabilities). We show that a phase clock is impossible in the model with only constant-state agents. Hence, we assume an existence of resource-unlimited agent - the base *** clock size and duration of each phase of the proposed phase clock tool are adjustable by the user. We provide application examples of this tool and demonstrate how it can simplify the design of protocols. In particular, it yields a solution to Group Mutual Exclusion problem.

关键词： synchronization phase clock self-stabilization cover time population protocols

来源：评论

学校读者我要写书评

暂无评论

Building (1-ε) dominating sets partition as backbones in wireless sensor networks using distributed graph coloring 10

Building (1-ε) dominating sets partition as backbones in wi...

引用

Proceedings of the 6th ieee international conference on distributed computing in sensor systems

作者： Dhia Mahjoub David W. Matula Bobby B. Lyle School of Engineering Southern Methodist University Dallas TX

ISBN: (纸本)9783642136504

We recently proposed in [19,20] to use sequential graph coloring as a systematic algorithmic method to build (1−ε) dominating sets partition in Wireless sensor Networks (WSN) modeled as Random Geometric Graphs (RGG). the resulting partition of the network into dominating and almost dominating sets can be used as a series of rotating backbones in a WSN to prolong the network lifetime for the benefit of various applications. Graph coloring algorithms in RGGs offer proven constant approximation guarantees on the chromatic number. In this paper, we demonstrate that by combining a local vertex ordering with the greedy color selection strategy, we can in practice, minimize the number of colors used to color an RGG within a very narrow window of the chromatic number and concurrently also obtain a domatic partition size within a competitive factor of the domatic number. We also show that the minimal number of colors results in the first (δ+1) color classes being provably dense enough to form independent sets that are (1−ε) dominating. the resulting first (δ+1) independent sets, where δ is the minimum degree of the graph, are shown to cover typically over 99% of the nodes (e.g. ε<0.01), with at least 20% being fully dominating. these independent sets are subsequently made connected through virtual links using localized proximity rules to constitute planar connected backbones. the novelty of this paper is that we extend our recent work in [20] into the distributed setting and present an extensive experimental evaluation of known distributed coloring algorithms to answer the (1−ε) dominating sets partition problem. these algorithms are both topology and geometry-based and yield O(1) times the chromatic number. they are also shown to be inherently localized with running times in O(Δ) where Δ is the maximum degree of the graph.

关键词： graph coloring distributed algorithm wireless sensor network domatic partition problem (1 - ε) dominating sets partition

来源：评论

学校读者我要写书评

暂无评论

HBD-Authority: Streaming Access Control Model for Hadoop

HBD-Authority: Streaming Access Control Model for Hadoop

引用

Dependability in sensor, Cloud and Big Data systems and Application (DependSys), ieee international conference on

作者： Congwei Chen Marwa A. Elsayed Mohammad Zulkernine School of Computing Queen's University Kingston ON Canada

ISBN: (数字)9781728176512

ISBN: (纸本)9781728176529

Big data analytics, in essence, is becoming the revolution of business intelligence around the world. this momentum has given rise to the hype around analytic technologies, including Apache Hadoop. Hadoop was not originally developed with security in mind. Despite the evolving efforts to integrate security in Hadoop through developing new tools (e.g., Apache Sentry and Ranger) and employing traditional mechanisms (e.g., Kerberos and LDAP), they mainly focus on providing encryption and authentication features, albeit with limited authorization support. Existing solutions in the literature extended these evolving efforts. However, they suffer from limitations, hindering them from providing robust authorization that effectively meets the unique requirements of big data environments. Towards covering this gap, this paper proposes a hybrid authority (HBD-Authority) as a formal attribute-based access control model with context support. this model is established on a novel hybrid approach of authorization transparency that pertains to three fundamental properties of accuracy: correctness, security, and completeness. the model leverages streaming data analytics to foster distributed parallel processing capabilities that achieve multifold benefits: a) efficiently managing the security policies and promptly updating the privileges assigned to a high number of users interacting with the analytic services; b) swiftly deciding and enforcing authorization of requests over data characterized by the 5Vs; and c) providing dynamic protection for data which is frequently updated. the implementation details and experimental evaluation of the proposed model are presented, demonstrating its performance efficiency.

关键词： Authorization Analytical models distributed databases Big Data Parallel processing Data models Security

来源：评论

学校读者我要写书评

暂无评论

Research on Service Bus for distributed Real-time Control systems

Research on Service Bus for Distributed Real-time Control Sy...

引用

2011 6th ieee Joint international Information Technology and Artificial Intelligence conference(ITAIC 2011)

作者： Lixin Du School of Computer Science and Technology,Shandong University School of Information Science and Engineering,University of Jinan Jinan,China Chunsun Duan,Shijun Liu,Wei He School of Computer Science and Technology,Shandong University Jinan,China

Service Oriented Architecture (SOA) is a prevalent paradigm to construct a loose coupling,flexible,scalable *** are many researches on service computing and building applications with *** many enterprises do not only have data-centric applications but also have real-time application systems which need more reliability,efficiency and real *** real-time applications must collect and analyses data from a large variety of heterogeneous sensors and give decisions *** such real-time applications with SOA methodology becomes a *** researches on Internet of things (IOT) and Cyber Physical systems (CPS) are facing similar problems that how to construct distributed control application systems with novel service *** this paper,we show a SOA-based real-time service bus model which can be used to support constructing such distributed Real-time Control systems (DRCS) and discuss the bus mechanism in detail.

关键词： real-time service bus SOA control system

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共26页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：