The calculation results indicate that the precision of method based on predictive neuron model is evidently higher than that of conventional Durbin algorithm and lattice algorithm.
计算结果表明，运用预测神经元方法所得到的线性预测系数，精度明显高于传统的杜宾算法和格型算法。
This paper uses the adaptive least squares lattice algorithm (LSL) to calculate the spectral estimation of pressure fluctuations in unsteady flow, and describes the principle of the LSL algorithm.
本文应用自适应最小二乘格型（LSL）算法估计非恒定流压力脉动的功率谱密度。
First, the algorithm mines the data for frequent sequences and computes an adjacency lattice.
首先，该算法挖掘频繁序列的数据并计算一个邻接格。
This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree.
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
Compared with traditional lattice methods, the algorithm have an obvious progress in the computation complexity and storage.
同传统格型算法相比，这种算法的计算复杂度和存贮量均有明显改善。
Polar formation algorithm (PFA) can mostly compensate MTRC in the case of small target and distant field, which need the transformation from polar grid to Cartesian lattice.
在小目标远场情况下，极坐标格式算法(PFA)能够基本消除MTRC，这种算法需要在空间频域进行从极坐标分布到直角坐标分布的二维插值。
An initial condition estimation algorithm for global coupled map lattice systems based on the symbolic sequence is proposed.
在符号动力学的基础上，提出了全局耦合映像格子系统的初始状态估计算法。
For the proposed one we use the fast RLS algorithm in lattice predictive filtering part with some modification and the LMS in adaptive transversal filtering part.
算法在格型预测器部分采用快速RLS算法，而在自适应横向滤波器部分采用LMS算法，并加以适当改进。
Using the inherent general-special relation between concepts in sublattice, the horizontal union algorithm of multiple concept lattices to construct the concept lattice is also presented.
最后结合子概念格中概念间固有的泛化-特化关系，提出一种多概念格的横向合并算法来构造概念格。
An incremental construction algorithm named PCCL of the constrained concept lattice was presented by using pruning technology that eliminated the redundant information in the construction process.
采用剪枝技术来消除构造过程中存在的冗余内涵比较，给出约束概念格渐进式构造算法PCCL。
Advantage of the algorithm is that scope of generating new nodes is small, and concept lattice is quickly constructed.
此算法的优点是生成新节点的范围小，构建概念格的速度快。
The paper gives an algorithm of obtaining all form concepts from the formal context based on the concept lattice theory. And then, to extract the implication rules from the lattice.
基于概念格理论提出了一种从形式背景中获得所有形式概念的算法，并根据构建的概念格提取蕴含规则。
This l-reduced lattice reduction algorithm can find vectors shorter than ones got by the standard LLL algorithm which is widely used in this field.
利用这种新型算法找到的短向量比使用标准LLL规约算法求得的短向量更加接近格中的最短非零向量。
Finally, incremental algorithm of producing concept lattice is used to carry on concept clustering to the passage of search results, and produced the theme of each cluster result from it.
最后，使用增量式的概念格生成算法对搜索结果片段进行概念聚类，并从中产生每个聚类的主题。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
The lattice construction algorithm plays a very important role in the application of concept lattice.
在概念格的应用过程中，造格算法具有很重要的地位。
The incremental algorithm use a tree structure to organize the set of concept nodes, and decrease the time needed to build concept lattice.
本文的渐进式算法利用一种树状结构来对概念格节点进行索引，从而有效地提高了概念格的构造速度。
The conception and algorithm simulation of lattice digital filter in electronics are transplanted into optical filter, with a novice algorithm to resolve optical lattice array concrete parameter.
将成熟的电子学里的格型数字滤波器的概念和设计算法移植到光学滤波器，给出了根据目标滤波传递函数求解光格型阵列具体参数的算法。
The method includes a process of fuzzy attribute computation and a construction algorithm for fuzzy concept lattice, which can ensure a complete and non-redundant lattice.
该方法包括模糊属性的采集过程以及相应的模糊概念格的构造算法。
Through some theoretical analysis, it is shown that the proposed algorithm can reduce the storage and time complexity of concept lattice construction process.
理论分析表明，该算法能有效地减少概念格的存储空间和建格时间。
This paper proposed functions, algorithm, flows, processes, interface design and result of the query expansion system based concept lattice.
本文给出了概念格查询扩展的功能、算法、流程、步骤、界面设计及数据分析等。
The reduction algorithm of formal context that corresponding to concept lattice is extended.
对概念格对应的形式背景约简的算法加以扩展。
At present, the incremental formation algorithm of concept lattice has behaved strong vitality and flexibility.
现在概念格的渐进式构造算法表现出了更强的生命力和适应性。
This paper bases on lattice iterate identification method for ARMA model, pushes out its recursive algorithm, puts forward a determination order method for this algorithm.
本文针对ARMA模型的格型迭代法，推出了它的递推算法，并针对本算法提出了相应的判价方法。
Next, a fast fuzzy conceptual clustering algorithm is proposed to cluster the fuzzy concept lattice into conceptual clusters.
提出了一种在格的拓扑序列上进行概念聚类的快速算法，并且定义了概念聚类间基于偏序的层次关系。
The test results show that this algorithm makes better improvement in time complexity than the horizontal union algorithms of common universe concept lattice found in related literature.
提出了同类概念的观点，在格的合并算法中通过利用同域概念格之间的同类概念和概念的父—子关系实现对其所有子节点的快速更新，以提高概念格横向合并算法的时间效率。
We discuss some developments in this area, including off-lattice structure prediction using the great deluge algorithm.
我们讨论了这个领域的一些进展，包括使用大洪水算法进行的非晶格结构预测。
By means of analyse to the cantilever lattice structure such as crane body, a simple algorithm is introduced.
通过对类似塔式起重机塔身的悬臂格构式结构的受力分析，引入了这类悬臂结构端部水平位移的便捷算式。
Next, a fast fuzzy conceptual clustering algorithm is proposed to cluster the fuzzy concept lattice into conceptual clusters.
接下来，快速模糊概念聚类算法，提出集群的模糊概念格为概念集群。
Next, a fast fuzzy conceptual clustering algorithm is proposed to cluster the fuzzy concept lattice into conceptual clusters.
接下来，快速模糊概念聚类算法，提出集群的模糊概念格为概念集群。
应用推荐