All updateable objects in working memory are updated whenever any of them are modified: Evidence from the memory updating paradigm.

In a series of experiments, participants were required to keep track of 1 or 2 working memory (WM) objects, having to update their values in 80% of the trials. Updating cost, defined as the difference between update and non-update trials, was larger when 2 objects were involved compared with when there was only 1 object was involved. This finding was interpreted as evidence that the updating process encompasses both objects in WM, even though only 1 of them is actually updated. This feature of WM updating is limited to objects defined as "updateable," throughout the trial sequence. The results are explained by the need to reprogram the phonological loop when updating or the need for desynchronization followed by resynchronization of WM contents. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Frames of Reference in Mobile Augmented Reality Displays.

In 3 experiments, the authors investigated spatial updating in augmented reality environments. Participants learned locations of virtual objects on the physical floor. They were turned to appropriate facing directions while blindfolded before making pointing judgments (e.g., "Imagine you are facing X. Point to Y"). Experiments manipulated the angular difference between the learning heading and the imagined heading and between the actual heading and the imagined heading. The effect of actual-imagined on pointing latency was observed for naive users but not for users with brief training or instructions concerning the fact that objects can move with body movements. The results indicated that naive users used an environment-stabilized reference frame to access information arrays, but with experience and instruction the nature of the representation changed from an environment stabilized to a body stabilized reference frame. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.     

基于小波的实时烟雾检测*

传统的离子式、吸气式、光电式等烟雾检测器在大空间中检测烟雾时,会受到发射信号与接收信号之间的距离、平面角度、精确对准等限制,无法对整个空间的烟雾状况进行描述.新的方法通过监测区域的摄像机拍摄的视频图像序列,进行小波变换,分析图像帧在时域和空域的频率特性,来确定被监测区域是否有火灾烟雾的发生.实验证明该方法不受空间高度、热障、易爆、有毒等环境的限制,并且有灵敏度高、抗干扰力强、适用范围广等特点.     

基于业务驱动的“一张图”数据动态更新机制研究

在分析国土资源管理业务模型及"一张图"数据库关系的基础上,重点阐述基于业务驱动的"一张图"数据动态更新机制的原理、实现技术,并在成都市开展应用示范。本文提出基于业务并借助数据捕获、ETL工具实现"一张图"数据动态更新的新思路,为国土资源动态监管、分析核查与决策、防灾减灾提供数据支撑和信息服务。     

On the complexity of role updating feasibility problem in RBAC

In Role Based Access Control (RBAC) systems, it is necessary and important to update the role–permission assignments in order to reflect the evolutions of the system transactions. However, role updating is generally complex and challenging, especially for large-scale RBAC systems. This is because the resulting state is usually expected to meet various requirements and constraints. In this paper, we focus on a fundamental problem of role updating in RBAC, which determines whether there exists a valid role–permission assignment, i.e., whether it can satisfy all the requirements of the role updating and without violating any role–capacity or permission–capacity constraint. We formally define such a problem as the Role Updating Feasibility Problem (RUFP), and study the computational complexity of RUFP in different subcases. Our results show that although several subcases are solvable in linear time, this problem is NP-complete in the general case.     

改进的基于移动小波树的数据流异常检测方法

针对移动小波树数据流异常检测算法的不足,提出了一种改进的移动小波树异常检测方法,利用比率阈值去除颠簸数据的干扰,提高了检测精度;利用二分查找检测算法,提高了检测的效率;结合实时增量更新算法满足了数据流在线处理的要求;改进了阈值设定方法,可实现双边异常检测。用射线数据和电能质量扰动数据进行仿真实验,结果验证了方法的有效性。     

基于持久性内存的单向移动B^+树

由新型非易失存储介质构成的持久性内存(persistent memory,PM)具有扩展性强、按字节访问与静态能耗低等特性,为未来主存与辅存融合提供了强大的契机.然而由于LLC(last level cache)具有易失性且与主存交互粒度通常为64B,而PM的原子持久化操作粒度为8B.因此,数据从LLC更新到PM的过程中,若发生故障,则可能破坏更新操作的失败原子性,进而影响原始数据的完整性.为了保证更新操作的失败原子性,目前研究主要采用显式调用持久化指令与内存屏障指令,将数据有序地持久化到PM上,但该操作会造成显著的开销,在索引更新中尤为明显.在对索引进行更新时,往往会涉及到索引结构的变化,该变化需要大量的有序持久化开销.研究旨在减少基于PM的B+树在更新过程中为保证失败原子性而引入的持久化开销.通过分析B+树节点利用率、不同更新模式下持久化开销以及更新操作之间的关系,提出了一种基于节点内数据真实分布的数据单向移动算法.通过原地删除的方式,减少删除带来的持久化开销.利用删除操作在节点内留下的空位,减少后续插入操作造成的数据移动,进而减少数据持久化开销.基于上述算法,对B+树的重均衡操作进行优化.最后通过实验证明,相较于最新基于PM的B+树,提出的单向移动B+树能够显著提高单一负载与混合负载性能.     

基于用户反馈的WiFi位置指纹数据库更新算法

为使Wi Fi位置指纹数据库,不在定位区域Wi Fi环境发生改变时,出现位置指纹过时现象,设计一种更新算法。该算法使用用户的反馈数据,考虑了AP信号不稳定情况下AP新增与撤销的检测问题;消除了手机热点等临时AP对传统更新算法的影响;最终通过检测AP位置移动等引起的RSS改变,加速位置指纹数据库的更新。实验结果表明,在实际环境中该算法在指纹数据库的更新效率上优于传统更新算法。     

基于PNDSC 的欠驱动AUV编队控制器设计

针对含有模型不确定与未知海洋环境扰动下的欠驱动自主水下航行器(AUV)的编队控制问题, 提出一种基于预估器的神经网络动态面(PNDSC) 控制算法. 将动态面法引入控制器的设计中, 采用神经网络逼近AUV模型中的不确定项与海洋环境的扰动, 并结合预估器设计了神经网络权值的离散迭代更新率. Lyapunov 稳定性分析表明, 闭环系统所有信号是一致最终有界的. 仿真结果验证了所提出方法的有效性.