2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献

筛选
英文 中文
Global performance metrics for synchronization of heterogeneously rated power systems: The role of machine models and inertia 异构额定电力系统同步的全局性能度量:机器模型和惯性的作用
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2017-10-19 DOI: 10.1109/ALLERTON.2017.8262755
F. Paganini, Enrique Mallada
{"title":"Global performance metrics for synchronization of heterogeneously rated power systems: The role of machine models and inertia","authors":"F. Paganini, Enrique Mallada","doi":"10.1109/ALLERTON.2017.8262755","DOIUrl":"https://doi.org/10.1109/ALLERTON.2017.8262755","url":null,"abstract":"A recent trend in control of power systems has sought to quantify the synchronization dynamics in terms of a global performance metric, compute it under very simplified assumptions, and use it to gain insight on the role of system parameters, in particular, inertia. In this paper, we wish to extend this approach to more realistic scenarios, by incorporating the heterogeneity of machine ratings, more complete machine models, and also to more closely map it to classical power engineering notions such as Nadir, Rate of Change of Frequency (RoCoF), and inter-area oscillations. We consider the system response to a step change in power excitation, and define the system frequency as a weighted average of generator frequencies (with weights proportional to each machine's rating); we characterize Nadir and RoCoF by the L∞ norm of the system frequency and its derivative, respectively, and inter-areas oscillations by the L2 norm of the error of the vector of bus frequencies w.r.t. the system frequency. For machine models where the dynamic parameters (inertia, damping, etc.) are proportional to rating, we analytically compute these norms and use them to show that the role of inertia is more nuanced than in the conventional wisdom. With the classical swing dynamics, inertia constant plays a secondary role in performance. It is only when the turbine dynamics are introduced that the benefits of inertia become more prominent.","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124609063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 36
On stochastic proximal-point method for convex-composite optimization 凸复合优化的随机近点法
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2017-10-06 DOI: 10.1109/ALLERTON.2017.8262738
A. Nedić, T. Tatarenko
{"title":"On stochastic proximal-point method for convex-composite optimization","authors":"A. Nedić, T. Tatarenko","doi":"10.1109/ALLERTON.2017.8262738","DOIUrl":"https://doi.org/10.1109/ALLERTON.2017.8262738","url":null,"abstract":"We study stochastic proximal-point method applied to a convex-composite optimization problem, where the objective function is given as the sum of two convex functions, one of which is smooth while the other is not necessarily smooth but has a simple structure for evaluating the proximal operator. The main goal is to investigate a trade-off between the choice of a constant stepsize value and the speed at which the algorithm approaches the optimal points. We consider the case of a strongly convex objective function and make the most standard assumptions on the smooth component function and its stochastic gradient estimates. First of all, we analyze the basic properties of the stochastic proximal-point mapping associated with the procedure under consideration. Based on these properties, we formulate the main result, which provides the explicit condition on the constant stepsize for which the stochastic proximal-point method approaches a σ-neighborhood of the optimal point in expectation, where the parameter σ > 0 is related to the variance of the stochastic gradient estimates. Moreover, the rate at which the σ-neighborhood attracts the iterates is geometric, which allows us to estimate the number of iterations the procedure needs to enter this region (in expectation).","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124781197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Evolution of social power for opinion dynamics networks 舆论动态网络的社会权力演变
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2017-10-04 DOI: 10.1109/ALLERTON.2017.8262808
S. Rey, Patricio Reyes-Bedoya, Alonso Silva
{"title":"Evolution of social power for opinion dynamics networks","authors":"S. Rey, Patricio Reyes-Bedoya, Alonso Silva","doi":"10.1109/ALLERTON.2017.8262808","DOIUrl":"https://doi.org/10.1109/ALLERTON.2017.8262808","url":null,"abstract":"This article studies the evolution of opinions and interpersonal influence structures in a group of agents as they discuss a sequence of issues, each of which follows an opinion dynamics model. In this work, we propose a general opinion dynamics model and an evolution of interpersonal influence structures based on the model of reflected appraisals proposed by Friedkin. Our contributions can be summarized as follows: (i) we introduce a model of opinion dynamics and evolution of interpersonal influence structures between issues viewed as a best response cost minimization to the neighbor's actions (ii) we show that DeGroot's and Friedkin-Johnsen's models of opinion dynamics and their evolution of interpersonal influence structures are particular cases of our proposed model, and (iii) we prove the existence of an equilibrium. This work is a step towards providing a solid formulation of the evolution of opinions and interpersonal influence structures over a sequence of issues.","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122035486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Novel inner bounds with uncoded cache placement for combination networks with end-user-caches 具有终端用户缓存的组合网络的具有未编码缓存放置的新颖内界
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2017-10-03 DOI: 10.1109/ALLERTON.2017.8262760
Kai Wan, Mingyue Ji, P. Piantanida, Daniela Tuninetti
{"title":"Novel inner bounds with uncoded cache placement for combination networks with end-user-caches","authors":"Kai Wan, Mingyue Ji, P. Piantanida, Daniela Tuninetti","doi":"10.1109/ALLERTON.2017.8262760","DOIUrl":"https://doi.org/10.1109/ALLERTON.2017.8262760","url":null,"abstract":"This paper considers combination networks with end-user-caches, where a server with N files communicates through H relays (without caches) to K = (Hr) users equipped with caches of size M files. In this setting, each user is connected to a different subset of r relays. The tradeoff between the cache size and the worst-case download time is studied. Several novel caching schemes are proposed, which leverage the symmetries of combination networks and interference elimination at the end-users. The proposed schemes are proved: (i) to be optimal for some choices of the parameters (N, M, H, r) under the constraint of uncoded cache placement, and (ii) to outperform the state-of-the-art schemes in numerical evaluations.","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123039978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Distributed stochastic optimization in networks with low informational exchange 低信息交换网络中的分布式随机优化
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2017-10-03 DOI: 10.1109/ALLERTON.2017.8262868
Wenjie Li, M. Assaad, P. Duhamel
{"title":"Distributed stochastic optimization in networks with low informational exchange","authors":"Wenjie Li, M. Assaad, P. Duhamel","doi":"10.1109/ALLERTON.2017.8262868","DOIUrl":"https://doi.org/10.1109/ALLERTON.2017.8262868","url":null,"abstract":"We consider the problem of distributed stochastic optimization in networks. Each node adjusts its action in order to optimize the global utility of the network, which is defined as the sum of local utilities of all nodes. Since the computation of the gradient may require much information exchange, we consider here that each node only has a noisy numerical observation of its local utility. This assumption is quite realistic, especially when the system is too complicated or constantly changing. At each time, nodes may exchange the observation of their numerical local utilities to estimate the global utility. Under the assumptions whether each node has collected the local utilities of all the other nodes or only part of these utilities, we propose two stochastic perturbation based distributed algorithms. We use tools from stochastic approximation to prove that both algorithms converge to the optimum. We then apply our algorithm to a power control problem in wireless networks and present numerical results that corroborate our claim.","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114559060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
The impact of load models in an algorithm for improving voltage stability via demand response 负荷模型对通过需求响应提高电压稳定性算法的影响
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2017-10-01 DOI: 10.1109/ALLERTON.2017.8262731
Mengqi Yao, D. Molzahn, J. Mathieu
{"title":"The impact of load models in an algorithm for improving voltage stability via demand response","authors":"Mengqi Yao, D. Molzahn, J. Mathieu","doi":"10.1109/ALLERTON.2017.8262731","DOIUrl":"https://doi.org/10.1109/ALLERTON.2017.8262731","url":null,"abstract":"Increasing communication and control capabilities will allow future power system operators to exploit large quantities of responsive demand. This paper discusses ongoing work that employs demand response to improve voltage stability via virtual spatial shifting of loads (i.e., altering the locational distribution of power consumption in one time period with an energy payback in a following time period). In this paper, we study the impact of load models on a previously proposed iterative linearization algorithm to determine loading patterns that maximize a voltage stability margin, namely, the smallest singular value (SSV) of the power flow Jacobian matrix. Specifically, we extend the algorithm to enable inclusion of composite load models consisting of both “ZIP” components and a steady-state squirrel-cage induction machine (IM) model. We then investigate the impact of different load models on both the stability margin and the loading pattern. Using the IEEE 14-bus system as an illustrative example, the results show that the type of load model affects the nominal system's SSV, the optimal SSV, and the optimal loading pattern. The maximum-achievable percent change in SSV is larger using IM models than using ZIP models. We also discuss the difficulty in interpreting the stability margin when the system undergoes structural changes resulting from the use of different voltage-dependent load models.","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125098611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Serial concatenation of reed muller and LDPC codes with low error floor 低错误层的芦苇穆勒码和LDPC码的串行连接
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2017-10-01 DOI: 10.1109/ALLERTON.2017.8262804
Xin Xiao, Mona Nasseri, B. Vasic, Shu Lin
{"title":"Serial concatenation of reed muller and LDPC codes with low error floor","authors":"Xin Xiao, Mona Nasseri, B. Vasic, Shu Lin","doi":"10.1109/ALLERTON.2017.8262804","DOIUrl":"https://doi.org/10.1109/ALLERTON.2017.8262804","url":null,"abstract":"In this paper, we propose a concatenated coding scheme involving an outer Reed-Muller (RM) code and an inner Finite Field low-density parity check (LDPC) code of medium length and high rate. It lowers the error floor of inner Finite Field LDPC code. This concatenation scheme offers flexibility in design and it is easy to implement. In addition, the decoding works in a serial turbo manner and has no harmful trapping sets of size smaller than the minimum distance of the outer code. The simulation results indicate that the proposed serial concatenation can eliminate the dominant trapping sets of the inner Finite Field LDPC code.","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125511686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
An FDR-oriented approach to multiple sequential fault detection and isolation 面向fdr的多顺序故障检测与隔离方法
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2017-10-01 DOI: 10.1109/ALLERTON.2017.8262795
Jie Chen, Wenyi Zhang, H. Poor
{"title":"An FDR-oriented approach to multiple sequential fault detection and isolation","authors":"Jie Chen, Wenyi Zhang, H. Poor","doi":"10.1109/ALLERTON.2017.8262795","DOIUrl":"https://doi.org/10.1109/ALLERTON.2017.8262795","url":null,"abstract":"The problem of sequential fault detection and isolation in multiple data streams is considered. In this work, it is assumed that many independent parallel data streams, each of which has a (possibly infinite) change point, are sequentially observed with a maximum sampling constraint. The pre-change data follow a known distribution, and the post-change data follow one of J possible distributions. A sequential procedure is proposed to detect the changes for all data streams, and to isolate the types of changes upon their detection. The sequential procedure is shown to control the false discovery rate. An asymptotic upper bound on the average detection delay over the parallel data streams is also derived. A simulation study is presented to illustrate the proposed procedure and to corroborate the analysis.","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"2007 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125585944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Bayesian function optimization with adaptive discretization 自适应离散化贝叶斯函数优化
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2017-10-01 DOI: 10.1109/ALLERTON.2017.8262783
S. Shekhar, T. Javidi
{"title":"Bayesian function optimization with adaptive discretization","authors":"S. Shekhar, T. Javidi","doi":"10.1109/ALLERTON.2017.8262783","DOIUrl":"https://doi.org/10.1109/ALLERTON.2017.8262783","url":null,"abstract":"In this paper, the problem of maximizing a blackbox function f : X → R is studied in the Bayesian framework with a Gaussian Process (GP) prior. In particular, a new algorithm for this problem is proposed, and high probability bounds on its simple and cumulative regret are established. The query point selection rule in most existing methods involves an exhaustive search over an increasingly fine sequence of uniform discretizations of X. The proposed algorithm, in contrast, adaptively refines X which leads to a lower computational complexity, particularly for high dimensional X. In addition to the computational gains, sufficient conditions are identified under which the regret bounds of the new algorithm improve upon the known results. Finally an extension of the algorithm to the case of contextual bandits is proposed, and high probability bounds on the contextual regret are presented.","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115581413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A model predictive control approach to flow pacing for TCP 一种基于模型预测的TCP流量调节控制方法
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2017-10-01 DOI: 10.1109/ALLERTON.2017.8262845
David Fridovich-Keil, Nathan Hanford, Margaret P. Chapman, C. Tomlin, M. Farrens, D. Ghosal
{"title":"A model predictive control approach to flow pacing for TCP","authors":"David Fridovich-Keil, Nathan Hanford, Margaret P. Chapman, C. Tomlin, M. Farrens, D. Ghosal","doi":"10.1109/ALLERTON.2017.8262845","DOIUrl":"https://doi.org/10.1109/ALLERTON.2017.8262845","url":null,"abstract":"A key challenge in the management of Internet traffic is the design of algorithms that complement well-established protocols, such as the Transmission Control Protocol (TCP), and simultaneously address their limitations. The challenge becomes greater in the context of large so-called “elephant” flows over long paths that often transition from higher to lower bandwidth connections. At these transition points either persistent queues are formed when buffers are over-provisioned or packet loss occurs when buffers are under-provisioned; both cases lead to degraded and/or highly variable end-to-end performance. Ideally, for such scenarios, the source should “learn” and set a pacing rate that matches the lower bandwidth connection. In this paper, we adopt a model-based receding horizon control strategy to design a pacing control method. Each new round-trip time (RTT) measurement is first incorporated into a linear time-varying (LTV) predictive model. Subsequently, we solve a one-step look-ahead optimization problem which finds the pacing rate which optimally trades off RTT, variance in RTT, and throughput according to the most up-to-date model. We implemented our proof-of-concept control strategy on the Linux operating system alongside the existing CoDel queuing discipline (qdisc) and HTCP congestion-control algorithm. Our preliminary results indicate significant reduction in the variances of the RTT and the throughput, resulting in more predictable performance overall.","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116235032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书