查询词典 discrete optimization problem

Some methods aiming at the two problems have been researched. First, the optimal number of ATE site can be calculated based on a cost model of DAT-ATE. Second, the problem of test schedule which is equitant with two-dimensional Bin-Packing problem is presented. Then a TCG denotation satisfied with T-admissible rule is more convenient for combinational optimization. With Simulated annealing algorithm, better test scheduling results can be achieved; but there is no great optimization space because the efficiency of scheduling is greater than 90%. Third, A novel test compression method——Multi-capture testing is proposed to compress the stimuli. And the ATPG results show that MC achieves high compression ratio which is greater than 90% in some large-scale circuits. MISR, widely used in LBIST, is employed to compress the responses. The aliasing analysis demonstrates that the fault coverage reduction is little due to the existence of aliasing. Fourth, an improved TIC (called S-TIC) aiming at structured test is proposed based on ARM's TIC. A MC scheduling algorithm is proposed to compute the SoC test time and combine MC vectors to SoC test vectors. The scheduling results shows that test time is greatly reduced when using the proper scheduling priority.

首先，给出了低成本ATE的成本模型，根据此模型得到最低测试成本时系统级测试调度的基本参数——测试Site数；其次，本文将DAT-Scan方式的SoC测试调度等价为两维BP问题，为有效地求解该问题，将该BP问题表示为TCG图并通过模拟退火算法解决其求解过于复杂的问题，调度的结果表明该方法在测试时间上有一定改善，并指出DAT-Scan测试调度效率已经大于90％，进一步优化的空间较小；第三，本文尝试通过测试压缩来解决激励所需的测试带宽，提出了Multi-capture结构并解决了MC测试过程中的&矢量&退化问题，MC测试的ATPG结果表明其测试压缩率很高（大电路接近90％）；第四，在激励获得很高压缩比的情况下，测试响应也需压缩，本文采用LBIST中常用的MISR作为MC测试的响应压缩电路，理论分析和实验结果都证明了MC测试的别名对故障覆盖率影响较小（小于2％），并对两类别名的成因做了具体分析；第五，在MC测试及其响应压缩的基础上，本文改进了ARM公司的测试控制器TIC使之适合于MC测试，为了解决MC测试矢量合成问题，本文抽取了MC测试模型，通过固定优先级的MC测试调度模拟将MC矢量合成为ATE矢量，并模拟出了总的MC测试时间。

A new heuristic solution algorithm is presented using an improved genetic algorithm. In the improved genetic algorithm, nondifferentiable exact penalty functions are used to transform a constrained optimization problem into a single unconstrained optimization problem, and hybrid crossovers and intermittent are applied to increase the search capability.

设计了基于改进遗传算法的启发式求解算法，该算法借助不可微精确罚函数将约束问题转化为单个无约束问题来解决，采用混合杂交和间歇变异提高算法的搜索能力。

Reducing the overkills and retests in a wafer testing process can be formulated as a stochastic simulation optimization problem with huge decision-variable space . For this problem, we have proposed an ordinal optimization theory based two-level algorithm to solve for a good enough solution.

降低晶圆测试程序中的误宰与重测可以形成一个具有巨大决定变数空间的随机模拟最佳化问题，针对此问题我们提出一个以序的最佳化方法为基础的两层次演算法，来求解一个足够好的解。

Firstly, on the basis of defining the characteristics of project and reviewing the mathematical models for RCPSP, we constructed the mathematical model for RCPSP under the condition that there is non-fixed duration and splittable tasks in project; In order to solve above model, we emphatically discussed the basic principle of the swarm intelligence algorithm--the particle swarm optimization algorithm as well as improvement research for current algorithm, and then proposed a new improved particle swarm optimization algorithm and analyzed its application process in the resource-constrained project scheduling problem; Lastly, in order to confirm the validity of the model and the algorithm, we took an experiment based on 108 instances that produced by problem instance generator which was developed by our team.

首先，在对RCPSP项目特征进行界定以及对项目进度优化模型回顾的基础之上，构建了基于活动工期不固定、任务可拆分特征的RCPSP的数学模型；为了求解上述模型，本文详细阐述粒子群优化算法(Particle Swarm Optimization，PSO)的基本原理以及当前对其改进的研究成果，提出了一种新的改进PSO算法，并对其在RCPSP的应用过程进行了设计；最后，为了检验模型的有效性及算法的优越性，基于梯队内部开发的案例生成器生成的108个算例，进行了仿真试验。

The problem of finite precision multiuser decorrelator is formulated as linear bounded integer optimization problem,and the problem is shown to be NP-hard problem.

该文首先分析了应用有限精度序列为解相关矩阵序列的解相关接收机，将有限精度解相关的多用户检测问题归约为线性约束整数优化问题，同时证明此问题为NP-hard问题。

Based on Pontryagin maximum principle, the lunar soft landing problem is transformed into a two-point boundary value problem in mathematics. In consideration of the bound condition and transversality condition, the resulted two-point boundary value problem is converted into a parameter optimization problem aiming at the initial values of conjugate variables and the terminal time, then it is solved by the nonlinear programming.

首先，从庞德里亚金极大值原理出发，将有限推力作用下月球软着陆问题转化为数学上的两点边值问题；在考虑边界条件及横截条件的前提下，将该两点边值问题转化为针对共轭变量初值和末时刻的优化问题；然后应用非线性规划方法求解所形成的参数优化问题。

Quadratic assignment problem is a NP-hard combinatorial optimization problem and has been applied in various fields. There are always many zero elements in the flow matrix or distance matrix of the quadratic assignment problem instances which are abstracted from the practical problems. Much computation time can be saved if we can first reduce the size of the problem by using its zero elements.

二次分配问题(quadratic assignment problem， QAP)是应用于诸多领域的组合优化NP-难题，许多从实际问题中抽象出来的二次分配问题，其流矩阵与距离矩阵中存在大量零元素，如果在该类二次分配问题的求解中，能够充分利用这些零元素的信息，将大大缩减问题的规模，节省大量运算时间。

After a further analysis based on the empirical results,a trial probe on the cognitiveprocessing mechanism of the problem representation of the word problem in two types of MLDwas made by the author.The MRD performed much poorer than the MLD only in the mostdifficult equation listing of word problem and the medium and most difficult problemrepresentation of word problem,which showed no difference in computation and comprehensionof simple meaning of the problem,but the gap between two types of MLD became wide as afunction of difficulty and cognitive loading.It indicated that the MLD only had some advantage over MRD for they used more cognitive skills to solve the problem.

基于以上实验的结果，对两类数学困难小学生的应用题问题表征的认知机制作如下推断：混合型数学困难学生仅在高难度水平的应用题列式成绩和中高难度水平应用题问题表征水平上比单纯型数学困难学生得分显著低下，表明两类数学困难小学生在计算能力与理解简单题意的能力上并无差异，但随着难度提高，认知负荷加重，两类数学困难学生在应用题解题上的差异得以突显，表明当需要运用更多的认知能力解决问题时，单纯型数学困难学生比混合型困难学生更具优势。

Then, according to Radau collocation method, the dynamic optimization problem is converted to a nonlinear programming one that contains continuous and discrete variables.

根据Radau配置法将动态优化问题转化为连续变量与离散变量并存的非线性规划问题。

Equal forms with multiobjective function optimization of composite structure,which is suitable for genetic algorithm solving, is constructed. Expression of optimal problem with chromosome including discrete mixed with continuous variables are established.

用评估函数法构造了适用于遗传算法求解的复合材料结构多目标优化问题的等价表达形式，给出了离散变量与连续变量混合优化问题解的染色体表示。

A carrier gas such as nitrogen is directed through line 20 and valve 22 to connect with line 26 and mix with the gas sample.

如氮气之类的载体通过管线20和阀22引入，与管线26相通，与气体样品混合。

But for the most part, knaves and parasites had the command of his fortune

然而支配他的家产的大多是恶棍和寄生虫。