搜索资源列表
FEX
- 用java做的平面珩架结构有限元分析软件。 基本性能如下：结点数<500,单元数<1000，（具体情况视内存大小而定）在一般的微机 上，算一百节点以下的结构，基本上不用等待。-do with the plane Heng Structure finite element analysis software. The basic properties as follows : nodes lt; 500, Number of units lt; 1000, (depending
a+b
- 实现了两个大数的加法，速度很快．最大可以是５００位数的相加-realized the majority of the two Adder, very fast. It is the largest of the median combined 500
c9_estimatepi
- pi的蒙特卡罗估计 matlab源程序有5个pi的估计，每一个都是基于500次的重复随机实验-Monte Carlo estimate pi source matlab has 5 pi estimates are based on each of 500 random repeat the experiment
e3to14
- 最小二乘法仿真y=20*sin(100*pi*t+pi/3)+4*sin(200*pi*t)+10*sin(300*pi*t)+2*sin(400*pi*t)+6*sin(500*pi*t)波形-y=20*sin(100*pi*t+pi/3)+4*sin(200*pi*t)+10*sin(300*pi*t)+2*sin(400*pi*t)+6*sin(500*pi*t)
GaBin
- 遗传算法解决复杂背包问题，用Java编写。 该背包拥有3个属性，500个东西，50个包。 求解包与包之间物品重量差最小，并且同一个背包的物品属性有特殊要求。 该程序容易修改。-Genetic Algorithm on Bin Packing Proglem. 500 items, 3 parameters of each item. 50 containers, target: All 50 containers has the smallest weight differe
sushu
- 使用Eratosthenes算法编写程序，求20000以内的素数，每隔500为一个测试点，每个测试点计算五次，记录每次的运行时间求平均值，结合计算机硬件配置以及运行时间随数据规模的增大的变化情况分析计算机性能。-To write programs using the Eratosthenes algorithm, find the prime numbers less than 20,000, every 500 to a test point, the calculation for each
algorithm
- 可以计算两个小于500位整数的乘法，多项式求m次阶的系数和,大数阶乘。-Can compute the two less than 500-bit integer multiplication,M second-order polynomial coefficients of demand and, factorial of large numbers .
B20814087
- 在1~500中,找出能同时满足用3除余2,用5除余3,用7除余2的所有整数。-1 to 500, to find out to meet with more than 2 3 In addition, more than 3 by 5 in addition, more than 2 with 7 in addition to all integers.
BIG
- 该算法可以实现最多500位的大整数的乘法运算-The algorithm can achieve up to 500-bit large integer multiplication
dot
- 该算法可以实现两个至多500位的大整数或者小数的乘法运算-The algorithm can achieve up to 500 two large integers or decimal multiplication
Calculator
- 实现大整数（位数在500位内）的基本运算-Implement large integer (the median in the 500) of the basic operations
Eular-Engineering
- 自然数求和可生成三角数列.第七个三角数是1 + 2 + 3 + 4 + 5 + 6 + 7 = 28.前10个三角数列元素是: 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ... 下面列出前7个三角数及其整除数: 1: 1 3: 1,3 6: 1,2,3,6 10: 1,2,5,10 15: 1,3,5,15 21: 1,3,7,21 28: 1,2,4,7,14,28 可以看出,28是第一个有超过5个整除
radar-search-area
- this algorithm finds range of a radar which user able to replace with mouse click in a 500*500 map. Also user can create 5 obstacles and can see the all places that radar able to see!
3
- 分别编写函数实现冒泡排序、快速排序和简单插入排序算法； 2) 2路归并排序（选做） 3) 编制一个应用程序，它将随机产生的N个0~65535之间的整数插入到一个顺序表中，然后分别用上述排序算法对这个顺序表进行排序；记录并显示各种方法的运行时间； 4) 以N=500和N=5000运行这个应用程序，对算法运行的时间作比较和分析。 -Write a separate function to achieve the bubble sort, quick sort and simple
biginteger
- 适合科学计算的大数类,数字位数可达500位以上, 一般可用于科学计算,加密解密算法-Suitable for large numbers of scientific computing class, the number of digits up to more than 500, General can be used for scientific computing, encryption and decryption algorithms
Turbo_Tst
- 使用itpp通信库自己编写的Turbo码的仿真程序，包括完整的turbo码的编解码函数。交织采用随机交织（自编函数）。6分钟跑完500万个点，解码迭代次数为5次。之前的matlab程序比这个点少，还跑了3个小时。-Use itpp communication libraries have written Turbo code simulation program, including the full codec function turbo codes. Intertwined with ra
Detecting-prime-numbers
- Detecting prime numbers with C. numbers between 100-5-Detecting prime numbers with C. numbers between 100-500
FIR
- 基于DSPF28335的FIR低通滤波器代码，截止频率5-DSP28335 based on the code of FIR low-pass filter cut-off frequency of 500
eigs1
- eigs是目前为止最快速的计算部分特征值的算法，Matlab已经不提供该源代码，这是eigs源代码，供研究者改进提高！ 调用：A=rand(500), eigs1(A)-eigs is the most effective eigensolver, which is very important.
PB13011092-02.cpp
- 计算Lagrange插值函数LN (x),并用如下式子近似计算最大模误差:max{∥f (yj ) − LN (yj )∥, j = 0, 1, 2, · · · , 500} 其中,yj = − 5 + 10/500 ∗ j,j = 0,1,2,··· ,500。-Calculation of Lagrange interpolation function ln (x), and use the following formula approximate calc