嵌入

Much additional information embedded in fonts (e.g. kerning tables) were not available from X whatsoever.

许多嵌入在字体中的附加信息对X无论如何都是不可用的。

In chapter six,we discuss the maximum embeddings for nearly Kirkman triplesystems.With at most 14 possible exceptions,we completely solve this problem.

第六章我们讨论了拟Kirkman三元系的最大嵌入问题，除14个可能的例外，我们完全解决了这一问题。

In chapter three,we construct some types of GDDs and Kirkman frames,whichis used in the later chapters for the construction of nearly Kirkman triple systems withsub-systems.

在第三章中我们构造了相关的GD设计及Kirkman frame，为我们具体研究拟Kirkman三元系嵌入问题提供了有力的工具。

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三元系，所以对一般指数λ的可分解最大填充三元系的嵌入问题已全部解决。

For the embedding problem of nearly Kirkman triple system,the only resultknown was:These exists an NKTScontaining an NKTSwhen 〓〓.

关于拟Kirkman三元系的嵌入问题，原先仅有如下结果：〓且〓，〓时，存在某个NKTS包含一个NKTS为子设计。

Only four surfaces are possible for such embedding:the sphere,the torus,the Klein bottle and the projective plane.

这样的嵌入只能在球面、环面、克莱因瓶和射影平面上实现，其五边形面的个数分别为12，0，0和6。

Letter custom stock access plug-ins, embedded access to the letter, enter a parameter, and then stocks in accordance with the relevant data, and then output the data I need.

详细说明：通达信自定义选股插件程序，嵌入通达信，输入某个参数，然后根据相关的股票行情数据计算，然后输出我需要的数据。

The watermark is embedded in the Complex Wavelet Domain of Relative Coordinates Line.

该方法利用了Dual Tree复数小波变换的优点，比如近似的平移、旋转不变性，完美重构等，将水印嵌入相对坐标线的复数小波域中。

The data in LLE are optimized using the small world algorithm, and the shortest path and the local neighbor set clustering coefficients are used as the local parameters. As a result, the problem of the embedding distortion using only local linear patch of the manifold to define neighborhood in Euclidean space is effectively solved. Three groups of standard data sets are selected to test and to compare the efficiency and robustness of SLLE and LLE.

将复杂网络算法引入到流形学习中，利用小世界算法对LLE算法进行数据优化，并以最短路径和局部集群系数作为局部优化参数，解决了数据点不规则时以欧氏空间作为邻域判别标准在构建局部超平面造成嵌入结果扭曲的难题。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。