随机搜索

From this,two algorithms to find low degree annihilators of a Boolean function are present:complete searching and stochastic searching.The complete one can not only get all the low degree annihilators of a Boolean function,but also get the algebraic immunity of the function.

利用完全搜索法可以得到布尔函数的所有低次零化子，同时还可以确定该布尔函数的代数免疫度；利用随机搜索法能快速得到布尔函数的任意一个低次零化子。

Hence we first propose a globally optimized random search algorithm and prove its asymptotic global convergence; then to improve its convergence velocity and reduce implementation complexity, we propose a practical sub-optimal random search algorithm and analyze its implementation complexity.

为此本文首先给出了一种用于OFDM符号估计的全局最优随机搜索方法，并证明了其渐进全局收敛特性；同时为了改进全局最优的随机搜索算法的收敛速度和实现复杂度，提出了一种可实现的次优的随机搜索算法，并结合实现分析了所提的次优随机算法的计算复杂度。

Mathematical model has been dealt with by punish function search method. Hooke-Jeeves modular vector search method and Powell conjugate direction search method have been adopted and modified.

利用"惩罚函数"法进行了数学模型的处理，采用并改进了Hooke-Jeeves的模矢搜索法及Powell的共轭方向法，还提出一种随机搜索法。

Mixed Discrete Random Programming is one kind of random arithmetic,this arithmetic's superiority is easy and quick, but it is easy to constringe partially.

离散变量随机搜索法属于随机试验法，算法具有简单、搜索速度快的优点，但容易造成局部收敛。

CBFEC emphasizes direct correspondence of concepts in EC with its software architecture for ease of understanding and using; minimal coupling with specific problem structure for easy adaptation it to solve a large number of wholly different problems; interface-centered design for extendibility. To achieve those objects, the problem-solving method of EC is analyzed and the problem-solving procedure of EC is divided into three interactive aspects: population-based stochastic searching mechanism, problem specific information to implicitly guide the stochastic searching, and the observation and control of the computation procedure of EC. Then the key concepts of EC are identified in those three aspects; the normal implementations of those concepts are summarized; the interfaces represents those concepts in software are abstracted; the collaborations of components through those interfaces are designed. CBFEC is implemented on mainstream component software platform COM/DCOM (Component Object Model/Distributed COM from Microsoft), which includes interfaces definitions, commonly using EC components implemented those interfaces, such as Simply EA component, Steady State EA component, EA component, EA component, Population component, Tournament Selection component, Linear Ranking Selection component, Nonlinear Ranking Selection component, Random Number Generator component, etc, and the collaborations of those components through those interfaces.

具体的做法是把演化计算看作是基于组件的软件工程的一个应用领域：首先分析了演化计算求解问题的一般思路和方法，把演化计算问题求解过程分为："设计基于群体的随机搜索机制"、"研究问题的性质并以此隐含地定义算法的搜索方向"和"求解过程的观察与控制"三个部分；然后分别找出各个部分中的关键概念，总结这些概念现有的一般实现方法，抽取其本质，以此结合设计模式来定义组件软件的接口；通过分析演化计算各个概念之间的相互联系来设计组件软件间通过接口的进行交互的方式；最后还在目前一种主流组件软件开发平台COM／DCOM（微软提出的组件对象模型）的基础上实现了常用的演化计算组件，如简单演化算法组件、稳态演化算法组件、演化算法组件、演化算法组件、种群组件、锦标赛选择策略组件、线性排名选择策略组件、非线性排名选择策略组件、随机数发生器组件等等。

An efficient algorithm PSOKNN is proposed to reduce the computational complexity of KNN text classification algorithm, it is based on particle swarm optimization which has random and irected global search ability to search randomly and directed within training document set.

提出了一种有效的快速k近邻分类文本分类算法，即PSOKNN算法，该算法利用粒子群优化方法的随机搜索能力在训练文档集中进行有指导的全局随机搜索。

simultaneous annealing ; golbal optimization ; continuous variable

我们将该方法应用到连续变量非线性最优化问题，这时随机搜索算法一般都采用大范围的粗略搜索与局部的精细搜索相结合的搜索策略，这种搜索策略的基本思想是，在搜索过程的初始阶段找到全局优解所在的一个局部区域，然

Because the genetic algorithms could search the optimization of objective function randomly, which via the evolution of groups, our work is based on the embedding/detecting way of "DWT-Based Audio Watermarking Using Support Vector Regression and Subsampling". And this method provides a preliminary discussion on the application of GA, which searching the individual with the highest fitness of attack-resistance in the aggregate of the optimal embedding strength. As an optimization solution of obtaining the optimal embedding strength, it could achieve an adaptive policy, and find a reasonable balance between the robustness and inaudibility of the watermark, just for the better robustness and inaudibility in the algorithm.

遗传算法是通过群体进化来随机搜索目标函数的最优化问题，对于前述基于支持向量回归机的小波域数字音频盲水印算法，进一步地探讨采用遗传算在嵌入强度集合中搜索对抗攻击能力适应度较高的个体，从而得到最佳嵌入强度的一个优化方案，以实现自适应策略，也使本算法能在水印的鲁棒性和不可感知性之间寻找到合理的平衡点，从而具有更良好透明性和鲁棒性。

As such they represent an intelligent exploitation of a random search within a defined search space to solve a problem.

因此他们所代表的智能开发的随机搜索在确定的搜索空间，以解决问题。

The program is based on the following IDL platform Act of random search tree search algorithm optimization examples!

该程序是基于IDL平台下开法的应用随机搜索树进行搜索的优化算法实例！

The absorption and distribution of chromium were studied in ryeusing nutrient culture technique and pot experiment.

采用不同浓度K2CrO4(0，0.4，0.8和1.2 mmol/L)的Hoagland营养液处理黑麦幼苗，测定铬在黑麦体内的亚细胞分布、铬化学形态及不同部位的积累。

By analyzing theory foundation of mathematical morphology in the digital image processing, researching morphology arithmetic of the binary Image, discussing two basic forms for the least structure element: dilation and erosion.

通过分析数学形态学在图像中的理论基础，研究二值图像的形态分析算法，探讨最小结构元素的两种基本形态：膨胀和腐蚀；分析了数学形态学复杂算法的基本原理，把数学形态学的部分并行处理理念引入到家实际应用中。