态度决定了成功的最大概率，决定了成功的全部学问。
Attitude decides the biggest probability of (success) and the whole learning for success.
本文分析了一种对PN序列最佳的捕捉策略，即最大概率捕捉策略。
An optimum search strategy for PN acquisition, i. e. maximum probability search strategy, is analysed in this paper.
这个一般准则包括了最大概率拟合、最小变化拟合、最小突变拟合等。
This optimality criterion contains maximal probability fits, minimal variation fits and minimal mutation fits.
当我们这样做时，我们可以看到这个曲线，这个概率分布曲线，这里有发现，电子的最大概率。
And when we do that we can see this curve, this probability curve, where we have a maximum probability of finding the electron this far away from the nucleus.
说明了这种控制律可以通过选取控制输入使得最大概率预报器作出的预报为零得到。
This control law is shown to comprise a maximal probability predictor, and control input is chosen to make the prediction zero.
对于未知语音，根据各识别系统的概率得分，采用最大概率准则进行口音的分类判决。
For unknown accented speech, by means of the logarithmic scores associated with each system and the maximum likelihood criterion, automatic accent classification of non-native speech can be made.
为了提高虹膜图像分类的准确性和稳定性，提出了一种基于最小最大概率机的虹膜图像分类方法。
In order to improve the accuracy and stability of iris image classification, an iris image classification method was developed based on minimax probability machine.
选这些参数的最大概率作为河道的最优化模型，利用所生成的最优化参数计算出河道砂体的边界面。
Choosing the maximum probability of channel geometry parameters as optimization model, the bounding surfaces of channel reservoir are computed with the optimization geometry parameters.
二是基于相关机会规划模型：投资者首先确定一个收益目标，然后寻找证券组合以最大概率实现目标。
In portfolio selection model based on dependent-chance programming, we maximize the probability of the event that the total return rate is not smaller than a predetermined value.
融合时利用MPM(最小最大概率机)融合策略对两虹膜的得分值进行融合，最后利用融合后得分值决策。
When fusing, a novel fusion strategy using minimax probability machine (MPM) is applied to generate a fused score for the final decision.
在求解随机最优路径方面，其问题分两种情形：一种以成功概率为优化目标，搜索约束条件下完成运输任务最大概率的路径；
Two scenarios are considered: one sets the success probability as the objective and tries to find out the route with the maximum probability subject to time constraint;
该方法通过修正generate算法，以状态概率不增的次序生成了网络的最大概值有效状态，构成网络状态空间的满足给定范围概率的子空间。
By improving generate Algorithm, we generate the most probable effective states in order of non-increasing probability and form a subspace with some coverage probability.
该方法通过修正generate算法，以状态概率不增的次序生成了网络的最大概值有效状态，构成网络状态空间的满足给定范围概率的子空间。
By improving generate Algorithm, we generate the most probable effective states in order of non-increasing probability and form a subspace with some coverage probability.
应用推荐