不可分解的
- 与 不可分解的 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
For any dimension vector , there exist the generic decomposition, and a dense and closed subset V of system space R〓 corresponding to this decomposition such that, for each dynamical system M∈V, every indecomposable summand of M thus M is clear.
对任意的维数向量,存在一般分解,以及系统空间Rm,n,p中稠密的开子集V,并且我们对V中每个系统的不可分解直和项知道得很清楚,进而对V中每个系统也非常清楚。
-
Concretely, we hope to know whether a central hyperplane arrangement can be decomposed into several irreducible subarrangements or not.
具体地讲,希望知道能否把中心构形分解为若干个不能再分解的子构形,把对中心构形的研究归结为对它的不可约子构形的研究。
-
Then, we determine the simple objects and indecomposable projective objects in Γ~L completely.
我们完全确定了在范畴Γ~£中的单对象和不可分解投射对象。
-
Based on the infeasibility of large integer fraction, the scheme is proven existentially unforgeable against chosing message attacks.
基于大整数分解的困难性,该方案在选择消息攻击下是存在不可伪造的。
-
Soil invertebrates play roles as soil engineers and as a driving force in nutrient cycling by fragmenting and ingesting litter material and interacting with the microorganisms that decompose and mineralize the detritus, which are essential processes in an ecosystem.
森林土壤动物中许多种类是以分解者或转化者的身份存在的,它们通过对凋落物的粉碎以及与微生物共同作用对森林凋落物及土壤中的团粒体进行分解来促进系统养分循环,这一生物过程在森林生态系统中发挥着不可替代的作用。
-
The question of searching characteristic points or straight lines on moving rigid body is decomposed into two relatively independent sub-questions. The first one is to evaluate the characteristic of points and straight lines on moving rigid body, whose mathematics model is a kind of special non-differential max-mini optimal problem with inequality constraints. By the method of Saddle-point Programming and maximum entropy, the problem can be transformed as a differential optimal problem with single objective. The second oner is to search approximative character points or straight lines on moving rigid body within design space, whose mathematic model is nonlinear and non-differential problem with multiple constraints.
本文将在运动刚体上寻找特征点或直线的优化问题分解为两个相对独立的子问题,一是对运动刚体上点或直线的特征性评定,其实质是平面曲线的圆度或直线度的评定问题,优化模型是以最大误差为最小作为优化目标的约束不可微的优化问题,本文采用鞍点规划和极大熵方法,将其转化为单目标可微优化模型;二是在设计空间内,寻找运动刚体上特征性评定指标最小的近似特征点或直线,其优化模型是非线性、多约束的不可微优化问题,本文提出用遗传算法和BFGS局部搜索法相结合来求解。
-
To deal with dependent problems with epistatic interactions, Experimental study of CGA for NK landscape problem is given.
对于不可作独立子问题分解的问题,则以基因连锁一般模型—NK模型进行了实例研究。
-
In the PE blowing procedure, mold temperature, mold pressure mold duration are the essential conditions and the mold temperature determine the decompose speed of blowing agent AC and cross link agent DCP.
在PE发泡工艺中,温度、时间、压力是不可缺少的工艺条件,其中温度决定了发泡剂、交联剂的分解速度。
-
On the other hand, the energy decomposition shows that dispersion and repulsive exchange forces play an important role in the organic cation-π interaction, although the electrostatic and induction forces dominate the interaction.
其次,能量分解结果显示,虽然静电能和诱导能在阳离子(NH4+)-π相互作用中占主导地位,但色散能和交换排斥能也是不可忽视的。
-
When 〓 is the family of bipartite graphs,the 〓 capacityand the 〓 valency of a graph G are referred to as the biparticitydenoted by β(Gand the bivalencydenoted by 〓(Gof G respectively;when 〓 is the family ofgraphs whose components are complete bipartite graphs,the 〓 capacity and the〓 valency of a graph G are referred to as the complete biparticitydenoted byc(Gand the complete bipartite valencydenoted by 〓(Gof G respectively;andwhen 〓 is the family of star forests,the 〓 capacity and the 〓 valency of a graphG are referred to as the star arboricitydenoted by st(Gand the star valency ofG(denoted by 〓)respectively.
以v记图G的完全二部分解中顶点υ所关联的π中完全二部图的个数,记〓这里π取遍G的所有完全二部分解。我们称υ为G的完全二部次。对一般的图,当图的阶数充分大时,P。〓和L.Pyber给出了υ的一个上界,即,〓。F.R.K.Chung等人及Z.Tuza的结果说明这一上界是不可改进的。对υ的具体值,即使是对某些特殊的图类,结果也知之甚少。P.C.Fishburn和P.L.Hammer给出了一个相关的结果:当n≤16时,〓,(在υ的定义中,以完全二部覆盖替代完全二部分解,即得〓。同时他们提出了下述公开问题。问题1。〓=?
- 推荐网络例句
-
Breath, muscle contraction of the buttocks; arch body, as far as possible to hold his head, right leg straight towards the ceiling (peg-leg knee in order to avoid muscle tension).
呼气,收缩臀部肌肉;拱起身体,尽量抬起头来,右腿伸直朝向天花板(膝微屈,以避免肌肉紧张)。
-
The cost of moving grain food products was unchanged from May, but year over year are up 8%.
粮食产品的运输费用与5月份相比没有变化,但却比去年同期高8%。
-
However, to get a true quote, you will need to provide detailed personal and financial information.
然而,要让一个真正的引用,你需要提供详细的个人和财务信息。