最后的程序

J. Rosenthal, D. Gilliam, M. Alber, J. Ball, V. Blondel, K. Gałkowski, T. Georgiou, Koichi Hashimoto, B. Hanzon, M. E. Valcher, V. Vinnikov, Xiaochang A. Wang, S. Zampieri, B. Datta, J. Helton
{"title":"最后的程序","authors":"J. Rosenthal, D. Gilliam, M. Alber, J. Ball, V. Blondel, K. Gałkowski, T. Georgiou, Koichi Hashimoto, B. Hanzon, M. E. Valcher, V. Vinnikov, Xiaochang A. Wang, S. Zampieri, B. Datta, J. Helton","doi":"10.4269/ajtmh.2008.79.1a","DOIUrl":null,"url":null,"abstract":"s of Presented Talks Monday August 12, 2002 8:30-9:30 Room : 101 Plenary Talk Bruce Hajek (University of Illinois) A Basket of System Theoretic Problems in Communications Researchers are currently faced with a rich set of problems in the design and analysis of wireless communication systems and high-speed communication networks. The purpose of this talk is to survey several significant open problems which system theory could play a role in solving. The problems include: (a) Providing delay constraints in a large communication network in a distributed way, using delay calculus based on the max-plus algebra, (b) Finding the capacity of cellular networks (will survey the recent use of the theory of large random matrices and related free probability theory), (c) Predicting efficiency and fairness, and designing allocation mechanisms, for the Internet, as thousands of autonomous systems interact through self-interested pricing and congestion, and (d) Distributing limited routing information in a large amorphous network, such as a peer-to-peer network or ad hoc sensor array, to facilitate position location. 9:30-10:30 Room : 101 Invited Talk Roger Brockett (Harvard University) Optimal System Identification for NMR Applications In a wide variety of settings, the measurement of nuclear magnetic resonance (NMR) effects has proven to be a remarkably effective for investigating unknown structures on both large and small scales. Over the years a large body of technique has been developed for improving the sensitivity and resolution of NMR measurements and many recent advances in biochemistry and medicine are dependent on the sophisticated signal processing techniques now used routinely. From a system theoretic perspective, problems in this area can be thought of as identification problems involving bilinear systems. They are distinguished from linear system identification problems by the fact that the quality of the identification is strongly dependent upon the form of the excitatory input applied to the system. Many ingenious techniques, such as the “two dimensional” Fourier transform procedure have been developed based on particular types of input patterns. Because of the low signal to noise ratios inherent in NMR, the optimization of such methods requires the use of stochastic models for the dynamics and measurement processes. In this talk we take a fresh look at problems in this area with a view toward finding computational procedures that will determine the inputs which will optimize specific performance measures. In particular, we explore performance measures related to conditional entropy, and in this way develop a formalism for establishing the mathematical limits on what can be accomplished with better input design. 9:30-10:30 Room : 102 Invited Talk Hans-Andrea Loeliger (ETH) Factor Graphs, Least Squares and Kalman Filtering Factor graphs are graphical models with origins in coding theory and with close relations to Willems-type behavioral system theory. The sum(mary)-product algorithm, which operates by message passing in the factor graph, subsumes a great variety of algorithms in coding, signal processing, and artificial intelligence. In this talk, we apply Forney-style factor graphs to linear models with quadratic cost functions and we show how general versions of Kalman filtering and recursive least squares algorithms arise as instances of the sumproduct algorithm. (An ”isomorphism” of such factor graphs with electrical networks is presented in a separate talk.) 9:30-10:30 Room : 136 Invited Talk Sjoerd Verduyn Lunel (University of Leiden) Control and Stabilization of Systems with Time Delays For dynamical systems governed by feedback laws, time delays arise naturally in the feedback loop to represent effects due to communication, transmission, transportation or tern effects. The introduction of time delays in a system of differential equations results in an infinite dimensional state space. In this paper we give an overview of the basic theory and discuss recent developments concerning the control and stabilization of systems with delays.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Final program\",\"authors\":\"J. Rosenthal, D. Gilliam, M. Alber, J. Ball, V. Blondel, K. Gałkowski, T. Georgiou, Koichi Hashimoto, B. Hanzon, M. E. Valcher, V. Vinnikov, Xiaochang A. Wang, S. Zampieri, B. Datta, J. Helton\",\"doi\":\"10.4269/ajtmh.2008.79.1a\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"s of Presented Talks Monday August 12, 2002 8:30-9:30 Room : 101 Plenary Talk Bruce Hajek (University of Illinois) A Basket of System Theoretic Problems in Communications Researchers are currently faced with a rich set of problems in the design and analysis of wireless communication systems and high-speed communication networks. The purpose of this talk is to survey several significant open problems which system theory could play a role in solving. The problems include: (a) Providing delay constraints in a large communication network in a distributed way, using delay calculus based on the max-plus algebra, (b) Finding the capacity of cellular networks (will survey the recent use of the theory of large random matrices and related free probability theory), (c) Predicting efficiency and fairness, and designing allocation mechanisms, for the Internet, as thousands of autonomous systems interact through self-interested pricing and congestion, and (d) Distributing limited routing information in a large amorphous network, such as a peer-to-peer network or ad hoc sensor array, to facilitate position location. 9:30-10:30 Room : 101 Invited Talk Roger Brockett (Harvard University) Optimal System Identification for NMR Applications In a wide variety of settings, the measurement of nuclear magnetic resonance (NMR) effects has proven to be a remarkably effective for investigating unknown structures on both large and small scales. Over the years a large body of technique has been developed for improving the sensitivity and resolution of NMR measurements and many recent advances in biochemistry and medicine are dependent on the sophisticated signal processing techniques now used routinely. From a system theoretic perspective, problems in this area can be thought of as identification problems involving bilinear systems. They are distinguished from linear system identification problems by the fact that the quality of the identification is strongly dependent upon the form of the excitatory input applied to the system. Many ingenious techniques, such as the “two dimensional” Fourier transform procedure have been developed based on particular types of input patterns. Because of the low signal to noise ratios inherent in NMR, the optimization of such methods requires the use of stochastic models for the dynamics and measurement processes. In this talk we take a fresh look at problems in this area with a view toward finding computational procedures that will determine the inputs which will optimize specific performance measures. In particular, we explore performance measures related to conditional entropy, and in this way develop a formalism for establishing the mathematical limits on what can be accomplished with better input design. 9:30-10:30 Room : 102 Invited Talk Hans-Andrea Loeliger (ETH) Factor Graphs, Least Squares and Kalman Filtering Factor graphs are graphical models with origins in coding theory and with close relations to Willems-type behavioral system theory. The sum(mary)-product algorithm, which operates by message passing in the factor graph, subsumes a great variety of algorithms in coding, signal processing, and artificial intelligence. In this talk, we apply Forney-style factor graphs to linear models with quadratic cost functions and we show how general versions of Kalman filtering and recursive least squares algorithms arise as instances of the sumproduct algorithm. (An ”isomorphism” of such factor graphs with electrical networks is presented in a separate talk.) 9:30-10:30 Room : 136 Invited Talk Sjoerd Verduyn Lunel (University of Leiden) Control and Stabilization of Systems with Time Delays For dynamical systems governed by feedback laws, time delays arise naturally in the feedback loop to represent effects due to communication, transmission, transportation or tern effects. The introduction of time delays in a system of differential equations results in an infinite dimensional state space. In this paper we give an overview of the basic theory and discuss recent developments concerning the control and stabilization of systems with delays.\",\"PeriodicalId\":269952,\"journal\":{\"name\":\"The 16th Asia-Pacific Network Operations and Management Symposium\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 16th Asia-Pacific Network Operations and Management Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4269/ajtmh.2008.79.1a\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 16th Asia-Pacific Network Operations and Management Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4269/ajtmh.2008.79.1a","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

讲座时间2002年8月12日星期一8:30-9:30教室:101全体会议布鲁斯·哈杰克(伊利诺伊大学)通信中的一篮子系统理论问题研究人员目前在无线通信系统和高速通信网络的设计和分析方面面临着一系列丰富的问题。这次演讲的目的是调查几个重要的开放性问题,系统理论可以在解决这些问题中发挥作用。这些问题包括:(a)使用基于max-plus代数的延迟演算,以分布式方式在大型通信网络中提供延迟约束;(b)寻找蜂窝网络的容量(将调查大型随机矩阵理论和相关自由概率论的最新使用);(c)预测互联网的效率和公平性,并设计分配机制,因为成千上万的自治系统通过自利定价和拥塞进行交互;(d)在大型无定形网络(如点对点网络或自组织传感器阵列)中分布有限的路由信息,以方便位置定位。罗杰·布罗克特(哈佛大学)核磁共振应用的最佳系统识别在各种各样的环境中,核磁共振(NMR)效应的测量已被证明是在大尺度和小尺度上研究未知结构的非常有效的方法。多年来,为了提高核磁共振测量的灵敏度和分辨率,已经开发了大量的技术,生物化学和医学的许多最新进展都依赖于现在常规使用的复杂信号处理技术。从系统理论的角度来看,这一领域的问题可以被认为是涉及双线性系统的识别问题。它们与线性系统识别问题的区别在于,识别的质量强烈依赖于应用于系统的兴奋性输入的形式。许多巧妙的技术,如“二维”傅立叶变换程序已经基于特定类型的输入模式开发出来。由于核磁共振固有的低信噪比,这种方法的优化需要使用动态和测量过程的随机模型。在这次演讲中,我们将以一种全新的视角来看待这一领域的问题,以期找到能够确定将优化特定性能度量的输入的计算程序。特别是,我们探索了与条件熵相关的性能度量,并以这种方式开发了一种形式化的方法,用于建立更好的输入设计可以完成的数学限制。Hans-Andrea Loeliger (ETH)因子图、最小二乘法和卡尔曼滤波因子图是起源于编码理论的图形模型,与williams型行为系统理论有着密切的关系。和(多)积算法是通过因子图中的信息传递来操作的,它包含了编码、信号处理和人工智能中的各种算法。在这次演讲中,我们将把福尼式因子图应用于具有二次成本函数的线性模型,并展示卡尔曼滤波和递归最小二乘算法的一般版本如何作为和积算法的实例出现。(这种因子图与电网络的“同构”将在单独的演讲中提出)9:30-10:30房间:136特邀演讲Sjoerd Verduyn Lunel(莱顿大学)时滞系统的控制与稳定对于受反馈律支配的动态系统,反馈回路中自然产生的时滞表示由于通信、传输、运输或术语效应而产生的影响。在微分方程系统中引入时滞会导致无限维的状态空间。本文概述了时滞系统控制与镇定的基本理论,并讨论了时滞系统控制与镇定的最新进展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Final program
s of Presented Talks Monday August 12, 2002 8:30-9:30 Room : 101 Plenary Talk Bruce Hajek (University of Illinois) A Basket of System Theoretic Problems in Communications Researchers are currently faced with a rich set of problems in the design and analysis of wireless communication systems and high-speed communication networks. The purpose of this talk is to survey several significant open problems which system theory could play a role in solving. The problems include: (a) Providing delay constraints in a large communication network in a distributed way, using delay calculus based on the max-plus algebra, (b) Finding the capacity of cellular networks (will survey the recent use of the theory of large random matrices and related free probability theory), (c) Predicting efficiency and fairness, and designing allocation mechanisms, for the Internet, as thousands of autonomous systems interact through self-interested pricing and congestion, and (d) Distributing limited routing information in a large amorphous network, such as a peer-to-peer network or ad hoc sensor array, to facilitate position location. 9:30-10:30 Room : 101 Invited Talk Roger Brockett (Harvard University) Optimal System Identification for NMR Applications In a wide variety of settings, the measurement of nuclear magnetic resonance (NMR) effects has proven to be a remarkably effective for investigating unknown structures on both large and small scales. Over the years a large body of technique has been developed for improving the sensitivity and resolution of NMR measurements and many recent advances in biochemistry and medicine are dependent on the sophisticated signal processing techniques now used routinely. From a system theoretic perspective, problems in this area can be thought of as identification problems involving bilinear systems. They are distinguished from linear system identification problems by the fact that the quality of the identification is strongly dependent upon the form of the excitatory input applied to the system. Many ingenious techniques, such as the “two dimensional” Fourier transform procedure have been developed based on particular types of input patterns. Because of the low signal to noise ratios inherent in NMR, the optimization of such methods requires the use of stochastic models for the dynamics and measurement processes. In this talk we take a fresh look at problems in this area with a view toward finding computational procedures that will determine the inputs which will optimize specific performance measures. In particular, we explore performance measures related to conditional entropy, and in this way develop a formalism for establishing the mathematical limits on what can be accomplished with better input design. 9:30-10:30 Room : 102 Invited Talk Hans-Andrea Loeliger (ETH) Factor Graphs, Least Squares and Kalman Filtering Factor graphs are graphical models with origins in coding theory and with close relations to Willems-type behavioral system theory. The sum(mary)-product algorithm, which operates by message passing in the factor graph, subsumes a great variety of algorithms in coding, signal processing, and artificial intelligence. In this talk, we apply Forney-style factor graphs to linear models with quadratic cost functions and we show how general versions of Kalman filtering and recursive least squares algorithms arise as instances of the sumproduct algorithm. (An ”isomorphism” of such factor graphs with electrical networks is presented in a separate talk.) 9:30-10:30 Room : 136 Invited Talk Sjoerd Verduyn Lunel (University of Leiden) Control and Stabilization of Systems with Time Delays For dynamical systems governed by feedback laws, time delays arise naturally in the feedback loop to represent effects due to communication, transmission, transportation or tern effects. The introduction of time delays in a system of differential equations results in an infinite dimensional state space. In this paper we give an overview of the basic theory and discuss recent developments concerning the control and stabilization of systems with delays.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Final program Quality management and network faults diagnosis for IPTV service Adaptive decision making for improving trust establishment in VANET A traffic load balancing method for component-based service platform with heterogeneous wireless access networks A comparison of 4G telecommunications tariff plans in Asia countries
×
引用
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