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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Poster: Quadratic-Time Algorithms for Optimal Min-Max Barrier Coverage with Mobile sensors on the Plane 41

Poster: Quadratic-Time Algorithms for Optimal Min-Max Barrie...

引用

41st ieee international conference on distributed computing systems (ICDCS)

作者： Yao, Pei Guo, Longkun Yu, Jiguo Fuzhou Univ Ctr Discrete Math Fuzhou Peoples R China Qilu Univ Technol Sch Comp Sci & Tech Jinan Peoples R China

ISBN: (纸本)9781665445139

Emerging applications impose the min-max line barrier coverage (LBC) problem that aims to minimize the maximum movement of the sensors for the sake of balancing energy consumption. In the paper, we devise an algorithm for LBC that finds an optimal solution within a runtime O (n(2)), improving the previous state-of-art runtime O (n(2) log n) due to [7]. The key idea to accelerating the computation of the optimum solutions is to use approximation solutions that are obtained by our devised approximation algorithm. Numerical experiments demonstrate our algorithms outperform all the other baselines including the previous state-of-art algorithm.

关键词： Fast algorithm barrier coverage optimal solution mobile sensor approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

A Low Energy Consuming Routing Protocol for Wireless sensor Network with IoT Devices 6

A Low Energy Consuming Routing Protocol for Wireless Sensor ...

引用

6th international conference on Intelligent computing and Control systems, ICICCS 2022

作者： Palaniappan, T. Senthilkumar, B. Anbunathan, S.R. Gayathri Devi, P. Dr.Mahalingam College of Engineering and Technology India V.S.B.Engineering College India S. A. Engineering College India Panimalar Institute of Technology India

ISBN: (纸本)9781665410359

A large number of hubs are used in a Wireless sensor Network to keep tabs on the physical and territorial conditions of a certain region. It's safe to say that most of them are self-employed. In the past, WSN has not been extensively used due to its high energy consumption, difficulty operating in natural environments, and so on. The LEACH convention aims to extend the life of Wireless sensor Networks by creating groups that can lead huge organisations. The LEACH convention selects the bunch head through irregular turns of an adjacent group in order to equally spread the energy load across Wireless sensor Networks. distributed nodes communicate with their group leader through moderate *** nodes lose power and packages are dumped at an edge energy level. An optional node replaces the first by merging the notion of PEGASIS with conventional LEACH, in the suggested framework a modification in LEACH convention to extend the lifespan of the whole organisation and avoid information misery. As a result, the Base Station receives more data packets. Data packet delivery ratio is increased and energy consumption is reduced as a result of this method. © 2022 ieee.

关键词： Leaching

来源：评论

学校读者我要写书评

暂无评论

Low-Power Distinct Sum for Wireless sensor Networks

Low-Power Distinct Sum for Wireless Sensor Networks

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Ebram Kamal William Mun Choon Chan National University of Singapore

ISBN: (数字)9781665495127

ISBN: (纸本)9781665495134

Continuous monitoring is a major component of many applications in wireless sensor network (WSN). In these applications, to reduce the communication overhead, some form of data summary or aggregation can be performed. However, performing non-trivial in-network data processing such as finding frequent items, Top-K monitoring, and clustering efficiently are challenging in *** this paper, we present Low-Power Distinct Sum (LDS), a distributed in-network data aggregation primitive that performs the sum of unique items in WSN. LDS serves as the underlying primitive that can be used to implement many distributed data processing efficiently. To demonstrate LDS’s capabilities, we design and implement a distributed data streaming application with LDS running on Contiki OS. Compared to the baseline algorithm, LDS can reduce the completion time by up to 66%.

关键词： Wireless communication Wireless sensor networks distributed databases Data aggregation Data processing sensor systems Monitoring

来源：评论

学校读者我要写书评

暂无评论

distributed Algorithm for Opportunistic Spectrum Access in Dynamic Ad Hoc Networks 16

Distributed Algorithm for Opportunistic Spectrum Access in D...

引用

16th Annual international conference on distributed computing in sensor systems (dcoss)

作者： Kumar, Rohit Darak, Sumit J. Hanawal, Manjesh K. Univ Southern Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90007 USA IIIT Delhi Elect & Commun Engn Algorithm Architecture Lab New Delhi India Indian Inst Technol Ind Engn & Operat Res Dept Mumbai Maharashtra India

ISBN: (纸本)9781728143514

The opportunistic spectrum access (OSA) algorithms allow secondary users (SUs) to exploit vacant channels with an aim to maximize overall spectrum utilization/throughput. The design of OSA algorithm is challenging for ad hoc networks due to lack of coordination among SUs and unknown channel statistics. It becomes even more challenging for the dynamic networks where the SUs can enter or leave the network any time without prior agreement. Most of the existing algorithms assume either prior knowledge of the number of SUs or need wideband sensing to sense all channels simultaneously to guarantee optimal channel allocation among SUs. Our goal in this paper is to develop distributed OSA algorithm for dynamic ad hoc networks that offers higher throughput without compromising on the number of SUs collisions. The proposed distributed algorithm is based on multi-player multi-arm bandit framework and they allow SUs to independently estimate the number of other SUs and channel statistics. We derive the upper bounds on the throughput loss (regret) and number of collisions. Exhaustive synthetic results and experimental results on universal software radio peripherals (USRP) based testbed validate our claims and superiority of the proposed algorithm.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

distributed Adaptive Video Streaming using Inter-Server Data Distribution and Agent-based Adaptive Load Balancing 16

Distributed Adaptive Video Streaming using Inter-Server Data...

引用

16th Annual international conference on distributed computing in sensor systems (dcoss)

作者： Bhowmik, Madhuparna Raghunandan, Arpitha Rudra, Bhawana Natl Inst Technol Karnataka Mangalore India

ISBN: (纸本)9781728143514

As the number and hours of videos available within an organisation increases, as well as it's demand, the need for fast video streaming applications arises. Cloud based services are not cost effective and are not an ideal choice for storing the ever-increasing video data that is usually stored and used only within a particular organisation, like a University. Hence, this paper proposes a web based system design to store and stream videos at a small-scale within an organisation. To improve the video viewing experience for the user, the system is flexible to handle sudden changes, like increase in number of requests. The system requires the use of a cluster of servers to deliver the content as a single server cannot handle the load as number of requests increases. This requires effective load distribution among the servers. This paper proposes a way to design this system for adaptive video streaming. This system is highly scalable and can handle high loads, i.e. a higher number of users connecting to the application simultaneously. This paper proposes an algorithm called inter-server load balancing algorithm with Adaptive Agent-based load balancing to solve this problem. The algorithms also incorporates dynamic video resolution delivery techniques to ensure smooth viewing experience in the whole user experience irrespective of the network speed and bandwidth.

关键词： Load Balancing Resource Replication Video Streaming Adaptiveness Transparency Web Application

来源：评论

学校读者我要写书评

暂无评论

Backup Placement in WSNs in the Network Management distributed Setting 41

Backup Placement in WSNs in the Network Management Distribut...

引用

ieee 41st international conference on distributed computing systems (ICDCS)

作者： Oren, Gal Barenboim, Leonid Technion Israel Inst Technol Dept Comp Sci Haifa Israel Nucl Res Ctr Negev Sci Comp Ctr Beer Sheva Israel Open Univ Israel Dept Math & Comp Sci Raanana Israel

ISBN: (纸本)9781665449328

sensor nodes are inherently a cheap piece of hardware - due to the common need to use many of them over a large area - and usually contain a small amount of RAM and flash memory, which are insufficient in case of high degree of data sampling. An overloaded sensor can harm the data integrity, or even completely reject incoming messages. The problem gets even worse when data should be received from many nodes, as missing data becomes a more common phenomenon as deployed WSNs grow in scale. As a solution, we consider the Backup Placement problem in networks in the network management distributed setting: Given a network graph G = (V, E), the goal of each vertex v is an element of V is selecting a neighbor, such that the maximum number of vertices in V that select the same vertex is minimized. In cases of an overflow, our distributed Adaptive Clustering algorithm (D-ACR) reconfigures the network, by adaptively and hierarchically re-clustering parts of it, based on the rate of incoming data packages in order to minimize the energy-consumption, and prevent premature death of nodes. In the network management setting of a grid, we proved that a backup placement of load at most O(1) can be maintained within O(log(2) n) update time, and an O(n log(2) n) energy consumption using the constructed ACR tree.

关键词： Backup Placement WSNs Network Management distributed Setting

来源：评论

学校读者我要写书评

暂无评论

HAWAD: Hand Washing Detection using Wrist Wearable Inertial sensors 16

HAWAD: Hand Washing Detection using Wrist Wearable Inertial ...

引用

16th Annual international conference on distributed computing in sensor systems (dcoss)

作者： Mondol, Md Abu Sayeed Stankovic, John A. Univ Virginia Dept Comp Sci Charlottesville VA 22903 USA

ISBN: (纸本)9781728143514

Hand hygiene is crucial in preventing the spread of infections and diseases. Lack of hand hygiene is one of the major reasons for healthcare associated infections (HAIs) in hospitals. Adherence to hand hygiene compliance by the workers in the food business is very important for preventing food-borne illness. In addition to healthcare settings and food businesses, hand washing is also vital for personal well-being. Despite the importance of hand hygiene, people often do not wash hands when necessary. Automatic detection of hand washing activity can facilitate just-in-time alerts when a person forgets to wash hands. Monitoring hand washing practices is also essential in ensuring accountability and providing personalized feedback, particularly in hospitals and food businesses. Inertial sensors available in smart wrist devices can capture hand movements, and so it is feasible to detect hand washing using these devices. However, it is challenging to detect hand washing using wrist wearable sensors since hand movements are associated with a wide range of activities. In this paper, we present HAWAD, a robust solution for hand washing detection using wrist wearable inertial sensors. We leverage the distribution of penultimate layer output of a neural network to detect hand washing from a wide range of activities. Our method reduces false positives by 77% and improves F1-score by 30% compared to the baseline method.

关键词： Hand washing inertial sensor smartwatch accelerometer smartwatch

来源：评论

学校读者我要写书评

暂无评论

Proceedings - ieee international conference on distributed computing in sensor systems, dcoss 2012

Proceedings - IEEE International Conference on Distributed C...

引用

8th ieee international conference on distributed computing in sensor systems, dcoss 2012

ISBN: (纸本)9780769547077

The proceedings contain 56 papers. The topics discussed include: should I stay or should I go? maximizing lifetime with relays;network lifetime maximization in delay-tolerant sensor networks with a mobile sink;achieving high lifetime and low delay in very large sensors networks using mobile sinks;efficient mobile data collection with mobile collect;throughput maximization in mobile WSN scheduling with power control and rate selection;coverage estimation in heterogeneous visual sensor networks;adaptive synchronization control with multi-level buffer in wireless multimedia sensor networks;timely report delivery in social swarming applications;personal marks and community certificates: detecting clones in wireless mobile social networks;a ubiquitous publish/subscribe platform for wireless sensor networks with mobile mules;and distributed subspace projection in wireless sensor networks using computational codes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence Enabled distributed Edge computing for Internet of Things Applications 16

Artificial Intelligence Enabled Distributed Edge Computing f...

引用

16th Annual international conference on distributed computing in sensor systems (dcoss)

作者： Fragkos, Georgios Tsiropoulou, Eirini Eleni Papavassiliou, Symeon Univ New Mexico Dept Elect & Comp Engn Albuquerque NM 87131 USA Natl Tech Univ Athens Sch Elect & Comp Engn Athens Greece

ISBN: (纸本)9781728143514

Artificial Intelligence (AI) based techniques are typically used to model decision making in terms of strategies and mechanisms that can result in optimal payoffs for a number of interacting entities, often presenting antagonistic behaviors. In this paper, we propose an AI-enabled multi-access edge computing (MEC) framework, supported by computing-equipped Unmanned Aerial Vehicles (UAVs) to facilitate IoT applications. Initially, the problem of determining the IoT nodes optimal data offloading strategies to the UAV-mounted MEC servers, while accounting for the IoT nodes' communication and computation overhead, is formulated based on a game-theoretic model. The existence of at least one Pure Nash Equilibrium (PNE) point is shown by proving that the game is submodular. Furthermore, different operation points (i.e. offloading strategies) are obtained and studied, based either on the outcome of Best Response Dynamics (BRD) algorithm, or via alternative reinforcement learning approaches (i.e. gradient ascent, log-linear, and Q-learning algorithms), which explore and learn the environment towards determining the users' stable data offloading strategies. The corresponding outcomes and inherent features of these approaches are critically compared against each other, via modeling and simulation.

关键词： Edge computing Game Theory Reinforcement Learning Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Cooperative Charging as Service: Scheduling for Mobile Wireless Rechargeable sensor Networks 41

Cooperative Charging as Service: Scheduling for Mobile Wirel...

引用

41st ieee international conference on distributed computing systems (ICDCS)

作者： Xu, Jia Hu, Suyi Wu, Sixu Zhou, Kaijun Dai, Haipeng Xu, Lijie Nanjing Univ Posts & Telecommun Jiangsu Key Lab Big Data Secur & Intelligent Proc Nanjing 210023 Jiangsu Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China

ISBN: (纸本)9781665445139

Wireless Power Transmission (WPT) has been widely used to replenish energy for Wireless Rechargeable sensor Networks. However, the charging service model, which is of the essence to commercial WPT, has not emerged so far. In this paper, we present a wireless charging service model from the perspective of cooperative charging economics, and formulate the Cooperative Charging Scheduling (CCS) problem for joint optimization of rechargeable devices' charging cost and moving cost. We first propose two intragroup cost sharing schemes to sustain the cooperation among devices. Then, the approximation algorithm CCSA of the CCS problem is proposed based on greedy approach and submodular function minimization. Furthermore, we model the large-scale CCS problem as a coalition formation game and present a game theoretic algorithm CCSGA. We show that CCSGA finally converges to a pure Nash Equilibrium. We conduct simulations, and field experiments on a testbed consisting of 5 chargers and 8 rechargeable sensor nodes. The results show that the average comprehensive cost of CCSA is 27.3% lower than the noncooperation algorithm and is only 7.3% higher than the optimal solution on average. In field experiments, CCSA outperforms the noncooperation algorithm by 42.9% in terms of comprehensive cost on average. Moreover, CCSGA is much faster than the approximation algorithm and is more suitable for large-scale cooperative charging scheduling.

关键词： WRSN cooperative charging service submodular function coalition formation game Nash Equilibrium

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共317页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：