使用lm算法对二维圆数据进行拟和，其中test_circle用于生成测试数据 fit2dcircle用于拟和 document.doc对算法原理进行详细说明 程

实际的单片机应用系统开发过程中，由于程序功能的需要，经常编写各种延时程序。延时时间从数微秒到数秒不等。对于许多C51开发者，特别是初学者，编制非常精确的延时程序有一定难度。本文从实际应用出发，讨论几种实用的编制精确延时程序和计算程序执行时间的方法，并给出各种方法使用的详细步骤，以便读者能够很好地掌握理解。

本程序用来实现具体的fft运算，程序参考数字信号处理c语言描述这本书 这个程序利用旋转因子可以先算下来的特征，可以在大量数据处理时节省时间 -This procedure used to realize specific fft computing, digital signal processing procedures reference c language to describe this book, this process can make use of rotating factor算下来features, can handle large amounts of data to save time when

LRU最近最少使用算法-LRU algorithm used recently, at least

程序动画Delphi

一维时间序列分行维数，利用计盒法计算得到的分形维数，希望对大家有所帮助！-Branch of one-dimensional time series dimension, using box method calculated the fractal dimension, and they hope to be helpful to everyone!

工程常用数值算法＿C语言-works numerical algorithm commonly used language _C

CPU是计算机系统中一个十分重要的资源，本章主要介绍处理机的调度目标、策略以及评价方法等。因为处理机调度程序不可能选择全部驻留在外存的进程，因此，在调度一个进程占有处理机之前，系统必须按某种策略把外存中处于后备状态的作业选择出来，并创建进程和分配内存，为进程执行准备必需的资源。这一步称为作业调度或高级调度。作业调度的目标是尽量做到公平合理，能执行尽可能多的作业、尽快地响应时间以及高的设备利用率等。任一调度算法要同时满足这些调度目标是不可能的。大多数操作系统都是根据用户需要而采用兼顾某些目标的方法。比较常用的作业调度算法有：FCFS（先来先服务）、方法、SJP(最短作业优先)法、HRN(最高响应比)法等。这-CPU computer systems is a very important resource, this chapter introduces processor scheduling objectives, strategies and evaluation methods. Because the processor scheduling procedures could not choose Disk presence in all the process, and therefore, in the process of scheduling a possession before the processor, the system must be some kind of strategy to Disk backup were at the operational state of choice out and the process of creation and distribution of memory, the process of preparing the implementation of the necessary resources. This step as job scheduling or senior scheduling. Job Scheduling goal is to try to make it fair and reasonable to carry out the operation as much as

基本算法为：先将1填入第一行中间位置；再依次将2-n方按如下规律填写：//1，填入上个数上一行的右边位置，如果没有上一行则转到最后一行，如果右边没有方格//则转到最左边的方格。2，如果要填的位置上已经有数，则转填到它上一个数的下边方格//3，对于第一行的最后一个数的下一个数应填在该数下边的空格处-basic algorithm : a first Enter the middle of the first line; Another will be followed by 2-n-law filled out as follows :// 1, the number entered on the right side on his position, if not in his will to the last line, if not right box// then transferred to the most left while the box. 2, to fill the position of several, in turn, to fill it on a number of subordinate box// 3, the first trip to the final a few under a few should fill in the blank space of a few top candidate Department

#include                                     //头文件  

一般问题的线性插值和JACOBI算法-general linear interpolation algorithm and JACOBI