有限子集用英语怎么说,有限子集的英文翻译


词语导航

基本信息

词语:有限子集

繁体:有限子集

拼音:yǒu xiàn zǐ jí

英语翻译

【计】 finite subset

分词翻译

有限的英语翻译:

【化】 limited

子集的英语翻译:

subclass; subset
【计】 subaggregate; subset
【化】 subset

翻译例句

1. 压缩格式的HTML (Compact HTML,chtml)—html的有限子集,通过它可以为移动电话环境提供简单的访问途径。

Compact HTML (cHTML) - a limited subset of HTML with that provides easy access for mobile phone environments.

2. 理论上,您可以使用XPath的有限子集,逐步应用XSLT的子集,但是这样做本身就需要花费巨大精力,并且超出Firefox 3.0的范围。

In theory, you might apply a subset of XSLT incrementally, using a restricted subset of XPath, but doing so is significant effort in itself and lies beyond the scope of Firefox 3.0.

3. 在所有的迭代过程中都执行系统测试的子集,即使每个迭代的系统测试时间都是有限的。

A subset of system test was performed throughout all iterations, even though the system test timeframe per iteration is limited.

4. 这就要求使用有限的语言子集,尽管可以期望工具能告知开发人员哪些是只适用于F#的代码,但人们还是会感觉到诸多限制。

This will require using a restricted subset of the language, though hopefully there will be tools to help developers know when they cross the line into F#-only code.

5. 这个子集大到一个复杂的JRuby项目几乎不经任何修改就能在Android上运行,很少有限制情况。

That subset is large enough that projects as complicated as JRuby can basically run unmodified on Android, with very few restrictions.

6. 由于仅仅支持完整库的子集,因此应用程序所运行在的设备具有的资源要比桌面计算机具有的资源有限。wwW.WENtIyI.com

Supporting only a subset of the full library enables applications to run devices that have more limited resources than desktop computers.

7. 对XML文档编码可以缩小文档的大小,但是并没有限制文档使用特定的unicode子集,这要感谢字符实体。

Encoding XML documents can reduce their size, but it does not limit the document to a subset of Unicode — thanks to the magic of character entities.

8. 当使用OptimTDM创建测试数据子集时,应用程序对可以复制的行没有限制。

When using Optim TDM to create the test data subset, there is no application-enforced limit on the number of rows that can be copied.

9. includes属性的值是一个XPath表达式(可能从非常有限的xpath子集中选择),它确定了将包含其文本的元素。

The value of the includes attribute is an XPath expression (possibly chosen from a very restricted subset of XPath) that identifies the element whose text is included.

10. 通过将集列分成有限个互不相交的子集列,给出了求集列的上限集和下限集的新方法。

Through set sequence is resolved into finite mutually disjunct subsets, the new method to solve the limit superior and limit inferior of set sequence is give.

11. 本文讨论了赋予局部有限拓扑的非空闲子集超空间的局部紧性。

In this paper the local compactness of the nonempty closed subsets hyperspaces with locally finite topology is discussed.

12. 最后还证明了对于实数的子集a,如果定义在A上取值于A内的任一连续函数都有不动点,则A为实数的有限闭区间。

And finally we prove that let a be a subset of real Numbers, if every continuous function which is defined on a and taken value in a has fixed point, then a is a finite closed interval.

13. 讨论了赋予局部有限拓扑的非空闭子集超空间的连通性,还引入了一个对讨论局部有限超拓扑有用的基数函数,称为离散度。

The connectedness of the non-empty closed subsets hyperspace with locally finite topology is discussed and a cardinal function called discrete degree is introduced.

14. 本文对有限非空子集是弱容许集的半群进行分类。

In this paper, we characterize the semigroups whose finite non empty subsets are weakly admitable.

15. 最后还证明了对于实数的子集a,如果定义在A上取值于A内的任一连续函数都有不动点,则A为实数的有限闭区间。

And finally we prove that let a be a subset of real Numbers, if every continuous function which is defined on a and taken value in a has fixed point, then a is a finite clos...

16. 空间X是几乎亚紧的当且仅当X的每一单调开覆盖U有一个开加细,且在X的某一稠密子集上是点有限的;

A space X is nearly metacompact if and only if every monotone open cover U has an open refinement that is point-finite on some dense subset of X;

17. 摘要:使用子集构造法对非确定有限自动机进行确定化的过程中存在大量重复计算的问题。

Absrtact: the problem of repetitive computing exits in the process of transition from non-deterministic finite automata to deterministic finite automata using the subset construction method.

18. 为解决此问题,基于非确定有限自动机的特点并针对子集构造法的不足,提出了一种优化的非确定有限自动机确定化算法。

To solve this problem, an optimized algorithm for transition from NFA to DFA is put forward on the basis of characters of NFA and according to shortcomings of the subset. construction method.

19. 针对传统集对策模型对局中人合作的可能性没有限制这一问题,提出了带限制结盟的单调集对策,这里的“限制”是把有限局中人集n的每一个结盟映到其子集的单调映射。

In view of the problem that in a classical set game there are no restrictions to the cooperation possibilities of the players, the monotonic set games with restricted coalitions are proposed.

20. 针对传统集对策模型对局中人合作的可能性没有限制这一问题,提出了带限制结盟的单调集对策,这里的“限制”是把有限局中人集n的每一个结盟映到其子集的单调映射。

In view of the problem that in a classical set game there are no restrictions to the cooperation possibilities of the players, the monotonic set games with restricted coalitions are proposed.

版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!