-
SM3
python编写SM3密码杂凑算法,测试字符串abc, abcd*16(written in python SM3 password hash algorithm, the test string abc, abcd.* 16)
- 2012-08-04 15:34:55下载
- 积分：1
-
ekfslam_v2.0
It is a code for simulation of fast slam in matlab
- 2012-10-10 07:43:08下载
- 积分：1
-
模糊数学中典型的卡车倒车入库模拟仿真程序-kache
模糊数学中典型的卡车倒车入库模拟仿真程序，充分利用了一定的经典的模糊规则，来实现卡车倒车的模拟(typical truck reversing the arsenal of simulation procedures and make full use of a certain classic fuzzy rules to achieve the reversal of simulated truck)
- 2005-03-22 21:30:59下载
- 积分：1
-
TSWLS-NLOS
室内无线定位技术，基于两次最小二乘法的matlab仿真程序(Indoor wireless positioning technology, based on the two least-squares method matlab simulation program)
- 2013-10-27 01:06:31下载
- 积分：1
-
exa_fml_ortho_damage_umat
ABAQUS 具有强大的非线性求解能力和便捷的子程序接口及二次开发功能(The commercial FEM software ABAQUS has both powerful capacity for numerically solving varied
large-scale nonlinear problems in engineering practice and user-friendly possibility for extending
material libraries to consider the given constitutive model of a specific material.)
- 2017-10-14 21:01:22下载
- 积分：1
-
GroupDelay
说明： Group delay calculation
- 2020-06-21 19:40:01下载
- 积分：1
-
fftAna
说明： FFT（Fast Fourier Transformation）是离散傅氏变换（DFT）的快速算法 [1] 。即为快速傅氏变换。它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。(FFT (Fast Fourier Transform) is a fast algorithm of discrete Fourier Transform (DFT). That is fast Fourier transform. According to the odd, even, imaginary and real characteristics of discrete Fourier transform, the algorithm of discrete Fourier transform is improved.)
- 2020-06-21 06:00:02下载
- 积分：1
-
C__4
The only information passed from difeq to solvde is the matrix of derivatives
- 2012-08-23 22:23:00下载
- 积分：1
-
单纯形法Matlab程序-2016-11-17
一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。
从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems.
Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)
- 2018-03-27 17:22:03下载
- 积分：1
-
An-efficient-augmented-
基于经典的增广拉格朗日乘子法, 对求解一类带有特定结构（主要是针对凸规划）的非光滑等式约束优化问题, 我们提出、分析并测试了一个新算法. 在极小化增广拉格朗日函数的每一步迭代中, 该算法有效结合了带有非单调线性搜索的交替方向技术, 我们建立了算法的收敛性, 并用它来求解在带有全变差正则化的图像恢复问题.(Based on the classic augmented Lagrangian multiplier method, we propose, analyze and test an algorithm for solving a class of equality-constrained nonsmooth optimization problems (chiefly but not necessarily convex programs) with
a particular structure. The algorithm effectively combines an alternating direction
technique with a nonmonotone line search to minimize the augmented Lagrangian
function at each iteration. We establish convergence for this algorithm, and apply it
to solving problems in image reconstruction with total variation regularization.)
- 2017-01-05 15:54:19下载
- 积分：1
