一种基于小字典不对等语料的跨语言词嵌入方法

双语词嵌入通常采用从源语言空间到目标语言空间映射,通过源语言映射嵌入到目标语言空间的最小距离线性变换实现跨语言词嵌入。然而大型的平行语料难以获得,词嵌入的准确率难以提高。针对语料数量不对等、双语语料稀缺情况下的跨语言词嵌入问题,该文提出一种基于小字典不对等语料的跨语言词嵌入方法,首先对单语词向量进行归一化,对小字典词对正交最优线性变换求得梯度下降初始值,然后通过对大型源语言(英语)语料进行聚类,借助小字典找到与每一聚类簇相对应的源语言词,取聚类得到的每一簇词向量均值和源语言与目标语言对应的词向量均值,建立新的双语词向量对应关系,将新建立的双语词向量扩展到小字典中,使得小字典得以泛化和扩展。最后,利用泛化扩展后的字典对跨语言词嵌入映射模型进行梯度下降求得最优值。在英语—意大利语、德语和芬兰语上进行了实验验证,实验结果证明该文方法可以在跨语言词嵌入中减少梯度下降迭代次数,减少训练时间,同时在跨语言词嵌入上表现出较好的正确率。     

基于水印的图像认证和完整性保护技术

数字水印技术的发展为解决图像认证和完整性保护问题提供了新的思路。对用于篡改检测和图像认证的水印技术做了综述。数字水印技术根据其识别差错的能力分为四种类型:易损水印、半易损水印、混合水印和自嵌入水印。最后还对水印认证技术的安全性问题进行了讨论。     

Shallow Linear Action Graphs and their Embeddings

Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents the category of embeddings of undirected linear action graphs without nesting, using a novel form of graphical reasoning which simplifies some otherwise complex manipulations in regular algebra. The results are adapted in a few lines to directed graphs. This work is part of a long-term search for a uniform behavioural theory for process calculi. Received October 2000 / Accepted in revised form April 2001     

The effects of glycol methacrylate as a dehydrating agent on the dimensional changes of liver tissue

The dimensional changes of liver sections during the course of processing with glycol methacrylate (GMA) or with ethanol are described. Tissue processing with ethanol served as a control. During prolonged processing steps (24 h each), linear shrinkage of tissue specimens dehydrated with GMA at room temperature was 13.2%. Subsequent infiltration with GMA resulted in trivial swelling, and polymerization in slight shrinkage (2.3%). In comparison, processing with cold GMA resulted in shrinkage during dehydration (about 10.8%), a slight swelling in pure GMA, followed by shrinkage during polymerization (2.2%). Short routine processing schedules resulted in similar shrinkage/swelling patterns, although precise values differed slightly. In all experiments, ethanolic dehydration resulted in smaller dimensional tissue changes than did GMA dehydration. The dimensional changes of tissue sections during stretching on water, mounting and drying compensated for the major part of the shrinkage manifested during processing.     

一种混沌信号去噪方法的研究

以Takens嵌入定理和影子定理为理论依据，提出一种能对混沌信号去噪的局部投影方法。该方法不需潜在动力学系统的先验知识，符合工程实用的要求。通过实验结果表明这种方法对混沌信号去噪很有效。     

一种新的图像水印方案

目标区域是图像中视觉上最重要的部分。针对现有的水印算法很少考虑图像中确定的目标区域这一问题，提出了一种基于目标区域的水印方案(WIOR)。方案首先利用小波变换分析图像的目标特征，并依据图像的小波高频系数特征对其进行聚类，获得水印的嵌入域，在此嵌入域中，选择小波系数并对其进行量化调制来嵌入二值扩谱水印；同时，通过只在图像的局部区域内嵌入较少的水印信息来改善水印的隐蔽性。实验结果表明，该方案对于一类具有突出目标特征的图像具有较好的效果。嵌入的水印主要优势在于真正把水印嵌入图像的视觉重要部分，从而能有效地抵御剪切攻击，而且可以实现盲检测。     

Reversible steganographic method using SMVQ approach based on declustering

Reversible steganography allows an original image to be completely restored after the extraction of hidden data embedded in a cover image. In this paper, we propose a reversible scheme for VQ-compressed images that is based on a declustering strategy and takes advantage of the local spatial characteristics of the image. The main advantages of our method are ease of implementation, low computational demands, and no requirement for auxiliary data. The experimental results show that the embedding capacity of the proposed method is controlled by the number of declustered groups and the spatial characteristics of the cover image. The results also show that the proposed method has the best embedding capacity and the least running time compared with other methods.     

Longest fault-free paths in hypercubes with vertex faults

The hypercube is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. Let f denote the number of faulty vertices in an n-cube. This study demonstrates that when f ? n − 2, the n-cube contains a fault-free path with length at least 2ⁿ − 2f − 1 (or 2ⁿ − 2f − 2) between two arbitrary vertices of odd (or even) distance. Since an n-cube is a bipartite graph with two partite sets of equal size, the path is longest in the worst-case. Furthermore, since the connectivity of an n-cube is n, the n-cube cannot tolerate n − 1 faulty vertices. Hence, our result is optimal.     

基于音频数字水印的空间定位技术研究

深入研究了利于音频数字水印实现空间定位的技术思想,提出了一种在数字音频中嵌入水印信息后,实现对声源的空间定位算法,详细阐述了该算法的设计思想,并分别给出了音频数字水印的嵌入过程和数字水印的提取过程。