Attentional task aptitude and performance anxiety.

Anxious responding (trait, state, and test anxiety) has a negative impact on overt performance. Researchers have used a unidimensional method of assessing anxiety and performance, although a more informative approach would involve a comprehensive assessment battery and multiple performance tasks. Incorporating this strategy, the authors measured the impact of anxiety on 4 attentional processing tasks. Results revealed that "types" of anxiety symptoms were differentially related to attentional task performance; test anxiety accounted for the most variance in predicting performance on the Wechsler Adult Intelligence Scale-Third Edition (D. Wechsler, 1997) letter-number sequencing and digit-span subtests, trait anxiety and fear of negative evaluation were more significant in predicting Stroop performance, and math anxiety accounted for the largest variance toward understanding Paced Auditory Serial Addition Task (C. W. Lejuez, C. W. Kahler, & R. A. Brown, 2003) scores. Theoretical and clinical implications are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

一种面向车辆实时数据并行处理的任务调度算法

车辆实时监管正面临着不断增长的大规模车辆监测数据的实时处理需求,需要采用分布式的并行计算架构来提升大规模车辆监测数据处理的性能,支撑多样化的车辆监测数据处理任务,应对支撑环境的伸缩性需求。在这种架构下,对系统中不同计算节点间的车辆监测数据处理任务的调度提出了更高的要求。针对这一要求,并结合流式到达及历史积累的车辆监测数据的持续化处理需求以及大规模车辆监测数据实时处理中内存敏感的特征,提出一种基于路由表的并行任务调度算法。该算法基于车辆监测数据时空属性以及各计算节点的内存信息建立路由表,并以路由表的形式来进行任务的并行划分和分配调度,从而使得各计算节点达到负载均衡的状态。实验表明该算法能够使计算节点间的负载差异缩小到12%以内。此外,该算法在某市车辆监管实时系统中的实际应用也证明了其有效性。     

SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS

The purpose of this paper is to examine the impact of scheduling parallel tasks onto non-uniform memory access (NUMA) shared-memory multiprocessor systems by considering non-negligible intertask communications and communication contentions. Communication contentions arise from the communication medium having insufficient capacity to serve all transmissions, thereby causing significant contention delays. Therefore, a new scheduling algorithm, herein referred to as the Extended Critical Path (ECP) algorithm is proposed. The proposed algorithm schedules parallel tasks by considering non-negligible intertask communications and the contentions among shared communication resources. Moreover, it ensures performance within a factor of two of the optimum for general directed acyclic task graphs (DATGs). Experimental results demonstrate the superiority of the ECP algorithm over the scheduling algorithms presented in previous literature.     

机器人足球比赛系统中的机器人任务分配方法

针对基于遗传算法的多机器人任务分配方法中,由于初始种群是随机产生不能很好地表征整个解空间,而容易陷入局部最优解的问题,提出一种新的多机器人任务分配方法。该方法根据机器人效用函数值来确定个体基因,从而产生初始种群,并引进分层遗传算法来实现具有不同最优基因的群体分开演化。仿真实验表明,该方法比传统的遗传算法有更高的寻优效率和更快的收敛速度。     

《Flash动画制作》课程教学方法探讨与实践

根据《Flash动画制作》课程在教学实践中的特点,提出构建"理实同步,实例引导,任务驱动"的教学模式,在教学内容、教学方法等方面进行教学改革,并阐述了在Flash教学中的具体实施方法,提高了学生动手能力及综合素质。     

移动边缘计算中基于中继辅助计算方法综述*

为了满足下一代网络在覆盖范围、部署成本以及容量方面的挑战,移动边缘计算（MEC）通常需要借助中继节点的辅助来完成计算密集型和延迟敏感型的任务。首先介绍了基于中继辅助MEC系统的基本架构,之后从任务卸载、资源分配和中继节点选择三方面对基于中继辅助MEC系统最新的研究方法进行归纳总结。更进一步,针对现有方法可能存在的问题与挑战进行了讨论与分析,并提出一些可行的解决方案为后续研究发展提供参考。     

基于改进指针网络的卫星对地观测任务规划方法

针对卫星观测任务规划问题约束复杂、求解空间大和输入任务序列长度不固定的特点,使用深度强化学习（DRL）方法对卫星观测任务规划问题进行求解. 综合考虑时间窗口约束、任务间转移机动时间和卫星电量、存储约束,对卫星观测任务规划问题进行建模. 基于指针网络（PN）的运行机制建立序列决策算法模型,使用Mask向量来考虑卫星观测任务规划问题中的各类约束,并通过Actor Critic强化学习算法对模型进行训练,以获得最大的收益率. 借鉴多头注意力（MHA）机制的思想对PN进行改进,提出多头注意力指针网络（MHA-PN）算法. 根据实验结果可以看出,MHA-PN算法显著提高了模型的训练速度和泛化性能,训练好的MHA-PN算法模型可以直接对输入序列进行端到端的推理,避免传统启发式算法迭代求解的过程,具有较高的求解效率.     

密集观测场景下的敏捷成像卫星任务规划方法

针对密集观测场景下敏捷成像卫星任务规划问题求解空间大、输入任务序列较长的特点,综合考虑时间窗口约束、任务转移时卫星姿态调整时间、存储约束和电量约束,对敏捷成像卫星任务规划问题进行建模. 提出融合IndRNN和Pointer Networks的算法模型（Ind-PN）对敏捷成像卫星任务规划问题进行求解,使用多层的IndRNN结构作为算法模型的解码器. 基于Pointer Networks机制对输入任务序列进行选择,使用Mask向量考虑敏捷成像卫星任务规划问题中的各类约束. 基于Actor Critic强化学习算法对算法模型进行训练,以获得最大的观测收益率. 实验结果表明,对于密集观测场景下的任务规划,Ind-PN算法的收敛速度更快,可以获得更高的观测收益率.     

Performance of supply chain collaboration – A simulation study

In the past few decades several supply chain management initiatives such as Vendor Managed Inventory, Continuous Replenishment and Collaborative Planning Forecasting and Replenishment (CPFR) have been proposed in literature to improve the performance of supply chains. But, identifying the benefits of collaboration is still a big challenge for many supply chains. Confusion around the optimum number of partners, investment in collaboration and duration of partnership are some of the barriers of healthy collaborative arrangements. To evolve competitive supply chain collaboration (SCC), all SC processes need to be assessed from time to time for evaluating the performance. In a growing field, performance measurement is highly indispensable in order to make continuous improvement; in a new field, it is equally important to check the performance to test conduciveness of SCC. In this research, collaborative performance measurement will act as a testing tool to identify conducive environment to collaborate, by the way of pinpointing areas requiring improvements before initializing collaboration. We use actual industrial data and simulation to help managerial decision-making on the number of collaborating partners, the level of investments and the involvement in supply chain processes. This approach will help the supply chains to obtain maximum benefit of collaborative relationships. The use of simulation for understanding the performance of SCC is relatively a new approach and this can be used by companies that are interested in collaboration without having to invest a huge sum of money in establishing the actual collaboration.     

基于线性时序逻辑的最优巡回路径规划

基于线性时序逻辑(Linear temporal logic, LTL)的路径规划方法中, 多点巡回路径规划问题尚无有效解决方案. 为了在道路网络中实现最优巡回监测, 提出了基于LTL的最优巡回路径规划方法. 首先, 将环境建模成一个切换系统, 用LTL语言描述包含多个巡回点和障碍物的任务需求; 接着, 利用循环移位法构建能够融合任务需求和环境模型的扩展乘机自动机, 以建立路径信息完整的网络拓扑; 最后, 采用基于迪科斯彻法的最优综合算法搜索扩展乘机自动机网络上的最优路径, 从而获得能够满足复杂任务需求的最优巡回路径. 仿真结果表明, 该方法能够有效实现最优巡回路径规划.