INS_EKF-master

LanMsg已更名为ourmsg，当前版本为1.1,修正了1.0版本中UDP组件的BUG，调试通过视频编解码，音视频即时消息软件源码。当前版本音频采用G729A算法编解码，视频采用微软MPEG4编解码。视频编解码器在Updatempg4vki文件夹中，发布客户端打包时需要将mpg4vki一同发布，否则客户端视频将不能正常使用。-LanMsg has been renamed ourmsg, the current version 1.1, revised 1.0 version of UDP component BUG, debugging through the video codec, audio and video instant messaging software source code. The current version of the audio algorithms using G729A codec, video powered by Microsoft MPEG4 codec. Video codec in the Update mpg4vki folder, released when the client needs to be packaged together mpg4vki release, otherwise the client-side video will not work properly.

迭代ACCF相参积累与参数估计,SAR回波，只加了噪声(Iterative ACCF coherent accumulation and parameter estimation)

SMTP邮件发送。。。。。可以用自己的SMTP服务器发送邮件-SMTP mail. . . . .

说明：  岭回归代码，有源代码和实例文件，钻石数据库(Ridge regression code, has source code and instance files, diamond database)

物流选址程序，在31个已知坐标的城市中选出路径最短、成本最低的配送中心(A logistics location program that selects the shortest and lowest cost distribution center in 31 cities with known coordinates)

说明：  Pokeface 题目描述 魔术师将一叠扑克顺次在桌上排成一行，初始全部正面朝上。随后，他每次挥一挥衣袖，都会翻转一连串的扑克，改变它们的正反朝向。从古代传下来的规矩，魔术师皆有师傅，他们要随时准备回答师傅的问题。问题形如：目前从第i张扑克牌到第j张扑克牌中，有几张正面朝上？ 作为魔术师的助手，你被要求学习程序设计、算法与数据结构。现在，魔术师把这个问题交给了你，你需要编写一个程序，维护相应的数据结构来保存桌子上牌面的情况，同时对于师傅的每一个问题，你要用尽量快的速度计算出答案。 输入 第一行包含三个正整数n、p和q。n表示扑克牌的数量，p表示魔术师的挥一挥次数，q表示师傅的问话次数。 接下来共p+q行，每行包含一个操作，操作分为2种： H i j 魔术师挥一挥，改变了第i张牌到第j张牌的正反 Q i j 师傅问话：截至目前，第i张到第j张牌中有多少张正面朝上 操作中恰好包含p次H操作，q次Q操作，与第一行的p和q吻合。H操作和Q操作的范围均包含边界（即第i张和第j张牌）。 对于每个操作，输入保证1 ≤ i ≤ j ≤ n。 输出 对于每次Q操作，输出一行，包含一个整数，表示问题的答案。 提示：线段树(Pokeface Title Description The magician will stack poker table sequentially in a row, all the initial face-up. He then every wisp will flip a series of poker pros and cons of changing their orientation. The rules handed down ancient times, the master magician Jie, they be ready to answer the teacher s questions. Question of the form: Currently playing cards i to j-card poker, there are a few face-up? As a magician s assistant, you are required to learn programming, algorithms and data structures. Now, the magician put this question to you, you need to write a program to maintain appropriate data structure to hold the cards on the table face the situation, while the master for each question, and you want to use as quickly calculate the answer. Enter The first line contains three positive integers n, p and q. n represents the number of poker, p represents the wave of the magic number, q represents the number of master s questioning. Next, a total of p+ q rows, each containi)

源码Aviation_0123Tointercept0123456是一个不错的源码，用来学习参考会是一个不错的选择(Source Aviation_0123Tointercept0123456 is a good source for learning reference would be a good choice)

服务器winsock连接源码-server connectivity source

注册用户会员管理主页面，主体框架，靠自己添砖加瓦了-Member Registration User Management page, the main framework for the building blocks on their own

这是看完一本通信仿真手册后我自己写的一点程序，包括ASK FSK PSK的调制和解调程序，不过是比较简单的 ，因为用了公式的()