Embedding multi-dimensional meshes into twisted cubes

The twisted cube is an important variant of the most popular hypercube network for parallel processing. In this paper, we consider the problem of embedding multi-dimensional meshes into twisted cubes in a systematic way. We present a recursive method for embedding a family of disjoint multi-dimensional meshes into a twisted cube with dilation 1 and expansion 1. We also prove that a single multi-dimensional mesh can be embedded into a twisted cube with dilation 2 and expansion 1. Our work extends some previously known results.     

Using an online tool to support school‐based ICT policy planning in primary education

An important step towards the successful integration of information and communication technology (ICT) in schools is to facilitate their capacity to develop a school‐based ICT policy resulting in an ICT policy plan. Such a plan can be defined as a school document containing strategic and operational elements concerning the integration of ICT in education. To write such a plan in an efficient way is challenging for schools. Therefore, an online tool [Planning for ICT in Schools (pICTos)] has been developed to guide schools in this process. A multiple case study research project was conducted with three Flemish primary schools to explore the process of developing a school‐based ICT policy plan and the supportive role of pICTos within this process. Data from multiple sources (i.e. interviews with school leaders and ICT coordinators, school policy documents analysis and a teacher questionnaire) were collected and analysed. The results indicate that schools shape their ICT policy based on specific school data collected and presented by the pICTos environment. School teams learned about the actual and future place of ICT in teaching and learning. Consequently, different policy decisions were made according to each school's vision on ‘good’ education and ICT integration.     

Video analysis based on volumetric event detection

During the past decade, feature extraction and knowledge acquisition based on video analysis have been extensively researched and tested on many applications such as closed-circuit television(CCTV)data analysis, large-scale public event control, and other daily security monitoring and surveillance operations with various degrees of success. However, since the actual video process is a multi-phased one and encompasses extensive theories and techniques ranging from fundamental image processing, computational geometry and graphics, and machine vision, to advanced artificial intelligence, pattern analysis, and even cognitive science, there are still many important problems to resolve before it can be widely applied. Among them, video event identification and detection are two prominent ones. Comparing with the most popular frame-to-frame processing mode of most of today's approaches and systems, this project reorganizes video data as a 3D volume structure that provides the hybrid spatial and temporal information in a unified space. This paper reports an innovative technique to transform original video frames to 3D volume structures denoted by spatial and temporal features. It then highlights the volume array structure in a so-called "pre-suspicion" mechanism for a later process. The focus of this report is the development of an effective and efficient voxel-based segmentation technique suitable to the volumetric nature of video events and ready for deployment in 3D clustering operations. The paper is concluded with a performance evaluation of the devised technique and discussion on the future work for accelerating the pre-processing of the original video data.     

Defining syntax-directed translations by tree bimorphisms

We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these “quasi-alphabetic” tree bimorphisms preserve recognizability, and that their class is closed under composition and inverses.     

The role of latent and active failures in workplace slips, trips and falls: an information processing approach

The vast majority of the published workplace slips, trips and falls (STF) literature is exceedingly narrow in its focus and often ignores wider systems issues in workplace STF aetiology. There is little recognition within the published literature of the importance of latent failures or the upstream organisational and cultural contexts within which workplace STF occur. This is unfortunate, as a systems approach to workplace STF analysis, that is inclusive of latent design and work organisation factors that often shape worker behaviour patterns related to STF risk (e.g. rushing, risk taking), is fundamental to the development of effective prevention measures. The aims of this paper are to provide an understanding of workplace STF causation that is cognisant of the potential role of both active and latent failures in STF causation. The paper presents an ergonomics model for workplace STF analysis that highlights information processing in STF aetiology, the STF incident process and the interaction between latent and active failures in STF causation. The paper draws upon ergonomics research conducted in a range of occupational contexts to illustrate the key features of the model as it applies to workplace STF. Implications of the model for analysis and prevention of STF are discussed.     

Worst-case optimal algorithm for XPath evaluation over XML streams

We consider the XPath evaluation problem: Evaluate an XPath query Q on a streaming XML document D; i.e., determine the set Q(D) of document elements selected by Q. We mainly consider Conjunctive XPath queries that involve only the child and descendant axes. Previously known in-memory algorithms for this problem use O(|D|) space and O(|Q||D|) time. Several previously known algorithms for the streaming version use Ω(dn) space and Ω(dn|D|) time in the worst case; d denotes the depth of D, and n denotes the number of location steps in Q. Their exponential space requirement could well exceed the O(|D|) space used by the in-memory algorithms. We present an efficient algorithm that uses O(d|Q|+nc) space and O((|Q|+dn)|D|) time in the worst case; c denotes the maximum number of elements of D that can be candidates for output, at any one instant. For some worst case Q and D, the memory space used by our algorithm matches our lower bound proved in a different paper; so, our algorithm uses optimal memory space in the worst case.     

对等数据管理系统中模式映射的备份机制

针对对等数据管理系统中节点因自治性而动态离开和返回网络造成模式映射路径频繁断裂的问题,提出一种基于模式映射备份机制的离开节点绕过方法,向下游节点提供以树状结构组织的上游映射信息。当映射路径中有节点离开时,其下游节点的查询以此映射信息和备份的上游映射,绕过离开节点。仿真和分析的结果表明,映射备份机制的引入提高了查询的可达性,从而可以从更多的局部数据库中获得返回结果。     

基于PicoBlaze的多软核网络处理结构研究

介绍一种基于多个8位CPU软核PicoBlaze的网络处理结构.该结构利用现场可编程门阵列(FPGA)的并行性和网络协议分层结构的特点,可以实现一些相对复杂的网络处理功能,并且易于扩展和开发.通过在FPGA上完整实现一个远程启动服务器端的设计实例,阐明具体的设计方法.     

基于似然比测试的语音激活检测算法

针对低信噪比和噪声变化情况下语音激活检测算法性能下降的问题,提出一种新的参数更新和取值算法。该算法采用Laplacian-Gaussian混合模型对带噪语音频谱的概率分布进行建模,模型参数从带噪语音中估计得到,噪声功率参数通过跟踪语音的音节间隙进行平滑。实验结果表明,该算法在-5dB信噪比情况下,可以达到95％以上的检测率,具有优越的跟踪性能。     

基于多核的IPSec并行处理技术研究与实现

IPSec VPN网关需要进行大量加解密运算,对网络传输带宽产生较大影响。该文提出基于多核处理器的IPSec协议并行处理模型,将IPSec网络报文调度到多个处理器单元上运行,从而提高传输带宽。在Linux操作系统上对该模型进行具体实现,经过测试,在双核处理器上,IPSec VPN网关获得了接近倍速的性能提升。