查询词典 sequencing problem

In this paper, we have proposed a flexible encryption blocks selection buyer-seller watermarking protocol integrated the RSA asymmetric encryption system and homomorphism mechanism to protect the ownership of digital contents and fit real life. And consider the secondhand transaction in the real life. We also propose a buyer-reseller watermarking protocol based on the flexible encrypt blocks selection buyer-seller watermarking protocol to offer a solution of secondhand transaction. In our scheme, it's more light data transport requirement than other schemes. All roles in protocol will benefit by their participation. Our scheme can overcome various of the known attacks and security problems in the buyer-seller watermark protocol, such as buyer's right problem, unbinding problem, piracy tracing problem, conspiracy problem, buyer's participation in the dispute resolution problem, man-in-the-middle attack problem and anonymous problem. Furthermore, the seller and arbiter can verify the buyer's watermark without decrypting it in our scheme.

本文除应用RSA非对称式加密与秘密同态机制，提出了一个符合现实生活中买卖交易行为、可弹性调整加密范围数位内容买卖浮水印协定，强化了目前研究中对於数位内容买-卖浮水印协定的安全性，并进一步的考量二手商品交易行为，在可弹性调整加密范围数位内容买卖浮水印协定基础上，提出一个结合数位内容二手买卖与盗版追踪的二手数位内容买卖浮水印协定，达到让参予买卖的角色可以在安全的情形下完成二手数位内容所有权的移转并从中获取相对应利益的目标的数位内容转卖浮水印协定来增强了目前数位内容买卖浮水印协定研究中对於二手交易欠缺之处，解决了数位内容买卖浮水印协定中所可能遭遇的重要安全性议题，如：买方权益、盗版追踪、资讯不连结、共谋、买方需要参与仲裁、中间者攻击及匿名性问题。

Based on these considerations, the test sequencing problem is decomposed into test points selection problem and test sequence arrange problem.

为此，将序贯测试问题拆分为测点选择与序测试设计两个问题。

The slab sequencing problem in hot strip production is a complex combination optimization problem.It can be formulated as Prize Collecting Traveling Salesman Problem.

热轧带钢生产中的板坯排序是一种复杂的组合优化问题，可以归结为一个PCTSP问题。

It is known that a production sequencing problem in mixed-model assembly line falls into NP-hard class of combinatorial optimization problem and thus a large-sized problem may be computationally intractable.

本文应用一种解大规模组合优化问题，特别是NP完全组合优化问题的有效近似算法——模拟退火算法，来求解混流生产线的投产排序问题，克服了上述缺点。

Otherwise, the algorithm restores the domain of variables that were eliminated due to the instantiation of current variable, and backtracks sequently. This thesis gives design for "Ming Yue "[1.1], and briefly states impleme -nt of problem solving system on discrete domains combined with examples. It also gives some experiment results of typical problems, such as car sequencing, timetabling problem, job shop scheduling problem and so on.

本文给出了&明月&的设计，并且结合实例简述了离散论域上约束求解系统的实现，给出了一些典型问题的实验结果，如汽车排序、时间表调度问题、车间作业调度问题等，实验证明该系统对于某些类问题的确是行之有效的。

A novel hybrid algorithm, which combines predictor-corrector primal-dual interior point method and genetic algorithm, is presented for dynamic and static reactive optimization in this dissertation. The algorithm fully make use of the advantage of interior point method in solving successive optimization problem and the advantage of genetic algorithm in solving discrete optimization problem. The original problem is divided into three parts: total successive problem, discrete problem and successive problem.

结合内点法和遗传算法，本文提出了一种新颖的混合算法用于求解动、静态无功优化问题，算法充分利用了内点法易于求解连续优化问题和遗传算法易于求解离散优化问题的优势，将原优化问题分解为初步的连续优化问题、离散变量优化问题、连续变量优化问题这三个子问题分别求解。

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.

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

An aircraft sequencing problem is a non-deterministic polynomial hard problem, which is hard to resolve.

飞机排序问题属于NP难问题，解决比较困难。

Slab sequencing problem is a kind of special sequenceing problem with complex constraints and NP-hard character.

热轧调度中的板坯排序问题是一类特殊的排序问题，具有约束条件复杂、NP难特点。

Keywords :::: Make to Order, Order Selection, Production Sequencing,Traveling Salesman Problem, Orienteering Problem

关键词关键词关键词关键词：订单生产，订单选择，生产排序，旅行商问题，定向越野问题

Many will continue to choose to live in duality and in conflict.

许多人将继续选择活在二元对立性和冲突中。

I find that students of the University of Physical Education all wear sportswear at first sight.

我发现：体育大学的学生乍一看，都是穿运动衣，大家都一样