ads1292r 驱动代码

说明：  一个opengl实例---台球 开发环境visual c(Opengl examples--- a development environment for visual c billiards)

spi读取AT25128例程，全面解析底层，与I2C兼容。(The SPI reads AT25128 routines, comprehensively parses the underlying, and is compatible with I2C.)

在一个8×8国际象棋盘上，有8个皇后，每个皇后占一格；要求皇后间不会出现相互"攻击"的现象,即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法。 本算法采用一维数组来进行处理。数组的下标i表示棋盘上的第i列，a[i]的值表示皇后在第i列所放的位置。如：a[1]=5，表示在棋盘的第一例的第五行放一个皇后。(8 × 8 in a chess set, there s eight, each accounting for a Queen s grid request will not be any mutual between Queen s attack phenomenon, that can not have two Queen s in the same line, the same row or the same diagonal. Asked the total number of different ways. This algorithm uses one-dimensional array to be processed. Array subscript i said i chessboard first out, a [i] value that s in the first place i listed by location. Such as: a [1] = 5, said the first cases in the chessboard of the fifth line of a Queen s release.)

我的银行家算法，大家来看看。 若要密码 265913(I bankers algorithm, we take a look at. To password 265913)

液晶兼容0701(compatible LCD 0701)

数据库编程，生日管理系统，有增加、删除、修改、更新的功能，在VC6.0上可以运行，使用MFC编程！(Database programming, birthdays management system)

我自己的一个小小的练习罢了! 大家还可以再此的基础上自己开发! 呵呵!solitude献上!(my own practice a little too! You can also here on the basis of its own! Oh! Solitude presented!)

tf–idf, short for term frequency–inverse document frequency, is a numerical statistic that is intended to reflect how important a word is to a document in a collection or corpus.[1]:8 It is often used as a weighting factor in information retrieval and text mining. The tf-idf value increases proportionally to the number of times a word appears in the document, but is offset by the frequency of the word in the corpus, which helps to control for the fact that some words are generally more common than others. Variations of the tf–idf weighting scheme are often used by search engines as a central tool in scoring and ranking a document s relevance given a user query. tf–idf can be successfully used for stop-words filtering in various subject fields including text summarization and classification. One of the simplest ranking functions is computed by summing the tf–idf for each query term many more sophisticated ranking functions are variants of this simple model.

说明：  Matlab方程求根法汇总：BenvliMAX 贝努利法求按模最大实根 BenvliMIN 贝努利法求按模最小实根 HalfInterval 用二分法求方程的一个根 hj 用黄金分割法求方程的一个根 StablePoint 用不动点迭代法求方程的一个根 AtkenStablePoint 用艾肯特加速的不动点迭代法求方程的一个根 StevenStablePoint 用史蒂芬森加速的不动点迭代法求方程的一个根 Secant 用一般弦截法求方程的一个根 SinleSecant 用单点弦截法求方程的一个根 DblSecant 用双点弦截法求方程的一个根 PallSecant 用平行弦截法求方程的一个根 ModifSecant 用改进弦截法求方程的一个根 StevenSecant 用史蒂芬森法求方程的一个根 PYZ 用劈因子法求方程的一个二次因子 Parabola 用抛物线法求方程的一个根 QBS 用钱伯斯法求方程的一个根 NewtonRoot 用牛顿法求方程的一个根 SimpleNewton 用简化牛顿法求方程的一个根 NewtonDown 用牛顿下山法求方程的一个根 YSNewton 逐次压缩牛顿法求多项式的全部实根 Union1 用联合法1求方程的一个根 TwoStep 用两步迭代法求方程的一个根 Montecarlo 用蒙特卡洛法求方程的一个根 MultiRoot 求存在重根的方程的一个重根(Summary of Matlab equation root finding method)

C-51单片机实验，蜂鸣器的源代码，希望对大家有帮助，(*^__^*) 嘻嘻……(C-51)