查询词典 combinatorial

These results indicated that the presented method could be applied efficiently to the solution-phase combinatorial chemistry based on Williamson etherification.

结果表明该方法可高效率地用于基于Williamson醚化反应的液相组合化学合成。

Then combined with the concept of solution backboens of combinatorial optimization problems, we design a bacbkone-based extremal evolutionary algorithm.

应用新的变量适应度定义，设计了基于模式的极值进化算法。

A combinatorial identity is obtained:=:~z 2r扟32-rn-iJ As main result of this paper, in section two, the convolution梩ype identities emerge from our discussion about Lagrange formula whom in author 憇 view can be taken as the inherent characteristic of Lagrange formula but have been ignored fOi so long time.

第一章对拉格朗日反演在Riordan群理论中的应用进行了介绍，证明了一个组合等式：第二章通过对拉格朗日反演定理本身的分析，得到一个对任意的形式幂级数都适用的三个拟卷积公式，这些公式体现了任意能在零点解析的函数的内在性质。

We demonstrate that coexpression of the Forkhead protein FoxC2 and the Ets protein Etv2 induces ectopic expression of vascular genes in Xenopus embryos, and that combinatorial knockdown of the orthologous genes in zebrafish embryos disrupts vascular development.

实验显示，Forkhead蛋白FoxC2和Ets蛋白Etv2的共同表达，能够诱使非洲爪蟾胚胎血管基因的易位表达。

Our studies mainly focus on the free groups with finite ranks . Free groups with finite ranks are the fundamental subjects of combinatorial group theory, and they have central importance for the studies of both topology and algebra.

我们研究比较多的是有限秩的自由群，有限秩自由群是组合群论的中心课题，是一个在拓扑学及代数学上都具有重要意义的研究对象，获取有关这些自由群的结构的信息的一个主要方法是研究其上的各种自同构作用。

Generalized pseudorandom punctured binary sequence pair along with the transformation properties and combinatorial limited conditions are presented.

首先推导出二元序列偶的周期相关理论界，这为进一步研究具有良好相关特性的二元序列偶集提供了理论基础。

In this thesis, by employing generating function technique, some new combinatorial identities have been established.

本文利用发生函数理论建立了一系列新的组合恒等式，并且利用发生函数方法讨论了一些级数的取整值问题以及某些多项式在有理点的取值问题。

The graph coloring problem is a widely studied combinatorial optimization problem.

图的着色问题是一个被广泛研究的组合优化问题。

Graph coloring problem is a NP-complete one of graph and combinatorial optimization.

图着色问题是图与组合优化中的一个NP-完全问题。

Graph Coloring Problem is one of the typical NP-hard problems in combinatorial optimization problem.

图着色问题（GCP，Graph Coloring Problem）是经典的NP-Hard组合优化问题之一。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。