Firstly the key technologies about initial alignment and attitude matrix algorithms are systematically discussed 首先對(duì)實(shí)現(xiàn)sins的初始對(duì)準(zhǔn)及姿態(tài)矩陣計(jì)算等關(guān)鍵技術(shù)進(jìn)行了系統(tǒng)研究。
For more on improving sparse matrix algorithms , read fast and effective algorithms for graph partitioning and sparse - matrix ordering 如果您想了解更多關(guān)于提高稀疏矩陣算法的信息,請(qǐng)閱讀
After this , two kinds of algorithms are proposed in this thesis . both of them are based on a decomposing jacobian matrix algorithm 在此基礎(chǔ)上,文章先對(duì)不良數(shù)據(jù)的檢測(cè)與辨識(shí)問(wèn)題進(jìn)行了闡述,介紹了常用的一些算法。
Secondly , the discernibility matrix algorithm is improved by proposing a more objective approach to evaluate the significance of attributes 其次,對(duì)差別矩陣算法進(jìn)行了改進(jìn),更加客觀地評(píng)價(jià)屬性重要性,不再是只看數(shù)量,而是更注意質(zhì)量。
Secondly , measuring arrangement in three - phase distribution systems , decomposing jacobian matrix algorithms and how to choose pseudo - measurement weight are discussed 其次,對(duì)三相系統(tǒng)的量測(cè)設(shè)置,分解雅可比三相狀態(tài)估計(jì)算法和偽量測(cè)權(quán)值的選取進(jìn)行了闡述。
Compared with the traditional d - h transformation matrix algorithm , this method reduces the complex computation of inverse kinematic equations , which is very useful to improve the control speed of multi - joint robot 該方法與矩陣變換法相比能很大程度上減少運(yùn)動(dòng)方程逆解的計(jì)算量,對(duì)于提高關(guān)節(jié)的控制速度極為有利。
It not only could solve the problem of learning on the incremental data sets , but also could considerably reduce the size of traditional decision matrix and avoid the repeated computation in traditional decision matrix algorithm 這不僅解決了動(dòng)態(tài)數(shù)據(jù)環(huán)境下歸納學(xué)習(xí)問(wèn)題,而且能降低矩陣空間規(guī)模,避免了傳統(tǒng)決策矩陣算法中的重復(fù)計(jì)算。
Then two attribute - reducing algorithms : discernibility matrix algorithm and greedy rough set reducing algorithm are put forward . meanwhile the rule extractioon algorithm and a discretization method for continuous attributes are put forth too 本文提出了基于粗糙集的數(shù)據(jù)挖掘模型,并提出了其中的數(shù)據(jù)約簡(jiǎn)算法、規(guī)則提取算法及連續(xù)屬性值的離散化方法。
In the paper , the new electromagnetic scattering algorithms have been introduced - recursive aggregate t - matrix algorithm ( ratma ) and fast multipole algorithm ( fma ) . two kinds of methods are precise and efficient and have advantages over conventional method of moment in computational speed and requirement for storage space 本文研究了基于積分方程的電磁散射計(jì)算方法,主要研究了兩種算法:遞推t矩陣法和快速多極子法,這兩種算法都有計(jì)算量小、所需內(nèi)存少和精度高的優(yōu)點(diǎn)。
Applying model checking in software design and verification has been proved very difficult . software architectures are engineering artifacts that provide high - level and abstract descriptions of complex software systems . in this paper a direct model checking method based on kripke structure and matrix algorithm is provided 將model checking應(yīng)用到軟件正確性驗(yàn)證方面被證明是很困難的事情,軟件體系結(jié)構(gòu)sa software architecture通過(guò)對(duì)復(fù)雜軟件系統(tǒng)提供高層與抽象描述,為基于構(gòu)件化技術(shù)的大型軟件系統(tǒng)關(guān)鍵性質(zhì)的驗(yàn)證提供了有效的途徑。