查询词典 embedding theorem

It can provide effective protection for digital media forgery, authentication, security and intactness by embedding a special mark into multimedia data.

数字水印技术主要通过在媒体信息中嵌入标记信号，为媒体信息在防伪、防篡改、认证、保障数据安全和完整性等方面提供有效的技术手段。

It can provide effective protection for digital media forgery, falsification, authentication, security and intactness by embedding a special mark into the multimedia data.

它主要通过在媒体信息中嵌入标记信号，为媒体信息在防伪、防篡改、认证、保障数据安全和完整性等方面提供有效的技术手段。

In every period, do the following operations:# For each 8*8 block, do the discrete cosine transform, then take out direct current coefficient in each block, using the transformation above for each DC coefficient, the gold stands for the code of the spread-spectrum we use when embedding the different watermark bit in different frames, after all of the watermark information which we want to embed is embedded, then do the inverse discrete cosine transformation, and store the current frame in a new file.

于是利用DCT变换域的这点重要的几何不变性，我们可以推导出一种能够抵抗几何攻击的视频水印算法，即将所需要嵌入的水印信息以127位扩频序列作为辅助，以求和值形式嵌入到DCT变换后的每个宏块的每个DC系数当中，具体嵌入和提取算法如下：根据使用的扩频序列的长度N，基于相关的嵌入器需要选取包含N帧的视频子序列，令这N帧视频子序列作为一个嵌入周期，对于每N帧视频子序列做如下的操作，#即对于每个8×8的像素块进行DCT变换，然后取出每个DCT变换后的直流分量，对于每个DC系数，做如上所述的变换，其中gold为在第k帧中嵌入第i位水印信息时使用的扩频码字值，待将所有需要嵌入的水印信息全部嵌入后，再做反DCT变换，保存当前帧。

Through the one-to-one relationship between the inverse number and the binary number, the dictionary mapping was got. According to the dictionary mapping, watermark encoding, watermark embedding and watermark extracting were implemented.

算法通过排列的逆序数和二进制数的一一对应关系得到映射字典，再根据映射字典完成水印数据的编码、嵌入和提取。

Anchor points based Isometric Embedding under least square error criterion has a time complexity of O n log( n , and after obtained geodesic distances it has linear time complexity for embedded points and can be fully realized in parallel.

基于锚点集的最小平方误差等距嵌入算法AIE具有O n log( n 的时间复杂性，而且在获得测地线距离后的计算时间复杂度达到对嵌入点数的线性关系，且可以完全并行实现。

Then,by using the algebraic method which was introduced by Yang L.and Zhang J.Z.,and the generalized isometric embedding theory,the generalized concept of metric addition is brought forward,a geometric inequality about the generalized metric addition is given,and the main result of Ya...

然后利用杨路和张景中引进的代数方法，应用广义等距嵌入定理，提出了关于两组两个完全同向的n维单形"广义度量加"的概念，并且证明了涉及"广义度量加"的一个几何不等式，它推广了杨路和张景中关于Alexander猜想的结果。

Euclidean space ; Synclastic simplexes ; Isometric embedding ; Generalized metric addition ; Geometry inequality

欧氏空间；同向单形；等距嵌入；广义度量加；几何不等式

The paper proposes two new dimension reduction algorithms: The First is On the Expected Distortion Bound of Direct Random Projection. The second is Anchor points based Isometric Embedding under least square error criterion. On the Expected Distortion Bound of Direct Random Projection has a time complexity of O.

本文分别提出了两种新的维数约减算法：(1)基于期望扰动的直接随机映像算法On the Expected Distortion Bound of Direct Random Projection，简称DRP(2基于锚点集的最小平方误差等距嵌入算法(Anchor points based Isometric Embedding under least square error criterion，简称AIE)。

In section 3 and section 4, We obtain other Kirkman frames by giving weights to some types of GDDs with block size at least 4. Finally, through using recursive and"filling hole"constructions, we give a complete solution to the embedding problem of resolvable minimum coverings of pairs by triples.

在第三节与第四节中，我们利用已知的特别有用的一些Kirkman frames、再利用已知存在的区组长至少为4的可分组设计通过加权后构造出另一系列Kirkman frames，最后通过递归和填洞构造法，解决了λ=1时可分解最小覆盖三元系的嵌入问题。

It is well known that a resolvable maximum packing with triples of order v with index λ=1 is a nearly Kirkman triple system KTS if v≡0 (mod 6), so the whole embedding problem for resolvable maximum packings with triples for arbitrary index λ has been completely solved.

由于指数λ=1且v≡0（mod 6）时一个v阶的可分解最大填充三元系即为一个v阶的拟Kirkman三元系，所以对一般指数λ的可分解最大填充三元系的嵌入问题已全部解决。

I can not negligent, he should do what?

我不能不在意了，他要做什么呢？

It is very dangerous to swim in the river alone.

一个人到河里游泳是很危险的。