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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,147 篇 会议
12 篇 期刊文献
2 册 图书

馆藏范围

1,161 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

829 篇 工学
- 728 篇 计算机科学与技术...
- 381 篇 电气工程
- 245 篇 信息与通信工程
- 200 篇 测绘科学与技术
- 196 篇 软件工程
- 177 篇 机械工程
- 89 篇 控制科学与工程
- 33 篇 动力工程及工程热...
- 23 篇 电子科学与技术（可...
- 21 篇 仪器科学与技术
- 12 篇 安全科学与工程
- 11 篇 交通运输工程
- 8 篇 网络空间安全
- 7 篇 土木工程
- 5 篇 建筑学
- 4 篇 力学（可授工学、理...
- 3 篇 光学工程
117 篇 理学
- 90 篇 数学
- 22 篇 统计学（可授理学、...
- 15 篇 物理学
- 9 篇 系统科学
- 8 篇 化学
- 5 篇 生物学
- 3 篇 大气科学
77 篇 管理学
- 58 篇 管理科学与工程(可...
- 32 篇 工商管理
- 32 篇 图书情报与档案管...
11 篇 医学
- 10 篇 临床医学
3 篇 经济学
- 3 篇 应用经济学
3 篇 法学
- 3 篇 社会学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

357 篇 wireless sensor ...
82 篇 distributed comp...
78 篇 sensors
61 篇 protocols
58 篇 distributed comp...
57 篇 sensor systems
56 篇 wireless communi...
43 篇 sensor networks
38 篇 energy consumpti...
37 篇 computer science
37 篇 routing
34 篇 monitoring
33 篇 mobile communica...
32 篇 delay
31 篇 wireless telecom...
30 篇 mobile computing
30 篇 computer network...
29 篇 internet of thin...
28 篇 sensor phenomena...
27 篇 wireless sensor ...

机构

7 篇 nanjing univ sta...
5 篇 suny stony brook...
4 篇 uppsala univ upp...
4 篇 college of compu...
4 篇 univ cyprus dept...
4 篇 school of electr...
4 篇 chalmers univ te...
3 篇 tech univ carolo...
3 篇 institute of ope...
3 篇 dalian univ tech...
3 篇 school of big da...
3 篇 univ fed minas g...
3 篇 univ missouri de...
3 篇 univ kiel kiel
3 篇 georgia state un...
3 篇 hamburg univ tec...
3 篇 department of co...
3 篇 washington univ ...
3 篇 eth dept comp sc...
3 篇 univ cyprus dept...

作者

10 篇 voigt thiemo
8 篇 bar-noy amotz
8 篇 vassiliou vasos
8 篇 kulau ulf
8 篇 nikoletseas soti...
7 篇 landsiedel olaf
7 篇 wolf lars
6 篇 xing guoliang
6 篇 thiemo voigt
6 篇 beferull-lozano ...
6 篇 rolim jose
6 篇 angelopoulos con...
6 篇 agrawal dharma p...
6 篇 duquennoy simon
5 篇 baltasar beferul...
5 篇 dai haipeng
5 篇 lars wolf
5 篇 cao jiannong
5 篇 sotiris nikolets...
5 篇 das sajal k.

语言

1,150 篇 英文
9 篇 其他
2 篇 中文

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

共 1161 条记录，以下是341-350 订阅

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

详细简洁

排序：

FlashTrack: A Fast, In-network Tracking System for sensor Networks

FlashTrack: A Fast, In-network Tracking System for Sensor Ne...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Hao Jiang Jiannan Zhai Jason O. Hallstrom School of Computing Clemson University

We revisit the classic object tracking problem with a novel and effective, yet straightforward distributed solution for resource-lean devices. The difficulty of object tracking lies in the mismatch between the limited computational capacity of typical sensor nodes and the processing requirements of typical tracking algorithms. In this paper, we introduce an in-network system for tracking mobile objects using resource-lean sensors. The system is based on a distributed, dynamically-scoped tracking algorithm which alters the event detection region and reporting rate based on object speed. A leader node records the detected samples across the event region and estimates the object's location in situ. We study the performance of our tracking implementation on an 80-node test bed. The results show that it achieves high performance, even for very fast objects, and is readily implemented on resource-lean sensors. While the area is well-studied, the unique combination of algorithmic features represents a significant addition to the literature.

关键词： Target tracking Synchronization Radar tracking Signal processing algorithms sensors Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

sensor Localization via Diversely Polarized Antennas

Sensor Localization via Diversely Polarized Antennas

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Marco Antonio Marques Marinho Edison Pignaton de Freitas João Paulo Carvalho Lustosa da Costa Rafael Timóteo de Sousa Department of Electrical Engineering (ENE) University of Brasília (UnB)

Wireless sensor networks (WSNs) are currently employed in a vast number of different applications ranging from home automation and health care to military systems. Although their application may vary greatly, WSNs share a common set of characteristics such as a limited energy supply and simple hardware. A common issue related with the application of WSNs is sensor localization, for some types of applications it is important that the sensors know the relative or absolute position of other sensors in the network, such as surveillance of monitoring networks. If sensors are randomly placed they may resort a wide range of methods such as Global Navigation Satellite systems (GNSS) or received signal strength indicators (RSSI). In this work we present an alternative to relative sensor localization by employed a crossed dipole antenna in the reception and a known polarization in the transmission. The accuracy of the proposed methods is measured trough numerical simulations and results are presented.

关键词： Estimation Direction-of-arrival estimation Wireless sensor networks Antenna arrays Signal to noise ratio Global Positioning System Dipole antennas

来源：评论

学校读者我要写书评

暂无评论

Decentralizing and Adding Portability to an IoT Test-Bed through Smartphones

Decentralizing and Adding Portability to an IoT Test-Bed thr...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Sotiris Nikoletseas Maria Rapti Theofanis P. Raptis Konstantinos Veroutis Department of Computer Engineering and Informatics University of Patras Greece

In this work, we develop an IPv6 enabled smart building test-bed facility, by combining sensing and communication devices and functionalities. We address the Internet of Things paradigm by using diverse heterogeneous devices such as smartphones, sensor motes, NFC technology and traditional electrical devices, each one serving a specific role in the test-bed facility. Also, we extend a basic actuation component by making it self-aware, in terms of supported resources. Those enhancements allow us to enrich the test-bed's capabilities in terms of M2M communication, portability and decentralization of the actuation process. Finally, we provide a simple smart room scenario for a tunable combination of energy efficiency and comfort, which automatically adjusts the room's light level based on ambient conditions and user preferences and demonstrate the feasibility of our system.

关键词： Smart phones Androids Humanoid robots ieee 802.11 Standards Wireless sensor networks Internet Temperature sensors

来源：评论

学校读者我要写书评

暂无评论

On Properties of Quantized Consensus in Layered sensor Networks

On Properties of Quantized Consensus in Layered Sensor Netwo...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Vardhman Sheth Yan Wan Junfei Xie Shengli Fu Zongli Lin Sajal K. Das Department of Electrical Engineering University of North Texas Denton TX Department of Electrical and Computer Engineering University of Virginia Charlottesville VA Department of Computer Science Missouri University of Science and Technology Rolla MO

In this paper, we study properties of distributed consensus in layered sensor networks of the multi-layer multi-group (MLMG) structure. We show that properly designed MLMG networks maintain decentralized communication, whereas show the advantage of centralized structures. In particular, they require less number of transmissions required to reach consensus. This feature is critical for efficient distributed computing in large-scale sensor network applications. For typical classes of MLMG networks, we mathematically characterize the reduced number of transmissions compared to equivalent egalitarian decentralized structures of the same consensus dynamics. This explicit characterization based on simple graphical characteristics of MLMG structures permits an efficient design of large-scale network structures to meet desired performance requirements. In addition, we characterize the asymptotic and transient properties of consensus in MLMG networks of limited channel rates, using the probabilistic quantization schemes.

关键词： Quantization (signal) Probabilistic logic Topology Transient analysis Encoding Educational institutions Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Soft Real-Time GPRS Traffic Analytics for Commercial M2M Communications Using Spark 1

Soft Real-Time GPRS Traffic Analytics for Commercial M2M Com...

引用

international conference on Smart computing (SMARTCOMP)

作者： Privitera, Gianluca Ghidini, Giacomo Emmons, Stephen P. Levine, David Bellavista, Paolo Smith, Jeffrey O. Univ Bologna Dept Comp Sci & Engn I-40126 Bologna Italy Univ Texas Arlington Dept Comp Sci & Engn Arlington TX 76019 USA Numerex Corp Dallas TX USA

ISBN: (纸本)9781479957118

Commercial applications of wireless sensor networks, also known as machine-to-machine (M2M) communications, feature hundreds of thousands or even millions of devices. These M2M applications often rely on cellular networks like GSM that were not designed with such use cases in mind. Based on our first-hand experience at a large provider of M2M communications solutions, there is a need for soft real-time traffic analytics solutions to help engineers monitor and manage the millions of devices deployed in these M2M applications. We present a solution for soft real-time GPRS traffic analytics built on Apache Spark, a framework for distributed in-memory computing. The proposed solution captures GPRS traffic, processes it, and decorates it with details about the devices, networks, and M2M applications. It then computes a whole array of statistics that are presented in charts and maps on a live Web application dashboard, or may be fed to other systems for data mining. In a series of experiments, previously captured GPRS traffic from real-life commercial M2M applications is played back to the traffic analytics solution at different rates, and is processed on clusters of varying size. Results show that our solution handles GPRS traffic rates of 3,333 packets/sec, which are 2X the rates of an M2M application with close to one million devices, with a latency below one minute on a Spark cluster with four *** slave instances in Amazon EC2 at a cost of $7,665/year. These costs can be reduced to approx. $700/year by bidding on SPOT instances.

关键词： cellular radio packet radio networks telecommunication computing telecommunication traffic wireless sensor networks Amazon EC2 Apache Spark GSM M2M applications cellular networks commercial M2M communications data mining distributed in-memory computing live Web application dashboard machine-to-machine communications soft real-time GPRS traffic analytics Context Ground penetrating radar Monitoring Protocols Real-time systems Sparks machine to machine Wireless sensor networks Packet radio networks Global mobile communication-systems wireless phone Cellular networks telecommunication computing sparks ground penetrating radar cellular radio telecommunication traffic real-time systems data mining protocols Traffic

来源：评论

学校读者我要写书评

暂无评论

On Decentralized In-network Aggregation in Real-World Scenarios with Crowd Mobility

On Decentralized In-network Aggregation in Real-World Scenar...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Michal Gregorczyk Tomasz Pazurkiewicz Konrad Iwanicki University of Warsaw Warsaw Poland

Recently proposed applications for monitoring the behavior of real-world crowds with wireless sensor nodes rely on decentralized in-network aggregation. Although some of the aggregation algorithms for wireless sensor networks seem appealing for such applications, we are not aware of any deployments of these algorithms in real-world scenarios with crowd mobility. As a step toward filling this gap, we thus discuss our experiences with decentralized in-network aggregation from a few such deployments involving up to 177 nodes. We compare two main classes of algorithms for basic aggregates. We show that algorithms based on probabilistic, order- and duplicate-insensitive sketches outperform algorithms based on gradual variance reduction. To this end, however, they have to be adapted considerably to minimize the traffic, latency, and errors of the aggregation process, and to account for some real-world issues. In short, while the algorithms do have a potential for the envisioned crowd-monitoring applications, deploying them is not trivial.

关键词： Aggregates Wireless sensor networks Probabilistic logic Wireless communication Heuristic algorithms Accuracy Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Optimizing router nodes placement for designing distributed sensor networks

Optimizing router nodes placement for designing distributed ...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Mohammad Mozumdar Arun Ganesan Alireza Daragheh Ameri Department of Electrical Engineering California State University Long Beach Long Beach CA USA Dept. of Electr. Eng. California State Univ. Long Beach Long Beach CA USA

Designing a distributed wireless sensor network can be a difficult effort without using simulation tools. These tools should provide a robust and efficient solution for the problem with quick response time. However, available simulation tools for designing wireless sensor networks are very limited. Authors in [1] proposed an interactive design tool based on Dijkstra's algorithm which can assist rapid design of sensor network. However, it has a very high execution time when the network size is relatively large, i.e. n 50. Moreover, it produces a suboptimal solution with large number of router nodes. In this paper, we present efficient and robust synthesis algorithms which exclusively reduce run time for large networks as much as 1000% and also produce a synthesized network with a reduced number of router nodes as much as 150% in comparison to similar previous works.

关键词： Algorithm design and analysis Wireless sensor networks Base stations Clustering algorithms Graphical user interfaces Mathematical model Robustness

来源：评论

学校读者我要写书评

暂无评论

Hole Approximation-Dissemination Scheme for Bounded-Stretch Routing in sensor Networks

Hole Approximation-Dissemination Scheme for Bounded-Stretch ...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Phi-Le Nguyen Khanh-Van Nguyen Ha Noi University of Science and Technology Ha Noi Viet Nam

The routing stretch in a sensor network with a large hole can be controlled if the network nodes have certain information about the hole location and shape, possibly by using some mechanism for hole boundary approximation and information dissemination. However, a finer approximation (for smaller stretch) leads to higher cost of dissemination, which could be unaffordable for the sensors. We provide an insightful analysis to this fundamental trade-off of the hole approximation problem, using a geometric model. Based on this we discuss an efficient approximation-dissemination scheme using a natural, heuristic approximation technique. For reasonable conditions (network is dense enough apart from the hole), we assure that the routing stretch is under a predefined threshold > 1 while the dissemination cost is also under tight control. Our initial experiment results also confirm that our approach is significantly more efficient and economical, compared to existing proposals.

关键词： Approximation methods Routing Approximation algorithms Shape Proposals Protocols Face

来源：评论

学校读者我要写书评

暂无评论

A Comparison of On-Mote Lossy Compression Algorithms for Wireless Seismic Data Acquisition

A Comparison of On-Mote Lossy Compression Algorithms for Wir...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Marc J. Rubin Michael B. Wakin Tracy Camp Dept. of Electrical Engineering and Computer Science Colorado School of Mines Golden CO

In this article, we rigorously compare compressive sampling (CS) to four state of the art, on-mote, lossy compression algorithms (K-run-length encoding (KRLE), lightweight temporal compression (LTC), wavelet quantization thresholding and run-length encoding (WQTR), and a low-pass filtered fast Fourier transform (FFT)). Specifically, we first simulate lossy compression on two real-world seismic data sets, and we then evaluate algorithm performance using implementations on real hardware. In terms of compression rates, recovered signal error, power consumption, and classification accuracy of a seismic event detection task (on decompressed signals), results show that CS performs comparable to (and in many cases better than) the other algorithms evaluated. The main benefit to users is that CS, a lightweight and non-adaptive compression technique, can guarantee a desired level of compression performance (and thus, radio usage and power consumption) without subjugating recovered signal quality. Our contribution is a novel and rigorous comparison of five state of the art, on-mote, lossy compression algorithms in simulation on real-world data sets and implemented on hardware.

关键词： Accuracy Compression algorithms Encoding Slabs Wavelet transforms Wireless sensor networks Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Modelling and Performance Analysis of Wireless sensor Networks Using Process Mining Techniques: ContikiMAC Use Case

Modelling and Performance Analysis of Wireless Sensor Networ...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Francois Despaux Ye-Qiong Song Abdelkader Lahmadi LORIA Université de Lorraine Vandoeuvre-lès-Nancy France

In the current protocol stack for Internet of Things in general and wireless sensor network in particular, many devices rely on the Contiki MAC protocol at their MAC layer. This protocol is widely used and enabled by default for several industrial environments and time sensitive monitoring and control applications. However, few work exists regarding the performance of this protocol because it lacks of an underlying theoretical model for analysing its performance. In this paper, we propose a novel approach relying on process mining technique that aims to obtain a Markov chain model for networks running the Contiki MAC protocol. In particular, we present a comprehensive specification of the protocol and a Markov chain model obtained through the analysis and instrumentation of its reference implementation. We used the obtained Markov chain to analyze and estimate the end to end delay distribution for a multi-hops transmission with static routing. The approach can also be extended to a wide range of protocols.

关键词： Markov processes Delays Media Access Protocol Analytical models Data mining Computational modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共117页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：