CCS 2009手动PIC comfile

MALLOC调试工具(附源码-Malloc debugging tools (with source code

T6963C 液晶显示控制器多用于中小规模的液晶显示器件 常被装配在图形液晶显示模块上 -T6963C LCD controller for many small and medium-sized liquid crystal display devices are often equipped with liquid crystal display modules on graphics

这个论坛也不错．适合做毕业设计的，包含大多数基本功能-this forum is a good one. Suitable for graduation design, including most of the basic functions

我自己编写的分层聚类算法，类内采用最大距离，类间采用最小距离实现-myself prepared by the Hierarchical clustering algorithm, the largest category within distance between categories of use to achieve minimum distance

涉及平面拟合方法，利用最小二乘算法实现对三维平面的拟合，同时计算平面度和不确定度-Plane fitting method involves using the least-squares algorithm for fitting three-dimensional plane, while the calculation flatness and uncertainty

transport stream mapping

应用背景ATmega8单片机连接到dm2722的步进电机驱动器。电机nema42可以从零开始到24 kHz的频率和回。这些部分的窦性数据是非常重要的另一个步进电机的例程，因为步进电机必须斜坡缓慢和精确。关键技术文件中包括停止，套路几加速增加，电机和谁定义了输出频率的PWM定时器中断设置。这几天工作直到电动机工作可靠无滴。任何一滴或几滴失败都会给步进电机停止或故障。窦是最好的和最快的方式，以达到所需的速度。对于数据的生成有优于文件，但这并不包括英文说明。如果有人需要的话，我可以坐下来做描述，然后上传到这里。这与你创造理想的斜坡从任何速度，任何速度的电机数据表的帮助。

我自己用j2me编写的一款显示花的软件，刚学j2me还是挺好玩的-I have written a show with the j2me flower software, j2me is still quite good just learning to play

Handles Hexahedral, Tetrahedral, Quadrilateral, and Triangle meshes. Lagrangian, Hierarchic, and Monomial finite elements. Interface to PETSc solvers, adaptive mesh refinement, and extreme portablility.

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.