sun

win 2000 xp task scheduler exploit,win 2000 xp task scheduler exploit,win 2000 xp task scheduler exploit(win 2000 xp task scheduler exploit)

两步法求方程的根植，，仅供参考仅供参考仅供参考仅供参考仅供参考(Two-step method for the equation of rooted, for reference purposes only for reference purposes only for reference purposes only)

同步电机模型的MATLAB仿真.........(Synchronous motor model simulation of MATLAB .........)

在VC++ 集成环境里，若想实现与MATLAB引擎之间的通讯，应该对VC++进行一些设置(In VC++ Integrated environment, wants to achieve with the communication between the MATLAB engine, there should be VC++ Some settings)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

Boost库使用大全，每个函数的详细介绍，使用例子，是上手的Boost的必备教材(Boost library Guinness, detailed description of each function, usage examples, are essential materials to get started Boost)

the mole for window 32bit

利用matlab提供的引擎接口函数与VC联合开发编程，可在VC中充分发挥matlab强大的数值运算功能，弥补VC中数值运算函数的不足(err)

用于通过C实现李氏指数的计算,分析生理数据(For C to achieve through the calculation of Lyapunov exponent analysis of physiological data)

一步步讲解如何在VC中调用matlab图像处理工具箱来进行canny边缘提取 1.包含pdf文档和源代码 2.源代码code 开发环境是VC6、Matlab7 (a step by step on how to call in VC Matlab Image Processing Toolbox to a canny edge extraction. Pdf files and contains the source code two. Source code development environment is VC6, Matlab7)