飞思卡尔实现PID算法

应用背景 三维点云网格化,应用到三维重建中，通过结构光扫描获取的三维点云数据，对点云数据进行重建生成三角面片。 关键技术用边扩展来构建三角网的算法是： 1.选取两数据点，连成初始基线 2.沿基线的固定一侧搜寻第三点，生成第一个Delauney三角形 3.以三角形的两条新边作为新的基线 4.依次重复2,3直至所有的基线处理完毕 所以在算法中分别用了几个函数分别是用来获取第三个点，根据余弦值来判断三角形的，构建三角网的。都是根据算法的思想来的

这是一个真正棘手的问题为正整数 x 让定义函数 f (x) = 1 * (1! + x) + 2 * (2! + x) +。+ x * (x! + x)."k!"意味着阶乘： k ！= 1 * 2 * ..* k 厨师想要计算 F(p1) + F(p2) +......+ F(pn)。答案可能是大的帮助他，计算模 m.InputFirst 线的值包含两个整数 n 和 m.Next 行包含 n 以空格分隔的整数 pi。

Delphi 写的常用的基本算法 源代码 -Written in Delphi source code for the basic algorithm used

资源描述Abstract Considering rapid developments in the technologies of both radio-frequency identification (RFID) systems and wireless sensor networks (WSN), an integration of the two technologies may lead to the formation of an RFID-enhanced WSN which would possess improved functions and capabilities. In the RFID-enhanced WSN, many reader-enhanced nodes have increasingly been employed. In such networks, RFID data contains a lot of duplication, because the same tag may be read multiple times, and collision may occur among readers, while energy constraints are also a serious problem. These three could in turn cause serious problems. In this paper, we have proposed our CSMA-based algorithm since it is light, efficiently minimizes all kinds of reader collision, and eliminates the duplicate data. For this purpose, we have used a separate control channel and a tag ID forwarding mechanism with a special co

Description:  This application functions as a packet error rate (PER) tester.  One node is set up as transmitter and the other as receiver. The role and  configuration parameters for the PER test of the node is chosen on initalisation  by navigating the joystick and confirm the choices with S1.  The configuration parameters are channel, burst size and tx power. Push S1 to  enter the menu. Then the configuration parameters are set by pressing  joystick to right or left (increase/decrease value) and confirm with S1.

An example of turing machine

Joseph环问题描述如下：编号是2，n个人按照顺时针方向围坐一圈，每个人只有一个密码（正整数）。一开始任选一个正整数作为报数上限值1开始顺序报数，报到m的人出列，将他的密码作为新的1报数，如此下去，直到所有人全部出列为止。设计一个程序来求出出列顺序。

一直以来对 SVPWM 原理和实现方法困惑颇多， 无奈现有资料或是模糊不清， 或是错误百 出。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

解线性方程组（多元一次） 水平有限，DOS界面。 其中，输出方程组的未知数用x1,x2,x3...表示， 可以解出多元一次方程。 -solution of linear equations (multiple times) is limited, and DOS interface. Within this total, output equations with the unknown x1, x2, x3 ... that the United States can come up with multiple linear equation.

acm亚洲区竞赛的一个题目（关于任务调度的）以及我的程序实现Asia Regional_Taipei Site Dec.10-13.1999Program EBroadcast Scheduling -acm Asia a topic of race (on the task scheduling), and I realize the procedures Asia Regional_Taipei Site GC.6/Dec.10- 13.1999Program EBroadcast Scheduling