2 . the updating algorithm of strapdown matrix is one of the crucial techniques of sins . there are several kinds of attitude updating algorithms of sins , such as direction cosine algorithm and quaternion algorithm 捷联矩阵更新算法是捷联系统的关键技术之一，捷联惯导系统姿态算法有欧拉角法、方向余弦法、四元数法和圆锥补偿算法等几种方法。
Firstly , this paper completely analyzed and discussed the technologies of data mining 、 association rule mining 、 association rule incremental updating algorithm 、 web log mining algorithm and the structure of web log mining 本文比较系统、完整的分析和论述了数据挖掘技术、关联规则挖掘技术、关联规则的增量式更新算法、 web日志挖掘的方法和web日志挖掘的体系结构。
However , reasoning on student model is a np hard question in fact , since undirected loops are embedded in the bayesian student model . to solve this problem , a revised clustering algorithm is enhanced by means of the joint tree during reasoning process 本论文在参考贝叶斯网络的更新算法的同时，改进了聚类算法，用联合树算法来实现对建好的贝叶斯学生模型的推理更新。
We can get amount of data every day from the transaction of computer . we would come across the problem to how to get rules from the new - generating data . so we propose the algorithm for increment updating weighted association rule which has higher efficiency 在对新的数据集进行关联规则提取时，就涉及到增量问题。对此，我们提出了一种改进的加权关联规则增量更新算法，提高了算法的效率。
In order to handle dynamic data set in database of industrial field , several incremental algorithms including nbia and fup are discussed . an improved fast update algorithm with level wise search structure based on fup algorithm is proposed for the incremental data 针对工业现场数据库动态更新特点，分析了nbia和fup两种增量挖掘算法，提出了一种新的在增量数据库基础上进行分层搜索的快速更新算法ifup 。
This paper used the concept of mothball frequent item sets for reference to make use of historical mine results in greater extent . in corresponding , this paper improved the tree structure with mothball frequent item sets and proposed new item updating algorithm . 为了更大程度的利用历史的挖掘结果，本文借鉴后备频繁集的概念，在序列支持度排序树中加入了后备频繁集，并给出了改进后的建树算法、挖掘算法和项目更新算法。
Through analyzing actual traffic scene , especially considering the video change between adjoining frames , this paper presents a robust and real - time method for extracting and updating background , and realizes the algorithm of vehicle detection based on background subtraction 摘要通过对交通场景实际情况的分析，特别是考虑到视频在相邻帧之间的变化，提出了一套鲁棒、实时的背景提取及更新算法，实现了基于背景差分算法的车辆检测和提取。
To study software project time related risk in software project process , the definitions of temporal bayesian network and scheduling bayesian network are given . the probability updating algorithm for acyclic temporal bayesian network based on model simplification and general probability updating algorithm for temporal bayesian network are presented 其中在时间贝叶斯网络研究中,分别提出了适用于非循环时间贝叶斯网络的基于模型化简的概率更新算法和一般概率更新算法。
The order of our discussions " about these tasks is as follows : firstly , we pay more attention to the characteristics and difficulties of its environment including the concept , typical system model , main challenges , mobile network connection and soft application . secondly , according to mobile specialties of the environment we make the sort of data into four kinds : general data , time series , spatial data and time - spatial data , and present general processing of data mining . lastly , we discuss the methods of data mining of these four kinds respectively : after the introduction of the actuality of data mining of every kind , an algorithm of rule updating based on rough set is given , then put forward the processing of data related to mobile users and flow chat according to characteristics of the other three kinds 本文对以上任务的讨论顺序安排如下：首先是对移动计算环境的技术特点和难点进行讨论，包括移动计算的概念和典型系统模型、主要挑战、移动联网以及软件应用这几个大的方面；其次根据移动环境的移动特性把移动计算环境中的数据分为普通数据，时间数据，空间数据以及时空数据，提出了在移动计算环境中数据挖掘的一般流程；接下来分别对这四类数据进行挖掘算法的讨论：每一部分都是先介绍该类数据的挖掘方法研究现状，对于普通数据，针对我们已提出的一种挖掘算法-粗糙集算法( rs ) ，提出了对应的规则更新算法，对于后三种数据，本人根据其在移动计算环境中的特点分别提出了与移动用户相关的该类数据的一种具体的处理方法和算法流程图，包括基于移位连接方法的多属性时间序列的挖掘算法，基于apriori算法的空间关联规则数据挖掘方法以及关于移动用户移动模式的时空数据挖掘方法，并用matlab对其中的规则更新算法和时间序列的挖掘算法这两方面进行了实例仿真。
An efficient algorithm qais is proposed that uses the efficient method to reduce database access activity , and present a novel algorithm aiu based on this algorithm , it is fit for mining association rules and incremental updating . it is especially effective in vldb , mining long patterns , and high support . the perfermance of qais / aiu is verified on the basis of synthetic data , experiments show that the proposed algorithm can mine association rules more efficiently by not generating candidate itemsets and reducing the redundancy of frequent itemsets while generating association rules 然而目前大多数挖掘关联规则的算法往往必需多次扫描事务数据库才能达到要求的目标，这样重复性的数据库存取动作将会导致过多的执行时问浪费在i o动作上，另外在频繁集生成规则时现有的算法没有考虑到规则的大量冗余，为了解决这个问题本文提出了一个不需要生成候选集同时有效的去除生成规则时产生大量冗余的算法qais ，来提高关联规则生成的速度，并且在此算法基础上提出了新颖的关联规则增量更新算法aiu ，通过应用合成数据验证了qais aiu算法的有效性，由试验结果来看这个方法确实能更有效且准确地获得事务数据库的关联规则，尤其适合挖掘超大数据库中高支持度下长模式的挖掘。
