基于...

The possibility was discussed that the conventional mechanic carding machine was modified with a computer automatic controlling system based on the artificial neural network.

探讨了利用人工神经网络进行粗梳毛纺毛条质量控制的原理及方法，探讨了用基于人工神经网络的计算机自动控制系统改造传统机械式梳毛机的可能性，通过比较基于人工神经网络的计算机自动控制系统与一般自动控制系统提出了基于人工神经网络的计算机自动控制系统，经对实测数据验算，控制精度十分理想。

On the basis of the properties of central projection and orthographic projection, the differences of different rectification approaches based on orthographic projection are explained, and it is suggested that oblique-plane-rectified photograph can produce orthographic representation of flat terrain cover; differential rectification of RS imagery based on DEM can produce orthographic representation of waved terrain cover; and true orthographic rectification based on digital ground-object model can produce orthographic representation of single objects on ground.

根据中心投影和正射投影的特点，从理论上说明了不同正射投影纠正方法之间存在的差异，认为：基于透视变换的像片倾斜纠正可生成水平地表覆被的正射投影表达；基于DEM的正射影像微分纠正可生成起伏地表覆被的正射投影表达；基于数字地物模型的真正射纠正可生成独立地物的正射投影表达。

It is well known that the multi-value CDMA spreading codes can be designed by means of a pair of mirror multi-rate filter-banks based on some optimizing criteria. The dissertation indicates that there exists a theoretical bound in the performance of its circular correlation property, which can be described by an explicit expression.

研究了基于两带镜像多速率滤波器组来设计的多值CDMA扩展码的方法，并推导出了基于这种方法设计的码序列在循环相关特性方面所能达到的极限，以及达到此理论极限时应满足的条件；在此基础上，提出了一种基于熵最大化准则来产生CDMA扩展码的设计方法。

Experiments indicate that these algorithms are able to create compound functions and cluster a mixed data set that contains continuous attributes and discrete attributes.

本文对基于数据库的模型生成和模型组合作了较深入的研究，给出了基于原型库的数据开采搜索算法和基于扩充CF-树数据聚类算法。

On one hand, we analyse the virtues and disadvantages of existing algorithms based on inequality criterion and transform domain, then a fast codeword search algorithm based on ordered Hadamard transform is presented.

一方面，分析现有的基于不等式判据和基于变换域的各种算法的优缺点，提出了一种新的基于排序哈德玛变换的快速码字搜索算法。

It mainly studies the choice of mode for competitive tender offer under different bidders' type.

首先，借鉴Perry，Wolfstetter和Zamir（2000）的有关理论，从基于两阶段密封价格投标的竞争性要约收购过程开始，讨论了其中的一些性质，结果表明，同质收购者前提下该过程不但能够获得和基于英式竞价的竞争性要约收购过程相同的期望收益，还能够克服后者存在的一些问题；随后，在异质收购者内生参与条件下就基于英式竞价和密封投标的竞争性要约收购过程进行了比较研究，得到了不同方式下收购结果的特征；最后，针对异质收购者不同知情程度的情况研究了竞争性要约收购方式的选择问题，借鉴Povel和Singh（2004）提出的机制，得到了具备"胡萝卜加大棒"性质的序贯出售过程是这种情况下控股股东的最优选择。

Accordingly, this paper proposes a short-term traffic flow prediction model of data fusion algorithm based on Filtering step by step. Compared with traditional prediction model through Kalman Filtering Theory, this model is not only reduce the computation and lower model to center processor's request, but also ensure estimate accuracy.

基于此，本文提出了一种基于分步式滤波的数据融合算法(Fusion Algorithm of Filtering Step By Step ，简记FAFSS)的短时交通流量预测模型，该模型与传统的基于卡尔曼滤波理论的预测模型相比，不仅减少了计算量，降低了模型对中心处理器的要求，而且保证了预测的精确度。

Based on a lot of experiment results, a conclusion is drawn: comparing with other factors, the performance of branch handling strategy is the key limits of processor to exploit the instruction level parallelism existed in nonscientific code, cache miss have severe effect on superscalar processor's performance when it runs scientific code. Second, in order to reduce the branch penalty and improve the performance of superscalar processor, a new branch handling strategy—a classification based hierarchical branch handling strategy, CHBHS is proposed. It first expands the traditional processor architecture to support multiple condition code, conditional execution and Mbranch instruction, as a result, compiler can reduce the number of static conditional branch when the code is generated. Then, CHBHS tries to use the best suitable mechanism to deal with different branch base on their different behavior. CHBHS can predict the target address of unconditional branch, subroutine call and conditional branch by buffering their target address in branch target buffer, a newly proposed high efficient return address stack is used to reduce the penalty of subroutine return instruction, a new Counter Register Stack is also proposed to reduce the penalty of loop-closing branch to zero, and dynamic branch predictor is incorporate with branch target buffer to predict the outcome of conditional branch.

基于上述结论，为了尽量消除转移指令对处理器开发指令级并行性能力的影响，进一步提高处理器性能，在详尽分析目前已存在的转移处理策略的特点与局限性的基础上，首次提出了一种新的转移处理策略即基于分类的层次转移处理策略CHBHS(Classification Based Hierarchical Branch Handling Strategy)，它首先通过扩展传统的体系结构，支持多条件码、条件式执行及多分支转移技术，以使编译程序在进行代码生成时可尽量少生成条件转移指令，从而减少静态条件转移指令的数目；其次，基于不同的转移指令的行为不同这一事实，提出了对不同的转移指令采用不同的机制进行处理的思想，即对无条件转移指令和函数调用指令以及条件转移指令的目标地址，采用转移目标缓冲器来预测，对于函数返回指令，采用所提出一种的高效返回地址栈来预测其目标地址，对于大多数循环控制转移指令，采用所提出的Counter Register Stack来将其所可能带来的损失减少为0，对于其他的条件转移指令采用动态预测机制来预测其方向。

A data dessimination mechanism based on confidence coefficient Energy of nodes in a WSN is spent mostly on delivering the packets. In order to decrease the number of packets, while not increase the time delay, a model of data dissemination based on confidence coefficient is presented.

4提出了一种基于置信因子的数据分发机制无线传感器网络中节点的能量大部分用来传输数据，为减少数据的传输量，同时不增加数据包的延迟，提出了基于置信因子的数据分发概念，并设计了一种基于置信因子的发送退避策略和传输过滤器。

It is also pointed out that the fuzzy controller implemented through this way can approximate any continuous real function.

摘要基于对模糊集基本特性的分析，提出了一种模糊集合的距离度量方法，与传统方法不同的是它不但与模糊集的质心有关，而且与模糊集的基数有关；其次讨论了如何基于这种距离的定义来实现模糊控制，并指出基于这种方法实现的模糊控制器可以逼近任意连续函数。

It was Napoleon, the immense somnambulist of this dream which had crumbled, essaying once more to advance.

那人便是拿破仑，梦游中的巨人，他还想往前走，去追寻那崩塌了的幻境。

This method alleviates the highly dependent on domain knowledge experts. The quality and efficiency of the KBS were improved.

使用这种设计方法减小了对领域知识专家的严重依赖，提高了知识系统开发的质量和效率。