MATLAB-classical-code

该书详细介绍了Boost库的数十种子库，是目前为止我找到的最详细的Boost库中文书籍(The book details the Boost libraries dozens seed bank, is by far the most detailed I ve found Boost library books Chinese)

遗传算法解决作业车间调度问题，,这一M文件计算工序的加工顺序与加工时间(Genetic algorithms to solve the job shop scheduling problem,, the M-file to calculate the value of the objective function.)

使用自适应逼近的短期负荷预测，，为matlab代码，程序较为简单 (Short-term load forecasting using adaptive approximation for the matlab code, the procedure is relatively simple)

说明：  自己写的求解数度代码，喜欢的可以下来看看(Written several times to solve their own code, like you can look down)

光伏电站中太阳光de 辐照度与光伏输出功率的关系(Relations photovoltaic solar power plant with an output power of irradiance)

说明：  介绍了一种单级功率因数校正（PFC）变换器，重点讨论了变换器的主要设计。 关键词：变换器；单级功率因数校正；设计 (Introduced a single-stage power factor correction (PFC) converter, the main focus on the converter design. Key words: converter single-stage power factor correction Design)

用Simulink方式设计一个单边带传输系统并通过声卡输出接收机解调的结果声音(To design a single-sideband transmission systems using Simulink and through the sound card output receiver demodulation results of sound)

进程操作的类,可以从进程名枚举进程PID,也可以从窗口标题查找,打开进程,读取长整型,写入长整型,读取字节数组,写入字节数组.压缩包内包含有一个破解示例,破解掉一个判断密码是否正确的程序(仅在内存中进行,不破坏原文件)(Process operations class, you can enumerate the process name from the process PID, you can search for the title from the window, open the process, read a long integer, write long integer, byte array to read, write byte array. Tarball sample contains a crack, break out a password to determine whether the correct procedure (only in memory, not a destruction of the original document))

本源代码是MATLAB语言下的粒子群算法的实例，有需要的朋友可以参考(pso source code )

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)