查询词典 fundamental algorithm

Supposing processing information as a task of node,power constraints of node is considered,and node uses way of awaking/sleeping,during awaking assureed that sensor node accomplishes task and cluster head node can schedule multi-task of sensor node.will resolve such problem:before satisfying multi-tasks deadline invaliding of sensor node,how to feasibly schedule schedule algorithm of improving Rate-Monotonicand dynamic Preemptive Earliest Deadline First Algorithm,via concrete example are presented,The process of algorithm achieving is explained.

假定每个节点对信息的处理看作是一个任务，考虑节点能量限制，节点采用唤醒/休眠机制，在唤醒期间确保节点任务完成，簇头节点能够调度处理多个传感器节点的任务。文中解决的问题：在满足多个传感器节点任务处理的截止期失效前，簇头节点如何合理的调度任务，提出了改进的 RM(rate-monotonic)调度算法和动态的抢占式最早截止期优先任务调度算法(Preemptive Earliest Deadline First Algorithm，PEDFA)。

On the foundation of standard UKF algorithm, the ratio of the theoretical value to the practical ones of the innovation's covariance was taken as the input of the FLAC to reduce the dependency of FLAC on the filter model, the generality of the fussy adaptive UKF algorithm was intensified; In the procedure of adjusting the measurement noise's covariance dynamically, the adjusted range could be amplified or minified to different extent by setting the exponential adjusting parameter, so the adjusting velocity and precision of the algorithm was controlled.

在标准的非线性UKF算法基础上，以残差的实际方差与理论方差的比值作为FLAC的输入，使FLAC对滤波模型的依赖性减弱，强化了模糊自适应UKF方法的通用性；在对量测噪声方差阵进行动态调节的过程中，通过设置指数调节参数可不同程度地放大或缩小调节的幅度，使算法的调节速度和精度得到控制。

We discuss in this paper several kinds of decentralized algorithm: ALOHA, Slotted-ALOHA, CSMA, Tree Algorithm, and Pretested Random Tree Algorithm. We put emphasis on the method of ...

本文阐述随机多址技术用来解决冲突的几种算法：ALOHA，分隙ALOHA，载波监听多址，树形算法，以及预测随机树形算法，着重讨论如何提高信道利用率和获得系统稳定。

We discuss in this paper several kinds of decentralized algorithm: ALOHA, Slotted-ALOHA, CSMA, Tree Algorithm, and Pretested Random Tree Algorithm. We put emphasis on the method of increasing channel...

本文阐述随机多址技术用来解决冲突的几种算法：ALOHA，分隙ALOHA，载波监听多址，树形算法，以及预测随机树形算法，着重讨论如何提高信道利用率和获得系统稳定。

Experiments showed that the data points art inure separable in this algorithm. The algorithm can overcome tilt' faults of traditional Cell-Based algorithm, which need to he recomputed from the scratch for even' change of the parameters. It also tins higher detection rate at higher convergence speed.

试验结果表明，该算法能有效突出样本之间的差异，克服传统基于距离的孤立点发现算法易随参数变化而需调整单元结构的缺点，且具有更准确的检测率和较快的收敛速度。

Then a BGPEOpt(BGP Egress Optimization Algorithm) algorithm is proposed to reduce the execution time of the typical algorithm by leveraging the .characteristics of cut link in the topology graph to reduce the frequency of recomputing traffic demand. Further more, mediate results are used in the iterative process to reduce the time of computing the IGP shortest distances from a source node to other nodes. Experimental results indicate that the running time of BGPEOpt reduced 7%~30% with the similar link utilization comparing to that of typical algorithms.

在此基础上，提出了静态阶段的BGP出口选择优化算法BGPEOpt(BGP Egress Optimization Algorithm)，BGPEOpt算法利用网络拓扑结构中割边的特殊性，减少流量矩阵重新计算的频率；同时利用算法在迭代过程中的中间结果，减少重新计算从一个源节点到其它节点最短路径的时间，从而提高了算法的时间性能。

By reformulating each pass in the original algorithm into two sub-passes, we make the new algorithm suitable to be implemented on GPU. Additionally, we reduce the number of the conditional branch instructions involved in the improved algorithm, taking advantage that there are a large number of similar conditional branch instructions between two sub-passes.

我们对原算法进行细化，将每一次迭代分为两次子迭代，以满足GPU中并行处理的要求，并进一步在子迭代中减少条件判断的次数。

A model is initially developed based on the in the integer programming, whose objective function is subject to the minimization of the total re-shuffle containers. To reduce the total number of reshuffles for retrieving the containers, a hybrid algorithm, which combines heuristic rule and distributed genetic algorithm, is employed to solve the model. The heuristic rule is to reduce the range of feasible solution and distributed genetic algorithm is to solve the optimization.

该策略以压箱数最少为目标，建立基于整数规划的选位模型；根据发箱时较低翻箱率的要求，采用启发式算法和分布式遗传算法相结合的混合算法求解选位模型；其中启发式规则用于缩小可行解的范围，分布式遗传算法用于求近似最优解。

This paper at last analyses the disadvantages of the fingerprint recognition algorithm based on minutia and introduces the basic principal of the algorithm based on structure of fingerprint, and designs a systematical method of calculating fingerprint center point, normalizing, Gabor filtering, sectoring, extracting features and checking based on structure of fingerprint, and implement the algorithm using of emulator of Matlab, and sets up a fingerprint database of some fingerprints, matches the database with a number of fingerprints, and analyses the matching result.

最后分析了传统的基于细节点的指纹识别算法的不足，介绍了基于结构的指纹识别算法的基本原理，及其各个组成部分：指纹中心点的计算、扇形化、归一化、Gabor滤波、特征提取以及比对，并在Matlab6.5环境下实现了这一系统识别算法。

The chief points of this paper are summered as follows: Firstly, the dynamic rule-adjusting algorithms in Snort is analyzed. Secondly, some methods to improve the algorithms are discussed and the results of experiment are obtained. Thirdly, a kind of anomaly detection models using association rule mining algorithm is put forward, and the improvements of Apriori algorithm are pointed out. Fourthly, the advantage of the new algorithm and the feasibility of this model are testified. Lastly, a framework of distributed intrusion detection system based on data mining is designed, and distributed cooperation concepts and many detecting methods are adopted in order to guarantee the accuracy and completeness of the detecting system.

论文的主要工作如下：本文分析了Snort中的动态规则调整算法，讨论了一些改进的思路，给出了实验结果；提出了一种运用关联规则挖掘算法进行异常检测的模型，根据入侵检测的实际情况对Apriori算法进行了改进，通过实验证实了改进算法的优越性和模型的可行性；设计了一种基于数据挖掘的分布式入侵检测系统框架，采用分布式协作思想，结合多种检测方法，保证了系统检测的准确性和完备性。

I'm not an actor. I'm a professor of paleontology.

我不是演员，我是古生物学教授

Spider Network Web site that is a very image of the name.

网络蜘蛛即Web Spider，是一个非常形象的名字。