百川汇海

矩阵的基本运算§3.1加和减如矩阵A和B的维数相同，则A+B与A-B表示矩阵A与B的和与差．如果矩阵A和B的维数不匹配，Matlab会给出相应的错误提示信息．如：A=                               B=1     2    3                  1     4     74     5    6

概率论只不过是把常识用数学公式表达了出来。——拉普拉斯记得读本科的时候，最喜欢到城里的计算机书店里面去闲逛，一逛就是好几个小时；有一次，在书店看到一本书，名叫贝叶斯方法。当时数学系的课程还没有学到概率统计。我心想，一个方法能够专门写出一本书来，肯定很牛逼。后来，我发现当初的那个朴素归纳推理成立了——这果然是个牛逼的方法。——题记目录0. 前言 1. 历史     1.1

A line dividesthe plane into two pieces (regions). Draw another line. The plane is nowdivided into three or four regions. It is three regions if the lines areparallel, four if they intersect. For th

求点集中的最近点对有以下两种方法:设p1=(x1, y1), p2=(x2, y2), …, pn=(xn, yn)是平面上n个点构成的集合S，设计算法找出集合S中距离最近的点对。 1、蛮力法（适用于点的数目比较小的情况下）     1）算法描述：已知集合S中有n个点，一共可以组成n(n-1)/2对点对，蛮力法就是对这n(n-1)/2对点对逐对进行距离计算，通过循环求得点集中的最近

matlab中画直线的最简单方法plot([x1 x2],[y1 y2])一线段两点 （0 0）（3 4）plot([0 3],[0 4])matlab中设置坐标范围plot(w1,w2);axis([0.0 1.0 0.0 1.0])注意放在plot的下面Mathematica函数及使用方法(来源：  北峰数模)-----

From Wikipedia, the free encyclopediaThe shoelace formula, or shoelace algorithm, is a mathematicalalgorithm to determine thearea of a simple polygon whose vertices are described by ordered

IntroductionEntropy is ameasureof disorder, or more precisely unpredictability. For example, a series of coin tosses with a fair coin has maximum entropy, since there is no way to predict what w

Linear programming.Linear programming solvers.Simplex.java is a bare-bones versionof the simplex algorithm.QSoptis a Java linear program solver created by David Applegate, William Cook,Sanjeeb Dash, a