搜索资源列表
amrkhaled[1].NET-GF-Pro
- this file cotane a program to use in control parental-this file cotane a program to use in control parental
liushuizuoyediaodu
- 两台计算机上安装了分别两个相同的处理器 P1 和 P2 . 现有N个任务（ jobs） J1, ... , JN 要在这两台台计算机上处理。每个任务 Ji 都被分成2个子任务 ji1 和 ji2 .这个问题相当于流水作业调度问题（这里的N个问题被分为了2N个问题，因此在流水作业调度问题中输入的任务数应为偶数，但考虑到能执行奇数个应用比较广发，则没有特殊规范要求），用动态规划算法解决： n个作业{1,2，…，n}要在由2台机器M1和M2组成的流水线上完成加工。每个作业加工的顺序都是先在M1上加
bch
- BCH(15,5,7)a communication system consists of binary source, 3 error-correcting BCH code of length 15 over GF(24) (i.e, BCH (15,5,7 code), the primitive polynomial is p(x)=1+x+x4), BPSK modulator, AWGN channel, coherent demodulator, decoder (either B
Q6a7
- 1. Write a function that prints the following Fibonacci series by using any loop. 0, 1, 1, 2, 3, 5, 8, 13, 21, ...... 2. Write a function that prints the following diagram by using one of the loops provided in C++. The number of lines and t
benyuan
- 有限域中本原元实验.本原元——有限域GF(pm)中阶最大的元素，即阶为 pm-1 的元素。-Primitive element- finite field GF (pm) in the order of the largest element, that of order pm-1 elements. Collection of the finite field GF (p) [x] refers to: coefficient of 0, ..., p-1 the polynomial of
1
- 自由空间格林公式的应用, 远场分布, 辐射功率， 增益(Free space Green's Function, far field pattern, radiated power and Gain)
多项式GCD
- 1。实现，用C／C++和MATLAB，欧几里德算法计算最大公司（GCD）的两个任意多项式在GF（2）。模拟和分析两给定阶数不小(1.Realize, by using c/c++ or Matlab, the Euclidean algorithm to calculate the greatest common division (GCD) for arbitrary two polynomials over GF(2). Simulate and analyze the calculatio
myls.c.tar
- 1 cp ls go with perfect realization done 20 vars
gf
- This simple case is used to illustrate the effect of shading a single module in a PV array of 11 modules connected in series. -PVarray1 represnt 1 PV module in the array -PVarray2 represnt 10 remaining PV modules in the array - Keep the brea
6SV 大气校正模型
- 内有GF-1计算6S大气校正模型的案例,换参数即可用，C#，exe(6sv gf-1 A case of 6S atmospheric correction model is calculated.)