BDFA-RK-gui

power flow algorithm for Transmission Systems

Fast Earth Mover s Distance similarity matrix calcutation

kriging interpolation code

文件中包含将车轮和cameraman图像进行动画演示，两者交替出现，可将颜色和交替时间等参数进行改动以达到个人的需求。(File contains the wheel and the cameraman images animated demo, alternating between the two may be the turn of time, such as color and changes the parameters in order to achieve the needs of individuals.)

计算星载AIS系统包含2~3个冲突信号的检测概率。(Computing detection probability of two to three conflict signal for space-based AIS.)

97年中国大学生数学建模竞赛B题（枚举法） (1997 China Undergraduate Mathematical Contest in Modeling B (enumeration))

改进型的蚁群算法，能够快速求解多目标规划(Improved ant colony algorithm, fast multi-objective planning)

最小均方濾波器是一類可通過最小化誤差訊號之均方值而修正濾波器係數，以類比所需理想濾波器的自適應濾波器，其中作為修正依據的誤差訊號為理想參考訊號與實際輸出訊號之差。該種濾波器所用之最小均方法只以當前之訊號誤差值為準進行修正，是一種隨機梯度下降法。最小均方法係由斯坦福大學的Bernard Widrow教授及他的首位博士班學生Marcian Hoff於1960年提出。最小均方濾波器屬於常見的自適應濾波器種類之一。(The minimum mean square filter is an adaptive filter that can correct the filter coefficients by minimizing the mean square value of the error signal to analogize the desired ideal filter. The error signal used as the correction reference is the ideal reference signal and the actual output. The difference between the signals. The minimum averaging method used in this kind of filter is only corrected based on the current signal error value, which is a stochastic gradient descent method. The minimum mean method was proposed in 1960 by Professor Bernard Widrow of Stanford University and his first PhD student, Marcian Hoff. The least mean square filter is one of the common types of adaptive filters.)

只是一个简单的计算器，做了话哦几天，拿来分享一下。(Just a simple calculator, to do something and oh a few days, brought to share.)

WSN 质心定位算法 Centorid Algorithm 加经典参考文献 A: 如果接受节点接收到的包数目与发送节点发送的包数目的比值大于CM_threshold,则这两个节点视为邻居节点 未知节点利用邻居锚节点进行定位，没有邻居锚节点的未知节点无法定位。 B: 如果接受节点接收到的包数目与发送节点发送的包数目的比值大于CM_threshold,则这两个节点视为邻居节点 未知节点一旦被定位就充当起锚节点的功能，向周围邻居发送自己的估计坐标信息 未知节点把已经定位的未知节点与锚节点同等对待 C: 如果接受节点接收到的包数目与发送节点发送的包数目的比值大于CM_threshold,则这两个节点视为邻居节点 有邻居锚节点的未知节点只利用邻居锚节点进行定位，没有邻居锚节点的未知节点才利用已经定位了的邻居未知节点进行定位。(WSN centroid localization algorithm Centorid Algorithm A: If you accept the received packet node number and the number of packets sent by the sending node ratio greater than CM_threshold, then these two nodes as neighbors Unknown node using the neighbor anchor nodes to locate, no neighbors anchor nodes and unknown nodes can not be located. B:   If you accept the received packet node number and the number of packets sent by the sending node ratio greater than CM_threshold, then these two nodes as neighbors Unknown nodes are positioned on as soon as the function of anchor nodes to send their neighbors estimated coordinate information Unknown unknown node to node already positioned anchor nodes treated equally C: If you accept the received packet node number and the number of packets sent by the sending node ratio greater than CM_threshold, then these two nodes as neighbors Of the unknown neighbor anchor node the neighbor nodes are only positioned anchor nodes, )