所以。欧拉荷载不等于临界压力。
这个公司也在推出电动力车型——欧拉。
The firm also plans to introduce an electric car, the Gwkulla.
维欧拉是在莎士比亚那个剧里出现的吗？
上图：美丽的欧拉等式。
该方程组涵盖了变分问题的各种欧拉方程。
The complete Euler equation set contains all kinds of Euler equations of the variational problems.
欧拉参数是规范四元数。
在这些密码体制中，欧拉函数起着重要作用。
In these cryptosystems, Euler totient functions play an important role.
它们是勾股定理、中国剩余定理、欧拉定理。
They are Pythagorean proposition, Chinese residual theorem and Oula theorem.
通过两个算例验证了完全欧拉方程组的正确性。
The correctness of the complete Euler equation set is verified with two functional examples.
本文介绍了一种平面流动的快速欧拉方程解法。
A fast Euler Solver for planar flows is developed in this paper.
若图G含有生成欧拉子图，则称G是超欧拉的。
A graph G is supereulerian if G has a spanning eulerian subgraph.
设表示欧拉函数，用分析方法给出了的一个渐进公式。
An asymptotic formula is given for the sum, where is the Eulers function.
本文通过变分法欧拉方程推导出极小曲面的几个等价命题。
This paper investigates several equiyalent propositions of minimal curve surface by means of the euler equation of calculus of variations .
他的成果丧失了，除了一位实验室助理杰瑞·欧拉什的记忆。
His work was lost except for the memories of a lab assistant, Jerry Olarsch.
通过对于对称欧拉图和对称欧拉路径的研究，得出了多项理论结果。
Several theoretical results are obtained by studying symmetric Eulerian graph and symmetric Eulerian trail.
建立了一体化弹用小涡扇发动机系统含粘性力项的准三维欧拉流动模型。
A quasi three dimensional flow Euler model with viscous force terms was constructed for integrated small turbofan engine systems.
欧拉方程一般都是用“变量代换”法求解的，但其过程一般都比较繁琐。
In general, Euler equation is solved by the method of variable transformation, but the procedure is complicated.
在大多数情况下，分子的粘度是不重要的，因此采用欧拉方程就足够了。
In most cases, molecular viscosity is unimportant so that the use of Euler equations is sufficient.
文中用基于图段的方法计算欧拉数，并对该算法的时空复杂度进行分析比较。
In this paper, an approach to compute Euler number based on foreground run is formulated.
在对机器人进行运动学分析的基础上，利用牛顿欧拉法建立机器人动力学方程。
We set up robot dynamic equations using Newton Euler method on the basis of kinematics analysis of robot.
这个图既没有欧拉回路，也没有欧拉路径。因为有超过两个顶点的度数为奇数。
Neither Eular circuit nor Eular path exists in this graph, since there are more than two vertices with odd degree.
当所给风向图是欧拉图时，由这一近似算法求得的投递员路线是最优的投递员路线。
It is also shown that the postman route obtained by this approximation algorithm is optimal if the given windy graph is Eulerian.
欧拉在1736年解决了这个问题，他用抽象分析法将这个问题化为第一个图论问题。
Euler solved this problem in 1736. He changed this problem into the first graph theory problem by abstract analyzed method.
采用欧拉双流体模型，运用计及颗粒团聚效应的能量最小多尺度模型改进气固相间曳力。
By taking cluster effects into account, it USES the energy-minimization multi-scale model to improve the drag force between gas and solid.
提出了欧拉向量、欧拉方向余弦矩阵、欧拉基变换方向余弦矩阵等概念，并给出相应的公式。
Some conceptions and the correspoinding equation is put forward, such as Euler vector, Euler orientation cosine matrix and Euler switch orientation cosine matrix.
哥尼斯堡曾有七座桥梁，1736年，欧拉证明了要走过哥尼斯堡的七座桥且每桥只通过一次是不可能的。
Konigsberg had seven Bridges, and in 1736 Euler proved it was impossible to find a path that allowed you to cross each bridge exactly once.
哥尼斯堡曾有七座桥梁，1736年，欧拉证明了要走过哥尼斯堡的七座桥且每桥只通过一次是不可能的。
Konigsberg had seven Bridges, and in 1736 Euler proved it was impossible to find a path that allowed you to cross each bridge exactly once.
应用推荐