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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

65 篇 期刊文献
53 篇 会议
5 篇 学位论文

馆藏范围

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

日期分布

学科分类号

103 篇 工学
- 54 篇 计算机科学与技术...
- 51 篇 信息与通信工程
- 46 篇 电气工程
- 15 篇 仪器科学与技术
- 11 篇 电子科学与技术（可...
- 8 篇 控制科学与工程
- 6 篇 机械工程
- 3 篇 土木工程
- 3 篇 交通运输工程
- 3 篇 软件工程
- 2 篇 材料科学与工程（可...
- 1 篇 力学（可授工学、理...
- 1 篇 动力工程及工程热...
- 1 篇 建筑学
- 1 篇 水利工程
- 1 篇 石油与天然气工程
- 1 篇 生物工程
25 篇 理学
- 10 篇 物理学
- 8 篇 数学
- 7 篇 化学
- 5 篇 生物学
- 3 篇 统计学（可授理学、...
- 1 篇 地球物理学
- 1 篇 系统科学
10 篇 管理学
- 10 篇 管理科学与工程(可...
2 篇 农学
- 1 篇 作物学
2 篇 医学
- 1 篇 临床医学

主题

123 篇 coverage problem
27 篇 wireless sensor ...
12 篇 wireless sensor ...
9 篇 sensor network
6 篇 sensor networks
5 篇 connectivity
5 篇 approximation al...
5 篇 sensor deploymen...
5 篇 wireless network
5 篇 genetic algorith...
4 篇 ad hoc network
4 篇 uav
3 篇 reliability
3 篇 radio planning
3 篇 distributed algo...
3 篇 spline function
3 篇 target-barrier c...
3 篇 set covering pro...
3 篇 wlan
3 篇 computer geometr...

机构

3 篇 chinese acad sci...
3 篇 natl tsing hua u...
3 篇 taiyuan univ sci...
3 篇 natl kaohsiung u...
2 篇 politecn milan d...
2 篇 univ belgrade fa...
2 篇 anhui univ techn...
2 篇 natl chiao tung ...
1 篇 chinese acad sci...
1 篇 john naisbitt un...
1 篇 yazd univ dept e...
1 篇 west bengal stat...
1 篇 the 76315 troops...
1 篇 georgia state un...
1 篇 dei politecn mil...
1 篇 shandong lab com...
1 篇 marmara univ dep...
1 篇 tamkang univ gra...
1 篇 natl chiao tung ...
1 篇 chulalongkorn un...

作者

5 篇 liu bing-hong
3 篇 amaldi e
3 篇 capone a
3 篇 wu jie
3 篇 cui zhihua
3 篇 cesana m
3 篇 malucelli f
3 篇 ke wei-chieh
3 篇 soyturk mujdat
3 篇 tsai ming-jer
2 篇 goupil alban
2 篇 chi-fu huang
2 篇 wei linna
2 篇 rebai maher
2 篇 cheng chien-fu
2 篇 li deying
2 篇 al-naffouri tare...
2 篇 tseng yc
2 篇 yu-chee tseng
2 篇 sheu jang-ping

语言

115 篇 英文
6 篇 其他
2 篇 中文

检索条件"主题词=coverage problem"

共 123 条记录，以下是91-100 订阅

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

详细简洁

排序：

Decentralized Computation of Homology in Wireless Sensor Networks Using Spanning Trees 1st

Decentralized Computation of Homology in Wireless Sensor Net...

引用

1st IFIP TC 5, WG 8.4, 8.9, 12.9 International Cross-Domain Conference on Machine Learning and Knowledge Extraction (CD-MAKE)

作者： Soberl, Domen Kosta, Neza Mramor Skraba, Primoz Univ Ljubljana Fac Comp & Informat Sci Vecna Pot 113 SI-1000 Ljubljana Slovenia Jozef Stefan Inst Jamova Cesta 39 SI-1000 Ljubljana Slovenia

ISBN: (纸本)9783319668086;9783319668079

When deploying a wireless sensor network over an area of interest, the information on signal coverage is critical. It has been shown that even when geometric position and orientation of individual nodes is not known, useful information on coverage can still be deduced based on connectivity data. In recent years, homological criteria have been introduced to verify complete signal coverage, given only the network communication graph. However, their algorithmic implementation has been limited due to high computational complexity of centralized algorithms, and high demand for communication in decentralized solutions, where a network employs the processing power of its nodes to check the coverage autonomously. To mitigate these problems, known approaches impose certain limitations on network topologies. In this paper, we propose a novel distributed algorithm which uses spanning trees to verify homology-based network coverage criteria, and works for arbitrary network topologies. We demonstrate that its communication demands are suitable even for low-bandwidth wireless sensor networks.

关键词： Wireless sensor networks coverage problem Simplicial homology Computational homology Rips complex

来源：评论

学校读者我要写书评

暂无评论

Traffic-Aware Access-Points Deployment Strategies for VANETS 6

引用

6th International ICST Conference on Ad Hoc Networks (ADHOCNETS)

作者： Kchiche, Amine Kamoun, Farouk Univ Manouba ENSI CRISTAL Lab Manouba 2010 Tunisia

ISBN: (纸本)9783319133294;9783319133287

Using WLAN-hotspots to provide access to mobile users has proven its feasibility and interest in many cases such as mesh and vehicular networks. Nevertheless, VANETs are still looking for deployment strategies that would ensure a maximum data exchange and a well balanced access. The high mobility and density of users and the impossibility to provide a full coverage make such requirements a hard challenge. In this paper we make a quick review of the commonly used deployment schemes and show their limits regarding real VANETs constraints. We analyze the deployment problem taking into account the vehicular density and the resulting contention problem. We formalize the problem and provide a centrality-based deployment aiming a global service-access optimization and a p-center based deployment aiming fairness as a second objective. We evaluate through simulation the performance of our proposed schemes and show their efficiency and benefits in comparison to other deployment strategies.

关键词： VANET AccessPoint deployment coverage problem

来源：评论

学校读者我要写书评

暂无评论

WLAN coverage planning: Optimization models and algorithms

WLAN coverage planning: Optimization models and algorithms

引用

59th IEEE Vehicular Technology Conference

作者： Amaldi, E Capone, A Cesana, M Malucelli, F Palazzo, F Politecn Milan DEI I-20133 Milan Italy

ISBN: (纸本)0780382552

The impressive market spread of IFEE 802.11 based Wireless Local Area Networks (WLANs) is calling for quantitative approaches in the network planning procedure. It is common belief that such networks have the potentials to replace traditional indoor wired local networks and allow flexible access outdoor, eventually competing with classical cellular systems (GSM, GPRS, UMTS, etc.). The appropriate positioning of the Access Points (AP) is crucial to determine the network effectiveness. In a companion paper we argue that previously proposed approaches to coverage planning neglect the features of the IEEE 802.11 access mechanism, which limits system capacity when access points coverage areas overlap. In this paper we describe the optimization models with hyperbolic and quadratic objective functions that directly accounts system capacity and we propose heuristics combining greedy and local search phases. Computational results show that our heuristics provide near-optimal solutions within a reasonable amount of time.

关键词： WLAN radio planning coverage problem set covering problem 802.11 wireless hot spots

来源：评论

学校读者我要写书评

暂无评论

Connected Area coverage Sets in Wireless Sensor Networks

Connected Area Coverage Sets in Wireless Sensor Networks

引用

3rd International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2007)

作者： Liu, David Q. Indiana Univ Purdue Univ Ft Wayne IN 46805 USA

ISBN: (纸本)9781424413119

Wireless Sensor Networks consist of small senor nodes with limited battery and processing capability. During any time, a number of senor nodes must be kept active to sense the covered area and maintain the connectivity to the base station. This paper addresses the minimum connected area coverage set problem with equal sensing and communicating radii. With location information of its neighhor, each node selects minimum number of its neighbor nodes as sensing and forwarding nodes to cover the sensing area of itself and all its neighbors and guarantee the connectivity to all its two-hop neighbors. After exchanging the sensing and forwarding node set with its neighbors, each node decides whether it should be active. The active sensor nodes together guarantee area coverage and connectivity. The proposed algorithm is fully localized with O(n log n) time complexity and O(n) message complexity where n is the maximum number of neighbors.

关键词： coverage problem connectivity wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

ALGORITHM FOR SOLVING OPTIMAL SENSOR DEVICES PLACEMENT problem IN AREAS WITH NATURAL OBSTACLES

ALGORITHM FOR SOLVING OPTIMAL SENSOR DEVICES PLACEMENT PROBL...

引用

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)

作者： Dziubenko, I. N. Tatarnikova, T. M. State Univ Aerosp Instrumentat Informat & Commun Syst St Petersburg Russia

ISBN: (纸本)9781538676325

This paper proposes a genetic algorithm for solving the problem of placing sensor devices in the monitoring area with obstacles in the form of buildings, trees and other objects. The correspondence of terms borrowed from evolutionary theory to terms of the genetic algorithm is given, which allows the algorithm to be adapted for solving the placement problem. Methods for coding parameters of the algorithm and solution of the placement problem are described. The paper demonstrates the results of the program implementation of the genetic algorithm in which the solution is visualized as a map of the monitoring territory with recognized obstacles and placed sensor devices with their coverage areas.

关键词： sensor field sensor device monitoring area coverage problem placement of sensory devices on the territory natural obstacles genetic algorithm evolutionary algorithm theory

来源：评论

学校读者我要写书评

暂无评论

Connected partial Hybrid-type target coverage model in wireless sensor networks

Connected partial Hybrid-type target coverage model in wirel...

引用

International Conference on Recent Trends in Materials and Mechanical Engineering (ICRTMME 2011)

作者： Wang, Maowen Guo, Baopin Shenzhen Univ Key Lab Optoelect Devices & Syst Minist Educ Shenzhen 518060 Guangdong Peoples R China

ISBN: (纸本)9783037850992

This model has the advantage of solving the sensor coverage problems with complex target types. In this paper, we analyze the problem of Clifford connected partial Hybrid-type target coverage where cover sets are allowed to monitor a subset of the Hybrid-type targets at any point in time, while Clifford connectivity with the base station is retained. We analyzed the Clifford connection Partial target coverage, and proposed an algorithm- CSNCPCCA on the basis of the Clifford connecting partial Hybrid-type coverage model of Clifford sensor network. At the same time the deployment of the sensor network achieves full coverage and connectivity among working nodes. Finally, we tested and verified the rationality of the model and the algorithm with actual data.

关键词： Clifford geometric algebra Sensor network coverage problem Hybrid type target

来源：评论

学校读者我要写书评

暂无评论

Aerial-Ground Vehicle Path Coordination Algorithms for Monitoring Applications 2

Aerial-Ground Vehicle Path Coordination Algorithms for Monit...

引用

Conference on Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications II Part of SPIE Defense + Commercial Sensing Conference

作者： Chour, Kenny Rathinam, Sivakumar Darbha, Swaroop Texas A&M Univ 3123 TAMU College Stn TX 77843 USA

ISBN: (纸本)9781510636040

This study concerns a multi-UAV path planning problem in concert with a known ground vehicle path. The environment is given as a grid map, where each cell is either a target, an obstacle or contains nothing (neutral). Respectively, each cell has a reward that is either positive, negative, or zero. The team of UAVs has to visit as many targets as possible under a given time span or distance constraint, to maximize the collected reward. More formally, this problem is a generalization of the Orienteering problem (OP) and is NP-Hard. In addition, the inclusion of obstacle avoidance and area coverage introduces additional complications that the current literature has not readily addressed. We propose using a greedy heuristic based on the A* algorithm, which involves three stages (selection, insertion, and post-processing) to solve this problem. A large scale problem instance is generated and the results are presented for different variations of our proposed algorithm. For large problems with thousand of nodes, our algorithm was able to provide a feasible solution to the proposed problem within few minutes of computation time on a standard laptop.

关键词： coverage problem team orienteering traveling salesman multi-path planning budget constraint

来源：评论

学校读者我要写书评

暂无评论

Algorithms for WLAN coverage planning

引用

1st International Workshop of the EURO-NGI-Network-of-Excellence

作者： Amaldi, E Capone, A Cesana, M Fratta, L Malucelli, F Politecn Milan DEI I-20133 Milan Italy

ISBN: (纸本)3540253297

The impressive market spread of IEEE 802.11 based Wireless Local Area Networks (WLANs) is calling for quantitative approaches in the network planning procedure. It is common belief that such networks have the potentials to replace traditional indoor wired local networks and allow flexible access outdoor, eventually competing with classical cellular systems (GSM, GPRS, UMTS, etc.). The appropriate positioning of the Access Points (AP) is crucial to determine the network effectiveness. In a companion paper we argue that previously proposed approaches to coverage planning neglect the features of the IEEE 802.11 access mechanism, which limits system capacity when access points coverage areas overlap. In this paper we describe the optimization models with hyperbolic and quadratic objective functions that directly accounts for system capacity and we propose heuristics combining greedy and local search phases. Computational results show that our heuristics provide near-optimal solutions within a reasonable amount of time.

关键词： WLAN radio planning coverage problem set covering problem 802.11 wireless hot spots

来源：评论

学校读者我要写书评

暂无评论

Optimization of artificial dispersion in salvo firing.

Optimization of artificial dispersion in salvo firing.

引用

作者： Kisi, Takasi United States Naval Postgraduate School

学位级别：博士

In salvo firing, the smallest ballistic dispersion is not always most desirable. Deliberate increase of the ballistic dispersion can improve the probability of des- troying the target. Our concern in this dissertation is the optimization of such "artificial 11 dispersion in two- dimensional salvo models. In some cases no closed form solution is available, but we are able to offer efficient methods for the computation or approximation of the salvo kill probability. In other cases we are able to derive approximate formulae for the optimal ballistic dispersion.

关键词： Firing coverage problem Salvo kill probability Optimal ballistic dispersion

来源：评论

学校读者我要写书评

暂无评论

Minimizing Energy Consumption with Devices Placement and Scheduling in Internet of Things 16th

Minimizing Energy Consumption with Devices Placement and Sch...

引用

16th International Conference on Wireless Algorithms, Systems, and Applications (WASA)

作者： Luo, Chuanwen Hong, Yi Chen, Zhibo Li, Deying Yu, Jiguo Beijing Forestry Univ Sch Informat Sci & Technol Beijing 100083 Peoples R China Natl Forestry & Grassland Adm Engn Res Ctr Forestry Oriented Intelligent Inform Beijing 100083 Peoples R China Renmin Univ China Sch Informat Beijing 100083 Peoples R China Qilu Univ Technol Sch Comp Sci & Technol Shandong Acad Sci Jinan 250353 Shandong Peoples R China Shandong Lab Comp Networks Jinan 250014 Peoples R China

ISBN: (纸本)9783030859282;9783030859275

The Internet of Things (IoT) is an emerging paradigm which makes billions of IoT devices integrate to the Internet, and enables them to gather and exchange information. The Low-Power Wide Area Network (LPWAN) technologies, such as LoRa, SigFox, NB-IoT, bring new renovation to the wireless communication between end devices in the IoTs, which can provide larger coverage and support a large number of IoT devices to connect Internet with few gateways. Based on these technologies, we can directly deploy IoT devices on the candidate locations to cover targets without considering multi-hops data transmission to the base station like the traditional wireless sensor networks. In this paper, we investigate the problem of the Minimum Energy consumption of IoT devices through Placement and Scheduling (MEPS), where we consider both the placement and scheduling of IoT devices to monitor all targets such that all targets are continuously observed for a certain period of time. The objective of the problem is to minimize the total energy consumption of the IoT devices. We first propose the mathematical model for the MEPS problem and prove that the MEPS problem is NP-hard. Then we study two sub-problems of the MEPS problem, Minimum Location coverage (MLC) and Minimum Energy consumption Scheduling Deployment (MESD), and propose an approximation algorithm for each of them. Based on these two sub-problems, we propose an approximation algorithm with the approximation ratio 2(ln m + 1) for the MEPS problem, where m is the number of targets.

关键词： coverage problem Internet of Things Network placement and scheduling Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共13页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：