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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,130 篇 会议
36 篇 期刊文献
4 册 图书

馆藏范围

3,170 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,909 篇 工学
- 1,672 篇 计算机科学与技术...
- 744 篇 信息与通信工程
- 711 篇 电气工程
- 502 篇 软件工程
- 254 篇 测绘科学与技术
- 227 篇 控制科学与工程
- 223 篇 机械工程
- 143 篇 动力工程及工程热...
- 90 篇 仪器科学与技术
- 59 篇 电子科学与技术（可...
- 51 篇 网络空间安全
- 48 篇 安全科学与工程
- 46 篇 交通运输工程
- 28 篇 生物工程
- 27 篇 土木工程
- 22 篇 建筑学
- 13 篇 化学工程与技术
272 篇 理学
- 148 篇 数学
- 53 篇 化学
- 41 篇 系统科学
- 35 篇 统计学（可授理学、...
- 32 篇 生物学
- 26 篇 物理学
221 篇 管理学
- 175 篇 管理科学与工程(可...
- 88 篇 图书情报与档案管...
- 57 篇 工商管理
28 篇 医学
- 20 篇 临床医学
- 11 篇 公共卫生与预防医...
25 篇 法学
- 22 篇 社会学
13 篇 经济学
- 13 篇 应用经济学
10 篇 军事学
9 篇 文学
7 篇 农学
2 篇 教育学
1 篇 艺术学

主题

984 篇 wireless sensor ...
267 篇 sensor systems
223 篇 distributed comp...
182 篇 sensors
165 篇 wireless communi...
156 篇 protocols
149 篇 monitoring
113 篇 sensor networks
110 篇 routing
109 篇 computer network...
103 篇 sensor phenomena...
99 篇 internet of thin...
99 篇 robot sensing sy...
97 篇 energy consumpti...
96 篇 mobile communica...
89 篇 sensor nodes
86 篇 mobile computing
84 篇 energy efficienc...
80 篇 intelligent sens...
77 篇 computer archite...

机构

9 篇 nanjing univ sta...
9 篇 suny stony brook...
8 篇 department of co...
8 篇 school of comput...
7 篇 department of co...
7 篇 state key labora...
7 篇 department of co...
7 篇 hong kong univ s...
6 篇 dalian univ tech...
6 篇 department of el...
6 篇 department of co...
6 篇 missouri univ sc...
6 篇 michigan state u...
6 篇 key lab ubiquito...
6 篇 univ virginia de...
6 篇 univ illinois de...
6 篇 institute of com...
5 篇 college of compu...
5 篇 georgia state un...
5 篇 distributed syst...

作者

17 篇 dharma p. agrawa...
16 篇 sotiris nikolets...
13 篇 agrawal dharma p...
12 篇 abdelzaher tarek
11 篇 bar-noy amotz
11 篇 sarigiannidis pa...
11 篇 voigt thiemo
11 篇 nikoletseas soti...
11 篇 liu yunhao
10 篇 stankovic john a...
10 篇 wu jie
9 篇 panagiotis sarig...
9 篇 lars wolf
9 篇 rothermel kurt
9 篇 jiannong cao
8 篇 thomas lagkas
8 篇 vassiliou vasos
8 篇 lagkas thomas
8 篇 dai haipeng
8 篇 ulf kulau

语言

3,156 篇 英文
10 篇 中文
5 篇 其他

检索条件"任意字段=IEEE International Conference on Distributed Computing in Sensor Systems DCoSS"

共 3170 条记录，以下是2691-2700 订阅

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

详细简洁

排序：

distributed optimal estimation from relative measurements for localization and time synchronization

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Barooah, Prabir da Silva, Neimar Machado Hespanha, Joao P. Univ Calif Santa Barbara Santa Barbara CA 93106 USA Univ Fed Rio de Janeiro Rio De Janeiro Brazil

ISBN: (纸本)3540352279

We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, whose nodes correspond to the variables being estimated and the edges to noisy measurements of the difference between the two variables. This type of measurement model appears in several sensor network problems, such as sensor localization and time synchronization. We consider the optimal estimate for the unknown variables obtained by applying the classical Best Linear Unbiased Estimator, which achieves the minimum variance among all linear unbiased estimators. We propose a new algorithm to compute the optimal estimate in an iterative manner, the Overlapping Subgraph Estimator algorithm. The algorithm is distributed, asynchronous, robust to temporary communication failures, and is guaranteed to converges to the optimal estimate even with temporary communication failures. Simulations for a realistic example show that the algorithm can reduce energy consumption by a factor of two compared to previous algorithms, while achieving the same accuracy. © Springer-Verlag Berlin Heidelberg 2006.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Logical neighborhoods: A programming abstraction for wireless sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Mottola, Luca Picco, Gian Pietro Politecn Milan Dipartimento Elettr & Informat I-20133 Milan Italy

ISBN: (纸本)3540352279

Wireless sensor networks (WSNs) typically exploit a single base station for collecting data and coordinating activities. However, decentralized architectures are rapidly emerging, as witnessed by wireless sensor and actuator networks (WSANs), and in general by solutions involving multiple data sinks, heterogeneous nodes, and in-network coordination. These settings demand new programming abstractions to tame complexity without sacrificing efficiency. In this work we introduce the notion of logical neighborhood, which replaces the physical neighborhood provided by wireless broadcast with a higher-level, application-defined notion of proximity. The span of a logical neighborhood is specified declaratively based on the characteristics of nodes, along with requirements about communication costs. This paper presents the SPIDEY programming language for defining logical neighborhoods, and a routing strategy that efficiently supports the communication enabled by its programming constructs. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Replacing failed sensor nodes by mobile robots

Replacing failed sensor nodes by mobile robots

引用

26th ieee international conference on distributed computing systems Workshops, ICDCS 2006

作者： Mei, Yongguo Xian, Changjiu Das, Saumitra Hu, Y. Charlie Lu, Yung-Hsiang Purdue University West Lafayette United States

ISBN: (纸本)0769525415

sensor replacement is important for sensor networks to provide continuous sensing services. Existing approaches relocate redundant nodes to fill the holes created by failed sensors and require all or most sensor nodes to have mobility. However, mobility equipment is expensive while technology trends are scaling sensors to be smaller and cheaper. In this paper, we propose to use a small number of mobile robots to replace failed sensors in a large-scale static sensor network. We study algorithms for detecting and reporting sensor failures and coordinating the movement of robots that minimize the motion energy of mobile robots and the messaging overhead incurred to the sensor network. A manager receives failure reports and determines which robot to handle a failure. We study three algorithms: a centralized manager algorithm, a fixed distributed manager algorithm, and a dynamic distributed manager algorithm. Our simulations show that: (a) The centralized and the dynamic distributed algorithms have lower motion overhead than the fixed distributed algorithm, (b) The centralized algorithm is less scalable than the two distributed manager algorithms, (c) The two distributed algorithms have higher messaging cost than the centralized algorithm. Hence, the optimal choice of the coordination algorithm depends on the specific scenarios and objectives being optimized. © 2006 ieee.

关键词： Managers

来源：评论

学校读者我要写书评

暂无评论

Cost-based solution for optimizing multi-join queries over distributed streaming sensor data

Cost-based solution for optimizing multi-join queries over d...

引用

international conference on Collaborative computing

作者： Gomes, Joseph Choi, Hyeong-Ah George Washington Univ Dept Comp Sci Washington DC 20052 USA

ISBN: (纸本)9781424404285

sensors are envisioned to be at the center of distributed collaborative computing services involving time-critical decision support. sensors are small devices with limited communication and computational capabilities that collect data on their neighboring physical world and send the data periodically to server machines. sensors form a collaborative network with these servers, where the sensors gather information and the servers perform various operations (e.g. filter, aggregate, join etc) on the information streams in real-time according to predefined queries or rules. sensor data streams are continuous, un-ending and have highly volatile characteristics. As a result, traditional database systems are inappropriate for handling queries for sensor streams, and several stream data management systems have been proposed in the literature. In this paper we focus on a special type of query, namely join queries, which is the most expensive query operator. Here, we address the problem of finding an optimal join tree that maximizes throughput for sliding window based multi-join queries over continuous sensor data streams. We present a polynomial time algorithm Fodp and three variants of Fodp. Our experiments in ARES(1). show that for almost all instances, trees from Fodp and its variants perform close to the optimal trees from our exponential time algorithm OptDP [1], and significantly better than existing XJoin based heuristic algorithms.

关键词： distributed sensors groupware query processing sensor fusion distributed streaming sensor data exponential time algorithm multijoin queries optimal join tree polynomial time algorithm sliding window

来源：评论

学校读者我要写书评

暂无评论

Sluice: Secure dissemination of code updates in sensor networks

Sluice: Secure dissemination of code updates in sensor netwo...

引用

26th ieee Internationa26th ieee international conference on distributed computing systems, ICDCS 2006

作者： Lanigan, Patrick E. Gandhi, Rajeev Narasimhan, Priya Information Networking Institute Carnegie Mellon University Pittsburgh PA 15213 United States ECE Department Carnegie Mellon University Pittsburgh PA 15213 United States

ISBN: (纸本)0769525407

Existing network reprogramming protocols target the efficient, reliable, multi-hop dissemination of application updates in sensor networks, but assume correct or fail-stop behavior from participating sensors. Compromised nodes can subvert such protocols to result in the propagation and remote installation of malicious code. Sluice aims for the progressive, resource-sensitive verification of updates in sensor networks to ensure that malicious updates are not disseminated or installed, while trusted updates continue to be efficiently disseminated. Our verification mechanism provides authenticity and integrity through a hash-chain construction that amortizes the cost of a single digital signature over an entire update. We integrate Sluice with an existing network reprogramming protocol and empirically evaluate its effectiveness both in a real sensor testbed and through simulation. © 2006 ieee.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

A distributed location estimating algorithm for wireless sensor networks

A distributed location estimating algorithm for wireless sen...

引用

ieee international conference on sensor Networks, Ubiquitous, and Trustworthy computing

作者： Sheu, Jang-Ping Li, Jian-Ming Hsu, Chih-Shun Natl Cent Univ Dept CSIE Chungli 320 Taiwan Nanya Tech Inst Dept CSIE Chungli 320 Taiwan

ISBN: (纸本)0769525539

The location estimation is a fundamental and essential issue for wireless sensor networks(WSNs). In this paper, we assume that only a few sensor nodes (named as beacon nodes) get their locations by Global Positioning System (GPS) and the remaining nodes without GPS (named as normal nodes) need to estimate their own locations by gathering the nearby neighboring information. Existing works are either too costly or not accurate enough. To improve previous works, we propose a distributed location estimation algorithm for WSNs. In our algorithm, each node without location information only needs to collect the location information of neighboring nodes and use simple computation to estimate its location. Besides, we improve the accuracy of the normal node's estimative region by discarding the communication area of the beacon node (named as the farther neighboring beacon node), which does not cover the normal node, from the original estimative region. We derive some rules to adjust the estimative region according to the relative location of the normal node and the farther neighboring beacon node. Simulation results show that the proposed algorithm achieves better accuracy of estimative locations.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

DynamicTrust: The trust development in peer-to-peer environments

DynamicTrust: The trust development in peer-to-peer environm...

引用

ieee international conference on sensor Networks, Ubiquitous, and Trustworthy computing

作者： Wang, Yan Varadharajan, Vijay Macquarie Univ Dept Comp Sydney NSW 2109 Australia

ISBN: (纸本)0769525539

In peer-to-peer (P2P) environments, trust is a very important issue when transactions/interactions occur between peers. In general, the trust evaluation on transactions/interactions relies on the recommendations from other peers, which may be inaccurate. This paper presents DynamicTrust, a P2P trust evaluation system. It is based on our peer trust evaluation model, which measures the credibility of peers' recommendations, and thus filters noise in responses and obtains more accurate and objective trust values.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed user access control in sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Wang, Haodong Li, Qun Coll William & Mary Dept Comp Sci Williamsburg VA 23187 USA

ISBN: (纸本)3540352279

User access control in sensor networks defines a process of granting user the access right to the information and resources. It is essential for the future real sensor network deployment in which sensors may provide users with different services in terms of data and resource access. A centralized access control mechanism requires base station to be involved whenever a user requests to get authenticated and access the information stored in the sensor node, which is inefficient, not scalable, and is exposed to many potential attacks along the long communication path. In this paper, we propose a distributed user access control under a realistic adversary model in which sensors can be compromised and user may collude. We split the access control into local authentication conducted by the sensors physically close to the user, and a light remote authentication based on the endorsement of the local sensors. Elliptic Curve Cryptography (ECC), a public key cryptography scheme, is used for local authentication. We implement the access control protocols on a testbed of TelosB motes. Our analysis and experimental results show that our scheme is feasible for real access control requirement. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Y-Threads: Supporting concurrency in wireless sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Nitta, Christopher Pandey, Raju Ramin, Yann Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

ISBN: (纸本)3540352279

Resource constrained systems often are programmed using an event-based model. Many applications do not lend themselves well to an event-based approach, but preemptive multithreading pre-allocates resources that cannot be used even while not in use by the owning thread. In this paper, we propose a hybrid approach called Y-Threads. Y-Threads provide separate small stacks for blocking portions of applications, while allowing for shared stacks for non-blocking computations. We have implemented Y-Threads on Mica and Telos wireless sensor network platforms. The results show that Y-Threads provide a preemptive multithreaded programming model with resource utilization closer to an event-based approach. In addition, relatively large memory buffers can be allocated for temporary use with less overhead than conventional dynamic memory allocation methods. © Springer-Verlag Berlin Heidelberg 2006.

关键词： stack sharing multi-threading concurrency

来源：评论

学校读者我要写书评

暂无评论

POS: A practical order statistics service for wireless sensor networks

POS: A practical order statistics service for wireless senso...

引用

26th ieee Internationa26th ieee international conference on distributed computing systems, ICDCS 2006

作者： Cox, Landon P. Castro, Miguel Rowstron, Antony Duke University Microsoft Research Cambridge

ISBN: (纸本)0769525407

We present the design and implementation of POS, an in-network service that computes accurate order statistics energy-efficiently. POS returns a stream of periodic samples from any order statistic. It initially computes the value of the order statistic and then periodically runs a validation protocol to determine whether the value is still valid. If not, it uses an optimized binary search to determine the new value and then resumes periodic validation. POS uses in-network aggregation and transmission suppression to reduce communication complexity. Results from both experiments on a mote testbed and simulations show that POS can compute order statistics accurately while consuming less energy than the best techniques to compute averages in common cases. © 2006 ieee.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共317页 << < 266 267 268 269 270 271 272 273 274 275 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：