-
Desktop
雅克比迭代法就是众多迭代法中比较早且较简单的一种，其命名也是为纪念普鲁士著名数学家雅可比。雅克比迭代法的计算公式简单，每迭代一次只需计算一次矩阵和向量的乘法，且计算过程中原始矩阵A始终不变，比较容易并行计算。(The jacobian iteration method is one of the earlier and simpler iteration methods, which is also named in honor of the famous Prussian mathematician jacoby. The calculation formula of jacobian iterative method is simple. Every iteration only needs to calculate the matrix and vector multiplication once, and the original matrix A is always the same in the calculation process, which is easier to calculate in parallel.)
- 2018-07-23 21:53:18下载
- 积分：1
-
kenston
将光谱差异较大的样品选入建模集，其余相近的选入预测集(The samples with large spectral differences are selected into the modeling set, and the rest of the selected entry prediction sets)
- 2018-02-26 20:58:39下载
- 积分：1
-
使用说明
说明： 介绍了大圣轮回的安装方法，西游H5安装
修改服务端的三个xml文件 里面的ip 数据库信息
root/server/sh/configure_center.xml configure.xml configure_cross.xml
修改index里的区名 ip game/index.html
上传game.zip到网站目录 给777权限
cd /www/wwwroot
unzip game.zip
chmod -R 777 /www/wwwroot/game(The installation method of the Great Sacred Return is introduced.)
- 2020-06-20 23:00:01下载
- 积分：1
-
grey_mpsk_performance4
grey mpsk performance for telecommunication students
- 2020-06-24 21:20:01下载
- 积分：1
-
layer
cad图层显示、关闭、冻结等快捷命令，非常好用(CAD layer display, close, freeze and other shortcut commands, very useful)
- 2020-06-21 17:20:01下载
- 积分：1
-
实现（7,4）循环码的编码和解码，生成多项式…
实现（7，4）CRC的编码和译码，其中生成多项式可以在程序中改成所需要的。输入4位码，可以编码生成7位循环码。译码的情况限于至多错一位的情形。-To achieve (7,4) cyclic code encoding and decoding, which generate the polynomials can be changed in the program need. Enter 4 yards, you can generate 7-bit cyclic code encoding. Limited to a maximum of decoding a wrong situation.
- 2022-11-26 10:55:03下载
- 积分：1
-
遗传算法求解多旅行商问题
说明： 旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
- 2020-06-17 11:00:02下载
- 积分：1
-
beer_game
很多人都玩过吧，一桌人轮流报数，凡遇到6（也可是其它数字）或是6的倍数，不报出，但要拍下桌子。动作失误者会被罚酒。
用的时候，只要修改gamers, first, num就可以了。参考生成的列表就不会出错啦(Many people have played it, the table turns reported number, in any case where the 6 (or other digital) or multiples of 6 are not reported, but photographed desk. Action mistakes will be Monastic. When, just modify gamers, first, num. Reference to generate the list you can not go wrong!)
- 2013-04-12 10:09:12下载
- 积分：1
-
数据库答案
说明： 数据库系统概念第六版课后习题答案全1-26章(Database system concept sixth edition after class exercise answer)
- 2021-03-07 19:29:29下载
- 积分：1
-
ACOPOSinverter_P84_Communication_Parameters
HCT-Designer Software Manual _en
- 2019-07-03 19:34:09下载
- 积分：1
