查询词典 multiple decision problem

In view of the operational SITIO problem is faced by the system decision-maker daily, the dissertation uses two chapters to address this class problem applied in two situations respectively.

由于作业层的随机联合优化问题几乎是系统决策者每天都要面对的问题，本文用两章篇幅分别讨论了两种应用背景下解决这类问题的过程。

In view of the operational SITIO problem is faced by the system decision-maker daily, the dissertation uses two chapters to address this class problem applied in two situations respectively. One of two situations is assumed to be R-System.

山于作业层的随机联合优化问题几乎是系统决策者每天都要面对的问题，本文用两章篇幅分别讨论了两种应用背景下解决这类问题的过程。

In a database the concept of an example might change along with time which is known as concept drift When the concept drift the classification model built by use of old data is unsuitable for classify new data Therefore concept drift has become a hot issue in data mining in recent years Although many algorithms had been proposed to resolve this problem they can not provide users with the reason of concept drift However a user might be very interested in such rules For example doctors want to find what makes disease change; researchers want to know the reason of the variety of the weather; and decision makers would like to understand why a customer's shopping habit change In this thesis we propose a Concept Drift Rule mining Tree called CDR-Tree to solve this problem CDR-Tree can not only find the rule of concept drift also build the prediction model for both old and new data at the same time

无论在大型资料库或现实生活中，同一资料样本的概念有可能会随著时间的递移而改变，也就是产生所谓的概念漂移。当样本发生概念漂移时，由旧有资料所建构的分类模组将不再适用於预测新获得的资料，因此，近年来概念漂移已成为资料探勘中一项热门的研究议题。虽然已有？多学者提出不同的技术来解决概念漂移的问题，但是这些方法都是利用修正或重建的方式来产生适合新资料的预测模组，并无法提供造成概念漂移的原因。然而对使用者而言，其感兴趣的可能正是这些引起概念漂移的规则，如医生可能想了解引起疾病变化的主因、学者会想要知道气候转变的规则、或是决策者想找出顾客购物习惯改变的因素等。因此，本论文提出概念漂移规则探勘树( Concept Drift Rule mining Tree )，简称CDR-Tree，来解决这个问题。CDR-Tree不但能探测出造成概念漂移的主要原因，亦能同时建立新旧资料的预测模组以供决策者运用使用。

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.

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

We applied the proposed algorithm to the reduction of overkills and retests in a wafer testing problem, which is formulated as a stochastic simulation optimization problem that consists of a huge decision-variable space formed by the vector of threshold values in the wafer testing process.

我们将所提出的方法应用在降低晶圆测试程序中的误宰与重测问题，这是一个由测试程序中门限值向量所组成，含有巨大决定变数空间的随机模拟最佳化问题。

ABSTRACT Code Division Multiple Access is the preferred multiple accessing mode of the Third Generation Mobile Communication Systems...

码分多址是第三代移动通信系统的优选多址工作方案，但CDMA固有的多址干扰问题限制着系统的容量。

ABSTRACT Direct Sequence/Code Division Multiple Access is the preferred multiple accessing mode of the third generation mobile co...

直接序列码分多址是第三代移动通信系统的优选多址工作方案。

ABSTRACT Direct Sequence/Code Division Multiple Access is the preferred multiple accessing mode of the third generation mobile communication systems.

直接序列码分多址是第三代移动通信系统的优选多址工作方案。

Multiple trials is the basic concept of many parallel simulated annealing. It is to perform multiple trials at the same time to search acceptable solutions. The division simulated annealing with no communication and The clustering simulated annealing are two common types of parallel simulated annealing methods. The division simulated annealing with no communication makes each processor generate its own adjacent solution from its own current solution and compute the acceptance probability for a adjacent solution. Each of the processors searches solutions without communicating each other. Clustering simulated annealing makes each processor generate its own adjacent solution from a common current solution and compute the acceptance probability for each adjacent solution. Then, it decides which adjacent solution should be used to replace current solution according to a pre-specified rule.

许多平行模拟退火法之理论依据为多向试验，利用同一时间探索更多方向的试验来拓展搜寻的广度或深度，不进行沟通的分工模拟退火法(the division simulated annealing with no communication)以及丛集模拟退火法(the clustering simulated annealing)皆为平行化的模拟退火法，前者定义为各个处理器针对各自的起始解进行搜寻，产生各自的搜寻序列，在搜寻过程中处理器不进行任何沟通，各处理器仅针对自身之目前解进行搜寻；而后者定义为让所有处理器针对同一目前解进行运算搜寻各自的可能解，并各自决定其产出解之接受机率，最后根据事先决定之规则进行沟通比较，挑选其中一个可接受解取代目前解。

Simulation results show that the method can eliminate paroxysmal multiple access interference efficiently and has excellent capability of anti-multiple access interference and high reliability.

仿真实验表明，提出的方法能够有效抑制阵发性多用户干扰，具有很强的抗多址(multiple access interference，MAI)干扰能力和较高的数值鲁棒性。

I have a pimple,all right?

我长了个粉刺好吗？

Fraternizing in the prison shower, come on.

在监狱洗澡的时分念战人称弟讲兄，失了吧