-
它+ +是一个C++库的数学、信号处理和通信系统…
IT++ is a C++ library of mathematical, signal processing and communication system routines/functions. Its main use is in simulation of communication systems or for performing research in the area of communications.
- 2022-05-20 01:01:16下载
- 积分:1
-
win8UI
A small example based on Android Win8 layout, similar to the old 360 interface, but just a layout, friends who want to study can download it.
- 2020-06-22 20:00:01下载
- 积分:1
-
tidsp2407汇编程序例程,完整的源代码。
tidsp2407汇编程序例程,完整的源代码。-tidsp2407 assembler routines, complete source code.
- 2022-02-02 16:03:53下载
- 积分:1
-
地震资料处理时计算二维测线交点的程序,有弯线也能用
地震资料处理时计算二维测线交点的程序,有弯线也能用-seismic data processing, calculate 2-D lines of the intersection of procedures, it also can be used curved lines
- 2023-05-28 09:20:03下载
- 积分:1
-
IEEE30节点
用MATLAB实现基于牛顿拉尔逊法的30节点的电力系统潮流计算(Realization of power flow calculation of 30 node power system based on Newton Raphson method with MATLAB)
- 2021-03-24 09:49:14下载
- 积分:1
-
基础类库 Library
基础类库 C
- 2020-07-14 13:04:14下载
- 积分:1
-
luiseng
matlab开发工具箱中的支持向量机,是一种双隐层反向传播神经网络,基于chebyshev的水声信号分析。( matlab development toolbox support vector machine, Is a two hidden layer back propagation neural network, Based chebyshev underwater acoustic signal analysis.)
- 2016-10-12 19:20:31下载
- 积分:1
-
java写的简单贪吃蛇,用Eclipse打开,解压可见源码
java写的简单贪吃蛇,用Eclipse打开,解压可见源码-write a simple Snake(java)
- 2022-06-21 20:39:33下载
- 积分:1
-
Find prime numbers prepared by screening the function: void sieve (bool isPrime...
编写筛选查找素数函数:
void sieve(bool isPrime[], int n)
其中isPrime[ ]为一个布尔型数组,n为数组大小。由于2是第一个素数,
所以设置isPrime[0]和isPrime[1]的值为false,并设置其余的元素初值为true。
然后对从4到n-1的每一个i,判断i是否能够被2整除,如果i能够被2整除,则设置isPrime[i]为false。
对从2到n/2的每一个可能的数值重复以上处理,当操作结束时,所有值为true的isPrime[i]所对应的i就是素数,它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.
- 2023-03-02 04:45:03下载
- 积分:1
-
ZLGnet-guider
周立功的zigbee模块资料,可自动联网,zigbee协议,支持多级互联(ZLG the the zigbee module information, automatic networking, zigbee protocol to support multi-level interconnect)
- 2013-01-11 14:26:32下载
- 积分:1