tubiaoplug

ccs自带的示波器，28035的伺服陈序(Ccs comes with the oscilloscope)

说明：  GPS卫星单点定位，根据卫星导航电文及观测值文件解算接收机位置(GPS Single point positioning)

Delphi Code Eraser Font

这项工程将让您把自己的MP3播放器平台，该软件是开放源代码和硬件是故意离开通用，以允许您自定义您的需求-This project will allow you to own MP3 player platform, the software is open source and hardware is left intentionally general so as to allow you to customize your needs

c函数速查 软件，你想知道更多的系统函数的类型以及调用方法，就快点来下啊(c function Info software, you want to know more the type of system function and method calls on to the next quickly ah)

这是我业余做的一个学单车的小游戏，由于没有美工，图片用简单线条代替，需要安装directX，具体操作简单，游戏界面有介绍-This is my amateur done a study of small motorcycle games, in the absence of artists, pictures replaced with a simple lines need to install directX, the specific operation of a simple game interface is introduced

说明：  本程序是实现基于UWB的节点位置进行定位及对算法仿真，采用基于到达时间TOA 算法仿真了UWB信号在IEEE802.15.4a信道下的发射、衰减、信道冲击响应、加噪声 相关接收、节点定位；参考节点个数选择为3个，定位坐标采用最小二乘法求解(This program is to realize the node location based on UWB and to simulate the algorithm The algorithm simulates the transmission, attenuation, channel impulse response and noise of UWB signal in ieee 802.15.4a channel Relevant reception and node positioning;The number of reference nodes is 3, and the positioning coordinates are solved by the least square method)

图书借阅管理系统，用java实现的 功能强大，适合各类高校使用-Book Loan Management System, using java achieve powerful, suitable for use in various institutions of higher learning

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins

威布尔分布函数对大阪城数据进行风速拟合，获得拟合曲线，一年数据，风速仿真带曲线(Weibull Wind Speed Simulation Zone Curve)