Apriori

MT9075为E1接口芯片MT9075为E1接口芯片MT9075为E1接口芯片(Combined pcm30 framer,line interface unit and link controllers in a 68pin PLCCor 100 pin MQFPpackage)

In the rectangle packing problem, encoding schemes to represent the placements of rectangles are the key factors determining the efficiency of algorithms. SEQP AIR is one of the most sophisticated encoding sheme, which has been considered to have a small solution space

图象处理基础算法原代码MATLAB 集合。(image processing algorithms based on the original MATLAB code set.)

project on electric bill details that store all the detail of bill.

学习使用matlab软件，并使用matlab软件编写相应的程序完成对图像的增强处理掌握matlab软件在图像增强技术的处理方法(Learning to use matlab software matlab software to write the program completed master matlab software for image enhancement in image enhancement technology approach)

用matlab实现信号的基本处理，还要学会用matlab进行分析(Using matlab to achieve the basic signal processing, but also learn how to use matlab for analysis)

说明：  队列的新的操作，用个数number和队尾指针rear来判队空队满(Queue new operation, number and team with the number of rear end of pointers to sub-team full of air force)

HOMER(Hybrid Optimization Model for Electric Renewable，可再生能源互补发电优化建模)。HOMER是一个计算机模型，它简化了离网和并网对于远程的、独立的和分布式发电系统的评估选择的任务。HOMER优化和灵敏度分析算法，可以用来评估系统的经济性和技术选择的可行性，以及考虑技术成本的变化和能源资源的可用性。(HOMER (Hybrid Optimization Model for Electric Renewable, renewable energy and solar power generation optimization modeling). HOMER is a computer model that simplifies the task of off-grid and grid for remote, stand-alone and distributed generation systems to assess choice. HOMER optimization and sensitivity analysis algorithms can be used to select the feasibility of economic and technical assessment of the system, and to consider changes in the availability of technology costs and energy resources.)

说明：  SVM进行两分类算法的MATlab实现代码SVM进行两分类算法的MATlab实现代码(A two-SVM classification algorithm MATlab implementation code for the two classification algorithm SVM implementation code MATlab)

说明：   有一个长度为整数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.)