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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

An adaptive scheduling protocol for multi-scale sensor network architecture 07

引用

Proceedings of the 3rd ieee international conference on distributed computing in sensor systems

作者： Santashil PalChaudhuri David B. Johnson Aruba Networks Sunnyvale CA Department of Computer Science Rice University Houston TX

ISBN: (纸本)9783540730897

In self-organizing networks of battery-powered wireless sensors that can sense, process, and communicate, energy is the most crucial and scarce resource. However, since sensor network applications generally exhibit specific limited behaviors, there is both a need and an opportunity for adapting the network architecture to match the application in order to optimize resource utilization. Many applications-such as large-scale collaborative sensing, distributed signal processing, and distributed data assimilation-require sensor data to be available at multiple resolutions, or allow fidelity to be traded-off for energy efficiency. We believe that cross-layering and application-specific adaptability are the primary design principles needed to build sensor networking protocols. In previous work, we proposed an adaptive cross-layered self-organizing hierarchical data service under COMPASS architecture, that enables multi-scale collaboration and communication. In this paper we propose a time division multiplexing medium scheduling protocol tailored for this hierarchical data service, to take advantage of the communication and routing characteristics to achieve close to optimal latency and energy usage. We present an analytical proof on the bounds achieved by the protocol and analyze the performance via detailed simulations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SNTS: sensor network troubleshooting suite 07

引用

Proceedings of the 3rd ieee international conference on distributed computing in sensor systems

作者： Mohammad Maifi Hasan Khan Liqian Luo Chengdu Huang Tarek Abdelzaher University of Illinois at Urbana Chamapign Department of Computer Science

ISBN: (纸本)9783540730897

sensor network troubleshooting is a notoriously difficult task, further exacerbated by resource constraints, unreliable components, unpredictable natural phenomena, and experimental programming paradigms. This paper presents SNTS (sensor Network Troubleshooting Suite), a tool that performs automated failure diagnosis in sensor networks. SNTS can be used to monitor network conditions using simple visualization techniques as well as to troubleshoot deployed distributed sensor systems using data mining approaches. It is composed of (i) a data collection front-end that records events internal to the network and (ii) a data processing back-end for subsequent analysis. We use data mining techniques to automate failure diagnosis on the back-end. The assumption is that the occurrence of execution conditions that cause failures (e.g., traversal of an execution path that contains a "bug" or occurrence of a sequence of events that a protocol was not designed to handle) will have a measurable correlation (by causality) with the resulting failure itself. Hence, by mining for network conditions that correlate with failure states the root causes of failure are revealed with high probability. To evaluate the effectiveness of the tool, we have used it to troubleshoot a tracking system called EnviroTrack [4], which, although performs well most of the time, occasionally fails to track targets correctly. Results show that SNTS can identify the major causes of the problem and give developers useful hints on improving the performance of the tracking system.

关键词： sensor network data mining distributed troubleshooting

来源：评论

学校读者我要写书评

暂无评论

Efficient Detection of distributed Constraint Violations

Efficient Detection of Distributed Constraint Violations

引用

international conference on Data Engineering

作者： Shipra Agrawal Supratim Deb K. V. M. Naidu Rajeev Rastogi Stanford University Stanford CA USA Bell Labs Research Bangalore INDIA

ISBN: (纸本)1424408024

In many distributed environments, the primary function of monitoring software is to detect anomalies, i.e., instances when system behavior deviates substantially from the norm. In this paper, we propose communication-efficient schemes for the anomaly detection problem, which we model as one of detecting the violation of global constraints defined over distributed system variables. Our approach eliminates the need to continuously track the global system state by decomposing global constraints into local constraints that can be checked efficiently at each site. Only in the occasional event that a local constraint is violated, do we resort to more expensive global constraint checking. We show that the problem of selecting the local constraints, based on frequency distribution of individual system variables, so as to minimize the communication cost is NP-hard. We propose approximation algorithms for computing provably near-optimal (in terms of the number of messages) local constraints. Experimental results with real-life network traffic data sets demonstrate that our technique can reduce message communication overhead by as much as 70% compared to existing data distribution-agnostic approaches.

关键词： Monitoring Frequency Costs Approximation algorithms Telecommunication traffic IP networks sensor systems TCPIP Computer crime Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a flexible location directory service for tiered sensor networks 07

引用

Proceedings of the 3rd ieee international conference on distributed computing in sensor systems

作者： Sangeeta Bhattacharya Chien-Liang Fok Chenyang Lu Gruia-Catalin Roman Department of Computer Science and Engineering Washington University in St. Louis

ISBN: (纸本)9783540730897

Many emergent distributed sensing applications need to keep track of mobile entities across multiple sensor networks connected via an IP network. To simplify the realization of such applications, we present MLDS, a Multi-resolution Location Directory Service for tiered sensor networks. MLDS provides a rich set of spatial query services ranging from simple queries about entity location, to complex nearest neighbor queries. Furthermore, MLDS supports multiple query granularities which allow an application to achieve the desired tradeoff between query accuracy and communication cost. We implemented MLDS on Agimone, a unified middleware for sensor and IP networks. We then deployed and evaluated the service on a tiered testbed consisting of tmote nodes and base stations. Our experimental results show that, when compared to a centralized approach, MLDS achieves significant savings in communication cost while still providing a high degree of accuracy, both within a single sensor network and across multiple sensor networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal distributed Multicast Routing using Network Coding

Optimal Distributed Multicast Routing using Network Coding

引用

ieee international conference on Communications (ICC)

作者： Y. Cui Y. Xue K. Nahrstedt Department of Electrical Engineering and Computer Science Vanderbilt University USA Department of Computer Science University of Illinois Urbana-Champaign USA

Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network delay. Recent advances in network coding has shed a new light onto this problem. In network coding, forwarding nodes can perform arbitrary operations on data received, other than forwarding or replicating, to enhance throughput of a multicast session. In this paper, we show that with the aid of network coding, the once intractable optimal multicast routing problem becomes tractable. In this problem, given a set of multicast sessions and their traffic demands, one tries to route the multicast traffic regarding various objectives, such as to minimize overall delay, or to maximize the battery life of each node. We further show that his problem can be solved in a distributed fashion: each node akes its own routing decisions based on periodic updating information from neighboring nodes. We prove that starting from any initial routing assignment, the proposed distributed routing algorithm is able to converge to the point where the value of the objective function is optimized. Our solution can be fit into a variety of networks to achieve different optimization goals. The example in this paper is maximum lifetime routing in multi-hop wireless network.

关键词： Routing Network coding Telecommunication traffic Peer to peer computing Throughput Delay Batteries sensor systems Wireless networks Communications Society

来源：评论

学校读者我要写书评

暂无评论

Compressed and distributed Sensing of Multivariate Neural Point Processes

Compressed and Distributed Sensing of Multivariate Neural Po...

引用

international conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Karim G. Oweiss Electrical and Computer Engineering Department Michigan State University USA

This paper proposes a new approach to simultaneously estimate time-varying intensity functions of multiple point processes from their continuous-time signal representation. We use models of neural response properties in the cortex to illustrate the theory of the proposed approach. Based on sparse representation of the continuous-time signals in the context of compression, it is shown that intensity functions can be approximated reasonably well without the need to decompress and classify the source signals. The approach is best suited for the case when multiple point processes are characterized by non-binary spike waveforms observed with an array of sensors. When spike waveforms from different sources are correlated, the estimated intensities can be inaccurate due to spike classification errors. We therefore build on our previous work for separating correlated spike waveforms to enable enhanced separation of those intensity functions. We finally show that this framework leads to substantial savings in computational complexity for real time operation in resource constrained signal processing systems.

关键词： sensor arrays Signal processing Computational complexity Neurons Biomembranes Kernel Shape distributed computing State estimation Signal representations

来源：评论

学校读者我要写书评

暂无评论

distributed coalition formation in visual sensor networks: a virtual vision approach 07

引用

Proceedings of the 3rd ieee international conference on distributed computing in sensor systems

作者： Faisal Qureshi Demetri Terzopoulos Dept. of Computer Science University of Toronto Toronto ON Canada Dept. of Computer Science University of Toronto Toronto ON Canada and Computer Science Dept. University of California Los Angeles CA

ISBN: (纸本)9783540730897

We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection and aggregation through an announcement/bidding/ selection strategy. It resolves node assignment conflicts by solving an equivalent constraint satisfaction problem. Our technique is scalable, as it lacks any central controller, and it is robust to node failures and imperfect communication. Another unique aspect of our work is that we advocate visually and behaviorally realistic virtual environments as a simulation tool in support of research on largescale camera sensor networks. Specifically, our visual sensor network comprises uncalibrated static and active simulated video surveillance cameras deployed in a virtual train station populated by autonomously self-animating pedestrians. The readily reconfigurable virtual cameras generate synthetic video feeds that emulate those generated by real surveillance cameras monitoring public spaces. Our simulation approach, which runs on high-end commodity PCs, has proven to be beneficial because this type of research would be difficult to carry out in the real world in view of the impediments to deploying and experimenting with an appropriately complex camera network in extensive public spaces.

关键词： sensor coordination and control video surveillance camera sensor networks distributed coalition formation

来源：评论

学校读者我要写书评

暂无评论

Data Salmon: a greedy mobile basestation protocol for efficient data collection in wireless sensor networks 07

引用

Proceedings of the 3rd ieee international conference on distributed computing in sensor systems

作者： Murat Demirbas Onur Soysal Ali Şaman Tosun Dept. of Computer Science & Engineering University at Buffalo Suny Dept. of Computer Science The University of Texas at San Antonio

ISBN: (纸本)9783540730897

Our work addresses the spatiotemporally varying nature of data traffic in environmental monitoring and surveillance applications. By employing a network-controlled mobile basestation (MB), we present a simple energy-efficient data collection protocol for wireless sensor networks (WSNs). In contrast to the existing MB-based solutions where WSN nodes buffer data passively until visited by an MB, our protocol maintains an always-on multihop connectivity to the MB by means of an efficient distributed tracking mechanism. This allows the nodes to forward their data in a timely fashion, avoiding latencies due to long-term buffering. Our protocol progressively relocates the MB closer to the regions that produce higher data rates and reduces the average weighted multihop traffic, enabling energy savings. Using the convexity of the cost function, we prove that our local and greedy protocol is in fact optimal.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing end to end routing performance in wireless sensor networks 07

引用

Proceedings of the 3rd ieee international conference on distributed computing in sensor systems

作者： Chen Wang Guokai Zeng Li Xiao Department of Computer Science and Engineering Michigan State University East Lansing MI

ISBN: (纸本)9783540730897

The geographic routing is an ideal approach to realize pointto-point routing in wireless sensor networks because packets can be delivered by only maintaining a small set of neighbors' physical positions. The geographic routing assumes that a packet can be moved closer to the destination in the network topology if it is moved geographically closer to the destination in the physical space. This assumption, however, only holds in an ideal model where uniformly distributed nodes communicate with neighbors through wireless channels with perfect reception. Because this model oversimplifies the spatial complexity of a wireless sensor network, the geographic routing may often lead a packet to the local minimum or low quality route. Unlike the geographic forwarding, the ETX-embedding proposed in this paper can accurately encode both a network's topological structure and channel quality to small size nodes' virtual coordinates, which makes it possible for greedy forwarding to guide a packet along an optimal routing path. Our performance evaluation based on both the MICA2 sensor platform and TOSSIM simulator shows that the greedy forwarding based on ETX-embedding outperforms previous geographic routing approaches.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A connectivity based partition approach for node scheduling in sensor networks 07

引用

Proceedings of the 3rd ieee international conference on distributed computing in sensor systems

作者： Yong Ding Chen Wang Li Xiao Department of Computer Science and Engineering Michigan State University

ISBN: (纸本)9783540730897

This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensors into groups such that a connected backbone network can be maintained by keeping only one arbitrary node from each group in active status while putting others to sleep. Nodes within each group swap between active and sleeping status occasionally to balance the energy consumption. Unlike previous approaches that partition nodes geographically, CPA is based on the measured connectivity between pairwise nodes and does not depend on nodes' locations. In this paper, we formulate node scheduling as a constrained optimal graph partition problem, and propose CPA as a distributed heuristic partition algorithm. CPA can ensure k-vertex connectivity of the backbone network for its partition so as to achieve the trade-off between saving energy and preserving network communication quality. Moreover, simulation results show that CPA outperforms other approaches in complex environments where the ideal radio propagation model does not hold.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共317页 << < 262 263 264 265 266 267 268 269 270 271 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：