多元线性回归分析算法

求解大型疏松方程组，ap方程组的系数矩阵，b[放回解向量-For solving large loose equations, ap equations coefficient matrix, b [back into the solution vectors

逆波兰式的转换- Goes against the Poland-like transformation

Exceptional C++ shows by example how to go about solid software engineering. Along with a lot of other material, this book includes expanded versions of the first 30 issues of the popular Internet C++ feature Guru of the Week (or, in its short form, GotW), a series of self-contained C++ engineering problems and solutions that illustrate specific design and coding techniques.

初等变换法,矩阵求逆用的是笔算时惯用的方法，需要高斯消去法的朋友请参看有关资料。特别提醒：本程序不能用tc2.0编译！详情请参看文件中的说明。 -elementary transformation, matrix inversion using a written calculation method used when the need Gaussian Elimination friends see the information. Reminded : This procedure can not be used tc2.0 compiler! For details, please refer to the documents note.

快速幂级算法 求RSA基础-rapid power-based RSA algorithm for

椭圆拟合的算法，简单实用，不用复杂的迭代，很容易看懂！-Ellipse fitting algorithm, is simple and practical and not complicated iteration, it is easy to understand!

算两个整数相除,可以算到小数点后无穷位.用的是数组.可以看一下-count two integer eliminate, to be counted after the decimal point infinite spaces. Use the array. Can look at the

java程序实现的通俗易懂的二分查找的算法源代码-java program to achieve the user-friendly dichotomous search algorithm source code

算法过程：1).读入数据，将数据用user_brands存起来，同时建立userid_id，再建立id_brands  2).遍历id_brands得到物品-用户倒排表brand_ids，根据倒排表得到用户的相似矩阵sim_mat  3).为每个用户推荐产品：      3.1).求用户u买过的brand和所有brand的差集得到用户u没有买过的物品集合brand_unused；      3.2).用户u对每一个没用过的物品i的兴趣p(u,i)：          3.2.1).找到与用户u最近的k个用户          对于每一个没用过的物品i：          3.2.2).找出这k个用户中对物品i有过行为的用户v[]√          3.2.3).将用户u和v[j]的兴趣相似度累加      3.3).取前m个最感兴趣的brand推荐给用户；  代码：UCF.cc（用户协同过滤核心代码）：#include  #include  #include  #include  #include  #include  #include  #include  #include  #include  

求解有向图的路径-Solving the path digraph