该文基于多通道脑电信号时空特性构建非正交变换过完备字典,准确稀疏表示蕴含时空相关性信息的多通道脑电信号,提高基于时空稀疏贝叶斯学习模型的多通道脑电信号压缩感知联合重构算法性能。实验选用eegmmidb脑电数据库的多通道脑电信号...该文基于多通道脑电信号时空特性构建非正交变换过完备字典,准确稀疏表示蕴含时空相关性信息的多通道脑电信号,提高基于时空稀疏贝叶斯学习模型的多通道脑电信号压缩感知联合重构算法性能。实验选用eegmmidb脑电数据库的多通道脑电信号验证所提算法有效性。结果表明,基于过完备字典稀疏表示的多通道脑电信号,能够为多通道脑电信号压缩感知重构算法提供更多的时空相关性信息,比传统多通道脑电信号压缩感知重构算法所得的信噪比值提高近12 d B,重构时间减少0.75 s,显著提高多通道脑电信号联合重构性能。展开更多
The iterated prisoner's dilemma(IPD) is an ideal model for analyzing interactions between agents in complex networks. It has attracted wide interest in the development of novel strategies since the success of tit-...The iterated prisoner's dilemma(IPD) is an ideal model for analyzing interactions between agents in complex networks. It has attracted wide interest in the development of novel strategies since the success of tit-for-tat in Axelrod's tournament. This paper studies a new adaptive strategy of IPD in different complex networks, where agents can learn and adapt their strategies through reinforcement learning method. A temporal difference learning method is applied for designing the adaptive strategy to optimize the decision making process of the agents. Previous studies indicated that mutual cooperation is hard to emerge in the IPD. Therefore, three examples which based on square lattice network and scale-free network are provided to show two features of the adaptive strategy. First, the mutual cooperation can be achieved by the group with adaptive agents under scale-free network, and once evolution has converged mutual cooperation, it is unlikely to shift. Secondly, the adaptive strategy can earn a better payoff compared with other strategies in the square network. The analytical properties are discussed for verifying evolutionary stability of the adaptive strategy.展开更多
The last few decades have seen a phenomenal increase in the quality, diversity and pervasiveness of computer games. The worldwide computer games market is estimated to be worth around USD 21bn annually, and is predict...The last few decades have seen a phenomenal increase in the quality, diversity and pervasiveness of computer games. The worldwide computer games market is estimated to be worth around USD 21bn annually, and is predicted to continue to grow rapidly. This paper reviews some of the recent developments in applying computational intelligence （CI） methods to games, points out some of the potential pitfalls, and suggests some fruitful directions for future research.展开更多
Real-time crime forecasting is important.However,accurate prediction of when and where the next crime will happen is difficult.No known physical model provides a reasonable approximation to such a complex system.Histo...Real-time crime forecasting is important.However,accurate prediction of when and where the next crime will happen is difficult.No known physical model provides a reasonable approximation to such a complex system.Historical crime data are sparse in both space and time and the signal of interests is weak.In this work,the authors first present a proper representation of crime data.The authors then adapt the spatial temporal residual network on the well represented data to predict the distribution of crime in Los Angeles at the scale of hours in neighborhood-sized parcels.These experiments as well as comparisons with several existing approaches to prediction demonstrate the superiority of the proposed model in terms of accuracy.Finally,the authors present a ternarization technique to address the resource consumption issue for its deployment in real world.This work is an extension of our short conference proceeding paper[Wang,B.,Zhang,D.,Zhang,D.H.,et al.,Deep learning for real time Crime forecasting,2017,ar Xiv:1707.03340].展开更多
文摘该文基于多通道脑电信号时空特性构建非正交变换过完备字典,准确稀疏表示蕴含时空相关性信息的多通道脑电信号,提高基于时空稀疏贝叶斯学习模型的多通道脑电信号压缩感知联合重构算法性能。实验选用eegmmidb脑电数据库的多通道脑电信号验证所提算法有效性。结果表明,基于过完备字典稀疏表示的多通道脑电信号,能够为多通道脑电信号压缩感知重构算法提供更多的时空相关性信息,比传统多通道脑电信号压缩感知重构算法所得的信噪比值提高近12 d B,重构时间减少0.75 s,显著提高多通道脑电信号联合重构性能。
基金supported by the National Natural Science Foundation(NNSF)of China(61603196,61503079,61520106009,61533008)the Natural Science Foundation of Jiangsu Province of China(BK20150851)+4 种基金China Postdoctoral Science Foundation(2015M581842)Jiangsu Postdoctoral Science Foundation(1601259C)Nanjing University of Posts and Telecommunications Science Foundation(NUPTSF)(NY215011)Priority Academic Program Development of Jiangsu Higher Education Institutions,the open fund of Key Laboratory of Measurement and Control of Complex Systems of Engineering,Ministry of Education(MCCSE2015B02)the Research Innovation Program for College Graduates of Jiangsu Province(CXLX1309)
文摘The iterated prisoner's dilemma(IPD) is an ideal model for analyzing interactions between agents in complex networks. It has attracted wide interest in the development of novel strategies since the success of tit-for-tat in Axelrod's tournament. This paper studies a new adaptive strategy of IPD in different complex networks, where agents can learn and adapt their strategies through reinforcement learning method. A temporal difference learning method is applied for designing the adaptive strategy to optimize the decision making process of the agents. Previous studies indicated that mutual cooperation is hard to emerge in the IPD. Therefore, three examples which based on square lattice network and scale-free network are provided to show two features of the adaptive strategy. First, the mutual cooperation can be achieved by the group with adaptive agents under scale-free network, and once evolution has converged mutual cooperation, it is unlikely to shift. Secondly, the adaptive strategy can earn a better payoff compared with other strategies in the square network. The analytical properties are discussed for verifying evolutionary stability of the adaptive strategy.
文摘The last few decades have seen a phenomenal increase in the quality, diversity and pervasiveness of computer games. The worldwide computer games market is estimated to be worth around USD 21bn annually, and is predicted to continue to grow rapidly. This paper reviews some of the recent developments in applying computational intelligence （CI） methods to games, points out some of the potential pitfalls, and suggests some fruitful directions for future research.
基金supported by ONR Grants N00014-16-1-2119,N000-14-16-1-2157NSF Grants DMS-1417674,DMS-1522383,DMS-1737770 and IIS-1632935
文摘Real-time crime forecasting is important.However,accurate prediction of when and where the next crime will happen is difficult.No known physical model provides a reasonable approximation to such a complex system.Historical crime data are sparse in both space and time and the signal of interests is weak.In this work,the authors first present a proper representation of crime data.The authors then adapt the spatial temporal residual network on the well represented data to predict the distribution of crime in Los Angeles at the scale of hours in neighborhood-sized parcels.These experiments as well as comparisons with several existing approaches to prediction demonstrate the superiority of the proposed model in terms of accuracy.Finally,the authors present a ternarization technique to address the resource consumption issue for its deployment in real world.This work is an extension of our short conference proceeding paper[Wang,B.,Zhang,D.,Zhang,D.H.,et al.,Deep learning for real time Crime forecasting,2017,ar Xiv:1707.03340].
