基于云环境辅助生活系统的设计权衡

Yi Dong, Yonggang Wen, Han Hu, C. Miao, Cyril Leung
{"title":"基于云环境辅助生活系统的设计权衡","authors":"Yi Dong, Yonggang Wen, Han Hu, C. Miao, Cyril Leung","doi":"10.1145/3126973.3129308","DOIUrl":null,"url":null,"abstract":"Ambient assisted living (AAL) has received considerable attention due to its ability to provide services to the elderly by sensors and actuators. However, building such a system is challenging on two fronts. First, the tradeoff between accuracy and monetary cost should be understood. Accuracy of each sensor can be empirically estimated from its sample rate. Typically, higher rate indicates higher accuracy. As a result, higher rate requires more computation resources to process the sampled data, incurring more monetary cost. Second, user needs change frequently. Thus, we need a resource allocation scheme that is (a) able to strike a good balance between accuracy and monetary cost and (b) adaptive enough to meet the frequently changing needs. Unfortunately, several seemingly natural solutions fail on one or more fronts (e.g., simple one shot optimizations). As a result, the potential benefits promised by these prior efforts remain unrealized. To fill the gap, we address these challenges and present the design and analysis of a low-complexity online algorithm to minimize the long-term accuracy-monetary cost on a queue length based control. The design is driven by insights that queue-lengths can be viewed as Lagrangian dual variables and the queue-length evolutions play the role of subgradient updates. Therefore, the control decisions depend only on the instantaneous information and can adapt to the changing needs. Simulations demonstrate that the proposed algorithm can strike a good balance between accuracy and monetary costs. Moreover, the asymptotic optimality of the proposed algorithm has been shown by rigorous analysis and numerical results.","PeriodicalId":370356,"journal":{"name":"International Conference on Crowd Science and Engineering","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Design Tradeoffs for Cloud-Based Ambient Assisted Living Systems\",\"authors\":\"Yi Dong, Yonggang Wen, Han Hu, C. Miao, Cyril Leung\",\"doi\":\"10.1145/3126973.3129308\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ambient assisted living (AAL) has received considerable attention due to its ability to provide services to the elderly by sensors and actuators. However, building such a system is challenging on two fronts. First, the tradeoff between accuracy and monetary cost should be understood. Accuracy of each sensor can be empirically estimated from its sample rate. Typically, higher rate indicates higher accuracy. As a result, higher rate requires more computation resources to process the sampled data, incurring more monetary cost. Second, user needs change frequently. Thus, we need a resource allocation scheme that is (a) able to strike a good balance between accuracy and monetary cost and (b) adaptive enough to meet the frequently changing needs. Unfortunately, several seemingly natural solutions fail on one or more fronts (e.g., simple one shot optimizations). As a result, the potential benefits promised by these prior efforts remain unrealized. To fill the gap, we address these challenges and present the design and analysis of a low-complexity online algorithm to minimize the long-term accuracy-monetary cost on a queue length based control. The design is driven by insights that queue-lengths can be viewed as Lagrangian dual variables and the queue-length evolutions play the role of subgradient updates. Therefore, the control decisions depend only on the instantaneous information and can adapt to the changing needs. Simulations demonstrate that the proposed algorithm can strike a good balance between accuracy and monetary costs. Moreover, the asymptotic optimality of the proposed algorithm has been shown by rigorous analysis and numerical results.\",\"PeriodicalId\":370356,\"journal\":{\"name\":\"International Conference on Crowd Science and Engineering\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Crowd Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3126973.3129308\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Crowd Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3126973.3129308","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

环境辅助生活(AAL)因其通过传感器和执行器为老年人提供服务的能力而受到相当大的关注。然而,建立这样一个系统在两个方面具有挑战性。首先,应该理解准确性和货币成本之间的权衡。每个传感器的精度可以根据其采样率进行经验估计。通常,更高的速率表示更高的准确性。因此,更高的速率需要更多的计算资源来处理采样数据,从而产生更多的货币成本。第二,用户需求经常变化。因此,我们需要一种资源分配方案(a)能够在准确性和货币成本之间取得良好的平衡,(b)具有足够的适应性以满足频繁变化的需求。不幸的是,一些看似自然的解决方案在一个或多个方面失败了(例如,简单的一次性优化)。因此,这些先前的努力所承诺的潜在利益仍然没有实现。为了填补这一空白,我们解决了这些挑战,并提出了一种低复杂度在线算法的设计和分析,以最大限度地减少基于队列长度控制的长期准确性-货币成本。该设计是由这样的见解驱动的:队列长度可以被视为拉格朗日对偶变量,并且队列长度的进化起着次梯度更新的作用。因此,控制决策仅依赖于瞬时信息,能够适应不断变化的需求。仿真结果表明,该算法能够很好地平衡准确率和成本。此外,通过严格的分析和数值结果证明了该算法的渐近最优性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Design Tradeoffs for Cloud-Based Ambient Assisted Living Systems
Ambient assisted living (AAL) has received considerable attention due to its ability to provide services to the elderly by sensors and actuators. However, building such a system is challenging on two fronts. First, the tradeoff between accuracy and monetary cost should be understood. Accuracy of each sensor can be empirically estimated from its sample rate. Typically, higher rate indicates higher accuracy. As a result, higher rate requires more computation resources to process the sampled data, incurring more monetary cost. Second, user needs change frequently. Thus, we need a resource allocation scheme that is (a) able to strike a good balance between accuracy and monetary cost and (b) adaptive enough to meet the frequently changing needs. Unfortunately, several seemingly natural solutions fail on one or more fronts (e.g., simple one shot optimizations). As a result, the potential benefits promised by these prior efforts remain unrealized. To fill the gap, we address these challenges and present the design and analysis of a low-complexity online algorithm to minimize the long-term accuracy-monetary cost on a queue length based control. The design is driven by insights that queue-lengths can be viewed as Lagrangian dual variables and the queue-length evolutions play the role of subgradient updates. Therefore, the control decisions depend only on the instantaneous information and can adapt to the changing needs. Simulations demonstrate that the proposed algorithm can strike a good balance between accuracy and monetary costs. Moreover, the asymptotic optimality of the proposed algorithm has been shown by rigorous analysis and numerical results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Study on Automatic Sleep Stage Classification Based on CNN-LSTM Forecasting Road Surface Temperature in Beijing Based on Machine Learning Algorithms An Intelligent Matching Algorithm of CDCI Model Automatic Segmentation of Left Myocardium in CMR Based on Fully Convolutional Networks LBTask: A Benchmark for Spatial Crowdsourcing Platforms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1