Pub Date : 2008-01-16DOI: 10.1109/TSMCB.2007.913557
D. Cook
{"title":"Defining the Scope of SMCB","authors":"D. Cook","doi":"10.1109/TSMCB.2007.913557","DOIUrl":"https://doi.org/10.1109/TSMCB.2007.913557","url":null,"abstract":"","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2008-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80060224","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}
Pub Date : 2008-01-01DOI: 10.7551/mitpress/7437.003.0063
E. Crone, W. MolenvanderM.
{"title":"Neurocognitive development of performance monitoring and decision making","authors":"E. Crone, W. MolenvanderM.","doi":"10.7551/mitpress/7437.003.0063","DOIUrl":"https://doi.org/10.7551/mitpress/7437.003.0063","url":null,"abstract":"","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87116328","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}
Pub Date : 2007-12-14DOI: 10.1002/9780470050118.ecse464
Jiming Liu, Xiaolong Jin, K. Tsui
This article describes a new programming paradigm called autonomy-oriented computing (AOC), which describes the construct of synthetic autonomy in locally interacting entities, and use the aggregated effects of entity interactions to generate desired global solutions or systems dynamics. The fundamental working mechanism of self-organization that underlies the AOC paradigm offers the advantages of natural formulation as well as scalable performance to characterize complex systems or to computationally hard problems that are distributed and large scale in nature. Keywords: autonomy-oriented computing (AOC); synthetic autonomy; emergent autonomy; self-organization; antonomous entities; multi-agent systems
{"title":"Autonomy-Oriented Computing (AOC)","authors":"Jiming Liu, Xiaolong Jin, K. Tsui","doi":"10.1002/9780470050118.ecse464","DOIUrl":"https://doi.org/10.1002/9780470050118.ecse464","url":null,"abstract":"This article describes a new programming paradigm called autonomy-oriented computing (AOC), which describes the construct of synthetic autonomy in locally interacting entities, and use the aggregated effects of entity interactions to generate desired global solutions or systems dynamics. The fundamental working mechanism of self-organization that underlies the AOC paradigm offers the advantages of natural formulation as well as scalable performance to characterize complex systems or to computationally hard problems that are distributed and large scale in nature. \u0000 \u0000 \u0000Keywords: \u0000 \u0000autonomy-oriented computing (AOC); \u0000synthetic autonomy; \u0000emergent autonomy; \u0000self-organization; \u0000antonomous entities; \u0000multi-agent systems","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":"34 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2007-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79760402","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}
Pub Date : 2007-10-01DOI: 10.1109/TSMCB.2007.903196
K. Boyer, V. Govindaraju, N. Ratha
The fourteen papers in this special section are devoted to recent advancements in biometric systems and application devices.
在这个特殊部分的14篇论文致力于生物识别系统和应用设备的最新进展。
{"title":"Introduction to the Special Issue on Recent Advances in Biometric Systems [Guest Editorial]","authors":"K. Boyer, V. Govindaraju, N. Ratha","doi":"10.1109/TSMCB.2007.903196","DOIUrl":"https://doi.org/10.1109/TSMCB.2007.903196","url":null,"abstract":"The fourteen papers in this special section are devoted to recent advancements in biometric systems and application devices.","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":"16 1","pages":"1091-1095"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75547984","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}
A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online optimization scheme to be of practical value in a distributed setting, however, it must successfully tackle the curses of dimensionality and modeling. This paper develops a hierarchical control framework to solve performance management problems in distributed computing systems operating in a data center. Concepts from approximation theory are used to reduce the computational burden of controlling such large-scale systems. The relevant approximations are made in the construction of the dynamical models to predict system behavior and in the solution of the associated control equations. Using a dynamic resource-provisioning problem as a case study, we show that a computing system managed by the proposed control framework with approximation models realizes profit gains that are, in the best case, within 1% of a controller using an explicit model of the system.
{"title":"Approximation Modeling for the Online Performance Management of Distributed Computing Systems","authors":"D. Kusic, Nagarajan Kandasamy, Guofei Jiang","doi":"10.1109/ICAC.2007.8","DOIUrl":"https://doi.org/10.1109/ICAC.2007.8","url":null,"abstract":"A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online optimization scheme to be of practical value in a distributed setting, however, it must successfully tackle the curses of dimensionality and modeling. This paper develops a hierarchical control framework to solve performance management problems in distributed computing systems operating in a data center. Concepts from approximation theory are used to reduce the computational burden of controlling such large-scale systems. The relevant approximations are made in the construction of the dynamical models to predict system behavior and in the solution of the associated control equations. Using a dynamic resource-provisioning problem as a case study, we show that a computing system managed by the proposed control framework with approximation models realizes profit gains that are, in the best case, within 1% of a controller using an explicit model of the system.","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":"17 1","pages":"1221-1233"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87795031","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}
Pub Date : 2007-04-01DOI: 10.1109/TSMCB.2006.886946
Y. Demiris, A. Billard
This special issue contains selected extended contributions from both the Adaptation in Artificial and Biological Systems symposium held in Hertforshire in 2006 and the wider academic community following a public call for papers in 2006. The papers presented serve as a good illustration of the challenges faced by robotics researchers today in the field of programming by observation, demonstration, and imitation.
{"title":"Special Issue on Robot Learning by Observation, Demonstration, and Imitation","authors":"Y. Demiris, A. Billard","doi":"10.1109/TSMCB.2006.886946","DOIUrl":"https://doi.org/10.1109/TSMCB.2006.886946","url":null,"abstract":"This special issue contains selected extended contributions from both the Adaptation in Artificial and Biological Systems symposium held in Hertforshire in 2006 and the wider academic community following a public call for papers in 2006. The papers presented serve as a good illustration of the challenges faced by robotics researchers today in the field of programming by observation, demonstration, and imitation.","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":"6 1","pages":"254-255"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84426904","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}
Pub Date : 2007-04-01DOI: 10.1109/FOCI.2007.372188
M. Nokleby, W. Stirling
Satisficing game theory offers an alternative to classical game theory that describes a flexible model of players' social interactions. Players' utility functions depend on other players' attitudes rather than simply their actions. However, satisficing players with conflicting attitudes may enact dysfunctional behaviors, which results in poor performance. We present an evolutionary method by which a population of players may adapt their attitudes to improve payoff. In addition, we extend the Nash-equilibrium concept to satisficing games, showing that the method leads players toward the equilibrium in their attitudes. We apply these ideas to the stag hunt-a simple game in which cooperation does not easily evolve from noncooperation. The evolutionary method provides two major contributions. First, satisficing players may improve their performance by adapting their attitudes. Second, numerical results demonstrate that cooperation in the stag hunt can emerge much more readily under the method we present than under traditional evolutionary models.
{"title":"Attitude Adaptation in Satisficing Games","authors":"M. Nokleby, W. Stirling","doi":"10.1109/FOCI.2007.372188","DOIUrl":"https://doi.org/10.1109/FOCI.2007.372188","url":null,"abstract":"Satisficing game theory offers an alternative to classical game theory that describes a flexible model of players' social interactions. Players' utility functions depend on other players' attitudes rather than simply their actions. However, satisficing players with conflicting attitudes may enact dysfunctional behaviors, which results in poor performance. We present an evolutionary method by which a population of players may adapt their attitudes to improve payoff. In addition, we extend the Nash-equilibrium concept to satisficing games, showing that the method leads players toward the equilibrium in their attitudes. We apply these ideas to the stag hunt-a simple game in which cooperation does not easily evolve from noncooperation. The evolutionary method provides two major contributions. First, satisficing players may improve their performance by adapting their attitudes. Second, numerical results demonstrate that cooperation in the stag hunt can emerge much more readily under the method we present than under traditional evolutionary models.","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":"15 1","pages":"1556-1567"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73919705","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}
Pub Date : 2007-01-22DOI: 10.1109/TSMCB.2006.883274
Y. Ong, N. Krasnogor, H. Ishibuchi
The ten papers in this special section are devoted to memetic algorithms. The papers are loosely grouped into two categories: memetic algorithm methodologies and domain-specific memetic algorithms. Briefly summarizes the articles included in this section.
{"title":"Special Issue on Memetic Algorithms","authors":"Y. Ong, N. Krasnogor, H. Ishibuchi","doi":"10.1109/TSMCB.2006.883274","DOIUrl":"https://doi.org/10.1109/TSMCB.2006.883274","url":null,"abstract":"The ten papers in this special section are devoted to memetic algorithms. The papers are loosely grouped into two categories: memetic algorithm methodologies and domain-specific memetic algorithms. Briefly summarizes the articles included in this section.","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":"16 1","pages":"2-5"},"PeriodicalIF":0.0,"publicationDate":"2007-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88985985","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}
{"title":"Prioritizing Point-Based POMDP Solvers","authors":"Guy Shani, R. Brafman, S. E. Shimony","doi":"10.1007/11871842_38","DOIUrl":"https://doi.org/10.1007/11871842_38","url":null,"abstract":"","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":"26 1","pages":"1592-1605"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89454719","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}
Pub Date : 2006-08-01DOI: 10.1109/TSMCB.2006.872258
O. Bilgen
{"title":"Correction to \"Optimal Neural Network Algorithm for On-Line String Matching\"","authors":"O. Bilgen","doi":"10.1109/TSMCB.2006.872258","DOIUrl":"https://doi.org/10.1109/TSMCB.2006.872258","url":null,"abstract":"","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":"5 1","pages":"965"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75027033","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：