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

In the first part, the dissertation gives a detailed literature review about oversaturated traffic control and summarizes six basic fundamental problems. They are control subsystem partition problem, control objective category problem, control methodology selection problem, parameter optimization problem and control strategy problem.

本文首先对以往涉及到的过饱和控制问题进行了详细的总结，归纳出过饱和状态控制中六个基础问题，即控制小区的划分问题、控制目标的类型问题、控制方法问题、优化计算方法问题、交通流模型问题和控制策略问题。

The discrete 0-1 programming problem is translated into continuous nonlinear optimization problem by polish function, and the nonlinear optimization problem is solved by contraction algorithm.

3利用过滤函数近似处理连续体拓扑优化问题，使用缩并解法实现了对连续体拓扑优化问题的求解。

In this algorithm, at first the reactive power optimization problem is converted to integer nonlinear programming problem with discrete control variables which are solved by IGA; then by use of PDIP algorithm, the continuous variables which can match with the obtained most are solved, and the reactive power optimization is changed into a nonlinear programming problem with continuous control variables.

首先通过改进遗传算法求解无功优化问题中的离散变量，然后采用原对偶内点法求解与已获得离散变量最匹配的连续变量。

The basic idea was to discrete the structure and find the load function according to the energy criterion of buckling and the principle of random displacement method. As the critical load is the minimum of the load function, a problem of frame buckling can be transformed into an optimization problem. Therefore, the critical load can be found through solving the optimization problem.

先将结构离散为一个有限自由度系统；然后根据有限自由度系统平衡稳定性的能量准则和随机位移法的基本原理，建立符合能量准则的载荷函数，该函数不为零的最小值即为临界载荷，由此将稳定问题转化为无约束的多维优化问题；最后应用遗传算法求出相应于最优解的目标函数值。

The quasi-phsical method makes the original problem an optimization problem in mathematics. There is often the possibility of going to a local minimum of object function when solving the optimization problem mathematically.

所谓拟物就是主动地向自然界学习解决问题的方法，即寻找与原始数学问题等价的物理世界并观察这个世界中物质运动的生动形象，然后从中得出启发并逐步形式化为算法以求解问题。

In this paper, we show that when the data matrices are $2\times 2$ and $3\times 3$-dimensional, we can transfer the problem into an optimization problem with quadratic matrix inequality constraints, based on another equivalent robust optimization problem converted from the original one.

本文表明，当数据矩阵为2乘2阶，3乘3阶矩阵时，我们可以把上述问题转化成二次矩阵不等式约束的最优化问题。

A single machine scheduling problem with batchs setup time depending on sequence is proposed. The math model to minimize setup times is upbuilt. An improved adaptive hybrid genetic algorithm is brought up for solving this scheduling problem. Several operators are redesigned according to the characteristic of this scheduling problem. Follow job optimization recombination crossover is advanced for transmitting the good character to the offspring. To improve the mountain climbing ability of the genetic algorithm, the mutation is replaced by a local optimization algorithm.

提出了一种具有序依赖setup time的单机器批量生产调度问题，以总的setup time最小为目标建立了该生产调度问题的数学模型，设计了一种改进的自适应混合遗传算法求解该生产调度问题，对遗传算法的交叉和变异算子均按照该调度问题的特点进行了改进，提出一种&紧后任务选优重组交叉算子&，该算子能将调度排序上的优良性状很好地遗传到下一代群体中。

We firstly summarize the NN system modeling methods and the popular optimization algorithms, and point out the deficiencies, the limitation of noise cancellation modeling and the need of human intelligence participation, in our former optimization work after analysis. An abstract problem is extracted. It is to find out control variant that makes system output optimized using the data comprising a sample set with N x samples and their corresponding y, and it does not explore given system and achieves full automatic computation procedure. Next we propose a multi-variant controlled system optimization method utilizing CASSANDRA-I small type neural computer and program its application software. Moreover systematic experiments are made to demonstrate the method's validity, ability of noisy samples disposal and practical application.

我们总结了神经网络系统建模方法以及得到广泛采用的优化算法，并分析指出我们前阶段的优化工作中存在的去噪声建模有局限性和计算过程需人干预的不足，在此基础上把问题抽象为：已从系统获得含N个控制量样本的样本集S以及每个样本对应的系统输出，如何依据这些数据求出一个使系统输出y得到优化的控制量x，而不研究具体系统，实现不需要人智能参与自动完成的计算过程；提出应用人工神经网络硬件系统——CASSANDRA-I小型神经计算机的多变量控制系统优化方法，设计完成了其应用软件；并进行系统的实验工作，验证算法的有效性以及此方法处理带噪声样本和实际应用能力。

Job-shop scheduling is a typical combinatorial optimization problem, and large scale scheduling optimization is one of such difficult optimization problems.

作业车间调度是一种典型的组合优化问题，大规模的调度优化是该类问题的难点。

Now he worked in ajoint venture.

现在他在一家合资企业工作。

More troops in Afghanistan won't change any of the foregoing.

更多的在阿富汗的军队也不会改变之前的状况。