查询词典 conquer

Now I know that to conquer fear I must always act without hesitation and the flutters in my heart will vanish.

一个国家的法律，不论多么公正，永远不能防止犯罪的发生。

Now I know that to conquer fear I must always act without hesitation and the flutters in my heart will vanish.

现在我们知道，必须毫不犹豫地行动起来，才能战胜恐惧，才能使内心的动摇消失殆尽。

Now I know that to conquer fear I must always act without hesitation and the flutters in my heart will vanish.

我知道，要克服恐惧，就必须毫不犹豫，继而行动。唯有如此，心中的慌乱才能得以平定。

Now I know that to conquer fear I must always act without hesitation and the flutters in my heart will vanish.

现在我知道，行动会使猛狮般的恐惧，减缓为蚂蚁般的平静。我现在就付诸行动。

Our publications help readers to conquer handicaps in learning English.

我们出版的图书帮助读者去克服英语学习中的困难。

Of course the range that this topic includes is very wide, the care of the greeting of the success of the career, friend, family, these seeing seem dispensable thing, to us these altogether husband common child for, it is the " nutrient " that cannot be short of surely, can let us face the setback in the life, the scared " of 3 kinds of " that heartens want to introduce below conquer.

当然这个话题包容的面很广，事业的成功、朋友的问候、家人的关爱，这些看似可有可无的事情，对我们这些凡夫俗子来说，是必不可缺的&养分&，可以让我们面对生活中的挫折，鼓起勇气征服下面要介绍的三种&惧怕&。

One of the things that adds depth to Command and Conquer 3 is the whole idea of husks.

使CC3的战术和战略变得丰富多彩的其中一个设定，就是关于机甲外壳的这定思想。

Pray every morning for 30 seconds to conquer your fear andcourageously face all your opportunities, keep your mind open insetting goals and keep your attitude positive.

每天早晨祈祷30秒，以克服恐惧，或是获得气去面对你的所有机会。在树立目标的时候保持心胸开阔，态度要积极。

Based on the study on the traveling salesman problem, in this dissertation, some results on the solving of production scheduling problem using the neural networks are described, which includes the following main parts: l The method which was put forward by Hopfield－Tank of solving the traveling salesman problem is analyzed, and the drawbacks of the method are pointed out. The interlinks between optimal tours and city distribution in the clustering and divide and conquer method are analyzed. A parallel network algorithm on the problem of the traveling salesman problem is presented.

主要包括以下几个方面的内容： 1对Hopfield和Tank提出的解决旅行商问题的方法做了分析和研究，指出该方法的严重不足；对于用聚类方法和各个击破的思想解旅行商问题，分析了最优路径与城市分布之间的几个关系；提出了一个解决旅行商问题的并行网络算法，由这一算法得到的解是&or-optimal&路径。

A novel and simple method is proposed to conquer overshoot problem during output current inverting instant.

还提出了一种新颖且简单的方法，克服了逆变电路换向瞬间的电流过冲问题，降低了灯工作电流的波峰系数。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。