目标函数

Firstly, system model depicted by TSIOA is transformed into an USTGSS (untimed stable label transition graph of symbolic state) which does not contain abstract time delay transitions. Then, the testing methods based on LTS are used to the generate transition sequences from USTGSS according to structural coverage criteria. Finally, a process of constructing and executing the test cases is given, in which object functions of time delay variables are imported, and time delay variables used in the transition sequences are solved dynamically by linear programming techniques.

该方法首先将时间安全输入/输出自动机描述的系统模型转换为不含抽象时间延迟迁移的稳定符号状态迁移图(untimed stable transition graph of symbolic state，简称USTGSS)；然后采用基于标号迁移系统(labeled transition system，简称LTS)的测试方法来静态生成满足各种结构覆盖标准的包含时间延迟变量迁移动作序列；最后，给出了一个根据迁移动作序列构造和执行测试用例的过程，该过程引入了时间延迟变量目标函数，并采用线性约束求解方法动态求解迁移动作序列中的时间延迟变量。

Based on the mind of perturbation,a method which combines transitive closure method with the objective function method is introduced,and the steps of the method is presented.

分析了传统的模糊聚类方法，基于摄动思想，将传递闭包聚类法与目标函数法相结合，得出了一种既满足聚类效果要求又减小聚类失真的简便算法，同时给出了该聚类方法的步骤。

In chapter 2, the theory of an improved trilinear decomposition algorithm based on a lagrange operator has been described.

论文的第二章，提出利用拉格朗日乘子法的原理来构造目标函数的三线性分解改进算法基本思路。

The number of trolley transportation objective function.

建立了输送小车数量的目标函数。

Multi-model was used in predictive horizon to decrease the predictive error and reflect true state of system.

将非线性系统预测控制的目标函数转化为线性二次规划问题，避免了非线性规划巨大的计算量。

The algorithm handles the objective function and constraints separately, and adopts both directional and random search mechanism. It can avoid falling into local optimal point, which may appear in previous bionics random algorithms due to uncertainness of some parameters and/or without guiding search direction.

该算法将目标函数与约束条件分开处理，采用兼具方向性和随机性的搜索机制，避免了已有仿生类算法由于一些参数难以确定和无引导性的搜索方向而陷入局部最优的问题。

A class of modified BFGS algorithm which satisfies the new quasi-Newton equation is proposed in the paper[1],and the global convergence of the algorithm is proved under the condition that the objective function is uniformly convex.

文献[1]曾在已建立的一类新拟牛顿方程 Bk+1sk=yk-=yk+kγskTsksk的基础上，证明了满足新拟牛顿方程的一类改进BFGS算法在目标函数为一致凸的条件下，具有全局收敛性。

In this paper,several quasi-Newton algorithms are generalized to a class of new quasi-Newton equation,several modified quasi-Newton algorithm s are obtained and their global convergence are proved under the objective function is uniformly convex.

将几个拟牛顿算法推广到一类新拟牛顿方程，得到几个修正拟牛顿算法；在目标函数为一致凸的条件下，证明了它们都具有全局收敛性。

With the improvements to the initial population and disposal of objective function, we choose DE as the searching method in EAFSC to investigate it performance in classic unrestraint optimization, Minimax Optimization and nonlinear equations.

其次结合对初始种群和目标函数的处理，以DE为例分别探讨EAFSC在典型的无约束优化、Minimax优化和约束优化问题、非线性方程及方程组求根中的应用。

It is also found that the spurious dipoles are unstable in different inverse problem solution.

反之，目标函数可以得到极小优化，但出现多余的伪偶极子，且这些伪偶极子在多次不同条件的反演结果中，处于不稳定状态。

And Pharaoh spoke to Joseph, saying, Your father and your brothers have come to you.

47：5 法老对约瑟说，你父亲和你弟兄们到你这里来了。

Additionally, the approximate flattening of surface strip using lines linking midpoints on perpendicular lines between geodesic curves and the unconditional extreme value method are discussed.

提出了用测地线方程、曲面上两点间短程线来计算膜结构曲面测地线的方法，同时，采用测地线间垂线的中点连线和用无约束极值法进行空间条状曲面近似展开的分析。