关于逆Walsh序的快速Walsh变换算法研究

从Walsh变换算法出发，总结出快速算法中的二分技术设计思路，提出了逆Walsh序的快速Walsh变换算法，给出了逆Walsh序的算法的流程图，为算法在图像处理中的实际应用打下基础。     

Walsh矩阵的复制生成及其计算机图像

Walsh函数在信号处理、图像处理、通信等众多领域有着广泛的应用.Walsh函数系是一个正交而完备的函数系,可以通过多种方法生成这一函数系.其中,Swick提出的复制方法应用最为广泛,该方法以Walsh函数的序码作为复制信息,可以复制出任意给定序数的Walsh函数.其本质是基于向量的处理,不适于类似快速变换等二维信号的处理.Walsh函数系可用Walsh方阵Wk表示.提出了基于W_k的行复制和块复制方法.基于对称性引入复制算子,并发现了一种新序(类Walsh序).利用Kronecker积推导了6种序的Walsh方阵的递推公式并绘制了它们的计算机图像,发现这些图像具有分形意义上的自相似结构.结果表明,基于矩阵的复制是比基于序码的复制更先进的复制方法.前者性能更优,适于快速变换的设计.而且,利用它发现了Walsh函数系的第4种对称的序:类Walsh序.通过分析和比较各种序的计算机图像,得出类Walsh序更适合作为Walsh序的逆反形式的猜想.     

Walsh变换核矩阵的简单生成及其应用

本文讨论了Walsh函数的Walsh序、Paley序与Hadamard序相应的变换核矩阵的相互转化关系，给出了三类序的Walsh变换核矩阵的生成算法，且生成算法简单，还给出了Matlab生成该类矩阵的Matlab程序，并将几类矩阵的转换置换矩阵应用到图像信息的加密置乱中，置乱效果很好。     

一维Walsh变换的阵列协处理器的设计

本文给出了一种用短序列Walsh变换芯片构成长序列Walsh变换阵列协处理器的方法.按此法,易用2~t片2~t长芯片构成2~(2t)长的Walsh变换的阵列协处理器,并且易用2~(t+1)片2~t长芯片及2~(2t)个蝶形运算器构成2~(2t+1)长的Walsh变换的阵列协处理器.     

一种基于Walsh变换的立体匹配基元

提出了一种以Walsh变换系数作为匹配基元的双目立体匹配方法。通过Walsh正交变换核对图像，变换得到Walsh系数，图像的特征被嵌入到该系数中，费用函数采用了Walsh变换系数作为匹配基元，而不是采用传统的像素灰度值。该文给出了算法的费用函数、匹配过程中相关的数据和最后的视差图。试验结果表明，将Walsh 系数作为一种匹配基元的方法是可行和有效的。     

多维离散Walsh变换快速算法设计

在分析二维离散Walsh变换形式化描述的基础上，以二维Walsh变换为例设计了一类多维离散型walsh变换的快速算法，分析了该算法的性能，指出这类算法形式多样，应用广泛。     

基于Walsh谱统计分布特征的水下入侵目标分类

提出一种利用目标回波Walsh统计分布特征识别水下入侵目标方法,文中探讨水下入侵目标回波的Walsh谱统计分布特征,提取其统计分布特征量,均值、标准差、偏度系数、峰度系数和波动系数构建特征空间,降低了直接用Walsh谱识别的特征维数。针对采集对应三种入侵目标的回波信号提取其Walsh谱统计分布特征量并进行分类识别实验,并给出了BP神经网络的分类结果。     

基于混沌和Walsh变换的二值图像加密算法

提出一种基于混沌映射和Walsh变换的二值图像加密算法。首先对二值图像进行混沌加密,再对混沌加密后的图像用Walsh变换进行置乱,实现图像信息的高强度加密。运用Walsh变换可以在很大程度上节约计算时间。仿真实验结果表明,混沌序列与Walsh变换相结合的方法加密强度高,计算时间短。     

基于Walsh变换的数字水印算法*

经对目前数字水印变换域算法的研究,发现常用的变换大多都是正交变换（如DCT和DWT等）。通过对Walsh正交函数系的研究,获得了与之对应的性能优良的正交变换,提出一种新颖的、鲁棒的Walsh域盲水印算法。实验表明,该算法计算简单,且具有良好的不可见性,并且在抵抗噪声和JPEG压缩攻击等方面具有较强的鲁棒性。     

时变线性系统最优控制的Walsh级数分析法

本文应用Walsh级数把最优控制问题转化成了一般代数极值问题,算法简洁明了,适合 计算机求解,并解决了以前用Walsh级数分析时一直难以处理的末端条件问题[1],同时给出 了计算实例,结果令人满意.     

一个扩展的CCS

诉微分算子ＣＣＳ（Ｃａｌｃｌｕｓ ｏｆ Ｃｏｍｍｕｎｉ－ｃａｔｉｎｇ Ｓｙｓｔｅｍｓ）是由英国爱丁堡大学计算机科学系的ＲｏｂｉｎＭｉｌｎｅｒ首先提出的。ＣＣＳ是一个在数学上完整的理论算子系统,可以作为计算机通讯系统的基本理论模型。我们先简要说明一个ＣＣＳ的内容。我们所作的工作是在理论上扩充地的ＣＣＳ,使得我们的ＣＣＳ更为一般化。在我们的观战看来,ＲｏｂｉｎＭｉｂｅｒ的ＣＣＳ只不过是我们的ＣＣＳ的一     

View-based model-driven architecture for enhancing maintainability of data access services

In modern service-oriented architectures, database access is done by a special type of services, the so-called data access services (DAS). Though, particularly in data-intensive applications, using and developing DAS are very common today, the link between the DAS and their implementation, e.g. a layer of data access objects (DAOs) encapsulating the database queries, still is not sufficiently elaborated, yet. As a result, as the number of DAS grows, finding the desired DAS for reuse and/or associated documentation can become an impossible task. In this paper we focus on bridging this gap between the DAS and their implementation by presenting a view-based, model-driven data access architecture (VMDA) managing models of the DAS, DAOs and database queries in a queryable manner. Our models support tailored views of different stakeholders and are scalable with all types of DAS implementations. In this paper we show that our view-based and model driven architecture approach can enhance software development productivity and maintainability by improving DAS documentation. Moreover, our VMDA opens a wide range of applications such as evaluating DAS usage for DAS performance optimization. Furthermore, we provide tool support and illustrate the applicability of our VMDA in a large-scale case study. Finally, we quantitatively prove that our approach performs with acceptable response times.     

Detecting and removing specularities in facial images

Specularities often confound algorithms designed to solve computer vision tasks such as image segmentation, object detection, and tracking. These tasks usually require color image segmentation to partition an image into regions, where each region corresponds to a particular material. Due to discontinuities resulting from shadows and specularities, a single material is often segmented into several sub-regions. In this paper, a specularity detection and removal technique is proposed that requires no camera calibration or other a priori information regarding the scene. The approach specifically addresses detecting and removing specularities in facial images. The image is first processed by the Luminance Multi-Scale Retinex [B.V. Funt, K. Barnard, M. Brockington, V. Cardei, Luminance-Based Multi-Scale Retinex, AIC’97, Kyoto, Japan, May 1997]. Second, potential specularities are detected and a wavefront is generated outwards from the peak of the specularity to its boundary or until a material boundary has been reached. Upon attaining the specularity boundary, the wavefront contracts inwards while coloring in the specularity until the latter no longer exists. The third step is discussed in a companion paper [M.D. Levine, J. Bhattacharyya, Removing shadows, Pattern Recognition Letters, 26 (2005) 251–265] where a method for detecting and removing shadows has also been introduced. The approach involves training Support Vector Machines to identify shadow boundaries based on their boundary properties. The latter are used to identify shadowed regions in the image and then assign to them the color of non-shadow neighbors of the same material as the shadow. Based on these three steps, we show that more meaningful color image segmentations can be achieved by compensating for illumination using the Illumination Compensation Method proposed in this paper. It is also demonstrated that the accuracy of facial skin detection improves significantly when this illumination compensation approach is used. Finally, we show how illumination compensation can increase the accuracy of face recognition.     

FTDSS：高容错分布式共享存储机制

Computerized data has become critical to the survival of an enterprise. Company must have a strategy for recovering their data should data lose. RAID is a popular mechanism to offer good fault-tolerance. But RAID can notwork well when one more disks fail. In this paper, we present an efficient Network-based high High-Tolerance Dis-tributed Shared Storage mechanism called FTDSS. FTDSS makes use of disk space of node in Network to build alarge pubhc shared storage space. Users can read/write their file from/to the public storage space from node of net-work. Physically File is stored in each node in form of data fragment or XOR verify fragment. Because of redundant XOR fragments, file is available even when two more nodes fail. FTDSS realize distant redundant srorage. At last,this paper use experiment to prove that FTDSS can offer high. fault-tolerance and advanced performance.     

Existential foundations of the composition paradigm

The theses of existonness, compoundness, and polyadness are proved. The consistency of these theses with the reversibility principle is founded. Existential foundations of the composition paradigm are constructed. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 3–12, March–April 2008.     

Autonomous programmable DNA nanorobotic devices using DNAzymes

A major challenge in nanoscience is the design of synthetic molecular devices that run autonomously (that is, without externally mediated changes per work-cycle) and are programmable (that is, their behavior can be modified without complete redesign of the device). DNA-based synthetic molecular devices have the advantage of being relatively simple to design and engineer, due to the predictable secondary structure of DNA nanostructures and the well-established biochemistry used to manipulate DNA nanostructures. However, ideally we would like to minimize the use of protein enzymes in the design of a DNA-based synthetic molecular device. We present the design of a class of DNA-based molecular devices using DNAzyme. These DNAzyme-based devices are autonomous, programmable, and further require no protein enzymes. The basic principle involved is inspired by a simple but ingenious molecular device due to Tian et al. [Y. Tian, Y. He, Y. Chen, P. Yin, C. Mao, A DNAzyme that walks processively and autonomously along a one-dimensional track, Angew. Chem. Intl. Ed. 44 (2005) 4355–4358] that used DNAzyme to traverse on a DNA nanostructure, but was not programmable in the sense defined above (it did not execute computations).     

Biomechanical analysis of materials handling manipulators in short distance transfers of moderate mass objects: joint strength,spine forces and muscular antagonism

Although often suggested as a control measure to alleviate musculoskeletal stresses, the use of mechanical assistance devices (i.e. manipulators) in load transfers has not been extensively studied. Without data describing the biomechanical effects of such devices, justification for decisions regarding implementation of such tools is difficult. An experimental study of two types of mechanical manipulators (articulated arm and overhead hoist) was conducted to determine whether biomechanical stresses, and hence injury risk, would be alleviated. Short distance transfers of loads with moderate mass were performed both manually and with manipulator assistance under a variety of task conditions. Using analysis and output from new dynamic torso models, strength demands at the shoulders and low back, lumbar spine forces, and lumbar muscle antagonism were determined. Strength requirements decreased significantly at both the shoulders and low back when using either manipulator in comparison with similar transfers performed manually. Peak spine compression and anteriorposterior (a-p) shear forces were reduced by about 40% on average, and these reductions were shown to be primarily caused by decreases in hand forces and resultant spinal moments. Two metrics of muscular antagonism were defined, and analysis showed that torso muscle antagonism was largest overall when using the hoist. The results overall suggest that hoist-assisted transfers, although better in reducing spine compression forces, may impose relatively higher demands on coordination and/or stability at extreme heights or with torso twisting motions. The relatively higher strength requirements and spine compression associated with the articulated arm may be a result of the high inertia of the system. Potential benefits of practice and training are discussed, and conclusions regarding implementation of mechanical manipulators are given.     

基于LDA话题演化研究方法综述

现实生活中不断有新话题的产生和旧话题的衰减,同时话题的内容也会随着时间发生变化。自动探测话题随时间的演化越来越受到人们的关注。Latent Dirichlet Allocation模型是近年提出的概率话题模型,已经在话题演化领域得到较为广泛的应用。该文提出了话题演化的两个方面 内容演化和强度演化,总结了基于LDA话题模型的话题演化方法,根据引入时间的不同方式将目前的研究方法分为三类 将时间信息结合到LDA模型、对文本集合后离散和先离散方法。在详细叙述这三种方法的基础上,针对时间粒度、是否在线等多个特征进行了对比,并且简要描述了目前广泛应用的话题演化评测方法。文章最后分析了目前存在的挑战,并且对该研究方向进行了展望。     

BOOTSTRAP 3.0—A SPICE1 Conformant Software Process Assessment Methodology

BOOTSTRAP methodology was initially developed in an ESPRIT project together with European industry. After February 1993, the methodology has been managed and further developed by a European Economic Interest Group, called BOOTSTRAP Institute. BOOTSTRAP methodology version 3.0 was released in September 1997. It is compliant with the ISO/IEC software engineering standard number 15504, the emerging standard on software process assessment. The core of the methodology consists of an assessment model and method. The assessment model of the methodology version 3.0 was updated to align with the ISO 12207 life-cycle and 15504 reference model requirements. In addition to the Process and Capability dimensions, it contains a Technology dimension. The Process dimension contains 33 different processes organised in six clusters: Organisation, Life Cycle Dependent, Management, Support, Customer-Supplier, and Process Related. The Capability dimension consists of six levels, each level consisting of one or more process attributes, adopted from ISO 15504. An assessment is conducted at SPU and project levels. The BOOTSTRAP Institute organises and co-ordinates assessor training and registration scheme. BOOTSTRAP methodology is being used in two European projects: SPAM and PROFES.