查询词典 interpreter programming

Integration of computer programming technology, high resolution optical measuring system and photoelectrical technique;--Soft key input;--Light source adjustment;--Selectable testing model, conversion tables, pressure-holding time, file number input and data saving functions

该机采用计算机软件编程，光学测量系统，光电传感等技术，通过软键输入，能调节测量光源的强弱，能选择保荷时间，文件号与储存等，并提供各种硬度值的转换表方便参考。

With the algorithm analysis of the convex programming model, an optimization solution was achieved by way of illustration and sensitivity analysis of the result was given.

文章分析了模型的求解方法，通过实例的数据计算得到了最优化结果，并对结果进行了敏感性分析。

Following the introductory first chapter and the second chapter on linear algebra and convex analysis, the book is organized into two parts: linear programming and networks flows.

在第一章简介和第二章线性代数和凸分析之后，本书分为两部分：线性规划和网络流。

It is pointed out that optimal solution of linear programming can be represented as a sum of a convex combination of the optimal extreme point s and a nonnegatively linear combination of the optimal extreme directions.

本文指出了线性规划的最优解可表示为最优极点的凸组合和最优极方向的非负线性组合之和，确定了最优极方向存在的条件。

There are a lot of conclusions about properties of convex set and convex function, which have full application in convex programming.

相应于凸规划的凸集和凸函数的性质已有很多结论，并且在凸规划的研究中得到了充分应用。

Third,a nonlinear programming model is given for the coexistence of multi-prices on the basis of the convex function model.

再次，在凸需求函数模型下给出多种价格并存的非线性规划模型。

In the more mature areas such as linear programming and unconstrained optimization, and in those of intermediate maturity such as integer and constrained convex optimization, emphasis will be placed on rapid, large-scale computation.

在那些更为成熟的如线性规划和无约束优化等领域和一些不太成熟的如整数和约束优化等领域，研究的重点将被放到快速的，大规模的计算上。

According to the viewpoint of combination tope, any convex polyhedron can be composed of some simplexes, and both convex polyhedron and simplex are important concepts of programming theory, so it's necessary to find their volumes in some calculations.

由组合拓扑学可知，任意凸多面体均为若干个单纯形的某种组合，两者均为规划论中最重要的基本概念之一，因而在一些计算中对其求积是不可少的。

This algorithm is proposed on the basis of the thought as follovvs: as for three dimensional Euclid space, the feasible region of any linear programming problem is a extended convex polyhedron, of which surface is consisted of some planes, and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter.

如果线性规划问题有最优解，那么过可行域的一已知顶点必至少存在这样一条棱——它以该己知顶点为一端点，可行域的另一顶点为另一端点，并使目标函数在另一端点的函数值优于己知端点的函数值，否则，该己知点就是线性规划问题的最优解。

It is generalization of linear and convex quadratic programming.

这可以被看作是一个特殊情况非线性规划或泛化的线性或凸二次规划。

Chimborazo and Cotopaxi, took me by the hand.

越过琴博腊索山和科托帕克西山。

This car is in a good condition.

这辆车的状况很好。