本研究探讨重复知盲发生在知觉阶段还是在记忆阶段。采用快速视觉系列呈现(rapid serial visual representation,简称RSVP)任务,让被试即时回忆80个词表中呈现的词。操作了词表中目标词的重复数,分为无重复、单刺激重复(重复一对)和双...本研究探讨重复知盲发生在知觉阶段还是在记忆阶段。采用快速视觉系列呈现(rapid serial visual representation,简称RSVP)任务,让被试即时回忆80个词表中呈现的词。操作了词表中目标词的重复数,分为无重复、单刺激重复(重复一对)和双刺激重复(重复两对)三种,和目标词的情绪效价,分为中性词和情绪词两种。结果发现,对目标词回忆的正确率是:当目标词和非目标词都是中性词汇,即二者的情绪效价强度相当时(实验1),在无重复条件与双刺激重复条件下无差异,二者均大于单刺激重复条件;当目标词是消极词汇,非目标词是中性词汇,即目标刺激的情绪效价强度大于非目标刺激时(实验2),无重复条件与单刺激重复条件无差异,二者均大于双刺激重复条件。结果表明:(1)RSVP任务下词表中有双刺激重复时,如果刺激的效价强度相当,出现重复优势;如果目标刺激的效价强度高于非目标刺激,出现重复劣势;(2)人们会主动分配更多的注意资源给效价高的刺激,重复知盲产生在记忆阶段,支持注意资源分配最优化假设。展开更多
It has been demonstrated that either Channel Allocation （CA） or Relay Selection （RS） can improve the performance in relaying networks separately. However, there is little work concerning their combination in multi...It has been demonstrated that either Channel Allocation （CA） or Relay Selection （RS） can improve the performance in relaying networks separately. However, there is little work concerning their combination in multi-cell uplink scenarios. In this paper, we investigate the issue which considers the CA and RS to optimize the system transmission rate in an uplink scenario, while maintaining the resource distribution fairness among users. This is first formulated as an optimization problem for a linear cellular system, where the same frequency channels can be reused in different cells. Based on the link and co-channel interference conditions, two low-complexity CA and RS schemes are then proposed with different decomposition se quences. Finally, numerical results are con ducted to verify the effectiveness of the pro posed CA and RS methods. Simulations re suits show that the proposed methods can yield significant improvements in system per formance in terms of average sum rate.展开更多
With the increasing popularity of cloud computing, there is an increased de mand for cloud resources in cloud. It has be come even more urgent to find solutions to improve resource utilization. From the per spective o...With the increasing popularity of cloud computing, there is an increased de mand for cloud resources in cloud. It has be come even more urgent to find solutions to improve resource utilization. From the per spective of a cloud consumer, a cloud applica tion processes a large information flow in volving user actions that access resources, but little work has so far been devoted to research from the perspective of the interaction be tween the user and the cloud application. In this paper, we analyze the interaction in detail, and propose a general mathematical interac tion model to formulate the challenge pertain ing to storage resource allocation as an opti mization problem, focusing on minimizing both the user＇s cost and server＇s consumption. A potential response mechanism is then de signed based on the interaction model. Fur thermore, the proposed model is used to ex plore strategies when multiple users access the same file simultaneously. Additionally, an improved queuing system, namely M/ G~ oo queue with standby, is introduced. Finally, an evaluation is presented to verify the interac- tion model.展开更多
文摘本研究探讨重复知盲发生在知觉阶段还是在记忆阶段。采用快速视觉系列呈现(rapid serial visual representation,简称RSVP)任务,让被试即时回忆80个词表中呈现的词。操作了词表中目标词的重复数,分为无重复、单刺激重复(重复一对)和双刺激重复(重复两对)三种,和目标词的情绪效价,分为中性词和情绪词两种。结果发现,对目标词回忆的正确率是:当目标词和非目标词都是中性词汇,即二者的情绪效价强度相当时(实验1),在无重复条件与双刺激重复条件下无差异,二者均大于单刺激重复条件;当目标词是消极词汇,非目标词是中性词汇,即目标刺激的情绪效价强度大于非目标刺激时(实验2),无重复条件与单刺激重复条件无差异,二者均大于双刺激重复条件。结果表明:(1)RSVP任务下词表中有双刺激重复时,如果刺激的效价强度相当,出现重复优势;如果目标刺激的效价强度高于非目标刺激,出现重复劣势;(2)人们会主动分配更多的注意资源给效价高的刺激,重复知盲产生在记忆阶段,支持注意资源分配最优化假设。
基金supported by the Key Project of State Key Laboratory of Rail Traffic and Control under Grant No.RCS2012ZZ004the Fundamental Research Funds for the Central Universities under Grant No. 2013YJS025
文摘It has been demonstrated that either Channel Allocation （CA） or Relay Selection （RS） can improve the performance in relaying networks separately. However, there is little work concerning their combination in multi-cell uplink scenarios. In this paper, we investigate the issue which considers the CA and RS to optimize the system transmission rate in an uplink scenario, while maintaining the resource distribution fairness among users. This is first formulated as an optimization problem for a linear cellular system, where the same frequency channels can be reused in different cells. Based on the link and co-channel interference conditions, two low-complexity CA and RS schemes are then proposed with different decomposition se quences. Finally, numerical results are con ducted to verify the effectiveness of the pro posed CA and RS methods. Simulations re suits show that the proposed methods can yield significant improvements in system per formance in terms of average sum rate.
基金supported in part by the National Natural Science Foundation of China under Grant No. 61271199the Fundamental Research Funds in Beijing Jiaotong University under Grant No. W11JB00630
文摘With the increasing popularity of cloud computing, there is an increased de mand for cloud resources in cloud. It has be come even more urgent to find solutions to improve resource utilization. From the per spective of a cloud consumer, a cloud applica tion processes a large information flow in volving user actions that access resources, but little work has so far been devoted to research from the perspective of the interaction be tween the user and the cloud application. In this paper, we analyze the interaction in detail, and propose a general mathematical interac tion model to formulate the challenge pertain ing to storage resource allocation as an opti mization problem, focusing on minimizing both the user＇s cost and server＇s consumption. A potential response mechanism is then de signed based on the interaction model. Fur thermore, the proposed model is used to ex plore strategies when multiple users access the same file simultaneously. Additionally, an improved queuing system, namely M/ G~ oo queue with standby, is introduced. Finally, an evaluation is presented to verify the interac- tion model.
