基于XML伪编译的信息隐藏算法

基于XML伪编译的信息隐藏算法，首先将XML文档中需要安全保护的数据以二进制的形式存放于内存，把这些二进制数据分别以每1位长度、2位长度和4位长度互不重叠的平均分为三个数组并保存，根据嵌入信息的长度来选择相应数组，当嵌入信息是“1”时对该数组中对应的单位长度数据进行取反运算，嵌入信息为“0”则不做处理，实验结果表明：该算法不改变XML逻辑结构、标识字体等其原始的规范性、标准性，隐藏容量比修改XML逻辑结构、标识字体等其它隐藏算法高，而且更具有安全性，采用伪编译的信息隐藏算法不改变XML文件内容的逻辑结构、标识字体，而是从XML数据的安全角度，通过利用对XML内部重要数据的伪编译来实现信息隐藏。     

基于量子框架的开放式齿轮数控系统

文章提出只有在应用软件层次上满足数控系统的开放要求,才能实现数控系统真正意义上的跨平台开放性;叙述了量子框架的含义、结构和内容,指出量子框架是一种软件总线,能够实现软件的开放性以及各个功能模块的松耦合;定义了基于量子框架的开放式齿轮数控系统的体系结构,并给出了部分活动对象的状态图和程序。结果表明,量子框架实现了真正意义上的开放性。     

Global Optimization in Any Minkowski Metric: A Permutation-Translation Simulated Annealing Algorithm for Multidimensional Scaling

It is well known that considering a non-Euclidean Minkowski metric in Multidimensional Scaling, either for the distance model or for the loss function, increases the computational problem of local minima considerably. In this paper, we propose an algorithm in which both the loss function and the composition rule can be considered in any Minkowski metric, using a multivariate randomly alternating Simulated Annealing procedure with permutation and translation phases. The algorithm has been implemented in Fortran and tested over classical and simulated data matrices with sizes up to 200 objects. A study has been carried out with some of the common loss functions to determine the most suitable values for the main parameters. The experimental results confirm the theoretical expectation that Simulated Annealing is a suitable strategy to deal by itself with the optimization problems in Multidimensional Scaling, in particular for City-Block, Euclidean and Infinity metrics.